@graphty/graph-io 0.3.48 → 0.3.50

package/dist/graphml.js

@@ -1,6 +1,6 @@
-import { G, a } from "./chunks/constants-D0LqcsLJ.js";
-import { g, a as a2 } from "./chunks/importer-B87_fmVx.js";
-import { G as G2 } from "./chunks/styles-yed-Cs1nmrjn.js";
+import { G, a } from "./chunks/constants-CKkYLPtt.js";
+import { g, a as a2 } from "./chunks/importer-C6NVpCXp.js";
+import { G as G2 } from "./chunks/styles-yed-XeFBQ6VS.js";
 export {
   G as GRAPHML_ISSUE,
   a as GRAPHML_LOSS,

package/dist/json.js

@@ -1,4 +1,4 @@
-import { J, a, b, d, j, c, e, f } from "./chunks/exporter-bxxjOrDZ.js";
+import { J, a, b, d, j, c, e, f, s } from "./chunks/exporter-CQQZFJ2v.js";
 export {
   J as JSON_DIALECTS,
   a as JSON_ISSUE,
@@ -7,6 +7,7 @@ export {
   j as jsonCapabilities,
   c as jsonExporter,
   e as jsonImporter,
-  f as jsonShapeOf
+  f as jsonShapeOf,
+  s as sniffJsonDialect
 };
 //# sourceMappingURL=json.js.map

package/dist/neo4j.js

@@ -1,11 +1,11 @@
-import { f as DANGLING_REFERENCE_CODE$1, R as ROLE_TAKEN_CODE$1, I as ID_MERGED_CODE$1, k as DUPLICATE_NODE_CODE$1, n as MISSING_ENDPOINT_CODE$1, o as MISSING_ID_CODE$1, K as ImportReportBuilder, p as plural, a as agree, ah as ImportError, P as PRECISION_CODE, ai as withArticle, aj as ID_TEXT_COLLISION_CODE, A as ID_TEXT_TYPE_CODE, S as SINK_OPTION_CODE, O as OPTION_IGNORED_CODE, C as COLUMN_RENAMED_CODE, U as UNKNOWN_ATTR_TYPE_CODE, s as UNKNOWN_ENCODING_CODE, t as ENCODING_FALLBACK_CODE, u as INVALID_ENCODING_CODE, v as INVALID_UTF8_CODE, x as COLUMN_TYPE_CODE, y as ELEMENT_ISSUE, z as INPUT_ISSUE, ak as WEIGHT_KEY_CLASH_CODE, F as ROLE_DROPPED_CODE, al as MUTUAL_EXPANDED_CODE } from "./chunks/report-CgdsL9Hb.js";
-import { c as checkRecordSyntax, R as RecordReader, B as BAD_QUOTE_CODE, U as UNCLOSED_QUOTE_CODE } from "./chunks/records-Cgvxz-Vx.js";
+import { f as DANGLING_REFERENCE_CODE$1, R as ROLE_TAKEN_CODE$1, I as ID_MERGED_CODE$1, k as DUPLICATE_NODE_CODE$1, n as MISSING_ENDPOINT_CODE$1, o as MISSING_ID_CODE$1, K as ImportReportBuilder, p as plural, a as agree, ah as ImportError, P as PRECISION_CODE, ai as withArticle, aj as ID_TEXT_COLLISION_CODE, A as ID_TEXT_TYPE_CODE, S as SINK_OPTION_CODE, O as OPTION_IGNORED_CODE, C as COLUMN_RENAMED_CODE, U as UNKNOWN_ATTR_TYPE_CODE, s as UNKNOWN_ENCODING_CODE, t as ENCODING_FALLBACK_CODE, u as INVALID_ENCODING_CODE, v as INVALID_UTF8_CODE, x as COLUMN_TYPE_CODE, y as ELEMENT_ISSUE, z as INPUT_ISSUE, ak as WEIGHT_KEY_CLASH_CODE, F as ROLE_DROPPED_CODE, al as MUTUAL_EXPANDED_CODE } from "./chunks/report-CwMfYa9J.js";
+import { c as checkRecordSyntax, R as RecordReader, B as BAD_QUOTE_CODE, U as UNCLOSED_QUOTE_CODE } from "./chunks/records-NJiYvekn.js";
 import { GraphFormatError, INVALID_INDEX } from "@graphty/graph-format";
-import { d as resolveImportOptions, g as reportSinkOptions, f as reportUnusedOptions, I as IdCoercer, i as DirectionResolver, n as declareAttribute, K as declareOn, u as uniqueColumnName, M as takenIn, R as RENAMED_CODE, o as parseWeightText, x as losesPrecision, s as parseDeclaredTemporal, v as parseDeclaredValue, t as declareCompanion, z as splitListText, N as parseTemporal, c as capabilities, r as resolveExportOptions, a as checkCapabilities, p as pairFolding, L as LOSS, F as mapDeclaredType, e as explicitWeights, J as isCanonicalIntegerText, H as formatTemporal } from "./chunks/export-CZ7VRm4I.js";
-import { q as quoteCsvCell } from "./chunks/escape-DH2Egt-l.js";
-import { c as formatInteger, a as formatF64, f as formatF32 } from "./chunks/format-BMS-1Nxb.js";
+import { b as resolveImportOptions, f as reportSinkOptions, d as reportUnusedOptions, I as IdCoercer, l as declareAttribute, K as declareOn, u as uniqueColumnName, M as takenIn, R as RENAMED_CODE, p as parseWeightText, s as losesPrecision, m as parseDeclaredTemporal, q as parseDeclaredValue, n as declareCompanion, v as splitListText, N as parseTemporal, c as capabilities, r as resolveExportOptions, a as checkCapabilities, L as LOSS, B as mapDeclaredType, e as explicitWeights, F as isCanonicalIntegerText, E as formatTemporal } from "./chunks/export-Cha4dRFz.js";
+import { D as DirectionResolver, p as pairFolding, c as formatInteger, a as formatF64, f as formatF32 } from "./chunks/format-BXiAb-1h.js";
+import { g as quoteCsvCell } from "./chunks/escape-CuCIzNMB.js";
 import { j as joinText, e as encodeChunks } from "./chunks/writer-DxjgHwSe.js";
-import { b as throwIfAborted, i as isImportInput, c as inputLength } from "./chunks/input-Ccg9I22A.js";
+import { b as throwIfAborted, i as isImportInput, d as inputLength } from "./chunks/input-CAxt_aV-.js";
 const STRUCTURAL = /* @__PURE__ */ new Set(["ID", "LABEL", "START_ID", "END_ID", "TYPE", "IGNORE"]);
 const SPACE_KINDS = /* @__PURE__ */ new Set(["ID", "START_ID", "END_ID"]);
 const HEADER_MARKER = /^[^:{}()]*:\s*(ID|START_ID|END_ID)\s*(\(|\{|$)/i;

package/dist/obo.js

@@ -1,4 +1,4 @@
-import { O, a, b, o, c } from "./chunks/exporter-Dcw7Ldtq.js";
+import { O, a, b, o, c } from "./chunks/exporter-BP6otMO6.js";
 export {
   O as OBO_CAPABILITIES,
   a as OBO_ISSUE,

package/dist/pajek.js

@@ -1,4 +1,4 @@
-import { P, a, b, c, p, d } from "./chunks/importer-CVT-JyDE.js";
+import { P, a, b, c, p, d } from "./chunks/importer-DgG4v1Ms.js";
 export {
   P as PAJEK_ISSUE,
   a as PAJEK_LOSS,

package/dist/positions.js

@@ -1,5 +1,5 @@
-import { t as toNeutral, m as median } from "./chunks/convert-BcQ8_jMo.js";
-import { f, a, w } from "./chunks/convert-BcQ8_jMo.js";
+import { t as toNeutral, m as median } from "./chunks/convert-Ct2zelbQ.js";
+import { f, a, w } from "./chunks/convert-Ct2zelbQ.js";
 import { t as toolOf } from "./chunks/units-XMZFIFe1.js";
 const POSITION_ISSUE = Object.freeze({
   /** Every placed node sits on one point; the coordinates are dropped and `usable` is false. */
@@ -88,6 +88,11 @@ function extractPositions(importer, snapshot, report, options = {}) {
   const coords = readRows(n, spelling, notes);
   signal?.throwIfAborted();
   const containers = containersOf(snapshot);
+  if (spelling.extra.containersFollowChildren === true) {
+    for (const row of containers) {
+      coords.values.fill(Number.NaN, 3 * row, 3 * row + 3);
+    }
+  }
   const groups = applyGroups(spelling, coords);
   collectGroups(spelling, coords, containers, groups);
   const { placed, total } = countPlaced(coords, containers, notes);
@@ -103,6 +108,7 @@ function extractPositions(importer, snapshot, report, options = {}) {
     },
     units: spelling.extra.units ?? "file",
     ...spelling.extra.pxPerUnit === void 0 ? {} : { pxPerUnit: spelling.extra.pxPerUnit },
+    ...spelling.extra.viewerFit === void 0 ? {} : { viewerFit: spelling.extra.viewerFit },
     medianNodeSize: spelling.medianNodeSize ?? medianSize(spelling.size, n, containers),
     dims: coords.realZ ? 3 : 2,
     coords: coords.values,
@@ -121,11 +127,27 @@ function spellingOf(importer, snapshot, signal) {
   }
   const column = hook?.column === void 0 ? snapshot.nodes.byRole("position") : snapshot.nodes.get(hook.column);
   if (column === null || column.meta.components < 2) {
-    return null;
+    return hook?.unplacedCircle === void 0 ? null : circleSpelling(snapshot, hook);
   }
   const extra = { ...extraOf(column.meta.extra), ...extraOf(hook ?? {}) };
   return { read: vectorReader(column), size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };
 }
+function circleSpelling(snapshot, hook) {
+  const circle = hook.unplacedCircle;
+  const n = snapshot.nodeCount;
+  const read = (row, out) => {
+    if (circle === void 0 || n === 0) {
+      return false;
+    }
+    const a2 = (circle.startDegrees + circle.direction * 360 * row / n) * Math.PI / 180;
+    out[0] = circle.center[0] + circle.radius * Math.cos(a2);
+    out[1] = circle.center[1] + circle.radius * Math.sin(a2);
+    out[2] = 0;
+    return true;
+  };
+  const extra = { ...extraOf(hook), sourceDims: 2 };
+  return { read, size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };
+}
 function plainSpelling(snapshot, hook) {
   const x = snapshot.nodes.get(hook.x ?? "");
   const y = snapshot.nodes.get(hook.y ?? "");
@@ -175,8 +197,15 @@ function extraOf(source) {
   pick("width", (v) => typeof v === "string");
   pick("height", (v) => typeof v === "string");
   pick("pxPerUnit", (v) => typeof v === "number" && Number.isFinite(v) && v > 0);
+  pick("pxPerUnitY", (v) => typeof v === "number" && Number.isFinite(v) && v > 0);
   pick("zOrigin", (v) => typeof v === "number" && Number.isFinite(v));
   pick("zeroUnplaced", (v) => typeof v === "boolean");
+  pick("originUnplaced", (v) => typeof v === "boolean");
+  pick("containersFollowChildren", (v) => typeof v === "boolean");
+  const fit = extra.viewerFit;
+  if (typeof fit?.padding === "number" && Number.isFinite(fit.padding) && fit.padding >= 0) {
+    out.viewerFit = { padding: fit.padding };
+  }
   return out;
 }
 function readRows(n, spelling, notes) {
@@ -195,10 +224,23 @@ function readRows(n, spelling, notes) {
   if (spelling.extra.zeroUnplaced === true) {
     dropZeroPile(values);
   }
+  if (spelling.extra.originUnplaced === true) {
+    placeUnplacedAtOrigin(values);
+  }
   const realZ = spelling.extra.sourceDims === 3 && !constantZ(values);
   convertRows(values, spelling.extra, spelling.size, realZ, notes);
   return { values, realZ };
 }
+function placeUnplacedAtOrigin(values) {
+  if (!values.some((v) => !Number.isNaN(v))) {
+    return;
+  }
+  for (let i = 0; i < values.length; i += 3) {
+    if (Number.isNaN(values[i])) {
+      values.fill(0, i, i + 3);
+    }
+  }
+}
 function convertRows(values, extra, size, realZ, notes) {
   const p = [0, 0, 0];
   for (let i = 0; i < values.length; i += 3) {

package/dist/positions.js.map

@@ -1 +1 @@
-{"version":3,"file":"positions.js","sources":["../src/positions/codes.ts","../src/common/notes.ts","../src/positions/extract.ts"],"sourcesContent":["/**\n * The note codes of `extractPositions()`. Singular `W_POSITION_*` codes are about some nodes,\n * plural `W_POSITIONS_*` codes about the file as a whole. Keys drop the `W_` and `POSITION_` /\n * `POSITIONS_` prefixes.\n */\n\n/**\n * Every code a `PositionNote` carries.\n * @category Positions\n */\nexport const POSITION_ISSUE = Object.freeze({\n    /** Every placed node sits on one point; the coordinates are dropped and `usable` is false. */\n    STACKED: \"W_POSITION_STACKED\",\n    /** Some nodes have no position. */\n    PARTIAL: \"W_POSITION_PARTIAL\",\n    /** Some coordinates are not finite numbers; those nodes count as unplaced. */\n    NON_FINITE: \"W_POSITION_NON_FINITE\",\n    /** The file mixes 2- and 3-coordinate positions. */\n    DIMS_MIXED: \"W_POSITION_DIMS_MIXED\",\n    /** A top-left coordinate has no width or height, so it was not moved to the center. */\n    ANCHOR_NO_SIZE: \"W_POSITION_ANCHOR_NO_SIZE\",\n    /** The file holds more than one view (layout); only the first is used. */\n    OTHER_VIEWS: \"W_POSITION_OTHER_VIEWS\",\n    /** The file has position-like columns this format does not read (plain `x` / `y`). */\n    NOT_READ: \"W_POSITIONS_NOT_READ\",\n} as const);\n\n/**\n * A code of `POSITION_ISSUE`.\n * @category Positions\n */\nexport type PositionNoteCode = (typeof POSITION_ISSUE)[keyof typeof POSITION_ISSUE];\n","/**\n * The note collector file positions use (and file styles, after their rebase): one note per code\n * (and optional property), never one per element, with at most 8 distinct samples of 80\n * characters, a total count and the element indexes the note covers.\n */\n\n/** At most this many samples per note. */\nconst MAX_SAMPLES = 8;\n/** A sample is cut to this many characters. */\nconst MAX_SAMPLE_LENGTH = 80;\n\n/** One occurrence (or `count` occurrences) of a condition. */\ninterface NoteReport {\n    /** An example of the offending value. */\n    readonly sample?: unknown;\n    /** The element the report is about, by index. */\n    readonly element?: number;\n    /** How many occurrences the report stands for; defaults to 1. */\n    readonly count?: number;\n}\n\n/** A collected note, before a module shapes it into its own note type. */\ninterface CollectedNote<C extends string> {\n    readonly code: C;\n    readonly property: string | null;\n    readonly count: number;\n    readonly samples: readonly string[];\n    readonly elements: readonly number[] | { readonly count: number };\n}\n\ninterface Collecting<C extends string> {\n    readonly code: C;\n    readonly property: string | null;\n    count: number;\n    readonly samples: string[];\n    readonly elements: Set<number>;\n    unindexed: boolean;\n}\n\n/** Collects notes, aggregated per (code, property), in the order their conditions first occur. */\nexport class NoteCollector<C extends string> {\n    readonly #notes = new Map<string, Collecting<C>>();\n\n    /**\n     * Record a condition.\n     * @param code - the condition\n     * @param report - a sample, the element index and a count\n     * @param property - what the note is about, or null\n     */\n    add(code: C, report: NoteReport = {}, property: string | null = null): void {\n        const key = `${code}\\u0000${property ?? \"\"}`;\n        let note = this.#notes.get(key);\n        if (note === undefined) {\n            note = { code, property, count: 0, samples: [], elements: new Set(), unindexed: false };\n            this.#notes.set(key, note);\n        }\n        note.count += report.count ?? 1;\n        if (report.element === undefined) {\n            note.unindexed = true;\n        } else {\n            note.elements.add(report.element);\n        }\n        if (report.sample !== undefined && note.samples.length < MAX_SAMPLES) {\n            const sample = sampleText(report.sample);\n            if (!note.samples.includes(sample)) {\n                note.samples.push(sample);\n            }\n        }\n    }\n\n    /**\n     * The collected notes.\n     * @returns one note per (code, property)\n     */\n    list(): CollectedNote<C>[] {\n        return Array.from(this.#notes.values(), (n) => ({\n            code: n.code,\n            property: n.property,\n            count: n.count,\n            samples: [...n.samples],\n            elements: n.unindexed ? { count: n.count } : Array.from(n.elements).sort((a, b) => a - b),\n        }));\n    }\n}\n\n/**\n * A sample as at most 80 characters of text.\n * @param value - the sample\n * @returns the text\n */\nfunction sampleText(value: unknown): string {\n    const text = typeof value === \"string\" ? value : (JSON.stringify(value) ?? String(value));\n    return text.length > MAX_SAMPLE_LENGTH ? `${text.slice(0, MAX_SAMPLE_LENGTH - 3)}...` : text;\n}\n","/**\n * `extractPositions()`: any format's stored node coordinates in the neutral convention (center,\n * y up, the file's unit, 3 components). The snapshot's role-`position` column keeps the values the\n * file wrote; this reads them through the spelling the column's `meta.extra` (or the importer's\n * `positions()` hook) declares.\n */\n\nimport type { Column, GraphSnapshot } from \"@graphty/graph-format\";\n\nimport { NoteCollector } from \"../common/notes.js\";\nimport { type GraphTool, toolOf } from \"../common/units.js\";\nimport type { GraphImporter, ImportReport } from \"../types.js\";\nimport { POSITION_ISSUE, type PositionNoteCode } from \"./codes.js\";\nimport { median, toNeutral } from \"./convert.js\";\nimport type {\n    ExtractPositionsOptions,\n    FilePositionGroup,\n    FilePositions,\n    ImporterGroupBox,\n    ImporterPositions,\n    PositionColumnExtra,\n    PositionNote,\n} from \"./types.js\";\n\ntype Point = [number, number, number];\n\n/** Reads one row's raw coordinates into `out`; false when the row has none. */\ntype RowReader = (row: number, out: Point) => boolean;\n\n/** Reads one row's width and height; null when the row has no size. */\ntype SizeReader = (row: number) => readonly [number, number] | null;\n\n/** Where a file's coordinates are and how they are spelled. */\ninterface Spelling {\n    readonly read: RowReader;\n    /** Reads a row's width and height from the size columns the spelling names; null without both. */\n    readonly size: SizeReader;\n    readonly extra: PositionColumnExtra;\n    readonly groups: readonly ImporterGroupBox[];\n    readonly medianNodeSize: number | null | undefined;\n    readonly tool: GraphTool | null | undefined;\n}\n\n/** Report codes of format readers that mean the file mixes 2- and 3-coordinate positions. */\nconst DIMS_MIXED_CODES: ReadonlySet<string> = new Set([\"W_PAJEK_COORD_DIMS\", \"W_DOT_POS_DIMS\"]);\n\n/** graph-io's English for each note, for its own logs only. */\nconst PHRASES: Readonly<Record<PositionNoteCode, string>> = {\n    W_POSITION_STACKED: \"every placed node is on one point; the positions were dropped\",\n    W_POSITION_PARTIAL: \"nodes have no position\",\n    W_POSITION_NON_FINITE: \"positions are not finite numbers\",\n    W_POSITION_DIMS_MIXED: \"positions mix 2 and 3 coordinates\",\n    W_POSITION_ANCHOR_NO_SIZE: \"top-left positions have no size and were not moved to the center\",\n    W_POSITION_OTHER_VIEWS: \"other views were not used\",\n    W_POSITIONS_NOT_READ: \"position-like columns this format does not read\",\n};\n\n/**\n * A file's stored node coordinates in the neutral convention: each node's center, y up, in the\n * file's own unit. Call it with the importer that read the snapshot and the report it returned.\n * @example\n * ```ts\n * const { snapshot, report } = await importGraph(text, { format: \"gml\" });\n * const positions = extractPositions(gmlImporter, snapshot, report);\n * if (positions?.usable) console.log(positions.coords.subarray(0, 3)); // node 0's x, y, z\n * ```\n * @param importer - the importer that read the snapshot (its `positions()` hook, when it has one, says how the coordinates are spelled)\n * @param snapshot - the imported graph\n * @param report - the import's report\n * @param options - `signal` to abort\n * @returns the positions, or null when the file stores none and has no position-like columns\n * @category Positions\n */\nexport function extractPositions(\n    importer: GraphImporter,\n    snapshot: GraphSnapshot,\n    report: ImportReport,\n    options: ExtractPositionsOptions = {},\n): FilePositions | null {\n    const signal = options.signal ?? null;\n    signal?.throwIfAborted();\n    const notes = new NoteCollector<PositionNoteCode>();\n    const spelling = spellingOf(importer, snapshot, signal);\n    if (spelling === null) {\n        noteUnread(snapshot, notes);\n        return notes.list().length === 0 ? null : emptyPositions(importer, snapshot, notes);\n    }\n    const n = snapshot.nodeCount;\n    const coords = readRows(n, spelling, notes);\n    signal?.throwIfAborted();\n    const containers = containersOf(snapshot);\n    const groups = applyGroups(spelling, coords);\n    collectGroups(spelling, coords, containers, groups);\n    const { placed, total } = countPlaced(coords, containers, notes);\n    const stacked = dropStacked(coords, placed, notes);\n    noteReport(report, notes);\n    noteOtherViews(snapshot, notes);\n    return {\n        version: 1,\n        source: {\n            format: importer.format,\n            tool: spelling.tool ?? toolOf(snapshot.meta.creator),\n            yAxis: spelling.extra.yAxis ?? \"up\",\n        },\n        units: spelling.extra.units ?? \"file\",\n        ...(spelling.extra.pxPerUnit === undefined ? {} : { pxPerUnit: spelling.extra.pxPerUnit }),\n        medianNodeSize: spelling.medianNodeSize ?? medianSize(spelling.size, n, containers),\n        dims: coords.realZ ? 3 : 2,\n        coords: coords.values,\n        placed: stacked ? 0 : placed,\n        total,\n        usable: !stacked && placed > 0,\n        bounds: stacked ? null : boundsOf(coords.values),\n        groups,\n        notes: noteList(notes),\n    };\n}\n\n// ------------------------------------------------------------ spelling\n\n/**\n * Where the coordinates are: the importer's hook wins over the column's `meta.extra`.\n * @param importer - the importer\n * @param snapshot - the graph\n * @param signal - the abort signal\n * @returns the spelling, or null when the file stores no coordinates\n */\nfunction spellingOf(importer: GraphImporter, snapshot: GraphSnapshot, signal: AbortSignal | null): Spelling | null {\n    const hook = importer.positions?.(snapshot, { signal }) ?? null;\n    if (hook?.x !== undefined && hook.y !== undefined) {\n        return plainSpelling(snapshot, hook);\n    }\n    const column = hook?.column === undefined ? snapshot.nodes.byRole(\"position\") : snapshot.nodes.get(hook.column);\n    if (column === null || column.meta.components < 2) {\n        return null;\n    }\n    const extra = { ...extraOf(column.meta.extra), ...extraOf(hook ?? {}) };\n    return { read: vectorReader(column), size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };\n}\n\n/**\n * The spelling of the simple hook form: plain x / y (/ z) columns.\n * @param snapshot - the graph\n * @param hook - the hook's answer\n * @returns the spelling, or null when a named column is missing\n */\nfunction plainSpelling(snapshot: GraphSnapshot, hook: ImporterPositions): Spelling | null {\n    const x = snapshot.nodes.get(hook.x ?? \"\");\n    const y = snapshot.nodes.get(hook.y ?? \"\");\n    const z = hook.z === undefined ? null : snapshot.nodes.get(hook.z);\n    if (x === null || y === null) {\n        return null;\n    }\n    const read: RowReader = (row, out) => {\n        if (!x.isSet(row) || !y.isSet(row)) {\n            return false;\n        }\n        out[0] = Number(x.value(row));\n        out[1] = Number(y.value(row));\n        out[2] = z?.isSet(row) === true ? Number(z.value(row)) : 0;\n        return true;\n    };\n    const extra = { ...extraOf(hook), sourceDims: z === null ? 2 : 3 } as const;\n    return { read, size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };\n}\n\n/**\n * The hook's fields beside the spelling.\n * @param hook - the hook's answer, or null\n * @returns groups, median node size and tool\n */\nfunction hookFields(hook: ImporterPositions | null): Pick<Spelling, \"groups\" | \"medianNodeSize\" | \"tool\"> {\n    return { groups: hook?.groups ?? [], medianNodeSize: hook?.medianNodeSize, tool: hook?.tool };\n}\n\n/**\n * A reader over a 2- or 3-component column.\n * @param column - the column\n * @returns the reader\n */\nfunction vectorReader(column: Column): RowReader {\n    return (row, out) => {\n        if (!column.isSet(row)) {\n            return false;\n        }\n        const v = column.value(row) as ArrayLike<number>;\n        out[0] = v[0];\n        out[1] = v[1];\n        out[2] = v.length > 2 ? v[2] : 0;\n        return true;\n    };\n}\n\n/**\n * The spelling fields of an extra (or a hook's answer), each kept only when well formed.\n * @param source - a column's meta.extra or a hook's answer\n * @returns the fields\n */\nfunction extraOf(source: object): PositionColumnExtra {\n    const extra = source as Readonly<Record<string, unknown>>;\n    const out: Record<string, unknown> = {};\n    const pick = (key: keyof PositionColumnExtra, ok: (v: unknown) => boolean): void => {\n        if (ok(extra[key])) {\n            out[key] = extra[key];\n        }\n    };\n    pick(\"units\", (v) => v === \"px\" || v === \"file\");\n    pick(\"sourceDims\", (v) => v === 2 || v === 3);\n    pick(\"yAxis\", (v) => v === \"up\" || v === \"down\");\n    pick(\"anchor\", (v) => v === \"center\" || v === \"top-left\");\n    pick(\"width\", (v) => typeof v === \"string\");\n    pick(\"height\", (v) => typeof v === \"string\");\n    pick(\"pxPerUnit\", (v) => typeof v === \"number\" && Number.isFinite(v) && v > 0);\n    pick(\"zOrigin\", (v) => typeof v === \"number\" && Number.isFinite(v));\n    pick(\"zeroUnplaced\", (v) => typeof v === \"boolean\");\n    return out;\n}\n\n// ------------------------------------------------------------ rows\n\n/** Coordinates by node index, with whether the file has a z that differs between nodes. */\ninterface Rows {\n    readonly values: Float64Array;\n    readonly realZ: boolean;\n}\n\n/**\n * Read every row and convert it to the neutral convention.\n * @param n - the node count\n * @param spelling - how the coordinates are spelled\n * @param notes - receives non-finite and anchor notes\n * @returns the coordinates (NaN rows have none)\n */\nfunction readRows(n: number, spelling: Spelling, notes: NoteCollector<PositionNoteCode>): Rows {\n    const values = new Float64Array(3 * n).fill(Number.NaN);\n    const p: Point = [0, 0, 0];\n    for (let row = 0; row < n; row++) {\n        if (!spelling.read(row, p)) {\n            continue;\n        }\n        if (Number.isFinite(p[0]) && Number.isFinite(p[1]) && Number.isFinite(p[2])) {\n            values.set(p, 3 * row);\n        } else {\n            notes.add(POSITION_ISSUE.NON_FINITE, { element: row, sample: p.join(\",\") });\n        }\n    }\n    if (spelling.extra.zeroUnplaced === true) {\n        dropZeroPile(values);\n    }\n    const realZ = spelling.extra.sourceDims === 3 && !constantZ(values);\n    convertRows(values, spelling.extra, spelling.size, realZ, notes);\n    return { values, realZ };\n}\n\n/**\n * Convert every placed row in place.\n * @param values - the raw coordinates\n * @param extra - the spelling\n * @param size - reads a row's width and height\n * @param realZ - whether z differs between nodes\n * @param notes - receives the anchor note\n */\nfunction convertRows(\n    values: Float64Array,\n    extra: PositionColumnExtra,\n    size: SizeReader,\n    realZ: boolean,\n    notes: NoteCollector<PositionNoteCode>,\n): void {\n    const p: Point = [0, 0, 0];\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        const s = extra.anchor === \"top-left\" ? size(i / 3) : null;\n        if (extra.anchor === \"top-left\" && s === null) {\n            notes.add(POSITION_ISSUE.ANCHOR_NO_SIZE, { element: i / 3 });\n        }\n        p[0] = values[i];\n        p[1] = values[i + 1];\n        p[2] = values[i + 2];\n        toNeutral(p, extra, s, realZ);\n        values.set(p, i);\n    }\n}\n\n/**\n * Reads a row's width and height from the size columns a spelling names.\n * @param snapshot - the graph\n * @param extra - the spelling\n * @returns the reader; it answers null for a row without both, or when the columns are missing\n */\nfunction sizeReader(snapshot: GraphSnapshot, extra: PositionColumnExtra): SizeReader {\n    const w = extra.width === undefined ? null : snapshot.nodes.get(extra.width);\n    const h = extra.height === undefined ? null : snapshot.nodes.get(extra.height);\n    if (w === null || h === null) {\n        return () => null;\n    }\n    return (row) => {\n        if (!w.isSet(row) || !h.isSet(row)) {\n            return null;\n        }\n        const size: [number, number] = [Number(w.value(row)), Number(h.value(row))];\n        return Number.isFinite(size[0]) && Number.isFinite(size[1]) ? size : null;\n    };\n}\n\n/**\n * NetworkX writes (0, 0) for a node with no position: when other rows are placed, an exact (0, 0)\n * shared by two or more rows counts as unplaced.\n * @param values - the raw coordinates, changed in place\n */\nfunction dropZeroPile(values: Float64Array): void {\n    const zeros: number[] = [];\n    let others = 0;\n    for (let i = 0; i < values.length; i += 3) {\n        if (values[i] === 0 && values[i + 1] === 0) {\n            zeros.push(i);\n        } else if (!Number.isNaN(values[i])) {\n            others++;\n        }\n    }\n    if (zeros.length >= 2 && others > 0) {\n        for (const i of zeros) {\n            values.fill(Number.NaN, i, i + 3);\n        }\n    }\n}\n\n/**\n * Whether every placed row has the same z (Pajek writes z = 0.5 on 2D drawings).\n * @param values - the raw coordinates\n * @returns true when z never differs\n */\nfunction constantZ(values: Float64Array): boolean {\n    let z = Number.NaN;\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        if (Number.isNaN(z)) {\n            z = values[i + 2];\n        } else if (values[i + 2] !== z) {\n            return false;\n        }\n    }\n    return true;\n}\n\n// ------------------------------------------------------------ groups\n\n/**\n * The nodes another node names as its parent: group containers.\n * @param snapshot - the graph\n * @returns the container indexes\n */\nfunction containersOf(snapshot: GraphSnapshot): Set<number> {\n    const out = new Set<number>();\n    const parent = snapshot.nodes.byRole(\"parent\");\n    if (parent === null) {\n        return out;\n    }\n    for (let row = 0; row < parent.length; row++) {\n        const v = parent.isSet(row) ? parent.value(row) : undefined;\n        if (typeof v === \"number\") {\n            out.add(v);\n        }\n    }\n    return out;\n}\n\n/**\n * The hook's group boxes in the neutral convention; a container with no coordinate of its own is\n * placed at its box's center.\n * @param spelling - the spelling and the hook's boxes\n * @param rows - the coordinates, changed in place\n * @returns the boxes\n */\nfunction applyGroups(spelling: Spelling, rows: Rows): FilePositionGroup[] {\n    const out: FilePositionGroup[] = [];\n    for (const { node, box } of spelling.groups) {\n        const p: Point = [box.x, box.y, 0];\n        toNeutral(p, spelling.extra, [box.width, box.height], false);\n        if (Number.isNaN(rows.values[3 * node])) {\n            rows.values.set(p, 3 * node);\n        }\n        if (!out.some((g) => g.node === node)) {\n            out.push({ node, box: { x: p[0], y: p[1], width: box.width, height: box.height } });\n        }\n    }\n    return out;\n}\n\n/**\n * Boxes for the containers the file gives a coordinate and a size (yEd groups).\n * @param spelling - the size reader\n * @param rows - the coordinates\n * @param containers - the container indexes\n * @param groups - receives the boxes\n */\nfunction collectGroups(\n    spelling: Spelling,\n    rows: Rows,\n    containers: ReadonlySet<number>,\n    groups: FilePositionGroup[],\n): void {\n    for (const node of containers) {\n        const size = spelling.size(node);\n        const i = 3 * node;\n        if (size !== null && !Number.isNaN(rows.values[i]) && !groups.some((g) => g.node === node)) {\n            groups.push({ node, box: { x: rows.values[i], y: rows.values[i + 1], width: size[0], height: size[1] } });\n        }\n    }\n}\n\n// ------------------------------------------------------------ counts and notes\n\n/**\n * Count the placed rows and the rows that need a position; note the unplaced ones.\n * @param rows - the coordinates\n * @param containers - containers without a coordinate do not need one\n * @param notes - receives the partial note\n * @returns placed and total\n */\nfunction countPlaced(\n    rows: Rows,\n    containers: ReadonlySet<number>,\n    notes: NoteCollector<PositionNoteCode>,\n): { placed: number; total: number } {\n    const { values } = rows;\n    const unplaced: number[] = [];\n    let placed = 0;\n    let total = 0;\n    for (let row = 0; 3 * row < values.length; row++) {\n        const has = !Number.isNaN(values[3 * row]);\n        if (has) {\n            placed++;\n        } else if (!containers.has(row)) {\n            unplaced.push(row);\n        }\n        total += has || !containers.has(row) ? 1 : 0;\n    }\n    if (placed > 0 && unplaced.length > 0) {\n        for (const element of unplaced) {\n            notes.add(POSITION_ISSUE.PARTIAL, { element });\n        }\n    }\n    return { placed, total };\n}\n\n/**\n * Drop the coordinates when every placed node sits on one point.\n * @param rows - the coordinates, cleared in place when stacked\n * @param placed - the placed count\n * @param notes - receives the stacked note\n * @returns whether they were stacked\n */\nfunction dropStacked(rows: Rows, placed: number, notes: NoteCollector<PositionNoteCode>): boolean {\n    if (placed < 2) {\n        return false;\n    }\n    const { values } = rows;\n    let first = -1;\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        if (first < 0) {\n            first = i;\n        } else if (\n            values[i] !== values[first] ||\n            values[i + 1] !== values[first + 1] ||\n            values[i + 2] !== values[first + 2]\n        ) {\n            return false;\n        }\n    }\n    notes.add(POSITION_ISSUE.STACKED, {\n        count: placed,\n        sample: Array.from(values.subarray(first, first + 3)).join(\",\"),\n    });\n    values.fill(Number.NaN);\n    return true;\n}\n\n/**\n * Lift the format readers' mixed-dimension warnings into the shared code.\n * @param report - the import report\n * @param notes - receives the note\n */\nfunction noteReport(report: ImportReport, notes: NoteCollector<PositionNoteCode>): void {\n    for (const issue of report.issues) {\n        if (DIMS_MIXED_CODES.has(issue.code)) {\n            notes.add(POSITION_ISSUE.DIMS_MIXED, { sample: issue.code });\n        }\n    }\n}\n\n/**\n * Note the extra view columns of a CX file (`position@2`, ...): only the first view is used.\n * @param snapshot - the graph\n * @param notes - receives the note\n */\nfunction noteOtherViews(snapshot: GraphSnapshot, notes: NoteCollector<PositionNoteCode>): void {\n    for (const column of snapshot.nodes) {\n        if (/^position@\\d+$/.test(column.meta.name) && column.meta.role === null) {\n            notes.add(POSITION_ISSUE.OTHER_VIEWS, { sample: column.meta.name });\n        }\n    }\n}\n\n/**\n * Note plain numeric `x` and `y` node columns a format does not read as positions.\n * @param snapshot - the graph\n * @param notes - receives the note\n */\nfunction noteUnread(snapshot: GraphSnapshot, notes: NoteCollector<PositionNoteCode>): void {\n    const numeric = (name: string): Column | undefined =>\n        [...snapshot.nodes].find(\n            (c) => c.meta.name.toLowerCase() === name && c.meta.components === 1 && isNumeric(c.dtype),\n        );\n    const x = numeric(\"x\");\n    const y = numeric(\"y\");\n    if (x !== undefined && y !== undefined) {\n        notes.add(POSITION_ISSUE.NOT_READ, { sample: x.meta.name });\n        notes.add(POSITION_ISSUE.NOT_READ, { sample: y.meta.name });\n    }\n}\n\n/**\n * Whether a dtype holds numbers.\n * @param dtype - the dtype\n * @returns true for the numeric dtypes\n */\nfunction isNumeric(dtype: string): boolean {\n    return dtype === \"f64\" || dtype === \"f32\" || dtype === \"i32\" || dtype === \"u32\" || dtype === \"u8\";\n}\n\n/**\n * The notes with graph-io's English.\n * @param notes - the collector\n * @returns the notes\n */\nfunction noteList(notes: NoteCollector<PositionNoteCode>): PositionNote[] {\n    return notes.list().map((n) => ({\n        code: n.code,\n        params: { count: n.count, samples: n.samples },\n        elements: n.elements,\n        message: `${PHRASES[n.code]} (${n.count})`,\n    }));\n}\n\n/**\n * The answer for a file with no readable positions but position-like columns.\n * @param importer - the importer\n * @param snapshot - the graph\n * @param notes - the notes\n * @returns positions with nothing placed\n */\nfunction emptyPositions(\n    importer: GraphImporter,\n    snapshot: GraphSnapshot,\n    notes: NoteCollector<PositionNoteCode>,\n): FilePositions {\n    return {\n        version: 1,\n        source: { format: importer.format, tool: toolOf(snapshot.meta.creator), yAxis: \"up\" },\n        units: \"file\",\n        medianNodeSize: null,\n        dims: 2,\n        coords: new Float64Array(3 * snapshot.nodeCount).fill(Number.NaN),\n        placed: 0,\n        total: snapshot.nodeCount,\n        usable: false,\n        bounds: null,\n        groups: [],\n        notes: noteList(notes),\n    };\n}\n\n// ------------------------------------------------------------ sizes and bounds\n\n/**\n * The median node diameter from the size columns the spelling names.\n * @param size - the size reader\n * @param n - the node count\n * @param containers - group containers, left out\n * @returns the median of each node's mean of width and height, or null when no node has a size\n */\nfunction medianSize(size: SizeReader, n: number, containers: ReadonlySet<number>): number | null {\n    const sizes: number[] = [];\n    for (let row = 0; row < n; row++) {\n        const s = containers.has(row) ? null : size(row);\n        if (s !== null) {\n            sizes.push((s[0] + s[1]) / 2);\n        }\n    }\n    return median(sizes);\n}\n\n/**\n * The box around every placed row.\n * @param values - the coordinates\n * @returns min and max, or null when none is placed\n */\nfunction boundsOf(values: Float64Array): FilePositions[\"bounds\"] {\n    const min: Point = [Infinity, Infinity, Infinity];\n    const max: Point = [-Infinity, -Infinity, -Infinity];\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        for (let k = 0; k < 3; k++) {\n            min[k] = Math.min(min[k], values[i + k]);\n            max[k] = Math.max(max[k], values[i + k]);\n        }\n    }\n    return min[0] === Infinity ? null : { min, max };\n}\n"],"names":["a","w"],"mappings":";;;AAUO,MAAM,iBAAiB,OAAO,OAAO;AAAA;AAAA,EAExC,SAAS;AAAA;AAAA,EAET,SAAS;AAAA;AAAA,EAET,YAAY;AAAA;AAAA,EAEZ,YAAY;AAAA;AAAA,EAEZ,gBAAgB;AAAA;AAAA,EAEhB,aAAa;AAAA;AAAA,EAEb,UAAU;AACd,CAAU;AClBV,MAAM,cAAc;AAEpB,MAAM,oBAAoB;AA+BnB,MAAM,cAAgC;AAAA,EAChC,6BAAa,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQtB,IAAI,MAAS,SAAqB,CAAA,GAAI,WAA0B,MAAY;AACxE,UAAM,MAAM,GAAG,IAAI,KAAS,YAAY,EAAE;AAC1C,QAAI,OAAO,KAAK,OAAO,IAAI,GAAG;AAC9B,QAAI,SAAS,QAAW;AACpB,aAAO,EAAE,MAAM,UAAU,OAAO,GAAG,SAAS,CAAA,GAAI,UAAU,oBAAI,OAAO,WAAW,MAAA;AAChF,WAAK,OAAO,IAAI,KAAK,IAAI;AAAA,IAC7B;AACA,SAAK,SAAS,OAAO,SAAS;AAC9B,QAAI,OAAO,YAAY,QAAW;AAC9B,WAAK,YAAY;AAAA,IACrB,OAAO;AACH,WAAK,SAAS,IAAI,OAAO,OAAO;AAAA,IACpC;AACA,QAAI,OAAO,WAAW,UAAa,KAAK,QAAQ,SAAS,aAAa;AAClE,YAAM,SAAS,WAAW,OAAO,MAAM;AACvC,UAAI,CAAC,KAAK,QAAQ,SAAS,MAAM,GAAG;AAChC,aAAK,QAAQ,KAAK,MAAM;AAAA,MAC5B;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAA2B;AACvB,WAAO,MAAM,KAAK,KAAK,OAAO,OAAA,GAAU,CAAC,OAAO;AAAA,MAC5C,MAAM,EAAE;AAAA,MACR,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE;AAAA,MACT,SAAS,CAAC,GAAG,EAAE,OAAO;AAAA,MACtB,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,UAAU,MAAM,KAAK,EAAE,QAAQ,EAAE,KAAK,CAACA,IAAG,MAAMA,KAAI,CAAC;AAAA,IAAA,EAC1F;AAAA,EACN;AACJ;AAOA,SAAS,WAAW,OAAwB;AACxC,QAAM,OAAO,OAAO,UAAU,WAAW,QAAS,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK;AACvF,SAAO,KAAK,SAAS,oBAAoB,GAAG,KAAK,MAAM,GAAG,oBAAoB,CAAC,CAAC,QAAQ;AAC5F;ACjDA,MAAM,mBAAwC,oBAAI,IAAI,CAAC,sBAAsB,gBAAgB,CAAC;AAG9F,MAAM,UAAsD;AAAA,EACxD,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,uBAAuB;AAAA,EACvB,uBAAuB;AAAA,EACvB,2BAA2B;AAAA,EAC3B,wBAAwB;AAAA,EACxB,sBAAsB;AAC1B;AAkBO,SAAS,iBACZ,UACA,UACA,QACA,UAAmC,CAAA,GACf;AACpB,QAAM,SAAS,QAAQ,UAAU;AACjC,UAAQ,eAAA;AACR,QAAM,QAAQ,IAAI,cAAA;AAClB,QAAM,WAAW,WAAW,UAAU,UAAU,MAAM;AACtD,MAAI,aAAa,MAAM;AACnB,eAAW,UAAU,KAAK;AAC1B,WAAO,MAAM,OAAO,WAAW,IAAI,OAAO,eAAe,UAAU,UAAU,KAAK;AAAA,EACtF;AACA,QAAM,IAAI,SAAS;AACnB,QAAM,SAAS,SAAS,GAAG,UAAU,KAAK;AAC1C,UAAQ,eAAA;AACR,QAAM,aAAa,aAAa,QAAQ;AACxC,QAAM,SAAS,YAAY,UAAU,MAAM;AAC3C,gBAAc,UAAU,QAAQ,YAAY,MAAM;AAClD,QAAM,EAAE,QAAQ,MAAA,IAAU,YAAY,QAAQ,YAAY,KAAK;AAC/D,QAAM,UAAU,YAAY,QAAQ,QAAQ,KAAK;AACjD,aAAW,QAAQ,KAAK;AACxB,iBAAe,UAAU,KAAK;AAC9B,SAAO;AAAA,IACH,SAAS;AAAA,IACT,QAAQ;AAAA,MACJ,QAAQ,SAAS;AAAA,MACjB,MAAM,SAAS,QAAQ,OAAO,SAAS,KAAK,OAAO;AAAA,MACnD,OAAO,SAAS,MAAM,SAAS;AAAA,IAAA;AAAA,IAEnC,OAAO,SAAS,MAAM,SAAS;AAAA,IAC/B,GAAI,SAAS,MAAM,cAAc,SAAY,KAAK,EAAE,WAAW,SAAS,MAAM,UAAA;AAAA,IAC9E,gBAAgB,SAAS,kBAAkB,WAAW,SAAS,MAAM,GAAG,UAAU;AAAA,IAClF,MAAM,OAAO,QAAQ,IAAI;AAAA,IACzB,QAAQ,OAAO;AAAA,IACf,QAAQ,UAAU,IAAI;AAAA,IACtB;AAAA,IACA,QAAQ,CAAC,WAAW,SAAS;AAAA,IAC7B,QAAQ,UAAU,OAAO,SAAS,OAAO,MAAM;AAAA,IAC/C;AAAA,IACA,OAAO,SAAS,KAAK;AAAA,EAAA;AAE7B;AAWA,SAAS,WAAW,UAAyB,UAAyB,QAA6C;AAC/G,QAAM,OAAO,SAAS,YAAY,UAAU,EAAE,OAAA,CAAQ,KAAK;AAC3D,MAAI,MAAM,MAAM,UAAa,KAAK,MAAM,QAAW;AAC/C,WAAO,cAAc,UAAU,IAAI;AAAA,EACvC;AACA,QAAM,SAAS,MAAM,WAAW,SAAY,SAAS,MAAM,OAAO,UAAU,IAAI,SAAS,MAAM,IAAI,KAAK,MAAM;AAC9G,MAAI,WAAW,QAAQ,OAAO,KAAK,aAAa,GAAG;AAC/C,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,EAAE,GAAG,QAAQ,OAAO,KAAK,KAAK,GAAG,GAAG,QAAQ,QAAQ,CAAA,CAAE,EAAA;AACpE,SAAO,EAAE,MAAM,aAAa,MAAM,GAAG,MAAM,WAAW,UAAU,KAAK,GAAG,OAAO,GAAG,WAAW,IAAI,EAAA;AACrG;AAQA,SAAS,cAAc,UAAyB,MAA0C;AACtF,QAAM,IAAI,SAAS,MAAM,IAAI,KAAK,KAAK,EAAE;AACzC,QAAM,IAAI,SAAS,MAAM,IAAI,KAAK,KAAK,EAAE;AACzC,QAAM,IAAI,KAAK,MAAM,SAAY,OAAO,SAAS,MAAM,IAAI,KAAK,CAAC;AACjE,MAAI,MAAM,QAAQ,MAAM,MAAM;AAC1B,WAAO;AAAA,EACX;AACA,QAAM,OAAkB,CAAC,KAAK,QAAQ;AAClC,QAAI,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG;AAChC,aAAO;AAAA,IACX;AACA,QAAI,CAAC,IAAI,OAAO,EAAE,MAAM,GAAG,CAAC;AAC5B,QAAI,CAAC,IAAI,OAAO,EAAE,MAAM,GAAG,CAAC;AAC5B,QAAI,CAAC,IAAI,GAAG,MAAM,GAAG,MAAM,OAAO,OAAO,EAAE,MAAM,GAAG,CAAC,IAAI;AACzD,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,EAAE,GAAG,QAAQ,IAAI,GAAG,YAAY,MAAM,OAAO,IAAI,EAAA;AAC/D,SAAO,EAAE,MAAM,MAAM,WAAW,UAAU,KAAK,GAAG,OAAO,GAAG,WAAW,IAAI,EAAA;AAC/E;AAOA,SAAS,WAAW,MAAsF;AACtG,SAAO,EAAE,QAAQ,MAAM,UAAU,CAAA,GAAI,gBAAgB,MAAM,gBAAgB,MAAM,MAAM,KAAA;AAC3F;AAOA,SAAS,aAAa,QAA2B;AAC7C,SAAO,CAAC,KAAK,QAAQ;AACjB,QAAI,CAAC,OAAO,MAAM,GAAG,GAAG;AACpB,aAAO;AAAA,IACX;AACA,UAAM,IAAI,OAAO,MAAM,GAAG;AAC1B,QAAI,CAAC,IAAI,EAAE,CAAC;AACZ,QAAI,CAAC,IAAI,EAAE,CAAC;AACZ,QAAI,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAC,IAAI;AAC/B,WAAO;AAAA,EACX;AACJ;AAOA,SAAS,QAAQ,QAAqC;AAClD,QAAM,QAAQ;AACd,QAAM,MAA+B,CAAA;AACrC,QAAM,OAAO,CAAC,KAAgC,OAAsC;AAChF,QAAI,GAAG,MAAM,GAAG,CAAC,GAAG;AAChB,UAAI,GAAG,IAAI,MAAM,GAAG;AAAA,IACxB;AAAA,EACJ;AACA,OAAK,SAAS,CAAC,MAAM,MAAM,QAAQ,MAAM,MAAM;AAC/C,OAAK,cAAc,CAAC,MAAM,MAAM,KAAK,MAAM,CAAC;AAC5C,OAAK,SAAS,CAAC,MAAM,MAAM,QAAQ,MAAM,MAAM;AAC/C,OAAK,UAAU,CAAC,MAAM,MAAM,YAAY,MAAM,UAAU;AACxD,OAAK,SAAS,CAAC,MAAM,OAAO,MAAM,QAAQ;AAC1C,OAAK,UAAU,CAAC,MAAM,OAAO,MAAM,QAAQ;AAC3C,OAAK,aAAa,CAAC,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,KAAK,IAAI,CAAC;AAC7E,OAAK,WAAW,CAAC,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,CAAC;AAClE,OAAK,gBAAgB,CAAC,MAAM,OAAO,MAAM,SAAS;AAClD,SAAO;AACX;AAiBA,SAAS,SAAS,GAAW,UAAoB,OAA8C;AAC3F,QAAM,SAAS,IAAI,aAAa,IAAI,CAAC,EAAE,KAAK,OAAO,GAAG;AACtD,QAAM,IAAW,CAAC,GAAG,GAAG,CAAC;AACzB,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,QAAI,CAAC,SAAS,KAAK,KAAK,CAAC,GAAG;AACxB;AAAA,IACJ;AACA,QAAI,OAAO,SAAS,EAAE,CAAC,CAAC,KAAK,OAAO,SAAS,EAAE,CAAC,CAAC,KAAK,OAAO,SAAS,EAAE,CAAC,CAAC,GAAG;AACzE,aAAO,IAAI,GAAG,IAAI,GAAG;AAAA,IACzB,OAAO;AACH,YAAM,IAAI,eAAe,YAAY,EAAE,SAAS,KAAK,QAAQ,EAAE,KAAK,GAAG,EAAA,CAAG;AAAA,IAC9E;AAAA,EACJ;AACA,MAAI,SAAS,MAAM,iBAAiB,MAAM;AACtC,iBAAa,MAAM;AAAA,EACvB;AACA,QAAM,QAAQ,SAAS,MAAM,eAAe,KAAK,CAAC,UAAU,MAAM;AAClE,cAAY,QAAQ,SAAS,OAAO,SAAS,MAAM,OAAO,KAAK;AAC/D,SAAO,EAAE,QAAQ,MAAA;AACrB;AAUA,SAAS,YACL,QACA,OACA,MACA,OACA,OACI;AACJ,QAAM,IAAW,CAAC,GAAG,GAAG,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,UAAM,IAAI,MAAM,WAAW,aAAa,KAAK,IAAI,CAAC,IAAI;AACtD,QAAI,MAAM,WAAW,cAAc,MAAM,MAAM;AAC3C,YAAM,IAAI,eAAe,gBAAgB,EAAE,SAAS,IAAI,GAAG;AAAA,IAC/D;AACA,MAAE,CAAC,IAAI,OAAO,CAAC;AACf,MAAE,CAAC,IAAI,OAAO,IAAI,CAAC;AACnB,MAAE,CAAC,IAAI,OAAO,IAAI,CAAC;AACnB,cAAU,GAAG,OAAO,GAAG,KAAK;AAC5B,WAAO,IAAI,GAAG,CAAC;AAAA,EACnB;AACJ;AAQA,SAAS,WAAW,UAAyB,OAAwC;AACjF,QAAMC,KAAI,MAAM,UAAU,SAAY,OAAO,SAAS,MAAM,IAAI,MAAM,KAAK;AAC3E,QAAM,IAAI,MAAM,WAAW,SAAY,OAAO,SAAS,MAAM,IAAI,MAAM,MAAM;AAC7E,MAAIA,OAAM,QAAQ,MAAM,MAAM;AAC1B,WAAO,MAAM;AAAA,EACjB;AACA,SAAO,CAAC,QAAQ;AACZ,QAAI,CAACA,GAAE,MAAM,GAAG,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG;AAChC,aAAO;AAAA,IACX;AACA,UAAM,OAAyB,CAAC,OAAOA,GAAE,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC;AAC1E,WAAO,OAAO,SAAS,KAAK,CAAC,CAAC,KAAK,OAAO,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO;AAAA,EACzE;AACJ;AAOA,SAAS,aAAa,QAA4B;AAC9C,QAAM,QAAkB,CAAA;AACxB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,MAAM,GAAG;AACxC,YAAM,KAAK,CAAC;AAAA,IAChB,WAAW,CAAC,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACjC;AAAA,IACJ;AAAA,EACJ;AACA,MAAI,MAAM,UAAU,KAAK,SAAS,GAAG;AACjC,eAAW,KAAK,OAAO;AACnB,aAAO,KAAK,OAAO,KAAK,GAAG,IAAI,CAAC;AAAA,IACpC;AAAA,EACJ;AACJ;AAOA,SAAS,UAAU,QAA+B;AAC9C,MAAI,IAAI,OAAO;AACf,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,QAAI,OAAO,MAAM,CAAC,GAAG;AACjB,UAAI,OAAO,IAAI,CAAC;AAAA,IACpB,WAAW,OAAO,IAAI,CAAC,MAAM,GAAG;AAC5B,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AASA,SAAS,aAAa,UAAsC;AACxD,QAAM,0BAAU,IAAA;AAChB,QAAM,SAAS,SAAS,MAAM,OAAO,QAAQ;AAC7C,MAAI,WAAW,MAAM;AACjB,WAAO;AAAA,EACX;AACA,WAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC1C,UAAM,IAAI,OAAO,MAAM,GAAG,IAAI,OAAO,MAAM,GAAG,IAAI;AAClD,QAAI,OAAO,MAAM,UAAU;AACvB,UAAI,IAAI,CAAC;AAAA,IACb;AAAA,EACJ;AACA,SAAO;AACX;AASA,SAAS,YAAY,UAAoB,MAAiC;AACtE,QAAM,MAA2B,CAAA;AACjC,aAAW,EAAE,MAAM,IAAA,KAAS,SAAS,QAAQ;AACzC,UAAM,IAAW,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC;AACjC,cAAU,GAAG,SAAS,OAAO,CAAC,IAAI,OAAO,IAAI,MAAM,GAAG,KAAK;AAC3D,QAAI,OAAO,MAAM,KAAK,OAAO,IAAI,IAAI,CAAC,GAAG;AACrC,WAAK,OAAO,IAAI,GAAG,IAAI,IAAI;AAAA,IAC/B;AACA,QAAI,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,GAAG;AACnC,UAAI,KAAK,EAAE,MAAM,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,OAAO,IAAI,OAAO,QAAQ,IAAI,OAAA,GAAU;AAAA,IACtF;AAAA,EACJ;AACA,SAAO;AACX;AASA,SAAS,cACL,UACA,MACA,YACA,QACI;AACJ,aAAW,QAAQ,YAAY;AAC3B,UAAM,OAAO,SAAS,KAAK,IAAI;AAC/B,UAAM,IAAI,IAAI;AACd,QAAI,SAAS,QAAQ,CAAC,OAAO,MAAM,KAAK,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,GAAG;AACxF,aAAO,KAAK,EAAE,MAAM,KAAK,EAAE,GAAG,KAAK,OAAO,CAAC,GAAG,GAAG,KAAK,OAAO,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAA,EAAE,CAAG;AAAA,IAC5G;AAAA,EACJ;AACJ;AAWA,SAAS,YACL,MACA,YACA,OACiC;AACjC,QAAM,EAAE,WAAW;AACnB,QAAM,WAAqB,CAAA;AAC3B,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,WAAS,MAAM,GAAG,IAAI,MAAM,OAAO,QAAQ,OAAO;AAC9C,UAAM,MAAM,CAAC,OAAO,MAAM,OAAO,IAAI,GAAG,CAAC;AACzC,QAAI,KAAK;AACL;AAAA,IACJ,WAAW,CAAC,WAAW,IAAI,GAAG,GAAG;AAC7B,eAAS,KAAK,GAAG;AAAA,IACrB;AACA,aAAS,OAAO,CAAC,WAAW,IAAI,GAAG,IAAI,IAAI;AAAA,EAC/C;AACA,MAAI,SAAS,KAAK,SAAS,SAAS,GAAG;AACnC,eAAW,WAAW,UAAU;AAC5B,YAAM,IAAI,eAAe,SAAS,EAAE,SAAS;AAAA,IACjD;AAAA,EACJ;AACA,SAAO,EAAE,QAAQ,MAAA;AACrB;AASA,SAAS,YAAY,MAAY,QAAgB,OAAiD;AAC9F,MAAI,SAAS,GAAG;AACZ,WAAO;AAAA,EACX;AACA,QAAM,EAAE,WAAW;AACnB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,QAAI,QAAQ,GAAG;AACX,cAAQ;AAAA,IACZ,WACI,OAAO,CAAC,MAAM,OAAO,KAAK,KAC1B,OAAO,IAAI,CAAC,MAAM,OAAO,QAAQ,CAAC,KAClC,OAAO,IAAI,CAAC,MAAM,OAAO,QAAQ,CAAC,GACpC;AACE,aAAO;AAAA,IACX;AAAA,EACJ;AACA,QAAM,IAAI,eAAe,SAAS;AAAA,IAC9B,OAAO;AAAA,IACP,QAAQ,MAAM,KAAK,OAAO,SAAS,OAAO,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG;AAAA,EAAA,CACjE;AACD,SAAO,KAAK,OAAO,GAAG;AACtB,SAAO;AACX;AAOA,SAAS,WAAW,QAAsB,OAA8C;AACpF,aAAW,SAAS,OAAO,QAAQ;AAC/B,QAAI,iBAAiB,IAAI,MAAM,IAAI,GAAG;AAClC,YAAM,IAAI,eAAe,YAAY,EAAE,QAAQ,MAAM,MAAM;AAAA,IAC/D;AAAA,EACJ;AACJ;AAOA,SAAS,eAAe,UAAyB,OAA8C;AAC3F,aAAW,UAAU,SAAS,OAAO;AACjC,QAAI,iBAAiB,KAAK,OAAO,KAAK,IAAI,KAAK,OAAO,KAAK,SAAS,MAAM;AACtE,YAAM,IAAI,eAAe,aAAa,EAAE,QAAQ,OAAO,KAAK,MAAM;AAAA,IACtE;AAAA,EACJ;AACJ;AAOA,SAAS,WAAW,UAAyB,OAA8C;AACvF,QAAM,UAAU,CAAC,SACb,CAAC,GAAG,SAAS,KAAK,EAAE;AAAA,IAChB,CAAC,MAAM,EAAE,KAAK,KAAK,YAAA,MAAkB,QAAQ,EAAE,KAAK,eAAe,KAAK,UAAU,EAAE,KAAK;AAAA,EAAA;AAEjG,QAAM,IAAI,QAAQ,GAAG;AACrB,QAAM,IAAI,QAAQ,GAAG;AACrB,MAAI,MAAM,UAAa,MAAM,QAAW;AACpC,UAAM,IAAI,eAAe,UAAU,EAAE,QAAQ,EAAE,KAAK,MAAM;AAC1D,UAAM,IAAI,eAAe,UAAU,EAAE,QAAQ,EAAE,KAAK,MAAM;AAAA,EAC9D;AACJ;AAOA,SAAS,UAAU,OAAwB;AACvC,SAAO,UAAU,SAAS,UAAU,SAAS,UAAU,SAAS,UAAU,SAAS,UAAU;AACjG;AAOA,SAAS,SAAS,OAAwD;AACtE,SAAO,MAAM,KAAA,EAAO,IAAI,CAAC,OAAO;AAAA,IAC5B,MAAM,EAAE;AAAA,IACR,QAAQ,EAAE,OAAO,EAAE,OAAO,SAAS,EAAE,QAAA;AAAA,IACrC,UAAU,EAAE;AAAA,IACZ,SAAS,GAAG,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK;AAAA,EAAA,EACzC;AACN;AASA,SAAS,eACL,UACA,UACA,OACa;AACb,SAAO;AAAA,IACH,SAAS;AAAA,IACT,QAAQ,EAAE,QAAQ,SAAS,QAAQ,MAAM,OAAO,SAAS,KAAK,OAAO,GAAG,OAAO,KAAA;AAAA,IAC/E,OAAO;AAAA,IACP,gBAAgB;AAAA,IAChB,MAAM;AAAA,IACN,QAAQ,IAAI,aAAa,IAAI,SAAS,SAAS,EAAE,KAAK,OAAO,GAAG;AAAA,IAChE,QAAQ;AAAA,IACR,OAAO,SAAS;AAAA,IAChB,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ,CAAA;AAAA,IACR,OAAO,SAAS,KAAK;AAAA,EAAA;AAE7B;AAWA,SAAS,WAAW,MAAkB,GAAW,YAAgD;AAC7F,QAAM,QAAkB,CAAA;AACxB,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,UAAM,IAAI,WAAW,IAAI,GAAG,IAAI,OAAO,KAAK,GAAG;AAC/C,QAAI,MAAM,MAAM;AACZ,YAAM,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AAAA,IAChC;AAAA,EACJ;AACA,SAAO,OAAO,KAAK;AACvB;AAOA,SAAS,SAAS,QAA+C;AAC7D,QAAM,MAAa,CAAC,UAAU,UAAU,QAAQ;AAChD,QAAM,MAAa,CAAC,WAAW,WAAW,SAAS;AACnD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,UAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC;AACvC,UAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC;AAAA,IAC3C;AAAA,EACJ;AACA,SAAO,IAAI,CAAC,MAAM,WAAW,OAAO,EAAE,KAAK,IAAA;AAC/C;"}
+{"version":3,"file":"positions.js","sources":["../src/positions/codes.ts","../src/common/notes.ts","../src/positions/extract.ts"],"sourcesContent":["/**\n * The note codes of `extractPositions()`. Singular `W_POSITION_*` codes are about some nodes,\n * plural `W_POSITIONS_*` codes about the file as a whole. Keys drop the `W_` and `POSITION_` /\n * `POSITIONS_` prefixes.\n */\n\n/**\n * Every code a `PositionNote` carries.\n * @category Positions\n */\nexport const POSITION_ISSUE = Object.freeze({\n    /** Every placed node sits on one point; the coordinates are dropped and `usable` is false. */\n    STACKED: \"W_POSITION_STACKED\",\n    /** Some nodes have no position. */\n    PARTIAL: \"W_POSITION_PARTIAL\",\n    /** Some coordinates are not finite numbers; those nodes count as unplaced. */\n    NON_FINITE: \"W_POSITION_NON_FINITE\",\n    /** The file mixes 2- and 3-coordinate positions. */\n    DIMS_MIXED: \"W_POSITION_DIMS_MIXED\",\n    /** A top-left coordinate has no width or height, so it was not moved to the center. */\n    ANCHOR_NO_SIZE: \"W_POSITION_ANCHOR_NO_SIZE\",\n    /** The file holds more than one view (layout); only the first is used. */\n    OTHER_VIEWS: \"W_POSITION_OTHER_VIEWS\",\n    /** The file has position-like columns this format does not read (plain `x` / `y`). */\n    NOT_READ: \"W_POSITIONS_NOT_READ\",\n} as const);\n\n/**\n * A code of `POSITION_ISSUE`.\n * @category Positions\n */\nexport type PositionNoteCode = (typeof POSITION_ISSUE)[keyof typeof POSITION_ISSUE];\n","/**\n * The note collector file positions use (and file styles, after their rebase): one note per code\n * (and optional property), never one per element, with at most 8 distinct samples of 80\n * characters, a total count and the element indexes the note covers.\n */\n\n/** At most this many samples per note. */\nconst MAX_SAMPLES = 8;\n/** A sample is cut to this many characters. */\nconst MAX_SAMPLE_LENGTH = 80;\n\n/** One occurrence (or `count` occurrences) of a condition. */\ninterface NoteReport {\n    /** An example of the offending value. */\n    readonly sample?: unknown;\n    /** The element the report is about, by index. */\n    readonly element?: number;\n    /** How many occurrences the report stands for; defaults to 1. */\n    readonly count?: number;\n}\n\n/** A collected note, before a module shapes it into its own note type. */\ninterface CollectedNote<C extends string> {\n    readonly code: C;\n    readonly property: string | null;\n    readonly count: number;\n    readonly samples: readonly string[];\n    readonly elements: readonly number[] | { readonly count: number };\n}\n\ninterface Collecting<C extends string> {\n    readonly code: C;\n    readonly property: string | null;\n    count: number;\n    readonly samples: string[];\n    readonly elements: Set<number>;\n    unindexed: boolean;\n}\n\n/** Collects notes, aggregated per (code, property), in the order their conditions first occur. */\nexport class NoteCollector<C extends string> {\n    readonly #notes = new Map<string, Collecting<C>>();\n\n    /**\n     * Record a condition.\n     * @param code - the condition\n     * @param report - a sample, the element index and a count\n     * @param property - what the note is about, or null\n     */\n    add(code: C, report: NoteReport = {}, property: string | null = null): void {\n        const key = `${code}\\u0000${property ?? \"\"}`;\n        let note = this.#notes.get(key);\n        if (note === undefined) {\n            note = { code, property, count: 0, samples: [], elements: new Set(), unindexed: false };\n            this.#notes.set(key, note);\n        }\n        note.count += report.count ?? 1;\n        if (report.element === undefined) {\n            note.unindexed = true;\n        } else {\n            note.elements.add(report.element);\n        }\n        if (report.sample !== undefined && note.samples.length < MAX_SAMPLES) {\n            const sample = sampleText(report.sample);\n            if (!note.samples.includes(sample)) {\n                note.samples.push(sample);\n            }\n        }\n    }\n\n    /**\n     * The collected notes.\n     * @returns one note per (code, property)\n     */\n    list(): CollectedNote<C>[] {\n        return Array.from(this.#notes.values(), (n) => ({\n            code: n.code,\n            property: n.property,\n            count: n.count,\n            samples: [...n.samples],\n            elements: n.unindexed ? { count: n.count } : Array.from(n.elements).sort((a, b) => a - b),\n        }));\n    }\n}\n\n/**\n * A sample as at most 80 characters of text.\n * @param value - the sample\n * @returns the text\n */\nfunction sampleText(value: unknown): string {\n    const text = typeof value === \"string\" ? value : (JSON.stringify(value) ?? String(value));\n    return text.length > MAX_SAMPLE_LENGTH ? `${text.slice(0, MAX_SAMPLE_LENGTH - 3)}...` : text;\n}\n","/**\n * `extractPositions()`: any format's stored node coordinates in the neutral convention (center,\n * y up, the file's unit, 3 components). The snapshot's role-`position` column keeps the values the\n * file wrote; this reads them through the spelling the column's `meta.extra` (or the importer's\n * `positions()` hook) declares.\n */\n\nimport type { Column, GraphSnapshot } from \"@graphty/graph-format\";\n\nimport { NoteCollector } from \"../common/notes.js\";\nimport { type GraphTool, toolOf } from \"../common/units.js\";\nimport type { GraphImporter, ImportReport } from \"../types.js\";\nimport { POSITION_ISSUE, type PositionNoteCode } from \"./codes.js\";\nimport { median, toNeutral } from \"./convert.js\";\nimport type {\n    ExtractPositionsOptions,\n    FilePositionGroup,\n    FilePositions,\n    ImporterGroupBox,\n    ImporterPositions,\n    PositionColumnExtra,\n    PositionNote,\n} from \"./types.js\";\n\ntype Point = [number, number, number];\n\n/** Reads one row's raw coordinates into `out`; false when the row has none. */\ntype RowReader = (row: number, out: Point) => boolean;\n\n/** Reads one row's width and height; null when the row has no size. */\ntype SizeReader = (row: number) => readonly [number, number] | null;\n\n/** Where a file's coordinates are and how they are spelled. */\ninterface Spelling {\n    readonly read: RowReader;\n    /** Reads a row's width and height from the size columns the spelling names; null without both. */\n    readonly size: SizeReader;\n    readonly extra: PositionColumnExtra;\n    readonly groups: readonly ImporterGroupBox[];\n    readonly medianNodeSize: number | null | undefined;\n    readonly tool: GraphTool | null | undefined;\n}\n\n/** Report codes of format readers that mean the file mixes 2- and 3-coordinate positions. */\nconst DIMS_MIXED_CODES: ReadonlySet<string> = new Set([\"W_PAJEK_COORD_DIMS\", \"W_DOT_POS_DIMS\"]);\n\n/** graph-io's English for each note, for its own logs only. */\nconst PHRASES: Readonly<Record<PositionNoteCode, string>> = {\n    W_POSITION_STACKED: \"every placed node is on one point; the positions were dropped\",\n    W_POSITION_PARTIAL: \"nodes have no position\",\n    W_POSITION_NON_FINITE: \"positions are not finite numbers\",\n    W_POSITION_DIMS_MIXED: \"positions mix 2 and 3 coordinates\",\n    W_POSITION_ANCHOR_NO_SIZE: \"top-left positions have no size and were not moved to the center\",\n    W_POSITION_OTHER_VIEWS: \"other views were not used\",\n    W_POSITIONS_NOT_READ: \"position-like columns this format does not read\",\n};\n\n/**\n * A file's stored node coordinates in the neutral convention: each node's center, y up, in the\n * file's own unit. Call it with the importer that read the snapshot and the report it returned.\n * @example\n * ```ts\n * const { snapshot, report } = await importGraph(text, { format: \"gml\" });\n * const positions = extractPositions(gmlImporter, snapshot, report);\n * if (positions?.usable) console.log(positions.coords.subarray(0, 3)); // node 0's x, y, z\n * ```\n * @param importer - the importer that read the snapshot (its `positions()` hook, when it has one, says how the coordinates are spelled)\n * @param snapshot - the imported graph\n * @param report - the import's report\n * @param options - `signal` to abort\n * @returns the positions, or null when the file stores none and has no position-like columns\n * @category Positions\n */\nexport function extractPositions(\n    importer: GraphImporter,\n    snapshot: GraphSnapshot,\n    report: ImportReport,\n    options: ExtractPositionsOptions = {},\n): FilePositions | null {\n    const signal = options.signal ?? null;\n    signal?.throwIfAborted();\n    const notes = new NoteCollector<PositionNoteCode>();\n    const spelling = spellingOf(importer, snapshot, signal);\n    if (spelling === null) {\n        noteUnread(snapshot, notes);\n        return notes.list().length === 0 ? null : emptyPositions(importer, snapshot, notes);\n    }\n    const n = snapshot.nodeCount;\n    const coords = readRows(n, spelling, notes);\n    signal?.throwIfAborted();\n    const containers = containersOf(snapshot);\n    if (spelling.extra.containersFollowChildren === true) {\n        for (const row of containers) {\n            coords.values.fill(Number.NaN, 3 * row, 3 * row + 3);\n        }\n    }\n    const groups = applyGroups(spelling, coords);\n    collectGroups(spelling, coords, containers, groups);\n    const { placed, total } = countPlaced(coords, containers, notes);\n    const stacked = dropStacked(coords, placed, notes);\n    noteReport(report, notes);\n    noteOtherViews(snapshot, notes);\n    return {\n        version: 1,\n        source: {\n            format: importer.format,\n            tool: spelling.tool ?? toolOf(snapshot.meta.creator),\n            yAxis: spelling.extra.yAxis ?? \"up\",\n        },\n        units: spelling.extra.units ?? \"file\",\n        ...(spelling.extra.pxPerUnit === undefined ? {} : { pxPerUnit: spelling.extra.pxPerUnit }),\n        ...(spelling.extra.viewerFit === undefined ? {} : { viewerFit: spelling.extra.viewerFit }),\n        medianNodeSize: spelling.medianNodeSize ?? medianSize(spelling.size, n, containers),\n        dims: coords.realZ ? 3 : 2,\n        coords: coords.values,\n        placed: stacked ? 0 : placed,\n        total,\n        usable: !stacked && placed > 0,\n        bounds: stacked ? null : boundsOf(coords.values),\n        groups,\n        notes: noteList(notes),\n    };\n}\n\n// ------------------------------------------------------------ spelling\n\n/**\n * Where the coordinates are: the importer's hook wins over the column's `meta.extra`.\n * @param importer - the importer\n * @param snapshot - the graph\n * @param signal - the abort signal\n * @returns the spelling, or null when the file stores no coordinates\n */\nfunction spellingOf(importer: GraphImporter, snapshot: GraphSnapshot, signal: AbortSignal | null): Spelling | null {\n    const hook = importer.positions?.(snapshot, { signal }) ?? null;\n    if (hook?.x !== undefined && hook.y !== undefined) {\n        return plainSpelling(snapshot, hook);\n    }\n    const column = hook?.column === undefined ? snapshot.nodes.byRole(\"position\") : snapshot.nodes.get(hook.column);\n    if (column === null || column.meta.components < 2) {\n        return hook?.unplacedCircle === undefined ? null : circleSpelling(snapshot, hook);\n    }\n    const extra = { ...extraOf(column.meta.extra), ...extraOf(hook ?? {}) };\n    return { read: vectorReader(column), size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };\n}\n\n/**\n * The spelling of a file that places no node, whose program puts them round a circle (`unplacedCircle`).\n * @param snapshot - the graph\n * @param hook - the hook's answer, with its circle\n * @returns the spelling\n */\nfunction circleSpelling(snapshot: GraphSnapshot, hook: ImporterPositions): Spelling {\n    const circle = hook.unplacedCircle;\n    const n = snapshot.nodeCount;\n    const read: RowReader = (row, out) => {\n        if (circle === undefined || n === 0) {\n            return false;\n        }\n        const a = ((circle.startDegrees + (circle.direction * 360 * row) / n) * Math.PI) / 180;\n        out[0] = circle.center[0] + circle.radius * Math.cos(a);\n        out[1] = circle.center[1] + circle.radius * Math.sin(a);\n        out[2] = 0;\n        return true;\n    };\n    const extra = { ...extraOf(hook), sourceDims: 2 } as const;\n    return { read, size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };\n}\n\n/**\n * The spelling of the simple hook form: plain x / y (/ z) columns.\n * @param snapshot - the graph\n * @param hook - the hook's answer\n * @returns the spelling, or null when a named column is missing\n */\nfunction plainSpelling(snapshot: GraphSnapshot, hook: ImporterPositions): Spelling | null {\n    const x = snapshot.nodes.get(hook.x ?? \"\");\n    const y = snapshot.nodes.get(hook.y ?? \"\");\n    const z = hook.z === undefined ? null : snapshot.nodes.get(hook.z);\n    if (x === null || y === null) {\n        return null;\n    }\n    const read: RowReader = (row, out) => {\n        if (!x.isSet(row) || !y.isSet(row)) {\n            return false;\n        }\n        out[0] = Number(x.value(row));\n        out[1] = Number(y.value(row));\n        out[2] = z?.isSet(row) === true ? Number(z.value(row)) : 0;\n        return true;\n    };\n    const extra = { ...extraOf(hook), sourceDims: z === null ? 2 : 3 } as const;\n    return { read, size: sizeReader(snapshot, extra), extra, ...hookFields(hook) };\n}\n\n/**\n * The hook's fields beside the spelling.\n * @param hook - the hook's answer, or null\n * @returns groups, median node size and tool\n */\nfunction hookFields(hook: ImporterPositions | null): Pick<Spelling, \"groups\" | \"medianNodeSize\" | \"tool\"> {\n    return { groups: hook?.groups ?? [], medianNodeSize: hook?.medianNodeSize, tool: hook?.tool };\n}\n\n/**\n * A reader over a 2- or 3-component column.\n * @param column - the column\n * @returns the reader\n */\nfunction vectorReader(column: Column): RowReader {\n    return (row, out) => {\n        if (!column.isSet(row)) {\n            return false;\n        }\n        const v = column.value(row) as ArrayLike<number>;\n        out[0] = v[0];\n        out[1] = v[1];\n        out[2] = v.length > 2 ? v[2] : 0;\n        return true;\n    };\n}\n\n/**\n * The spelling fields of an extra (or a hook's answer), each kept only when well formed.\n * @param source - a column's meta.extra or a hook's answer\n * @returns the fields\n */\nfunction extraOf(source: object): PositionColumnExtra {\n    const extra = source as Readonly<Record<string, unknown>>;\n    const out: Record<string, unknown> = {};\n    const pick = (key: keyof PositionColumnExtra, ok: (v: unknown) => boolean): void => {\n        if (ok(extra[key])) {\n            out[key] = extra[key];\n        }\n    };\n    pick(\"units\", (v) => v === \"px\" || v === \"file\");\n    pick(\"sourceDims\", (v) => v === 2 || v === 3);\n    pick(\"yAxis\", (v) => v === \"up\" || v === \"down\");\n    pick(\"anchor\", (v) => v === \"center\" || v === \"top-left\");\n    pick(\"width\", (v) => typeof v === \"string\");\n    pick(\"height\", (v) => typeof v === \"string\");\n    pick(\"pxPerUnit\", (v) => typeof v === \"number\" && Number.isFinite(v) && v > 0);\n    pick(\"pxPerUnitY\", (v) => typeof v === \"number\" && Number.isFinite(v) && v > 0);\n    pick(\"zOrigin\", (v) => typeof v === \"number\" && Number.isFinite(v));\n    pick(\"zeroUnplaced\", (v) => typeof v === \"boolean\");\n    pick(\"originUnplaced\", (v) => typeof v === \"boolean\");\n    pick(\"containersFollowChildren\", (v) => typeof v === \"boolean\");\n    const fit = extra.viewerFit as Readonly<Record<string, unknown>> | null | undefined;\n    if (typeof fit?.padding === \"number\" && Number.isFinite(fit.padding) && fit.padding >= 0) {\n        out.viewerFit = { padding: fit.padding };\n    }\n    return out;\n}\n\n// ------------------------------------------------------------ rows\n\n/** Coordinates by node index, with whether the file has a z that differs between nodes. */\ninterface Rows {\n    readonly values: Float64Array;\n    readonly realZ: boolean;\n}\n\n/**\n * Read every row and convert it to the neutral convention.\n * @param n - the node count\n * @param spelling - how the coordinates are spelled\n * @param notes - receives non-finite and anchor notes\n * @returns the coordinates (NaN rows have none)\n */\nfunction readRows(n: number, spelling: Spelling, notes: NoteCollector<PositionNoteCode>): Rows {\n    const values = new Float64Array(3 * n).fill(Number.NaN);\n    const p: Point = [0, 0, 0];\n    for (let row = 0; row < n; row++) {\n        if (!spelling.read(row, p)) {\n            continue;\n        }\n        if (Number.isFinite(p[0]) && Number.isFinite(p[1]) && Number.isFinite(p[2])) {\n            values.set(p, 3 * row);\n        } else {\n            notes.add(POSITION_ISSUE.NON_FINITE, { element: row, sample: p.join(\",\") });\n        }\n    }\n    if (spelling.extra.zeroUnplaced === true) {\n        dropZeroPile(values);\n    }\n    if (spelling.extra.originUnplaced === true) {\n        placeUnplacedAtOrigin(values);\n    }\n    const realZ = spelling.extra.sourceDims === 3 && !constantZ(values);\n    convertRows(values, spelling.extra, spelling.size, realZ, notes);\n    return { values, realZ };\n}\n\n/**\n * Put every unplaced row at the origin, when at least one row is placed.\n * @param values - the coordinates, three per row; NaN rows are unplaced\n */\nfunction placeUnplacedAtOrigin(values: Float64Array): void {\n    if (!values.some((v) => !Number.isNaN(v))) {\n        return;\n    }\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            values.fill(0, i, i + 3);\n        }\n    }\n}\n\n/**\n * Convert every placed row in place.\n * @param values - the raw coordinates\n * @param extra - the spelling\n * @param size - reads a row's width and height\n * @param realZ - whether z differs between nodes\n * @param notes - receives the anchor note\n */\nfunction convertRows(\n    values: Float64Array,\n    extra: PositionColumnExtra,\n    size: SizeReader,\n    realZ: boolean,\n    notes: NoteCollector<PositionNoteCode>,\n): void {\n    const p: Point = [0, 0, 0];\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        const s = extra.anchor === \"top-left\" ? size(i / 3) : null;\n        if (extra.anchor === \"top-left\" && s === null) {\n            notes.add(POSITION_ISSUE.ANCHOR_NO_SIZE, { element: i / 3 });\n        }\n        p[0] = values[i];\n        p[1] = values[i + 1];\n        p[2] = values[i + 2];\n        toNeutral(p, extra, s, realZ);\n        values.set(p, i);\n    }\n}\n\n/**\n * Reads a row's width and height from the size columns a spelling names.\n * @param snapshot - the graph\n * @param extra - the spelling\n * @returns the reader; it answers null for a row without both, or when the columns are missing\n */\nfunction sizeReader(snapshot: GraphSnapshot, extra: PositionColumnExtra): SizeReader {\n    const w = extra.width === undefined ? null : snapshot.nodes.get(extra.width);\n    const h = extra.height === undefined ? null : snapshot.nodes.get(extra.height);\n    if (w === null || h === null) {\n        return () => null;\n    }\n    return (row) => {\n        if (!w.isSet(row) || !h.isSet(row)) {\n            return null;\n        }\n        const size: [number, number] = [Number(w.value(row)), Number(h.value(row))];\n        return Number.isFinite(size[0]) && Number.isFinite(size[1]) ? size : null;\n    };\n}\n\n/**\n * NetworkX writes (0, 0) for a node with no position: when other rows are placed, an exact (0, 0)\n * shared by two or more rows counts as unplaced.\n * @param values - the raw coordinates, changed in place\n */\nfunction dropZeroPile(values: Float64Array): void {\n    const zeros: number[] = [];\n    let others = 0;\n    for (let i = 0; i < values.length; i += 3) {\n        if (values[i] === 0 && values[i + 1] === 0) {\n            zeros.push(i);\n        } else if (!Number.isNaN(values[i])) {\n            others++;\n        }\n    }\n    if (zeros.length >= 2 && others > 0) {\n        for (const i of zeros) {\n            values.fill(Number.NaN, i, i + 3);\n        }\n    }\n}\n\n/**\n * Whether every placed row has the same z (Pajek writes z = 0.5 on 2D drawings).\n * @param values - the raw coordinates\n * @returns true when z never differs\n */\nfunction constantZ(values: Float64Array): boolean {\n    let z = Number.NaN;\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        if (Number.isNaN(z)) {\n            z = values[i + 2];\n        } else if (values[i + 2] !== z) {\n            return false;\n        }\n    }\n    return true;\n}\n\n// ------------------------------------------------------------ groups\n\n/**\n * The nodes another node names as its parent: group containers.\n * @param snapshot - the graph\n * @returns the container indexes\n */\nfunction containersOf(snapshot: GraphSnapshot): Set<number> {\n    const out = new Set<number>();\n    const parent = snapshot.nodes.byRole(\"parent\");\n    if (parent === null) {\n        return out;\n    }\n    for (let row = 0; row < parent.length; row++) {\n        const v = parent.isSet(row) ? parent.value(row) : undefined;\n        if (typeof v === \"number\") {\n            out.add(v);\n        }\n    }\n    return out;\n}\n\n/**\n * The hook's group boxes in the neutral convention; a container with no coordinate of its own is\n * placed at its box's center.\n * @param spelling - the spelling and the hook's boxes\n * @param rows - the coordinates, changed in place\n * @returns the boxes\n */\nfunction applyGroups(spelling: Spelling, rows: Rows): FilePositionGroup[] {\n    const out: FilePositionGroup[] = [];\n    for (const { node, box } of spelling.groups) {\n        const p: Point = [box.x, box.y, 0];\n        toNeutral(p, spelling.extra, [box.width, box.height], false);\n        if (Number.isNaN(rows.values[3 * node])) {\n            rows.values.set(p, 3 * node);\n        }\n        if (!out.some((g) => g.node === node)) {\n            out.push({ node, box: { x: p[0], y: p[1], width: box.width, height: box.height } });\n        }\n    }\n    return out;\n}\n\n/**\n * Boxes for the containers the file gives a coordinate and a size (yEd groups).\n * @param spelling - the size reader\n * @param rows - the coordinates\n * @param containers - the container indexes\n * @param groups - receives the boxes\n */\nfunction collectGroups(\n    spelling: Spelling,\n    rows: Rows,\n    containers: ReadonlySet<number>,\n    groups: FilePositionGroup[],\n): void {\n    for (const node of containers) {\n        const size = spelling.size(node);\n        const i = 3 * node;\n        if (size !== null && !Number.isNaN(rows.values[i]) && !groups.some((g) => g.node === node)) {\n            groups.push({ node, box: { x: rows.values[i], y: rows.values[i + 1], width: size[0], height: size[1] } });\n        }\n    }\n}\n\n// ------------------------------------------------------------ counts and notes\n\n/**\n * Count the placed rows and the rows that need a position; note the unplaced ones.\n * @param rows - the coordinates\n * @param containers - containers without a coordinate do not need one\n * @param notes - receives the partial note\n * @returns placed and total\n */\nfunction countPlaced(\n    rows: Rows,\n    containers: ReadonlySet<number>,\n    notes: NoteCollector<PositionNoteCode>,\n): { placed: number; total: number } {\n    const { values } = rows;\n    const unplaced: number[] = [];\n    let placed = 0;\n    let total = 0;\n    for (let row = 0; 3 * row < values.length; row++) {\n        const has = !Number.isNaN(values[3 * row]);\n        if (has) {\n            placed++;\n        } else if (!containers.has(row)) {\n            unplaced.push(row);\n        }\n        total += has || !containers.has(row) ? 1 : 0;\n    }\n    if (placed > 0 && unplaced.length > 0) {\n        for (const element of unplaced) {\n            notes.add(POSITION_ISSUE.PARTIAL, { element });\n        }\n    }\n    return { placed, total };\n}\n\n/**\n * Drop the coordinates when every placed node sits on one point.\n * @param rows - the coordinates, cleared in place when stacked\n * @param placed - the placed count\n * @param notes - receives the stacked note\n * @returns whether they were stacked\n */\nfunction dropStacked(rows: Rows, placed: number, notes: NoteCollector<PositionNoteCode>): boolean {\n    if (placed < 2) {\n        return false;\n    }\n    const { values } = rows;\n    let first = -1;\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        if (first < 0) {\n            first = i;\n        } else if (\n            values[i] !== values[first] ||\n            values[i + 1] !== values[first + 1] ||\n            values[i + 2] !== values[first + 2]\n        ) {\n            return false;\n        }\n    }\n    notes.add(POSITION_ISSUE.STACKED, {\n        count: placed,\n        sample: Array.from(values.subarray(first, first + 3)).join(\",\"),\n    });\n    values.fill(Number.NaN);\n    return true;\n}\n\n/**\n * Lift the format readers' mixed-dimension warnings into the shared code.\n * @param report - the import report\n * @param notes - receives the note\n */\nfunction noteReport(report: ImportReport, notes: NoteCollector<PositionNoteCode>): void {\n    for (const issue of report.issues) {\n        if (DIMS_MIXED_CODES.has(issue.code)) {\n            notes.add(POSITION_ISSUE.DIMS_MIXED, { sample: issue.code });\n        }\n    }\n}\n\n/**\n * Note the extra view columns of a CX file (`position@2`, ...): only the first view is used.\n * @param snapshot - the graph\n * @param notes - receives the note\n */\nfunction noteOtherViews(snapshot: GraphSnapshot, notes: NoteCollector<PositionNoteCode>): void {\n    for (const column of snapshot.nodes) {\n        if (/^position@\\d+$/.test(column.meta.name) && column.meta.role === null) {\n            notes.add(POSITION_ISSUE.OTHER_VIEWS, { sample: column.meta.name });\n        }\n    }\n}\n\n/**\n * Note plain numeric `x` and `y` node columns a format does not read as positions.\n * @param snapshot - the graph\n * @param notes - receives the note\n */\nfunction noteUnread(snapshot: GraphSnapshot, notes: NoteCollector<PositionNoteCode>): void {\n    const numeric = (name: string): Column | undefined =>\n        [...snapshot.nodes].find(\n            (c) => c.meta.name.toLowerCase() === name && c.meta.components === 1 && isNumeric(c.dtype),\n        );\n    const x = numeric(\"x\");\n    const y = numeric(\"y\");\n    if (x !== undefined && y !== undefined) {\n        notes.add(POSITION_ISSUE.NOT_READ, { sample: x.meta.name });\n        notes.add(POSITION_ISSUE.NOT_READ, { sample: y.meta.name });\n    }\n}\n\n/**\n * Whether a dtype holds numbers.\n * @param dtype - the dtype\n * @returns true for the numeric dtypes\n */\nfunction isNumeric(dtype: string): boolean {\n    return dtype === \"f64\" || dtype === \"f32\" || dtype === \"i32\" || dtype === \"u32\" || dtype === \"u8\";\n}\n\n/**\n * The notes with graph-io's English.\n * @param notes - the collector\n * @returns the notes\n */\nfunction noteList(notes: NoteCollector<PositionNoteCode>): PositionNote[] {\n    return notes.list().map((n) => ({\n        code: n.code,\n        params: { count: n.count, samples: n.samples },\n        elements: n.elements,\n        message: `${PHRASES[n.code]} (${n.count})`,\n    }));\n}\n\n/**\n * The answer for a file with no readable positions but position-like columns.\n * @param importer - the importer\n * @param snapshot - the graph\n * @param notes - the notes\n * @returns positions with nothing placed\n */\nfunction emptyPositions(\n    importer: GraphImporter,\n    snapshot: GraphSnapshot,\n    notes: NoteCollector<PositionNoteCode>,\n): FilePositions {\n    return {\n        version: 1,\n        source: { format: importer.format, tool: toolOf(snapshot.meta.creator), yAxis: \"up\" },\n        units: \"file\",\n        medianNodeSize: null,\n        dims: 2,\n        coords: new Float64Array(3 * snapshot.nodeCount).fill(Number.NaN),\n        placed: 0,\n        total: snapshot.nodeCount,\n        usable: false,\n        bounds: null,\n        groups: [],\n        notes: noteList(notes),\n    };\n}\n\n// ------------------------------------------------------------ sizes and bounds\n\n/**\n * The median node diameter from the size columns the spelling names.\n * @param size - the size reader\n * @param n - the node count\n * @param containers - group containers, left out\n * @returns the median of each node's mean of width and height, or null when no node has a size\n */\nfunction medianSize(size: SizeReader, n: number, containers: ReadonlySet<number>): number | null {\n    const sizes: number[] = [];\n    for (let row = 0; row < n; row++) {\n        const s = containers.has(row) ? null : size(row);\n        if (s !== null) {\n            sizes.push((s[0] + s[1]) / 2);\n        }\n    }\n    return median(sizes);\n}\n\n/**\n * The box around every placed row.\n * @param values - the coordinates\n * @returns min and max, or null when none is placed\n */\nfunction boundsOf(values: Float64Array): FilePositions[\"bounds\"] {\n    const min: Point = [Infinity, Infinity, Infinity];\n    const max: Point = [-Infinity, -Infinity, -Infinity];\n    for (let i = 0; i < values.length; i += 3) {\n        if (Number.isNaN(values[i])) {\n            continue;\n        }\n        for (let k = 0; k < 3; k++) {\n            min[k] = Math.min(min[k], values[i + k]);\n            max[k] = Math.max(max[k], values[i + k]);\n        }\n    }\n    return min[0] === Infinity ? null : { min, max };\n}\n"],"names":["a","w"],"mappings":";;;AAUO,MAAM,iBAAiB,OAAO,OAAO;AAAA;AAAA,EAExC,SAAS;AAAA;AAAA,EAET,SAAS;AAAA;AAAA,EAET,YAAY;AAAA;AAAA,EAEZ,YAAY;AAAA;AAAA,EAEZ,gBAAgB;AAAA;AAAA,EAEhB,aAAa;AAAA;AAAA,EAEb,UAAU;AACd,CAAU;AClBV,MAAM,cAAc;AAEpB,MAAM,oBAAoB;AA+BnB,MAAM,cAAgC;AAAA,EAChC,6BAAa,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQtB,IAAI,MAAS,SAAqB,CAAA,GAAI,WAA0B,MAAY;AACxE,UAAM,MAAM,GAAG,IAAI,KAAS,YAAY,EAAE;AAC1C,QAAI,OAAO,KAAK,OAAO,IAAI,GAAG;AAC9B,QAAI,SAAS,QAAW;AACpB,aAAO,EAAE,MAAM,UAAU,OAAO,GAAG,SAAS,CAAA,GAAI,UAAU,oBAAI,OAAO,WAAW,MAAA;AAChF,WAAK,OAAO,IAAI,KAAK,IAAI;AAAA,IAC7B;AACA,SAAK,SAAS,OAAO,SAAS;AAC9B,QAAI,OAAO,YAAY,QAAW;AAC9B,WAAK,YAAY;AAAA,IACrB,OAAO;AACH,WAAK,SAAS,IAAI,OAAO,OAAO;AAAA,IACpC;AACA,QAAI,OAAO,WAAW,UAAa,KAAK,QAAQ,SAAS,aAAa;AAClE,YAAM,SAAS,WAAW,OAAO,MAAM;AACvC,UAAI,CAAC,KAAK,QAAQ,SAAS,MAAM,GAAG;AAChC,aAAK,QAAQ,KAAK,MAAM;AAAA,MAC5B;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAA2B;AACvB,WAAO,MAAM,KAAK,KAAK,OAAO,OAAA,GAAU,CAAC,OAAO;AAAA,MAC5C,MAAM,EAAE;AAAA,MACR,UAAU,EAAE;AAAA,MACZ,OAAO,EAAE;AAAA,MACT,SAAS,CAAC,GAAG,EAAE,OAAO;AAAA,MACtB,UAAU,EAAE,YAAY,EAAE,OAAO,EAAE,UAAU,MAAM,KAAK,EAAE,QAAQ,EAAE,KAAK,CAACA,IAAG,MAAMA,KAAI,CAAC;AAAA,IAAA,EAC1F;AAAA,EACN;AACJ;AAOA,SAAS,WAAW,OAAwB;AACxC,QAAM,OAAO,OAAO,UAAU,WAAW,QAAS,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK;AACvF,SAAO,KAAK,SAAS,oBAAoB,GAAG,KAAK,MAAM,GAAG,oBAAoB,CAAC,CAAC,QAAQ;AAC5F;ACjDA,MAAM,mBAAwC,oBAAI,IAAI,CAAC,sBAAsB,gBAAgB,CAAC;AAG9F,MAAM,UAAsD;AAAA,EACxD,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,uBAAuB;AAAA,EACvB,uBAAuB;AAAA,EACvB,2BAA2B;AAAA,EAC3B,wBAAwB;AAAA,EACxB,sBAAsB;AAC1B;AAkBO,SAAS,iBACZ,UACA,UACA,QACA,UAAmC,CAAA,GACf;AACpB,QAAM,SAAS,QAAQ,UAAU;AACjC,UAAQ,eAAA;AACR,QAAM,QAAQ,IAAI,cAAA;AAClB,QAAM,WAAW,WAAW,UAAU,UAAU,MAAM;AACtD,MAAI,aAAa,MAAM;AACnB,eAAW,UAAU,KAAK;AAC1B,WAAO,MAAM,OAAO,WAAW,IAAI,OAAO,eAAe,UAAU,UAAU,KAAK;AAAA,EACtF;AACA,QAAM,IAAI,SAAS;AACnB,QAAM,SAAS,SAAS,GAAG,UAAU,KAAK;AAC1C,UAAQ,eAAA;AACR,QAAM,aAAa,aAAa,QAAQ;AACxC,MAAI,SAAS,MAAM,6BAA6B,MAAM;AAClD,eAAW,OAAO,YAAY;AAC1B,aAAO,OAAO,KAAK,OAAO,KAAK,IAAI,KAAK,IAAI,MAAM,CAAC;AAAA,IACvD;AAAA,EACJ;AACA,QAAM,SAAS,YAAY,UAAU,MAAM;AAC3C,gBAAc,UAAU,QAAQ,YAAY,MAAM;AAClD,QAAM,EAAE,QAAQ,MAAA,IAAU,YAAY,QAAQ,YAAY,KAAK;AAC/D,QAAM,UAAU,YAAY,QAAQ,QAAQ,KAAK;AACjD,aAAW,QAAQ,KAAK;AACxB,iBAAe,UAAU,KAAK;AAC9B,SAAO;AAAA,IACH,SAAS;AAAA,IACT,QAAQ;AAAA,MACJ,QAAQ,SAAS;AAAA,MACjB,MAAM,SAAS,QAAQ,OAAO,SAAS,KAAK,OAAO;AAAA,MACnD,OAAO,SAAS,MAAM,SAAS;AAAA,IAAA;AAAA,IAEnC,OAAO,SAAS,MAAM,SAAS;AAAA,IAC/B,GAAI,SAAS,MAAM,cAAc,SAAY,KAAK,EAAE,WAAW,SAAS,MAAM,UAAA;AAAA,IAC9E,GAAI,SAAS,MAAM,cAAc,SAAY,KAAK,EAAE,WAAW,SAAS,MAAM,UAAA;AAAA,IAC9E,gBAAgB,SAAS,kBAAkB,WAAW,SAAS,MAAM,GAAG,UAAU;AAAA,IAClF,MAAM,OAAO,QAAQ,IAAI;AAAA,IACzB,QAAQ,OAAO;AAAA,IACf,QAAQ,UAAU,IAAI;AAAA,IACtB;AAAA,IACA,QAAQ,CAAC,WAAW,SAAS;AAAA,IAC7B,QAAQ,UAAU,OAAO,SAAS,OAAO,MAAM;AAAA,IAC/C;AAAA,IACA,OAAO,SAAS,KAAK;AAAA,EAAA;AAE7B;AAWA,SAAS,WAAW,UAAyB,UAAyB,QAA6C;AAC/G,QAAM,OAAO,SAAS,YAAY,UAAU,EAAE,OAAA,CAAQ,KAAK;AAC3D,MAAI,MAAM,MAAM,UAAa,KAAK,MAAM,QAAW;AAC/C,WAAO,cAAc,UAAU,IAAI;AAAA,EACvC;AACA,QAAM,SAAS,MAAM,WAAW,SAAY,SAAS,MAAM,OAAO,UAAU,IAAI,SAAS,MAAM,IAAI,KAAK,MAAM;AAC9G,MAAI,WAAW,QAAQ,OAAO,KAAK,aAAa,GAAG;AAC/C,WAAO,MAAM,mBAAmB,SAAY,OAAO,eAAe,UAAU,IAAI;AAAA,EACpF;AACA,QAAM,QAAQ,EAAE,GAAG,QAAQ,OAAO,KAAK,KAAK,GAAG,GAAG,QAAQ,QAAQ,CAAA,CAAE,EAAA;AACpE,SAAO,EAAE,MAAM,aAAa,MAAM,GAAG,MAAM,WAAW,UAAU,KAAK,GAAG,OAAO,GAAG,WAAW,IAAI,EAAA;AACrG;AAQA,SAAS,eAAe,UAAyB,MAAmC;AAChF,QAAM,SAAS,KAAK;AACpB,QAAM,IAAI,SAAS;AACnB,QAAM,OAAkB,CAAC,KAAK,QAAQ;AAClC,QAAI,WAAW,UAAa,MAAM,GAAG;AACjC,aAAO;AAAA,IACX;AACA,UAAMA,MAAM,OAAO,eAAgB,OAAO,YAAY,MAAM,MAAO,KAAK,KAAK,KAAM;AACnF,QAAI,CAAC,IAAI,OAAO,OAAO,CAAC,IAAI,OAAO,SAAS,KAAK,IAAIA,EAAC;AACtD,QAAI,CAAC,IAAI,OAAO,OAAO,CAAC,IAAI,OAAO,SAAS,KAAK,IAAIA,EAAC;AACtD,QAAI,CAAC,IAAI;AACT,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,EAAE,GAAG,QAAQ,IAAI,GAAG,YAAY,EAAA;AAC9C,SAAO,EAAE,MAAM,MAAM,WAAW,UAAU,KAAK,GAAG,OAAO,GAAG,WAAW,IAAI,EAAA;AAC/E;AAQA,SAAS,cAAc,UAAyB,MAA0C;AACtF,QAAM,IAAI,SAAS,MAAM,IAAI,KAAK,KAAK,EAAE;AACzC,QAAM,IAAI,SAAS,MAAM,IAAI,KAAK,KAAK,EAAE;AACzC,QAAM,IAAI,KAAK,MAAM,SAAY,OAAO,SAAS,MAAM,IAAI,KAAK,CAAC;AACjE,MAAI,MAAM,QAAQ,MAAM,MAAM;AAC1B,WAAO;AAAA,EACX;AACA,QAAM,OAAkB,CAAC,KAAK,QAAQ;AAClC,QAAI,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG;AAChC,aAAO;AAAA,IACX;AACA,QAAI,CAAC,IAAI,OAAO,EAAE,MAAM,GAAG,CAAC;AAC5B,QAAI,CAAC,IAAI,OAAO,EAAE,MAAM,GAAG,CAAC;AAC5B,QAAI,CAAC,IAAI,GAAG,MAAM,GAAG,MAAM,OAAO,OAAO,EAAE,MAAM,GAAG,CAAC,IAAI;AACzD,WAAO;AAAA,EACX;AACA,QAAM,QAAQ,EAAE,GAAG,QAAQ,IAAI,GAAG,YAAY,MAAM,OAAO,IAAI,EAAA;AAC/D,SAAO,EAAE,MAAM,MAAM,WAAW,UAAU,KAAK,GAAG,OAAO,GAAG,WAAW,IAAI,EAAA;AAC/E;AAOA,SAAS,WAAW,MAAsF;AACtG,SAAO,EAAE,QAAQ,MAAM,UAAU,CAAA,GAAI,gBAAgB,MAAM,gBAAgB,MAAM,MAAM,KAAA;AAC3F;AAOA,SAAS,aAAa,QAA2B;AAC7C,SAAO,CAAC,KAAK,QAAQ;AACjB,QAAI,CAAC,OAAO,MAAM,GAAG,GAAG;AACpB,aAAO;AAAA,IACX;AACA,UAAM,IAAI,OAAO,MAAM,GAAG;AAC1B,QAAI,CAAC,IAAI,EAAE,CAAC;AACZ,QAAI,CAAC,IAAI,EAAE,CAAC;AACZ,QAAI,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAC,IAAI;AAC/B,WAAO;AAAA,EACX;AACJ;AAOA,SAAS,QAAQ,QAAqC;AAClD,QAAM,QAAQ;AACd,QAAM,MAA+B,CAAA;AACrC,QAAM,OAAO,CAAC,KAAgC,OAAsC;AAChF,QAAI,GAAG,MAAM,GAAG,CAAC,GAAG;AAChB,UAAI,GAAG,IAAI,MAAM,GAAG;AAAA,IACxB;AAAA,EACJ;AACA,OAAK,SAAS,CAAC,MAAM,MAAM,QAAQ,MAAM,MAAM;AAC/C,OAAK,cAAc,CAAC,MAAM,MAAM,KAAK,MAAM,CAAC;AAC5C,OAAK,SAAS,CAAC,MAAM,MAAM,QAAQ,MAAM,MAAM;AAC/C,OAAK,UAAU,CAAC,MAAM,MAAM,YAAY,MAAM,UAAU;AACxD,OAAK,SAAS,CAAC,MAAM,OAAO,MAAM,QAAQ;AAC1C,OAAK,UAAU,CAAC,MAAM,OAAO,MAAM,QAAQ;AAC3C,OAAK,aAAa,CAAC,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,KAAK,IAAI,CAAC;AAC7E,OAAK,cAAc,CAAC,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,KAAK,IAAI,CAAC;AAC9E,OAAK,WAAW,CAAC,MAAM,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,CAAC;AAClE,OAAK,gBAAgB,CAAC,MAAM,OAAO,MAAM,SAAS;AAClD,OAAK,kBAAkB,CAAC,MAAM,OAAO,MAAM,SAAS;AACpD,OAAK,4BAA4B,CAAC,MAAM,OAAO,MAAM,SAAS;AAC9D,QAAM,MAAM,MAAM;AAClB,MAAI,OAAO,KAAK,YAAY,YAAY,OAAO,SAAS,IAAI,OAAO,KAAK,IAAI,WAAW,GAAG;AACtF,QAAI,YAAY,EAAE,SAAS,IAAI,QAAA;AAAA,EACnC;AACA,SAAO;AACX;AAiBA,SAAS,SAAS,GAAW,UAAoB,OAA8C;AAC3F,QAAM,SAAS,IAAI,aAAa,IAAI,CAAC,EAAE,KAAK,OAAO,GAAG;AACtD,QAAM,IAAW,CAAC,GAAG,GAAG,CAAC;AACzB,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,QAAI,CAAC,SAAS,KAAK,KAAK,CAAC,GAAG;AACxB;AAAA,IACJ;AACA,QAAI,OAAO,SAAS,EAAE,CAAC,CAAC,KAAK,OAAO,SAAS,EAAE,CAAC,CAAC,KAAK,OAAO,SAAS,EAAE,CAAC,CAAC,GAAG;AACzE,aAAO,IAAI,GAAG,IAAI,GAAG;AAAA,IACzB,OAAO;AACH,YAAM,IAAI,eAAe,YAAY,EAAE,SAAS,KAAK,QAAQ,EAAE,KAAK,GAAG,EAAA,CAAG;AAAA,IAC9E;AAAA,EACJ;AACA,MAAI,SAAS,MAAM,iBAAiB,MAAM;AACtC,iBAAa,MAAM;AAAA,EACvB;AACA,MAAI,SAAS,MAAM,mBAAmB,MAAM;AACxC,0BAAsB,MAAM;AAAA,EAChC;AACA,QAAM,QAAQ,SAAS,MAAM,eAAe,KAAK,CAAC,UAAU,MAAM;AAClE,cAAY,QAAQ,SAAS,OAAO,SAAS,MAAM,OAAO,KAAK;AAC/D,SAAO,EAAE,QAAQ,MAAA;AACrB;AAMA,SAAS,sBAAsB,QAA4B;AACvD,MAAI,CAAC,OAAO,KAAK,CAAC,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC,GAAG;AACvC;AAAA,EACJ;AACA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB,aAAO,KAAK,GAAG,GAAG,IAAI,CAAC;AAAA,IAC3B;AAAA,EACJ;AACJ;AAUA,SAAS,YACL,QACA,OACA,MACA,OACA,OACI;AACJ,QAAM,IAAW,CAAC,GAAG,GAAG,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,UAAM,IAAI,MAAM,WAAW,aAAa,KAAK,IAAI,CAAC,IAAI;AACtD,QAAI,MAAM,WAAW,cAAc,MAAM,MAAM;AAC3C,YAAM,IAAI,eAAe,gBAAgB,EAAE,SAAS,IAAI,GAAG;AAAA,IAC/D;AACA,MAAE,CAAC,IAAI,OAAO,CAAC;AACf,MAAE,CAAC,IAAI,OAAO,IAAI,CAAC;AACnB,MAAE,CAAC,IAAI,OAAO,IAAI,CAAC;AACnB,cAAU,GAAG,OAAO,GAAG,KAAK;AAC5B,WAAO,IAAI,GAAG,CAAC;AAAA,EACnB;AACJ;AAQA,SAAS,WAAW,UAAyB,OAAwC;AACjF,QAAMC,KAAI,MAAM,UAAU,SAAY,OAAO,SAAS,MAAM,IAAI,MAAM,KAAK;AAC3E,QAAM,IAAI,MAAM,WAAW,SAAY,OAAO,SAAS,MAAM,IAAI,MAAM,MAAM;AAC7E,MAAIA,OAAM,QAAQ,MAAM,MAAM;AAC1B,WAAO,MAAM;AAAA,EACjB;AACA,SAAO,CAAC,QAAQ;AACZ,QAAI,CAACA,GAAE,MAAM,GAAG,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG;AAChC,aAAO;AAAA,IACX;AACA,UAAM,OAAyB,CAAC,OAAOA,GAAE,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC;AAC1E,WAAO,OAAO,SAAS,KAAK,CAAC,CAAC,KAAK,OAAO,SAAS,KAAK,CAAC,CAAC,IAAI,OAAO;AAAA,EACzE;AACJ;AAOA,SAAS,aAAa,QAA4B;AAC9C,QAAM,QAAkB,CAAA;AACxB,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,MAAM,GAAG;AACxC,YAAM,KAAK,CAAC;AAAA,IAChB,WAAW,CAAC,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACjC;AAAA,IACJ;AAAA,EACJ;AACA,MAAI,MAAM,UAAU,KAAK,SAAS,GAAG;AACjC,eAAW,KAAK,OAAO;AACnB,aAAO,KAAK,OAAO,KAAK,GAAG,IAAI,CAAC;AAAA,IACpC;AAAA,EACJ;AACJ;AAOA,SAAS,UAAU,QAA+B;AAC9C,MAAI,IAAI,OAAO;AACf,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,QAAI,OAAO,MAAM,CAAC,GAAG;AACjB,UAAI,OAAO,IAAI,CAAC;AAAA,IACpB,WAAW,OAAO,IAAI,CAAC,MAAM,GAAG;AAC5B,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AASA,SAAS,aAAa,UAAsC;AACxD,QAAM,0BAAU,IAAA;AAChB,QAAM,SAAS,SAAS,MAAM,OAAO,QAAQ;AAC7C,MAAI,WAAW,MAAM;AACjB,WAAO;AAAA,EACX;AACA,WAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC1C,UAAM,IAAI,OAAO,MAAM,GAAG,IAAI,OAAO,MAAM,GAAG,IAAI;AAClD,QAAI,OAAO,MAAM,UAAU;AACvB,UAAI,IAAI,CAAC;AAAA,IACb;AAAA,EACJ;AACA,SAAO;AACX;AASA,SAAS,YAAY,UAAoB,MAAiC;AACtE,QAAM,MAA2B,CAAA;AACjC,aAAW,EAAE,MAAM,IAAA,KAAS,SAAS,QAAQ;AACzC,UAAM,IAAW,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC;AACjC,cAAU,GAAG,SAAS,OAAO,CAAC,IAAI,OAAO,IAAI,MAAM,GAAG,KAAK;AAC3D,QAAI,OAAO,MAAM,KAAK,OAAO,IAAI,IAAI,CAAC,GAAG;AACrC,WAAK,OAAO,IAAI,GAAG,IAAI,IAAI;AAAA,IAC/B;AACA,QAAI,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,GAAG;AACnC,UAAI,KAAK,EAAE,MAAM,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,OAAO,IAAI,OAAO,QAAQ,IAAI,OAAA,GAAU;AAAA,IACtF;AAAA,EACJ;AACA,SAAO;AACX;AASA,SAAS,cACL,UACA,MACA,YACA,QACI;AACJ,aAAW,QAAQ,YAAY;AAC3B,UAAM,OAAO,SAAS,KAAK,IAAI;AAC/B,UAAM,IAAI,IAAI;AACd,QAAI,SAAS,QAAQ,CAAC,OAAO,MAAM,KAAK,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,GAAG;AACxF,aAAO,KAAK,EAAE,MAAM,KAAK,EAAE,GAAG,KAAK,OAAO,CAAC,GAAG,GAAG,KAAK,OAAO,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAA,EAAE,CAAG;AAAA,IAC5G;AAAA,EACJ;AACJ;AAWA,SAAS,YACL,MACA,YACA,OACiC;AACjC,QAAM,EAAE,WAAW;AACnB,QAAM,WAAqB,CAAA;AAC3B,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,WAAS,MAAM,GAAG,IAAI,MAAM,OAAO,QAAQ,OAAO;AAC9C,UAAM,MAAM,CAAC,OAAO,MAAM,OAAO,IAAI,GAAG,CAAC;AACzC,QAAI,KAAK;AACL;AAAA,IACJ,WAAW,CAAC,WAAW,IAAI,GAAG,GAAG;AAC7B,eAAS,KAAK,GAAG;AAAA,IACrB;AACA,aAAS,OAAO,CAAC,WAAW,IAAI,GAAG,IAAI,IAAI;AAAA,EAC/C;AACA,MAAI,SAAS,KAAK,SAAS,SAAS,GAAG;AACnC,eAAW,WAAW,UAAU;AAC5B,YAAM,IAAI,eAAe,SAAS,EAAE,SAAS;AAAA,IACjD;AAAA,EACJ;AACA,SAAO,EAAE,QAAQ,MAAA;AACrB;AASA,SAAS,YAAY,MAAY,QAAgB,OAAiD;AAC9F,MAAI,SAAS,GAAG;AACZ,WAAO;AAAA,EACX;AACA,QAAM,EAAE,WAAW;AACnB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,QAAI,QAAQ,GAAG;AACX,cAAQ;AAAA,IACZ,WACI,OAAO,CAAC,MAAM,OAAO,KAAK,KAC1B,OAAO,IAAI,CAAC,MAAM,OAAO,QAAQ,CAAC,KAClC,OAAO,IAAI,CAAC,MAAM,OAAO,QAAQ,CAAC,GACpC;AACE,aAAO;AAAA,IACX;AAAA,EACJ;AACA,QAAM,IAAI,eAAe,SAAS;AAAA,IAC9B,OAAO;AAAA,IACP,QAAQ,MAAM,KAAK,OAAO,SAAS,OAAO,QAAQ,CAAC,CAAC,EAAE,KAAK,GAAG;AAAA,EAAA,CACjE;AACD,SAAO,KAAK,OAAO,GAAG;AACtB,SAAO;AACX;AAOA,SAAS,WAAW,QAAsB,OAA8C;AACpF,aAAW,SAAS,OAAO,QAAQ;AAC/B,QAAI,iBAAiB,IAAI,MAAM,IAAI,GAAG;AAClC,YAAM,IAAI,eAAe,YAAY,EAAE,QAAQ,MAAM,MAAM;AAAA,IAC/D;AAAA,EACJ;AACJ;AAOA,SAAS,eAAe,UAAyB,OAA8C;AAC3F,aAAW,UAAU,SAAS,OAAO;AACjC,QAAI,iBAAiB,KAAK,OAAO,KAAK,IAAI,KAAK,OAAO,KAAK,SAAS,MAAM;AACtE,YAAM,IAAI,eAAe,aAAa,EAAE,QAAQ,OAAO,KAAK,MAAM;AAAA,IACtE;AAAA,EACJ;AACJ;AAOA,SAAS,WAAW,UAAyB,OAA8C;AACvF,QAAM,UAAU,CAAC,SACb,CAAC,GAAG,SAAS,KAAK,EAAE;AAAA,IAChB,CAAC,MAAM,EAAE,KAAK,KAAK,YAAA,MAAkB,QAAQ,EAAE,KAAK,eAAe,KAAK,UAAU,EAAE,KAAK;AAAA,EAAA;AAEjG,QAAM,IAAI,QAAQ,GAAG;AACrB,QAAM,IAAI,QAAQ,GAAG;AACrB,MAAI,MAAM,UAAa,MAAM,QAAW;AACpC,UAAM,IAAI,eAAe,UAAU,EAAE,QAAQ,EAAE,KAAK,MAAM;AAC1D,UAAM,IAAI,eAAe,UAAU,EAAE,QAAQ,EAAE,KAAK,MAAM;AAAA,EAC9D;AACJ;AAOA,SAAS,UAAU,OAAwB;AACvC,SAAO,UAAU,SAAS,UAAU,SAAS,UAAU,SAAS,UAAU,SAAS,UAAU;AACjG;AAOA,SAAS,SAAS,OAAwD;AACtE,SAAO,MAAM,KAAA,EAAO,IAAI,CAAC,OAAO;AAAA,IAC5B,MAAM,EAAE;AAAA,IACR,QAAQ,EAAE,OAAO,EAAE,OAAO,SAAS,EAAE,QAAA;AAAA,IACrC,UAAU,EAAE;AAAA,IACZ,SAAS,GAAG,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK;AAAA,EAAA,EACzC;AACN;AASA,SAAS,eACL,UACA,UACA,OACa;AACb,SAAO;AAAA,IACH,SAAS;AAAA,IACT,QAAQ,EAAE,QAAQ,SAAS,QAAQ,MAAM,OAAO,SAAS,KAAK,OAAO,GAAG,OAAO,KAAA;AAAA,IAC/E,OAAO;AAAA,IACP,gBAAgB;AAAA,IAChB,MAAM;AAAA,IACN,QAAQ,IAAI,aAAa,IAAI,SAAS,SAAS,EAAE,KAAK,OAAO,GAAG;AAAA,IAChE,QAAQ;AAAA,IACR,OAAO,SAAS;AAAA,IAChB,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ,CAAA;AAAA,IACR,OAAO,SAAS,KAAK;AAAA,EAAA;AAE7B;AAWA,SAAS,WAAW,MAAkB,GAAW,YAAgD;AAC7F,QAAM,QAAkB,CAAA;AACxB,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAC9B,UAAM,IAAI,WAAW,IAAI,GAAG,IAAI,OAAO,KAAK,GAAG;AAC/C,QAAI,MAAM,MAAM;AACZ,YAAM,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AAAA,IAChC;AAAA,EACJ;AACA,SAAO,OAAO,KAAK;AACvB;AAOA,SAAS,SAAS,QAA+C;AAC7D,QAAM,MAAa,CAAC,UAAU,UAAU,QAAQ;AAChD,QAAM,MAAa,CAAC,WAAW,WAAW,SAAS;AACnD,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACvC,QAAI,OAAO,MAAM,OAAO,CAAC,CAAC,GAAG;AACzB;AAAA,IACJ;AACA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,UAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC;AACvC,UAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,CAAC;AAAA,IAC3C;AAAA,EACJ;AACA,SAAO,IAAI,CAAC,MAAM,WAAW,OAAO,EAAE,KAAK,IAAA;AAC/C;"}

package/dist/sources-cypher.js

@@ -1,10 +1,10 @@
-import { b as throwIfAborted } from "./chunks/input-Ccg9I22A.js";
-import { P as PRECISION_CODE, ah as ImportError } from "./chunks/report-CgdsL9Hb.js";
-import { C as CYPHER_DESCRIPTOR, N as NEO4J_DESCRIPTOR, a as NEPTUNE_DESCRIPTOR, S as SOURCE_ISSUE } from "./chunks/codes-CV_Bhcyi.js";
-import { w as warnOn, f as failOn, n as SOURCE_DEGREE_ATTR, b as failAlone, o as originOf, u as unwrapCredential, d as defineSource, C as CYPHER_SOURCE_ID, g as NEO4J_SOURCE_ID, h as NEPTUNE_SOURCE_ID } from "./chunks/credentials-BiQsnMTb.js";
-import { sha256Hex } from "./chunks/sigv4-LkAzsLAu.js";
+import { b as throwIfAborted } from "./chunks/input-CAxt_aV-.js";
+import { P as PRECISION_CODE, ah as ImportError } from "./chunks/report-CwMfYa9J.js";
+import { C as CYPHER_DESCRIPTOR, N as NEO4J_DESCRIPTOR, a as NEPTUNE_DESCRIPTOR, S as SOURCE_ISSUE } from "./chunks/codes-BE2xir2k.js";
+import { w as warnOn, f as failOn, q as SOURCE_DEGREE_ATTR, b as failAlone, o as originOf, u as unwrapCredential, d as defineSource, C as CYPHER_SOURCE_ID, h as NEO4J_SOURCE_ID, i as NEPTUNE_SOURCE_ID } from "./chunks/credentials-CmvJXYeH.js";
+import { sha256Hex } from "./chunks/sigv4-BXwVbza3.js";
 import { INVALID_INDEX } from "@graphty/graph-format";
-import { t as transportOptions, i as isLoopback } from "./chunks/context-cgmmOxZ2.js";
+import { t as transportOptions, i as isLoopback } from "./chunks/context-DizmppHy.js";
 class GraphNode {
   /**
    * Create one.
@@ -544,6 +544,18 @@ function edgePage(profile, filters, pageSize, after) {
     `ORDER BY key LIMIT ${pageSize}`
   ].filter((l) => l !== null).join(" ");
 }
+function edgesAmong(profile, filters) {
+  const ka = idExpression("a", profile, filters);
+  const kb = idExpression("b", profile, filters);
+  const ends = [nodePredicate("a", filters), nodePredicate("b", filters)].filter((p) => p !== null);
+  const rest = ends.length === 0 ? "" : ` AND ${ends.join(" AND ")}`;
+  const pattern = `MATCH (a)-[r${typesPattern(filters)}]->(b)`;
+  return [
+    `${pattern} WHERE ${ka} IN $keys AND ${kb} <= $last${rest} RETURN a, r, b`,
+    "UNION ALL",
+    `${pattern} WHERE ${kb} IN $keys AND ${ka} <= $last AND NOT ${ka} IN $keys${rest} RETURN a, r, b`
+  ].join(" ");
+}
 function neighborhood(profile, filters, shape, degree) {
   const rel = `[${typesPattern(filters)}*1..${shape.depth}]`;
   const [left, right] = ARROWS[shape.direction];
@@ -576,6 +588,10 @@ function counts(filters) {
     `MATCH (a)-[r${typesPattern(filters)}]->(b)${whereClause(where.length === 0 ? null : where.join(" AND "))} RETURN count(r) AS c`
   ];
 }
+function storeCount(label) {
+  const pattern = label === void 0 ? "n" : `n:${label}`;
+  return `MATCH (${pattern}) RETURN count(n) AS c`;
+}
 const MAX_SERVER_MESSAGE = 500;
 function serverError(report, err, origin, database) {
   const code = err.code ?? "";
@@ -922,6 +938,13 @@ function queryApiTransport(input) {
   };
 }
 const DIRECTIONS = /* @__PURE__ */ new Set(["out", "in", "both"]);
+function withoutTrailingSemicolons(query) {
+  let end = query.length;
+  while (end > 0 && query[end - 1] === ";") {
+    end--;
+  }
+  return query.slice(0, end);
+}
 function listParam(value, name, report) {
   if (value === void 0 || value === null) {
     return [];
@@ -1010,9 +1033,10 @@ class Reader {
   /**
    * The pages of a read, as `mode` asks.
    * @param cursor - where to resume
+   * @param counting - whether a first page of mode "all" may count what the source holds
    * @yields one page at a time
    */
-  async *pages(cursor) {
+  async *pages(cursor, counting = true) {
     const { params, ctx } = this;
     const { report } = ctx;
     const mode = params.mode ?? (typeof params.query === "string" && params.query !== "" ? "query" : "all");
@@ -1020,11 +1044,7 @@ class Reader {
       if (typeof params.query !== "string" || params.query.trim() === "") {
         failOn(report, "E_SOURCE_PARAM", "mode query needs a query", { name: "query", reason: "required" });
       }
-      const result = await this.transport.run(params.query, params.parameters ?? {});
-      const collected = new Collector();
-      collected.add(result, false);
-      requireGraph(result, collected, report);
-      yield { collected, next: null };
+      yield await this.userQuery(params.query, cursor);
       return;
     }
     const profile = await this.profile();
@@ -1042,21 +1062,71 @@ class Reader {
       yield { collected, next: null };
       return;
     }
-    yield* this.everything(profile, cursor);
+    yield* this.everything(profile, cursor, counting);
+  }
+  /**
+   * Mode "query": the reader's own query, as written. With a node cap (or a cursor from a capped
+   * run) the server returns at most that many rows (`CALL { query } RETURN * LIMIT n`), and a full
+   * result hands back a cursor that runs the query again with twice the rows, for the caller to
+   * merge. A server that refuses the wrapper fails the load with `E_SOURCE_PARAM` (`name:
+   * "maxNodes"`, `reason: "uncappable"`): the query is never run past the cap the caller set.
+   * @param query - the query
+   * @param cursor - where to resume: `{ rows }` from an earlier capped run
+   * @returns the one page
+   */
+  async userQuery(query, cursor) {
+    const { params, ctx } = this;
+    const parameters = params.parameters ?? {};
+    const asked = cursor?.rows ?? ctx.limits.maxNodes;
+    const rows = asked === void 0 || asked === null ? null : Number(checkedInteger(asked, "maxNodes", 1, Number.MAX_SAFE_INTEGER, ctx.report));
+    let result;
+    try {
+      result = await this.transport.run(
+        rows === null ? query : `CALL {
+${withoutTrailingSemicolons(query.trim())}
+}
+RETURN * LIMIT ${String(rows)}`,
+        parameters
+      );
+    } catch (err) {
+      if (rows === null || !(err instanceof ImportError) || err.issue?.code !== SOURCE_ISSUE.E_SOURCE_QUERY) {
+        throw err;
+      }
+      return failOn(ctx.report, "E_SOURCE_PARAM", "the server cannot cap this query; load it without maxNodes", {
+        name: "maxNodes",
+        reason: "uncappable"
+      });
+    }
+    const collected = new Collector();
+    collected.add(result, false);
+    requireGraph(result, collected, ctx.report);
+    const full = rows !== null && result.rows.length >= rows;
+    return { collected, next: full ? { rows: rows * 2 } : null };
   }
   /**
    * Mode "all": the nodes, then the relationships with their ends, each paged by keyset on the
    * id expression (never SKIP), so a page is stable under unrelated writes.
    * @param profile - the server's profile
    * @param cursor - where to resume
+   * @param counting - whether a first page may count what the source holds
    * @yields one page at a time
    */
-  async *everything(profile, cursor) {
+  async *everything(profile, cursor, counting) {
     const { params, ctx } = this;
     const size = checkedInteger(params.pageSize ?? DEFAULT_PAGE_SIZE, "pageSize", 1, MAX_PAGE_SIZE, ctx.report);
+    if (cursor === null && counting) {
+      this.counted = await this.count(profile);
+    }
+    const cap = ctx.limits.maxNodes;
+    if (cap !== void 0 && cursor?.phase !== "edges") {
+      const capped = Number(checkedInteger(cap, "maxNodes", 1, Number.MAX_SAFE_INTEGER, ctx.report));
+      yield* this.cappedNodes(profile, cursor, Math.min(Number(size), capped));
+      return;
+    }
     let phase = cursor?.phase === "edges" ? "edges" : "nodes";
     let after = cursor?.after ?? null;
-    const total = params.countFirst === true && cursor === null ? await this.total() : void 0;
+    const { counted } = this;
+    const total = params.countFirst === true && counted !== void 0 ? (counted.nodes ?? 0) + (counted.edges ?? 0) : void 0;
     for (; ; ) {
       const nodes = phase === "nodes";
       const { collected, rows, fields } = await this.generated(
@@ -1075,13 +1145,60 @@ class Reader {
     }
   }
   /**
-   * How many nodes and relationships the filters match, for progress.
-   * @returns the count
+   * Mode "all" under a node cap: pages of at most the cap's nodes, each with the relationships
+   * among the nodes loaded so far, so a capped load stops at its cap with its edges, and its
+   * next page (`data.more`) continues by key.
+   * @param profile - the server's profile
+   * @param cursor - where to resume
+   * @param size - the page size
+   * @yields one page at a time
+   */
+  async *cappedNodes(profile, cursor, size) {
+    let after = cursor?.after ?? null;
+    for (; ; ) {
+      const { collected, rows, fields } = await this.generated(
+        (d) => nodePage(profile, this.filters, String(size), after !== null, d),
+        after === null ? {} : { after }
+      );
+      const at = fields.indexOf("key");
+      const last = rows.at(-1)?.[at];
+      const key = typeof last === "string" || typeof last === "number" ? last : null;
+      if (key !== null) {
+        const keys = rows.map((row) => row[at]);
+        const among = await this.transport.run(edgesAmong(profile, this.filters), { keys, last: key });
+        collected.add(among, false);
+      }
+      const next = rows.length >= size && key !== null ? { phase: "nodes", after: key } : null;
+      yield { collected, next };
+      if (next === null) {
+        return;
+      }
+      after = key;
+    }
+  }
+  /**
+   * What a first page of mode "all" counts: with `countFirst`, the nodes and relationships the
+   * filters match (for progress too); else, on Neo4j with at most one label and the server's
+   * ids, the nodes from the count store; else nothing.
+   * @param profile - the server's profile
+   * @returns the count, or undefined
    */
-  async total() {
-    const [n, r] = counts(this.filters);
-    const [a, b] = await Promise.all([this.transport.run(n, {}), this.transport.run(r, {})]);
-    return Number(a.rows[0]?.[0] ?? 0) + Number(b.rows[0]?.[0] ?? 0);
+  async count(profile) {
+    const first = async (statement) => {
+      const c = Number((await this.transport.run(statement, {})).rows[0]?.[0]);
+      return Number.isSafeInteger(c) && c >= 0 ? c : void 0;
+    };
+    const { labels, idProperty } = this.filters;
+    if (this.params.countFirst === true) {
+      const [n, r] = counts(this.filters);
+      const [nodes2, edges] = await Promise.all([first(n), first(r)]);
+      return { ...nodes2 === void 0 ? {} : { nodes: nodes2 }, ...edges === void 0 ? {} : { edges } };
+    }
+    if (profile.name !== "neo4j" || labels.length > 1 || idProperty !== null) {
+      return void 0;
+    }
+    const nodes = await first(storeCount(labels[0]));
+    return nodes === void 0 ? void 0 : { nodes };
   }
   /**
    * The server facts and validators of what was read.
@@ -1154,7 +1271,8 @@ function cypher(preset) {
           break;
         }
       }
-      return ctx.finish({ next, ...await reader.facts(lines) });
+      const total = reader.counted === void 0 ? {} : { total: reader.counted };
+      return ctx.finish({ next, ...total, ...await reader.facts(lines) });
     }),
     expand: (request, sink, ctx) => withReader(request.params, ctx, preset, (reader) => expand(reader, request, sink)),
     probe: (params, ctx) => withReader(params, ctx, preset, async (reader) => {
@@ -1163,7 +1281,7 @@ function cypher(preset) {
     }),
     validate: (params, seen, ctx) => withReader(params, ctx, preset, async (reader) => {
       const lines = [];
-      for await (const page of reader.pages(null)) {
+      for await (const page of reader.pages(null, false)) {
         lines.push(...canonicalRows(page.collected, reader.idProperty));
       }
       const { validators } = await reader.facts(lines);