@defai.digital/ax-cli 4.4.6 → 4.4.10

package/dist/agent/dependency-resolver.js

@@ -1,366 +0,0 @@
-/**
- * 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 {
-            // Validation failed - treat as invalid dependencies
-            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);
-            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 = [];
-        // Create task lookup map for O(1) access
-        const taskMap = new Map(tasks.map(t => [t.id, t]));
-        let needsResorting = true; // PERFORMANCE FIX: Only resort when new nodes added
-        while (queue.length > 0) {
-            // PERFORMANCE FIX: Only sort when new elements were added, not every iteration
-            // This reduces complexity from O(n²log n) to O(n log n)
-            if (needsResorting) {
-                queue.sort((a, b) => {
-                    const taskA = taskMap.get(a);
-                    const taskB = taskMap.get(b);
-                    // Default to 0 priority if task not found (shouldn't happen in valid input)
-                    return (taskB?.priority ?? 0) - (taskA?.priority ?? 0);
-                });
-                needsResorting = false;
-            }
-            const nodeId = queue.shift();
-            if (!nodeId) {
-                throw new Error("Queue is empty but expected nodes");
-            }
-            result.push(nodeId);
-            const node = graph.get(nodeId);
-            if (!node) {
-                throw new Error(`Node ${nodeId} not found in graph`);
-            }
-            for (const dependentId of node.dependents) {
-                const currentDegree = inDegree.get(dependentId);
-                if (currentDegree === undefined) {
-                    throw new Error(`In-degree not found for dependent node ${dependentId}`);
-                }
-                const newDegree = currentDegree - 1;
-                inDegree.set(dependentId, newDegree);
-                if (newDegree === 0) {
-                    queue.push(dependentId);
-                    needsResorting = true; // PERFORMANCE FIX: Mark for resorting after adding elements
-                }
-            }
-        }
-        // BUG FIX: Verify all nodes were processed - if not, there's a cycle
-        // that hasCycle() may have missed (defensive programming)
-        if (result.length !== graph.size) {
-            const unprocessed = Array.from(graph.keys()).filter(id => !result.includes(id));
-            throw new Error(`Topological sort incomplete: ${unprocessed.length} nodes not processed. ` +
-                `This indicates a cycle involving: ${unprocessed.slice(0, 5).join(', ')}${unprocessed.length > 5 ? '...' : ''}`);
-        }
-        return result;
-    }
-    /**
-     * Group sorted tasks into parallel execution batches
-     */
-    groupIntoBatches(sorted, graph, tasks) {
-        const batches = [];
-        // REFACTOR: Create taskMap once at start instead of per-batch
-        const taskMap = new Map(tasks.map(t => [t.id, t]));
-        // Assign levels to each node
-        const levels = new Map();
-        for (const nodeId of sorted) {
-            const node = graph.get(nodeId);
-            if (!node) {
-                throw new Error(`Node ${nodeId} not found in graph during level assignment`);
-            }
-            let maxDepLevel = -1;
-            for (const depId of node.dependencies) {
-                // BUG FIX: Use explicit check instead of || 0
-                // levels.get() returns undefined for non-existent keys, but 0 for level 0
-                const depLevel = levels.get(depId);
-                if (depLevel === undefined) {
-                    // This shouldn't happen if graph is built correctly, but handle gracefully
-                    throw new Error(`Dependency ${depId} not found in levels map during batch grouping`);
-                }
-                maxDepLevel = Math.max(maxDepLevel, depLevel);
-            }
-            const level = maxDepLevel + 1;
-            levels.set(nodeId, level);
-            node.level = level;
-        }
-        // Group by level
-        // Handle empty levels case to prevent -Infinity from Math.max
-        if (levels.size === 0) {
-            return batches; // Return empty batches for empty task set
-        }
-        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 using pre-built taskMap
-                // BUG FIX: Use ?? instead of || for consistent null coalescing with numeric defaults
-                batch.sort((a, b) => {
-                    const taskA = taskMap.get(a);
-                    const taskB = taskMap.get(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);
-        if (!node) {
-            recursionStack.delete(nodeId);
-            return false; // Node not found, no cycle from this node
-        }
-        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
-     * BUG FIX: Removed unused _tasks parameter
-     */
-    findCycles(graph) {
-        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
-     * BUG FIX: Use separate Set for recursion stack tracking to avoid
-     * false positives when a node is visited from different paths
-     */
-    findCyclesUtil(nodeId, graph, visited, recursionStack, cycles, inStack = new Set()) {
-        visited.add(nodeId);
-        recursionStack.push(nodeId);
-        inStack.add(nodeId);
-        const node = graph.get(nodeId);
-        if (!node) {
-            recursionStack.pop();
-            inStack.delete(nodeId);
-            return; // Node not found, skip
-        }
-        for (const dependentId of node.dependents) {
-            if (!visited.has(dependentId)) {
-                this.findCyclesUtil(dependentId, graph, visited, recursionStack, cycles, inStack);
-            }
-            else if (inStack.has(dependentId)) {
-                // Found a cycle - only if the node is in current recursion stack
-                const cycleStart = recursionStack.indexOf(dependentId);
-                if (cycleStart !== -1) {
-                    const cycle = recursionStack.slice(cycleStart);
-                    cycle.push(dependentId); // Complete the cycle
-                    cycles.push(cycle);
-                }
-            }
-        }
-        recursionStack.pop();
-        inStack.delete(nodeId);
-    }
-    /**
-     * Get execution level for a task
-     * Level 0 = no dependencies, Level N = depends on tasks at level N-1
-     */
-    getTaskLevel(taskId, tasks) {
-        // Use getDependencyGraph to get properly calculated levels
-        const { nodes } = this.getDependencyGraph(tasks);
-        const node = nodes.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);
-    }
-    canExecuteTask(taskId, completedTaskIds, tasksOrMap) {
-        // Support both array (backward compat) and Map (performance) inputs
-        const task = Array.isArray(tasksOrMap)
-            ? tasksOrMap.find(t => t.id === taskId)
-            : tasksOrMap.get(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
-     * BUG FIX: Avoid calling canExecuteTask which does O(n) lookup per task
-     * Instead, inline the logic to avoid O(n²) complexity
-     */
-    getReadyTasks(tasks, completedTaskIds) {
-        return tasks.filter(task => {
-            // Skip if already completed
-            if (completedTaskIds.has(task.id)) {
-                return false;
-            }
-            // Check if dependencies are met (inlined to avoid O(n) lookup)
-            if (!task.dependencies || task.dependencies.length === 0) {
-                return true;
-            }
-            // All dependencies must be completed
-            return task.dependencies.every(depId => completedTaskIds.has(depId));
-        });
-    }
-}
-/**
- * Create a new dependency resolver instance
- */
-export function createDependencyResolver() {
-    return new DependencyResolver();
-}
-//# sourceMappingURL=dependency-resolver.js.map

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

@@ -1 +0,0 @@
-{"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,MAAM,CAAC;YACP,oDAAoD;YACpD,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,CAAC,CAAC;YACtC,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,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,IAAI,cAAc,GAAG,IAAI,CAAC,CAAC,oDAAoD;QAE/E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,+EAA+E;YAC/E,wDAAwD;YACxD,IAAI,cAAc,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBAClB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7B,4EAA4E;oBAC5E,OAAO,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,CAAC;gBACzD,CAAC,CAAC,CAAC;gBACH,cAAc,GAAG,KAAK,CAAC;YACzB,CAAC;YAED,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACvD,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,qBAAqB,CAAC,CAAC;YACvD,CAAC;YACD,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAChD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;oBAChC,MAAM,IAAI,KAAK,CAAC,0CAA0C,WAAW,EAAE,CAAC,CAAC;gBAC3E,CAAC;gBACD,MAAM,SAAS,GAAG,aAAa,GAAG,CAAC,CAAC;gBACpC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;gBAErC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBACxB,cAAc,GAAG,IAAI,CAAC,CAAC,4DAA4D;gBACrF,CAAC;YACH,CAAC;QACH,CAAC;QAED,qEAAqE;QACrE,0DAA0D;QAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;YACjC,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAChF,MAAM,IAAI,KAAK,CACb,gCAAgC,WAAW,CAAC,MAAM,wBAAwB;gBAC1E,qCAAqC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAChH,CAAC;QACJ,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,8DAA8D;QAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnD,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,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,6CAA6C,CAAC,CAAC;YAC/E,CAAC;YACD,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;YAErB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,8CAA8C;gBAC9C,0EAA0E;gBAC1E,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,2EAA2E;oBAC3E,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,gDAAgD,CAAC,CAAC;gBACvF,CAAC;gBACD,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,8DAA8D;QAC9D,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,OAAO,CAAC,CAAC,0CAA0C;QAC5D,CAAC;QACD,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,wDAAwD;gBACxD,qFAAqF;gBACrF,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBAClB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7B,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,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,OAAO,KAAK,CAAC,CAAC,0CAA0C;QAC1D,CAAC;QAED,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;;;OAGG;IACK,UAAU,CAChB,KAAkC;QAElC,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;;;;OAIG;IACK,cAAc,CACpB,MAAc,EACd,KAAkC,EAClC,OAAoB,EACpB,cAAwB,EACxB,MAAkB,EAClB,UAAuB,IAAI,GAAG,EAAE;QAEhC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,cAAc,CAAC,GAAG,EAAE,CAAC;YACrB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,CAAC,uBAAuB;QACjC,CAAC;QAED,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,EAAE,OAAO,CAAC,CAAC;YACpF,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACpC,iEAAiE;gBACjE,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;QACrB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,MAAc,EAAE,KAAqB;QAChD,2DAA2D;QAC3D,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACjD,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;IAQD,cAAc,CACZ,MAAc,EACd,gBAA6B,EAC7B,UAAsD;QAEtD,oEAAoE;QACpE,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;YACpC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC;YACvC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE3B,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;;;;OAIG;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,+DAA+D;YAC/D,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzD,OAAO,IAAI,CAAC;YACd,CAAC;YAED,qCAAqC;YACrC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB;IACtC,OAAO,IAAI,kBAAkB,EAAE,CAAC;AAClC,CAAC"}

package/dist/agent/execution/index.d.ts

@@ -1,9 +0,0 @@
-/**
- * Agent Execution Module
- *
- * Tool execution and management for the LLM Agent system.
- *
- * @packageDocumentation
- */
-export { ToolExecutor } from './tool-executor.js';
-export type { ToolExecutorConfig } from './tool-executor.js';

package/dist/agent/execution/index.js

@@ -1,9 +0,0 @@
-/**
- * Agent Execution Module
- *
- * Tool execution and management for the LLM Agent system.
- *
- * @packageDocumentation
- */
-export { ToolExecutor } from './tool-executor.js';
-//# sourceMappingURL=index.js.map

package/dist/agent/execution/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/agent/execution/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/agent/execution/tool-executor.d.ts

@@ -1,93 +0,0 @@
-/**
- * Tool Executor
- *
- * Handles execution of tool calls from the LLM.
- * Extracted from llm-agent.ts for better separation of concerns.
- *
- * @packageDocumentation
- */
-import type { LLMToolCall } from "../../llm/client.js";
-import type { ToolResult } from "../../types/index.js";
-import { TextEditorTool, BashTool, TodoTool } from "../../tools/index.js";
-import type { ToolParseResult } from "../core/types.js";
-/**
- * Tool executor configuration
- */
-export interface ToolExecutorConfig {
-    /** Callback for checkpoint creation on file edits */
-    checkpointCallback?: (files: Array<{
-        path: string;
-        content: string;
-    }>, description: string) => Promise<void>;
-    /** Callback when ax_agent starts executing */
-    onAxAgentStart?: (agentName: string) => void;
-    /** Callback when ax_agent finishes executing */
-    onAxAgentEnd?: (agentName: string) => void;
-}
-/**
- * Tool Executor
- *
- * Manages tool instances and executes tool calls from the LLM.
- * Supports built-in tools and MCP (Model Context Protocol) tools.
- */
-export declare class ToolExecutor {
-    private textEditor;
-    private bash;
-    private bashOutput;
-    private todoTool;
-    private search;
-    private _designTool?;
-    private onAxAgentStart?;
-    private onAxAgentEnd?;
-    private static getString;
-    private static getNumber;
-    private static getBoolean;
-    private static getEnum;
-    constructor(config?: ToolExecutorConfig);
-    /**
-     * Lazy-loaded getter for DesignTool
-     * Only instantiates when first accessed to reduce startup time
-     */
-    private get designTool();
-    /**
-     * Parse and validate tool call arguments
-     * @param toolCall The tool call to parse arguments from
-     * @param toolType Type of tool (for error messages)
-     * @returns Parsed arguments or error result
-     */
-    parseToolArguments(toolCall: LLMToolCall, toolType?: string): ToolParseResult;
-    /**
-     * Execute a tool call with hooks integration
-     */
-    execute(toolCall: LLMToolCall): Promise<ToolResult>;
-    /**
-     * Format AutomatosX agent NDJSON output to human-readable format
-     * @param ndjsonOutput Raw NDJSON output from AutomatosX agent
-     * @returns Formatted output string
-     */
-    private formatAutomatosXOutput;
-    /**
-     * Check if output looks like AutomatosX NDJSON
-     */
-    private isAutomatosXOutput;
-    /**
-     * Execute an MCP tool
-     */
-    private executeMCPTool;
-    /**
-     * Get the bash tool instance (for direct access)
-     */
-    getBashTool(): BashTool;
-    /**
-     * Get the todo tool instance (for planning integration)
-     */
-    getTodoTool(): TodoTool;
-    /**
-     * Get the text editor tool instance
-     */
-    getTextEditorTool(): TextEditorTool;
-    /**
-     * Dispose of resources
-     */
-    dispose(): void;
-}