@revisium/orchestrator 0.0.0 → 0.1.0-alpha.10

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"}

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

@@ -0,0 +1,226 @@
+import { isGuardedBranch } from './types.js';
+import { backwardReach, cycleNodes, findBackEdges, forwardReach, guardConditionsOf } from './validate-graph.js';
+// ─────────────────────────────────────────────────────────────────────────────
+// Rule 6b — loop-cap presence.
+//
+// Spec note (two ambiguities resolved against the canonical §13 example, which §13 declares
+// internally-consistent and the task names as THE fixture):
+//  1. §12.6 says "a terminating cap-guard (counter.gte)", but §13 expresses the SAME bound as
+//     `counter.lt K` on the CONTINUE edge with the default routing OUT (once the counter reaches K the
+//     guard fails and control falls through to blockedEnd). Both make the loop finite, so we accept
+//     EITHER: a cycle is counter-bounded iff some `choice` on it has a guard referencing a `counter.*`
+//     over a scope INCREMENTED on the cycle.
+//  2. §13's analyst↔planGate `changes_requested` loop carries NO counter — it is bounded only by human
+//     judgment. §6 makes a human-driven loop legitimately unbounded ("durable wait is free … for
+//     human-driven runs"). So a cycle that passes through a `humanGate` is also accepted.
+// An AUTOMATED loop (agents/scripts/choices only) with no counter is rejected (LOOP_UNBOUNDED).
+// ─────────────────────────────────────────────────────────────────────────────
+export function ruleLoopCap(template, d) {
+    if (!template.entry || !template.nodes[template.entry])
+        return;
+    for (const { from, to } of findBackEdges(template)) {
+        const cycle = cycleNodes(template, to, from);
+        const incrementedOnCycle = scopesIncrementedOnCycle(template, cycle);
+        const counterBounded = [...cycle].some((id) => choiceGatesCycleByCounter(template, id, incrementedOnCycle));
+        const humanDriven = [...cycle].some((id) => template.nodes[id]?.kind === 'humanGate');
+        if (!counterBounded && !humanDriven) {
+            d.error('LOOP_UNBOUNDED', `back-edge ${from} → ${to} is not bounded by a counter cap-guard or a human gate`, {
+                nodeId: from,
+            });
+        }
+    }
+}
+/** Scope ids incremented by any node on the cycle (the loop's bound must count one of these). */
+function scopesIncrementedOnCycle(template, cycle) {
+    const out = new Set();
+    for (const id of cycle) {
+        const node = template.nodes[id];
+        if (node && 'incrementCounters' in node)
+            for (const s of node.incrementCounters ?? [])
+                out.add(s);
+    }
+    return out;
+}
+/** A choice with a guard that references a `counter.*` over a scope incremented on the cycle. */
+function choiceGatesCycleByCounter(template, id, incrementedOnCycle) {
+    const node = template.nodes[id];
+    if (node?.kind !== 'choice')
+        return false;
+    return node.branches.filter(isGuardedBranch).some((b) => conditionGatesOnScopes(b.when, incrementedOnCycle));
+}
+/** True when `cond` compares a `counter.*` against one of `scopes`. */
+function conditionGatesOnScopes(cond, scopes) {
+    switch (cond.op) {
+        case 'counter.lt':
+        case 'counter.gte':
+            return scopes.has(cond.scope);
+        case 'all':
+        case 'any':
+            return cond.of.some((c) => conditionGatesOnScopes(c, scopes));
+        case 'not':
+            return conditionGatesOnScopes(cond.cond, scopes);
+        default:
+            return false;
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Rule 7 — counter-scope well-formedness.
+// ─────────────────────────────────────────────────────────────────────────────
+export function ruleCounterScopes(template, d) {
+    const scopes = template.scopes ?? {};
+    const scopeIds = new Set(Object.keys(scopes));
+    checkScopeParentsAndCycles(scopes, scopeIds, d); //          7a parents resolve + no cycle
+    checkScopesDeclared(template, scopeIds, d); //               7b every referenced scope is declared
+    for (const scopeId of scopeIds)
+        checkScopeStrictAncestry(template, scopeId, d); // 7c reset = strict ancestor
+    for (const scopeId of Object.keys(scopes))
+        checkScopeDoesNotSpanParallel(template, scopeId, d); // 7d no parallel/join
+}
+/** 7a — every scope's parent resolves to a declared scope and the parent chain has no cycle. */
+function checkScopeParentsAndCycles(scopes, scopeIds, d) {
+    for (const [scopeId, scope] of Object.entries(scopes)) {
+        if (scope.parent !== null && !scopeIds.has(scope.parent)) {
+            d.error('SCOPE_PARENT_UNRESOLVED', `scope "${scopeId}" parent "${scope.parent}" is not declared`, {
+                scope: scopeId,
+            });
+        }
+    }
+    for (const scopeId of scopeIds) {
+        if (scopeChainHasCycle(scopes, scopeId)) {
+            d.error('SCOPE_CYCLE', `scope "${scopeId}" has a parent cycle`, { scope: scopeId });
+        }
+    }
+}
+/** 7b — every scope referenced by a node (increment or guard) is declared. */
+function checkScopesDeclared(template, scopeIds, d) {
+    for (const node of Object.values(template.nodes)) {
+        for (const scopeRef of referencedScopes(node)) {
+            if (!scopeIds.has(scopeRef)) {
+                d.error('SCOPE_UNDECLARED', `node ${node.id} references undeclared scope "${scopeRef}"`, {
+                    nodeId: node.id,
+                    scope: scopeRef,
+                });
+            }
+        }
+    }
+}
+/**
+ * 7c — a reset scope is a STRICT ancestor of every node that reads/increments it (§7/§12.7). The scope's
+ * region is its loop sub-graph: the node(s) that increment it + the guard node(s) that read it. A
+ * well-formed reader sits inside that loop — i.e. it shares a cycle with an increment site, or is
+ * forward-reachable from one (the cap-guard reads after a rework hop). A reader disconnected from
+ * every increment site is a cross-scope/out-of-scope reference; a scope read but never incremented
+ * can never advance (its cap is dead). Both are SCOPE_NOT_STRICT_ANCESTOR.
+ */
+function checkScopeStrictAncestry(template, scopeId, d) {
+    const incrementSites = nodesIncrementing(template, scopeId);
+    const readers = nodesReadingScope(template, scopeId);
+    if (incrementSites.length === 0 && readers.length > 0) {
+        for (const r of readers) {
+            d.error('SCOPE_NOT_STRICT_ANCESTOR', `scope "${scopeId}" is read by ${r} but never incremented`, {
+                nodeId: r,
+                scope: scopeId,
+            });
+        }
+        return;
+    }
+    for (const reader of readers) {
+        const insideLoop = incrementSites.some((site) => sharesCycle(template, site, reader) || forwardReach(template, site).has(reader));
+        if (!insideLoop) {
+            d.error('SCOPE_NOT_STRICT_ANCESTOR', `scope "${scopeId}" reader ${reader} is outside its loop region`, {
+                nodeId: reader,
+                scope: scopeId,
+            });
+        }
+    }
+}
+/**
+ * 7d — a counter scope may not span a parallel/join boundary (v1). The region is the increment/read endpoints
+ * PLUS every node on a structural path between them: a counter incremented before a fan-out and read after the
+ * join (or whose endpoints sit in different branches) crosses the boundary and is unsafe in v1.
+ */
+function checkScopeDoesNotSpanParallel(template, scopeId, d) {
+    const region = scopeRegionBetween(template, nodesIncrementing(template, scopeId), nodesReadingScope(template, scopeId));
+    for (const id of region) {
+        const node = template.nodes[id];
+        if (node && (node.kind === 'parallel' || node.kind === 'join')) {
+            d.error('SCOPE_SPANS_PARALLEL', `scope "${scopeId}" spans a ${node.kind} boundary (${id})`, {
+                nodeId: id,
+                scope: scopeId,
+            });
+        }
+    }
+}
+/** Endpoints plus every node on some structural path from an increment site to a reader (forwardReach ∩ backwardReach). */
+function scopeRegionBetween(template, incrementSites, readers) {
+    const region = new Set([...incrementSites, ...readers]);
+    for (const inc of incrementSites) {
+        const fwd = forwardReach(template, inc);
+        for (const reader of readers) {
+            if (!fwd.has(reader))
+                continue;
+            const back = backwardReach(template, reader);
+            for (const id of fwd)
+                if (back.has(id))
+                    region.add(id);
+        }
+    }
+    return region;
+}
+function scopeChainHasCycle(scopes, start) {
+    let cursor = scopes[start]?.parent ?? null;
+    const seen = new Set([start]);
+    while (cursor !== null) {
+        if (seen.has(cursor))
+            return true;
+        seen.add(cursor);
+        cursor = scopes[cursor]?.parent ?? null;
+    }
+    return false;
+}
+function referencedScopes(node) {
+    const out = [];
+    if ('incrementCounters' in node && node.incrementCounters)
+        out.push(...node.incrementCounters);
+    for (const cond of guardConditionsOf(node))
+        collectCounterScopes(cond, out);
+    return out;
+}
+function collectCounterScopes(cond, out) {
+    switch (cond.op) {
+        case 'counter.lt':
+        case 'counter.gte':
+            out.push(cond.scope);
+            break;
+        case 'all':
+        case 'any':
+            cond.of.forEach((c) => collectCounterScopes(c, out));
+            break;
+        case 'not':
+            collectCounterScopes(cond.cond, out);
+            break;
+    }
+}
+function nodesIncrementing(template, scopeId) {
+    return Object.values(template.nodes)
+        .filter((n) => 'incrementCounters' in n && (n.incrementCounters ?? []).includes(scopeId))
+        .map((n) => n.id);
+}
+function nodesReadingScope(template, scopeId) {
+    const out = [];
+    for (const node of Object.values(template.nodes)) {
+        for (const cond of guardConditionsOf(node)) {
+            const scopes = [];
+            collectCounterScopes(cond, scopes);
+            if (scopes.includes(scopeId)) {
+                out.push(node.id);
+                break;
+            }
+        }
+    }
+    return out;
+}
+function sharesCycle(template, a, b) {
+    return forwardReach(template, a).has(b) && forwardReach(template, b).has(a);
+}
+//# sourceMappingURL=validate-loops.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"validate-loops.js","sourceRoot":"","sources":["../../src/pipeline-core/validate-loops.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG7C,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAEhH,gFAAgF;AAChF,+BAA+B;AAC/B,EAAE;AACF,4FAA4F;AAC5F,4DAA4D;AAC5D,8FAA8F;AAC9F,uGAAuG;AACvG,oGAAoG;AACpG,uGAAuG;AACvG,6CAA6C;AAC7C,uGAAuG;AACvG,iGAAiG;AACjG,0FAA0F;AAC1F,gGAAgG;AAChG,gFAAgF;AAEhF,MAAM,UAAU,WAAW,CAAC,QAAkB,EAAE,CAAW;IACzD,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO;IAC/D,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,MAAM,kBAAkB,GAAG,wBAAwB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACrE,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,yBAAyB,CAAC,QAAQ,EAAE,EAAE,EAAE,kBAAkB,CAAC,CAAC,CAAC;QAC5G,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,KAAK,WAAW,CAAC,CAAC;QACtF,IAAI,CAAC,cAAc,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,CAAC,CAAC,KAAK,CAAC,gBAAgB,EAAE,aAAa,IAAI,MAAM,EAAE,wDAAwD,EAAE;gBAC3G,MAAM,EAAE,IAAI;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED,iGAAiG;AACjG,SAAS,wBAAwB,CAAC,QAAkB,EAAE,KAAkB;IACtE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI,IAAI,mBAAmB,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,iBAAiB,IAAI,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpG,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iGAAiG;AACjG,SAAS,yBAAyB,CAAC,QAAkB,EAAE,EAAU,EAAE,kBAA+B;IAChG,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAChC,IAAI,IAAI,EAAE,IAAI,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC;AAC/G,CAAC;AAED,uEAAuE;AACvE,SAAS,sBAAsB,CAAC,IAAe,EAAE,MAAmB;IAClE,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,YAAY,CAAC;QAClB,KAAK,aAAa;YAChB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,KAAK,KAAK,CAAC;QACX,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAChE,KAAK,KAAK;YACR,OAAO,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnD;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,0CAA0C;AAC1C,gFAAgF;AAEhF,MAAM,UAAU,iBAAiB,CAAC,QAAkB,EAAE,CAAW;IAC/D,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,IAAI,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9C,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,yCAAyC;IAC1F,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,sDAAsD;IAClG,KAAK,MAAM,OAAO,IAAI,QAAQ;QAAE,wBAAwB,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,6BAA6B;IAC7G,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,6BAA6B,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,sBAAsB;AACxH,CAAC;AAED,gGAAgG;AAChG,SAAS,0BAA0B,CACjC,MAA6B,EAC7B,QAAqB,EACrB,CAAW;IAEX,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACtD,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YACzD,CAAC,CAAC,KAAK,CAAC,yBAAyB,EAAE,UAAU,OAAO,aAAa,KAAK,CAAC,MAAM,mBAAmB,EAAE;gBAChG,KAAK,EAAE,OAAO;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;YACxC,CAAC,CAAC,KAAK,CAAC,aAAa,EAAE,UAAU,OAAO,sBAAsB,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACtF,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,mBAAmB,CAAC,QAAkB,EAAE,QAAqB,EAAE,CAAW;IACjF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,KAAK,MAAM,QAAQ,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,CAAC,CAAC,KAAK,CAAC,kBAAkB,EAAE,QAAQ,IAAI,CAAC,EAAE,iCAAiC,QAAQ,GAAG,EAAE;oBACvF,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,KAAK,EAAE,QAAQ;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,wBAAwB,CAAC,QAAkB,EAAE,OAAe,EAAE,CAAW;IAChF,MAAM,cAAc,GAAG,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACrD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC,2BAA2B,EAAE,UAAU,OAAO,gBAAgB,CAAC,wBAAwB,EAAE;gBAC/F,MAAM,EAAE,CAAC;gBACT,KAAK,EAAE,OAAO;aACf,CAAC,CAAC;QACL,CAAC;QACD,OAAO;IACT,CAAC;IACD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CACpC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAC1F,CAAC;QACF,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,CAAC,CAAC,KAAK,CAAC,2BAA2B,EAAE,UAAU,OAAO,YAAY,MAAM,6BAA6B,EAAE;gBACrG,MAAM,EAAE,MAAM;gBACd,KAAK,EAAE,OAAO;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,6BAA6B,CAAC,QAAkB,EAAE,OAAe,EAAE,CAAW;IACrF,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;IACxH,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,CAAC;YAC/D,CAAC,CAAC,KAAK,CAAC,sBAAsB,EAAE,UAAU,OAAO,aAAa,IAAI,CAAC,IAAI,cAAc,EAAE,GAAG,EAAE;gBAC1F,MAAM,EAAE,EAAE;gBACV,KAAK,EAAE,OAAO;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED,2HAA2H;AAC3H,SAAS,kBAAkB,CAAC,QAAkB,EAAE,cAAwB,EAAE,OAAiB;IACzF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,cAAc,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAChE,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACxC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC/B,MAAM,IAAI,GAAG,aAAa,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAiD,EAAE,KAAa;IAC1F,IAAI,MAAM,GAAkB,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;IAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC;IAC1C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAU;IAClC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,mBAAmB,IAAI,IAAI,IAAI,IAAI,CAAC,iBAAiB;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC/F,KAAK,MAAM,IAAI,IAAI,iBAAiB,CAAC,IAAI,CAAC;QAAE,oBAAoB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC5E,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAe,EAAE,GAAa;IAC1D,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,YAAY,CAAC;QAClB,KAAK,aAAa;YAChB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,MAAM;QACR,KAAK,KAAK,CAAC;QACX,KAAK,KAAK;YACR,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACrD,MAAM;QACR,KAAK,KAAK;YACR,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,MAAM;IACV,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CAAC,QAAkB,EAAE,OAAe;IAC5D,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;SACjC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;SACxF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED,SAAS,iBAAiB,CAAC,QAAkB,EAAE,OAAe;IAC5D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,KAAK,MAAM,IAAI,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACnC,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,WAAW,CAAC,QAAkB,EAAE,CAAS,EAAE,CAAS;IAC3D,OAAO,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC9E,CAAC"}