@s_s/harmonia 1.3.0 → 1.4.0

package/build/core/steps.js

@@ -1,17 +1,14 @@
 /**
  * Step state management — manages <context_dir>/steps.json
  *
- * Tracks which sequential steps have been completed for each document,
+ * Tracks which sequential steps have been completed for each artifact,
  * supporting the P3 Sequential mode feature.
- * All public functions accept an optional contextDir parameter.
  */
 import { readFile, writeFile, mkdir } from 'node:fs/promises';
 import { join, dirname } from 'node:path';
-import { getIterationDir } from './registry.js';
 const STEPS_FILE = 'steps.json';
 function stepsPath(projectName, iteration, contextDir) {
-    const base = contextDir ?? getIterationDir(projectName, iteration);
-    return join(base, STEPS_FILE);
+    return join(contextDir, STEPS_FILE);
 }
 /**
  * Read the steps state for a project context.
@@ -20,7 +17,7 @@ export async function readSteps(projectName, iteration, contextDir) {
     try {
         const content = await readFile(stepsPath(projectName, iteration, contextDir), 'utf-8');
         const data = JSON.parse(content);
-        return data.docs ?? {};
+        return data.artifacts ?? {};
     }
     catch {
         return {};
@@ -29,21 +26,21 @@ export async function readSteps(projectName, iteration, contextDir) {
 /**
  * Write steps state to disk.
  */
-async function writeSteps(projectName, iteration, docs, contextDir) {
+async function writeSteps(projectName, iteration, artifacts, contextDir) {
     const filePath = stepsPath(projectName, iteration, contextDir);
     await mkdir(dirname(filePath), { recursive: true });
-    const data = { docs };
+    const data = { artifacts };
     await writeFile(filePath, JSON.stringify(data, null, 2) + '\n', 'utf-8');
 }
 /**
- * Get the step state for a specific document.
+ * Get the step state for a specific artifact.
  */
-export async function getDocStepState(projectName, iteration, docId, contextDir) {
-    const docs = await readSteps(projectName, iteration, contextDir);
-    return docs[docId] ?? null;
+export async function getArtifactStepState(projectName, iteration, artifactId, contextDir) {
+    const artifacts = await readSteps(projectName, iteration, contextDir);
+    return artifacts[artifactId] ?? null;
 }
 /**
- * Get the set of completed step IDs for a document.
+ * Get the set of completed step IDs for an artifact.
  */
 export function getCompletedStepIds(state) {
     if (!state)
@@ -54,14 +51,14 @@ export function getCompletedStepIds(state) {
  * Record a step as completed. If the step was already completed,
  * it is overwritten and all subsequent steps are cleared (rollback).
  *
- * @returns The updated DocStepState
+ * @returns The updated ArtifactStepState
  */
-export async function recordStepCompletion(projectName, iteration, docId, stepId, artifactPath, allStepIds, contextDir) {
-    const docs = await readSteps(projectName, iteration, contextDir);
-    let state = docs[docId];
+export async function recordStepCompletion(projectName, iteration, artifactId, stepId, artifactPath, allStepIds, contextDir) {
+    const artifacts = await readSteps(projectName, iteration, contextDir);
+    let state = artifacts[artifactId];
     if (!state) {
         state = {
-            docId,
+            artifactId,
             completedSteps: [],
             finalized: false,
         };
@@ -87,29 +84,29 @@ export async function recordStepCompletion(projectName, iteration, docId, stepId
         artifactPath,
     };
     state.completedSteps.push(record);
-    docs[docId] = state;
-    await writeSteps(projectName, iteration, docs, contextDir);
+    artifacts[artifactId] = state;
+    await writeSteps(projectName, iteration, artifacts, contextDir);
     return state;
 }
 /**
- * Mark a document as finalized (all steps completed + final doc written).
+ * Mark an artifact as finalized (all steps completed + final artifact written).
  */
-export async function markFinalized(projectName, iteration, docId, contextDir) {
-    const docs = await readSteps(projectName, iteration, contextDir);
-    const state = docs[docId];
+export async function markFinalized(projectName, iteration, artifactId, contextDir) {
+    const artifacts = await readSteps(projectName, iteration, contextDir);
+    const state = artifacts[artifactId];
     if (!state) {
-        throw new Error(`No step state found for document "${docId}"`);
+        throw new Error(`No step state found for artifact "${artifactId}"`);
     }
     state.finalized = true;
     state.finalizedAt = new Date().toISOString();
-    await writeSteps(projectName, iteration, docs, contextDir);
+    await writeSteps(projectName, iteration, artifacts, contextDir);
     return state;
 }
 /**
- * Check if a document's sequential process is finalized.
+ * Check if an artifact's sequential process is finalized.
  */
-export async function isDocFinalized(projectName, iteration, docId, contextDir) {
-    const state = await getDocStepState(projectName, iteration, docId, contextDir);
+export async function isArtifactFinalized(projectName, iteration, artifactId, contextDir) {
+    const state = await getArtifactStepState(projectName, iteration, artifactId, contextDir);
     return state?.finalized ?? false;
 }
 //# sourceMappingURL=steps.js.map

package/build/core/steps.js.map

@@ -1 +1 @@
-{"version":3,"file":"steps.js","sourceRoot":"","sources":["../../src/core/steps.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAGhD,MAAM,UAAU,GAAG,YAAY,CAAC;AAMhC,SAAS,SAAS,CAAC,WAAmB,EAAE,SAAiB,EAAE,UAAmB;IAC1E,MAAM,IAAI,GAAG,UAAU,IAAI,eAAe,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACnE,OAAO,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC3B,WAAmB,EACnB,SAAiB,EACjB,UAAmB;IAEnB,IAAI,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC;QACvF,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAc,CAAC;QAC9C,OAAO,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,EAAE,CAAC;IACd,CAAC;AACL,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,UAAU,CACrB,WAAmB,EACnB,SAAiB,EACjB,IAAkC,EAClC,UAAmB;IAEnB,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAC/D,MAAM,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACpD,MAAM,IAAI,GAAc,EAAE,IAAI,EAAE,CAAC;IACjC,MAAM,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;AAC7E,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACjC,WAAmB,EACnB,SAAiB,EACjB,KAAa,EACb,UAAmB;IAEnB,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAA0B;IAC1D,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAC7B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACtC,WAAmB,EACnB,SAAiB,EACjB,KAAa,EACb,MAAc,EACd,YAAoB,EACpB,UAAoB,EACpB,UAAmB;IAEnB,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACjE,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAExB,IAAI,CAAC,KAAK,EAAE,CAAC;QACT,KAAK,GAAG;YACJ,KAAK;YACL,cAAc,EAAE,EAAE;YAClB,SAAS,EAAE,KAAK;SACnB,CAAC;IACN,CAAC;IAED,2DAA2D;IAC3D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAE7C,8EAA8E;IAC9E,MAAM,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACjF,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;QACrB,2CAA2C;QAC3C,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACrD,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC1C,OAAO,IAAI,GAAG,SAAS,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,uBAAuB;QACvB,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;QACxB,OAAO,KAAK,CAAC,WAAW,CAAC;IAC7B,CAAC;IAED,sBAAsB;IACtB,MAAM,MAAM,GAAkB;QAC1B,MAAM;QACN,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACrC,YAAY;KACf,CAAC;IACF,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAElC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACpB,MAAM,UAAU,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAC3D,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAC/B,WAAmB,EACnB,SAAiB,EACjB,KAAa,EACb,UAAmB;IAEnB,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAE1B,IAAI,CAAC,KAAK,EAAE,CAAC;QACT,MAAM,IAAI,KAAK,CAAC,qCAAqC,KAAK,GAAG,CAAC,CAAC;IACnE,CAAC;IAED,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;IACvB,KAAK,CAAC,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE7C,MAAM,UAAU,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAC3D,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAChC,WAAmB,EACnB,SAAiB,EACjB,KAAa,EACb,UAAmB;IAEnB,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAC/E,OAAO,KAAK,EAAE,SAAS,IAAI,KAAK,CAAC;AACrC,CAAC"}
+{"version":3,"file":"steps.js","sourceRoot":"","sources":["../../src/core/steps.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAG1C,MAAM,UAAU,GAAG,YAAY,CAAC;AAMhC,SAAS,SAAS,CAAC,WAAmB,EAAE,SAAiB,EAAE,UAAmB;IAC1E,OAAO,IAAI,CAAC,UAAW,EAAE,UAAU,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC3B,WAAmB,EACnB,SAAiB,EACjB,UAAmB;IAEnB,IAAI,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC;QACvF,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAc,CAAC;QAC9C,OAAO,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,EAAE,CAAC;IACd,CAAC;AACL,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,UAAU,CACrB,WAAmB,EACnB,SAAiB,EACjB,SAA4C,EAC5C,UAAmB;IAEnB,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAC/D,MAAM,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACpD,MAAM,IAAI,GAAc,EAAE,SAAS,EAAE,CAAC;IACtC,MAAM,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;AAC7E,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACtC,WAAmB,EACnB,SAAiB,EACjB,UAAkB,EAClB,UAAmB;IAEnB,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACtE,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAA+B;IAC/D,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAC7B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACtC,WAAmB,EACnB,SAAiB,EACjB,UAAkB,EAClB,MAAc,EACd,YAAoB,EACpB,UAAoB,EACpB,UAAmB;IAEnB,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACtE,IAAI,KAAK,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IAElC,IAAI,CAAC,KAAK,EAAE,CAAC;QACT,KAAK,GAAG;YACJ,UAAU;YACV,cAAc,EAAE,EAAE;YAClB,SAAS,EAAE,KAAK;SACnB,CAAC;IACN,CAAC;IAED,2DAA2D;IAC3D,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAE7C,8EAA8E;IAC9E,MAAM,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACjF,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;QACrB,2CAA2C;QAC3C,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACrD,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC1C,OAAO,IAAI,GAAG,SAAS,CAAC;QAC5B,CAAC,CAAC,CAAC;QACH,uBAAuB;QACvB,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;QACxB,OAAO,KAAK,CAAC,WAAW,CAAC;IAC7B,CAAC;IAED,sBAAsB;IACtB,MAAM,MAAM,GAAuB;QAC/B,MAAM;QACN,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACrC,YAAY;KACf,CAAC;IACF,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAElC,SAAS,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC;IAC9B,MAAM,UAAU,CAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAChE,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAC/B,WAAmB,EACnB,SAAiB,EACjB,UAAkB,EAClB,UAAmB;IAEnB,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IACtE,MAAM,KAAK,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IAEpC,IAAI,CAAC,KAAK,EAAE,CAAC;QACT,MAAM,IAAI,KAAK,CAAC,qCAAqC,UAAU,GAAG,CAAC,CAAC;IACxE,CAAC;IAED,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;IACvB,KAAK,CAAC,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE7C,MAAM,UAAU,CAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAChE,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACrC,WAAmB,EACnB,SAAiB,EACjB,UAAkB,EAClB,UAAmB;IAEnB,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;IACzF,OAAO,KAAK,EAAE,SAAS,IAAI,KAAK,CAAC;AACrC,CAAC"}

package/build/core/tree-utils.d.ts

@@ -0,0 +1,52 @@
+/**
+ * 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.
+ */
+import type { WorkflowNode, TaskNode } from './types.js';
+/**
+ * Find a node by ID within a workflow tree.
+ * Returns null if not found.
+ */
+export declare function findNodeInTree(node: WorkflowNode, targetId: string): WorkflowNode | null;
+/**
+ * Find the path from root to a specific node (inclusive on both ends).
+ * Returns null if node not found.
+ */
+export declare function findPathToNode(node: WorkflowNode, targetId: string): WorkflowNode[] | null;
+/**
+ * Recursively collect all node IDs in a subtree.
+ */
+export declare function collectAllNodeIds(node: WorkflowNode, ids: Set<string>): void;
+/**
+ * Find the parent of a node by its ID.
+ * Returns the parent node and the child's index, or null if not found.
+ */
+export declare function findParent(root: WorkflowNode, targetId: string, current?: WorkflowNode): {
+    parent: WorkflowNode;
+    childIndex: number;
+} | 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 declare function collectSubsequentNodeIds(root: WorkflowNode, targetId: string): Set<string>;
+/**
+ * Collect all task nodes from a workflow tree (recursive).
+ */
+export declare function collectTaskNodes(node: WorkflowNode): TaskNode[];
+/**
+ * Find the nearest ancestor loop node for a given node ID.
+ * Returns the loop node ID if found, undefined otherwise.
+ */
+export declare function findAncestorLoopId(root: WorkflowNode, targetId: string): string | undefined;

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