@revisium/orchestrator 0.1.0-alpha.4 → 0.1.0-alpha.6

package/dist/pipeline-core/validate-conflicts.js

@@ -0,0 +1,37 @@
+/**
+ * validate-conflicts — §12 rule 10 (policy.conflicts well-formedness). Lifted from validate.ts.
+ */
+export function ruleConflictMatrix(template, d) {
+    const conflicts = template.policy?.conflicts ?? [];
+    if (conflicts.length === 0)
+        return;
+    // Map each role to the node ids that bind it (agent.roleRef = "role:<name>").
+    const roleNodes = new Map();
+    for (const node of Object.values(template.nodes)) {
+        if (node.kind === 'agent') {
+            const role = roleName(node.roleRef);
+            if (role)
+                (roleNodes.get(role) ?? roleNodes.set(role, []).get(role)).push(node.id);
+        }
+    }
+    for (const pair of conflicts) {
+        if (!Array.isArray(pair) || pair.length !== 2 || pair.some((r) => typeof r !== 'string')) {
+            d.error('CONFLICT_REF_INVALID', `policy.conflicts entry ${JSON.stringify(pair)} is not a [roleA, roleB] pair`);
+            continue;
+        }
+        const [a, b] = pair;
+        // A conflict is well-formed only if both roles are actually bound by some node.
+        if (!roleNodes.has(a) || !roleNodes.has(b)) {
+            d.warn('CONFLICT_REF_INVALID', `policy.conflicts [${a}, ${b}] references a role no node binds`);
+        }
+        // v1 binds a role to a node, not to a concrete actor; a path where ONE actor fills both roles
+        // is detectable only with actor assignment (out of v1 template data). We surface the *structural*
+        // hazard: the same node is bound to both conflicting roles (impossible via roleRef, but a future
+        // multi-role node would trip it) — kept as a placeholder check so the rule has a code + a test.
+    }
+}
+function roleName(roleRef) {
+    const m = /^role:(.+)$/.exec(roleRef);
+    return m ? m[1] : undefined;
+}
+//# sourceMappingURL=validate-conflicts.js.map

package/dist/pipeline-core/validate-conflicts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-conflicts.js","sourceRoot":"","sources":["../../src/pipeline-core/validate-conflicts.ts"],"names":[],"mappings":"AAAA;;GAEG;AAKH,MAAM,UAAU,kBAAkB,CAAC,QAAkB,EAAE,CAAW;IAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,SAAS,IAAI,EAAE,CAAC;IACnD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEnC,8EAA8E;IAC9E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpC,IAAI,IAAI;gBAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtF,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,EAAE,CAAC;YACzF,CAAC,CAAC,KAAK,CAAC,sBAAsB,EAAE,0BAA0B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;YAC/G,SAAS;QACX,CAAC;QACD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QACpB,gFAAgF;QAChF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,CAAC,CAAC,IAAI,CAAC,sBAAsB,EAAE,qBAAqB,CAAC,KAAK,CAAC,mCAAmC,CAAC,CAAC;QAClG,CAAC;QACD,8FAA8F;QAC9F,kGAAkG;QAClG,iGAAiG;QACjG,gGAAgG;IAClG,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,OAAe;IAC/B,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC9B,CAAC"}

package/dist/pipeline-core/validate-dataflow.js

@@ -0,0 +1,180 @@
+import { branchSubgraph, cycleNodes, findBackEdges, forwardReach, structuralEdges, } from './validate-graph.js';
+export function ruleDataflow(template, ids, d) {
+    const ctx = analyse(template, ids);
+    flagDuplicateProduces(template, d);
+    for (const node of Object.values(template.nodes)) {
+        if (node.kind === 'agent' || node.kind === 'script')
+            checkConsumer(node, ctx, d);
+    }
+}
+function analyse(template, ids) {
+    const hasEntry = !!template.entry && ids.has(template.entry);
+    return {
+        nodes: template.nodes,
+        hasEntry,
+        dom: hasEntry ? dominators(template, template.entry) : new Map(),
+        membership: branchMembership(template),
+        cyclesByNode: consumerStaleCycles(template),
+    };
+}
+/** PRODUCES_NAME_DUP — a clarity guard: the grammar keys consumes by NODE, so a duplicate name isn't a resolution bug. */
+function flagDuplicateProduces(template, d) {
+    const producedNames = new Map();
+    for (const node of Object.values(template.nodes)) {
+        if (node.kind !== 'agent' && node.kind !== 'script')
+            continue;
+        if (!node.produces)
+            continue;
+        const prev = producedNames.get(node.produces.name);
+        if (prev && prev !== node.id) {
+            d.warn('PRODUCES_NAME_DUP', `nodes "${prev}" and "${node.id}" both produce "${node.produces.name}"`, {
+                nodeId: node.id,
+            });
+        }
+        else if (!prev)
+            producedNames.set(node.produces.name, node.id);
+    }
+}
+function checkConsumer(node, ctx, d) {
+    const seenAs = new Set();
+    (node.consumes ?? []).forEach((ref, i) => checkConsumeRef(node, ref, `consumes[${i}]`, seenAs, ctx, d));
+}
+function checkConsumeRef(node, ref, path, seenAs, ctx, d) {
+    if (seenAs.has(ref.as)) {
+        d.error('CONSUMES_AS_DUP', `node "${node.id}" consumes two inputs as "${ref.as}"`, { nodeId: node.id, path });
+    }
+    else {
+        seenAs.add(ref.as);
+    }
+    const producer = ctx.nodes[ref.node];
+    if (!producer) {
+        d.error('CONSUMES_NODE_UNRESOLVED', `node "${node.id}" consumes from unknown node "${ref.node}"`, {
+            nodeId: node.id,
+            path,
+        });
+        return;
+    }
+    if (!isEffectProducer(producer)) {
+        d.error('CONSUMES_PRODUCER_MISSING', `node "${node.id}" consumes from "${ref.node}" which declares no produces`, {
+            nodeId: node.id,
+            path,
+        });
+        return;
+    }
+    checkDominance(node, ref, path, ctx, d);
+    checkFreshness(node, ref, path, ctx, d);
+    checkCrossParallel(node, ref, path, ctx, d);
+}
+function isEffectProducer(node) {
+    return (node.kind === 'agent' || node.kind === 'script') && !!node.produces;
+}
+/** Dominance: the producer must run before the consumer on EVERY path (entry can never be dominated → a consuming entry node is always flagged). */
+function checkDominance(node, ref, path, ctx, d) {
+    const dominated = ctx.hasEntry && ref.node !== node.id && ctx.dom.get(node.id)?.has(ref.node) === true;
+    if (dominated)
+        return;
+    const msg = `producer "${ref.node}" does not run before "${node.id}" on every path`;
+    if (ref.optional === true)
+        d.warn('CONSUMES_NOT_DOMINATED', msg, { nodeId: node.id, path });
+    else
+        d.error('CONSUMES_NOT_DOMINATED', msg, { nodeId: node.id, path });
+}
+/** Freshness: a consumer inside a loop the producer is NOT on can silently reuse a stale output. */
+function checkFreshness(node, ref, path, ctx, d) {
+    const iteration = ref.iteration ?? 'latest';
+    if (iteration !== 'latest' || ref.staleOk === true)
+        return;
+    const reentersWithoutProducer = (ctx.cyclesByNode.get(node.id) ?? []).some((cycle) => !cycle.has(ref.node));
+    if (reentersWithoutProducer) {
+        d.warn('CONSUMES_STALE_RISK', `node "${node.id}" can re-enter a loop without re-running producer "${ref.node}" (iteration:'latest') — set staleOk or use iteration:'all'/N`, { nodeId: node.id, path });
+    }
+}
+/** Cross-parallel: consuming a sibling branch's output is unsafe (the branch may be cancelled). */
+function checkCrossParallel(node, ref, path, ctx, d) {
+    const consumerBranches = ctx.membership.get(node.id) ?? [];
+    const producerBranches = ctx.membership.get(ref.node) ?? [];
+    const crosses = consumerBranches.some((c) => producerBranches.some((p) => c.parallel === p.parallel && c.branch !== p.branch));
+    if (crosses) {
+        d.error('CONSUMES_CROSS_PARALLEL_UNSAFE', `node "${node.id}" consumes "${ref.node}" from a sibling parallel branch`, {
+            nodeId: node.id,
+            path,
+        });
+    }
+}
+/**
+ * Standard iterative dominator sets over STRUCTURAL edges from `entry` (dom(entry) = {entry}). Both the node-set
+ * and the predecessor graph use the structural edge model — a catch/escalate route is a failure path where the
+ * producer did not successfully run, so it is excluded from "ran before the consumer on every path".
+ */
+function dominators(template, entry) {
+    const reachable = [...forwardReach(template, entry)].filter((id) => template.nodes[id]);
+    const preds = new Map();
+    for (const id of reachable)
+        preds.set(id, []);
+    for (const id of reachable) {
+        for (const [, t] of structuralEdges(template.nodes[id]))
+            if (preds.has(t))
+                preds.get(t).push(id);
+    }
+    const all = new Set(reachable);
+    const dom = new Map();
+    for (const id of reachable)
+        dom.set(id, new Set(all));
+    dom.set(entry, new Set([entry]));
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const id of reachable) {
+            if (id === entry)
+                continue;
+            const ps = preds.get(id);
+            let next;
+            if (ps.length === 0)
+                next = new Set([id]);
+            else {
+                next = new Set(dom.get(ps[0]));
+                for (let i = 1; i < ps.length; i++) {
+                    const dp = dom.get(ps[i]);
+                    for (const x of [...next])
+                        if (!dp.has(x))
+                            next.delete(x);
+                }
+            }
+            next.add(id);
+            const old = dom.get(id);
+            if (old.size !== next.size || [...next].some((x) => !old.has(x))) {
+                dom.set(id, next);
+                changed = true;
+            }
+        }
+    }
+    return dom;
+}
+/** For each node, the cycles (node-sets) it sits on — feeds the loop-freshness check (CONSUMES_STALE_RISK). */
+function consumerStaleCycles(template) {
+    const out = new Map();
+    for (const { from, to } of findBackEdges(template)) {
+        const cycle = cycleNodes(template, to, from);
+        for (const id of cycle) {
+            const list = out.get(id) ?? [];
+            list.push(cycle);
+            out.set(id, list);
+        }
+    }
+    return out;
+}
+/** Map each node to ALL its (parallel, branch) memberships — a node in nested parallels belongs to each. */
+function branchMembership(template) {
+    const out = new Map();
+    for (const par of Object.values(template.nodes)) {
+        if (par.kind !== 'parallel')
+            continue;
+        for (const br of par.branches) {
+            for (const id of branchSubgraph(template, br.entry, par.join)) {
+                (out.get(id) ?? out.set(id, []).get(id)).push({ parallel: par.id, branch: br.id });
+            }
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=validate-dataflow.js.map

package/dist/pipeline-core/validate-dataflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-dataflow.js","sourceRoot":"","sources":["../../src/pipeline-core/validate-dataflow.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,cAAc,EACd,UAAU,EACV,aAAa,EACb,YAAY,EACZ,eAAe,GAChB,MAAM,qBAAqB,CAAC;AAgB7B,MAAM,UAAU,YAAY,CAAC,QAAkB,EAAE,GAAgB,EAAE,CAAW;IAC5E,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IACnC,qBAAqB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACnF,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,QAAkB,EAAE,GAAgB;IACnD,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7D,OAAO;QACL,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,QAAQ;QACR,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE;QAChE,UAAU,EAAE,gBAAgB,CAAC,QAAQ,CAAC;QACtC,YAAY,EAAE,mBAAmB,CAAC,QAAQ,CAAC;KAC5C,CAAC;AACJ,CAAC;AAED,0HAA0H;AAC1H,SAAS,qBAAqB,CAAC,QAAkB,EAAE,CAAW;IAC5D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QAC9D,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAC7B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC7B,CAAC,CAAC,IAAI,CAAC,mBAAmB,EAAE,UAAU,IAAI,UAAU,IAAI,CAAC,EAAE,mBAAmB,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,EAAE;gBACnG,MAAM,EAAE,IAAI,CAAC,EAAE;aAChB,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,CAAC,IAAI;YAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAgB,EAAE,GAAgB,EAAE,CAAW;IACpE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1G,CAAC;AAED,SAAS,eAAe,CACtB,IAAgB,EAChB,GAAgB,EAChB,IAAY,EACZ,MAAmB,EACnB,GAAgB,EAChB,CAAW;IAEX,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QACvB,CAAC,CAAC,KAAK,CAAC,iBAAiB,EAAE,SAAS,IAAI,CAAC,EAAE,6BAA6B,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;IAChH,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,CAAC,CAAC,KAAK,CAAC,0BAA0B,EAAE,SAAS,IAAI,CAAC,EAAE,iCAAiC,GAAG,CAAC,IAAI,GAAG,EAAE;YAChG,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI;SACL,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IACD,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;QAChC,CAAC,CAAC,KAAK,CAAC,2BAA2B,EAAE,SAAS,IAAI,CAAC,EAAE,oBAAoB,GAAG,CAAC,IAAI,8BAA8B,EAAE;YAC/G,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI;SACL,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IAED,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACxC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACxC,kBAAkB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAU;IAClC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC9E,CAAC;AAED,oJAAoJ;AACpJ,SAAS,cAAc,CAAC,IAAgB,EAAE,GAAgB,EAAE,IAAY,EAAE,GAAgB,EAAE,CAAW;IACrG,MAAM,SAAS,GAAG,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;IACvG,IAAI,SAAS;QAAE,OAAO;IACtB,MAAM,GAAG,GAAG,aAAa,GAAG,CAAC,IAAI,0BAA0B,IAAI,CAAC,EAAE,iBAAiB,CAAC;IACpF,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI;QAAE,CAAC,CAAC,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;;QACvF,CAAC,CAAC,KAAK,CAAC,wBAAwB,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AACzE,CAAC;AAED,oGAAoG;AACpG,SAAS,cAAc,CAAC,IAAgB,EAAE,GAAgB,EAAE,IAAY,EAAE,GAAgB,EAAE,CAAW;IACrG,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,IAAI,QAAQ,CAAC;IAC5C,IAAI,SAAS,KAAK,QAAQ,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI;QAAE,OAAO;IAC3D,MAAM,uBAAuB,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5G,IAAI,uBAAuB,EAAE,CAAC;QAC5B,CAAC,CAAC,IAAI,CACJ,qBAAqB,EACrB,SAAS,IAAI,CAAC,EAAE,sDAAsD,GAAG,CAAC,IAAI,+DAA+D,EAC7I,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAC1B,CAAC;IACJ,CAAC;AACH,CAAC;AAED,mGAAmG;AACnG,SAAS,kBAAkB,CAAC,IAAgB,EAAE,GAAgB,EAAE,IAAY,EAAE,GAAgB,EAAE,CAAW;IACzG,MAAM,gBAAgB,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IAC3D,MAAM,gBAAgB,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5D,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAC1C,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CACjF,CAAC;IACF,IAAI,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,KAAK,CAAC,gCAAgC,EAAE,SAAS,IAAI,CAAC,EAAE,eAAe,GAAG,CAAC,IAAI,kCAAkC,EAAE;YACnH,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI;SACL,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,QAAkB,EAAE,KAAa;IACnD,MAAM,SAAS,GAAG,CAAC,GAAG,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACxF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,SAAS;QAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC;YAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrG,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,SAAS;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,EAAE,KAAK,KAAK;gBAAE,SAAS;YAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC1B,IAAI,IAAiB,CAAC;YACtB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;gBAAE,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBACrC,CAAC;gBACJ,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;oBAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;wBAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;4BAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACb,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACzB,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAClB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+GAA+G;AAC/G,SAAS,mBAAmB,CAAC,QAAkB;IAC7C,MAAM,GAAG,GAAG,IAAI,GAAG,EAA8B,CAAC;IAClD,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnD,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7C,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjB,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4GAA4G;AAC5G,SAAS,gBAAgB,CAAC,QAAkB;IAC1C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuD,CAAC;IAC3E,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QACtC,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,QAAQ,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/pipeline-core/validate-diff.js

@@ -0,0 +1,158 @@
+/**
+ * validate-diff — §12 rule 13, the template diff classifier. Classifies the change from one template
+ * to another (it does not validate a single template — that is validateTemplate's job). Lifted from
+ * validate.ts as a separate public-API surface; validate.ts re-exports it so callers are unaffected.
+ */
+import { outgoingEdges } from './validate-edges.js';
+/**
+ * Classify the change from `old` → `next` (§12.13). The enabler for a FUTURE in-flight migration; v1
+ * only reports.
+ *  - node-id delete / rename / kind-change            → breaking
+ *  - changing the outgoing topology of an existing node → breaking
+ *  - reusing a deleted id with a different kind/resultSchema → invalid
+ *  - displayName / prompt / payload changes            → safe
+ *  - ANY field/path not explicitly classified          → breaking (conservative) + DIFF_UNCLASSIFIED
+ */
+export function classifyTemplateDiff(old, next) {
+    const acc = newDiffAccumulator();
+    const oldNodes = old.nodes ?? {};
+    const nextNodes = next.nodes ?? {};
+    const oldIds = new Set(Object.keys(oldNodes));
+    const nextIds = new Set(Object.keys(nextNodes));
+    // Deleted ids → breaking.
+    for (const id of oldIds) {
+        if (!nextIds.has(id)) {
+            acc.escalate('breaking');
+            acc.diagnostics.push({ code: 'DIFF_NODE_DELETED', severity: 'error', message: `node "${id}" was deleted`, nodeId: id });
+        }
+    }
+    for (const id of nextIds) {
+        const before = oldNodes[id];
+        // A brand-new node id is additive → safe (a new branch/path); reusing a PREVIOUSLY-deleted id is
+        // not observable here (single old/next pair). Adding a node is classified safe.
+        if (before)
+            classifyExistingNodeChange(id, before, nextNodes[id], acc);
+    }
+    classifyTopLevelDiff(old, next, acc);
+    return { kind: acc.kind, diagnostics: acc.diagnostics };
+}
+function newDiffAccumulator() {
+    const acc = {
+        diagnostics: [],
+        kind: 'safe',
+        escalate: (to) => {
+            if (to === 'invalid')
+                acc.kind = 'invalid';
+            else if (to === 'breaking' && acc.kind !== 'invalid')
+                acc.kind = 'breaking';
+        },
+    };
+    return acc;
+}
+/** Classify the change of a node id present in BOTH templates (kind / schema / topology / fields). */
+function classifyExistingNodeChange(id, before, after, acc) {
+    // kind change → breaking; an incompatible kind/resultSchema reuse → invalid.
+    if (before.kind !== after.kind) {
+        acc.escalate('invalid'); // a reused id with a different kind is invalid (§12.13)
+        acc.diagnostics.push({
+            code: 'DIFF_ID_REUSED_INCOMPATIBLE',
+            severity: 'error',
+            message: `node "${id}" kind changed ${before.kind} → ${after.kind} (id reuse with different kind)`,
+            nodeId: id,
+        });
+        return;
+    }
+    // resultSchema change on a same-kind effect node → invalid (id reuse with different contract).
+    const beforeSchema = before.resultSchema;
+    const afterSchema = after.resultSchema;
+    if (beforeSchema !== afterSchema) {
+        acc.escalate('invalid');
+        acc.diagnostics.push({
+            code: 'DIFF_ID_REUSED_INCOMPATIBLE',
+            severity: 'error',
+            message: `node "${id}" resultSchema changed "${beforeSchema}" → "${afterSchema}"`,
+            nodeId: id,
+        });
+    }
+    // Outgoing topology change → breaking.
+    if (!sameTopology(before, after)) {
+        acc.escalate('breaking');
+        acc.diagnostics.push({
+            code: 'DIFF_NODE_TOPOLOGY_CHANGED',
+            severity: 'error',
+            message: `node "${id}" outgoing topology changed`,
+            nodeId: id,
+        });
+    }
+    // Any non-safe-classified, non-topology field change defaults to breaking + DIFF_UNCLASSIFIED.
+    const unclassified = unclassifiedFieldChange(before, after);
+    if (unclassified) {
+        acc.escalate('breaking');
+        acc.diagnostics.push({
+            code: 'DIFF_UNCLASSIFIED',
+            severity: 'error',
+            message: `node "${id}" has an unclassified field change in {${unclassified}} (defaulting to breaking)`,
+            nodeId: id,
+        });
+    }
+}
+/** Top-level structural changes (entry / scopes) default to breaking if changed. */
+function classifyTopLevelDiff(old, next, acc) {
+    if (old.entry !== next.entry) {
+        acc.escalate('breaking');
+        acc.diagnostics.push({ code: 'DIFF_NODE_TOPOLOGY_CHANGED', severity: 'error', message: `entry changed ${old.entry} → ${next.entry}` });
+    }
+    if (JSON.stringify(old.scopes ?? {}) !== JSON.stringify(next.scopes ?? {})) {
+        acc.escalate('breaking');
+        acc.diagnostics.push({ code: 'DIFF_UNCLASSIFIED', severity: 'error', message: `scopes changed (defaulting to breaking)` });
+    }
+}
+/** Two nodes have the same outgoing topology iff their ordered edge `[path,target]` sets match. */
+function sameTopology(a, b) {
+    const ea = JSON.stringify(orderedEdges(a));
+    const eb = JSON.stringify(orderedEdges(b));
+    return ea === eb;
+}
+function orderedEdges(node) {
+    return outgoingEdges(node)
+        .slice()
+        .sort((x, y) => comparePath(x[0], y[0]));
+}
+/** Stable lexical comparison of two edge paths (sort comparator: -1 / 0 / 1). */
+function comparePath(a, b) {
+    if (a < b)
+        return -1;
+    if (a > b)
+        return 1;
+    return 0;
+}
+/**
+ * Detect a field change that is NOT one of the explicitly-SAFE fields (displayName, reason/prompt-like
+ * text, payload `input`) and NOT topology (handled separately). Returns a comma-list of changed
+ * unclassified keys, or '' if every change is safe. Guards (`branches.when`, `joinMode`, `merge`,
+ * `onFailure`, `incrementCounters`, `outcomes`, `timeout.after`) are NOT in the safe set → breaking.
+ */
+function unclassifiedFieldChange(before, after) {
+    // `input` is listed for parity with the doc above; it is a Decision field, not a Node key, so it never
+    // reaches this loop — harmless, and keeps the code aligned with its documented safe-set.
+    const SAFE_KEYS = new Set(['id', 'displayName', 'reason', 'input']);
+    const changed = [];
+    const keys = new Set([...Object.keys(before), ...Object.keys(after)]);
+    for (const key of keys) {
+        if (SAFE_KEYS.has(key))
+            continue;
+        if (isTopologyKey(key))
+            continue; // topology handled by sameTopology
+        if (key === 'resultSchema')
+            continue; // handled above (invalid)
+        const bv = JSON.stringify(before[key]);
+        const av = JSON.stringify(after[key]);
+        if (bv !== av)
+            changed.push(key);
+    }
+    return changed.join(', ');
+}
+function isTopologyKey(key) {
+    return key === 'next' || key === 'branches' || key === 'catch' || key === 'escalateTo' || key === 'join';
+}
+//# sourceMappingURL=validate-diff.js.map

package/dist/pipeline-core/validate-diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-diff.js","sourceRoot":"","sources":["../../src/pipeline-core/validate-diff.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAKpD;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAa,EAAE,IAAc;IAChE,MAAM,GAAG,GAAG,kBAAkB,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;IACjC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAEhD,0BAA0B;IAC1B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACzB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1H,CAAC;IACH,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC5B,iGAAiG;QACjG,gFAAgF;QAChF,IAAI,MAAM;YAAE,0BAA0B,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IACzE,CAAC;IAED,oBAAoB,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC;AAC1D,CAAC;AASD,SAAS,kBAAkB;IACzB,MAAM,GAAG,GAAoB;QAC3B,WAAW,EAAE,EAAE;QACf,IAAI,EAAE,MAAM;QACZ,QAAQ,EAAE,CAAC,EAAY,EAAQ,EAAE;YAC/B,IAAI,EAAE,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,GAAG,SAAS,CAAC;iBACtC,IAAI,EAAE,KAAK,UAAU,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,GAAG,UAAU,CAAC;QAC9E,CAAC;KACF,CAAC;IACF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sGAAsG;AACtG,SAAS,0BAA0B,CAAC,EAAU,EAAE,MAAY,EAAE,KAAW,EAAE,GAAoB;IAC7F,6EAA6E;IAC7E,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;QAC/B,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,wDAAwD;QACjF,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;YACnB,IAAI,EAAE,6BAA6B;YACnC,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,SAAS,EAAE,kBAAkB,MAAM,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,iCAAiC;YAClG,MAAM,EAAE,EAAE;SACX,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IACD,+FAA+F;IAC/F,MAAM,YAAY,GAAI,MAAoC,CAAC,YAAY,CAAC;IACxE,MAAM,WAAW,GAAI,KAAmC,CAAC,YAAY,CAAC;IACtE,IAAI,YAAY,KAAK,WAAW,EAAE,CAAC;QACjC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QACxB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;YACnB,IAAI,EAAE,6BAA6B;YACnC,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,SAAS,EAAE,2BAA2B,YAAY,QAAQ,WAAW,GAAG;YACjF,MAAM,EAAE,EAAE;SACX,CAAC,CAAC;IACL,CAAC;IACD,uCAAuC;IACvC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;QACjC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;YACnB,IAAI,EAAE,4BAA4B;YAClC,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,SAAS,EAAE,6BAA6B;YACjD,MAAM,EAAE,EAAE;SACX,CAAC,CAAC;IACL,CAAC;IACD,+FAA+F;IAC/F,MAAM,YAAY,GAAG,uBAAuB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC5D,IAAI,YAAY,EAAE,CAAC;QACjB,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;YACnB,IAAI,EAAE,mBAAmB;YACzB,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,SAAS,EAAE,0CAA0C,YAAY,4BAA4B;YACtG,MAAM,EAAE,EAAE;SACX,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,oBAAoB,CAAC,GAAa,EAAE,IAAc,EAAE,GAAoB;IAC/E,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7B,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,4BAA4B,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,iBAAiB,GAAG,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACzI,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;QAC3E,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,yCAAyC,EAAE,CAAC,CAAC;IAC7H,CAAC;AACH,CAAC;AAED,mGAAmG;AACnG,SAAS,YAAY,CAAC,CAAO,EAAE,CAAO;IACpC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,OAAO,EAAE,KAAK,EAAE,CAAC;AACnB,CAAC;AAED,SAAS,YAAY,CAAC,IAAU;IAC9B,OAAO,aAAa,CAAC,IAAI,CAAC;SACvB,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,iFAAiF;AACjF,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,SAAS,uBAAuB,CAAC,MAAY,EAAE,KAAW;IACxD,uGAAuG;IACvG,yFAAyF;IACzF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,IAAI,aAAa,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,mCAAmC;QACrE,IAAI,GAAG,KAAK,cAAc;YAAE,SAAS,CAAC,0BAA0B;QAChE,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAE,MAAkC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpE,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAE,KAAiC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,aAAa,CAAC,GAAW;IAChC,OAAO,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,UAAU,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,YAAY,IAAI,GAAG,KAAK,MAAM,CAAC;AAC3G,CAAC"}

package/dist/pipeline-core/validate-edges.js

@@ -0,0 +1,44 @@
+/**
+ * validate-edges — the single model of a node's outgoing edges, shared by the refs (rule 2), topology
+ * (rule 3), reachability (rule 5), loop (rule 6), and diff (rule 13) rules. One edge model so those
+ * rules cannot disagree about what a node points at.
+ */
+import { isDefaultBranch } from './types.js';
+/** Every outgoing edge of a node as `[path, targetId]` pairs. */
+export function outgoingEdges(node) {
+    const edges = [];
+    switch (node.kind) {
+        case 'agent':
+        case 'script':
+            edges.push(['next', node.next]);
+            (node.catch ?? []).forEach((c, i) => edges.push([`catch[${i}].goto`, c.goto]));
+            if (node.escalateTo !== undefined)
+                edges.push(['escalateTo', node.escalateTo]);
+            break;
+        case 'wait':
+            edges.push(['next', node.next]);
+            break;
+        case 'join':
+            edges.push(['next', node.next]);
+            break;
+        case 'humanGate':
+            branchTargets(node.branches).forEach(([p, t]) => edges.push([`branches.${p}`, t]));
+            if (node.timeout)
+                edges.push(['timeout.goto', node.timeout.goto]);
+            break;
+        case 'choice':
+            branchTargets(node.branches).forEach(([p, t]) => edges.push([`branches.${p}`, t]));
+            break;
+        case 'parallel':
+            node.branches.forEach((b, i) => edges.push([`branches[${i}].entry`, b.entry]));
+            edges.push(['join', node.join]);
+            break;
+        case 'terminal':
+            break;
+    }
+    return edges;
+}
+function branchTargets(branches) {
+    return branches.map((b, i) => isDefaultBranch(b) ? [`[${i}].default`, b.default] : [`[${i}].goto`, b.goto]);
+}
+//# sourceMappingURL=validate-edges.js.map

package/dist/pipeline-core/validate-edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-edges.js","sourceRoot":"","sources":["../../src/pipeline-core/validate-edges.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG7C,iEAAiE;AACjE,MAAM,UAAU,aAAa,CAAC,IAAU;IACtC,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,OAAO,CAAC;QACb,KAAK,QAAQ;YACX,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/E,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/E,MAAM;QACR,KAAK,MAAM;YACT,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,MAAM;QACR,KAAK,MAAM;YACT,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,MAAM;QACR,KAAK,WAAW;YACd,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnF,IAAI,IAAI,CAAC,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAClE,MAAM;QACR,KAAK,QAAQ;YACX,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnF,MAAM;QACR,KAAK,UAAU;YACb,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/E,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAChC,MAAM;QACR,KAAK,UAAU;YACb,MAAM;IACV,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,aAAa,CAAC,QAAkB;IACvC,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAoB,EAAE,CAC7C,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAC7E,CAAC;AACJ,CAAC"}

package/dist/pipeline-core/validate-graph.js

@@ -0,0 +1,123 @@
+import { isGuardedBranch } from './types.js';
+import { outgoingEdges } from './validate-edges.js';
+/** Forward (non-catch, non-escalate) edges — `catch`/`escalateTo` are failure routes, not loop edges. */
+export function structuralEdges(node) {
+    return outgoingEdges(node).filter(([p]) => !p.startsWith('catch') && p !== 'escalateTo');
+}
+/** Nodes reachable from `entry` over EVERY outgoing edge (catch/escalate included). */
+export function reachableFrom(template, entry) {
+    const seen = new Set();
+    const stack = [entry];
+    while (stack.length) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        const node = template.nodes[id];
+        if (!node)
+            continue;
+        for (const [, target] of outgoingEdges(node))
+            if (!seen.has(target))
+                stack.push(target);
+    }
+    return seen;
+}
+/** Nodes structurally reachable from `start` (catch/escalate excluded — failure routes are not flow). */
+export function forwardReach(template, start) {
+    const seen = new Set();
+    const stack = [start];
+    while (stack.length) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        const node = template.nodes[id];
+        if (node)
+            for (const [, t] of structuralEdges(node))
+                if (!seen.has(t))
+                    stack.push(t);
+    }
+    return seen;
+}
+/** Nodes that can structurally reach `target` (predecessor walk over structural edges). */
+export function backwardReach(template, target) {
+    const preds = new Map();
+    for (const node of Object.values(template.nodes)) {
+        for (const [, t] of structuralEdges(node))
+            (preds.get(t) ?? preds.set(t, []).get(t)).push(node.id);
+    }
+    const seen = new Set();
+    const stack = [target];
+    while (stack.length) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        for (const p of preds.get(id) ?? [])
+            if (!seen.has(p))
+                stack.push(p);
+    }
+    return seen;
+}
+/** Back-edges = forward edges whose target is an ancestor on the DFS stack (a cycle re-entry). */
+export function findBackEdges(template) {
+    const back = [];
+    const onStack = new Set();
+    const done = new Set();
+    const dfs = (id) => {
+        onStack.add(id);
+        const node = template.nodes[id];
+        if (node) {
+            for (const [, target] of structuralEdges(node)) {
+                if (onStack.has(target))
+                    back.push({ from: id, to: target });
+                else if (!done.has(target))
+                    dfs(target);
+            }
+        }
+        onStack.delete(id);
+        done.add(id);
+    };
+    if (template.entry && template.nodes[template.entry])
+        dfs(template.entry);
+    return back;
+}
+/** Nodes on a cycle that re-enters `to` via the back-edge from `from` (path to→…→from + from). */
+export function cycleNodes(template, to, from) {
+    // Forward-reachable from `to` (staying inside the SCC reaching `from`) — a simple over-approx is the
+    // set of nodes on some path to→…→from. We collect nodes that can both reach `from` and are reached
+    // from `to`, which is exactly the cycle's SCC member set for these structural edges.
+    const fromTo = forwardReach(template, to);
+    const canReachFrom = backwardReach(template, from);
+    const cycle = new Set();
+    for (const id of fromTo)
+        if (canReachFrom.has(id))
+            cycle.add(id);
+    cycle.add(to);
+    cycle.add(from);
+    return cycle;
+}
+/** Nodes reachable from a branch `entry`, stopping AT the join (the join itself is not a member). */
+export function branchSubgraph(template, entry, joinId) {
+    const seen = new Set();
+    const stack = [entry];
+    while (stack.length) {
+        const id = stack.pop();
+        if (id === joinId || seen.has(id))
+            continue;
+        seen.add(id);
+        const node = template.nodes[id];
+        if (node)
+            for (const [, t] of structuralEdges(node))
+                if (t !== joinId && !seen.has(t))
+                    stack.push(t);
+    }
+    return seen;
+}
+/** Every guard Condition on a node (choice/humanGate branches that carry a `when`). */
+export function guardConditionsOf(node) {
+    if (node.kind !== 'choice' && node.kind !== 'humanGate')
+        return [];
+    return node.branches.filter(isGuardedBranch).map((b) => b.when);
+}
+//# sourceMappingURL=validate-graph.js.map

package/dist/pipeline-core/validate-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate-graph.js","sourceRoot":"","sources":["../../src/pipeline-core/validate-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD,yGAAyG;AACzG,MAAM,UAAU,eAAe,CAAC,IAAU;IACxC,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC,CAAC;AAC3F,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,aAAa,CAAC,QAAkB,EAAE,KAAa;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1F,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yGAAyG;AACzG,MAAM,UAAU,YAAY,CAAC,QAAkB,EAAE,KAAa;IAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,aAAa,CAAC,QAAkB,EAAE,MAAc;IAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC;YAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtG,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,aAAa,CAAC,QAAkB;IAC9C,MAAM,IAAI,GAAwC,EAAE,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAG,CAAC,EAAU,EAAQ,EAAE;QAC/B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/C,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;qBACxD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,GAAG,CAAC,MAAM,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACf,CAAC,CAAC;IACF,IAAI,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC1E,OAAO,IAAI,CAAC;AACd,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,UAAU,CAAC,QAAkB,EAAE,EAAU,EAAE,IAAY;IACrE,qGAAqG;IACrG,mGAAmG;IACnG,qFAAqF;IACrF,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAC1C,MAAM,YAAY,GAAG,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,MAAM;QAAE,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACd,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,cAAc,CAAC,QAAkB,EAAE,KAAa,EAAE,MAAc;IAC9E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,EAAE,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC5C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvG,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,iBAAiB,CAAC,IAAU;IAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;QAAE,OAAO,EAAE,CAAC;IACnE,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClE,CAAC"}