@ifc-lite/flow 0.2.0

package/dist/scheduler.d.ts

@@ -0,0 +1,91 @@
+/**
+ * Evaluation: topological order, per-node memoisation, lifting, and a
+ * structured run log. Nothing here touches a model; the host services
+ * object is passed through to nodes untouched.
+ *
+ * Memo keys cover the node type, resolved params, lacing, every input's
+ * content digest and — for nodes that declare `reads: 'model'` — the
+ * per-model revisions the caller supplies. The caller owns those revisions:
+ * it bumps one when the graph's own write nodes touch a model, and when the
+ * host reports an external change. Write nodes are never memoised.
+ */
+import { type HostFeatures } from './availability.js';
+import type { FlowDocument } from './document.js';
+import { type LogLevel, type NodeRegistry } from './registry.js';
+import { type TrackingStore } from './tracking.js';
+import type { FlowData } from './values.js';
+export declare const DEFAULT_MAX_CROSS = 100000;
+export interface RunLogEntry {
+    readonly nodeId: string;
+    readonly laneKey: string | null;
+    readonly level: LogLevel;
+    readonly message: string;
+}
+export type NodeStatus = 'ok' | 'memo' | 'noop' | 'skipped' | 'error';
+export interface NodeReport {
+    readonly nodeId: string;
+    readonly status: NodeStatus;
+    readonly durationMs: number;
+    readonly lanes: number;
+    readonly laneErrors: number;
+    readonly missing: Readonly<Record<string, readonly string[]>>;
+    readonly warnings: readonly string[];
+    readonly error?: string;
+    /** Tracked nodes: what the run did to the node's element set. */
+    readonly tracking?: {
+        readonly created: number;
+        readonly updated: number;
+        readonly kept: number;
+        readonly removed: number;
+    };
+}
+export interface GraphOutputValue {
+    readonly label: string;
+    readonly nodeId: string;
+    readonly port: string;
+    readonly data: FlowData | undefined;
+}
+export interface RunResult {
+    readonly ok: boolean;
+    /** Number of write nodes that ran; the caller bumps its model revision when non-zero. */
+    readonly writes: number;
+    /** Every node's outputs by port, for inspectors. */
+    readonly outputs: ReadonlyMap<string, ReadonlyMap<string, FlowData>>;
+    /** The document's declared outputs, in order. */
+    readonly graphOutputs: readonly GraphOutputValue[];
+    readonly reports: readonly NodeReport[];
+    readonly log: readonly RunLogEntry[];
+}
+/** Reusable across runs of the same document; keyed by node id. */
+export declare class MemoCache {
+    private readonly entries;
+    /**
+     * Bumped by the scheduler after every write node, and part of every
+     * model-reading memo key: a read behind a write in the same run, and any
+     * read in a later run, sees a model that changed and recomputes.
+     */
+    writeGeneration: number;
+    get(nodeId: string, key: string): ReadonlyMap<string, FlowData> | undefined;
+    set(nodeId: string, key: string, outputs: ReadonlyMap<string, FlowData>): void;
+    invalidate(nodeId?: string): void;
+}
+export interface RunOptions<H> {
+    readonly host: H;
+    readonly registry: NodeRegistry<H>;
+    /** Player overrides keyed `${nodeId}.${param}`. */
+    readonly inputs?: Readonly<Record<string, unknown>>;
+    readonly modelRevisions?: Readonly<Record<string, number>>;
+    readonly features?: HostFeatures;
+    readonly cache?: MemoCache;
+    /** Where tracked nodes read and persist their element sets; absent = every lane is a fresh create. */
+    readonly tracking?: TrackingStore;
+    readonly signal?: AbortSignal;
+}
+export declare class FlowCycleError extends Error {
+    readonly nodeIds: readonly string[];
+    constructor(nodeIds: readonly string[]);
+}
+/** Kahn's algorithm; stable with respect to document node order. */
+export declare function topologicalOrder(doc: FlowDocument): string[];
+export declare function runFlow<H>(doc: FlowDocument, opts: RunOptions<H>): Promise<RunResult>;
+//# sourceMappingURL=scheduler.d.ts.map

package/dist/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;GAUG;AAEH,OAAO,EAAoB,KAAK,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAExE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAElD,OAAO,EAAoC,KAAK,QAAQ,EAAoB,KAAK,YAAY,EAAE,MAAM,eAAe,CAAC;AAGrH,OAAO,EAAoD,KAAK,aAAa,EAAE,MAAM,eAAe,CAAC;AACrG,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAE5C,eAAO,MAAM,iBAAiB,SAAU,CAAC;AAEzC,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,MAAM,UAAU,GAAG,IAAI,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;AAEtE,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,iEAAiE;IACjE,QAAQ,CAAC,QAAQ,CAAC,EAAE;QAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7H;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAC;CACrC;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;IACrB,yFAAyF;IACzF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,oDAAoD;IACpD,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;IACrE,iDAAiD;IACjD,QAAQ,CAAC,YAAY,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACnD,QAAQ,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,CAAC;IACxC,QAAQ,CAAC,GAAG,EAAE,SAAS,WAAW,EAAE,CAAC;CACtC;AAED,mEAAmE;AACnE,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA8E;IACtG;;;;OAIG;IACH,eAAe,SAAK;IAEpB,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS;IAK3E,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,IAAI;IAI9E,UAAU,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;CAIlC;AAED,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACjB,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,mDAAmD;IACnD,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACpD,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC;IAC3B,sGAAsG;IACtG,QAAQ,CAAC,QAAQ,CAAC,EAAE,aAAa,CAAC;IAClC,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC;CAC/B;AAED,qBAAa,cAAe,SAAQ,KAAK;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE;gBAA1B,OAAO,EAAE,SAAS,MAAM,EAAE;CAIhD;AAED,oEAAoE;AACpE,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,EAAE,CAsB5D;AAED,wBAAsB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CA4P3F"}

package/dist/scheduler.js

@@ -0,0 +1,341 @@
+/* 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/. */
+/**
+ * Evaluation: topological order, per-node memoisation, lifting, and a
+ * structured run log. Nothing here touches a model; the host services
+ * object is passed through to nodes untouched.
+ *
+ * Memo keys cover the node type, resolved params, lacing, every input's
+ * content digest and — for nodes that declare `reads: 'model'` — the
+ * per-model revisions the caller supplies. The caller owns those revisions:
+ * it bumps one when the graph's own write nodes touch a model, and when the
+ * host reports an external change. Write nodes are never memoised.
+ */
+import { nodeAvailability } from './availability.js';
+import { digest, digestFlowData } from './digest.js';
+import { assemble, planLift } from './lift.js';
+import { resolveParams } from './registry.js';
+import { ORPHAN_NODE_ID, removeOrphanedSets, removeSet, trackingKeyOf } from './orphans.js';
+import { noopOutputs, prepareInputs } from './prepare.js';
+import { emptyTrackedSet, planTracking } from './tracking.js';
+export const DEFAULT_MAX_CROSS = 100_000;
+/** Reusable across runs of the same document; keyed by node id. */
+export class MemoCache {
+    entries = new Map();
+    /**
+     * Bumped by the scheduler after every write node, and part of every
+     * model-reading memo key: a read behind a write in the same run, and any
+     * read in a later run, sees a model that changed and recomputes.
+     */
+    writeGeneration = 0;
+    get(nodeId, key) {
+        const e = this.entries.get(nodeId);
+        return e && e.key === key ? e.outputs : undefined;
+    }
+    set(nodeId, key, outputs) {
+        this.entries.set(nodeId, { key, outputs });
+    }
+    invalidate(nodeId) {
+        if (nodeId === undefined)
+            this.entries.clear();
+        else
+            this.entries.delete(nodeId);
+    }
+}
+export class FlowCycleError extends Error {
+    nodeIds;
+    constructor(nodeIds) {
+        super(`flow has a cycle through ${nodeIds.join(' → ')}`);
+        this.nodeIds = nodeIds;
+        this.name = 'FlowCycleError';
+    }
+}
+/** Kahn's algorithm; stable with respect to document node order. */
+export function topologicalOrder(doc) {
+    const indegree = new Map(doc.nodes.map((n) => [n.id, 0]));
+    const out = new Map(doc.nodes.map((n) => [n.id, []]));
+    for (const e of doc.edges) {
+        out.get(e.from[0]).push(e.to[0]);
+        indegree.set(e.to[0], (indegree.get(e.to[0]) ?? 0) + 1);
+    }
+    const ready = doc.nodes.filter((n) => indegree.get(n.id) === 0).map((n) => n.id);
+    const order = [];
+    while (ready.length > 0) {
+        const id = ready.shift();
+        order.push(id);
+        for (const next of out.get(id)) {
+            const d = indegree.get(next) - 1;
+            indegree.set(next, d);
+            if (d === 0)
+                ready.push(next);
+        }
+    }
+    if (order.length !== doc.nodes.length) {
+        throw new FlowCycleError(doc.nodes.map((n) => n.id).filter((id) => !order.includes(id)));
+    }
+    return order;
+}
+export async function runFlow(doc, opts) {
+    const registry = opts.registry;
+    const order = topologicalOrder(doc);
+    const outputs = new Map();
+    const reports = [];
+    const log = [];
+    const failed = new Set();
+    const nodesById = new Map(doc.nodes.map((n) => [n.id, n]));
+    const maxCross = doc.maxCross ?? DEFAULT_MAX_CROSS;
+    let writesThisRun = 0;
+    for (const nodeId of order) {
+        const node = nodesById.get(nodeId);
+        const started = Date.now();
+        const report = (partial) => reports.push({ nodeId, durationMs: Date.now() - started, ...partial });
+        const fail = (error, lanes = 0) => {
+            failed.add(nodeId);
+            log.push({ nodeId, laneKey: null, level: 'error', message: error });
+            report({ status: 'error', lanes, laneErrors: 0, missing: {}, warnings: [], error });
+        };
+        const def = registry.get(node.type);
+        if (!def) {
+            fail(`unknown node type "${node.type}"`);
+            continue;
+        }
+        const { inputs, problems, skipped } = prepareInputs(doc, node, def, registry, outputs, failed);
+        if (skipped) {
+            failed.add(nodeId);
+            report({ status: 'skipped', lanes: 0, laneErrors: 0, missing: {}, warnings: [], error: 'an upstream node failed' });
+            continue;
+        }
+        if (problems.length > 0) {
+            fail(problems.join('; '));
+            continue;
+        }
+        const overrides = {};
+        for (const p of def.params) {
+            const v = opts.inputs?.[`${nodeId}.${p.name}`];
+            if (v !== undefined)
+                overrides[p.name] = v;
+        }
+        const params = resolveParams(def, { ...node.params, ...overrides });
+        const lacing = node.lacing ?? 'shortest';
+        if (opts.features) {
+            const avail = nodeAvailability(def, node.type, opts.features);
+            if (avail.status === 'unavailable') {
+                fail(avail.reasons.join('; '));
+                continue;
+            }
+            if (avail.status === 'noop') {
+                outputs.set(nodeId, noopOutputs(def, inputs));
+                report({ status: 'noop', lanes: 0, laneErrors: 0, missing: {}, warnings: avail.reasons });
+                continue;
+            }
+        }
+        const memoKey = def.writes
+            ? undefined
+            : digest({
+                type: def.type,
+                params,
+                lacing,
+                inputs: inputs.map((i) => (i.data ? digestFlowData(i.data) : null)),
+                rev: def.reads === 'model' ? { ...opts.modelRevisions, '': opts.cache?.writeGeneration ?? 0 } : undefined,
+            });
+        if (memoKey && opts.cache) {
+            const hit = opts.cache.get(nodeId, memoKey);
+            if (hit) {
+                outputs.set(nodeId, new Map(hit));
+                report({ status: 'memo', lanes: 0, laneErrors: 0, missing: {}, warnings: [] });
+                continue;
+            }
+        }
+        let plan;
+        try {
+            plan = planLift(inputs, { lacing, maxCross, laneKeyPort: def.laneKeyPort });
+        }
+        catch (err) {
+            fail(err.message);
+            continue;
+        }
+        for (const w of plan.warnings)
+            log.push({ nodeId, laneKey: null, level: 'warn', message: w });
+        for (const [port, keys] of Object.entries(plan.missing)) {
+            log.push({ nodeId, laneKey: null, level: 'warn', message: `input "${port}" has no branch for keys: ${keys.join(', ')}` });
+        }
+        // Tracked nodes: decide per lane what to do against last run's set.
+        let trackingPlan;
+        const trackingKey = trackingKeyOf(doc, node);
+        if (def.tracked) {
+            let previous = opts.tracking?.load(trackingKey) ?? emptyTrackedSet(trackingKey);
+            // A set another node type made under this key is not adopted: its
+            // elements go out through THAT type's `remove`, and this node starts
+            // from an empty set. Planning against it would overwrite `nodeType`
+            // and leave the old type's elements to nobody.
+            if (previous.nodeType !== undefined && previous.nodeType !== node.type) {
+                const gone = await removeSet(previous, registry, opts.host, opts.signal, log, nodeId);
+                if (gone.removed > 0) {
+                    writesThisRun += 1;
+                    if (opts.cache)
+                        opts.cache.writeGeneration += 1;
+                }
+                if (gone.rest !== undefined) {
+                    opts.tracking?.save(gone.rest);
+                    fail(`the tracked set "${trackingKey}" was made by node type "${previous.nodeType}" and ${Object.keys(gone.rest.entries).length} of its element(s) could not be removed; give this node its own tracking key`);
+                    continue;
+                }
+                // Persisted now, not with the node's own result: if the node fails
+                // below, the store must not still name elements that are gone.
+                previous = emptyTrackedSet(trackingKey);
+                opts.tracking?.save(previous);
+            }
+            const desired = plan.lanes
+                .filter((l) => !l.nullLane)
+                .map((l) => ({ laneKey: l.laneKey ?? '', digest: digest({ args: l.args, params }) }));
+            trackingPlan = planTracking(previous, desired, node.tracking ?? 'update');
+            for (const k of trackingPlan.duplicateLanes)
+                log.push({ nodeId, laneKey: k, level: 'warn', message: 'duplicate lane key; only the first lane is tracked' });
+        }
+        const laneTracking = (laneKey) => {
+            if (!trackingPlan)
+                return undefined;
+            const k = laneKey ?? '';
+            const c = trackingPlan.create.find((e) => e.laneKey === k);
+            if (c)
+                return { action: 'create', globalId: c.globalId };
+            const u = trackingPlan.update.find((e) => e.laneKey === k);
+            if (u)
+                return { action: 'update', globalId: u.globalId };
+            const kept = trackingPlan.keep.find((e) => e.laneKey === k);
+            return kept ? { action: 'keep', globalId: kept.globalId } : undefined;
+        };
+        const makeCtx = (laneKey, tracking) => ({
+            host: opts.host,
+            laneKey,
+            tracking,
+            signal: opts.signal,
+            log: (level, message) => log.push({ nodeId, laneKey, level, message }),
+        });
+        const results = [];
+        let laneErrors = 0;
+        let nodeError;
+        const seenLanes = new Set();
+        // Lanes skipped as duplicates yield null like a failed lane but must not
+        // count as one: counting them dropped the FIRST lane's fresh entry, and
+        // the next run then planned `create` against an element that existed.
+        const skippedDuplicates = new Set();
+        for (const lane of plan.lanes) {
+            if (opts.signal?.aborted) {
+                nodeError = 'aborted';
+                break;
+            }
+            if (lane.nullLane) {
+                results.push(null);
+                continue;
+            }
+            const duplicate = trackingPlan !== undefined && seenLanes.has(lane.laneKey ?? '');
+            seenLanes.add(lane.laneKey ?? '');
+            if (duplicate) {
+                skippedDuplicates.add(results.length);
+                results.push(null);
+                continue;
+            }
+            const ctx = makeCtx(lane.laneKey, laneTracking(lane.laneKey));
+            try {
+                results.push(await def.run(ctx, lane.args, params));
+            }
+            catch (err) {
+                const message = err instanceof Error ? err.message : String(err);
+                if (!plan.lifted) {
+                    nodeError = message;
+                    break;
+                }
+                laneErrors += 1;
+                log.push({ nodeId, laneKey: lane.laneKey, level: 'error', message });
+                results.push(null);
+            }
+        }
+        if (nodeError !== undefined) {
+            fail(nodeError, plan.lanes.length);
+            continue;
+        }
+        let removeErrors = 0;
+        let removeSkipped = 0;
+        const failedRemovals = [];
+        if (trackingPlan) {
+            if (trackingPlan.remove.length > 0 && !def.remove) {
+                // No remove hook: mirror orphans.ts's removeSet guard. Warn, count
+                // zero removed, and treat every vanished lane like a failed removal
+                // so its entry is retained below instead of being dropped as if it
+                // had actually been removed.
+                removeSkipped = trackingPlan.remove.length;
+                log.push({ nodeId, laneKey: null, level: 'warn', message: `node type "${node.type}" has no remove hook; ${trackingPlan.remove.length} element(s) stay in the model` });
+                for (const gone of trackingPlan.remove)
+                    failedRemovals.push(gone.laneKey);
+            }
+            else {
+                for (const gone of trackingPlan.remove) {
+                    try {
+                        await def.remove?.(makeCtx(gone.laneKey), gone.globalId);
+                    }
+                    catch (err) {
+                        removeErrors += 1;
+                        failedRemovals.push(gone.laneKey);
+                        log.push({ nodeId, laneKey: gone.laneKey, level: 'error', message: `remove ${gone.globalId}: ${err instanceof Error ? err.message : String(err)}` });
+                    }
+                }
+            }
+            // A lane that failed keeps its previous entry, so the next run retries
+            // it instead of forgetting an element that may still exist. A vanished
+            // lane whose removal threw, or whose node has no remove hook at all,
+            // is the same case: still in the model, so still in the set.
+            const failedLanes = new Set([
+                ...plan.lanes.filter((l, i) => results[i] === null && !l.nullLane && !skippedDuplicates.has(i)).map((l) => l.laneKey ?? ''),
+                ...failedRemovals,
+            ]);
+            const entries = { ...trackingPlan.next.entries };
+            const previous = opts.tracking?.load(trackingKey)?.entries ?? {};
+            for (const k of failedLanes) {
+                if (previous[k])
+                    entries[k] = previous[k];
+                else
+                    delete entries[k];
+            }
+            opts.tracking?.save({ ...trackingPlan.next, entries, nodeType: node.type });
+        }
+        let assembled;
+        try {
+            assembled = assemble(plan, def.outputs, results);
+        }
+        catch (err) {
+            fail(err.message, plan.lanes.length);
+            continue;
+        }
+        outputs.set(nodeId, assembled);
+        if (def.writes) {
+            writesThisRun += 1;
+            if (opts.cache)
+                opts.cache.writeGeneration += 1;
+        }
+        if (memoKey && opts.cache)
+            opts.cache.set(nodeId, memoKey, assembled);
+        report({
+            status: 'ok',
+            lanes: plan.lanes.length,
+            laneErrors: laneErrors + removeErrors,
+            missing: plan.missing,
+            warnings: plan.warnings,
+            tracking: trackingPlan
+                ? { created: trackingPlan.create.length, updated: trackingPlan.update.length, kept: trackingPlan.keep.length, removed: trackingPlan.remove.length - removeErrors - removeSkipped }
+                : undefined,
+        });
+    }
+    const orphans = opts.signal?.aborted ? { removed: 0, errors: 0 } : await removeOrphanedSets(doc, opts.host, opts.tracking, registry, log, opts.signal);
+    if (orphans.errors > 0)
+        failed.add(ORPHAN_NODE_ID);
+    if (orphans.removed > 0) {
+        writesThisRun += 1;
+        if (opts.cache)
+            opts.cache.writeGeneration += 1;
+    }
+    const graphOutputs = doc.outputs.map((o) => ({ label: o.label, nodeId: o.nodeId, port: o.port, data: outputs.get(o.nodeId)?.get(o.port) }));
+    return { ok: failed.size === 0, writes: writesThisRun, outputs, graphOutputs, reports, log };
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,gBAAgB,EAAqB,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAiB,MAAM,WAAW,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAyE,MAAM,eAAe,CAAC;AACrH,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC5F,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,YAAY,EAAyC,MAAM,eAAe,CAAC;AAGrG,MAAM,CAAC,MAAM,iBAAiB,GAAG,OAAO,CAAC;AA2CzC,mEAAmE;AACnE,MAAM,OAAO,SAAS;IACH,OAAO,GAAG,IAAI,GAAG,EAAmE,CAAC;IACtG;;;;OAIG;IACH,eAAe,GAAG,CAAC,CAAC;IAEpB,GAAG,CAAC,MAAc,EAAE,GAAW;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IACpD,CAAC;IAED,GAAG,CAAC,MAAc,EAAE,GAAW,EAAE,OAAsC;QACrE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,UAAU,CAAC,MAAe;QACxB,IAAI,MAAM,KAAK,SAAS;YAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;;YAC1C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;CACF;AAeD,MAAM,OAAO,cAAe,SAAQ,KAAK;IAClB;IAArB,YAAqB,OAA0B;QAC7C,KAAK,CAAC,4BAA4B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QADtC,YAAO,GAAP,OAAO,CAAmB;QAE7C,IAAI,CAAC,IAAI,GAAG,gBAAgB,CAAC;IAC/B,CAAC;CACF;AAED,oEAAoE;AACpE,MAAM,UAAU,gBAAgB,CAAC,GAAiB;IAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,GAAG,GAAG,IAAI,GAAG,CAAmB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACxE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,CAAC,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,OAAO,CAAI,GAAiB,EAAE,IAAmB;IACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAiC,CAAC;IACxD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiC,CAAC;IACzD,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACnD,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,CAAC,OAAkD,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;QAC9I,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE;YACxC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACtF,CAAC,CAAC;QAEF,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,IAAI,CAAC,sBAAsB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACzC,SAAS;QACX,CAAC;QACD,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QAC/F,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnB,MAAM,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,yBAAyB,EAAE,CAAC,CAAC;YACpH,SAAS;QACX,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,MAAM,SAAS,GAA4B,EAAE,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,SAAS,EAAE,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC;QAEzC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9D,IAAI,KAAK,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC/B,SAAS;YACX,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;gBAC5B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC9C,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;gBAC1F,SAAS;YACX,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM;YACxB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,MAAM,CAAC;gBACL,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,MAAM;gBACN,MAAM;gBACN,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACnE,GAAG,EAAE,GAAG,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,EAAE,eAAe,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;aAC1G,CAAC,CAAC;QACP,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC5C,IAAI,GAAG,EAAE,CAAC;gBACR,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC/E,SAAS;YACX,CAAC;QACH,CAAC;QAED,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9E,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAE,GAAa,CAAC,OAAO,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACxD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,IAAI,6BAA6B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5H,CAAC;QAED,oEAAoE;QACpE,IAAI,YAAsC,CAAC;QAC3C,MAAM,WAAW,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChB,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,eAAe,CAAC,WAAW,CAAC,CAAC;YAChF,kEAAkE;YAClE,qEAAqE;YACrE,oEAAoE;YACpE,+CAA+C;YAC/C,IAAI,QAAQ,CAAC,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;gBACvE,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;gBACtF,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;oBACrB,aAAa,IAAI,CAAC,CAAC;oBACnB,IAAI,IAAI,CAAC,KAAK;wBAAE,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC;gBAClD,CAAC;gBACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC5B,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC/B,IAAI,CAAC,oBAAoB,WAAW,4BAA4B,QAAQ,CAAC,QAAQ,SAAS,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,8EAA8E,CAAC,CAAC;oBAC/M,SAAS;gBACX,CAAC;gBACD,mEAAmE;gBACnE,+DAA+D;gBAC/D,QAAQ,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;gBACxC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChC,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK;iBACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;iBAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACxF,YAAY,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;YAC1E,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,cAAc;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,oDAAoD,EAAE,CAAC,CAAC;QAC9J,CAAC;QACD,MAAM,YAAY,GAAG,CAAC,OAAsB,EAA4B,EAAE;YACxE,IAAI,CAAC,YAAY;gBAAE,OAAO,SAAS,CAAC;YACpC,MAAM,CAAC,GAAG,OAAO,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC;gBAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;YACzD,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC;gBAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;YACzD,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC;YAC5D,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACxE,CAAC,CAAC;QACF,MAAM,OAAO,GAAG,CAAC,OAAsB,EAAE,QAAuB,EAAE,EAAE,CAAC,CAAC;YACpE,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO;YACP,QAAQ;YACR,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,GAAG,EAAE,CAAC,KAAe,EAAE,OAAe,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;SACzF,CAAC,CAAC;QAEH,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,SAA6B,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,yEAAyE;QACzE,wEAAwE;QACxE,sEAAsE;QACtE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;gBACzB,SAAS,GAAG,SAAS,CAAC;gBACtB,MAAM;YACR,CAAC;YACD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,YAAY,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAClF,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAClC,IAAI,SAAS,EAAE,CAAC;gBACd,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACtC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC;gBACH,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;YACtD,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACjB,SAAS,GAAG,OAAO,CAAC;oBACpB,MAAM;gBACR,CAAC;gBACD,UAAU,IAAI,CAAC,CAAC;gBAChB,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;gBACrE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACnC,SAAS;QACX,CAAC;QACD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;gBAClD,mEAAmE;gBACnE,oEAAoE;gBACpE,mEAAmE;gBACnE,6BAA6B;gBAC7B,aAAa,GAAG,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;gBAC3C,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,IAAI,CAAC,IAAI,yBAAyB,YAAY,CAAC,MAAM,CAAC,MAAM,+BAA+B,EAAE,CAAC,CAAC;gBACvK,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,MAAM;oBAAE,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5E,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;oBACvC,IAAI,CAAC;wBACH,MAAM,GAAG,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC3D,CAAC;oBAAC,OAAO,GAAG,EAAE,CAAC;wBACb,YAAY,IAAI,CAAC,CAAC;wBAClB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;wBAClC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,IAAI,CAAC,QAAQ,KAAK,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;oBACvJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,uEAAuE;YACvE,uEAAuE;YACvE,qEAAqE;YACrE,6DAA6D;YAC7D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;gBAC1B,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;gBAC3H,GAAG,cAAc;aAClB,CAAC,CAAC;YACH,MAAM,OAAO,GAAG,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC;YACjE,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC5B,IAAI,QAAQ,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;;oBACrC,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,SAAgC,CAAC;QACrC,IAAI,CAAC;YACH,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACnD,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAE,GAAa,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAChD,SAAS;QACX,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC/B,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YACf,aAAa,IAAI,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,OAAO,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QACtE,MAAM,CAAC;YACL,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;YACxB,UAAU,EAAE,UAAU,GAAG,YAAY;YACrC,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,YAAY;gBACpB,CAAC,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,MAAM,GAAG,YAAY,GAAG,aAAa,EAAE;gBAClL,CAAC,CAAC,SAAS;SACd,CAAC,CAAC;IACL,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACvJ,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACnD,IAAI,OAAO,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;QACxB,aAAa,IAAI,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,YAAY,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5I,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;AAC/F,CAAC"}

package/dist/table.d.ts

@@ -0,0 +1,64 @@
+/**
+ * `Table`: the tabular value that goes to and comes back from Excel/CSV.
+ *
+ * Every column carries an IFC value type and, when it maps onto a property,
+ * the `pset`/`prop` it was read from — so a round trip through a spreadsheet
+ * does not lose the difference between `IfcReal` 2.0 and `IfcInteger` 2, and
+ * a unit is never guessed on the way back. A table always names its key
+ * column: a keyless sheet cannot be matched back to entities and is refused.
+ *
+ * Long format `(GlobalId, Pset, Prop, Value, Type, Unit)` is the canonical
+ * entity/pset/property shape; `pivot` widens it to one row per entity for a
+ * sheet and `groupBy` splits it per entity for lifting.
+ */
+import type { GroupKey, Scalar } from './values.js';
+/** IFC value types spelled as strings so they survive JSON documents. */
+export type ColumnType = 'string' | 'real' | 'integer' | 'boolean' | 'logical' | 'label' | 'identifier' | 'text' | 'enum' | 'reference' | 'list';
+export declare const COLUMN_TYPES: readonly ColumnType[];
+export interface Column {
+    readonly name: string;
+    readonly type: ColumnType;
+    readonly unit?: string;
+    /** The property this column was read from, when it maps onto one. */
+    readonly binding?: {
+        readonly pset: string;
+        readonly prop: string;
+    };
+}
+export type Cell = Scalar;
+export type Row = Readonly<Record<string, Cell>>;
+export interface Table {
+    readonly columns: readonly Column[];
+    readonly rows: readonly Row[];
+    /** Name of the column whose values identify a row (usually `GlobalId`). */
+    readonly key: string;
+}
+export interface TableProblem {
+    readonly path: string;
+    readonly message: string;
+}
+/** Structural validation of an untrusted table value. */
+export declare function validateTable(value: unknown, path?: string): TableProblem[];
+export declare function column(table: Table, name: string): Column | undefined;
+/** The row key as a group key; `null`/missing keys are reported, never coerced. */
+export declare function rowKey(table: Table, row: Row): GroupKey | null;
+export interface GroupedRows {
+    readonly branches: ReadonlyMap<GroupKey, readonly Row[]>;
+    /** Rows whose grouping column was empty. */
+    readonly unkeyed: readonly Row[];
+}
+/** Split rows into branches by a column's value (defaults to the key column). */
+export declare function groupRows(table: Table, by?: string): GroupedRows;
+/**
+ * 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 declare function pivot(table: Table, rowKeyCol: string, colKeyCol: string, valueCol: string): {
+    table: Table;
+    duplicates: number;
+    collisions: number;
+};
+//# sourceMappingURL=table.d.ts.map

package/dist/table.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"table.d.ts","sourceRoot":"","sources":["../src/table.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAEpD,yEAAyE;AACzE,MAAM,MAAM,UAAU,GAClB,QAAQ,GACR,MAAM,GACN,SAAS,GACT,SAAS,GACT,SAAS,GACT,OAAO,GACP,YAAY,GACZ,MAAM,GACN,MAAM,GACN,WAAW,GACX,MAAM,CAAC;AAEX,eAAO,MAAM,YAAY,EAAE,SAAS,UAAU,EAE7C,CAAC;AAEF,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,qEAAqE;IACrE,QAAQ,CAAC,OAAO,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CACrE;AAED,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAC1B,MAAM,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;AAEjD,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,EAAE,CAAC;IAC9B,2EAA2E;IAC3E,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,yDAAyD;AACzD,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,SAAU,GAAG,YAAY,EAAE,CAsC5E;AAED,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAErE;AAED,mFAAmF;AACnF,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,QAAQ,GAAG,IAAI,CAI9D;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE,SAAS,GAAG,EAAE,CAAC,CAAC;IACzD,4CAA4C;IAC5C,QAAQ,CAAC,OAAO,EAAE,SAAS,GAAG,EAAE,CAAC;CAClC;AAED,iFAAiF;AACjF,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,GAAE,MAAkB,GAAG,WAAW,CAe3E;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,KAAK,EACZ,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,GACf;IAAE,KAAK,EAAE,KAAK,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAmC1D"}