attocode 0.2.3 → 0.2.5

package/dist/src/integrations/tasks/smart-decomposer.d.ts

@@ -0,0 +1,316 @@
+/**
+ * Smart Task Decomposer Integration
+ *
+ * Uses LLM-assisted analysis for intelligent task decomposition.
+ * Replaces keyword-based decomposition with semantic understanding.
+ *
+ * Key features:
+ * - Semantic task analysis (understands intent, not just keywords)
+ * - Implicit dependency detection ("implement auth" needs "design schema")
+ * - Codebase-aware decomposition (considers existing structure)
+ * - Resource contention detection (identifies potential conflicts)
+ * - Dynamic strategy selection based on task characteristics
+ *
+ * Implementation split (Phase 3e):
+ * - task-splitter.ts — LLM-driven splitting logic (prompt + parsing)
+ * - dependency-analyzer.ts — Graph building + topological sort
+ * - smart-decomposer.ts — Core class, types, heuristics, factory (this file)
+ */
+import type { RepoMap, CodeChunk } from '../context/codebase-context.js';
+export { validateDecomposition, createDecompositionPrompt, parseDecompositionResponse, repairJSON, extractSubtasksFromNaturalLanguage, type DecompositionValidationResult, } from './task-splitter.js';
+export { buildDependencyGraph, detectCycles, topologicalSort, calculateParallelGroups, detectConflicts, } from './dependency-analyzer.js';
+/**
+ * A decomposed subtask with rich metadata.
+ */
+export interface SmartSubtask {
+    /** Unique identifier */
+    id: string;
+    /** Human-readable description */
+    description: string;
+    /** Current status */
+    status: SubtaskStatus;
+    /** IDs of tasks this depends on */
+    dependencies: string[];
+    /** Estimated complexity (1-10) */
+    complexity: number;
+    /** Estimated token budget needed */
+    estimatedTokens?: number;
+    /** Files likely to be involved */
+    relevantFiles?: string[];
+    /** Symbols/functions likely to be involved */
+    relevantSymbols?: string[];
+    /** Type of task */
+    type: SubtaskType;
+    /** Can be parallelized with other tasks */
+    parallelizable: boolean;
+    /** Resources this task will modify */
+    modifies?: string[];
+    /** Resources this task will read */
+    reads?: string[];
+    /** Suggested agent role */
+    suggestedRole?: string;
+    /** Additional notes */
+    notes?: string;
+}
+export type SubtaskStatus = 'pending' | 'ready' | 'blocked' | 'in_progress' | 'completed' | 'failed' | 'skipped';
+/** Known built-in task types (for autocomplete + defaults) */
+export type BuiltinSubtaskType = 'research' | 'analysis' | 'design' | 'implement' | 'test' | 'refactor' | 'review' | 'document' | 'integrate' | 'deploy' | 'merge';
+/** Any string is valid — custom types are first-class citizens. */
+export type SubtaskType = BuiltinSubtaskType | (string & {});
+/**
+ * A dependency graph for subtasks.
+ */
+export interface DependencyGraph {
+    /** Map of task ID to its dependencies */
+    dependencies: Map<string, string[]>;
+    /** Map of task ID to tasks that depend on it */
+    dependents: Map<string, string[]>;
+    /** Topological order of tasks */
+    executionOrder: string[];
+    /** Tasks that can be parallelized together */
+    parallelGroups: string[][];
+    /** Detected cycles (should be empty for valid graph) */
+    cycles: string[][];
+}
+/**
+ * Detected resource conflict.
+ */
+export interface ResourceConflict {
+    /** Resource that has a conflict */
+    resource: string;
+    /** Tasks that conflict */
+    taskIds: string[];
+    /** Type of conflict */
+    type: 'write-write' | 'read-write';
+    /** Severity */
+    severity: 'warning' | 'error';
+    /** Suggested resolution */
+    suggestion: string;
+}
+/**
+ * Result of smart decomposition.
+ */
+export interface SmartDecompositionResult {
+    /** Original task description */
+    originalTask: string;
+    /** Decomposed subtasks */
+    subtasks: SmartSubtask[];
+    /** Dependency graph */
+    dependencyGraph: DependencyGraph;
+    /** Detected resource conflicts */
+    conflicts: ResourceConflict[];
+    /** Strategy used */
+    strategy: DecompositionStrategy;
+    /** Overall estimated complexity */
+    totalComplexity: number;
+    /** Overall estimated tokens */
+    totalEstimatedTokens: number;
+    /** Decomposition metadata */
+    metadata: {
+        decomposedAt: Date;
+        codebaseAware: boolean;
+        llmAssisted: boolean;
+    };
+}
+export type DecompositionStrategy = 'sequential' | 'parallel' | 'hierarchical' | 'adaptive' | 'pipeline';
+/**
+ * Configuration for smart decomposer.
+ */
+export interface SmartDecomposerConfig {
+    /** Maximum number of subtasks */
+    maxSubtasks?: number;
+    /** Minimum complexity to trigger decomposition */
+    minComplexityToDecompose?: number;
+    /** Enable LLM-assisted analysis */
+    useLLM?: boolean;
+    /** LLM provider function */
+    llmProvider?: LLMDecomposeFunction;
+    /** Enable codebase-aware decomposition */
+    codebaseAware?: boolean;
+    /** Default strategy */
+    defaultStrategy?: DecompositionStrategy;
+    /** Detect resource conflicts */
+    detectConflicts?: boolean;
+}
+/**
+ * Function type for LLM-assisted decomposition.
+ */
+export type LLMDecomposeFunction = (task: string, context: DecomposeContext) => Promise<LLMDecomposeResult>;
+/**
+ * Context provided to the LLM for decomposition.
+ */
+export interface DecomposeContext {
+    /** Codebase structure if available */
+    repoMap?: RepoMap;
+    /** Relevant code chunks */
+    relevantCode?: CodeChunk[];
+    /** Previous decompositions for learning */
+    previousDecompositions?: SmartDecompositionResult[];
+    /** Hints about desired decomposition */
+    hints?: string[];
+}
+/**
+ * Result from LLM decomposition.
+ */
+export interface LLMDecomposeResult {
+    /** Suggested subtasks */
+    subtasks: Array<{
+        description: string;
+        type: SubtaskType;
+        complexity: number;
+        dependencies: string[];
+        parallelizable: boolean;
+        relevantFiles?: string[];
+        suggestedRole?: string;
+    }>;
+    /** Suggested strategy */
+    strategy: DecompositionStrategy;
+    /** Reasoning for the decomposition */
+    reasoning: string;
+    /** Parse error details when decomposition fails (undefined on success) */
+    parseError?: string;
+}
+/**
+ * Events emitted by the smart decomposer.
+ */
+export type SmartDecomposerEvent = {
+    type: 'decomposition.started';
+    task: string;
+} | {
+    type: 'decomposition.completed';
+    result: SmartDecompositionResult;
+} | {
+    type: 'llm.called';
+    task: string;
+} | {
+    type: 'llm.fallback';
+    reason: string;
+    task: string;
+} | {
+    type: 'conflict.detected';
+    conflict: ResourceConflict;
+} | {
+    type: 'cycle.detected';
+    cycle: string[];
+};
+export type SmartDecomposerEventListener = (event: SmartDecomposerEvent) => void;
+/**
+ * Intelligently decomposes tasks using semantic analysis.
+ *
+ * @example
+ * ```typescript
+ * const decomposer = createSmartDecomposer({
+ *   useLLM: true,
+ *   llmProvider: async (task, context) => {
+ *     // Call your LLM here
+ *     return { subtasks: [...], strategy: 'parallel', reasoning: '...' };
+ *   },
+ * });
+ *
+ * const result = await decomposer.decompose(
+ *   'Implement user authentication with OAuth2 and session management',
+ *   { repoMap }
+ * );
+ *
+ * console.log(`Decomposed into ${result.subtasks.length} subtasks`);
+ * console.log(`Strategy: ${result.strategy}`);
+ * ```
+ */
+export declare class SmartDecomposer {
+    private config;
+    private listeners;
+    private taskCounter;
+    constructor(config?: SmartDecomposerConfig);
+    /**
+     * Decompose a task into subtasks.
+     */
+    decompose(task: string, context?: DecomposeContext): Promise<SmartDecompositionResult>;
+    /**
+     * Convert LLM result to SmartSubtask array.
+     */
+    private convertLLMResult;
+    /**
+     * Heuristic-based decomposition when LLM is not available.
+     */
+    private decomposeHeuristic;
+    /**
+     * Infer the primary task type from description.
+     */
+    private inferTaskType;
+    /**
+     * Infer decomposition strategy from task description.
+     */
+    private inferStrategy;
+    /**
+     * Generate sequential subtasks.
+     */
+    private generateSequentialSubtasks;
+    /**
+     * Generate parallel subtasks.
+     */
+    private generateParallelSubtasks;
+    /**
+     * Generate hierarchical subtasks.
+     */
+    private generateHierarchicalSubtasks;
+    /**
+     * Generate pipeline subtasks.
+     */
+    private generatePipelineSubtasks;
+    /**
+     * Generate adaptive subtasks (mix of strategies).
+     */
+    private generateAdaptiveSubtasks;
+    /**
+     * Split task description into parts.
+     */
+    private splitIntoParts;
+    /**
+     * Enhance subtasks with codebase context.
+     */
+    private enhanceWithCodebaseContext;
+    /**
+     * Find files relevant to a task description.
+     */
+    private findRelevantFiles;
+    /**
+     * Build a dependency graph from subtasks.
+     * Delegates to standalone function in dependency-analyzer.ts.
+     */
+    buildDependencyGraph(subtasks: SmartSubtask[]): DependencyGraph;
+    /**
+     * Detect resource conflicts between subtasks.
+     * Delegates to standalone function in dependency-analyzer.ts.
+     */
+    detectConflicts(subtasks: SmartSubtask[]): ResourceConflict[];
+    /**
+     * Subscribe to events.
+     */
+    on(listener: SmartDecomposerEventListener): () => void;
+    private emit;
+}
+/**
+ * Create a smart decomposer.
+ *
+ * @example
+ * ```typescript
+ * // Simple heuristic decomposition
+ * const decomposer = createSmartDecomposer();
+ *
+ * // LLM-assisted decomposition
+ * const decomposer = createSmartDecomposer({
+ *   useLLM: true,
+ *   llmProvider: async (task, context) => {
+ *     const response = await llm.complete({
+ *       prompt: `Decompose this task: ${task}`,
+ *       // ...
+ *     });
+ *     return parseDecomposition(response);
+ *   },
+ * });
+ *
+ * const result = await decomposer.decompose('Build a REST API for user management');
+ * ```
+ */
+export declare function createSmartDecomposer(config?: SmartDecomposerConfig): SmartDecomposer;
+//# sourceMappingURL=smart-decomposer.d.ts.map

package/dist/src/integrations/tasks/smart-decomposer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"smart-decomposer.d.ts","sourceRoot":"","sources":["../../../../src/integrations/tasks/smart-decomposer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,gCAAgC,CAAC;AAazE,OAAO,EACL,qBAAqB,EACrB,yBAAyB,EACzB,0BAA0B,EAC1B,UAAU,EACV,kCAAkC,EAClC,KAAK,6BAA6B,GACnC,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,oBAAoB,EACpB,YAAY,EACZ,eAAe,EACf,uBAAuB,EACvB,eAAe,GAChB,MAAM,0BAA0B,CAAC;AAMlC;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,wBAAwB;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB;IACrB,MAAM,EAAE,aAAa,CAAC;IACtB,mCAAmC;IACnC,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,kCAAkC;IAClC,UAAU,EAAE,MAAM,CAAC;IACnB,oCAAoC;IACpC,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,kCAAkC;IAClC,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,8CAA8C;IAC9C,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,mBAAmB;IACnB,IAAI,EAAE,WAAW,CAAC;IAClB,2CAA2C;IAC3C,cAAc,EAAE,OAAO,CAAC;IACxB,sCAAsC;IACtC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,oCAAoC;IACpC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,2BAA2B;IAC3B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,uBAAuB;IACvB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,MAAM,aAAa,GACrB,SAAS,GACT,OAAO,GACP,SAAS,GACT,aAAa,GACb,WAAW,GACX,QAAQ,GACR,SAAS,CAAC;AAEd,8DAA8D;AAC9D,MAAM,MAAM,kBAAkB,GAC1B,UAAU,GACV,UAAU,GACV,QAAQ,GACR,WAAW,GACX,MAAM,GACN,UAAU,GACV,QAAQ,GACR,UAAU,GACV,WAAW,GACX,QAAQ,GACR,OAAO,CAAC;AAEZ,mEAAmE;AACnE,MAAM,MAAM,WAAW,GAAG,kBAAkB,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAE7D;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,yCAAyC;IACzC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACpC,gDAAgD;IAChD,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAClC,iCAAiC;IACjC,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,8CAA8C;IAC9C,cAAc,EAAE,MAAM,EAAE,EAAE,CAAC;IAC3B,wDAAwD;IACxD,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,mCAAmC;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,0BAA0B;IAC1B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,uBAAuB;IACvB,IAAI,EAAE,aAAa,GAAG,YAAY,CAAC;IACnC,eAAe;IACf,QAAQ,EAAE,SAAS,GAAG,OAAO,CAAC;IAC9B,2BAA2B;IAC3B,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,wBAAwB;IACvC,gCAAgC;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,0BAA0B;IAC1B,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,uBAAuB;IACvB,eAAe,EAAE,eAAe,CAAC;IACjC,kCAAkC;IAClC,SAAS,EAAE,gBAAgB,EAAE,CAAC;IAC9B,oBAAoB;IACpB,QAAQ,EAAE,qBAAqB,CAAC;IAChC,mCAAmC;IACnC,eAAe,EAAE,MAAM,CAAC;IACxB,+BAA+B;IAC/B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,6BAA6B;IAC7B,QAAQ,EAAE;QACR,YAAY,EAAE,IAAI,CAAC;QACnB,aAAa,EAAE,OAAO,CAAC;QACvB,WAAW,EAAE,OAAO,CAAC;KACtB,CAAC;CACH;AAED,MAAM,MAAM,qBAAqB,GAC7B,YAAY,GACZ,UAAU,GACV,cAAc,GACd,UAAU,GACV,UAAU,CAAC;AAEf;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,iCAAiC;IACjC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,kDAAkD;IAClD,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC,mCAAmC;IACnC,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,4BAA4B;IAC5B,WAAW,CAAC,EAAE,oBAAoB,CAAC;IACnC,0CAA0C;IAC1C,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,uBAAuB;IACvB,eAAe,CAAC,EAAE,qBAAqB,CAAC;IACxC,gCAAgC;IAChC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,CACjC,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,gBAAgB,KACtB,OAAO,CAAC,kBAAkB,CAAC,CAAC;AAEjC;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,sCAAsC;IACtC,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,2BAA2B;IAC3B,YAAY,CAAC,EAAE,SAAS,EAAE,CAAC;IAC3B,2CAA2C;IAC3C,sBAAsB,CAAC,EAAE,wBAAwB,EAAE,CAAC;IACpD,wCAAwC;IACxC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,yBAAyB;IACzB,QAAQ,EAAE,KAAK,CAAC;QACd,WAAW,EAAE,MAAM,CAAC;QACpB,IAAI,EAAE,WAAW,CAAC;QAClB,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,cAAc,EAAE,OAAO,CAAC;QACxB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;QACzB,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,yBAAyB;IACzB,QAAQ,EAAE,qBAAqB,CAAC;IAChC,sCAAsC;IACtC,SAAS,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAC5B;IAAE,IAAI,EAAE,uBAAuB,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,yBAAyB,CAAC;IAAC,MAAM,EAAE,wBAAwB,CAAA;CAAE,GACrE;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACtD;IAAE,IAAI,EAAE,mBAAmB,CAAC;IAAC,QAAQ,EAAE,gBAAgB,CAAA;CAAE,GACzD;IAAE,IAAI,EAAE,gBAAgB,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAEhD,MAAM,MAAM,4BAA4B,GAAG,CAAC,KAAK,EAAE,oBAAoB,KAAK,IAAI,CAAC;AAmCjF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,MAAM,CAAkC;IAChD,OAAO,CAAC,SAAS,CAAsC;IACvD,OAAO,CAAC,WAAW,CAAK;gBAEZ,MAAM,GAAE,qBAA0B;IAY9C;;OAEG;IACG,SAAS,CACb,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,gBAAqB,GAC7B,OAAO,CAAC,wBAAwB,CAAC;IAkGpC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IA6DxB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAmC1B;;OAEG;IACH,OAAO,CAAC,aAAa;IAWrB;;OAEG;IACH,OAAO,CAAC,aAAa;IAsDrB;;OAEG;IACH,OAAO,CAAC,0BAA0B;IA6ClC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAmChC;;OAEG;IACH,OAAO,CAAC,4BAA4B;IA6BpC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IA4BhC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAqDhC;;OAEG;IACH,OAAO,CAAC,cAAc;IAgCtB;;OAEG;IACH,OAAO,CAAC,0BAA0B;IAsBlC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAwCzB;;;OAGG;IACH,oBAAoB,CAAC,QAAQ,EAAE,YAAY,EAAE,GAAG,eAAe;IAQ/D;;;OAGG;IACH,eAAe,CAAC,QAAQ,EAAE,YAAY,EAAE,GAAG,gBAAgB,EAAE;IAQ7D;;OAEG;IACH,EAAE,CAAC,QAAQ,EAAE,4BAA4B,GAAG,MAAM,IAAI;IAQtD,OAAO,CAAC,IAAI;CASb;AAMD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,GAAE,qBAA0B,GACjC,eAAe,CAEjB"}