@ifc-lite/flow 0.2.0

package/dist/table.js

@@ -0,0 +1,132 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+export const COLUMN_TYPES = [
+    'string', 'real', 'integer', 'boolean', 'logical', 'label', 'identifier', 'text', 'enum', 'reference', 'list',
+];
+/** Structural validation of an untrusted table value. */
+export function validateTable(value, path = 'table') {
+    const problems = [];
+    if (!value || typeof value !== 'object')
+        return [{ path, message: 'must be an object' }];
+    const t = value;
+    if (!Array.isArray(t.columns))
+        problems.push({ path: `${path}.columns`, message: 'must be an array' });
+    if (!Array.isArray(t.rows))
+        problems.push({ path: `${path}.rows`, message: 'must be an array' });
+    if (typeof t.key !== 'string' || t.key.length === 0)
+        problems.push({ path: `${path}.key`, message: 'must name the key column' });
+    if (problems.length > 0)
+        return problems;
+    const names = new Set();
+    t.columns.forEach((c, i) => {
+        const col = c;
+        const p = `${path}.columns[${i}]`;
+        if (typeof col.name !== 'string' || col.name.length === 0)
+            problems.push({ path: `${p}.name`, message: 'must be a non-empty string' });
+        else if (names.has(col.name))
+            problems.push({ path: `${p}.name`, message: `duplicate column "${col.name}"` });
+        else
+            names.add(col.name);
+        if (!COLUMN_TYPES.includes(col.type))
+            problems.push({ path: `${p}.type`, message: `unknown column type "${String(col.type)}"` });
+        if (col.unit !== undefined && typeof col.unit !== 'string')
+            problems.push({ path: `${p}.unit`, message: 'must be a string' });
+        if (col.binding !== undefined) {
+            const b = col.binding;
+            if (!b || typeof b.pset !== 'string' || typeof b.prop !== 'string')
+                problems.push({ path: `${p}.binding`, message: 'must be { pset, prop }' });
+        }
+    });
+    if (typeof t.key === 'string' && !names.has(t.key))
+        problems.push({ path: `${path}.key`, message: `key column "${t.key}" is not a column` });
+    t.rows.forEach((r, i) => {
+        if (!r || typeof r !== 'object' || Array.isArray(r)) {
+            problems.push({ path: `${path}.rows[${i}]`, message: 'must be an object' });
+            return;
+        }
+        for (const [k, v] of Object.entries(r)) {
+            if (!names.has(k))
+                problems.push({ path: `${path}.rows[${i}].${k}`, message: 'not a declared column' });
+            else if (v !== null && typeof v !== 'string' && typeof v !== 'number' && typeof v !== 'boolean') {
+                problems.push({ path: `${path}.rows[${i}].${k}`, message: 'cell must be string, number, boolean or null' });
+            }
+        }
+    });
+    return problems;
+}
+export function column(table, name) {
+    return table.columns.find((c) => c.name === name);
+}
+/** The row key as a group key; `null`/missing keys are reported, never coerced. */
+export function rowKey(table, row) {
+    const v = row[table.key];
+    if (v === null || v === undefined || v === '')
+        return null;
+    return String(v);
+}
+/** Split rows into branches by a column's value (defaults to the key column). */
+export function groupRows(table, by = table.key) {
+    const branches = new Map();
+    const unkeyed = [];
+    for (const row of table.rows) {
+        const v = row[by];
+        if (v === null || v === undefined || v === '') {
+            unkeyed.push(row);
+            continue;
+        }
+        const k = String(v);
+        const branch = branches.get(k);
+        if (branch)
+            branch.push(row);
+        else
+            branches.set(k, [row]);
+    }
+    return { branches, unkeyed };
+}
+/**
+ * Widen a long-format table into one row per `rowKey` with a column per
+ * distinct `colKey` value. The pivoted column's type is taken from the
+ * `valueCol` column; a duplicate (rowKey, colKey) pair keeps the last value
+ * and is reported, and a `colKey` that names the key column is refused
+ * (`collisions`) rather than overwriting the row's identity.
+ */
+export function pivot(table, rowKeyCol, colKeyCol, valueCol) {
+    const valueColumn = column(table, valueCol);
+    const rows = new Map();
+    const colNames = new Set();
+    let duplicates = 0;
+    let collisions = 0;
+    for (const row of table.rows) {
+        const rk = row[rowKeyCol];
+        const ck = row[colKeyCol];
+        if (rk === null || rk === undefined || rk === '' || ck === null || ck === undefined || ck === '')
+            continue;
+        const rkey = String(rk);
+        const cname = String(ck);
+        // A pivoted column named like the key column (a long-format row whose
+        // `Prop` is literally `GlobalId`) would overwrite the row's identity with
+        // its value. Two distinct things, never merged: the row is counted and
+        // skipped, not silently folded into the key.
+        if (cname === rowKeyCol) {
+            collisions += 1;
+            continue;
+        }
+        colNames.add(cname);
+        let target = rows.get(rkey);
+        if (!target) {
+            target = { [rowKeyCol]: rk };
+            rows.set(rkey, target);
+        }
+        if (cname in target)
+            duplicates += 1;
+        target[cname] = row[valueCol] ?? null;
+    }
+    const keyColumn = column(table, rowKeyCol) ?? { name: rowKeyCol, type: 'identifier' };
+    const columns = [
+        keyColumn,
+        ...[...colNames].map((name) => ({ name, type: valueColumn?.type ?? 'string', unit: valueColumn?.unit })),
+    ];
+    return { table: { columns, rows: [...rows.values()], key: rowKeyCol }, duplicates, collisions };
+}
+//# sourceMappingURL=table.js.map

package/dist/table.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"table.js","sourceRoot":"","sources":["../src/table.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAgC/D,MAAM,CAAC,MAAM,YAAY,GAA0B;IACjD,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;CAC9G,CAAC;AAyBF,yDAAyD;AACzD,MAAM,UAAU,aAAa,CAAC,KAAc,EAAE,IAAI,GAAG,OAAO;IAC1D,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,mBAAmB,EAAE,CAAC,CAAC;IACzF,MAAM,CAAC,GAAG,KAAuB,CAAC;IAClC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,UAAU,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;IACvG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,OAAO,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;IACjG,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,MAAM,EAAE,OAAO,EAAE,0BAA0B,EAAE,CAAC,CAAC;IACjI,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IAEzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,CAAC,CAAC,OAAqB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxC,MAAM,GAAG,GAAG,CAAoB,CAAC;QACjC,MAAM,CAAC,GAAG,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC;QAClC,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,4BAA4B,EAAE,CAAC,CAAC;aAClI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,qBAAqB,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;;YACzG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAkB,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,wBAAwB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/I,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAC9H,IAAI,GAAG,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,OAAqC,CAAC;YACpD,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,UAAU,EAAE,OAAO,EAAE,wBAAwB,EAAE,CAAC,CAAC;QACjJ,CAAC;IACH,CAAC,CAAC,CAAC;IACH,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC,GAAG,mBAAmB,EAAE,CAAC,CAAC;IAE5I,CAAC,CAAC,IAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACpD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,mBAAmB,EAAE,CAAC,CAAC;YAC5E,OAAO;QACT,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAA4B,CAAC,EAAE,CAAC;YAClE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,uBAAuB,EAAE,CAAC,CAAC;iBACnG,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,SAAS,EAAE,CAAC;gBAChG,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,8CAA8C,EAAE,CAAC,CAAC;YAC9G,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,KAAY,EAAE,IAAY;IAC/C,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACpD,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,MAAM,CAAC,KAAY,EAAE,GAAQ;IAC3C,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC3D,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAQD,iFAAiF;AACjF,MAAM,UAAU,SAAS,CAAC,KAAY,EAAE,KAAa,KAAK,CAAC,GAAG;IAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC5C,MAAM,OAAO,GAAU,EAAE,CAAC;IAC1B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC9C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,SAAS;QACX,CAAC;QACD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACxB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CACnB,KAAY,EACZ,SAAiB,EACjB,SAAiB,EACjB,QAAgB;IAEhB,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkC,CAAC;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;QAC1B,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS;QAC3G,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,sEAAsE;QACtE,0EAA0E;QAC1E,uEAAuE;QACvE,6CAA6C;QAC7C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,UAAU,IAAI,CAAC,CAAC;YAChB,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACzB,CAAC;QACD,IAAI,KAAK,IAAI,MAAM;YAAE,UAAU,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,YAAqB,EAAE,CAAC;IAC/F,MAAM,OAAO,GAAa;QACxB,SAAS;QACT,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,IAAI,QAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;KACzG,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AAClG,CAAC"}

package/dist/tracking.d.ts

@@ -0,0 +1,86 @@
+import type { TrackingMode } from './document.js';
+import type { GroupKey } from './values.js';
+export interface TrackedEntry {
+    readonly globalId: string;
+    /** Digest of the inputs that produced this element. */
+    readonly digest: string;
+}
+export interface TrackedSet {
+    readonly trackingKey: string;
+    /** Bumped on every `replace` run so fresh GlobalIds stay deterministic. */
+    readonly generation: number;
+    readonly entries: Readonly<Record<GroupKey, TrackedEntry>>;
+    /**
+     * Type of the node that made the set. Recorded so that a set whose node
+     * was deleted from the graph can still be removed from the model by that
+     * type's `remove` — without it the elements outlive the node that made
+     * them, the orphan this whole module exists to prevent.
+     */
+    readonly nodeType?: string;
+}
+export declare const TRACKING_SIDECAR_VERSION = 1;
+/** Shape check for a set read from storage: `load()` promises a `TrackedSet`, not whatever a hand-edited sidecar holds. */
+export declare function isTrackedSet(value: unknown): value is TrackedSet;
+/** The `sets` record of a sidecar, or undefined when any set is malformed. */
+export declare function trackedSetsFrom(sets: unknown): Record<string, TrackedSet> | undefined;
+/** `<graph>.tracking.json` */
+export interface TrackingSidecar {
+    readonly version: number;
+    /** Layer stack id or file hash the sets were made against. */
+    readonly pinnedTo: string;
+    readonly sets: Readonly<Record<string, TrackedSet>>;
+}
+/** Where a run reads and writes tracked sets (a sidecar file, browser storage, memory). */
+export interface TrackingStore {
+    load(trackingKey: string): TrackedSet | undefined;
+    save(set: TrackedSet): void;
+    /** Every tracking key the store holds, so a run can find sets no node claims any more. */
+    keys(): readonly string[];
+    delete(trackingKey: string): void;
+}
+/** In-memory store: tests, and hosts that have not chosen a sidecar yet. */
+export declare class MemoryTrackingStore implements TrackingStore {
+    private readonly sets;
+    load(trackingKey: string): TrackedSet | undefined;
+    save(set: TrackedSet): void;
+    keys(): readonly string[];
+    delete(trackingKey: string): void;
+}
+export interface DesiredLane {
+    readonly laneKey: GroupKey;
+    readonly digest: string;
+}
+export interface TrackingPlan {
+    readonly mode: TrackingMode;
+    readonly create: readonly {
+        laneKey: GroupKey;
+        globalId: string;
+    }[];
+    readonly update: readonly {
+        laneKey: GroupKey;
+        globalId: string;
+    }[];
+    readonly keep: readonly {
+        laneKey: GroupKey;
+        globalId: string;
+    }[];
+    readonly remove: readonly {
+        laneKey: GroupKey;
+        globalId: string;
+    }[];
+    /** The set to persist after the plan is applied. */
+    readonly next: TrackedSet;
+    /** Lane keys that appeared more than once: only the first is tracked. */
+    readonly duplicateLanes: readonly GroupKey[];
+}
+export declare function emptyTrackedSet(trackingKey: string): TrackedSet;
+export declare function planTracking(previous: TrackedSet, desired: readonly DesiredLane[], mode: TrackingMode): TrackingPlan;
+export declare class TrackingPinMismatch extends Error {
+    readonly expected: string;
+    readonly actual: string;
+    constructor(expected: string, actual: string);
+}
+/** Read one node's set from a sidecar; refuses a sidecar pinned to another model state. */
+export declare function trackedSetFrom(sidecar: TrackingSidecar | undefined, pinnedTo: string, trackingKey: string): TrackedSet;
+export declare function withTrackedSet(sidecar: TrackingSidecar | undefined, pinnedTo: string, set: TrackedSet): TrackingSidecar;
+//# sourceMappingURL=tracking.d.ts.map

package/dist/tracking.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tracking.d.ts","sourceRoot":"","sources":["../src/tracking.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAE5C,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,uDAAuD;IACvD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,2EAA2E;IAC3E,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IAC3D;;;;;OAKG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAE1C,2HAA2H;AAC3H,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,UAAU,CAShE;AAED,8EAA8E;AAC9E,wBAAgB,eAAe,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,SAAS,CAQrF;AAED,8BAA8B;AAC9B,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,8DAA8D;IAC9D,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;CACrD;AAED,2FAA2F;AAC3F,MAAM,WAAW,aAAa;IAC5B,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,CAAC;IAClD,IAAI,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI,CAAC;IAC5B,0FAA0F;IAC1F,IAAI,IAAI,SAAS,MAAM,EAAE,CAAC;IAC1B,MAAM,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC;AAED,4EAA4E;AAC5E,qBAAa,mBAAoB,YAAW,aAAa;IACvD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAiC;IACtD,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAGjD,IAAI,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI;IAG3B,IAAI,IAAI,SAAS,MAAM,EAAE;IAGzB,MAAM,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;CAGlC;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,OAAO,EAAE,QAAQ,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACpE,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,OAAO,EAAE,QAAQ,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACpE,QAAQ,CAAC,IAAI,EAAE,SAAS;QAAE,OAAO,EAAE,QAAQ,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAClE,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,OAAO,EAAE,QAAQ,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACpE,oDAAoD;IACpD,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,yEAAyE;IACzE,QAAQ,CAAC,cAAc,EAAE,SAAS,QAAQ,EAAE,CAAC;CAC9C;AAED,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,UAAU,CAE/D;AAED,wBAAgB,YAAY,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,WAAW,EAAE,EAAE,IAAI,EAAE,YAAY,GAAG,YAAY,CAwCpH;AAED,qBAAa,mBAAoB,SAAQ,KAAK;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM;gBAAzC,QAAQ,EAAE,MAAM,EAAW,MAAM,EAAE,MAAM;CAI/D;AAED,2FAA2F;AAC3F,wBAAgB,cAAc,CAAC,OAAO,EAAE,eAAe,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,UAAU,CAKtH;AAED,wBAAgB,cAAc,CAAC,OAAO,EAAE,eAAe,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,GAAG,eAAe,CAMvH"}

package/dist/tracking.js

@@ -0,0 +1,136 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * Element tracking: how a write node's output survives re-runs.
+ *
+ * Each write node owns a *tracked set*: the lane keys it produced last time
+ * and the GlobalId + input digest of each. A re-run plans, per lane:
+ *
+ *   create   — lane is new           (GlobalId = trackingGuid(trackingKey, laneKey))
+ *   update   — lane exists, digest changed
+ *   keep     — lane exists, digest equal (nothing to write)
+ *   remove   — lane vanished          (tombstone; the orphan Dynamo leaves behind)
+ *
+ * This is Rhino.Inside.Revit's "remember what each output added" made
+ * explicit, keyed by the user-visible `trackingKey` instead of the node's
+ * position in a file. Sets are pinned to the model state they were made
+ * against (layer stack id or file hash), so a set from another model is
+ * refused rather than adopted by accident.
+ */
+import { trackingGuid } from './digest.js';
+export const TRACKING_SIDECAR_VERSION = 1;
+/** Shape check for a set read from storage: `load()` promises a `TrackedSet`, not whatever a hand-edited sidecar holds. */
+export function isTrackedSet(value) {
+    if (typeof value !== 'object' || value === null || Array.isArray(value))
+        return false;
+    const v = value;
+    if (typeof v.trackingKey !== 'string' || typeof v.generation !== 'number' || !Number.isInteger(v.generation))
+        return false;
+    if (v.nodeType !== undefined && typeof v.nodeType !== 'string')
+        return false;
+    if (typeof v.entries !== 'object' || v.entries === null || Array.isArray(v.entries))
+        return false;
+    return Object.values(v.entries).every((e) => typeof e === 'object' && e !== null && typeof e.globalId === 'string' && typeof e.digest === 'string');
+}
+/** The `sets` record of a sidecar, or undefined when any set is malformed. */
+export function trackedSetsFrom(sets) {
+    if (typeof sets !== 'object' || sets === null || Array.isArray(sets))
+        return undefined;
+    const out = {};
+    for (const [key, value] of Object.entries(sets)) {
+        if (!isTrackedSet(value) || value.trackingKey !== key)
+            return undefined;
+        out[key] = value;
+    }
+    return out;
+}
+/** In-memory store: tests, and hosts that have not chosen a sidecar yet. */
+export class MemoryTrackingStore {
+    sets = new Map();
+    load(trackingKey) {
+        return this.sets.get(trackingKey);
+    }
+    save(set) {
+        this.sets.set(set.trackingKey, set);
+    }
+    keys() {
+        return [...this.sets.keys()];
+    }
+    delete(trackingKey) {
+        this.sets.delete(trackingKey);
+    }
+}
+export function emptyTrackedSet(trackingKey) {
+    return { trackingKey, generation: 0, entries: {} };
+}
+export function planTracking(previous, desired, mode) {
+    const create = [];
+    const update = [];
+    const keep = [];
+    const remove = [];
+    const duplicateLanes = [];
+    const nextEntries = {};
+    if (mode === 'disabled') {
+        return { mode, create, update, keep, remove, next: previous, duplicateLanes };
+    }
+    const generation = mode === 'replace' ? previous.generation + 1 : previous.generation;
+    const guidKey = generation === 0 ? previous.trackingKey : `${previous.trackingKey}#${generation}`;
+    const seen = new Set();
+    for (const lane of desired) {
+        if (seen.has(lane.laneKey)) {
+            duplicateLanes.push(lane.laneKey);
+            continue;
+        }
+        seen.add(lane.laneKey);
+        const prev = mode === 'update' ? previous.entries[lane.laneKey] : undefined;
+        if (!prev) {
+            const globalId = trackingGuid(guidKey, lane.laneKey);
+            create.push({ laneKey: lane.laneKey, globalId });
+            nextEntries[lane.laneKey] = { globalId, digest: lane.digest };
+        }
+        else if (prev.digest !== lane.digest) {
+            update.push({ laneKey: lane.laneKey, globalId: prev.globalId });
+            nextEntries[lane.laneKey] = { globalId: prev.globalId, digest: lane.digest };
+        }
+        else {
+            keep.push({ laneKey: lane.laneKey, globalId: prev.globalId });
+            nextEntries[lane.laneKey] = prev;
+        }
+    }
+    // `replace` re-creates every lane under a fresh GlobalId, so every previous
+    // element is removed — otherwise the old set is orphaned, not replaced.
+    for (const [laneKey, entry] of Object.entries(previous.entries)) {
+        if (mode === 'replace' || !seen.has(laneKey))
+            remove.push({ laneKey, globalId: entry.globalId });
+    }
+    return { mode, create, update, keep, remove, next: { trackingKey: previous.trackingKey, generation, entries: nextEntries }, duplicateLanes };
+}
+export class TrackingPinMismatch extends Error {
+    expected;
+    actual;
+    constructor(expected, actual) {
+        super(`tracking sidecar is pinned to ${expected}, current model state is ${actual}`);
+        this.expected = expected;
+        this.actual = actual;
+        this.name = 'TrackingPinMismatch';
+    }
+}
+/** Read one node's set from a sidecar; refuses a sidecar pinned to another model state. */
+export function trackedSetFrom(sidecar, pinnedTo, trackingKey) {
+    if (!sidecar)
+        return emptyTrackedSet(trackingKey);
+    if (sidecar.version !== TRACKING_SIDECAR_VERSION)
+        throw new Error(`unsupported tracking sidecar version ${sidecar.version}`);
+    if (sidecar.pinnedTo !== pinnedTo)
+        throw new TrackingPinMismatch(sidecar.pinnedTo, pinnedTo);
+    return sidecar.sets[trackingKey] ?? emptyTrackedSet(trackingKey);
+}
+export function withTrackedSet(sidecar, pinnedTo, set) {
+    return {
+        version: TRACKING_SIDECAR_VERSION,
+        pinnedTo,
+        sets: { ...(sidecar?.pinnedTo === pinnedTo ? sidecar.sets : {}), [set.trackingKey]: set },
+    };
+}
+//# sourceMappingURL=tracking.js.map

package/dist/tracking.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tracking.js","sourceRoot":"","sources":["../src/tracking.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAwB3C,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAE1C,2HAA2H;AAC3H,MAAM,UAAU,YAAY,CAAC,KAAc;IACzC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtF,MAAM,CAAC,GAAG,KAAgC,CAAC;IAC3C,IAAI,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC;QAAE,OAAO,KAAK,CAAC;IAC3H,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC7E,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAClG,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,OAAkC,CAAC,CAAC,KAAK,CAC9D,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,OAAQ,CAAkB,CAAC,QAAQ,KAAK,QAAQ,IAAI,OAAQ,CAAkB,CAAC,MAAM,KAAK,QAAQ,CACjJ,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,eAAe,CAAC,IAAa;IAC3C,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACvF,MAAM,GAAG,GAA+B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAA+B,CAAC,EAAE,CAAC;QAC3E,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,WAAW,KAAK,GAAG;YAAE,OAAO,SAAS,CAAC;QACxE,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAmBD,4EAA4E;AAC5E,MAAM,OAAO,mBAAmB;IACb,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IACtD,IAAI,CAAC,WAAmB;QACtB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,CAAC,GAAe;QAClB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IACtC,CAAC;IACD,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/B,CAAC;IACD,MAAM,CAAC,WAAmB;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAChC,CAAC;CACF;AAmBD,MAAM,UAAU,eAAe,CAAC,WAAmB;IACjD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,QAAoB,EAAE,OAA+B,EAAE,IAAkB;IACpG,MAAM,MAAM,GAA8C,EAAE,CAAC;IAC7D,MAAM,MAAM,GAA8C,EAAE,CAAC;IAC7D,MAAM,IAAI,GAA8C,EAAE,CAAC;IAC3D,MAAM,MAAM,GAA8C,EAAE,CAAC;IAC7D,MAAM,cAAc,GAAe,EAAE,CAAC;IACtC,MAAM,WAAW,GAAmC,EAAE,CAAC;IAEvD,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC;IAChF,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;IACtF,MAAM,OAAO,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,IAAI,UAAU,EAAE,CAAC;IAClG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAY,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5E,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC;YACjD,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YAChE,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAC/E,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC9D,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;QACnC,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,wEAAwE;IACxE,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAChE,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IACnG,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,WAAW,EAAE,QAAQ,CAAC,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,EAAE,cAAc,EAAE,CAAC;AAC/I,CAAC;AAED,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IACvB;IAA2B;IAAhD,YAAqB,QAAgB,EAAW,MAAc;QAC5D,KAAK,CAAC,iCAAiC,QAAQ,4BAA4B,MAAM,EAAE,CAAC,CAAC;QADlE,aAAQ,GAAR,QAAQ,CAAQ;QAAW,WAAM,GAAN,MAAM,CAAQ;QAE5D,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;IACpC,CAAC;CACF;AAED,2FAA2F;AAC3F,MAAM,UAAU,cAAc,CAAC,OAAoC,EAAE,QAAgB,EAAE,WAAmB;IACxG,IAAI,CAAC,OAAO;QAAE,OAAO,eAAe,CAAC,WAAW,CAAC,CAAC;IAClD,IAAI,OAAO,CAAC,OAAO,KAAK,wBAAwB;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;IAC7H,IAAI,OAAO,CAAC,QAAQ,KAAK,QAAQ;QAAE,MAAM,IAAI,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC7F,OAAO,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,eAAe,CAAC,WAAW,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,OAAoC,EAAE,QAAgB,EAAE,GAAe;IACpG,OAAO;QACL,OAAO,EAAE,wBAAwB;QACjC,QAAQ;QACR,IAAI,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE;KAC1F,CAAC;AACJ,CAAC"}

package/dist/values.d.ts

@@ -0,0 +1,102 @@
+/**
+ * The flow data model.
+ *
+ * Every value travelling along an edge is wrapped in an explicit container
+ * (`FlowData`) that says how it is structured — one item, an ordered list,
+ * or a group of lists keyed by string. Nodes never sniff shapes: a port
+ * declares the `access` it wants and the scheduler lifts the node over the
+ * container (see `lift.ts`). That single rule replaces Grasshopper's data
+ * trees (paths, Path Mapper, Simplify) and Dynamo's list levels with one
+ * keyed level, which is what BIM data actually is: keyed by GlobalId,
+ * storey, sheet name, grid intersection.
+ *
+ * Values are plain data. An entity is a *handle* (`EntityRef`), never a copy
+ * of its properties; nodes read what they need through `bim.*` on demand.
+ */
+/** How a port consumes or produces data. */
+export type Access = 'item' | 'list' | 'group';
+/** How an `item` port is lifted over lists (Dynamo lacing). */
+export type Lacing = 'shortest' | 'longest' | 'cross';
+/** A group key: a string so it survives JSON and sidecars unchanged. */
+export type GroupKey = string;
+export type FlowData<T = unknown> = {
+    readonly kind: 'item';
+    readonly value: T;
+} | {
+    readonly kind: 'list';
+    readonly items: readonly T[];
+} | {
+    readonly kind: 'group';
+    readonly branches: ReadonlyMap<GroupKey, readonly T[]>;
+};
+export declare function item<T>(value: T): FlowData<T>;
+export declare function list<T>(items: readonly T[]): FlowData<T>;
+export declare function group<T>(branches: ReadonlyMap<GroupKey, readonly T[]> | Iterable<readonly [GroupKey, readonly T[]]>): FlowData<T>;
+/** The branch key a plain list occupies when a `group` port receives it. */
+export declare const SINGLE_BRANCH: GroupKey;
+/** Total item count regardless of structure. */
+export declare function countItems(data: FlowData): number;
+/** Flatten any structure to a list, branch order preserved. */
+export declare function flatten<T>(data: FlowData<T>): readonly T[];
+/** View any structure as a group: an item or list becomes the single branch. */
+export declare function asGroup<T>(data: FlowData<T>): ReadonlyMap<GroupKey, readonly T[]>;
+export type Scalar = string | number | boolean | null;
+/**
+ * An entity handle. `globalId` is the identity that survives reloads,
+ * exports and layer publishes; `modelId`/`expressId` are the host's
+ * session-scoped address for it and may be re-resolved. Keys, joins and
+ * tracking use `globalId`; reads through `bim.*` use the address.
+ */
+export interface EntityRef {
+    readonly globalId: string;
+    readonly modelId?: string;
+    readonly expressId?: number;
+}
+export type Point = readonly [number, number, number];
+export interface Polyline {
+    readonly points: readonly Point[];
+    readonly closed: boolean;
+}
+export interface Placement {
+    readonly position: Point;
+    /** Rotation about Z in degrees. */
+    readonly rotationZ: number;
+}
+/** Parametric profiles — the shapes `@ifc-lite/create` can author. No BRep. */
+export type Profile = {
+    readonly kind: 'rectangle';
+    readonly width: number;
+    readonly depth: number;
+} | {
+    readonly kind: 'circle';
+    readonly radius: number;
+} | {
+    readonly kind: 'hollowCircle';
+    readonly radius: number;
+    readonly wallThickness: number;
+} | {
+    readonly kind: 'hollowRectangle';
+    readonly width: number;
+    readonly depth: number;
+    readonly wallThickness: number;
+} | {
+    readonly kind: 'I' | 'L' | 'T' | 'U';
+    readonly width: number;
+    readonly depth: number;
+    readonly webThickness: number;
+    readonly flangeThickness: number;
+};
+/** The value kinds a port can carry. `any` accepts everything (Watch, Script). */
+export type ValueKind = 'scalar' | 'entity' | 'point' | 'polyline' | 'placement' | 'profile' | 'elementSpec' | 'table' | 'any';
+/** A port's static type: what kind of value, and how it is structured. */
+export interface PortType {
+    readonly kind: ValueKind;
+    readonly access: Access;
+}
+/**
+ * Whether a value produced on `from` can be consumed by `to`.
+ * Structure is always adaptable (the scheduler lifts), so only the value
+ * kind is checked; `any` matches both ways.
+ */
+export declare function isAssignable(from: PortType, to: PortType): boolean;
+//# sourceMappingURL=values.d.ts.map

package/dist/values.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.d.ts","sourceRoot":"","sources":["../src/values.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;GAcG;AAIH,4CAA4C;AAC5C,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC;AAE/C,+DAA+D;AAC/D,MAAM,MAAM,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,OAAO,CAAC;AAEtD,wEAAwE;AACxE,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,OAAO,IAC5B;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GAC5C;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAA;CAAE,GACvD;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC,CAAA;CAAE,CAAC;AAEvF,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAE7C;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAExD;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAEjI;AAED,4EAA4E;AAC5E,eAAO,MAAM,aAAa,EAAE,QAAa,CAAC;AAE1C,gDAAgD;AAChD,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAYjD;AAED,+DAA+D;AAC/D,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAY1D;AAED,gFAAgF;AAChF,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC,CASjF;AAID,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAEtD,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;IACzB,mCAAmC;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,+EAA+E;AAC/E,MAAM,MAAM,OAAO,GACf;IAAE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC9E;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACpD;IAAE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;CAAE,GAC1F;IAAE,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;CAAE,GACpH;IAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;CAAE,CAAC;AAE9J,kFAAkF;AAClF,MAAM,MAAM,SAAS,GACjB,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,UAAU,GACV,WAAW,GACX,SAAS,GACT,aAAa,GACb,OAAO,GACP,KAAK,CAAC;AAEV,0EAA0E;AAC1E,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,GAAG,OAAO,CAElE"}

package/dist/values.js

@@ -0,0 +1,64 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+export function item(value) {
+    return { kind: 'item', value };
+}
+export function list(items) {
+    return { kind: 'list', items };
+}
+export function group(branches) {
+    return { kind: 'group', branches: branches instanceof Map ? branches : new Map(branches) };
+}
+/** The branch key a plain list occupies when a `group` port receives it. */
+export const SINGLE_BRANCH = '';
+/** Total item count regardless of structure. */
+export function countItems(data) {
+    switch (data.kind) {
+        case 'item':
+            return 1;
+        case 'list':
+            return data.items.length;
+        case 'group': {
+            let n = 0;
+            for (const items of data.branches.values())
+                n += items.length;
+            return n;
+        }
+    }
+}
+/** Flatten any structure to a list, branch order preserved. */
+export function flatten(data) {
+    switch (data.kind) {
+        case 'item':
+            return [data.value];
+        case 'list':
+            return data.items;
+        case 'group': {
+            const out = [];
+            for (const items of data.branches.values())
+                out.push(...items);
+            return out;
+        }
+    }
+}
+/** View any structure as a group: an item or list becomes the single branch. */
+export function asGroup(data) {
+    switch (data.kind) {
+        case 'item':
+            return new Map([[SINGLE_BRANCH, [data.value]]]);
+        case 'list':
+            return new Map([[SINGLE_BRANCH, data.items]]);
+        case 'group':
+            return data.branches;
+    }
+}
+/**
+ * Whether a value produced on `from` can be consumed by `to`.
+ * Structure is always adaptable (the scheduler lifts), so only the value
+ * kind is checked; `any` matches both ways.
+ */
+export function isAssignable(from, to) {
+    return from.kind === 'any' || to.kind === 'any' || from.kind === to.kind;
+}
+//# sourceMappingURL=values.js.map

package/dist/values.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.js","sourceRoot":"","sources":["../src/values.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAkC/D,MAAM,UAAU,IAAI,CAAI,KAAQ;IAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,IAAI,CAAI,KAAmB;IACzC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,KAAK,CAAI,QAA2F;IAClH,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,YAAY,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;AAC7F,CAAC;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,aAAa,GAAa,EAAE,CAAC;AAE1C,gDAAgD;AAChD,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,CAAC,CAAC;QACX,KAAK,MAAM;YACT,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3B,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAAE,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC;YAC9D,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,OAAO,CAAI,IAAiB;IAC1C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,KAAK,MAAM;YACT,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,GAAG,GAAQ,EAAE,CAAC;YACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;YAC/D,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,OAAO,CAAI,IAAiB;IAC1C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,KAAK,MAAM;YACT,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChD,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;AACH,CAAC;AAyDD;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc,EAAE,EAAY;IACvD,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC;AAC3E,CAAC"}

package/dist/wiring.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Registry-aware validation: the half `validateFlowDocument` cannot do.
+ *
+ * The document validator is structural — it can say `edges[0].from` is
+ * `[nodeId, port]` and that the node exists, but not that the node HAS that
+ * port, because it deliberately works without a registry. Everything that
+ * needs to know what a node type actually declares lives here: unknown node
+ * types, edge endpoints naming ports that do not exist, type-incompatible
+ * edges, and Player `inputs` / graph `outputs` pointing at parameters and
+ * ports that are not there.
+ *
+ * Without this, a graph whose declared output names a missing port passed
+ * validation, reported `ok: true`, exited 0 — and then produced nothing for
+ * that output at run time. A validator that cannot see the defect it is
+ * asked about reads as success, which is worse than not running at all.
+ */
+import type { FlowDocument, DocumentProblem } from './document.js';
+import type { NodeRegistry } from './registry.js';
+export declare function validateFlowWiring(doc: FlowDocument, registry: NodeRegistry<unknown>): DocumentProblem[];
+//# sourceMappingURL=wiring.d.ts.map

package/dist/wiring.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"wiring.d.ts","sourceRoot":"","sources":["../src/wiring.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACnE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAGlD,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,YAAY,CAAC,OAAO,CAAC,GAAG,eAAe,EAAE,CAmDxG"}

package/dist/wiring.js

@@ -0,0 +1,56 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { isAssignable } from './values.js';
+export function validateFlowWiring(doc, registry) {
+    const problems = [];
+    const add = (path, message) => problems.push({ path, message });
+    const defOf = (nodeId) => {
+        const node = doc.nodes.find((n) => n.id === nodeId);
+        return node ? registry.get(node.type) : undefined;
+    };
+    doc.nodes.forEach((n, i) => {
+        if (!registry.get(n.type))
+            add(`nodes[${i}]`, `unknown node type "${n.type}" (${n.id})`);
+    });
+    doc.edges.forEach((e, i) => {
+        const from = defOf(e.from[0])?.outputs.find((p) => p.name === e.from[1]);
+        const to = defOf(e.to[0])?.inputs.find((p) => p.name === e.to[1]);
+        if (defOf(e.from[0]) && !from)
+            add(`edges[${i}].from`, `node "${e.from[0]}" has no output "${e.from[1]}"`);
+        if (defOf(e.to[0]) && !to)
+            add(`edges[${i}].to`, `node "${e.to[0]}" has no input "${e.to[1]}"`);
+        if (from && to && !isAssignable(from.type, to.type)) {
+            add(`edges[${i}]`, `${e.from[0]}.${e.from[1]} (${from.type.kind}) cannot feed ${e.to[0]}.${e.to[1]} (${to.type.kind})`);
+        }
+    });
+    doc.inputs.forEach((input, i) => {
+        const def = defOf(input.nodeId);
+        if (def && !def.params.some((p) => p.name === input.param)) {
+            add(`inputs[${i}]`, `node "${input.nodeId}" has no parameter "${input.param}"`);
+        }
+    });
+    doc.outputs.forEach((output, i) => {
+        const def = defOf(output.nodeId);
+        if (def && !def.outputs.some((p) => p.name === output.port)) {
+            add(`outputs[${i}]`, `node "${output.nodeId}" has no output "${output.port}"`);
+        }
+    });
+    // Required inputs with nothing connected: the scheduler fails the node at
+    // run time, so a validator that stayed silent here would promise a run it
+    // knows cannot happen.
+    for (const node of doc.nodes) {
+        const def = registry.get(node.type);
+        if (!def)
+            continue;
+        for (const port of def.inputs) {
+            if (port.optional)
+                continue;
+            if (!doc.edges.some((e) => e.to[0] === node.id && e.to[1] === port.name)) {
+                add(`nodes[${doc.nodes.indexOf(node)}]`, `required input "${port.name}" of "${node.id}" is not connected`);
+            }
+        }
+    }
+    return problems;
+}
+//# sourceMappingURL=wiring.js.map