@s_s/harmonia 1.2.0 → 1.4.0

package/build/core/tree-utils.js

@@ -0,0 +1,226 @@
+/**
+ * Pure node-tree traversal utilities.
+ *
+ * All functions here are pure (no side effects, no engine state dependency),
+ * and only depend on types from ./types.ts.
+ *
+ * Extracted from workflow-engine.ts, loop-done.ts, role-dispatch.ts,
+ * engine-helpers.ts, and workflow-validator.ts to eliminate duplication
+ * and avoid circular dependencies.
+ */
+/**
+ * Find a node by ID within a workflow tree.
+ * Returns null if not found.
+ */
+export function findNodeInTree(node, targetId) {
+    if (node.id === targetId)
+        return node;
+    switch (node.type) {
+        case 'sequence':
+        case 'parallel':
+            for (const child of node.children) {
+                const found = findNodeInTree(child, targetId);
+                if (found)
+                    return found;
+            }
+            break;
+        case 'gate': {
+            const passResult = findNodeInTree(node.pass, targetId);
+            if (passResult)
+                return passResult;
+            if ('type' in node.fail) {
+                const failResult = findNodeInTree(node.fail, targetId);
+                if (failResult)
+                    return failResult;
+            }
+            break;
+        }
+        case 'loop': {
+            const bodyResult = findNodeInTree(node.body, targetId);
+            if (bodyResult)
+                return bodyResult;
+            break;
+        }
+    }
+    return null;
+}
+/**
+ * Find the path from root to a specific node (inclusive on both ends).
+ * Returns null if node not found.
+ */
+export function findPathToNode(node, targetId) {
+    if (node.id === targetId)
+        return [node];
+    switch (node.type) {
+        case 'sequence':
+        case 'parallel':
+            for (const child of node.children) {
+                const path = findPathToNode(child, targetId);
+                if (path)
+                    return [node, ...path];
+            }
+            break;
+        case 'gate': {
+            const passPath = findPathToNode(node.pass, targetId);
+            if (passPath)
+                return [node, ...passPath];
+            if ('type' in node.fail) {
+                const failPath = findPathToNode(node.fail, targetId);
+                if (failPath)
+                    return [node, ...failPath];
+            }
+            break;
+        }
+        case 'loop': {
+            const bodyPath = findPathToNode(node.body, targetId);
+            if (bodyPath)
+                return [node, ...bodyPath];
+            break;
+        }
+    }
+    return null;
+}
+/**
+ * Recursively collect all node IDs in a subtree.
+ */
+export function collectAllNodeIds(node, ids) {
+    ids.add(node.id);
+    switch (node.type) {
+        case 'sequence':
+        case 'parallel':
+            for (const child of node.children) {
+                collectAllNodeIds(child, ids);
+            }
+            break;
+        case 'gate':
+            collectAllNodeIds(node.pass, ids);
+            if ('type' in node.fail) {
+                collectAllNodeIds(node.fail, ids);
+            }
+            break;
+        case 'loop':
+            collectAllNodeIds(node.body, ids);
+            break;
+    }
+}
+/**
+ * Find the parent of a node by its ID.
+ * Returns the parent node and the child's index, or null if not found.
+ */
+export function findParent(root, targetId, current) {
+    const node = current ?? root;
+    switch (node.type) {
+        case 'sequence':
+        case 'parallel':
+            for (let i = 0; i < node.children.length; i++) {
+                if (node.children[i].id === targetId) {
+                    return { parent: node, childIndex: i };
+                }
+                const found = findParent(root, targetId, node.children[i]);
+                if (found)
+                    return found;
+            }
+            break;
+        case 'gate':
+            if (node.pass.id === targetId) {
+                return { parent: node, childIndex: 0 };
+            }
+            const passResult = findParent(root, targetId, node.pass);
+            if (passResult)
+                return passResult;
+            if ('type' in node.fail) {
+                const failNode = node.fail;
+                if (failNode.id === targetId) {
+                    return { parent: node, childIndex: 1 };
+                }
+                const failResult = findParent(root, targetId, failNode);
+                if (failResult)
+                    return failResult;
+            }
+            break;
+        case 'loop':
+            if (node.body.id === targetId) {
+                return { parent: node, childIndex: 0 };
+            }
+            const loopResult = findParent(root, targetId, node.body);
+            if (loopResult)
+                return loopResult;
+            break;
+    }
+    return null;
+}
+/**
+ * Collect all node IDs that come after a target node in execution order.
+ *
+ * "After" means:
+ * - Subsequent siblings (and their full subtrees) in the parent sequence
+ * - Any nodes that follow the parent in its grandparent sequence (recursively)
+ *
+ * For parallel nodes, subsequent siblings don't apply (they execute simultaneously).
+ */
+export function collectSubsequentNodeIds(root, targetId) {
+    const result = new Set();
+    // Find the path from root to the target
+    const path = findPathToNode(root, targetId);
+    if (!path || path.length === 0)
+        return result;
+    // Walk up the path, collecting subsequent siblings at each level
+    for (let i = 0; i < path.length - 1; i++) {
+        const parent = path[i];
+        const child = path[i + 1];
+        if (parent.type === 'sequence') {
+            const childIndex = parent.children.findIndex((c) => c.id === child.id);
+            // Collect all children after the one on our path
+            for (let j = childIndex + 1; j < parent.children.length; j++) {
+                collectAllNodeIds(parent.children[j], result);
+            }
+        }
+        // For gate nodes, if our path goes through pass, we don't need to collect fail
+        // because fail is an alternative path, not a subsequent one.
+        // For parallel nodes, siblings are concurrent not subsequent — don't reset.
+    }
+    return result;
+}
+/**
+ * Collect all task nodes from a workflow tree (recursive).
+ */
+export function collectTaskNodes(node) {
+    const tasks = [];
+    switch (node.type) {
+        case 'task':
+            tasks.push(node);
+            break;
+        case 'sequence':
+        case 'parallel':
+            for (const child of node.children) {
+                tasks.push(...collectTaskNodes(child));
+            }
+            break;
+        case 'gate':
+            tasks.push(...collectTaskNodes(node.pass));
+            if ('type' in node.fail) {
+                tasks.push(...collectTaskNodes(node.fail));
+            }
+            break;
+        case 'loop':
+            tasks.push(...collectTaskNodes(node.body));
+            break;
+    }
+    return tasks;
+}
+/**
+ * Find the nearest ancestor loop node for a given node ID.
+ * Returns the loop node ID if found, undefined otherwise.
+ */
+export function findAncestorLoopId(root, targetId) {
+    const path = findPathToNode(root, targetId);
+    if (!path)
+        return undefined;
+    // Walk backwards through ancestors (excluding the target itself)
+    for (let i = path.length - 2; i >= 0; i--) {
+        if (path[i].type === 'loop')
+            return path[i].id;
+    }
+    return undefined;
+}
+//# sourceMappingURL=tree-utils.js.map

package/build/core/tree-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-utils.js","sourceRoot":"","sources":["../../src/core/tree-utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAAkB,EAAE,QAAgB;IAC/D,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEtC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU;YACX,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC9C,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC;YAC5B,CAAC;YACD,MAAM;QACV,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACvD,IAAI,UAAU;gBAAE,OAAO,UAAU,CAAC;YAClC,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACtB,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,IAAoB,EAAE,QAAQ,CAAC,CAAC;gBACvE,IAAI,UAAU;oBAAE,OAAO,UAAU,CAAC;YACtC,CAAC;YACD,MAAM;QACV,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACvD,IAAI,UAAU;gBAAE,OAAO,UAAU,CAAC;YAClC,MAAM;QACV,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAAkB,EAAE,QAAgB;IAC/D,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAExC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU;YACX,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC7C,IAAI,IAAI;oBAAE,OAAO,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;YACrC,CAAC;YACD,MAAM;QACV,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACrD,IAAI,QAAQ;gBAAE,OAAO,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC;YACzC,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,IAAoB,EAAE,QAAQ,CAAC,CAAC;gBACrE,IAAI,QAAQ;oBAAE,OAAO,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC;YAC7C,CAAC;YACD,MAAM;QACV,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACV,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACrD,IAAI,QAAQ;gBAAE,OAAO,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,CAAC;YACzC,MAAM;QACV,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAkB,EAAE,GAAgB;IAClE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU;YACX,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAClC,CAAC;YACD,MAAM;QACV,KAAK,MAAM;YACP,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAClC,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACtB,iBAAiB,CAAC,IAAI,CAAC,IAAoB,EAAE,GAAG,CAAC,CAAC;YACtD,CAAC;YACD,MAAM;QACV,KAAK,MAAM;YACP,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAClC,MAAM;IACd,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACtB,IAAkB,EAClB,QAAgB,EAChB,OAAsB;IAEtB,MAAM,IAAI,GAAG,OAAO,IAAI,IAAI,CAAC;IAE7B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;oBACnC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;gBAC3C,CAAC;gBACD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3D,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC;YAC5B,CAAC;YACD,MAAM;QAEV,KAAK,MAAM;YACP,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;gBAC5B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;YAC3C,CAAC;YACD,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACzD,IAAI,UAAU;gBAAE,OAAO,UAAU,CAAC;YAElC,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAoB,CAAC;gBAC3C,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;oBAC3B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;gBAC3C,CAAC;gBACD,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACxD,IAAI,UAAU;oBAAE,OAAO,UAAU,CAAC;YACtC,CAAC;YACD,MAAM;QAEV,KAAK,MAAM;YACP,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;gBAC5B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;YAC3C,CAAC;YACD,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACzD,IAAI,UAAU;gBAAE,OAAO,UAAU,CAAC;YAClC,MAAM;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAAkB,EAAE,QAAgB;IACzE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IAEjC,wCAAwC;IACxC,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAE9C,iEAAiE;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE1B,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC;YACvE,iDAAiD;YACjD,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3D,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAClD,CAAC;QACL,CAAC;QACD,+EAA+E;QAC/E,6DAA6D;QAC7D,4EAA4E;IAChF,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAkB;IAC/C,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,MAAM;YACP,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,MAAM;QACV,KAAK,UAAU,CAAC;QAChB,KAAK,UAAU;YACX,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,KAAK,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,CAAC;YACD,MAAM;QACV,KAAK,MAAM;YACP,KAAK,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3C,IAAI,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAoB,CAAC,CAAC,CAAC;YAC/D,CAAC;YACD,MAAM;QACV,KAAK,MAAM;YACP,KAAK,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3C,MAAM;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAkB,EAAE,QAAgB;IACnE,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC;IAC5B,iEAAiE;IACjE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC"}