compact-agent 1.1.0

package/dist/autonomous-loops.js

@@ -0,0 +1,526 @@
+/**
+ * Autonomous loop execution system for iterative workflows.
+ * Inspired by everything-claude-code: enables VerificationLoop, PRReviewLoop,
+ * SequentialPipeline, and DAGOrchestration patterns.
+ */
+import chalk from 'chalk';
+/**
+ * Build a prompt for iterative PR review.
+ * Instructs the agent to review the PR, address comments, and re-review until approved.
+ */
+export function buildPRLoopPrompt(cwd) {
+    return `You are a thorough code reviewer in an autonomous PR review loop.
+
+Working directory: ${cwd}
+
+Your task is to:
+1. Review the current PR changes
+2. Identify issues, improvements, or feedback
+3. Suggest fixes or clarifications
+4. After fixes are applied, re-review until you approve
+
+Loop Instructions:
+- On each iteration, provide clear, actionable feedback
+- Mark feedback as CRITICAL, MAJOR, or MINOR
+- Track which issues have been resolved
+- When all issues are resolved, respond with: "PR_APPROVED"
+- If no changes are made after feedback, respond with: "NO_CHANGES_DETECTED"
+- Maximum 5 iterations allowed
+
+Format your response as:
+\`\`\`
+## Review Iteration [N]
+### Issues Found:
+- [issue]: [description]
+
+### Approved: [yes/no]
+### Next Steps: [what needs fixing]
+\`\`\``;
+}
+/**
+ * Build a prompt for sequential pipeline execution.
+ * Each task can reference the output of prior tasks.
+ */
+export function buildSequentialPipelinePrompt(tasks) {
+    const taskList = tasks
+        .map((task, i) => `${i + 1}. ${task}`)
+        .join('\n');
+    return `Execute the following tasks sequentially. Each task can reference the output of prior tasks.
+
+## Tasks:
+${taskList}
+
+## Execution Rules:
+- Run tasks in the specified order
+- Each task sees all prior outputs
+- After completing each task, summarize the result
+- If a task fails, explain the error and attempt recovery
+- Continue to the next task even if recovery is partial (unless critical)
+
+For each task, format your response:
+\`\`\`
+## Task [N]: [name]
+### Input from prior tasks: [summary or "none"]
+### Execution:
+[your work here]
+
+### Result:
+[clear summary of what was accomplished]
+
+### Status: [success/partial/failed]
+\`\`\`
+
+After all tasks, provide a final summary of the entire pipeline.`;
+}
+/**
+ * Build a prompt for DAG (directed acyclic graph) execution.
+ * Steps run in dependency order, potentially in parallel where possible.
+ */
+export function buildDAGPrompt(dag) {
+    const stepList = dag.steps
+        .map((step) => `- ${step.id} (${step.name}): ${step.task}${step.dependsOn.length > 0 ? ` [depends on: ${step.dependsOn.join(', ')}]` : ''}`)
+        .join('\n');
+    const strategyDescription = dag.strategy === 'parallel-max'
+        ? 'Run steps in parallel whenever dependencies allow.'
+        : dag.strategy === 'sequential'
+            ? 'Run steps one at a time in dependency order.'
+            : 'Run steps in topological layers for optimal parallelism.';
+    return `Execute the following task graph (DAG). Each step may depend on prior steps.
+
+## Task Graph:
+${stepList}
+
+## Strategy: ${dag.strategy}
+${strategyDescription}
+
+## Execution Rules:
+- Respect all dependency relationships
+- Skip a step if its dependency failed (mark as skipped)
+- For parallel execution, run independent steps concurrently
+- Capture the result of each step for dependent steps to use
+- On error, log clearly and continue (unless critical)
+
+For each step, format your response:
+\`\`\`
+## Step: [id] - [name]
+### Dependencies: [list of completed prior steps or "none"]
+### Execution:
+[your work here]
+
+### Result:
+[clear output]
+
+### Status: [success/skipped/failed]
+\`\`\`
+
+After all steps, provide a final summary of the DAG execution.`;
+}
+/**
+ * Topological sort of PipelineStep array.
+ * Returns an array of arrays, where each inner array is an execution layer.
+ * Steps in the same layer have no inter-dependencies and can run in parallel.
+ */
+export function topologicalSort(steps) {
+    const layers = [];
+    const stepMap = new Map(steps.map((s) => [s.id, s]));
+    const visited = new Set();
+    const inProgress = new Set();
+    function visit(step, depth) {
+        if (visited.has(step.id)) {
+            // Already processed; find which layer it's in
+            for (let i = 0; i < layers.length; i++) {
+                if (layers[i].some((s) => s.id === step.id)) {
+                    return i;
+                }
+            }
+            return 0;
+        }
+        if (inProgress.has(step.id)) {
+            throw new Error(`Circular dependency detected at step ${step.id}`);
+        }
+        inProgress.add(step.id);
+        // Visit all dependencies first
+        let maxDepth = depth;
+        for (const depId of step.dependsOn) {
+            const dep = stepMap.get(depId);
+            if (dep) {
+                const depDepth = visit(dep, depth + 1);
+                maxDepth = Math.max(maxDepth, depDepth + 1);
+            }
+        }
+        inProgress.delete(step.id);
+        visited.add(step.id);
+        // Ensure we have enough layers
+        while (layers.length <= maxDepth) {
+            layers.push([]);
+        }
+        // Add this step to its layer
+        layers[maxDepth].push(step);
+        return maxDepth;
+    }
+    for (const step of steps) {
+        if (!visited.has(step.id)) {
+            visit(step, 0);
+        }
+    }
+    return layers;
+}
+/**
+ * Pretty-print the status of a DAG using chalk colors.
+ */
+export function printDAGStatus(dag) {
+    console.log(chalk.cyan('\n  ═══ DAG Execution Status ═══\n'));
+    const stepMap = new Map(dag.steps.map((s) => [s.id, s]));
+    const layers = topologicalSort(dag.steps);
+    for (let layerIdx = 0; layerIdx < layers.length; layerIdx++) {
+        const layer = layers[layerIdx];
+        console.log(chalk.blue(`  Layer ${layerIdx + 1}:`));
+        for (const step of layer) {
+            const icon = step.status === 'done'
+                ? chalk.green('✓')
+                : step.status === 'error'
+                    ? chalk.red('✗')
+                    : step.status === 'running'
+                        ? chalk.yellow('⟳')
+                        : step.status === 'skipped'
+                            ? chalk.dim('─')
+                            : chalk.dim('○');
+            const elapsed = step.startedAt && step.finishedAt
+                ? `${((step.finishedAt - step.startedAt) / 1000).toFixed(1)}s`
+                : '';
+            const deps = step.dependsOn.length > 0 ? ` [deps: ${step.dependsOn.join(', ')}]` : '';
+            console.log(`    ${icon} ${step.id.padEnd(20)} ${step.name.padEnd(25)} ${elapsed.padEnd(8)}${deps}`);
+            if (step.error) {
+                console.log(chalk.red(`       Error: ${step.error.slice(0, 60)}`));
+            }
+        }
+        console.log();
+    }
+}
+/**
+ * Build a prompt for multi-agent task decomposition.
+ * Instructs the agent to break down a task into subtasks for parallel/sequential execution.
+ */
+export function buildMultiPlanPrompt(task) {
+    return `Decompose the following task into 2-5 independent subtasks that can be executed in parallel or sequence:
+
+Task: ${task}
+
+For each subtask, provide:
+1. Subtask ID (e.g., "backend-setup")
+2. Subtask name
+3. Clear description of what to do
+4. Any dependencies on other subtasks (or "none")
+5. Estimated complexity: low/medium/high
+
+Format as JSON array:
+[
+  {
+    "id": "subtask-id",
+    "name": "Subtask Name",
+    "description": "What this subtask does",
+    "dependsOn": ["other-id"] or [],
+    "complexity": "low|medium|high"
+  },
+  ...
+]
+
+Only output the JSON, no explanation.`;
+}
+/**
+ * Build a prompt for executing a multi-agent plan.
+ * Takes a JSON plan and generates execution instructions.
+ */
+export function buildMultiExecutePrompt(plan) {
+    return `Execute the following task plan. Each subtask may have dependencies.
+
+## Plan:
+${plan}
+
+## Execution Instructions:
+1. Parse the plan to understand subtask dependencies
+2. Execute subtasks in order (respecting dependencies)
+3. For independent subtasks, you may mention running them in parallel
+4. After completing each subtask, summarize its result
+5. If a subtask fails, attempt recovery or skip dependent tasks
+6. Provide a final summary of all subtask results
+
+Format each subtask execution as:
+\`\`\`
+## Subtask: [id] - [name]
+### Execution:
+[your work]
+
+### Result:
+[output]
+
+### Status: [success/failed/skipped]
+\`\`\``;
+}
+/**
+ * Build a prompt for orchestrating backend service changes.
+ * Useful for coordinating changes across multiple backend services.
+ */
+export function buildMultiBackendPrompt(services) {
+    const serviceList = services.map((s, i) => `${i + 1}. ${s}`).join('\n');
+    return `You are orchestrating changes across multiple backend services.
+
+## Services to coordinate:
+${serviceList}
+
+## Coordination Rules:
+1. Identify dependencies between services (if service A depends on service B, B must be updated first)
+2. Group changes by update type (API changes, database migrations, configuration)
+3. Create a safe update sequence that minimizes downtime
+4. For each service, specify:
+   - What changes are needed
+   - Any pre-requisites or migrations
+   - Testing strategy
+   - Rollback plan
+
+5. Consider:
+   - API compatibility (version gates if needed)
+   - Database schema compatibility
+   - Gradual rollout vs. big bang
+   - Health checks and monitoring
+
+Format your response:
+\`\`\`
+## Update Plan
+
+### Phase 1: Preparation
+- Service changes to make
+- Migrations to run
+- Infrastructure checks
+
+### Phase 2: Gradual Rollout
+- Service update order
+- Health checks between updates
+- Rollback triggers
+
+### Phase 3: Validation
+- Integration tests to run
+- Metrics to monitor
+- Success criteria
+\`\`\``;
+}
+/**
+ * Build a prompt for orchestrating frontend component changes.
+ * Useful for coordinating changes across multiple frontend components.
+ */
+export function buildMultiFrontendPrompt(components) {
+    const componentList = components.map((c, i) => `${i + 1}. ${c}`).join('\n');
+    return `You are orchestrating changes across multiple frontend components.
+
+## Components to coordinate:
+${componentList}
+
+## Coordination Rules:
+1. Map component dependencies (if ComponentA uses ComponentB, B must be updated first)
+2. Identify shared state or context that multiple components use
+3. Plan the update sequence to maintain app stability
+4. For each component, specify:
+   - Props/API changes needed
+   - State management updates
+   - CSS/styling updates
+   - Test coverage needed
+
+5. Consider:
+   - Backward compatibility (graceful degradation)
+   - Build system impact
+   - Bundle size implications
+   - Visual regression testing
+
+Format your response:
+\`\`\`
+## Component Update Plan
+
+### Dependency Graph
+[List component dependencies]
+
+### Update Sequence
+[Order of component updates]
+
+### Per-Component Changes
+For each component:
+- Props/API changes
+- State updates
+- Styling updates
+- Tests to add/update
+
+### Integration Testing
+[How to verify components work together]
+
+### Rollback Plan
+[If something breaks]
+\`\`\``;
+}
+/**
+ * Build a general autonomous loop prompt.
+ * Supports various loop types: verification, review, exploration, convergence, etc.
+ */
+export function buildLoopOperatorPrompt(task, loopType) {
+    const loopInstructions = getLoopTypeInstructions(loopType);
+    return `You are running an autonomous loop of type: ${loopType}
+
+Task: ${task}
+
+## Loop Operating System:
+${loopInstructions}
+
+## General Loop Rules:
+1. Each iteration, perform the loop action and evaluate the stopping condition
+2. If the stopping condition is met, output "LOOP_COMPLETE" and summarize
+3. If the stopping condition is not met, iterate again
+4. Maximum 10 iterations allowed (unless specified otherwise)
+5. After each iteration, provide a status update
+
+Format each iteration as:
+\`\`\`
+## Iteration [N]
+### Action:
+[what you did]
+
+### Evaluation:
+[did the stopping condition pass?]
+
+### Status:
+[continue/complete]
+\`\`\`
+
+After loop completion, provide a final summary.`;
+}
+/**
+ * Helper function to generate loop-type-specific instructions.
+ */
+function getLoopTypeInstructions(loopType) {
+    const instructions = {
+        verification: `
+This is a VERIFICATION LOOP:
+1. Run tests for the target code
+2. If tests pass, stopping condition is met (LOOP_COMPLETE)
+3. If tests fail, identify the issue and propose a fix
+4. Apply the fix and re-run tests
+5. Iterate until tests pass or max iterations reached
+    `,
+        review: `
+This is a REVIEW LOOP:
+1. Review the current state/code/design
+2. Identify issues, gaps, or improvements
+3. If no issues found, stopping condition is met (LOOP_COMPLETE)
+4. If issues found, address them one by one
+5. Re-review after fixes and iterate until all issues resolved
+    `,
+        exploration: `
+This is an EXPLORATION LOOP:
+1. Explore the current state to understand it
+2. Ask clarifying questions or gather information
+3. If sufficient understanding is achieved, stopping condition is met (LOOP_COMPLETE)
+4. If gaps remain, dig deeper or investigate specific areas
+5. Repeat until you have a complete mental model
+    `,
+        convergence: `
+This is a CONVERGENCE LOOP:
+1. Generate or refine a solution
+2. Evaluate it against criteria
+3. If it meets all criteria, stopping condition is met (LOOP_COMPLETE)
+4. If gaps remain, identify what needs improvement
+5. Refine the solution and re-evaluate
+6. Iterate until solution converges to acceptable quality
+    `,
+        debugging: `
+This is a DEBUGGING LOOP:
+1. Identify the symptom or error
+2. Form a hypothesis about the root cause
+3. Test the hypothesis with evidence
+4. If confirmed, stopping condition is met (LOOP_COMPLETE)
+5. If not confirmed, form a new hypothesis
+6. Iterate until root cause is identified and explained
+    `,
+        optimization: `
+This is an OPTIMIZATION LOOP:
+1. Measure the current performance or quality metric
+2. Identify opportunities to improve
+3. Apply an optimization
+4. Re-measure and check for improvement
+5. If metric reaches target, stopping condition is met (LOOP_COMPLETE)
+6. If not, apply another optimization
+7. Iterate until target is reached or diminishing returns found
+    `,
+        default: `
+This is a GENERIC AUTONOMOUS LOOP:
+1. On each iteration, work toward the task goal
+2. Evaluate progress: Are you closer to completion?
+3. If task is complete, stopping condition is met (LOOP_COMPLETE)
+4. If not, identify next steps and continue
+5. Iterate until task is complete or max iterations reached
+    `,
+    };
+    return instructions[loopType] || instructions['default'];
+}
+/**
+ * Helper function to compute the status of all steps in a DAG.
+ * Returns a summary string for logging.
+ */
+export function summarizeDAGStatus(dag) {
+    const totalSteps = dag.steps.length;
+    const doneSteps = dag.steps.filter((s) => s.status === 'done').length;
+    const errorSteps = dag.steps.filter((s) => s.status === 'error').length;
+    const skippedSteps = dag.steps.filter((s) => s.status === 'skipped').length;
+    const runningSteps = dag.steps.filter((s) => s.status === 'running').length;
+    const pendingSteps = dag.steps.filter((s) => s.status === 'pending').length;
+    const parts = [];
+    if (doneSteps > 0)
+        parts.push(chalk.green(`${doneSteps} done`));
+    if (errorSteps > 0)
+        parts.push(chalk.red(`${errorSteps} error`));
+    if (skippedSteps > 0)
+        parts.push(chalk.dim(`${skippedSteps} skipped`));
+    if (runningSteps > 0)
+        parts.push(chalk.yellow(`${runningSteps} running`));
+    if (pendingSteps > 0)
+        parts.push(chalk.dim(`${pendingSteps} pending`));
+    return `DAG: ${totalSteps} total steps [${parts.join(', ')}]`;
+}
+/**
+ * Helper function to check if a DAG has completed successfully.
+ */
+export function isDAGComplete(dag) {
+    return (dag.steps.every((s) => s.status === 'done' || s.status === 'skipped' || s.status === 'error') &&
+        dag.steps.some((s) => s.status === 'done'));
+}
+/**
+ * Helper function to check if a DAG has failed.
+ */
+export function hasDAGFailed(dag) {
+    return dag.steps.some((s) => s.status === 'error');
+}
+/**
+ * Helper function to collect all results from a completed DAG.
+ */
+export function collectDAGResults(dag) {
+    const results = {};
+    for (const step of dag.steps) {
+        results[step.id] = step.result;
+    }
+    return results;
+}
+/**
+ * Helper function to format a DAG as a readable plan.
+ */
+export function formatDAGAsPlan(dag) {
+    const layers = topologicalSort(dag.steps);
+    const lines = ['# Execution Plan\n'];
+    for (let i = 0; i < layers.length; i++) {
+        const layer = layers[i];
+        lines.push(`## Layer ${i + 1} (Parallel Execution Possible)\n`);
+        for (const step of layer) {
+            const deps = step.dependsOn.length > 0 ? ` depends on [${step.dependsOn.join(', ')}]` : '';
+            lines.push(`- **${step.id}**: ${step.name}${deps}`);
+            lines.push(`  - Task: ${step.task}`);
+        }
+        lines.push('');
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=autonomous-loops.js.map

package/dist/autonomous-loops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"autonomous-loops.js","sourceRoot":"","sources":["../src/autonomous-loops.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,MAAM,OAAO,CAAC;AAiD1B;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,OAAO;;qBAEY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;OAwBjB,CAAC;AACR,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,6BAA6B,CAAC,KAAe;IAC3D,MAAM,QAAQ,GAAG,KAAK;SACnB,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;SACrC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,OAAO;;;EAGP,QAAQ;;;;;;;;;;;;;;;;;;;;;;iEAsBuD,CAAC;AAClE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,GAAQ;IACrC,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK;SACvB,GAAG,CACF,CAAC,IAAI,EAAE,EAAE,CACP,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,GACvC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAC9E,EAAE,CACL;SACA,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,mBAAmB,GACvB,GAAG,CAAC,QAAQ,KAAK,cAAc;QAC7B,CAAC,CAAC,oDAAoD;QACtD,CAAC,CAAC,GAAG,CAAC,QAAQ,KAAK,YAAY;YAC7B,CAAC,CAAC,8CAA8C;YAChD,CAAC,CAAC,0DAA0D,CAAC;IAEnE,OAAO;;;EAGP,QAAQ;;eAEK,GAAG,CAAC,QAAQ;EACzB,mBAAmB;;;;;;;;;;;;;;;;;;;;;;+DAsB0C,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAqB;IACnD,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAuB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,SAAS,KAAK,CAAC,IAAkB,EAAE,KAAa;QAC9C,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,8CAA8C;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC5C,OAAO,CAAC,CAAC;gBACX,CAAC;YACH,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,wCAAwC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACrE,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAExB,+BAA+B;QAC/B,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACvC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErB,+BAA+B;QAC/B,OAAO,MAAM,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;QAED,6BAA6B;QAC7B,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE5B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,GAAQ;IACrC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC,CAAC;IAE9D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAuB,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAE1C,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;QAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAEpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GACR,IAAI,CAAC,MAAM,KAAK,MAAM;gBACpB,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC;gBAClB,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,OAAO;oBACvB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;oBAChB,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS;wBACzB,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC;wBACnB,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS;4BACzB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;4BAChB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAE3B,MAAM,OAAO,GACX,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,UAAU;gBAC/B,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;gBAC9D,CAAC,CAAC,EAAE,CAAC;YAET,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAEtF,OAAO,CAAC,GAAG,CACT,OAAO,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CACxF,CAAC;YAEF,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY;IAC/C,OAAO;;QAED,IAAI;;;;;;;;;;;;;;;;;;;;;sCAqB0B,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAY;IAClD,OAAO;;;EAGP,IAAI;;;;;;;;;;;;;;;;;;;;OAoBC,CAAC;AACR,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,QAAkB;IACxD,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAExE,OAAO;;;EAGP,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoCN,CAAC;AACR,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CAAC,UAAoB;IAC3D,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE5E,OAAO;;;EAGP,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAwCR,CAAC;AACR,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAY,EAAE,QAAgB;IACpE,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAE3D,OAAO,+CAA+C,QAAQ;;QAExD,IAAI;;;EAGV,gBAAgB;;;;;;;;;;;;;;;;;;;;;;gDAsB8B,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,QAAgB;IAC/C,MAAM,YAAY,GAA2B;QAC3C,YAAY,EAAE;;;;;;;KAOb;QAED,MAAM,EAAE;;;;;;;KAOP;QAED,WAAW,EAAE;;;;;;;KAOZ;QAED,WAAW,EAAE;;;;;;;;KAQZ;QAED,SAAS,EAAE;;;;;;;;KAQV;QAED,YAAY,EAAE;;;;;;;;;KASb;QAED,OAAO,EAAE;;;;;;;KAOR;KACF,CAAC;IAEF,OAAO,YAAY,CAAC,QAAQ,CAAC,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;AAC3D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAQ;IACzC,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;IACpC,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;IACtE,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;IACxE,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IAC5E,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IAC5E,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IAE5E,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,CAAC;IAChE,IAAI,UAAU,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,UAAU,QAAQ,CAAC,CAAC,CAAC;IACjE,IAAI,YAAY,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,YAAY,UAAU,CAAC,CAAC,CAAC;IACvE,IAAI,YAAY,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,YAAY,UAAU,CAAC,CAAC,CAAC;IAC1E,IAAI,YAAY,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,YAAY,UAAU,CAAC,CAAC,CAAC;IAEvE,OAAO,QAAQ,UAAU,iBAAiB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,GAAQ;IACpC,OAAO,CACL,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC;QAC7F,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAC3C,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,GAAQ;IACnC,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAQ;IACxC,MAAM,OAAO,GAAuC,EAAE,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACjC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,GAAQ;IACtC,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAa,CAAC,oBAAoB,CAAC,CAAC;IAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,kCAAkC,CAAC,CAAC;QAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3F,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,EAAE,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;YACpD,KAAK,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/codemaps.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Code Map System — Project structure tracking and context injection.
+ * Maintains a map of project structure, modules, and file relationships.
+ */
+export interface FileEntry {
+    path: string;
+    language: string;
+    lineCount: number;
+    exports: string[];
+    imports: string[];
+    size: number;
+}
+export interface ModuleEntry {
+    name: string;
+    files: string[];
+    description: string;
+}
+export interface CodeMap {
+    projectRoot: string;
+    files: FileEntry[];
+    modules: ModuleEntry[];
+    generatedAt: string;
+    totalFiles: number;
+    totalLines: number;
+}
+/**
+ * Generate a code map by scanning the project
+ */
+export declare function generateCodeMap(cwd: string): CodeMap;
+/**
+ * Save code map to disk
+ */
+export declare function saveCodeMap(cwd: string, map: CodeMap): void;
+/**
+ * Load code map from disk
+ */
+export declare function loadCodeMap(cwd: string): CodeMap | null;
+/**
+ * Check if code map is stale (any source files modified since generation)
+ */
+export declare function isCodeMapStale(cwd: string): boolean;
+/**
+ * Pretty-print the code map
+ */
+export declare function printCodeMap(map: CodeMap): void;
+/**
+ * Build a code map context string for system prompt injection
+ */
+export declare function buildCodemapContext(cwd: string): string;
+/**
+ * Print code map generation status
+ */
+export declare function printCodemapStatus(cwd: string): void;