@graphty/graph-io 0.3.40 → 0.3.42

package/src/formats/xgmml/emit.ts

@@ -237,19 +237,7 @@ export function membersOf(
     const edges: EdgeRec[] = [];
     let dangling = 0;
     for (const member of graph.members) {
-        if (member.href === null) {
-            if (member.kind === "node") {
-                nodes.push(member);
-            } else {
-                edges.push(member);
-            }
-            continue;
-        }
-        const id = localRef(member.href);
-        let target: NodeRec | EdgeRec | undefined;
-        if (id !== null) {
-            target = member.kind === "node" ? nodeById.get(id) : edgeById.get(id);
-        }
+        const target = resolveMember(member, nodeById, edgeById);
         if (target === undefined) {
             dangling++;
         } else if (target.kind === "node") {
@@ -261,6 +249,29 @@ export function membersOf(
     return { nodes, edges, dangling };
 }
 
+/**
+ * The record a graph member stands for: itself when declared in place, else the node or edge its
+ * local `#id` reference names.
+ * @param member - the member
+ * @param nodeById - the first node declaration of each id
+ * @param edgeById - the first edge declaration of each id
+ * @returns the record, or undefined for a cross-file, malformed or dangling reference
+ */
+function resolveMember(
+    member: NodeRec | EdgeRec,
+    nodeById: ReadonlyMap<string, NodeRec>,
+    edgeById: ReadonlyMap<string, EdgeRec>,
+): NodeRec | EdgeRec | undefined {
+    if (member.href === null) {
+        return member;
+    }
+    const id = localRef(member.href);
+    if (id === null) {
+        return undefined;
+    }
+    return member.kind === "node" ? nodeById.get(id) : edgeById.get(id);
+}
+
 /**
  * The first declaration of each id.
  * @param records - node or edge records
@@ -276,6 +287,42 @@ function indexById<T extends NodeRec | EdgeRec>(records: readonly T[]): Map<stri
     return out;
 }
 
+/**
+ * Whether an edge repeats one already seen, remembering it otherwise: a repeat has the same id,
+ * or without one the same label and endpoints.
+ * @param seen - the keys seen so far, or null when repeats are kept
+ * @param record - the edge
+ * @returns true for a repeat
+ */
+function isRepeat(seen: Set<string> | null, record: EdgeRec): boolean {
+    if (seen === null) {
+        return false;
+    }
+    const key =
+        record.id ?? (record.label === null ? null : JSON.stringify([record.label, record.source, record.target]));
+    if (key === null) {
+        return false;
+    }
+    if (seen.has(key)) {
+        return true;
+    }
+    seen.add(key);
+    return false;
+}
+
+/**
+ * Whether a graph's att is one of its values: not RDF metadata, not the unnamed holder of a
+ * nested graph.
+ * @param att - the att
+ * @returns true to write it to the graph table
+ */
+function isGraphValueAtt(att: AttRec): boolean {
+    if (att.name !== null && META_ATTS.has(att.name)) {
+        return false;
+    }
+    return !(att.hasGraph && att.name === null);
+}
+
 /** Per-node state while emitting. */
 interface NodeRow {
     readonly id: string;
@@ -731,16 +778,7 @@ export class XgmmlEmitter {
             if (graph.owner !== null && isGroup(graph.owner)) {
                 continue;
             }
-            for (const member of graph.members) {
-                if (member.href === null) {
-                    continue;
-                }
-                const id = localRef(member.href);
-                const known = id !== null && (member.kind === "node" ? this.rows.has(id) : edgeIds.has(id));
-                if (!known) {
-                    dangling++;
-                }
-            }
+            dangling += this.danglingReferences(graph, edgeIds);
         }
         if (dangling > 0) {
             this.report.warning(
@@ -751,6 +789,27 @@ export class XgmmlEmitter {
         }
     }
 
+    /**
+     * How many `xlink:href` members of a graph name no node or edge of the document.
+     * @param graph - the graph
+     * @param edgeIds - the id of every edge
+     * @returns the count
+     */
+    private danglingReferences(graph: GraphRec, edgeIds: ReadonlySet<string | null>): number {
+        let dangling = 0;
+        for (const member of graph.members) {
+            if (member.href === null) {
+                continue;
+            }
+            const id = localRef(member.href);
+            const known = id !== null && (member.kind === "node" ? this.rows.has(id) : edgeIds.has(id));
+            if (!known) {
+                dangling++;
+            }
+        }
+        return dangling;
+    }
+
     /**
      * Write the per-node values: label, attributes, XML attributes, graphics, positions, nested
      * network pointers and subgraph memberships.
@@ -966,17 +1025,10 @@ export class XgmmlEmitter {
         this.decideNameLabel("edge", records);
         for (const record of records) {
             const where = { line: record.line, element: record.id ?? record.label };
-            // a repeat has the same id, or without one the same label and endpoints
-            const key =
-                record.id ??
-                (record.label === null ? null : JSON.stringify([record.label, record.source, record.target]));
-            if (dedupe !== null && key !== null) {
-                if (dedupe.has(key)) {
-                    repeats++;
-                    firstRepeat ??= where;
-                    continue;
-                }
-                dedupe.add(key);
+            if (isRepeat(dedupe, record)) {
+                repeats++;
+                firstRepeat ??= where;
+                continue;
             }
             const index = this.addEdge(record, header, ids, where);
             this.checkAbort();
@@ -1244,13 +1296,9 @@ export class XgmmlEmitter {
             }
         }
         for (const att of g.atts) {
-            if (att.name !== null && META_ATTS.has(att.name)) {
-                continue;
-            }
-            if (att.hasGraph && att.name === null) {
-                continue;
+            if (isGraphValueAtt(att)) {
+                this.graphColumns.addAtt(0, att, where);
             }
-            this.graphColumns.addAtt(0, att, where);
         }
         this.graphColumns.write(this.sink, () => 0);
         const json: Record<string, unknown> = { ...this.extras.graphJson };

package/src/formats/xgmml/exporter.ts

@@ -394,6 +394,17 @@ function slotOf(column: Column, domain: "graph" | "node" | "edge", hasLabelRole:
     if (domain !== "node") {
         return "att";
     }
+    return nodeSlotOf(column);
+}
+
+/**
+ * Where a node column goes when it is no XML attribute, label or graphics: one of the node-only
+ * slots, else a typed att.
+ * @param column - the column
+ * @returns the slot
+ */
+function nodeSlotOf(column: Column): ColumnWrite["kind"] {
+    const { meta } = column;
     if (meta.name === Z_COLUMN && meta.dtype === "f64" && meta.role === null) {
         return "z";
     }
@@ -1004,18 +1015,7 @@ function cellOf(column: Column | null, row: number): unknown {
  * @returns the coordinates as XML attributes
  */
 function coordsOf(plan: Plan, zColumn: Column | null, node: number): [string, string][] {
-    const out: [string, string][] = [];
-    const xyz = cellOf(plan.position, node);
-    if (xyz !== null) {
-        const [x, y, z] = Array.from(xyz as ArrayLike<number>);
-        const fmt = plan.position?.dtype === "f32" ? formatF32 : formatF64;
-        if (Number.isFinite(x) && Number.isFinite(y)) {
-            out.push(["x", fmt(x)], ["y", fmt(y === 0 ? 0 : -y)]);
-            if (zColumn === null && z !== undefined && z !== 0 && Number.isFinite(z)) {
-                out.push(["z", fmt(z)]);
-            }
-        }
-    }
+    const out = positionCoordsOf(plan, zColumn, node);
     const z = cellOf(zColumn, node);
     if (typeof z === "number") {
         out.push(["z", formatF64(z)]);
@@ -1023,6 +1023,34 @@ function coordsOf(plan: Plan, zColumn: Column | null, node: number): [string, st
     return out;
 }
 
+/**
+ * The graphics coordinates a node's position gives: x, y negated back to screen coordinates, and
+ * z when no z column carries it.
+ * @param plan - the plan
+ * @param zColumn - the z column, or null
+ * @param node - the node
+ * @returns the coordinates as XML attributes (none for an unset or non-finite position)
+ */
+function positionCoordsOf(plan: Plan, zColumn: Column | null, node: number): [string, string][] {
+    const xyz = cellOf(plan.position, node);
+    if (xyz === null) {
+        return [];
+    }
+    const [x, y, z] = Array.from(xyz as ArrayLike<number>);
+    if (!Number.isFinite(x) || !Number.isFinite(y)) {
+        return [];
+    }
+    const fmt = plan.position?.dtype === "f32" ? formatF32 : formatF64;
+    const out: [string, string][] = [
+        ["x", fmt(x)],
+        ["y", fmt(y === 0 ? 0 : -y)],
+    ];
+    if (zColumn === null && z !== undefined && z !== 0 && Number.isFinite(z)) {
+        out.push(["z", fmt(z)]);
+    }
+    return out;
+}
+
 /**
  * The group marker and the nested `<graph>` of a group node: its own id, label and atts, and an
  * `xlink:href` to each child.

package/src/formats/xgmml/importer.ts

@@ -174,23 +174,7 @@ export async function parseXgmml(
     common: ResolvedImportOptions,
     options: XgmmlImportOptions | undefined,
 ): Promise<XgmmlDocument> {
-    const repairs: XmlRepairs = {
-        bareAmpersand: booleanOption("repairBareAmpersands", options?.repairBareAmpersands, false)
-            ? (line): void => {
-                  report.warning("parse-error", XGMML_ISSUE.AMPERSAND_REPAIRED, "a bare & was read as &amp;", { line });
-              }
-            : undefined,
-        surrogatePair: booleanOption("pairSurrogateReferences", options?.pairSurrogateReferences, false)
-            ? (line): void => {
-                  report.warning(
-                      "parse-error",
-                      XGMML_ISSUE.SURROGATE_PAIRED,
-                      "two surrogate character references were joined into one character",
-                      { line },
-                  );
-              }
-            : undefined,
-    };
+    const repairs = repairsOf(options, report);
     const parser = new XgmmlParser(report);
     const seen = { content: false };
     try {
@@ -200,12 +184,7 @@ export async function parseXgmml(
             repairs,
         );
     } catch (err) {
-        if (err instanceof XmlSyntaxError) {
-            if (!seen.content) {
-                report.fail(XGMML_ISSUE.EMPTY_INPUT, "the input is empty");
-            }
-            report.fail(XGMML_ISSUE.XML_SYNTAX, err.message, { line: err.line });
-        }
+        failOnSyntax(err, seen.content, report);
         throw err;
     }
     const doc = parser.document();
@@ -220,6 +199,49 @@ export async function parseXgmml(
     return doc;
 }
 
+/**
+ * The XML repairs the options switch on, each reporting where it repaired.
+ * @param options - the XGMML options
+ * @param report - the report
+ * @returns the repairs
+ */
+function repairsOf(options: XgmmlImportOptions | undefined, report: ImportReportBuilder): XmlRepairs {
+    return {
+        bareAmpersand: booleanOption("repairBareAmpersands", options?.repairBareAmpersands, false)
+            ? (line): void => {
+                  report.warning("parse-error", XGMML_ISSUE.AMPERSAND_REPAIRED, "a bare & was read as &amp;", { line });
+              }
+            : undefined,
+        surrogatePair: booleanOption("pairSurrogateReferences", options?.pairSurrogateReferences, false)
+            ? (line): void => {
+                  report.warning(
+                      "parse-error",
+                      XGMML_ISSUE.SURROGATE_PAIRED,
+                      "two surrogate character references were joined into one character",
+                      { line },
+                  );
+              }
+            : undefined,
+    };
+}
+
+/**
+ * Fail the report on an XML syntax error: an input with no content is empty, any other is
+ * malformed. Any other error is left to the caller.
+ * @param err - the error the tokenizer threw
+ * @param content - whether non-whitespace text was seen
+ * @param report - the report
+ */
+function failOnSyntax(err: unknown, content: boolean, report: ImportReportBuilder): void {
+    if (!(err instanceof XmlSyntaxError)) {
+        return;
+    }
+    if (!content) {
+        report.fail(XGMML_ISSUE.EMPTY_INPUT, "the input is empty");
+    }
+    report.fail(XGMML_ISSUE.XML_SYNTAX, err.message, { line: err.line });
+}
+
 /**
  * Pass text chunks through while noting non-whitespace content.
  * @param chunks - the chunks

package/src/sniff.ts

@@ -356,40 +356,57 @@ function skeletonOf(text: string): unknown {
     }
     const root: Record<string, unknown> = {};
     for (const key of rootKeys) {
-        switch (key) {
-            case "graph":
-            case "options":
-                root[key] = objectOf(keys.get(key));
-                break;
-            case "graphs": {
-                // the keys of any node or edge of the first graph: OBO Graphs or JGF (design 1.6)
-                const nodes = keys.get("graphs[0].nodes[]");
-                const edges = keys.get("graphs[0].edges[]");
-                const graph: Record<string, unknown> = {};
-                if (nodes !== undefined) {
-                    graph.nodes = [objectOf(nodes)];
-                }
-                if (edges !== undefined) {
-                    graph.edges = [objectOf(edges)];
-                }
-                root[key] = nodes === undefined && edges === undefined ? [] : [graph];
-                break;
-            }
-            case "nodes":
-            case "edges":
-            case "links": {
-                const first = keys.get(`${key}[0]`);
-                root[key] = first === undefined ? [] : [objectOf(first)];
-                break;
-            }
-            default:
-                root[key] = true;
-                break;
-        }
+        root[key] = placeholderOf(key, keys);
     }
     return root;
 }
 
+/**
+ * The placeholder value of a root key: the shape the dialect rule tests that key for.
+ * @param key - the root key
+ * @param keys - the key sets by path
+ * @returns the placeholder
+ */
+function placeholderOf(key: string, keys: ReadonlyMap<KeyPath, Set<string>>): unknown {
+    switch (key) {
+        case "graph":
+        case "options":
+            return objectOf(keys.get(key));
+        case "graphs":
+            return graphsPlaceholder(keys);
+        case "nodes":
+        case "edges":
+        case "links": {
+            const first = keys.get(`${key}[0]`);
+            return first === undefined ? [] : [objectOf(first)];
+        }
+        default:
+            return true;
+    }
+}
+
+/**
+ * The placeholder of `graphs`: the keys of any node or edge of the first graph, which tell OBO
+ * Graphs from JGF (design 1.6).
+ * @param keys - the key sets by path
+ * @returns `[]` when neither was seen, else one graph holding them
+ */
+function graphsPlaceholder(keys: ReadonlyMap<KeyPath, Set<string>>): unknown[] {
+    const nodes = keys.get("graphs[0].nodes[]");
+    const edges = keys.get("graphs[0].edges[]");
+    if (nodes === undefined && edges === undefined) {
+        return [];
+    }
+    const graph: Record<string, unknown> = {};
+    if (nodes !== undefined) {
+        graph.nodes = [objectOf(nodes)];
+    }
+    if (edges !== undefined) {
+        graph.edges = [objectOf(edges)];
+    }
+    return [graph];
+}
+
 /**
  * An object holding placeholder values for a key set: `{}` for the keys the rule tests with
  * isJsonObject (`attributes`, `data`), `true` otherwise.
@@ -424,34 +441,6 @@ function scanKeys(text: string): Map<KeyPath, Set<string>> {
     const counts: number[] = [];
     let pendingKey: string | null = null;
     let expectingKey = false;
-    const pathOf = (): KeyPath | null => {
-        const depth = kinds.length;
-        if (depth === 1) {
-            return kinds[0] === "object" ? "" : null;
-        }
-        if (depth === 2 && kinds[0] === "array" && kinds[1] === "object" && labels[1] === "0") {
-            return "nodes[0]";
-        }
-        if (depth === 2 && kinds[0] === "object" && kinds[1] === "object") {
-            return labels[1] === "graph" || labels[1] === "options" ? labels[1] : null;
-        }
-        if (
-            depth === 5 &&
-            kinds.join() === "object,array,object,array,object" &&
-            labels[1] === "graphs" &&
-            labels[2] === "0" &&
-            (labels[3] === "nodes" || labels[3] === "edges")
-        ) {
-            return labels[3] === "nodes" ? "graphs[0].nodes[]" : "graphs[0].edges[]";
-        }
-        if (depth === 3 && kinds[0] === "object" && kinds[1] === "array" && kinds[2] === "object") {
-            const section = labels[1];
-            if ((section === "nodes" || section === "edges" || section === "links") && labels[2] === "0") {
-                return `${section}[0]`;
-            }
-        }
-        return null;
-    };
     let i = 0;
     const n = text.length;
     while (i < n) {
@@ -487,7 +476,7 @@ function scanKeys(text: string): Map<KeyPath, Set<string>> {
             pendingKey = null;
         } else if (ch === ":") {
             if (pendingKey !== null) {
-                const path = pathOf();
+                const path = keyPathOf(kinds, labels);
                 if (path !== null) {
                     let set = found.get(path);
                     if (set === undefined) {
@@ -510,6 +499,73 @@ function scanKeys(text: string): Map<KeyPath, Set<string>> {
     return found;
 }
 
+/**
+ * The watched path of the innermost open object, from the container stack.
+ * @param kinds - the kind of each open container, outermost first
+ * @param labels - the key or index each open container sits under
+ * @returns the path, or null when keys there are not watched
+ */
+function keyPathOf(kinds: readonly ("object" | "array")[], labels: readonly string[]): KeyPath | null {
+    switch (kinds.length) {
+        case 1:
+            return kinds[0] === "object" ? "" : null;
+        case 2:
+            return nestedObjectPath(kinds, labels);
+        case 3:
+            return sectionElementPath(kinds, labels);
+        case 5:
+            return graphsMemberPath(kinds, labels);
+        default:
+            return null;
+    }
+}
+
+/**
+ * At depth 2: the first element of a top-level array, or the `graph` / `options` object.
+ * @param kinds - the kind of each open container, outermost first
+ * @param labels - the key or index each open container sits under
+ * @returns the path, or null
+ */
+function nestedObjectPath(kinds: readonly ("object" | "array")[], labels: readonly string[]): KeyPath | null {
+    if (kinds[0] === "array" && kinds[1] === "object" && labels[1] === "0") {
+        return "nodes[0]";
+    }
+    if (kinds[0] === "object" && kinds[1] === "object") {
+        return labels[1] === "graph" || labels[1] === "options" ? labels[1] : null;
+    }
+    return null;
+}
+
+/**
+ * At depth 3: the first element of the root's `nodes`, `edges` or `links` array.
+ * @param kinds - the kind of each open container, outermost first
+ * @param labels - the key or index each open container sits under
+ * @returns the path, or null
+ */
+function sectionElementPath(kinds: readonly ("object" | "array")[], labels: readonly string[]): KeyPath | null {
+    if (kinds[0] !== "object" || kinds[1] !== "array" || kinds[2] !== "object" || labels[2] !== "0") {
+        return null;
+    }
+    const section = labels[1];
+    return section === "nodes" || section === "edges" || section === "links" ? `${section}[0]` : null;
+}
+
+/**
+ * At depth 5: any node or edge of the first graph of the root's `graphs` array.
+ * @param kinds - the kind of each open container, outermost first
+ * @param labels - the key or index each open container sits under
+ * @returns the path, or null
+ */
+function graphsMemberPath(kinds: readonly ("object" | "array")[], labels: readonly string[]): KeyPath | null {
+    if (kinds.join() !== "object,array,object,array,object" || labels[1] !== "graphs" || labels[2] !== "0") {
+        return null;
+    }
+    if (labels[3] === "nodes") {
+        return "graphs[0].nodes[]";
+    }
+    return labels[3] === "edges" ? "graphs[0].edges[]" : null;
+}
+
 /**
  * The index of the closing quote of a JSON string starting after its opening quote.
  * @param text - the text

package/dist/chunks/children-CL3Cy0ez.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"children-CL3Cy0ez.js","sources":["../../src/children.ts"],"sourcesContent":["/**\n * The children CSR over a containment column: containment\n * (GEXF `pid` / `<parents>`, Cytoscape `parent`, DOT clusters, GraphML nested graphs) is a node\n * column with the `parent` role (u32, refersTo node) or the `parents` role (list of u32) and never\n * enters the CSR of the snapshot. Importers and exporters that need to walk containers top-down\n * (nested subgraphs, cluster blocks, parent lists) build this inverse index once: for every node\n * `u`, `children[rowPtr[u] .. rowPtr[u + 1])` are its children in ascending index order, `roots`\n * are the nodes with no parent, and `depthFirst()` is the pre-order the nested writers use.\n *\n * The helper is deliberately outside the core (7.1: it computes a property the arrays do not\n * already imply and only io needs it). A reference is ignored when it is unset, INVALID_INDEX, out\n * of range, or the node itself; a cycle (a parent chain that never reaches a root) is reported\n * through `unreachable` and its members are appended to the depth-first order in index order so\n * every node is written exactly once.\n */\n\nimport { type Column, type GraphSnapshot, INVALID_INDEX } from \"@graphty/graph-format\";\n\n/**\n * The role of the column a children CSR is built over.\n * @category Plugin helpers\n */\nexport type ContainmentRole = \"parent\" | \"parents\";\n\n/**\n * How the CSR is built: from a role column of the snapshot (default `parent`, then `parents`) or an explicit column.\n * @category Plugin helpers\n */\nexport interface ChildrenOptions {\n    /**\n     * The column to read: a role name (`parent` for the u32 single-parent column, `parents` for\n     * the list column) or a column object of either shape; \"auto\" (default) takes the `parent`\n     * role column when the snapshot has one, else `parents`, else no containment; null builds\n     * the empty CSR (every node a root) whatever the snapshot holds.\n     */\n    readonly column?: ContainmentRole | Column | \"auto\" | null | undefined;\n}\n\n/**\n * One depth-first traversal of the containment forest.\n * @category Plugin helpers\n */\nexport interface DepthFirstOrder {\n    /** Every node index exactly once: roots in index order, each followed by its descendants, cycle members last. */\n    readonly order: Uint32Array;\n    /** The depth of every node in the traversal (0 for a root or a cycle member forced to the top). */\n    readonly depth: Uint32Array;\n    /** Whether `order` differs from `0..n-1`. */\n    readonly reordered: boolean;\n}\n\n/**\n * The children CSR of a snapshot's containment column: the inverse\n * of the parent relation as a compressed sparse row structure over node indices.\n * @category Plugin helpers\n */\nexport class ChildrenCsr {\n    /** The number of nodes (the row count of the CSR). */\n    readonly nodeCount: number;\n    /** `rowPtr[u] .. rowPtr[u + 1]` is the range of `children` holding the children of `u`; length nodeCount + 1. */\n    readonly rowPtr: Uint32Array;\n    /** Child node indices, ascending within each parent's range. */\n    readonly children: Uint32Array;\n    /** The nodes with no (valid) parent, in index order. */\n    readonly roots: Uint32Array;\n    /** Every (child, parent) reference kept; equal to `children.length`. */\n    readonly edgeCount: number;\n    /** References dropped because they were INVALID_INDEX, out of range or self-references. */\n    readonly dropped: number;\n    /** Nodes whose parent chain never reaches a root (members of a cycle), counted once each. */\n    readonly unreachable: number;\n    /** The column the CSR was built from, or null when the snapshot has no containment. */\n    readonly column: Column | null;\n\n    private readonly parentCount: Uint32Array;\n\n    /**\n     * Build the CSR; use childrenCsr() rather than the constructor.\n     * @param nodeCount - the node count\n     * @param rowPtr - the row pointers\n     * @param children - the child list\n     * @param parentCount - parents per node (0 for a root)\n     * @param dropped - references ignored\n     * @param column - the source column, or null\n     */\n    constructor(\n        nodeCount: number,\n        rowPtr: Uint32Array,\n        children: Uint32Array,\n        parentCount: Uint32Array,\n        dropped: number,\n        column: Column | null,\n    ) {\n        this.nodeCount = nodeCount;\n        this.rowPtr = rowPtr;\n        this.children = children;\n        this.parentCount = parentCount;\n        this.edgeCount = children.length;\n        this.dropped = dropped;\n        this.column = column;\n        let rootCount = 0;\n        for (let u = 0; u < nodeCount; u++) {\n            if (parentCount[u] === 0) {\n                rootCount++;\n            }\n        }\n        const roots = new Uint32Array(rootCount);\n        let r = 0;\n        for (let u = 0; u < nodeCount; u++) {\n            if (parentCount[u] === 0) {\n                roots[r++] = u;\n            }\n        }\n        this.roots = roots;\n        this.unreachable = nodeCount - this.reachableCount();\n    }\n\n    /**\n     * The children of a node, as a view into `children` (do not modify).\n     * @param node - the node index\n     * @returns the child indices in ascending order; empty for a leaf\n     */\n    childrenOf(node: number): Uint32Array {\n        return this.children.subarray(this.rowPtr[node], this.rowPtr[node + 1]);\n    }\n\n    /**\n     * How many children a node has.\n     * @param node - the node index\n     * @returns the count\n     */\n    childCount(node: number): number {\n        return this.rowPtr[node + 1] - this.rowPtr[node];\n    }\n\n    /**\n     * Whether a node is a container (has at least one child).\n     * @param node - the node index\n     * @returns true when it has children\n     */\n    hasChildren(node: number): boolean {\n        return this.rowPtr[node + 1] > this.rowPtr[node];\n    }\n\n    /**\n     * How many parents a node has: 0 for a root, 1 under a `parent` column, any number under `parents`.\n     * @param node - the node index\n     * @returns the parent count\n     */\n    parentCountOf(node: number): number {\n        return this.parentCount[node];\n    }\n\n    /**\n     * Whether a node has no parent.\n     * @param node - the node index\n     * @returns true for a root\n     */\n    isRoot(node: number): boolean {\n        return this.parentCount[node] === 0;\n    }\n\n    /**\n     * Whether the snapshot has any containment at all.\n     * @returns true when at least one child reference was kept\n     */\n    isEmpty(): boolean {\n        return this.edgeCount === 0;\n    }\n\n    /**\n     * A pre-order depth-first traversal from the roots in index order (children in ascending\n     * order), then every node not yet visited (a cycle member, or a multi-parent node reached\n     * only through a cycle) in index order at depth 0. Each node appears exactly once, so nested\n     * writers emit every element once even for a `parents` column that shares a child.\n     * @returns the order, the depth of every node and whether the order differs from index order\n     */\n    depthFirst(): DepthFirstOrder {\n        const n = this.nodeCount;\n        const order = new Uint32Array(n);\n        const depth = new Uint32Array(n);\n        const visited = new Uint8Array(n);\n        const stackNode: number[] = [];\n        const stackCursor: number[] = [];\n        let position = 0;\n        let reordered = false;\n        const place = (u: number, d: number): void => {\n            visited[u] = 1;\n            if (u !== position) {\n                reordered = true;\n            }\n            order[position++] = u;\n            depth[u] = d;\n        };\n        const visit = (root: number): void => {\n            place(root, 0);\n            stackNode.push(root);\n            stackCursor.push(this.rowPtr[root]);\n            while (stackNode.length > 0) {\n                const top = stackNode.length - 1;\n                const u = stackNode[top];\n                const cursor = stackCursor[top];\n                if (cursor >= this.rowPtr[u + 1]) {\n                    stackNode.pop();\n                    stackCursor.pop();\n                    continue;\n                }\n                stackCursor[top] = cursor + 1;\n                const v = this.children[cursor];\n                if (visited[v] === 1) {\n                    continue;\n                }\n                place(v, stackNode.length);\n                stackNode.push(v);\n                stackCursor.push(this.rowPtr[v]);\n            }\n        };\n        for (const root of this.roots) {\n            visit(root);\n        }\n        for (let u = 0; u < n; u++) {\n            if (visited[u] === 0) {\n                visit(u);\n            }\n        }\n        return { order, depth, reordered };\n    }\n\n    /**\n     * The nodes reachable from the roots by following child references.\n     * @returns how many nodes a traversal from the roots reaches\n     */\n    private reachableCount(): number {\n        const visited = new Uint8Array(this.nodeCount);\n        // every node is pushed at most once, so a stack of nodeCount entries never overflows\n        const stack = new Uint32Array(this.nodeCount);\n        let top = 0;\n        let count = 0;\n        for (const root of this.roots) {\n            visited[root] = 1;\n            count++;\n            stack[top++] = root;\n            while (top > 0) {\n                const u = stack[--top];\n                for (let k = this.rowPtr[u]; k < this.rowPtr[u + 1]; k++) {\n                    const v = this.children[k];\n                    if (visited[v] === 0) {\n                        visited[v] = 1;\n                        count++;\n                        stack[top++] = v;\n                    }\n                }\n            }\n        }\n        return count;\n    }\n}\n\n/**\n * Build the children CSR of a snapshot.\n * @param snapshot - the snapshot\n * @param options - which column to read; the `parent` role, then `parents`, by default\n * @returns the CSR; empty (every node a root) when the snapshot has no containment column\n * @category Plugin helpers\n */\nexport function childrenCsr(snapshot: GraphSnapshot, options: ChildrenOptions = {}): ChildrenCsr {\n    const column = resolveColumn(snapshot, options.column === undefined ? \"auto\" : options.column);\n    return childrenFromColumn(snapshot.nodeCount, column);\n}\n\n/**\n * Build the children CSR over one containment column without a snapshot (an importer that holds\n * the column before freezing, a test).\n * @param nodeCount - the node count the references index into\n * @param column - a u32 `parent`-shaped column, a list-of-u32 `parents`-shaped column, or null for none\n * @returns the CSR\n * @category Plugin helpers\n */\nexport function childrenFromColumn(nodeCount: number, column: Column | null): ChildrenCsr {\n    const rowPtr = new Uint32Array(nodeCount + 1);\n    const parentCount = new Uint32Array(nodeCount);\n    let dropped = 0;\n    const references: number[] = [];\n    if (column !== null) {\n        const rows = Math.min(column.length, nodeCount);\n        const keep = (child: number, parent: number): void => {\n            if (!Number.isInteger(parent) || parent === INVALID_INDEX || parent >= nodeCount || parent === child) {\n                dropped++;\n                return;\n            }\n            references.push(child, parent);\n            rowPtr[parent + 1]++;\n            parentCount[child]++;\n        };\n        if (column.dtype === \"u32\") {\n            const { data } = column;\n            for (let i = 0; i < rows; i++) {\n                if (column.isSet(i)) {\n                    keep(i, data[i]);\n                }\n            }\n        } else if (column.dtype === \"list\") {\n            for (let i = 0; i < rows; i++) {\n                if (!column.isSet(i)) {\n                    continue;\n                }\n                for (const item of column.sliceOf(i)) {\n                    if (typeof item === \"number\") {\n                        keep(i, item);\n                    } else {\n                        dropped++;\n                    }\n                }\n            }\n        } else {\n            throw new TypeError(\n                `a containment column must be u32 or a list of u32, found ${column.dtype} column \"${column.meta.name}\"`,\n            );\n        }\n    }\n    for (let u = 0; u < nodeCount; u++) {\n        rowPtr[u + 1] += rowPtr[u];\n    }\n    const children = new Uint32Array(rowPtr[nodeCount]);\n    const fill = rowPtr.slice(0, nodeCount);\n    // references were collected in ascending child order, so each parent's range fills ascending\n    for (let k = 0; k < references.length; k += 2) {\n        children[fill[references[k + 1]]++] = references[k];\n    }\n    return new ChildrenCsr(nodeCount, rowPtr, children, parentCount, dropped, column);\n}\n\n/**\n * The column a ChildrenOptions selects.\n * @param snapshot - the snapshot\n * @param choice - the option value\n * @returns the column, or null when the snapshot has none of that shape\n */\nfunction resolveColumn(snapshot: GraphSnapshot, choice: ContainmentRole | Column | \"auto\" | null): Column | null {\n    if (typeof choice !== \"string\") {\n        return choice;\n    }\n    if (choice === \"parent\" || choice === \"parents\") {\n        return snapshot.nodes.byRole(choice);\n    }\n    return snapshot.nodes.byRole(\"parent\") ?? snapshot.nodes.byRole(\"parents\");\n}\n"],"names":[],"mappings":";AAwDO,MAAM,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA6BrB,YACI,WACA,QACA,UACA,aACA,SACA,QACF;AACE,SAAK,YAAY;AACjB,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,cAAc;AACnB,SAAK,YAAY,SAAS;AAC1B,SAAK,UAAU;AACf,SAAK,SAAS;AACd,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,UAAI,YAAY,CAAC,MAAM,GAAG;AACtB;AAAA,MACJ;AAAA,IACJ;AACA,UAAM,QAAQ,IAAI,YAAY,SAAS;AACvC,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,UAAI,YAAY,CAAC,MAAM,GAAG;AACtB,cAAM,GAAG,IAAI;AAAA,MACjB;AAAA,IACJ;AACA,SAAK,QAAQ;AACb,SAAK,cAAc,YAAY,KAAK,eAAA;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,MAA2B;AAClC,WAAO,KAAK,SAAS,SAAS,KAAK,OAAO,IAAI,GAAG,KAAK,OAAO,OAAO,CAAC,CAAC;AAAA,EAC1E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,MAAsB;AAC7B,WAAO,KAAK,OAAO,OAAO,CAAC,IAAI,KAAK,OAAO,IAAI;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,MAAuB;AAC/B,WAAO,KAAK,OAAO,OAAO,CAAC,IAAI,KAAK,OAAO,IAAI;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,MAAsB;AAChC,WAAO,KAAK,YAAY,IAAI;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,MAAuB;AAC1B,WAAO,KAAK,YAAY,IAAI,MAAM;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAmB;AACf,WAAO,KAAK,cAAc;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAA8B;AAC1B,UAAM,IAAI,KAAK;AACf,UAAM,QAAQ,IAAI,YAAY,CAAC;AAC/B,UAAM,QAAQ,IAAI,YAAY,CAAC;AAC/B,UAAM,UAAU,IAAI,WAAW,CAAC;AAChC,UAAM,YAAsB,CAAA;AAC5B,UAAM,cAAwB,CAAA;AAC9B,QAAI,WAAW;AACf,QAAI,YAAY;AAChB,UAAM,QAAQ,CAAC,GAAW,MAAoB;AAC1C,cAAQ,CAAC,IAAI;AACb,UAAI,MAAM,UAAU;AAChB,oBAAY;AAAA,MAChB;AACA,YAAM,UAAU,IAAI;AACpB,YAAM,CAAC,IAAI;AAAA,IACf;AACA,UAAM,QAAQ,CAAC,SAAuB;AAClC,YAAM,MAAM,CAAC;AACb,gBAAU,KAAK,IAAI;AACnB,kBAAY,KAAK,KAAK,OAAO,IAAI,CAAC;AAClC,aAAO,UAAU,SAAS,GAAG;AACzB,cAAM,MAAM,UAAU,SAAS;AAC/B,cAAM,IAAI,UAAU,GAAG;AACvB,cAAM,SAAS,YAAY,GAAG;AAC9B,YAAI,UAAU,KAAK,OAAO,IAAI,CAAC,GAAG;AAC9B,oBAAU,IAAA;AACV,sBAAY,IAAA;AACZ;AAAA,QACJ;AACA,oBAAY,GAAG,IAAI,SAAS;AAC5B,cAAM,IAAI,KAAK,SAAS,MAAM;AAC9B,YAAI,QAAQ,CAAC,MAAM,GAAG;AAClB;AAAA,QACJ;AACA,cAAM,GAAG,UAAU,MAAM;AACzB,kBAAU,KAAK,CAAC;AAChB,oBAAY,KAAK,KAAK,OAAO,CAAC,CAAC;AAAA,MACnC;AAAA,IACJ;AACA,eAAW,QAAQ,KAAK,OAAO;AAC3B,YAAM,IAAI;AAAA,IACd;AACA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,UAAI,QAAQ,CAAC,MAAM,GAAG;AAClB,cAAM,CAAC;AAAA,MACX;AAAA,IACJ;AACA,WAAO,EAAE,OAAO,OAAO,UAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAAyB;AAC7B,UAAM,UAAU,IAAI,WAAW,KAAK,SAAS;AAE7C,UAAM,QAAQ,IAAI,YAAY,KAAK,SAAS;AAC5C,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,eAAW,QAAQ,KAAK,OAAO;AAC3B,cAAQ,IAAI,IAAI;AAChB;AACA,YAAM,KAAK,IAAI;AACf,aAAO,MAAM,GAAG;AACZ,cAAM,IAAI,MAAM,EAAE,GAAG;AACrB,iBAAS,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,KAAK;AACtD,gBAAM,IAAI,KAAK,SAAS,CAAC;AACzB,cAAI,QAAQ,CAAC,MAAM,GAAG;AAClB,oBAAQ,CAAC,IAAI;AACb;AACA,kBAAM,KAAK,IAAI;AAAA,UACnB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AASO,SAAS,YAAY,UAAyB,UAA2B,IAAiB;AAC7F,QAAM,SAAS,cAAc,UAAU,QAAQ,WAAW,SAAY,SAAS,QAAQ,MAAM;AAC7F,SAAO,mBAAmB,SAAS,WAAW,MAAM;AACxD;AAUO,SAAS,mBAAmB,WAAmB,QAAoC;AACtF,QAAM,SAAS,IAAI,YAAY,YAAY,CAAC;AAC5C,QAAM,cAAc,IAAI,YAAY,SAAS;AAC7C,MAAI,UAAU;AACd,QAAM,aAAuB,CAAA;AAC7B,MAAI,WAAW,MAAM;AACjB,UAAM,OAAO,KAAK,IAAI,OAAO,QAAQ,SAAS;AAC9C,UAAM,OAAO,CAAC,OAAe,WAAyB;AAClD,UAAI,CAAC,OAAO,UAAU,MAAM,KAAK,WAAW,iBAAiB,UAAU,aAAa,WAAW,OAAO;AAClG;AACA;AAAA,MACJ;AACA,iBAAW,KAAK,OAAO,MAAM;AAC7B,aAAO,SAAS,CAAC;AACjB,kBAAY,KAAK;AAAA,IACrB;AACA,QAAI,OAAO,UAAU,OAAO;AACxB,YAAM,EAAE,SAAS;AACjB,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,YAAI,OAAO,MAAM,CAAC,GAAG;AACjB,eAAK,GAAG,KAAK,CAAC,CAAC;AAAA,QACnB;AAAA,MACJ;AAAA,IACJ,WAAW,OAAO,UAAU,QAAQ;AAChC,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC3B,YAAI,CAAC,OAAO,MAAM,CAAC,GAAG;AAClB;AAAA,QACJ;AACA,mBAAW,QAAQ,OAAO,QAAQ,CAAC,GAAG;AAClC,cAAI,OAAO,SAAS,UAAU;AAC1B,iBAAK,GAAG,IAAI;AAAA,UAChB,OAAO;AACH;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ,OAAO;AACH,YAAM,IAAI;AAAA,QACN,4DAA4D,OAAO,KAAK,YAAY,OAAO,KAAK,IAAI;AAAA,MAAA;AAAA,IAE5G;AAAA,EACJ;AACA,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,WAAO,IAAI,CAAC,KAAK,OAAO,CAAC;AAAA,EAC7B;AACA,QAAM,WAAW,IAAI,YAAY,OAAO,SAAS,CAAC;AAClD,QAAM,OAAO,OAAO,MAAM,GAAG,SAAS;AAEtC,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC3C,aAAS,KAAK,WAAW,IAAI,CAAC,CAAC,GAAG,IAAI,WAAW,CAAC;AAAA,EACtD;AACA,SAAO,IAAI,YAAY,WAAW,QAAQ,UAAU,aAAa,SAAS,MAAM;AACpF;AAQA,SAAS,cAAc,UAAyB,QAAiE;AAC7G,MAAI,OAAO,WAAW,UAAU;AAC5B,WAAO;AAAA,EACX;AACA,MAAI,WAAW,YAAY,WAAW,WAAW;AAC7C,WAAO,SAAS,MAAM,OAAO,MAAM;AAAA,EACvC;AACA,SAAO,SAAS,MAAM,OAAO,QAAQ,KAAK,SAAS,MAAM,OAAO,SAAS;AAC7E;"}