sudocode 1.1.17 → 1.1.18-dev.0

package/node_modules/@sudocode-ai/local-server/dist/workflow/dependency-analyzer.js

@@ -0,0 +1,264 @@
+/**
+ * Dependency Graph Analyzer for Workflow System
+ *
+ * Analyzes issue dependencies using blocks/depends-on relationships
+ * to determine execution order and detect cycles.
+ */
+import { getOutgoingRelationships } from "@sudocode-ai/cli/dist/operations/relationships.js";
+// =============================================================================
+// Graph Building
+// =============================================================================
+/**
+ * Build a dependency graph from issue relationships.
+ *
+ * Examines `blocks` and `depends-on` relationships between issues
+ * to create an adjacency list representation.
+ *
+ * @param db - Database connection
+ * @param issueIds - Issue IDs to include in the graph
+ * @returns Internal graph representation
+ */
+export function buildDependencyGraph(db, issueIds) {
+    // Deduplicate and create a set for fast lookup
+    const issueIdSet = new Set(issueIds);
+    const uniqueIssueIds = Array.from(issueIdSet);
+    // Initialize data structures
+    const edges = [];
+    const adjacencyList = new Map();
+    const inDegree = new Map();
+    // Initialize all nodes with empty adjacency and zero in-degree
+    for (const id of uniqueIssueIds) {
+        adjacencyList.set(id, []);
+        inDegree.set(id, 0);
+    }
+    // Process each issue to find its relationships
+    for (const issueId of uniqueIssueIds) {
+        // Get outgoing "blocks" relationships: this issue blocks others
+        // Edge direction: blocker -> blocked
+        const blocksRels = getOutgoingRelationships(db, issueId, "issue", "blocks");
+        for (const rel of blocksRels) {
+            // Only include edges where both ends are in our issue set
+            if (issueIdSet.has(rel.to_id)) {
+                edges.push([issueId, rel.to_id]);
+                adjacencyList.get(issueId).push(rel.to_id);
+                inDegree.set(rel.to_id, (inDegree.get(rel.to_id) ?? 0) + 1);
+            }
+        }
+        // Get incoming "depends-on" relationships: this issue depends on others
+        // If A depends-on B, then B blocks A, so edge is B -> A
+        const dependsOnRels = getOutgoingRelationships(db, issueId, "issue", "depends-on");
+        for (const rel of dependsOnRels) {
+            // rel.to_id is what this issue depends on (the blocker)
+            // Edge direction: blocker (rel.to_id) -> blocked (issueId)
+            if (issueIdSet.has(rel.to_id)) {
+                // Avoid duplicate edges
+                const existingEdges = adjacencyList.get(rel.to_id) ?? [];
+                if (!existingEdges.includes(issueId)) {
+                    edges.push([rel.to_id, issueId]);
+                    adjacencyList.get(rel.to_id).push(issueId);
+                    inDegree.set(issueId, (inDegree.get(issueId) ?? 0) + 1);
+                }
+            }
+        }
+    }
+    return {
+        issueIds: uniqueIssueIds,
+        edges,
+        adjacencyList,
+        inDegree,
+    };
+}
+// =============================================================================
+// Topological Sort (Kahn's Algorithm)
+// =============================================================================
+/**
+ * Perform topological sort using Kahn's algorithm.
+ *
+ * Returns issues in a valid execution order where all dependencies
+ * come before dependents. Detects cycles if present.
+ *
+ * @param adjacencyList - Map of issueId -> issues it blocks
+ * @param inDegree - Map of issueId -> number of blockers
+ * @returns Sorted order and cycle information
+ */
+export function topologicalSort(adjacencyList, inDegree) {
+    const sorted = [];
+    // Create a working copy of in-degrees (we'll modify this)
+    const workingInDegree = new Map(inDegree);
+    // Initialize queue with all nodes having in-degree 0 (no blockers)
+    const queue = [];
+    for (const [id, degree] of workingInDegree) {
+        if (degree === 0) {
+            queue.push(id);
+        }
+    }
+    // Process nodes in topological order
+    while (queue.length > 0) {
+        const current = queue.shift();
+        sorted.push(current);
+        // For each issue that this one blocks, decrement their in-degree
+        const neighbors = adjacencyList.get(current) ?? [];
+        for (const neighbor of neighbors) {
+            const newDegree = (workingInDegree.get(neighbor) ?? 0) - 1;
+            workingInDegree.set(neighbor, newDegree);
+            // If neighbor now has no blockers, it's ready to process
+            if (newDegree === 0) {
+                queue.push(neighbor);
+            }
+        }
+    }
+    // Check if we processed all nodes
+    const totalNodes = adjacencyList.size;
+    if (sorted.length === totalNodes) {
+        return { sorted, cycles: null, valid: true };
+    }
+    // Cycles exist - find them
+    const cycles = findCycles(adjacencyList, workingInDegree);
+    return { sorted, cycles, valid: false };
+}
+// =============================================================================
+// Cycle Detection
+// =============================================================================
+/**
+ * Find all cycles in the graph using DFS.
+ *
+ * Called when topological sort fails to process all nodes,
+ * indicating cycles exist.
+ *
+ * @param adjacencyList - Map of issueId -> issues it blocks
+ * @param remainingInDegree - In-degrees after partial topo sort
+ * @returns Array of cycles, each cycle is an array of issue IDs
+ */
+function findCycles(adjacencyList, remainingInDegree) {
+    const cycles = [];
+    // Nodes still in cycles have remaining in-degree > 0
+    const nodesInCycles = new Set();
+    for (const [id, degree] of remainingInDegree) {
+        if (degree > 0) {
+            nodesInCycles.add(id);
+        }
+    }
+    if (nodesInCycles.size === 0) {
+        return cycles;
+    }
+    // Use DFS to find individual cycles
+    const visited = new Set();
+    const recursionStack = new Set();
+    const path = [];
+    function dfs(node) {
+        if (recursionStack.has(node)) {
+            // Found a cycle - extract it from the path
+            const cycleStart = path.indexOf(node);
+            if (cycleStart !== -1) {
+                const cycle = path.slice(cycleStart);
+                cycle.push(node); // Complete the cycle
+                cycles.push(cycle);
+            }
+            return;
+        }
+        if (visited.has(node) || !nodesInCycles.has(node)) {
+            return;
+        }
+        visited.add(node);
+        recursionStack.add(node);
+        path.push(node);
+        const neighbors = adjacencyList.get(node) ?? [];
+        for (const neighbor of neighbors) {
+            if (nodesInCycles.has(neighbor)) {
+                dfs(neighbor);
+            }
+        }
+        path.pop();
+        recursionStack.delete(node);
+    }
+    // Start DFS from each unvisited node in cycles
+    for (const node of nodesInCycles) {
+        if (!visited.has(node)) {
+            dfs(node);
+        }
+    }
+    return cycles;
+}
+// =============================================================================
+// Parallel Groups
+// =============================================================================
+/**
+ * Group issues by topological level for parallel execution.
+ *
+ * Issues at the same level have no dependencies between them
+ * and can be executed concurrently.
+ *
+ * @param sortedIds - Issue IDs in topological order
+ * @param adjacencyList - Map of issueId -> issues it blocks
+ * @param inDegree - Original in-degrees
+ * @returns Array of groups, each group can run in parallel
+ */
+export function findParallelGroups(sortedIds, adjacencyList, inDegree) {
+    if (sortedIds.length === 0) {
+        return [];
+    }
+    const groups = [];
+    // Track the level (distance from root) for each node
+    const level = new Map();
+    // Nodes with in-degree 0 are at level 0
+    for (const id of sortedIds) {
+        if ((inDegree.get(id) ?? 0) === 0) {
+            level.set(id, 0);
+        }
+    }
+    // Process in topological order to compute levels
+    for (const id of sortedIds) {
+        const currentLevel = level.get(id) ?? 0;
+        // Update levels of nodes this one blocks
+        const neighbors = adjacencyList.get(id) ?? [];
+        for (const neighbor of neighbors) {
+            const neighborLevel = level.get(neighbor) ?? 0;
+            // Neighbor's level is at least current + 1
+            level.set(neighbor, Math.max(neighborLevel, currentLevel + 1));
+        }
+    }
+    // Group nodes by level
+    const maxLevel = Math.max(...Array.from(level.values()), 0);
+    for (let l = 0; l <= maxLevel; l++) {
+        const group = [];
+        for (const id of sortedIds) {
+            if (level.get(id) === l) {
+                group.push(id);
+            }
+        }
+        if (group.length > 0) {
+            groups.push(group);
+        }
+    }
+    return groups;
+}
+// =============================================================================
+// Public API
+// =============================================================================
+/**
+ * Analyze dependencies between issues and return a complete dependency graph.
+ *
+ * This is the main entry point for workflow dependency analysis.
+ *
+ * @param db - Database connection
+ * @param issueIds - Issue IDs to analyze
+ * @returns Complete dependency graph with topological order and parallel groups
+ */
+export function analyzeDependencies(db, issueIds) {
+    // Build the graph
+    const graph = buildDependencyGraph(db, issueIds);
+    // Perform topological sort
+    const sortResult = topologicalSort(graph.adjacencyList, graph.inDegree);
+    // Compute parallel groups (only if no cycles)
+    const parallelGroups = sortResult.valid
+        ? findParallelGroups(sortResult.sorted, graph.adjacencyList, graph.inDegree)
+        : [];
+    return {
+        issueIds: graph.issueIds,
+        edges: graph.edges,
+        topologicalOrder: sortResult.sorted,
+        cycles: sortResult.cycles,
+        parallelGroups,
+    };
+}
+//# sourceMappingURL=dependency-analyzer.js.map

package/node_modules/@sudocode-ai/local-server/dist/workflow/dependency-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-analyzer.js","sourceRoot":"","sources":["../../src/workflow/dependency-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAE,wBAAwB,EAAE,MAAM,mDAAmD,CAAC;AAgC7F,gFAAgF;AAChF,iBAAiB;AACjB,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAClC,EAAqB,EACrB,QAAkB;IAElB,+CAA+C;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAE9C,6BAA6B;IAC7B,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;IAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,+DAA+D;IAC/D,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;QAChC,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,+CAA+C;IAC/C,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,gEAAgE;QAChE,qCAAqC;QACrC,MAAM,UAAU,GAAG,wBAAwB,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC5E,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,0DAA0D;YAC1D,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBACjC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC5C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,wDAAwD;QACxD,MAAM,aAAa,GAAG,wBAAwB,CAC5C,EAAE,EACF,OAAO,EACP,OAAO,EACP,YAAY,CACb,CAAC;QACF,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,wDAAwD;YACxD,2DAA2D;YAC3D,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,wBAAwB;gBACxB,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBACzD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;oBACjC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAC5C,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,cAAc;QACxB,KAAK;QACL,aAAa;QACb,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,sCAAsC;AACtC,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAC7B,aAAoC,EACpC,QAA6B;IAE7B,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,0DAA0D;IAC1D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAE1C,mEAAmE;IACnE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;QAC3C,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAErB,iEAAiE;QACjE,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACnD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3D,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEzC,yDAAyD;YACzD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;QACjC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAC/C,CAAC;IAED,2BAA2B;IAC3B,MAAM,MAAM,GAAG,UAAU,CAAC,aAAa,EAAE,eAAe,CAAC,CAAC;IAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1C,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;;;;;;;GASG;AACH,SAAS,UAAU,CACjB,aAAoC,EACpC,iBAAsC;IAEtC,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,qDAAqD;IACrD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;QAC7C,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,IAAI,aAAa,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,oCAAoC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,IAAY;QACvB,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,2CAA2C;YAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACrC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,qBAAqB;gBACvC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,OAAO;QACT,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAChD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,+CAA+C;IAC/C,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAChC,SAAmB,EACnB,aAAoC,EACpC,QAA6B;IAE7B,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,qDAAqD;IACrD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,wCAAwC;IACxC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAClC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAExC,yCAAyC;QACzC,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/C,2CAA2C;YAC3C,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,aAAa;AACb,gFAAgF;AAEhF;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,EAAqB,EACrB,QAAkB;IAElB,kBAAkB;IAClB,MAAM,KAAK,GAAG,oBAAoB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAEjD,2BAA2B;IAC3B,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAExE,8CAA8C;IAC9C,MAAM,cAAc,GAAG,UAAU,CAAC,KAAK;QACrC,CAAC,CAAC,kBAAkB,CAChB,UAAU,CAAC,MAAM,EACjB,KAAK,CAAC,aAAa,EACnB,KAAK,CAAC,QAAQ,CACf;QACH,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,UAAU,CAAC,MAAM;QACnC,MAAM,EAAE,UAAU,CAAC,MAAM;QACzB,cAAc;KACf,CAAC;AACJ,CAAC"}

package/node_modules/@sudocode-ai/local-server/dist/workflow/engines/orchestrator-engine.d.ts

@@ -0,0 +1,237 @@
+/**
+ * Orchestrator Workflow Engine
+ *
+ * Agent-managed workflow execution. The orchestrator is itself an execution
+ * (Claude Code agent) that controls workflow steps via MCP tools.
+ *
+ * Key differences from SequentialWorkflowEngine:
+ * - No internal execution loop - orchestrator agent handles execution
+ * - Wakeup mechanism - events trigger follow-up executions
+ * - MCP tools for step control - orchestrator uses workflow_* and execute_* tools
+ */
+import type Database from "better-sqlite3";
+import type { Workflow, WorkflowSource, WorkflowConfig } from "@sudocode-ai/types";
+import { BaseWorkflowEngine } from "../base-workflow-engine.js";
+import type { WorkflowEventEmitter } from "../workflow-event-emitter.js";
+import type { ExecutionService } from "../../services/execution-service.js";
+import type { ExecutionLifecycleService } from "../../services/execution-lifecycle.js";
+import type { WorkflowWakeupService } from "../services/wakeup-service.js";
+/**
+ * Configuration for the orchestrator engine.
+ */
+export interface OrchestratorEngineConfig {
+    /** Path to the repository root */
+    repoPath: string;
+    /** Path to the database file */
+    dbPath: string;
+    /** Path to the MCP server entry point */
+    mcpServerPath?: string;
+    /** Base URL of the server for MCP API calls (e.g., http://localhost:3000) */
+    serverUrl: string;
+    /** Project ID for API calls */
+    projectId: string;
+}
+/**
+ * Orchestrator Workflow Engine implementation.
+ *
+ * This engine spawns an orchestrator agent (Claude Code execution) that controls
+ * the workflow using MCP tools. The orchestrator makes decisions about:
+ * - Which issues to execute
+ * - How to handle failures
+ * - When to escalate to the user
+ *
+ * Events from step executions trigger "wakeups" - follow-up messages to the
+ * orchestrator that inform it of completed work.
+ *
+ * @example
+ * ```typescript
+ * const engine = new OrchestratorWorkflowEngine({
+ *   db,
+ *   executionService,
+ *   wakeupService,
+ *   config: {
+ *     repoPath: '/path/to/repo',
+ *     dbPath: '/path/to/.sudocode/cache.db',
+ *   },
+ * });
+ *
+ * // Create workflow from a goal
+ * const workflow = await engine.createWorkflow({
+ *   type: "goal",
+ *   goal: "Implement user authentication with OAuth"
+ * });
+ *
+ * // Start orchestrator
+ * await engine.startWorkflow(workflow.id);
+ * ```
+ */
+export declare class OrchestratorWorkflowEngine extends BaseWorkflowEngine {
+    private executionService;
+    private lifecycleService;
+    private wakeupService;
+    private promptBuilder;
+    private config;
+    private unregisterExecutionCallback?;
+    constructor(deps: {
+        db: Database.Database;
+        executionService: ExecutionService;
+        lifecycleService: ExecutionLifecycleService;
+        wakeupService: WorkflowWakeupService;
+        eventEmitter?: WorkflowEventEmitter;
+        config: OrchestratorEngineConfig;
+    });
+    /**
+     * Update the server URL after dynamic port discovery.
+     * Called by ProjectContext when the actual server port is known.
+     */
+    setServerUrl(serverUrl: string): void;
+    /**
+     * Get the wakeup service for registering await conditions.
+     * Used by the API endpoint for await_events MCP tool.
+     */
+    getWakeupService(): WorkflowWakeupService;
+    /**
+     * Set up callbacks to record workflow events when executions complete/fail.
+     *
+     * When an execution that belongs to a workflow completes or fails, we need to:
+     * 1. Find the corresponding workflow step
+     * 2. Update the step status
+     * 3. Record a workflow event (step_completed or step_failed)
+     * 4. Trigger a wakeup so the orchestrator can react
+     */
+    private setupExecutionCallbacks;
+    /**
+     * Clean up the execution callback when the engine is disposed.
+     */
+    dispose(): void;
+    /**
+     * Create a new workflow from a source definition.
+     *
+     * For orchestrator workflows, goal-based sources create empty workflows
+     * that the orchestrator populates dynamically.
+     *
+     * @param source - How to determine workflow scope (spec, issues, root_issue, or goal)
+     * @param config - Optional configuration overrides
+     * @returns The created workflow
+     * @throws WorkflowCycleError if dependency cycles are detected
+     */
+    createWorkflow(source: WorkflowSource, config?: Partial<WorkflowConfig>): Promise<Workflow>;
+    /**
+     * Start executing a pending workflow.
+     *
+     * Spawns an orchestrator execution (Claude Code agent) with workflow MCP tools.
+     * The orchestrator will use these tools to control step execution.
+     *
+     * @param workflowId - The workflow to start
+     * @throws WorkflowNotFoundError if workflow doesn't exist
+     * @throws WorkflowStateError if workflow is not in pending state
+     */
+    startWorkflow(workflowId: string): Promise<void>;
+    /**
+     * Pause a running workflow.
+     *
+     * Sets pause status and records an event. The orchestrator will be notified
+     * via wakeup when it checks workflow status.
+     *
+     * @param workflowId - The workflow to pause
+     * @throws WorkflowNotFoundError if workflow doesn't exist
+     * @throws WorkflowStateError if workflow is not running
+     */
+    pauseWorkflow(workflowId: string): Promise<void>;
+    /**
+     * Resume a paused workflow.
+     *
+     * Uses Claude Code's session resume to continue the orchestrator from where it left off.
+     * This preserves the full conversation history and context.
+     *
+     * @param workflowId - The workflow to resume
+     * @param message - Optional message to send with the resume (defaults to "Workflow resumed. Continue execution.")
+     * @throws WorkflowNotFoundError if workflow doesn't exist
+     * @throws WorkflowStateError if workflow is not paused
+     */
+    resumeWorkflow(workflowId: string, message?: string): Promise<void>;
+    /**
+     * Cancel a workflow, stopping the orchestrator and any running executions.
+     *
+     * @param workflowId - The workflow to cancel
+     * @throws WorkflowNotFoundError if workflow doesn't exist
+     * @throws WorkflowStateError if workflow is already completed/failed/cancelled
+     */
+    cancelWorkflow(workflowId: string): Promise<void>;
+    /**
+     * Retry a failed step.
+     *
+     * Records an event for the orchestrator to handle.
+     * The orchestrator decides how to actually retry.
+     *
+     * @param workflowId - The workflow containing the step
+     * @param stepId - The step to retry
+     * @throws WorkflowNotFoundError if workflow doesn't exist
+     * @throws WorkflowStepNotFoundError if step doesn't exist
+     */
+    retryStep(workflowId: string, stepId: string): Promise<void>;
+    /**
+     * Skip a step.
+     *
+     * Records an event for the orchestrator to handle.
+     * The orchestrator decides how to handle dependents.
+     *
+     * @param workflowId - The workflow containing the step
+     * @param stepId - The step to skip
+     * @param reason - Optional reason for skipping
+     * @throws WorkflowNotFoundError if workflow doesn't exist
+     * @throws WorkflowStepNotFoundError if step doesn't exist
+     */
+    skipStep(workflowId: string, stepId: string, reason?: string): Promise<void>;
+    /**
+     * Trigger a wakeup for an escalation response.
+     *
+     * Called by the API when a user responds to an escalation.
+     * Immediately triggers the orchestrator to resume with the response.
+     *
+     * @param workflowId - The workflow to wake up
+     */
+    triggerEscalationWakeup(workflowId: string): Promise<void>;
+    /**
+     * Spawn an orchestrator execution (Claude Code agent).
+     *
+     * The orchestrator is given:
+     * - Workflow MCP tools for control
+     * - Initial prompt with workflow context
+     * - Access to sudocode MCP tools for issue management
+     */
+    private spawnOrchestrator;
+    /**
+     * Build the orchestrator agent configuration.
+     *
+     * Configures MCP servers for workflow control and sudocode access.
+     * Enables dangerouslySkipPermissions for automated workflow execution.
+     */
+    private buildOrchestratorConfig;
+    /**
+     * Get issues for the workflow (for initial prompt).
+     */
+    private getIssuesForWorkflow;
+    /**
+     * Cancel ALL running executions for a workflow.
+     * This includes:
+     * 1. The entire orchestrator execution chain (root + all follow-ups)
+     * 2. All step executions linked to this workflow
+     */
+    private cancelAllWorkflowExecutions;
+    /**
+     * Recover orphaned workflows on server restart.
+     *
+     * Finds workflows in 'running' status whose orchestrator execution
+     * is no longer running, and triggers a wakeup to resume them.
+     */
+    recoverOrphanedWorkflows(): Promise<void>;
+    /**
+     * Mark stale running executions as failed.
+     *
+     * Called during recovery to clean up executions that were running
+     * when the server crashed.
+     */
+    markStaleExecutionsAsFailed(): Promise<void>;
+}
+//# sourceMappingURL=orchestrator-engine.d.ts.map

package/node_modules/@sudocode-ai/local-server/dist/workflow/engines/orchestrator-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"orchestrator-engine.d.ts","sourceRoot":"","sources":["../../../src/workflow/engines/orchestrator-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAI3C,OAAO,KAAK,EACV,QAAQ,EAER,cAAc,EACd,cAAc,EAIf,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAMhE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AACzE,OAAO,KAAK,EACV,gBAAgB,EAEjB,MAAM,qCAAqC,CAAC;AAC7C,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,uCAAuC,CAAC;AACvF,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AAY3E;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,kCAAkC;IAClC,QAAQ,EAAE,MAAM,CAAC;IACjB,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,yCAAyC;IACzC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,SAAS,EAAE,MAAM,CAAC;IAClB,+BAA+B;IAC/B,SAAS,EAAE,MAAM,CAAC;CACnB;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,qBAAa,0BAA2B,SAAQ,kBAAkB;IAChE,OAAO,CAAC,gBAAgB,CAAmB;IAC3C,OAAO,CAAC,gBAAgB,CAA4B;IACpD,OAAO,CAAC,aAAa,CAAwB;IAC7C,OAAO,CAAC,aAAa,CAAwB;IAC7C,OAAO,CAAC,MAAM,CAA2B;IACzC,OAAO,CAAC,2BAA2B,CAAC,CAAa;gBAErC,IAAI,EAAE;QAChB,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC;QACtB,gBAAgB,EAAE,gBAAgB,CAAC;QACnC,gBAAgB,EAAE,yBAAyB,CAAC;QAC5C,aAAa,EAAE,qBAAqB,CAAC;QACrC,YAAY,CAAC,EAAE,oBAAoB,CAAC;QACpC,MAAM,EAAE,wBAAwB,CAAC;KAClC;IAgBD;;;OAGG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IAIrC;;;OAGG;IACH,gBAAgB,IAAI,qBAAqB;IAQzC;;;;;;;;OAQG;IACH,OAAO,CAAC,uBAAuB;IAmE/B;;OAEG;IACH,OAAO,IAAI,IAAI;IAWf;;;;;;;;;;OAUG;IACG,cAAc,CAClB,MAAM,EAAE,cAAc,EACtB,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAC/B,OAAO,CAAC,QAAQ,CAAC;IA6CpB;;;;;;;;;OASG;IACG,aAAa,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAgDtD;;;;;;;;;OASG;IACG,aAAa,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAkCtD;;;;;;;;;;OAUG;IACG,cAAc,CAClB,UAAU,EAAE,MAAM,EAClB,OAAO,CAAC,EAAE,MAAM,GACf,OAAO,CAAC,IAAI,CAAC;IA8EhB;;;;;;OAMG;IACG,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAmCvD;;;;;;;;;;OAUG;IACG,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAoBlE;;;;;;;;;;;OAWG;IACG,QAAQ,CACZ,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,IAAI,CAAC;IAyBhB;;;;;;;OAOG;IACG,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAQhE;;;;;;;OAOG;YACW,iBAAiB;IAyC/B;;;;;OAKG;IACH,OAAO,CAAC,uBAAuB;IAiF/B;;OAEG;IACH,OAAO,CAAC,oBAAoB;IAa5B;;;;;OAKG;YACW,2BAA2B;IAwFzC;;;;;OAKG;IACG,wBAAwB,IAAI,OAAO,CAAC,IAAI,CAAC;IAiF/C;;;;;OAKG;IACG,2BAA2B,IAAI,OAAO,CAAC,IAAI,CAAC;CAqCnD"}