code-auditor-mcp 4.1.1 → 5.0.1

package/dist/codeIndex/coverage.d.ts

@@ -0,0 +1,78 @@
+/**
+ * Coverage-data access (Spec 15) — the `coverage_data` table backing the
+ * cross-domain coverage report. Extracted from `CodeIndexDB`; holds only the
+ * raw SQLite handle, so it carries no lifecycle or adapter state.
+ */
+import type { SqliteDatabase } from '../sqlite/types.js';
+/**
+ * Data access for the `coverage_data` table: import, query, and clear the
+ * cross-domain coverage report (Spec 15).
+ */
+export declare class CoverageIndex {
+    private db;
+    /**
+     * Wrap the shared SQLite handle for coverage-data access.
+     * @param db the SQLite database handle.
+     */
+    constructor(db: SqliteDatabase);
+    /**
+     * Replace coverage rows for the entries' bases, then insert the new set.
+     * @param entries coverage records to import; rows for each distinct `basis` are cleared before these are written.
+     */
+    importCoverageData(entries: Array<{
+        functionName: string;
+        filePath: string;
+        lineNumber: number;
+        basis: 'static-reach' | 'measured';
+        covered: boolean;
+        source?: string;
+    }>): void;
+    /**
+     * Return all coverage rows for a single basis.
+     * @param basis the coverage basis to filter on (`static-reach` or `measured`).
+     * @returns the matching rows, with `covered` decoded from the stored 0/1 flag.
+     */
+    getCoverageByBasis(basis: 'static-reach' | 'measured'): Array<{
+        functionName: string;
+        filePath: string;
+        lineNumber: number;
+        basis: string;
+        covered: boolean;
+        source: string | null;
+        importedAt: string | null;
+    }>;
+    /**
+     * Delete coverage rows, for a single basis or the whole table.
+     * @param basis when given, delete only that basis; otherwise clear all coverage data.
+     */
+    clearCoverageData(basis?: 'static-reach' | 'measured'): void;
+    /**
+     * Check if measured coverage predates the last full sync.
+     * @returns true when any measured row was imported before the last full sync timestamp.
+     */
+    isCoverageStale(): boolean;
+    /**
+     * Bucket exported functions into risk deciles and report per-decile coverage.
+     * @param decileCount the number of deciles to split functions into.
+     * @returns one entry per decile with the covered and total function counts and the coverage rate.
+     */
+    getCoverageByRiskDecile(decileCount?: number): Array<{
+        decile: number;
+        covered: number;
+        total: number;
+        rate: number;
+    }>;
+    /**
+     * Return the highest-risk exported functions that have no measured coverage.
+     * @param topDecile the percentile cutoff (0..1) selecting the top risk slice.
+     * @returns the untested functions in that top slice, ordered by descending risk score.
+     */
+    getUntestedTopDecile(topDecile?: number): Array<{
+        functionName: string;
+        filePath: string;
+        lineNumber: number;
+        riskScore: number;
+        basis: string;
+    }>;
+}
+//# sourceMappingURL=coverage.d.ts.map

package/dist/codeIndex/coverage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage.d.ts","sourceRoot":"","sources":["../../src/codeIndex/coverage.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEzD;;;GAGG;AACH,qBAAa,aAAa;IAKZ,OAAO,CAAC,EAAE;IAJtB;;;OAGG;gBACiB,EAAE,EAAE,cAAc;IAEtC;;;OAGG;IACH,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC;QAChC,YAAY,EAAE,MAAM,CAAC;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,MAAM,CAAC;QACnB,KAAK,EAAE,cAAc,GAAG,UAAU,CAAC;QACnC,OAAO,EAAE,OAAO,CAAC;QACjB,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,CAAC,GAAG,IAAI;IAoBT;;;;OAIG;IACH,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,UAAU,GAAG,KAAK,CAAC;QAC5D,YAAY,EAAE,MAAM,CAAC;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,MAAM,CAAC;QACnB,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,EAAE,OAAO,CAAC;QACjB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;KAC3B,CAAC;IAeF;;;OAGG;IACH,iBAAiB,CAAC,KAAK,CAAC,EAAE,cAAc,GAAG,UAAU,GAAG,IAAI;IAQ5D;;;OAGG;IACH,eAAe,IAAI,OAAO;IAY1B;;;;OAIG;IACH,uBAAuB,CAAC,WAAW,GAAE,MAAW,GAAG,KAAK,CAAC;QACvD,MAAM,EAAE,MAAM,CAAC;QACf,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;KACd,CAAC;IAqCF;;;;OAIG;IACH,oBAAoB,CAAC,SAAS,GAAE,MAAY,GAAG,KAAK,CAAC;QACnD,YAAY,EAAE,MAAM,CAAC;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CAuCH"}

package/dist/codeIndex/coverage.js

@@ -0,0 +1,164 @@
+/**
+ * Coverage-data access (Spec 15) — the `coverage_data` table backing the
+ * cross-domain coverage report. Extracted from `CodeIndexDB`; holds only the
+ * raw SQLite handle, so it carries no lifecycle or adapter state.
+ */
+/**
+ * Data access for the `coverage_data` table: import, query, and clear the
+ * cross-domain coverage report (Spec 15).
+ */
+export class CoverageIndex {
+    db;
+    /**
+     * Wrap the shared SQLite handle for coverage-data access.
+     * @param db the SQLite database handle.
+     */
+    constructor(db) {
+        this.db = db;
+    }
+    /**
+     * Replace coverage rows for the entries' bases, then insert the new set.
+     * @param entries coverage records to import; rows for each distinct `basis` are cleared before these are written.
+     */
+    importCoverageData(entries) {
+        // Group by basis so we only clear one basis at a time
+        const bases = new Set(entries.map(e => e.basis));
+        const clearStmt = this.db.prepare('DELETE FROM coverage_data WHERE basis = ?');
+        for (const basis of bases) {
+            clearStmt.run(basis);
+        }
+        const insert = this.db.prepare(`INSERT OR REPLACE INTO coverage_data (function_name, file_path, line_number, basis, covered, source, imported_at)
+       VALUES (?, ?, ?, ?, ?, ?, datetime('now'))`);
+        const tx = this.db.transaction((items) => {
+            for (const e of items) {
+                insert.run(e.functionName, e.filePath, e.lineNumber, e.basis, e.covered ? 1 : 0, e.source ?? null);
+            }
+        });
+        tx(entries);
+    }
+    /**
+     * Return all coverage rows for a single basis.
+     * @param basis the coverage basis to filter on (`static-reach` or `measured`).
+     * @returns the matching rows, with `covered` decoded from the stored 0/1 flag.
+     */
+    getCoverageByBasis(basis) {
+        const rows = this.db.prepare('SELECT * FROM coverage_data WHERE basis = ?').all(basis);
+        return rows.map((r) => ({
+            functionName: r.function_name,
+            filePath: r.file_path,
+            lineNumber: r.line_number,
+            basis: r.basis,
+            covered: r.covered === 1,
+            source: r.source,
+            importedAt: r.imported_at,
+        }));
+    }
+    /**
+     * Delete coverage rows, for a single basis or the whole table.
+     * @param basis when given, delete only that basis; otherwise clear all coverage data.
+     */
+    clearCoverageData(basis) {
+        if (basis) {
+            this.db.prepare('DELETE FROM coverage_data WHERE basis = ?').run(basis);
+        }
+        else {
+            this.db.prepare('DELETE FROM coverage_data').run();
+        }
+    }
+    /**
+     * Check if measured coverage predates the last full sync.
+     * @returns true when any measured row was imported before the last full sync timestamp.
+     */
+    isCoverageStale() {
+        const lastSync = this.db.prepare("SELECT value FROM meta WHERE key = 'last_full_sync_timestamp'").get();
+        if (!lastSync)
+            return false;
+        const staleRow = this.db.prepare(`SELECT COUNT(*) as cnt FROM coverage_data
+       WHERE basis = 'measured' AND imported_at < ?`).get(lastSync.value);
+        return (staleRow?.cnt ?? 0) > 0;
+    }
+    /**
+     * Bucket exported functions into risk deciles and report per-decile coverage.
+     * @param decileCount the number of deciles to split functions into.
+     * @returns one entry per decile with the covered and total function counts and the coverage rate.
+     */
+    getCoverageByRiskDecile(decileCount = 10) {
+        // Rank functions by risk score from hotspot_scores, join with coverage_data
+        const rows = this.db.prepare(`
+      WITH ranked AS (
+        SELECT
+          f.name,
+          f.file_path,
+          f.line_number,
+          COALESCE(hs.score, 0.0) as risk_score,
+          NTILE(?) OVER (ORDER BY COALESCE(hs.score, 0.0) DESC) as decile
+        FROM functions f
+        LEFT JOIN hotspot_scores hs ON hs.target = (f.file_path || ':' || f.name)
+          AND hs.type = 'function'
+        WHERE f.is_exported = 1
+      ),
+      coverage AS (
+        SELECT DISTINCT function_name, file_path FROM coverage_data
+        WHERE covered = 1
+      )
+      SELECT
+        r.decile,
+        COUNT(*) as total,
+        SUM(CASE WHEN c.function_name IS NOT NULL THEN 1 ELSE 0 END) as covered
+      FROM ranked r
+      LEFT JOIN coverage c ON c.function_name = r.name AND c.file_path = r.file_path
+      GROUP BY r.decile
+      ORDER BY r.decile
+    `).all(decileCount);
+        return rows.map((r) => ({
+            decile: r.decile,
+            covered: r.covered,
+            total: r.total,
+            rate: r.total > 0 ? r.covered / r.total : 0,
+        }));
+    }
+    /**
+     * Return the highest-risk exported functions that have no measured coverage.
+     * @param topDecile the percentile cutoff (0..1) selecting the top risk slice.
+     * @returns the untested functions in that top slice, ordered by descending risk score.
+     */
+    getUntestedTopDecile(topDecile = 0.1) {
+        const rows = this.db.prepare(`
+      WITH ranked AS (
+        SELECT
+          f.name,
+          f.file_path,
+          f.line_number,
+          COALESCE(hs.score, 0.0) as risk_score,
+          PERCENT_RANK() OVER (ORDER BY COALESCE(hs.score, 0.0) DESC) as pct
+        FROM functions f
+        LEFT JOIN hotspot_scores hs ON hs.target = (f.file_path || ':' || f.name)
+          AND hs.type = 'function'
+        WHERE f.is_exported = 1
+      ),
+      best_coverage AS (
+        SELECT DISTINCT function_name, file_path, basis FROM coverage_data
+        WHERE covered = 1
+      )
+      SELECT
+        r.name,
+        r.file_path,
+        r.line_number,
+        r.risk_score,
+        COALESCE(bc.basis, 'static-reach') as basis
+      FROM ranked r
+      LEFT JOIN best_coverage bc ON bc.function_name = r.name AND bc.file_path = r.file_path
+      WHERE r.pct <= ?
+        AND bc.basis IS NULL
+      ORDER BY r.risk_score DESC
+    `).all(topDecile);
+        return rows.map((r) => ({
+            functionName: r.name,
+            filePath: r.file_path,
+            lineNumber: r.line_number ?? 1,
+            riskScore: r.risk_score,
+            basis: r.basis,
+        }));
+    }
+}
+//# sourceMappingURL=coverage.js.map

package/dist/codeIndex/coverage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage.js","sourceRoot":"","sources":["../../src/codeIndex/coverage.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;GAGG;AACH,MAAM,OAAO,aAAa;IAKJ;IAJpB;;;OAGG;IACH,YAAoB,EAAkB;QAAlB,OAAE,GAAF,EAAE,CAAgB;IAAG,CAAC;IAE1C;;;OAGG;IACH,kBAAkB,CAAC,OAOjB;QACA,sDAAsD;QACtD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC;QAC/E,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC5B;kDAC4C,CAC7C,CAAC;QACF,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,KAAqB,EAAE,EAAE;YACvD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;YACrG,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,OAAO,CAAC,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,KAAkC;QASnD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC1B,6CAA6C,CAC9C,CAAC,GAAG,CAAC,KAAK,CAAU,CAAC;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;YAC3B,YAAY,EAAE,CAAC,CAAC,aAAa;YAC7B,QAAQ,EAAE,CAAC,CAAC,SAAS;YACrB,UAAU,EAAE,CAAC,CAAC,WAAW;YACzB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,OAAO,EAAE,CAAC,CAAC,OAAO,KAAK,CAAC;YACxB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,UAAU,EAAE,CAAC,CAAC,WAAW;SAC1B,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,KAAmC;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2BAA2B,CAAC,CAAC,GAAG,EAAE,CAAC;QACrD,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC9B,+DAA+D,CAChE,CAAC,GAAG,EAAmC,CAAC;QACzC,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC9B;oDAC8C,CAC/C,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAQ,CAAC;QAC7B,OAAO,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,uBAAuB,CAAC,cAAsB,EAAE;QAM9C,4EAA4E;QAC5E,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;KAyB5B,CAAC,CAAC,GAAG,CAAC,WAAW,CAAU,CAAC;QAE7B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;YAC3B,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC5C,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;;OAIG;IACH,oBAAoB,CAAC,YAAoB,GAAG;QAO1C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA4B5B,CAAC,CAAC,GAAG,CAAC,SAAS,CAAU,CAAC;QAE3B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;YAC3B,YAAY,EAAE,CAAC,CAAC,IAAI;YACpB,QAAQ,EAAE,CAAC,CAAC,SAAS;YACrB,UAAU,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC;YAC9B,SAAS,EAAE,CAAC,CAAC,UAAU;YACvB,KAAK,EAAE,CAAC,CAAC,KAAK;SACf,CAAC,CAAC,CAAC;IACN,CAAC;CACF"}

package/dist/codeIndex/dependencyGraph.d.ts

@@ -0,0 +1,97 @@
+/**
+ * Dependency-graph access (Spec 14) — call/import edge construction and the
+ * transitive-closure / cycle / depth queries over them. Extracted from
+ * `CodeIndexDB`; holds only the raw SQLite handle.
+ */
+import type { SqliteDatabase } from '../sqlite/types.js';
+/**
+ * Clear call edges for a scope — one file, or the whole table when unscoped.
+ *
+ * @param db The SQLite database handle.
+ * @param filePath When given, only edges owned by functions in this file are removed.
+ */
+export declare function clearCallEdges(db: SqliteDatabase, filePath?: string): void;
+/**
+ * Clear dependency edges for a scope — one file, or the whole table when unscoped.
+ *
+ * @param db The SQLite database handle.
+ * @param filePath When given, only edges owned by functions in this file are removed.
+ */
+export declare function clearDependencyEdges(db: SqliteDatabase, filePath?: string): void;
+/**
+ * Read the function rows a graph rebuild needs, scoped to a file when given.
+ *
+ * @param db The SQLite database handle.
+ * @param filePath When given, restrict the read to functions in this file.
+ * @returns The function rows (id, name, file_path, metadata_json) used to build edges.
+ */
+export declare function loadGraphFunctions(db: SqliteDatabase, filePath?: string): any[];
+/**
+ * Rebuild call and dependency edges from function metadata.
+ *
+ * @param db The SQLite database handle.
+ * @param allFns The function rows whose metadata drives the edge inserts.
+ */
+export declare function insertGraphEdges(db: SqliteDatabase, allFns: any[]): void;
+/**
+ * Dependency-graph queries over the `function_calls` and `function_dependencies`
+ * edge tables, keyed by function name. Rebuilds edges from stored metadata and
+ * answers transitive-closure, cycle, and dependency-depth questions over them.
+ */
+export declare class DependencyGraphIndex {
+    private db;
+    /**
+     * Create the index over the shared SQLite handle.
+     *
+     * @param db The SQLite database handle.
+     */
+    constructor(db: SqliteDatabase);
+    /**
+     * Rebuild call and dependency edges from stored metadata. When scoped to a
+     * single file, only that file's functions are re-read — avoiding an
+     * O(files × functions) re-read on each detached-audit loop iteration.
+     *
+     * @param filePath When given, rebuild edges for this file only.
+     * @returns Resolves once the edge tables have been rebuilt in a transaction.
+     */
+    updateDependencyGraph(filePath?: string): Promise<void>;
+    /**
+     * Return every function transitively reached from the given function by
+     * following call edges, up to a maximum hop depth.
+     *
+     * @param functionName The starting function name.
+     * @param maxDepth The maximum number of call-edge hops to traverse.
+     * @returns Distinct callee names with their distance, ordered by depth then name.
+     */
+    getTransitiveDependencies(functionName: string, maxDepth?: number): Promise<Array<{
+        name: string;
+        depth: number;
+    }>>;
+    /**
+     * Return every function that transitively calls the given function, by walking
+     * call edges backward up to a maximum hop depth.
+     *
+     * @param functionName The function whose callers are sought.
+     * @param maxDepth The maximum number of call-edge hops to traverse.
+     * @returns Distinct caller names with their distance, ordered by depth then name.
+     */
+    getTransitiveCallers(functionName: string, maxDepth?: number): Promise<Array<{
+        name: string;
+        depth: number;
+    }>>;
+    /**
+     * Find call cycles by walking call edges until a path returns to its start.
+     *
+     * @returns Each cycle as a list of function names in traversal order.
+     */
+    detectCircularDependencies(): Promise<Array<string[]>>;
+    /**
+     * Compute and persist each function's deepest transitive dependency distance.
+     *
+     * @returns Resolves once every function's dependency_depth has been updated.
+     */
+    calculateDependencyDepths(): Promise<void>;
+    /** Get graph statistics — delegates to graph/callGraph.ts (Spec 14 R1). */
+    getGraphStats(): import('../types.js').GraphStats;
+}
+//# sourceMappingURL=dependencyGraph.d.ts.map

package/dist/codeIndex/dependencyGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.d.ts","sourceRoot":"","sources":["../../src/codeIndex/dependencyGraph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAIzD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAM1E;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAMhF;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,CAI/E;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAsBxE;AAED;;;;GAIG;AACH,qBAAa,oBAAoB;IAMnB,OAAO,CAAC,EAAE;IALtB;;;;OAIG;gBACiB,EAAE,EAAE,cAAc;IAEtC;;;;;;;OAOG;IACG,qBAAqB,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAa7D;;;;;;;OAOG;IACG,yBAAyB,CAC7B,YAAY,EAAE,MAAM,EACpB,QAAQ,GAAE,MAAW,GACpB,OAAO,CAAC,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IA6BlD;;;;;;;OAOG;IACG,oBAAoB,CACxB,YAAY,EAAE,MAAM,EACpB,QAAQ,GAAE,MAAW,GACpB,OAAO,CAAC,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAoBlD;;;;OAIG;IACG,0BAA0B,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAyB5D;;;;OAIG;IACG,yBAAyB,IAAI,OAAO,CAAC,IAAI,CAAC;IAuChD,2EAA2E;IAC3E,aAAa,IAAI,OAAO,aAAa,EAAE,UAAU;CAGlD"}

package/dist/codeIndex/dependencyGraph.js

@@ -0,0 +1,241 @@
+/**
+ * Dependency-graph access (Spec 14) — call/import edge construction and the
+ * transitive-closure / cycle / depth queries over them. Extracted from
+ * `CodeIndexDB`; holds only the raw SQLite handle.
+ */
+import { tryParseJson } from './shared.js';
+import { getGraphStats as getGs } from '../graph/callGraph.js';
+/**
+ * Clear call edges for a scope — one file, or the whole table when unscoped.
+ *
+ * @param db The SQLite database handle.
+ * @param filePath When given, only edges owned by functions in this file are removed.
+ */
+export function clearCallEdges(db, filePath) {
+    if (filePath) {
+        db.prepare(`DELETE FROM function_calls WHERE caller_id IN (SELECT id FROM functions WHERE file_path = ?)`).run(filePath);
+    }
+    else {
+        db.prepare('DELETE FROM function_calls').run();
+    }
+}
+/**
+ * Clear dependency edges for a scope — one file, or the whole table when unscoped.
+ *
+ * @param db The SQLite database handle.
+ * @param filePath When given, only edges owned by functions in this file are removed.
+ */
+export function clearDependencyEdges(db, filePath) {
+    if (filePath) {
+        db.prepare(`DELETE FROM function_dependencies WHERE function_id IN (SELECT id FROM functions WHERE file_path = ?)`).run(filePath);
+    }
+    else {
+        db.prepare('DELETE FROM function_dependencies').run();
+    }
+}
+/**
+ * Read the function rows a graph rebuild needs, scoped to a file when given.
+ *
+ * @param db The SQLite database handle.
+ * @param filePath When given, restrict the read to functions in this file.
+ * @returns The function rows (id, name, file_path, metadata_json) used to build edges.
+ */
+export function loadGraphFunctions(db, filePath) {
+    return filePath
+        ? db.prepare('SELECT id, name, file_path, metadata_json FROM functions WHERE file_path = ?').all(filePath)
+        : db.prepare('SELECT id, name, file_path, metadata_json FROM functions').all();
+}
+/**
+ * Rebuild call and dependency edges from function metadata.
+ *
+ * @param db The SQLite database handle.
+ * @param allFns The function rows whose metadata drives the edge inserts.
+ */
+export function insertGraphEdges(db, allFns) {
+    const insertCall = db.prepare('INSERT OR IGNORE INTO function_calls (caller_id, callee_name) VALUES (?, ?)');
+    const insertFnDep = db.prepare('INSERT OR IGNORE INTO function_dependencies (function_id, dependency) VALUES (?, ?)');
+    for (const fn of allFns) {
+        const meta = tryParseJson(fn.metadata_json) ?? {};
+        if (meta.functionCalls) {
+            for (const callee of meta.functionCalls) {
+                insertCall.run(fn.id, callee);
+            }
+        }
+        // Add specifier-level dependencies (e.g., useState, useEffect)
+        const usedImports = meta.usedImports ?? [];
+        for (const imp of usedImports) {
+            insertFnDep.run(fn.id, imp);
+        }
+        // Add module-level dependencies (e.g., react, express) — stored in
+        // metadata.dependencies since v3.0.4 to power the dep: operator
+        const moduleDeps = meta.dependencies ?? [];
+        for (const dep of moduleDeps) {
+            insertFnDep.run(fn.id, dep);
+        }
+    }
+}
+/**
+ * Dependency-graph queries over the `function_calls` and `function_dependencies`
+ * edge tables, keyed by function name. Rebuilds edges from stored metadata and
+ * answers transitive-closure, cycle, and dependency-depth questions over them.
+ */
+export class DependencyGraphIndex {
+    db;
+    /**
+     * Create the index over the shared SQLite handle.
+     *
+     * @param db The SQLite database handle.
+     */
+    constructor(db) {
+        this.db = db;
+    }
+    /**
+     * Rebuild call and dependency edges from stored metadata. When scoped to a
+     * single file, only that file's functions are re-read — avoiding an
+     * O(files × functions) re-read on each detached-audit loop iteration.
+     *
+     * @param filePath When given, rebuild edges for this file only.
+     * @returns Resolves once the edge tables have been rebuilt in a transaction.
+     */
+    async updateDependencyGraph(filePath) {
+        const txn = this.db.transaction(() => {
+            // Rebuild edges from metadata. When scoped to one file, read only that
+            // file's functions — a per-file call previously re-read every function
+            // in the index, making the detached-audit loop O(files × functions).
+            clearCallEdges(this.db, filePath);
+            clearDependencyEdges(this.db, filePath);
+            insertGraphEdges(this.db, loadGraphFunctions(this.db, filePath));
+        });
+        txn.immediate();
+    }
+    /**
+     * Return every function transitively reached from the given function by
+     * following call edges, up to a maximum hop depth.
+     *
+     * @param functionName The starting function name.
+     * @param maxDepth The maximum number of call-edge hops to traverse.
+     * @returns Distinct callee names with their distance, ordered by depth then name.
+     */
+    async getTransitiveDependencies(functionName, maxDepth = 10) {
+        const result = [];
+        const visited = new Set();
+        // Find starting function(s)
+        const startFns = this.db.prepare('SELECT id FROM functions WHERE name = ?').all(functionName);
+        if (startFns.length === 0)
+            return result;
+        // Use recursive CTE for transitive closure
+        const rows = this.db.prepare(`
+      WITH RECURSIVE deps(id, callee_name, depth) AS (
+        SELECT fc.caller_id, fc.callee_name, 1
+        FROM function_calls fc
+        WHERE fc.caller_id IN (SELECT id FROM functions WHERE name = ?)
+        UNION
+        SELECT fc.caller_id, fc.callee_name, deps.depth + 1
+        FROM function_calls fc
+        JOIN deps ON fc.caller_id IN (SELECT id FROM functions WHERE name = deps.callee_name)
+        WHERE deps.depth < ?
+      )
+      SELECT DISTINCT callee_name as name, depth FROM deps ORDER BY depth, name
+    `).all(functionName, maxDepth);
+        return rows;
+    }
+    /**
+     * Return every function that transitively calls the given function, by walking
+     * call edges backward up to a maximum hop depth.
+     *
+     * @param functionName The function whose callers are sought.
+     * @param maxDepth The maximum number of call-edge hops to traverse.
+     * @returns Distinct caller names with their distance, ordered by depth then name.
+     */
+    async getTransitiveCallers(functionName, maxDepth = 10) {
+        const rows = this.db.prepare(`
+      WITH RECURSIVE callers(id, caller_name, depth) AS (
+        SELECT fc.caller_id, f.name, 1
+        FROM function_calls fc
+        JOIN functions f ON f.id = fc.caller_id
+        WHERE fc.callee_name = ?
+        UNION
+        SELECT fc.caller_id, f2.name, callers.depth + 1
+        FROM function_calls fc
+        JOIN functions f2 ON f2.id = fc.caller_id
+        JOIN functions f3 ON f3.name = callers.caller_name AND fc.callee_name = f3.name
+        WHERE callers.depth < ?
+      )
+      SELECT DISTINCT caller_name as name, depth FROM callers ORDER BY depth, name
+    `).all(functionName, maxDepth);
+        return rows;
+    }
+    /**
+     * Find call cycles by walking call edges until a path returns to its start.
+     *
+     * @returns Each cycle as a list of function names in traversal order.
+     */
+    async detectCircularDependencies() {
+        // SQLite recursive CTE for cycle detection
+        const rows = this.db.prepare(`
+      WITH RECURSIVE paths(start_name, path, current_name, depth) AS (
+        SELECT f.name, f.name, fc.callee_name, 1
+        FROM functions f
+        JOIN function_calls fc ON fc.caller_id = f.id
+        UNION
+        SELECT paths.start_name,
+               paths.path || '→' || fc.callee_name,
+               fc.callee_name,
+               paths.depth + 1
+        FROM paths
+        JOIN functions f ON f.name = paths.current_name
+        JOIN function_calls fc ON fc.caller_id = f.id
+        WHERE paths.depth < 20
+          AND instr(paths.path, fc.callee_name) = 0
+      )
+      SELECT DISTINCT path FROM paths
+      WHERE current_name = start_name AND depth > 1
+    `).all();
+        return rows.map(r => r.path.split('→'));
+    }
+    /**
+     * Compute and persist each function's deepest transitive dependency distance.
+     *
+     * @returns Resolves once every function's dependency_depth has been updated.
+     */
+    async calculateDependencyDepths() {
+        const update = this.db.prepare('UPDATE functions SET dependency_depth = ? WHERE id = ?');
+        // One recursive CTE computes every function's deepest transitive dependency
+        // distance in a single query — the previous per-function
+        // `getTransitiveDependencies(fn.name)` loop was one recursive CTE per function
+        // (a query-in-loop N+1). `root_name` carries each start function's name through
+        // the closure, mirroring `getTransitiveDependencies`'s base/recursive terms
+        // (`depth < 10` matches its default maxDepth), so the per-name max depth is
+        // equivalent to the loop's `Math.max(...deps.map(d => d.depth))`.
+        const rows = this.db.prepare(`
+      WITH RECURSIVE deps(root_name, callee_name, depth) AS (
+        SELECT f.name, fc.callee_name, 1
+        FROM functions f
+        JOIN function_calls fc ON fc.caller_id = f.id
+        UNION
+        SELECT deps.root_name, fc.callee_name, deps.depth + 1
+        FROM function_calls fc
+        JOIN deps ON fc.caller_id IN (SELECT id FROM functions WHERE name = deps.callee_name)
+        WHERE deps.depth < 10
+      )
+      SELECT root_name AS name, MAX(depth) AS maxDepth
+      FROM deps
+      GROUP BY root_name
+    `).all();
+        const maxByName = new Map();
+        for (const row of rows)
+            maxByName.set(row.name, row.maxDepth);
+        const functions = this.db.prepare('SELECT id, name FROM functions').all();
+        const txn = this.db.transaction(() => {
+            for (const fn of functions) {
+                update.run(maxByName.get(fn.name) ?? 0, fn.id);
+            }
+        });
+        txn();
+    }
+    /** Get graph statistics — delegates to graph/callGraph.ts (Spec 14 R1). */
+    getGraphStats() {
+        return getGs(this.db);
+    }
+}
+//# sourceMappingURL=dependencyGraph.js.map

package/dist/codeIndex/dependencyGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.js","sourceRoot":"","sources":["../../src/codeIndex/dependencyGraph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,aAAa,IAAI,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,EAAkB,EAAE,QAAiB;IAClE,IAAI,QAAQ,EAAE,CAAC;QACb,EAAE,CAAC,OAAO,CAAC,8FAA8F,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3H,CAAC;SAAM,CAAC;QACN,EAAE,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAAC,GAAG,EAAE,CAAC;IACjD,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,EAAkB,EAAE,QAAiB;IACxE,IAAI,QAAQ,EAAE,CAAC;QACb,EAAE,CAAC,OAAO,CAAC,uGAAuG,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACpI,CAAC;SAAM,CAAC;QACN,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,EAAE,CAAC;IACxD,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,EAAkB,EAAE,QAAiB;IACtE,OAAO,QAAQ;QACb,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,8EAA8E,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAU;QACnH,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,0DAA0D,CAAC,CAAC,GAAG,EAAW,CAAC;AAC5F,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAkB,EAAE,MAAa;IAChE,MAAM,UAAU,GAAG,EAAE,CAAC,OAAO,CAAC,6EAA6E,CAAC,CAAC;IAC7G,MAAM,WAAW,GAAG,EAAE,CAAC,OAAO,CAAC,qFAAqF,CAAC,CAAC;IACtH,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,YAAY,CAAC,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAClD,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACxC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,+DAA+D;QAC/D,MAAM,WAAW,GAAa,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC;QACrD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC9B,CAAC;QACD,mEAAmE;QACnE,gEAAgE;QAChE,MAAM,UAAU,GAAa,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;QACrD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IAMX;IALpB;;;;OAIG;IACH,YAAoB,EAAkB;QAAlB,OAAE,GAAF,EAAE,CAAgB;IAAG,CAAC;IAE1C;;;;;;;OAOG;IACH,KAAK,CAAC,qBAAqB,CAAC,QAAiB;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,uEAAuE;YACvE,uEAAuE;YACvE,qEAAqE;YACrE,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAClC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,yBAAyB,CAC7B,YAAoB,EACpB,WAAmB,EAAE;QAErB,MAAM,MAAM,GAA2C,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC9B,yCAAyC,CAC1C,CAAC,GAAG,CAAC,YAAY,CAAU,CAAC;QAE7B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEzC,2CAA2C;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;KAY5B,CAAC,CAAC,GAAG,CAAC,YAAY,EAAE,QAAQ,CAA2C,CAAC;QAEzE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,oBAAoB,CACxB,YAAoB,EACpB,WAAmB,EAAE;QAErB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;KAc5B,CAAC,CAAC,GAAG,CAAC,YAAY,EAAE,QAAQ,CAA2C,CAAC;QAEzE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,0BAA0B;QAC9B,2CAA2C;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;;KAkB5B,CAAC,CAAC,GAAG,EAA6B,CAAC;QAEpC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,yBAAyB;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC;QAEzF,4EAA4E;QAC5E,yDAAyD;QACzD,+EAA+E;QAC/E,gFAAgF;QAChF,4EAA4E;QAC5E,4EAA4E;QAC5E,kEAAkE;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;KAc5B,CAAC,CAAC,GAAG,EAA+C,CAAC;QAEtD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE9D,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gCAAgC,CAAC,CAAC,GAAG,EAAW,CAAC;QACnF,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YACjD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,GAAG,EAAE,CAAC;IACR,CAAC;IAED,2EAA2E;IAC3E,aAAa;QACX,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;CACF"}