@xenolithengine/graph-core 0.7.0-beta.0

package/dist/template-flatten.js

@@ -0,0 +1,157 @@
+import { TEMPLATE_INPUT_TYPE, TEMPLATE_OUTPUT_TYPE, isTemplateBoundary, isTemplateInstance, } from './template-def.js';
+/** Flatten `instance` against the definitions reachable through `resolveDef`. Returns null if a
+ *  definition is missing or a recursion cycle is detected (a definition transitively containing an
+ *  instance of itself). Pure — never mutates the instance, definitions, or document. */
+export function flattenTemplateInstance(instance, resolveDef, mint) {
+    return flatten(instance, resolveDef, mint, []);
+}
+function flatten(instance, resolveDef, mint, path) {
+    const defId = instance.state['definitionId'];
+    if (defId === undefined)
+        return null;
+    if (path.includes(defId))
+        return null; // cycle: this definition is already being flattened above us
+    const def = resolveDef(defId);
+    if (!def)
+        return null;
+    const childPath = [...path, defId];
+    const boundaryToInstPin = invertPinBoundary(instance);
+    const nodes = [];
+    const edges = [];
+    const inputs = {};
+    const outputs = {};
+    // Resolve each definition member: a primitive gets a fresh-id clone; a nested instance is flattened
+    // recursively and remembered so edges touching its pins redirect to its internal pins.
+    const primitive = new Map();
+    const nested = new Map();
+    for (const m of def.nodes) {
+        if (isTemplateBoundary(m))
+            continue;
+        if (isTemplateInstance(m)) {
+            const child = flatten(m, resolveDef, mint, childPath);
+            if (!child)
+                return null;
+            nodes.push(...child.nodes);
+            edges.push(...child.edges);
+            nested.set(String(m.id), child);
+            continue;
+        }
+        const id = mint.node();
+        const pinRemap = new Map();
+        const pins = m.pins.map((p) => { const np = mint.pin(); pinRemap.set(String(p.id), np); return { ...p, id: np }; });
+        primitive.set(String(m.id), { id, pinRemap });
+        nodes.push({
+            ...m, id, position: { ...m.position }, state: { ...m.state }, pins,
+            ...(m.size ? { size: { ...m.size } } : {}),
+            ...(m.widgets ? { widgets: m.widgets.map((w) => ({ ...w })) } : {}),
+            ...(m.meta ? { meta: { ...m.meta } } : {}),
+        });
+    }
+    // Resolve an OUT endpoint (the producing pin) to its concrete internal pin(s) — normally one.
+    const resolveOut = (node, pin) => {
+        const prim = primitive.get(String(node));
+        if (prim)
+            return [{ node: prim.id, pin: prim.pinRemap.get(String(pin)) }];
+        const child = nested.get(String(node));
+        if (child) {
+            const o = child.boundary.outputs[String(pin)];
+            return o ? [o] : [];
+        }
+        return [];
+    };
+    // Resolve an IN endpoint (the consuming pin) to its concrete internal pin(s) — a nested input may
+    // fan out to several internal pins.
+    const resolveIn = (node, pin) => {
+        const prim = primitive.get(String(node));
+        if (prim)
+            return [{ node: prim.id, pin: prim.pinRemap.get(String(pin)) }];
+        const child = nested.get(String(node));
+        if (child)
+            return child.boundary.inputs[String(pin)] ?? [];
+        return [];
+    };
+    for (const e of def.edges) {
+        const srcInput = isType(def, e.from.node, TEMPLATE_INPUT_TYPE);
+        const dstOutput = isType(def, e.to.node, TEMPLATE_OUTPUT_TYPE);
+        if (srcInput && dstOutput)
+            continue; // degenerate passthrough (input wired straight to output)
+        if (srcInput) {
+            const instPin = boundaryToInstPin.get(String(e.from.node));
+            if (instPin === undefined)
+                continue;
+            (inputs[instPin] ??= []).push(...resolveIn(e.to.node, e.to.pin));
+        }
+        else if (dstOutput) {
+            const instPin = boundaryToInstPin.get(String(e.to.node));
+            if (instPin === undefined)
+                continue;
+            const producer = resolveOut(e.from.node, e.from.pin)[0];
+            if (producer)
+                outputs[instPin] = producer;
+        }
+        else {
+            const srcs = resolveOut(e.from.node, e.from.pin);
+            const dsts = resolveIn(e.to.node, e.to.pin);
+            for (const s of srcs)
+                for (const d of dsts)
+                    edges.push({ id: mint.edge(), from: s, to: d });
+        }
+    }
+    return { nodes, edges, boundary: { inputs, outputs } };
+}
+/** Snapshot-level helper: replace every `$templateInstance` in (`nodes`, `edges`) with its flattened
+ *  primitive sub-graph and rewire the external edges that touched the instance's interface pins to
+ *  the boundary-mapped internal pins. Mirrors `flattenMacroProxies` for templates. Pure — inputs are
+ *  not mutated. An instance whose definition is missing or recursive is left in place. */
+export function flattenAllTemplateInstances(nodes, edges, resolveDef, mint) {
+    const instanceFlat = new Map();
+    const outNodes = [];
+    for (const n of nodes) {
+        if (!isTemplateInstance(n)) {
+            outNodes.push(n);
+            continue;
+        }
+        const flat = flattenTemplateInstance(n, resolveDef, mint);
+        if (!flat) {
+            outNodes.push(n);
+            continue;
+        } // unresolved / recursive — leave as data so the host sees it
+        instanceFlat.set(String(n.id), flat);
+        outNodes.push(...flat.nodes);
+    }
+    const outEdges = [];
+    for (const e of edges) {
+        const srcFlat = instanceFlat.get(String(e.from.node));
+        const dstFlat = instanceFlat.get(String(e.to.node));
+        if (!srcFlat && !dstFlat) {
+            outEdges.push(e);
+            continue;
+        }
+        const sources = srcFlat
+            ? (srcFlat.boundary.outputs[String(e.from.pin)] ? [srcFlat.boundary.outputs[String(e.from.pin)]] : [])
+            : [{ node: e.from.node, pin: e.from.pin }];
+        const targets = dstFlat
+            ? (dstFlat.boundary.inputs[String(e.to.pin)] ?? [])
+            : [{ node: e.to.node, pin: e.to.pin }];
+        for (const s of sources)
+            for (const t of targets)
+                outEdges.push({ id: mint.edge(), from: s, to: t });
+    }
+    // Internal definition edges already live in flat.edges (carried via outNodes' spread above isn't right —
+    // edges live separately). Concat them explicitly.
+    for (const flat of instanceFlat.values())
+        outEdges.push(...flat.edges);
+    return { nodes: outNodes, edges: outEdges };
+}
+function invertPinBoundary(instance) {
+    const pinBoundary = (instance.state['pinBoundary'] ?? {});
+    const out = new Map();
+    for (const [pinId, boundaryId] of Object.entries(pinBoundary))
+        out.set(boundaryId, pinId);
+    return out;
+}
+function isType(def, nodeId, type) {
+    const n = def.nodes.find((x) => String(x.id) === String(nodeId));
+    return n?.type === type;
+}
+//# sourceMappingURL=template-flatten.js.map

package/dist/template-flatten.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"template-flatten.js","sourceRoot":"","sources":["../src/template-flatten.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,kBAAkB,EAClB,kBAAkB,GAGnB,MAAM,mBAAmB,CAAA;AAuB1B;;wFAEwF;AACxF,MAAM,UAAU,uBAAuB,CACrC,QAAc,EACd,UAAoE,EACpE,IAAiB;IAEjB,OAAO,OAAO,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;AAChD,CAAC;AAED,SAAS,OAAO,CACd,QAAc,EACd,UAAoE,EACpE,IAAiB,EACjB,IAAqB;IAErB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,cAAc,CAA8B,CAAA;IACzE,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA,CAAC,6DAA6D;IACnG,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;IAC7B,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAA;IACrB,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,CAAA;IAElC,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAA;IAErD,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,MAAM,MAAM,GAA6B,EAAE,CAAA;IAC3C,MAAM,OAAO,GAA2B,EAAE,CAAA;IAE1C,oGAAoG;IACpG,uFAAuF;IACvF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwD,CAAA;IACjF,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAA;IACnD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,kBAAkB,CAAC,CAAC,CAAC;YAAE,SAAQ;QACnC,IAAI,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,CAAC,CAAA;YACrD,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAA;YACvB,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;YAC1B,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;YAC/B,SAAQ;QACV,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAA;QACzC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAA,CAAC,CAAC,CAAC,CAAA;QAClH,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;QAC7C,KAAK,CAAC,IAAI,CAAC;YACT,GAAG,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI;YAClE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC3C,CAAC,CAAA;IACJ,CAAC;IAED,8FAA8F;IAC9F,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,GAAU,EAAY,EAAE;QACxD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;QACxC,IAAI,IAAI;YAAE,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC,CAAA;QAC1E,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;QACtC,IAAI,KAAK,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAAC,CAAC;QACjF,OAAO,EAAE,CAAA;IACX,CAAC,CAAA;IACD,kGAAkG;IAClG,oCAAoC;IACpC,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,GAAU,EAAY,EAAE;QACvD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;QACxC,IAAI,IAAI;YAAE,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC,CAAA;QAC1E,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;QACtC,IAAI,KAAK;YAAE,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;QAC1D,OAAO,EAAE,CAAA;IACX,CAAC,CAAA;IAED,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAA;QAC9D,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAA;QAC9D,IAAI,QAAQ,IAAI,SAAS;YAAE,SAAQ,CAAC,0DAA0D;QAC9F,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;YAC1D,IAAI,OAAO,KAAK,SAAS;gBAAE,SAC1B;YAAA,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACnE,CAAC;aAAM,IAAI,SAAS,EAAE,CAAC;YACrB,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;YACxD,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAQ;YACnC,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACvD,IAAI,QAAQ;gBAAE,OAAO,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAA;QAC3C,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAChD,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;YAC3C,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,KAAK,MAAM,CAAC,IAAI,IAAI;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;QAC7F,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,CAAA;AACxD,CAAC;AAED;;;0FAG0F;AAC1F,MAAM,UAAU,2BAA2B,CACzC,KAAa,EACb,KAAa,EACb,UAAoE,EACpE,IAAiB;IAEjB,MAAM,YAAY,GAAG,IAAI,GAAG,EAA6B,CAAA;IACzD,MAAM,QAAQ,GAAW,EAAE,CAAA;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,SAAQ;QAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,uBAAuB,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,CAAA;QACzD,IAAI,CAAC,IAAI,EAAE,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,SAAQ;QAAC,CAAC,CAAC,6DAA6D;QACvG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;QACpC,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;IAC9B,CAAC;IACD,MAAM,QAAQ,GAAW,EAAE,CAAA;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QACrD,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;QACnD,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,SAAQ;QAAC,CAAC;QACxD,MAAM,OAAO,GAAG,OAAO;YACrB,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACvG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;QAC5C,MAAM,OAAO,GAAG,OAAO;YACrB,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACnD,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;QACxC,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,KAAK,MAAM,CAAC,IAAI,OAAO;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IACtG,CAAC;IACD,yGAAyG;IACzG,kDAAkD;IAClD,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAA;IACtE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAA;AAC7C,CAAC;AAED,SAAS,iBAAiB,CAAC,QAAc;IACvC,MAAM,WAAW,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAA2B,CAAA;IACnF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAA;IACrC,KAAK,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC;QAAE,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;IACzF,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,MAAM,CAAC,GAAuB,EAAE,MAAc,EAAE,IAAY;IACnE,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,CAAA;IAChE,OAAO,CAAC,EAAE,IAAI,KAAK,IAAI,CAAA;AACzB,CAAC"}

package/dist/traversal.d.ts

@@ -0,0 +1,27 @@
+import type { Graph, Node, Edge } from './graph.js';
+import type { NodeId } from './ids.js';
+/** Nodes with an edge INTO `id` (its upstream dependencies). De-duplicated. */
+export declare function incomers(graph: Graph, id: NodeId): Node[];
+/** Nodes with an edge OUT of `id` (its downstream consumers). De-duplicated. */
+export declare function outgoers(graph: Graph, id: NodeId): Node[];
+/** Edges touching `id`. `direction` filters to incoming (`in`) or outgoing (`out`); omit for both. */
+export declare function connectedEdges(graph: Graph, id: NodeId, direction?: 'in' | 'out'): Edge[];
+/** Nodes with no incoming edges (sources). */
+export declare function roots(graph: Graph): Node[];
+/** Nodes with no outgoing edges (sinks). */
+export declare function leaves(graph: Graph): Node[];
+/** The set of node ids reachable from `start` by following outgoing edges (the active downstream
+ *  chain), including `start` itself. Cycle-safe. A host runtime uses this to decide which nodes are
+ *  actually "live": when an edge is cut or a node deleted, everything past the break drops out of
+ *  the set, so downstream nodes can stop playing / stop showing as running. */
+export declare function reachableFrom(graph: Graph, start: NodeId): Set<NodeId>;
+/** Kahn topological sort. `order` lists node ids so every edge goes earlier→later; `cyclic` holds
+ *  the ids that couldn't be ordered because they sit in (or downstream of) a cycle. */
+export declare function topoOrder(graph: Graph): {
+    order: NodeId[];
+    cyclic: NodeId[];
+};
+/** Would adding an edge `from → to` introduce a cycle? True if `from === to`, or a path already
+ *  leads from `to` back to `from`. Handy for an `isValidConnection` rule that forbids cycles. */
+export declare function wouldCreateCycle(graph: Graph, from: NodeId, to: NodeId): boolean;
+//# sourceMappingURL=traversal.d.ts.map

package/dist/traversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.d.ts","sourceRoot":"","sources":["../src/traversal.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACnD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAA;AAEtC,+EAA+E;AAC/E,wBAAgB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,EAAE,CAEzD;AAED,gFAAgF;AAChF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,EAAE,CAEzD;AAgBD,sGAAsG;AACtG,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,IAAI,EAAE,CASzF;AAED,8CAA8C;AAC9C,wBAAgB,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,EAAE,CAE1C;AAED,4CAA4C;AAC5C,wBAAgB,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,EAAE,CAE3C;AAED;;;+EAG+E;AAC/E,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAWtE;AAED;uFACuF;AACvF,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE,CAuB7E;AAED;iGACiG;AACjG,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAYhF"}

package/dist/traversal.js

@@ -0,0 +1,119 @@
+/** Nodes with an edge INTO `id` (its upstream dependencies). De-duplicated. */
+export function incomers(graph, id) {
+    return neighbours(graph, id, 'in');
+}
+/** Nodes with an edge OUT of `id` (its downstream consumers). De-duplicated. */
+export function outgoers(graph, id) {
+    return neighbours(graph, id, 'out');
+}
+function neighbours(graph, id, dir) {
+    const seen = new Set();
+    const out = [];
+    for (const e of graph.edges()) {
+        const hit = dir === 'in' ? e.to.node === id : e.from.node === id;
+        if (!hit)
+            continue;
+        const otherId = dir === 'in' ? e.from.node : e.to.node;
+        if (seen.has(otherId))
+            continue;
+        const n = graph.getNode(otherId);
+        if (n) {
+            seen.add(otherId);
+            out.push(n);
+        }
+    }
+    return out;
+}
+/** Edges touching `id`. `direction` filters to incoming (`in`) or outgoing (`out`); omit for both. */
+export function connectedEdges(graph, id, direction) {
+    const out = [];
+    for (const e of graph.edges()) {
+        const isIn = e.to.node === id, isOut = e.from.node === id;
+        if ((direction === 'in' && isIn) || (direction === 'out' && isOut) || (!direction && (isIn || isOut))) {
+            out.push(e);
+        }
+    }
+    return out;
+}
+/** Nodes with no incoming edges (sources). */
+export function roots(graph) {
+    return [...graph.nodes()].filter((n) => connectedEdges(graph, n.id, 'in').length === 0);
+}
+/** Nodes with no outgoing edges (sinks). */
+export function leaves(graph) {
+    return [...graph.nodes()].filter((n) => connectedEdges(graph, n.id, 'out').length === 0);
+}
+/** The set of node ids reachable from `start` by following outgoing edges (the active downstream
+ *  chain), including `start` itself. Cycle-safe. A host runtime uses this to decide which nodes are
+ *  actually "live": when an edge is cut or a node deleted, everything past the break drops out of
+ *  the set, so downstream nodes can stop playing / stop showing as running. */
+export function reachableFrom(graph, start) {
+    const seen = new Set();
+    if (!graph.hasNode(start))
+        return seen;
+    const stack = [start];
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        for (const n of outgoers(graph, id))
+            if (!seen.has(n.id))
+                stack.push(n.id);
+    }
+    return seen;
+}
+/** Kahn topological sort. `order` lists node ids so every edge goes earlier→later; `cyclic` holds
+ *  the ids that couldn't be ordered because they sit in (or downstream of) a cycle. */
+export function topoOrder(graph) {
+    const indegree = new Map();
+    const outAdj = new Map();
+    for (const n of graph.nodes()) {
+        indegree.set(n.id, 0);
+        outAdj.set(n.id, []);
+    }
+    for (const e of graph.edges()) {
+        if (!indegree.has(e.from.node) || !indegree.has(e.to.node))
+            continue;
+        indegree.set(e.to.node, (indegree.get(e.to.node) ?? 0) + 1);
+        outAdj.get(e.from.node).push(e.to.node);
+    }
+    const queue = [];
+    for (const [id, deg] of indegree)
+        if (deg === 0)
+            queue.push(id);
+    const order = [];
+    while (queue.length) {
+        const id = queue.shift();
+        order.push(id);
+        for (const next of outAdj.get(id)) {
+            const d = (indegree.get(next) ?? 0) - 1;
+            indegree.set(next, d);
+            if (d === 0)
+                queue.push(next);
+        }
+    }
+    const cyclic = [...indegree].filter(([, d]) => d > 0).map(([id]) => id);
+    return { order, cyclic };
+}
+/** Would adding an edge `from → to` introduce a cycle? True if `from === to`, or a path already
+ *  leads from `to` back to `from`. Handy for an `isValidConnection` rule that forbids cycles. */
+export function wouldCreateCycle(graph, from, to) {
+    if (from === to)
+        return true;
+    const stack = [to];
+    const seen = new Set();
+    while (stack.length) {
+        const id = stack.pop();
+        if (id === from)
+            return true;
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        for (const e of graph.edges())
+            if (e.from.node === id)
+                stack.push(e.to.node);
+    }
+    return false;
+}
+//# sourceMappingURL=traversal.js.map

package/dist/traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.js","sourceRoot":"","sources":["../src/traversal.ts"],"names":[],"mappings":"AAMA,+EAA+E;AAC/E,MAAM,UAAU,QAAQ,CAAC,KAAY,EAAE,EAAU;IAC/C,OAAO,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAA;AACpC,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,QAAQ,CAAC,KAAY,EAAE,EAAU;IAC/C,OAAO,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAA;AACrC,CAAC;AAED,SAAS,UAAU,CAAC,KAAY,EAAE,EAAU,EAAE,GAAiB;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAA;QAChE,IAAI,CAAC,GAAG;YAAE,SAAQ;QAClB,MAAM,OAAO,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAA;QACtD,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAQ;QAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QAChC,IAAI,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAAC,GAAG,CAAC,IAAI,CAAC,CAAS,CAAC,CAAA;QAAC,CAAC;IACnD,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,EAAU,EAAE,SAAwB;IAC/E,MAAM,GAAG,GAAW,EAAE,CAAA;IACtB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAA;QACzD,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC;YACtG,GAAG,CAAC,IAAI,CAAC,CAAS,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,KAAK,CAAC,KAAY;IAChC,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAW,CAAA;AACnG,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,MAAM,CAAC,KAAY;IACjC,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAW,CAAA;AACpG,CAAC;AAED;;;+EAG+E;AAC/E,MAAM,UAAU,aAAa,CAAC,KAAY,EAAE,KAAa;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACtC,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAA;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACZ,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IAC5E,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;uFACuF;AACvF,MAAM,UAAU,SAAS,CAAC,KAAY;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IAAC,CAAC;IAC9E,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,SAAQ;QACpE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3D,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ;QAAE,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC/D,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QACzB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACd,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACvC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YACrB,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;IACvE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;AAC1B,CAAC;AAED;iGACiG;AACjG,MAAM,UAAU,gBAAgB,CAAC,KAAY,EAAE,IAAY,EAAE,EAAU;IACrE,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,IAAI,CAAA;IAC5B,MAAM,KAAK,GAAa,CAAC,EAAE,CAAC,CAAA;IAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QACvB,IAAI,EAAE,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACZ,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE;YAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;IAC9E,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC"}

package/dist/types-registry.d.ts

@@ -0,0 +1,41 @@
+/** A custom pin data-type the host declares: its colour, optional shape, and extra compatibility.
+ *  Consumed by both connection validation (`canConnect`) and the renderer (pin fill/stroke). */
+export interface TypeDescriptor {
+    id: string;
+    color: string;
+    shape?: 'circle' | 'diamond' | 'arrow';
+    /** Types this one may also connect to, beyond an exact id match. Honoured symmetrically. */
+    compatibleWith?: string[];
+}
+/** A directional conversion `from → to`. Applied to values flowing across an edge when the OUT
+ *  pin's type differs from the IN pin's type. Pure — the same input should always yield the same
+ *  output. Throwing is allowed (signals an invalid value at runtime) — the editor doesn't catch. */
+export type ConversionFn = (value: unknown) => unknown;
+/** Registry of {@link TypeDescriptor}s. Pure, zero-dep — the editor owns one instance and hands it
+ *  to `canConnect` and the renderer so custom typed pins get correct colours and connection rules. */
+export declare class TypeRegistry {
+    #private;
+    get size(): number;
+    register(desc: TypeDescriptor): void;
+    unregister(id: string): boolean;
+    clear(): void;
+    has(id: string): boolean;
+    get(id: string): TypeDescriptor | undefined;
+    all(): TypeDescriptor[];
+    /** Register a value-coercion function applied when an OUT pin of type `from` connects to an IN
+     *  pin of type `to`. Directional — call again with swapped args for the reverse direction.
+     *  Replaces any prior fn for the same pair. */
+    registerConversion(from: string, to: string, fn: ConversionFn): void;
+    unregisterConversion(from: string, to: string): boolean;
+    hasConversion(from: string, to: string): boolean;
+    getConversion(from: string, to: string): ConversionFn | undefined;
+    /** Apply the conversion `from → to` to `value`. Identity when `from === to`. Throws when no
+     *  conversion is registered (use `hasConversion` first if you need to choose at runtime). */
+    convert(value: unknown, from: string, to: string): unknown;
+    /** Are two pin types connectable by type? True on exact match, or if either descriptor lists the
+     *  other in `compatibleWith` (symmetric), or if EITHER direction has a registered conversion.
+     *  Returning true for either-direction conversion keeps `canConnect` orientation-agnostic — the
+     *  actual cast is applied per-direction at value-flow time using `convert(from, to)`. */
+    compatible(a: string, b: string): boolean;
+}
+//# sourceMappingURL=types-registry.d.ts.map

package/dist/types-registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types-registry.d.ts","sourceRoot":"","sources":["../src/types-registry.ts"],"names":[],"mappings":"AAAA;gGACgG;AAChG,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO,CAAA;IACtC,4FAA4F;IAC5F,cAAc,CAAC,EAAE,MAAM,EAAE,CAAA;CAC1B;AAED;;oGAEoG;AACpG,MAAM,MAAM,YAAY,GAAG,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAA;AAEtD;sGACsG;AACtG,qBAAa,YAAY;;IAOvB,IAAI,IAAI,IAAI,MAAM,CAAkC;IAEpD,QAAQ,CAAC,IAAI,EAAE,cAAc,GAAG,IAAI;IACpC,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAC/B,KAAK,IAAI,IAAI;IAMb,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IACxB,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAC3C,GAAG,IAAI,cAAc,EAAE;IAIvB;;mDAE+C;IAC/C,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,GAAG,IAAI;IAGpE,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAGvD,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAGhD,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAGjE;iGAC6F;IAC7F,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAO1D;;;6FAGyF;IACzF,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;CAM1C"}

package/dist/types-registry.js

@@ -0,0 +1,60 @@
+/** Registry of {@link TypeDescriptor}s. Pure, zero-dep — the editor owns one instance and hands it
+ *  to `canConnect` and the renderer so custom typed pins get correct colours and connection rules. */
+export class TypeRegistry {
+    #descriptors = new Map();
+    // Conversions are keyed `${from}→${to}` to make lookup O(1) and direction explicit. Symmetry
+    // (`from→to` does NOT imply `to→from`) matters: a `number→text` cast is well-defined; the
+    // reverse needs its own parse with its own failure mode.
+    #conversions = new Map();
+    get size() { return this.#descriptors.size; }
+    register(desc) { this.#descriptors.set(desc.id, desc); }
+    unregister(id) { return this.#descriptors.delete(id); }
+    clear() {
+        this.#descriptors.clear();
+        // Conversions are tied to the type pairs they bridge — clearing types clears conversions too,
+        // otherwise stale entries would silently lift `compatible()` for types that no longer exist.
+        this.#conversions.clear();
+    }
+    has(id) { return this.#descriptors.has(id); }
+    get(id) { return this.#descriptors.get(id); }
+    all() { return [...this.#descriptors.values()]; }
+    // ---- conversions (G2 — type-driven value coercion across an edge) ----------------------------
+    /** Register a value-coercion function applied when an OUT pin of type `from` connects to an IN
+     *  pin of type `to`. Directional — call again with swapped args for the reverse direction.
+     *  Replaces any prior fn for the same pair. */
+    registerConversion(from, to, fn) {
+        this.#conversions.set(`${from}
${to}`, fn);
+    }
+    unregisterConversion(from, to) {
+        return this.#conversions.delete(`${from}
${to}`);
+    }
+    hasConversion(from, to) {
+        return this.#conversions.has(`${from}
${to}`);
+    }
+    getConversion(from, to) {
+        return this.#conversions.get(`${from}
${to}`);
+    }
+    /** Apply the conversion `from → to` to `value`. Identity when `from === to`. Throws when no
+     *  conversion is registered (use `hasConversion` first if you need to choose at runtime). */
+    convert(value, from, to) {
+        if (from === to)
+            return value;
+        const fn = this.#conversions.get(`${from}
${to}`);
+        if (!fn)
+            throw new Error(`TypeRegistry: no conversion registered for ${from} → ${to}`);
+        return fn(value);
+    }
+    /** Are two pin types connectable by type? True on exact match, or if either descriptor lists the
+     *  other in `compatibleWith` (symmetric), or if EITHER direction has a registered conversion.
+     *  Returning true for either-direction conversion keeps `canConnect` orientation-agnostic — the
+     *  actual cast is applied per-direction at value-flow time using `convert(from, to)`. */
+    compatible(a, b) {
+        if (a === b)
+            return true;
+        if ((this.#descriptors.get(a)?.compatibleWith?.includes(b) ?? false) ||
+            (this.#descriptors.get(b)?.compatibleWith?.includes(a) ?? false))
+            return true;
+        return this.hasConversion(a, b) || this.hasConversion(b, a);
+    }
+}
+//# sourceMappingURL=types-registry.js.map

package/dist/types-registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types-registry.js","sourceRoot":"","sources":["../src/types-registry.ts"],"names":[],"mappings":"AAeA;sGACsG;AACtG,MAAM,OAAO,YAAY;IACd,YAAY,GAAG,IAAI,GAAG,EAA0B,CAAA;IACzD,6FAA6F;IAC7F,0FAA0F;IAC1F,yDAAyD;IAChD,YAAY,GAAG,IAAI,GAAG,EAAwB,CAAA;IAEvD,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAA,CAAC,CAAC;IAEpD,QAAQ,CAAC,IAAoB,IAAU,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA,CAAC,CAAC;IAC7E,UAAU,CAAC,EAAU,IAAa,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA,CAAC,CAAC;IACvE,KAAK;QACH,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAA;QACzB,8FAA8F;QAC9F,6FAA6F;QAC7F,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAA;IAC3B,CAAC;IACD,GAAG,CAAC,EAAU,IAAa,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA,CAAC,CAAC;IAC7D,GAAG,CAAC,EAAU,IAAgC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA,CAAC,CAAC;IAChF,GAAG,KAAuB,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA,CAAC,CAAC;IAElE,iGAAiG;IAEjG;;mDAE+C;IAC/C,kBAAkB,CAAC,IAAY,EAAE,EAAU,EAAE,EAAgB;QAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC5C,CAAC;IACD,oBAAoB,CAAC,IAAY,EAAE,EAAU;QAC3C,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAA;IAClD,CAAC;IACD,aAAa,CAAC,IAAY,EAAE,EAAU;QACpC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAA;IAC/C,CAAC;IACD,aAAa,CAAC,IAAY,EAAE,EAAU;QACpC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAA;IAC/C,CAAC;IACD;iGAC6F;IAC7F,OAAO,CAAC,KAAc,EAAE,IAAY,EAAE,EAAU;QAC9C,IAAI,IAAI,KAAK,EAAE;YAAE,OAAO,KAAK,CAAA;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAA;QACjD,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,8CAA8C,IAAI,MAAM,EAAE,EAAE,CAAC,CAAA;QACtF,OAAO,EAAE,CAAC,KAAK,CAAC,CAAA;IAClB,CAAC;IAED;;;6FAGyF;IACzF,UAAU,CAAC,CAAS,EAAE,CAAS;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QACxB,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;YAChE,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QACjF,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC7D,CAAC;CACF"}

package/dist/widget.d.ts

@@ -0,0 +1,141 @@
+import type { Node } from './graph.js';
+/** Declarative in-node UI control. Widgets are pure DATA — rendering and interaction live in the
+ *  render/editor layers. A widget's value is stored in `node.state[key]` (single source of truth),
+ *  so it serialises with the node and mutates through the command bus (undoable). `button` carries
+ *  an action name instead of a value; `custom` defers to a host-registered renderer. */
+export type WidgetType = 'number' | 'slider' | 'combo' | 'text' | 'toggle' | 'button' | 'color' | 'custom';
+export type ComboOption = string | {
+    label: string;
+    value: string | number;
+};
+/** Per-widget visual override. Any field set here wins over the theme's widget tokens for THIS
+ *  widget only — so every widget instance is fully customisable without touching the theme. */
+export interface WidgetStyle {
+    bg?: string;
+    bgHover?: string;
+    bgFocused?: string;
+    track?: string;
+    fill?: string;
+    fillAlpha?: number;
+    text?: string;
+    label?: string;
+    placeholder?: string;
+    border?: string;
+    borderFocused?: string;
+    selection?: string;
+    knob?: string;
+    radius?: number;
+    paddingX?: number;
+    paddingY?: number;
+    borderWidth?: number;
+    toggleWidth?: number;
+    toggleHeight?: number;
+}
+interface WidgetBase {
+    id: string;
+    label: string;
+    /** Key into `node.state` holding the value. Absent for `button`. Also doubles as the implicit
+     *  pin-binding key (see `pinKey`) — most schemas don't need to set `pinKey` manually if the
+     *  widget's `key` matches a data IN-pin's `label` / `id`. */
+    key?: string;
+    disabled?: boolean;
+    hint?: string;
+    /** Per-widget visual override, merged over the theme's widget tokens. */
+    style?: WidgetStyle;
+    /** Override the implicit `key`-based pin match. Matched against a data IN-pin's `label` (schema
+     *  authors can't predict auto-minted pin ids), then by pin `id` (loaded graphs serialize ids).
+     *  Almost never needed — leave unset and use the same `key` on widget and pin. */
+    pinKey?: string;
+    /** Render-time visibility against the bound pin:
+     *  - `'whenDisconnected'` (default for input controls — number/slider/text/combo/toggle/color):
+     *    UE-Blueprint default-value behaviour. Widget visible only while the pin has no edge;
+     *    connecting hides it (the pin's wire becomes the value source).
+     *  - `'always'`: display/preview behaviour. Widget always visible regardless of pin state;
+     *    when the pin has a wire, the widget reads the runtime's LIVE value and renders read-only.
+     *    Default for `custom` widgets — most custom controls are visualisations. */
+    visibility?: 'whenDisconnected' | 'always';
+    /** Opt-in: include this widget in the editor's properties sidebar when one is open for the
+     *  containing node (G4 — Baklava `displayInSidebar` parity). The SAME widget renders both
+     *  inline on the node and in the sidebar — no separate component to author. Default: omit
+     *  (widget appears only inline). */
+    showInSidebar?: boolean;
+    /** Declarative conditional rendering keyed off OTHER widgets' values in the same node (n8n
+     *  `displayOptions.show` parity). `show(state)` is evaluated against `node.state` after every
+     *  `setWidgetValue` — return `false` to hide the widget (renderer skips layout, sidebar skips
+     *  the row). Fails OPEN if the callback throws (a schema bug must not blank the node). */
+    displayOptions?: {
+        show?: (state: Readonly<Record<string, unknown>>) => boolean;
+    };
+    /** Render this widget as a body-band row even if there's no matching pin. Use for node-level
+     *  config fields that aren't connectable from outside (HTTP body, secret tokens, schema editor)
+     *  — they get a full-width row under the pin band. Without this, non-custom orphan widgets are
+     *  silently dropped. Always combines with `displayOptions.show`: hidden widgets disappear
+     *  entirely, no leftover pin row. */
+    freeFloating?: boolean;
+}
+export type WidgetSpec = (WidgetBase & {
+    type: 'number';
+    key: string;
+    min?: number;
+    max?: number;
+    step?: number;
+    precision?: number;
+    unit?: string;
+}) | (WidgetBase & {
+    type: 'slider';
+    key: string;
+    min: number;
+    max: number;
+    step?: number;
+}) | (WidgetBase & {
+    type: 'combo';
+    key: string;
+    values: ComboOption[];
+}) | (WidgetBase & {
+    type: 'text';
+    key: string;
+    multiline?: boolean;
+    placeholder?: string;
+    maxLength?: number;
+}) | (WidgetBase & {
+    type: 'toggle';
+    key: string;
+    onLabel?: string;
+    offLabel?: string;
+}) | (WidgetBase & {
+    type: 'button';
+    action: string;
+}) | (WidgetBase & {
+    type: 'color';
+    key: string;
+}) | (WidgetBase & {
+    type: 'custom';
+    renderer: string;
+    key: string;
+    height?: number;
+});
+export interface ComboOptionResolved {
+    label: string;
+    value: string | number;
+}
+export declare function comboOptions(spec: Extract<WidgetSpec, {
+    type: 'combo';
+}>): ComboOptionResolved[];
+export declare function defaultWidgetValue(spec: WidgetSpec): unknown;
+export declare function clampWidgetValue(spec: WidgetSpec, raw: unknown): unknown;
+/** Current value of a widget on a node: the clamped `node.state[key]`, or its default. */
+export declare function widgetValue(node: Node, spec: WidgetSpec): unknown;
+/** Effective widget visibility policy. ALL widget types default to `'whenDisconnected'` — they're
+ *  input controls that the user sets a value for, and connecting a wire makes the widget's value
+ *  redundant. Display/preview widgets (e.g. an Output node's value readout) opt into `'always'`
+ *  explicitly. `button` widgets aren't pin-bound — they live in the actions row. */
+export declare function widgetVisibility(spec: WidgetSpec): 'whenDisconnected' | 'always';
+/** Resolve `displayOptions.show(state)` against a node — true (visible) unless the callback exists
+ *  and explicitly returns false. Defensive: a throwing callback fails OPEN so a schema bug doesn't
+ *  blank the node entirely. */
+export declare function widgetIsVisible(spec: WidgetSpec, node: Node): boolean;
+/** The lookup key used to bind a widget to its pin: explicit `pinKey`, else the widget's `key`.
+ *  Returns undefined for widgets that don't bind to a pin (`button` — actions, not values). */
+export declare function widgetBindKey(spec: WidgetSpec): string | undefined;
+export {};
+//# sourceMappingURL=widget.d.ts.map

package/dist/widget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"widget.d.ts","sourceRoot":"","sources":["../src/widget.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC;;;wFAGwF;AACxF,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAA;AAE1G,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAAA;AAE5E;+FAC+F;AAC/F,MAAM,WAAW,WAAW;IAC1B,EAAE,CAAC,EAAE,MAAM,CAAA;IACX,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,YAAY,CAAC,EAAE,MAAM,CAAA;CACtB;AAED,UAAU,UAAU;IAClB,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;IACb;;iEAE6D;IAC7D,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,yEAAyE;IACzE,KAAK,CAAC,EAAE,WAAW,CAAA;IACnB;;sFAEkF;IAClF,MAAM,CAAC,EAAE,MAAM,CAAA;IACf;;;;;;oFAMgF;IAChF,UAAU,CAAC,EAAE,kBAAkB,GAAG,QAAQ,CAAA;IAC1C;;;wCAGoC;IACpC,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB;;;8FAG0F;IAC1F,cAAc,CAAC,EAAE;QACf,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,KAAK,OAAO,CAAA;KAC7D,CAAA;IACD;;;;yCAIqC;IACrC,YAAY,CAAC,EAAE,OAAO,CAAA;CACvB;AAED,MAAM,MAAM,UAAU,GAClB,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GAC5H,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GACvF,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,EAAE,CAAA;CAAE,CAAC,GACrE,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAG,GAAG,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GAC7G,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,GACnF,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,GACjD,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAE,GAAG,EAAE,MAAM,CAAA;CAAE,CAAC,GAC9C,CAAC,UAAU,GAAG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAAA;AAErF,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CACvB;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,EAAE;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,CAAC,GAAG,mBAAmB,EAAE,CAIhG;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAW5D;AAoBD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,OAAO,GAAG,OAAO,CAqCxE;AAED,0FAA0F;AAC1F,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAIjE;AAED;;;oFAGoF;AACpF,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,GAAG,kBAAkB,GAAG,QAAQ,CAEhF;AAED;;+BAE+B;AAC/B,wBAAgB,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO,CAQrE;AAED;+FAC+F;AAC/F,wBAAgB,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,GAAG,SAAS,CAGlE"}