@promptwheel/core 0.7.13 → 0.7.17

package/dist/codebase-index/ast-analysis.d.ts

@@ -0,0 +1,57 @@
+/**
+ * AST-level codebase analysis via @ast-grep/napi.
+ *
+ * All functions are dependency-injected: they receive the ast-grep module
+ * as a parameter so there's no top-level import. This keeps the module
+ * loadable even when @ast-grep/napi is not installed.
+ *
+ * The ast-grep parse() function is synchronous — no async needed.
+ */
+import type { AstAnalysisResult, ExportEntry } from './shared.js';
+/**
+ * Minimal interface for the ast-grep/napi module.
+ * Avoids importing the actual types so this module works without the dep.
+ */
+export interface AstGrepModule {
+    parse(lang: AstGrepLang, src: string): AstGrepRoot;
+    Lang: Record<string, AstGrepLang>;
+}
+/** Opaque language identifier (the ast-grep Lang enum value). */
+export type AstGrepLang = string;
+/** Minimal SgRoot interface. */
+interface AstGrepRoot {
+    root(): AstGrepNode;
+}
+/** Minimal SgNode interface. */
+interface AstGrepNode {
+    kind(): string;
+    text(): string;
+    children(): AstGrepNode[];
+    findAll(rule: {
+        rule: {
+            kind: string;
+        };
+    }): AstGrepNode[];
+    isNamed(): boolean;
+}
+/** Map file extension to ast-grep Lang enum key. Returns null for unsupported extensions. */
+export declare function mapExtensionToLang(ext: string): string | null;
+/**
+ * Analyze a single file using AST parsing. Returns import specifiers,
+ * export entries, and cyclomatic complexity.
+ *
+ * Falls back to null on any parse error (caller should use regex fallback).
+ */
+export declare function analyzeFileAst(content: string, filePath: string, langKey: string, astGrep: AstGrepModule): AstAnalysisResult | null;
+/** Extract import specifiers from an AST root node. */
+export declare function extractImportsAst(root: AstGrepNode, langKey: string): string[];
+/** Extract exported symbols from an AST root node. JS/TS only for now. */
+export declare function extractExportsAst(root: AstGrepNode, langKey: string): ExportEntry[];
+/**
+ * Estimate cyclomatic complexity by counting decision points in the AST.
+ * Base complexity is 1 (single path), each decision point adds 1.
+ * Also counts && and || in binary expressions as decision points.
+ */
+export declare function estimateCyclomaticComplexity(root: AstGrepNode, langKey: string): number;
+export {};
+//# sourceMappingURL=ast-analysis.d.ts.map

package/dist/codebase-index/ast-analysis.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-analysis.d.ts","sourceRoot":"","sources":["../../src/codebase-index/ast-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAMlE;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,GAAG,WAAW,CAAC;IACnD,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;CACnC;AAED,iEAAiE;AACjE,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC;AAEjC,gCAAgC;AAChC,UAAU,WAAW;IACnB,IAAI,IAAI,WAAW,CAAC;CACrB;AAED,gCAAgC;AAChC,UAAU,WAAW;IACnB,IAAI,IAAI,MAAM,CAAC;IACf,IAAI,IAAI,MAAM,CAAC;IACf,QAAQ,IAAI,WAAW,EAAE,CAAC;IAC1B,OAAO,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE;YAAE,IAAI,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,GAAG,WAAW,EAAE,CAAC;IACzD,OAAO,IAAI,OAAO,CAAC;CACpB;AAMD,6FAA6F;AAC7F,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAyB7D;AAMD;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,aAAa,GACrB,iBAAiB,GAAG,IAAI,CAY1B;AAMD,uDAAuD;AACvD,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAmE9E;AAMD,0EAA0E;AAC1E,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,GAAG,WAAW,EAAE,CA2EnF;AAmDD;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAqBvF"}

package/dist/codebase-index/ast-analysis.js

@@ -0,0 +1,325 @@
+/**
+ * AST-level codebase analysis via @ast-grep/napi.
+ *
+ * All functions are dependency-injected: they receive the ast-grep module
+ * as a parameter so there's no top-level import. This keeps the module
+ * loadable even when @ast-grep/napi is not installed.
+ *
+ * The ast-grep parse() function is synchronous — no async needed.
+ */
+// ---------------------------------------------------------------------------
+// Language mapping
+// ---------------------------------------------------------------------------
+/** Map file extension to ast-grep Lang enum key. Returns null for unsupported extensions. */
+export function mapExtensionToLang(ext) {
+    switch (ext) {
+        case '.ts': return 'TypeScript';
+        case '.tsx': return 'Tsx';
+        case '.js':
+        case '.jsx':
+        case '.mjs':
+        case '.cjs':
+            return 'JavaScript';
+        case '.py': return 'Python';
+        case '.go': return 'Go';
+        case '.rs': return 'Rust';
+        case '.java': return 'Java';
+        case '.rb': return 'Ruby';
+        case '.c': return 'C';
+        case '.cpp':
+        case '.hpp':
+            return 'Cpp';
+        case '.cs': return 'CSharp';
+        case '.swift': return 'Swift';
+        case '.kt':
+        case '.kts':
+            return 'Kotlin';
+        default: return null;
+    }
+}
+// ---------------------------------------------------------------------------
+// Core analysis
+// ---------------------------------------------------------------------------
+/**
+ * Analyze a single file using AST parsing. Returns import specifiers,
+ * export entries, and cyclomatic complexity.
+ *
+ * Falls back to null on any parse error (caller should use regex fallback).
+ */
+export function analyzeFileAst(content, filePath, langKey, astGrep) {
+    try {
+        const lang = astGrep.Lang[langKey];
+        if (!lang)
+            return null;
+        const root = astGrep.parse(lang, content).root();
+        const imports = extractImportsAst(root, langKey);
+        const exports = extractExportsAst(root, langKey);
+        const complexity = estimateCyclomaticComplexity(root, langKey);
+        return { imports, exports, complexity };
+    }
+    catch {
+        return null; // parse error — caller falls back to regex
+    }
+}
+// ---------------------------------------------------------------------------
+// Import extraction
+// ---------------------------------------------------------------------------
+/** Extract import specifiers from an AST root node. */
+export function extractImportsAst(root, langKey) {
+    const imports = [];
+    if (langKey === 'TypeScript' || langKey === 'Tsx' || langKey === 'JavaScript') {
+        // JS/TS: import_statement contains string nodes with the specifier
+        const importNodes = findAllByKind(root, 'import_statement');
+        for (const node of importNodes) {
+            const specifier = extractStringLiteral(node);
+            if (specifier)
+                imports.push(specifier);
+        }
+        // Also catch require() calls
+        const callNodes = findAllByKind(root, 'call_expression');
+        for (const node of callNodes) {
+            const text = node.text();
+            if (text.startsWith('require(')) {
+                const match = text.match(/require\s*\(\s*['"]([^'"]+)['"]\s*\)/);
+                if (match?.[1])
+                    imports.push(match[1]);
+            }
+        }
+    }
+    else if (langKey === 'Python') {
+        // import_statement, import_from_statement
+        for (const kind of ['import_statement', 'import_from_statement']) {
+            const nodes = findAllByKind(root, kind);
+            for (const node of nodes) {
+                const text = node.text();
+                // from X import ... → extract X
+                const fromMatch = text.match(/from\s+([\w.]+)\s+import/);
+                if (fromMatch?.[1]) {
+                    imports.push(fromMatch[1]);
+                    continue;
+                }
+                // import X → extract X
+                const importMatch = text.match(/import\s+([\w.]+)/);
+                if (importMatch?.[1])
+                    imports.push(importMatch[1]);
+            }
+        }
+    }
+    else if (langKey === 'Go') {
+        const nodes = findAllByKind(root, 'import_spec');
+        for (const node of nodes) {
+            const specifier = extractStringLiteral(node);
+            if (specifier)
+                imports.push(specifier);
+        }
+        // Also try import_declaration for single imports
+        const declNodes = findAllByKind(root, 'import_declaration');
+        for (const node of declNodes) {
+            const specifier = extractStringLiteral(node);
+            if (specifier)
+                imports.push(specifier);
+        }
+    }
+    else if (langKey === 'Rust') {
+        const nodes = findAllByKind(root, 'use_declaration');
+        for (const node of nodes) {
+            const text = node.text().replace(/^use\s+/, '').replace(/;$/, '').trim();
+            if (text)
+                imports.push(text);
+        }
+    }
+    else if (langKey === 'Java' || langKey === 'Kotlin') {
+        const nodes = findAllByKind(root, 'import_declaration');
+        for (const node of nodes) {
+            const text = node.text().replace(/^import\s+/, '').replace(/^static\s+/, '').replace(/;$/, '').trim();
+            if (text)
+                imports.push(text);
+        }
+    }
+    else if (langKey === 'Ruby') {
+        const callNodes = findAllByKind(root, 'call');
+        for (const node of callNodes) {
+            const text = node.text();
+            const match = text.match(/require(?:_relative)?\s+['"]([^'"]+)['"]/);
+            if (match?.[1])
+                imports.push(match[1]);
+        }
+    }
+    return imports;
+}
+// ---------------------------------------------------------------------------
+// Export extraction
+// ---------------------------------------------------------------------------
+/** Extract exported symbols from an AST root node. JS/TS only for now. */
+export function extractExportsAst(root, langKey) {
+    if (langKey !== 'TypeScript' && langKey !== 'Tsx' && langKey !== 'JavaScript') {
+        return [];
+    }
+    const exports = [];
+    const seen = new Set();
+    const exportNodes = findAllByKind(root, 'export_statement');
+    for (const node of exportNodes) {
+        const text = node.text();
+        // export default — skip (anonymous)
+        if (/^export\s+default\b/.test(text)) {
+            if (!seen.has('default')) {
+                exports.push({ name: 'default', kind: 'other' });
+                seen.add('default');
+            }
+            continue;
+        }
+        // export function foo
+        const fnMatch = text.match(/export\s+function\s+(\w+)/) ?? text.match(/export\s+async\s+function\s+(\w+)/);
+        if (fnMatch?.[1] && !seen.has(fnMatch[1])) {
+            exports.push({ name: fnMatch[1], kind: 'function' });
+            seen.add(fnMatch[1]);
+            continue;
+        }
+        // export class Foo
+        const classMatch = text.match(/export\s+class\s+(\w+)/) ?? text.match(/export\s+abstract\s+class\s+(\w+)/);
+        if (classMatch?.[1] && !seen.has(classMatch[1])) {
+            exports.push({ name: classMatch[1], kind: 'class' });
+            seen.add(classMatch[1]);
+            continue;
+        }
+        // export interface Foo / export type Foo
+        const typeMatch = text.match(/export\s+(?:interface|type)\s+(\w+)/);
+        if (typeMatch?.[1] && !seen.has(typeMatch[1])) {
+            exports.push({ name: typeMatch[1], kind: 'type' });
+            seen.add(typeMatch[1]);
+            continue;
+        }
+        // export enum Foo
+        const enumMatch = text.match(/export\s+enum\s+(\w+)/) ?? text.match(/export\s+const\s+enum\s+(\w+)/);
+        if (enumMatch?.[1] && !seen.has(enumMatch[1])) {
+            exports.push({ name: enumMatch[1], kind: 'enum' });
+            seen.add(enumMatch[1]);
+            continue;
+        }
+        // export const/let/var foo
+        const varMatch = text.match(/export\s+(?:const|let|var)\s+(\w+)/);
+        if (varMatch?.[1] && !seen.has(varMatch[1])) {
+            exports.push({ name: varMatch[1], kind: 'variable' });
+            seen.add(varMatch[1]);
+            continue;
+        }
+        // export { foo, bar } — named re-exports
+        const namedMatch = text.match(/export\s*\{([^}]+)\}/);
+        if (namedMatch?.[1]) {
+            for (const part of namedMatch[1].split(',')) {
+                const name = part.trim().split(/\s+as\s+/).pop()?.trim();
+                if (name && !seen.has(name)) {
+                    exports.push({ name, kind: 'other' });
+                    seen.add(name);
+                }
+            }
+        }
+    }
+    return exports;
+}
+// ---------------------------------------------------------------------------
+// Cyclomatic complexity
+// ---------------------------------------------------------------------------
+/** Decision-point node kinds per language family. */
+const DECISION_KINDS = {
+    js: [
+        'if_statement', 'while_statement', 'for_statement', 'for_in_statement',
+        'switch_case', 'catch_clause', 'ternary_expression',
+    ],
+    python: [
+        'if_statement', 'while_statement', 'for_statement',
+        'except_clause', 'with_statement',
+    ],
+    go: [
+        'if_statement', 'for_statement', 'select_statement',
+        'type_switch_statement', 'communication_case',
+    ],
+    rust: [
+        'if_expression', 'while_expression', 'for_expression',
+        'match_arm', 'if_let_expression',
+    ],
+    java: [
+        'if_statement', 'while_statement', 'for_statement',
+        'enhanced_for_statement', 'switch_block_statement_group',
+        'catch_clause', 'ternary_expression',
+    ],
+};
+function getLangFamily(langKey) {
+    switch (langKey) {
+        case 'TypeScript':
+        case 'Tsx':
+        case 'JavaScript':
+            return 'js';
+        case 'Python':
+            return 'python';
+        case 'Go':
+            return 'go';
+        case 'Rust':
+            return 'rust';
+        case 'Java':
+        case 'Kotlin':
+            return 'java';
+        default:
+            return 'js'; // fallback
+    }
+}
+/**
+ * Estimate cyclomatic complexity by counting decision points in the AST.
+ * Base complexity is 1 (single path), each decision point adds 1.
+ * Also counts && and || in binary expressions as decision points.
+ */
+export function estimateCyclomaticComplexity(root, langKey) {
+    const family = getLangFamily(langKey);
+    const kinds = DECISION_KINDS[family] ?? DECISION_KINDS.js;
+    let complexity = 1; // base path
+    for (const kind of kinds) {
+        complexity += findAllByKind(root, kind).length;
+    }
+    // Count logical operators (&&, ||) as additional decision points
+    const binaryNodes = findAllByKind(root, 'binary_expression');
+    for (const node of binaryNodes) {
+        const text = node.text();
+        // Only count top-level operator, not nested ones
+        if (text.includes('&&') || text.includes('||')) {
+            complexity++;
+        }
+    }
+    return complexity;
+}
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+/** Find all descendant nodes of a given kind using tree traversal. */
+function findAllByKind(root, kind) {
+    try {
+        return root.findAll({ rule: { kind } });
+    }
+    catch {
+        // Fallback: manual traversal if findAll doesn't support rule object
+        const result = [];
+        const stack = [root];
+        while (stack.length > 0) {
+            const node = stack.pop();
+            if (node.kind() === kind)
+                result.push(node);
+            try {
+                const children = node.children();
+                for (let i = children.length - 1; i >= 0; i--) {
+                    stack.push(children[i]);
+                }
+            }
+            catch {
+                // node.children() not available — skip
+            }
+        }
+        return result;
+    }
+}
+/** Extract the first string literal value from a node's children. */
+function extractStringLiteral(node) {
+    const text = node.text();
+    // Match single or double quoted strings
+    const match = text.match(/['"]([^'"]+)['"]/);
+    return match?.[1] ?? null;
+}
+//# sourceMappingURL=ast-analysis.js.map

package/dist/codebase-index/ast-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-analysis.js","sourceRoot":"","sources":["../../src/codebase-index/ast-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAkCH,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,6FAA6F;AAC7F,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAC5C,QAAQ,GAAG,EAAE,CAAC;QACZ,KAAK,KAAK,CAAC,CAAC,OAAO,YAAY,CAAC;QAChC,KAAK,MAAM,CAAC,CAAC,OAAO,KAAK,CAAC;QAC1B,KAAK,KAAK,CAAC;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACT,OAAO,YAAY,CAAC;QACtB,KAAK,KAAK,CAAC,CAAC,OAAO,QAAQ,CAAC;QAC5B,KAAK,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC;QACxB,KAAK,KAAK,CAAC,CAAC,OAAO,MAAM,CAAC;QAC1B,KAAK,OAAO,CAAC,CAAC,OAAO,MAAM,CAAC;QAC5B,KAAK,KAAK,CAAC,CAAC,OAAO,MAAM,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC;QACtB,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,KAAK,CAAC,CAAC,OAAO,QAAQ,CAAC;QAC5B,KAAK,QAAQ,CAAC,CAAC,OAAO,OAAO,CAAC;QAC9B,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC;QAClB,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC;IACvB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAe,EACf,QAAgB,EAChB,OAAe,EACf,OAAsB;IAEtB,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACjD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,UAAU,GAAG,4BAA4B,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/D,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC,CAAC,2CAA2C;IAC1D,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,uDAAuD;AACvD,MAAM,UAAU,iBAAiB,CAAC,IAAiB,EAAE,OAAe;IAClE,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,IAAI,OAAO,KAAK,YAAY,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,YAAY,EAAE,CAAC;QAC9E,mEAAmE;QACnE,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,kBAAkB,CAAC,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,SAAS;gBAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzC,CAAC;QACD,6BAA6B;QAC7B,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QACzD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;gBACjE,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;QAChC,0CAA0C;QAC1C,KAAK,MAAM,IAAI,IAAI,CAAC,kBAAkB,EAAE,uBAAuB,CAAC,EAAE,CAAC;YACjE,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBACzB,gCAAgC;gBAChC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBACzD,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAC,SAAS;gBAAC,CAAC;gBAC7D,uBAAuB;gBACvB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;gBACpD,IAAI,WAAW,EAAE,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,SAAS;gBAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzC,CAAC;QACD,iDAAiD;QACjD,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC;QAC5D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,SAAS;gBAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;SAAM,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YACzE,IAAI,IAAI;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;SAAM,IAAI,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;QACtD,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YACtG,IAAI,IAAI;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;SAAM,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,0CAA0C,CAAC,CAAC;YACrE,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,0EAA0E;AAC1E,MAAM,UAAU,iBAAiB,CAAC,IAAiB,EAAE,OAAe;IAClE,IAAI,OAAO,KAAK,YAAY,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,YAAY,EAAE,CAAC;QAC9E,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,kBAAkB,CAAC,CAAC;IAC5D,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAEzB,oCAAoC;QACpC,IAAI,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;gBACjD,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACtB,CAAC;YACD,SAAS;QACX,CAAC;QAED,sBAAsB;QACtB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,2BAA2B,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,mCAAmC,CAAC,CAAC;QAC3G,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YACrD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QAED,mBAAmB;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,mCAAmC,CAAC,CAAC;QAC3G,IAAI,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAChD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACrD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,yCAAyC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACpE,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YACnD,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QAED,kBAAkB;QAClB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACrG,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YACnD,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QAED,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,CAAC;QAClE,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,SAAS;QACX,CAAC;QAED,yCAAyC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;QACtD,IAAI,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC;gBACzD,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;oBACtC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E,qDAAqD;AACrD,MAAM,cAAc,GAA6B;IAC/C,EAAE,EAAE;QACF,cAAc,EAAE,iBAAiB,EAAE,eAAe,EAAE,kBAAkB;QACtE,aAAa,EAAE,cAAc,EAAE,oBAAoB;KACpD;IACD,MAAM,EAAE;QACN,cAAc,EAAE,iBAAiB,EAAE,eAAe;QAClD,eAAe,EAAE,gBAAgB;KAClC;IACD,EAAE,EAAE;QACF,cAAc,EAAE,eAAe,EAAE,kBAAkB;QACnD,uBAAuB,EAAE,oBAAoB;KAC9C;IACD,IAAI,EAAE;QACJ,eAAe,EAAE,kBAAkB,EAAE,gBAAgB;QACrD,WAAW,EAAE,mBAAmB;KACjC;IACD,IAAI,EAAE;QACJ,cAAc,EAAE,iBAAiB,EAAE,eAAe;QAClD,wBAAwB,EAAE,8BAA8B;QACxD,cAAc,EAAE,oBAAoB;KACrC;CACF,CAAC;AAEF,SAAS,aAAa,CAAC,OAAe;IACpC,QAAQ,OAAO,EAAE,CAAC;QAChB,KAAK,YAAY,CAAC;QAClB,KAAK,KAAK,CAAC;QACX,KAAK,YAAY;YACf,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,IAAI;YACP,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,OAAO,MAAM,CAAC;QAChB,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO,MAAM,CAAC;QAChB;YACE,OAAO,IAAI,CAAC,CAAC,WAAW;IAC5B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CAAC,IAAiB,EAAE,OAAe;IAC7E,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC;IAE1D,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,YAAY;IAEhC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,IAAI,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;IACjD,CAAC;IAED,iEAAiE;IACjE,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC;IAC7D,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,iDAAiD;QACjD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,UAAU,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,sEAAsE;AACtE,SAAS,aAAa,CAAC,IAAiB,EAAE,IAAY;IACpD,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,oEAAoE;QACpE,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,KAAK,GAAkB,CAAC,IAAI,CAAC,CAAC;QACpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9C,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,uCAAuC;YACzC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;AACH,CAAC;AAED,qEAAqE;AACrE,SAAS,oBAAoB,CAAC,IAAiB;IAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IACzB,wCAAwC;IACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAC7C,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC5B,CAAC"}

package/dist/codebase-index/ast-cache.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Mtime-based per-file AST analysis cache.
+ *
+ * Stores import/export/complexity results per source file. Invalidated when
+ * a file's mtime or size changes. Stale entries (files no longer in module set)
+ * are pruned on save.
+ *
+ * Cache location: .promptwheel/ast-cache.json
+ * ~200 bytes per entry → ~200KB for 1000 files.
+ */
+import type { ExportEntry } from './shared.js';
+export interface AstCacheEntry {
+    mtime: number;
+    size: number;
+    imports: string[];
+    exports: ExportEntry[];
+    complexity: number;
+}
+export type AstCache = Record<string, AstCacheEntry>;
+/** Load the AST cache from disk. Returns empty cache if missing or corrupted. */
+export declare function loadAstCache(repoRoot: string): AstCache;
+/**
+ * Save the AST cache to disk. Prunes entries for files not in the current
+ * module set to prevent unbounded growth.
+ */
+export declare function saveAstCache(repoRoot: string, cache: AstCache, currentFiles?: Set<string>): void;
+/** Check if a cache entry is still current for a given file. */
+export declare function isEntryCurrent(entry: AstCacheEntry | undefined, mtime: number, size: number): boolean;
+//# sourceMappingURL=ast-cache.d.ts.map

package/dist/codebase-index/ast-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-cache.d.ts","sourceRoot":"","sources":["../../src/codebase-index/ast-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAM/C,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,WAAW,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;AAUrD,iFAAiF;AACjF,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,CAYvD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAwBhG;AAED,gEAAgE;AAChE,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAGrG"}

package/dist/codebase-index/ast-cache.js

@@ -0,0 +1,75 @@
+/**
+ * Mtime-based per-file AST analysis cache.
+ *
+ * Stores import/export/complexity results per source file. Invalidated when
+ * a file's mtime or size changes. Stale entries (files no longer in module set)
+ * are pruned on save.
+ *
+ * Cache location: .promptwheel/ast-cache.json
+ * ~200 bytes per entry → ~200KB for 1000 files.
+ */
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+// ---------------------------------------------------------------------------
+// I/O
+// ---------------------------------------------------------------------------
+function getCachePath(repoRoot) {
+    return path.join(repoRoot, '.promptwheel', 'ast-cache.json');
+}
+/** Load the AST cache from disk. Returns empty cache if missing or corrupted. */
+export function loadAstCache(repoRoot) {
+    try {
+        const cachePath = getCachePath(repoRoot);
+        if (!fs.existsSync(cachePath))
+            return {};
+        const raw = fs.readFileSync(cachePath, 'utf-8');
+        if (!raw.trim())
+            return {};
+        const data = JSON.parse(raw);
+        if (!data || typeof data !== 'object' || Array.isArray(data))
+            return {};
+        return data;
+    }
+    catch {
+        return {};
+    }
+}
+/**
+ * Save the AST cache to disk. Prunes entries for files not in the current
+ * module set to prevent unbounded growth.
+ */
+export function saveAstCache(repoRoot, cache, currentFiles) {
+    const cachePath = getCachePath(repoRoot);
+    const tmp = cachePath + '.tmp';
+    try {
+        // Prune stale entries
+        const pruned = {};
+        for (const [relPath, entry] of Object.entries(cache)) {
+            if (!currentFiles || currentFiles.has(relPath)) {
+                pruned[relPath] = entry;
+            }
+        }
+        // Ensure directory exists
+        const dir = path.dirname(cachePath);
+        if (!fs.existsSync(dir)) {
+            fs.mkdirSync(dir, { recursive: true });
+        }
+        fs.writeFileSync(tmp, JSON.stringify(pruned));
+        fs.renameSync(tmp, cachePath);
+    }
+    catch {
+        // Cache write failure is non-fatal
+        try {
+            if (fs.existsSync(tmp))
+                fs.unlinkSync(tmp);
+        }
+        catch { /* ignore */ }
+    }
+}
+/** Check if a cache entry is still current for a given file. */
+export function isEntryCurrent(entry, mtime, size) {
+    if (!entry)
+        return false;
+    return entry.mtime === mtime && entry.size === size;
+}
+//# sourceMappingURL=ast-cache.js.map

package/dist/codebase-index/ast-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-cache.js","sourceRoot":"","sources":["../../src/codebase-index/ast-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAiBlC,8EAA8E;AAC9E,MAAM;AACN,8EAA8E;AAE9E,SAAS,YAAY,CAAC,QAAgB;IACpC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;AAC/D,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,OAAO,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;YAAE,OAAO,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACxE,OAAO,IAAgB,CAAC;IAC1B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,KAAe,EAAE,YAA0B;IACxF,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,SAAS,GAAG,MAAM,CAAC;IAC/B,IAAI,CAAC;QACH,sBAAsB;QACtB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAC9C,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,mCAAmC;QACnC,IAAI,CAAC;YAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IAC5E,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,cAAc,CAAC,KAAgC,EAAE,KAAa,EAAE,IAAY;IAC1F,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACzB,OAAO,KAAK,CAAC,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AACtD,CAAC"}

package/dist/codebase-index/dead-code.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Dead code detection and structural issue analysis.
+ *
+ * Cross-module export-import matching to find unused exports and
+ * structural anti-patterns. Pure functions — no I/O.
+ */
+import type { ModuleEntry, DeadExportEntry, StructuralIssue, ExportEntry } from './shared.js';
+/**
+ * Detect potentially dead exports by comparing each module's exported names
+ * against what other modules import. Uses name-based matching (no type
+ * resolution) — sufficient for high-confidence identification.
+ *
+ * Returns at most `maxResults` entries to keep prompt token count bounded.
+ */
+export declare function detectDeadExports(modules: ModuleEntry[], edges: Record<string, string[]>, exportsByModule: Record<string, ExportEntry[]>, importsByModule: Record<string, string[]>, maxResults?: number): DeadExportEntry[];
+/**
+ * Detect structural anti-patterns from dependency graph topology.
+ *
+ * Patterns detected:
+ * - god-module: fan_in > 5 AND file_count > 20
+ * - excessive-fan-out: fan_out > 8
+ * - barrel-only: 1 file that exists only to re-export
+ * - orphan: zero in/out edges, not an entrypoint
+ *
+ * Returns at most `maxResults` entries.
+ */
+export declare function detectStructuralIssues(modules: ModuleEntry[], edges: Record<string, string[]>, reverseEdges: Record<string, string[]>, cycles: string[][], entrypoints?: string[], maxResults?: number): StructuralIssue[];
+export interface CouplingMetrics {
+    /** Per-module instability: Ce / (Ca + Ce). High = easily affected by change. */
+    instability: Record<string, number>;
+}
+/**
+ * Compute Robert C. Martin's instability metric per module.
+ * I = Ce / (Ca + Ce) where:
+ * - Ca (afferent coupling) = fan_in (who depends on me)
+ * - Ce (efferent coupling) = fan_out (who I depend on)
+ * - I = 0: maximally stable (many dependents, no dependencies)
+ * - I = 1: maximally unstable (no dependents, many dependencies)
+ */
+export declare function computeCouplingMetrics(modules: ModuleEntry[], edges: Record<string, string[]>, reverseEdges: Record<string, string[]>): CouplingMetrics;
+//# sourceMappingURL=dead-code.d.ts.map

package/dist/codebase-index/dead-code.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dead-code.d.ts","sourceRoot":"","sources":["../../src/codebase-index/dead-code.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,WAAW,EACX,eAAe,EACf,eAAe,EACf,WAAW,EACZ,MAAM,aAAa,CAAC;AAMrB;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,WAAW,EAAE,EACtB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAC/B,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,EAC9C,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACzC,UAAU,SAAK,GACd,eAAe,EAAE,CA6CnB;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,WAAW,EAAE,EACtB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAC/B,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACtC,MAAM,EAAE,MAAM,EAAE,EAAE,EAClB,WAAW,GAAE,MAAM,EAAO,EAC1B,UAAU,SAAK,GACd,eAAe,EAAE,CAkEnB;AAMD,MAAM,WAAW,eAAe;IAC9B,gFAAgF;IAChF,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACrC;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,WAAW,EAAE,EACtB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAC/B,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GACrC,eAAe,CAWjB"}