@defai.digital/ax-cli 2.7.0 → 2.8.0

package/dist/agent/dependency-resolver.js

@@ -0,0 +1,302 @@
+/**
+ * Dependency Resolver
+ *
+ * Resolves task dependencies and determines execution order for subagents.
+ * Implements topological sorting with cycle detection.
+ */
+/**
+ * DependencyResolver class for managing task dependencies
+ */
+export class DependencyResolver {
+    /**
+     * Resolve task dependencies and return execution batches
+     * Tasks in the same batch can be executed in parallel
+     *
+     * @param tasks Array of tasks to resolve
+     * @returns Array of batches, where each batch is an array of task IDs
+     */
+    resolveDependencies(tasks) {
+        // Build dependency graph
+        const graph = this.buildDependencyGraph(tasks);
+        // Check for cycles
+        if (this.hasCycle(graph)) {
+            throw new Error('Circular dependency detected in task graph');
+        }
+        // Perform topological sort
+        const sorted = this.topologicalSort(graph, tasks);
+        // Group into parallel batches
+        return this.groupIntoBatches(sorted, graph, tasks);
+    }
+    /**
+     * Validate that there are no circular dependencies
+     *
+     * @param tasks Array of tasks to validate
+     * @returns true if valid, false if circular dependencies exist
+     */
+    validateDependencies(tasks) {
+        try {
+            const graph = this.buildDependencyGraph(tasks);
+            return !this.hasCycle(graph);
+        }
+        catch (error) {
+            return false;
+        }
+    }
+    /**
+     * Get dependency graph structure
+     *
+     * @param tasks Array of tasks
+     * @returns DependencyGraph object with nodes and execution order
+     */
+    getDependencyGraph(tasks) {
+        const graph = this.buildDependencyGraph(tasks);
+        const hasCycles = this.hasCycle(graph);
+        if (hasCycles) {
+            const cycles = this.findCycles(graph, tasks);
+            return {
+                nodes: graph,
+                executionOrder: [],
+                hasCycles: true,
+                cycles,
+            };
+        }
+        const sorted = this.topologicalSort(graph, tasks);
+        const executionOrder = this.groupIntoBatches(sorted, graph, tasks);
+        return {
+            nodes: graph,
+            executionOrder,
+            hasCycles: false,
+        };
+    }
+    // ==================== Private Methods ====================
+    /**
+     * Build dependency graph from tasks
+     */
+    buildDependencyGraph(tasks) {
+        const graph = new Map();
+        // Initialize all nodes
+        for (const task of tasks) {
+            graph.set(task.id, {
+                taskId: task.id,
+                dependencies: task.dependencies || [],
+                dependents: [],
+                level: 0,
+            });
+        }
+        // Build dependent relationships
+        for (const task of tasks) {
+            if (task.dependencies) {
+                for (const depId of task.dependencies) {
+                    const depNode = graph.get(depId);
+                    if (depNode) {
+                        depNode.dependents.push(task.id);
+                    }
+                    else {
+                        throw new Error(`Task ${task.id} depends on non-existent task ${depId}`);
+                    }
+                }
+            }
+        }
+        return graph;
+    }
+    /**
+     * Perform topological sort using Kahn's algorithm
+     */
+    topologicalSort(graph, tasks) {
+        // Calculate in-degrees
+        const inDegree = new Map();
+        for (const [nodeId, node] of graph) {
+            inDegree.set(nodeId, node.dependencies.length);
+        }
+        // Find nodes with in-degree 0
+        const queue = [];
+        for (const [nodeId, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(nodeId);
+            }
+        }
+        // Process queue
+        const result = [];
+        while (queue.length > 0) {
+            // Sort by priority before processing
+            queue.sort((a, b) => {
+                const taskA = tasks.find(t => t.id === a);
+                const taskB = tasks.find(t => t.id === b);
+                return (taskB?.priority || 0) - (taskA?.priority || 0);
+            });
+            const nodeId = queue.shift();
+            result.push(nodeId);
+            const node = graph.get(nodeId);
+            for (const dependentId of node.dependents) {
+                const newDegree = inDegree.get(dependentId) - 1;
+                inDegree.set(dependentId, newDegree);
+                if (newDegree === 0) {
+                    queue.push(dependentId);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Group sorted tasks into parallel execution batches
+     */
+    groupIntoBatches(sorted, graph, tasks) {
+        const batches = [];
+        // Assign levels to each node
+        const levels = new Map();
+        for (const nodeId of sorted) {
+            const node = graph.get(nodeId);
+            let maxDepLevel = -1;
+            for (const depId of node.dependencies) {
+                const depLevel = levels.get(depId) || 0;
+                maxDepLevel = Math.max(maxDepLevel, depLevel);
+            }
+            const level = maxDepLevel + 1;
+            levels.set(nodeId, level);
+            node.level = level;
+        }
+        // Group by level
+        const maxLevel = Math.max(...Array.from(levels.values()));
+        for (let level = 0; level <= maxLevel; level++) {
+            const batch = [];
+            for (const [nodeId, nodeLevel] of levels) {
+                if (nodeLevel === level) {
+                    batch.push(nodeId);
+                }
+            }
+            if (batch.length > 0) {
+                // Sort by priority within batch
+                batch.sort((a, b) => {
+                    const taskA = tasks.find(t => t.id === a);
+                    const taskB = tasks.find(t => t.id === b);
+                    return (taskB?.priority || 0) - (taskA?.priority || 0);
+                });
+                batches.push(batch);
+            }
+        }
+        return batches;
+    }
+    /**
+     * Check if graph has cycles using DFS
+     */
+    hasCycle(graph) {
+        const visited = new Set();
+        const recursionStack = new Set();
+        for (const nodeId of graph.keys()) {
+            if (this.hasCycleUtil(nodeId, graph, visited, recursionStack)) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Utility function for cycle detection
+     */
+    hasCycleUtil(nodeId, graph, visited, recursionStack) {
+        if (recursionStack.has(nodeId)) {
+            return true; // Cycle detected
+        }
+        if (visited.has(nodeId)) {
+            return false; // Already processed
+        }
+        visited.add(nodeId);
+        recursionStack.add(nodeId);
+        const node = graph.get(nodeId);
+        for (const dependentId of node.dependents) {
+            if (this.hasCycleUtil(dependentId, graph, visited, recursionStack)) {
+                return true;
+            }
+        }
+        recursionStack.delete(nodeId);
+        return false;
+    }
+    /**
+     * Find all cycles in the graph
+     */
+    findCycles(graph, _tasks) {
+        const cycles = [];
+        const visited = new Set();
+        const recursionStack = [];
+        for (const nodeId of graph.keys()) {
+            if (!visited.has(nodeId)) {
+                this.findCyclesUtil(nodeId, graph, visited, recursionStack, cycles);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Utility function for finding cycles
+     */
+    findCyclesUtil(nodeId, graph, visited, recursionStack, cycles) {
+        visited.add(nodeId);
+        recursionStack.push(nodeId);
+        const node = graph.get(nodeId);
+        for (const dependentId of node.dependents) {
+            if (!visited.has(dependentId)) {
+                this.findCyclesUtil(dependentId, graph, visited, recursionStack, cycles);
+            }
+            else {
+                // Found a cycle
+                const cycleStart = recursionStack.indexOf(dependentId);
+                if (cycleStart !== -1) {
+                    const cycle = recursionStack.slice(cycleStart);
+                    cycle.push(dependentId); // Complete the cycle
+                    cycles.push(cycle);
+                }
+            }
+        }
+        recursionStack.pop();
+    }
+    /**
+     * Get execution level for a task
+     * Level 0 = no dependencies, Level N = depends on tasks at level N-1
+     */
+    getTaskLevel(taskId, tasks) {
+        const graph = this.buildDependencyGraph(tasks);
+        const node = graph.get(taskId);
+        if (!node) {
+            throw new Error(`Task ${taskId} not found`);
+        }
+        return node.level;
+    }
+    /**
+     * Get all tasks that can be executed in parallel
+     */
+    getParallelTasks(tasks) {
+        return this.resolveDependencies(tasks);
+    }
+    /**
+     * Check if a task can be executed given completed tasks
+     */
+    canExecuteTask(taskId, completedTaskIds, tasks) {
+        const task = tasks.find(t => t.id === taskId);
+        if (!task) {
+            return false;
+        }
+        if (!task.dependencies || task.dependencies.length === 0) {
+            return true;
+        }
+        // All dependencies must be completed
+        return task.dependencies.every(depId => completedTaskIds.has(depId));
+    }
+    /**
+     * Get tasks that are ready to execute
+     */
+    getReadyTasks(tasks, completedTaskIds) {
+        return tasks.filter(task => {
+            // Skip if already completed
+            if (completedTaskIds.has(task.id)) {
+                return false;
+            }
+            // Check if dependencies are met
+            return this.canExecuteTask(task.id, completedTaskIds, tasks);
+        });
+    }
+}
+/**
+ * Create a new dependency resolver instance
+ */
+export function createDependencyResolver() {
+    return new DependencyResolver();
+}
+//# sourceMappingURL=dependency-resolver.js.map

package/dist/agent/dependency-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../../src/agent/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAC7B;;;;;;OAMG;IACH,mBAAmB,CAAC,KAAqB;QACvC,yBAAyB;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE/C,mBAAmB;QACnB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAChE,CAAC;QAED,2BAA2B;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAElD,8BAA8B;QAC9B,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACH,oBAAoB,CAAC,KAAqB;QACxC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YAC/C,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,kBAAkB,CAAC,KAAqB;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEvC,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC7C,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,cAAc,EAAE,EAAE;gBAClB,SAAS,EAAE,IAAI;gBACf,MAAM;aACP,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAEnE,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,cAAc;YACd,SAAS,EAAE,KAAK;SACjB,CAAC;IACJ,CAAC;IAED,4DAA4D;IAE5D;;OAEG;IACK,oBAAoB,CAAC,KAAqB;QAChD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;QAEhD,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gBACjB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,EAAE;gBACrC,UAAU,EAAE,EAAE;gBACd,KAAK,EAAE,CAAC;aACT,CAAC,CAAC;QACL,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACtC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBACjC,IAAI,OAAO,EAAE,CAAC;wBACZ,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACnC,CAAC;yBAAM,CAAC;wBACN,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,iCAAiC,KAAK,EAAE,CAAC,CAAC;oBAC3E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,KAAkC,EAClC,KAAqB;QAErB,uBAAuB;QACvB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YACnC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QACjD,CAAC;QAED,8BAA8B;QAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACxC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,qCAAqC;YACrC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAClB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1C,OAAO,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAChC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC1C,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;gBAErC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,MAAgB,EAChB,KAAkC,EAClC,KAAqB;QAErB,MAAM,OAAO,GAAe,EAAE,CAAC;QAE/B,6BAA6B;QAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAChC,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;YAErB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACxC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;QAED,iBAAiB;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;YAE3B,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,MAAM,EAAE,CAAC;gBACzC,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,gCAAgC;gBAChC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBAClB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;oBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;oBAC1C,OAAO,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,CAAC;gBACzD,CAAC,CAAC,CAAC;gBAEH,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,KAAkC;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC;gBAC9D,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,MAAc,EACd,KAAkC,EAClC,OAAoB,EACpB,cAA2B;QAE3B,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,CAAC,iBAAiB;QAChC,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,CAAC,oBAAoB;QACpC,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAChC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC;gBACnE,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CAChB,KAAkC,EAClC,MAAsB;QAEtB,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAa,EAAE,CAAC;QAEpC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,MAAc,EACd,KAAkC,EAClC,OAAoB,EACpB,cAAwB,EACxB,MAAkB;QAElB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAChC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9B,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;YAC3E,CAAC;iBAAM,CAAC;gBACN,gBAAgB;gBAChB,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBACvD,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;oBACtB,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAC/C,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,qBAAqB;oBAC9C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,cAAc,CAAC,GAAG,EAAE,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,MAAc,EAAE,KAAqB;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,YAAY,CAAC,CAAC;QAC9C,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAqB;QACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,gBAA6B,EAAE,KAAqB;QACjF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QAE9C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,qCAAqC;QACrC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACvE,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAqB,EAAE,gBAA6B;QAChE,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACzB,4BAA4B;YAC5B,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClC,OAAO,KAAK,CAAC;YACf,CAAC;YAED,gCAAgC;YAChC,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB;IACtC,OAAO,IAAI,kBAAkB,EAAE,CAAC;AAClC,CAAC"}

package/dist/agent/llm-agent.d.ts

@@ -1,6 +1,8 @@
 import { LLMToolCall } from "../llm/client.js";
 import { ToolResult } from "../types/index.js";
 import { EventEmitter } from "events";
+import { CheckpointManager } from "../checkpoint/index.js";
+import { SubagentOrchestrator } from "./subagent-orchestrator.js";
 export interface ChatEntry {
     type: "user" | "assistant" | "tool_result" | "tool_call";
     content: string;
@@ -41,7 +43,10 @@ export declare class LLMAgent extends EventEmitter {
     private abortController;
     private maxToolRounds;
     private recentToolCalls;
+    private checkpointManager;
+    private subagentOrchestrator;
     constructor(apiKey: string, baseURL?: string, model?: string, maxToolRounds?: number);
+    private initializeCheckpointManager;
     private initializeMCP;
     private isGrokModel;
     /**
@@ -121,6 +126,64 @@ export declare class LLMAgent extends EventEmitter {
      * Returns a number between 0-100
      */
     getContextPercentage(): number;
+    /**
+     * Create a checkpoint of current state
+     */
+    createCheckpoint(description?: string): Promise<string>;
+    /**
+     * Rewind conversation to a checkpoint
+     */
+    rewindConversation(checkpointId: string): Promise<{
+        success: boolean;
+        error?: string;
+    }>;
+    /**
+     * Get checkpoint manager instance
+     */
+    getCheckpointManager(): CheckpointManager;
+    /**
+     * Get subagent orchestrator instance
+     */
+    getSubagentOrchestrator(): SubagentOrchestrator;
+    /**
+     * Spawn a specialized subagent for a specific task
+     * This is a user-facing method that simplifies subagent usage
+     *
+     * @param role - The role/specialization of the subagent
+     * @param description - Task description
+     * @param context - Optional additional context
+     * @returns The result of the subagent execution
+     */
+    spawnSubagent(role: string, description: string, context?: {
+        files?: string[];
+        additionalContext?: string;
+    }): Promise<{
+        success: boolean;
+        output: string;
+        filesModified?: string[];
+        filesCreated?: string[];
+        error?: string;
+    }>;
+    /**
+     * Execute multiple tasks in parallel using subagents
+     * This automatically handles dependency resolution and parallel execution
+     *
+     * @param tasks - Array of tasks with role and description
+     * @returns Array of results from all tasks
+     */
+    executeParallelTasks(tasks: Array<{
+        role: string;
+        description: string;
+        dependencies?: string[];
+        id?: string;
+    }>): Promise<Array<{
+        taskId: string;
+        success: boolean;
+        output: string;
+        filesModified?: string[];
+        filesCreated?: string[];
+        error?: string;
+    }>>;
     /**
      * Dispose of resources and remove event listeners
      * Call this when the agent is no longer needed