optave-codegraph 3.13.0

package/dist/graph/algorithms/shortest-path.js

@@ -0,0 +1,55 @@
+import { loadNative } from '../../infrastructure/native.js';
+/**
+ * BFS-based shortest path on a CodeGraph.
+ *
+ * Tries the native Rust implementation first, falls back to JS.
+ *
+ * @returns Path from fromId to toId (inclusive), or null if unreachable
+ */
+export function shortestPath(graph, fromId, toId) {
+    const from = String(fromId);
+    const to = String(toId);
+    if (!graph.hasNode(from) || !graph.hasNode(to))
+        return null;
+    if (from === to)
+        return [from];
+    const native = loadNative();
+    if (native?.shortestPath) {
+        let edges = graph.toEdgeArray();
+        if (!graph.directed) {
+            // Undirected: toEdgeArray() deduplicates to one canonical direction;
+            // mirror each edge so the Rust BFS can traverse in both directions.
+            edges = [...edges, ...edges.map((e) => ({ source: e.target, target: e.source }))];
+        }
+        const result = native.shortestPath(edges, from, to);
+        return result.length > 0 ? result : null;
+    }
+    return shortestPathJS(graph, from, to);
+}
+/** Pure JS fallback for shortest path. */
+function shortestPathJS(graph, from, to) {
+    const parent = new Map();
+    parent.set(from, null);
+    const queue = [from];
+    let head = 0;
+    while (head < queue.length) {
+        const current = queue[head++];
+        for (const neighbor of graph.successors(current)) {
+            if (parent.has(neighbor))
+                continue;
+            parent.set(neighbor, current);
+            if (neighbor === to) {
+                const path = [];
+                let node = to;
+                while (node !== null) {
+                    path.push(node);
+                    node = parent.get(node) ?? null;
+                }
+                return path.reverse();
+            }
+            queue.push(neighbor);
+        }
+    }
+    return null;
+}
+//# sourceMappingURL=shortest-path.js.map

package/dist/graph/algorithms/shortest-path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-path.js","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAG5D;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,KAAgB,EAAE,MAAc,EAAE,IAAY;IACzE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAExB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/B,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,IAAI,MAAM,EAAE,YAAY,EAAE,CAAC;QACzB,IAAI,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpB,qEAAqE;YACrE,oEAAoE;YACpE,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QACpD,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3C,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,0CAA0C;AAC1C,SAAS,cAAc,CAAC,KAAgB,EAAE,IAAY,EAAE,EAAU;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAChD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAE,CAAC;QAC/B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACjD,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACnC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAa,EAAE,CAAC;gBAC1B,IAAI,IAAI,GAAkB,EAAE,CAAC;gBAC7B,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;gBAClC,CAAC;gBACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/graph/algorithms/tarjan.d.ts

@@ -0,0 +1,9 @@
+import type { CodeGraph } from '../model.js';
+/**
+ * Tarjan's strongly connected components algorithm.
+ * Operates on a CodeGraph instance.
+ *
+ * @returns SCCs with length > 1 (cycles)
+ */
+export declare function tarjan(graph: CodeGraph): string[][];
+//# sourceMappingURL=tarjan.d.ts.map

package/dist/graph/algorithms/tarjan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tarjan.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/tarjan.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,EAAE,EAAE,CA8CnD"}

package/dist/graph/algorithms/tarjan.js

@@ -0,0 +1,52 @@
+/**
+ * Tarjan's strongly connected components algorithm.
+ * Operates on a CodeGraph instance.
+ *
+ * @returns SCCs with length > 1 (cycles)
+ */
+export function tarjan(graph) {
+    let index = 0;
+    const stack = [];
+    const onStack = new Set();
+    const indices = new Map();
+    const lowlinks = new Map();
+    const sccs = [];
+    function strongconnect(v) {
+        // Assign the next discovery index and initialise lowlink to self
+        indices.set(v, index);
+        lowlinks.set(v, index);
+        index++;
+        stack.push(v);
+        onStack.add(v);
+        for (const w of graph.successors(v)) {
+            if (!indices.has(w)) {
+                // Tree edge: recurse then propagate lowlink upward
+                strongconnect(w);
+                lowlinks.set(v, Math.min(lowlinks.get(v), lowlinks.get(w)));
+            }
+            else if (onStack.has(w)) {
+                // Back/cross edge to a node still on the stack: update lowlink via index
+                lowlinks.set(v, Math.min(lowlinks.get(v), indices.get(w)));
+            }
+        }
+        // v is the root of an SCC when its lowlink equals its own discovery index
+        if (lowlinks.get(v) === indices.get(v)) {
+            const scc = [];
+            let w;
+            do {
+                w = stack.pop();
+                onStack.delete(w);
+                scc.push(w);
+            } while (w !== v);
+            // Only report non-trivial SCCs (length > 1 = a real cycle)
+            if (scc.length > 1)
+                sccs.push(scc);
+        }
+    }
+    for (const id of graph.nodeIds()) {
+        if (!indices.has(id))
+            strongconnect(id);
+    }
+    return sccs;
+}
+//# sourceMappingURL=tarjan.js.map

package/dist/graph/algorithms/tarjan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tarjan.js","sourceRoot":"","sources":["../../../src/graph/algorithms/tarjan.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,KAAgB;IACrC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,IAAI,GAAe,EAAE,CAAC;IAE5B,SAAS,aAAa,CAAC,CAAS;QAC9B,iEAAiE;QACjE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACvB,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,mDAAmD;gBACnD,aAAa,CAAC,CAAC,CAAC,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAChE,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,yEAAyE;gBACzE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,0EAA0E;QAC1E,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,IAAI,CAAqB,CAAC;YAC1B,GAAG,CAAC;gBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAClB,2DAA2D;YAC3D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,aAAa,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/graph/builders/dependency.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Build a CodeGraph from the SQLite database.
+ * Replaces inline graph construction in cycles.js, communities.js, viewer.js, export.js.
+ */
+import { Repository } from '../../db/index.js';
+import type { BetterSqlite3Database } from '../../types.js';
+import { CodeGraph } from '../model.js';
+export interface DependencyGraphOptions {
+    fileLevel?: boolean;
+    noTests?: boolean;
+    minConfidence?: number;
+}
+/**
+ * Build a dependency graph from an open database or Repository instance.
+ * Supports both file-level (import edges) and function-level (call edges) graphs.
+ */
+export declare function buildDependencyGraph(dbOrRepo: BetterSqlite3Database | Repository, opts?: DependencyGraphOptions): CodeGraph;
+//# sourceMappingURL=dependency.d.ts.map

package/dist/graph/builders/dependency.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.d.ts","sourceRoot":"","sources":["../../../src/graph/builders/dependency.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAKL,UAAU,EACX,MAAM,mBAAmB,CAAC;AAE3B,OAAO,KAAK,EACV,qBAAqB,EAKtB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,MAAM,WAAW,sBAAsB;IACrC,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,qBAAqB,GAAG,UAAU,EAC5C,IAAI,GAAE,sBAA2B,GAChC,SAAS,CAQX"}

package/dist/graph/builders/dependency.js

@@ -0,0 +1,101 @@
+/**
+ * Build a CodeGraph from the SQLite database.
+ * Replaces inline graph construction in cycles.js, communities.js, viewer.js, export.js.
+ */
+import { getCallableNodes, getCallEdges, getFileNodesAll, getImportEdges, Repository, } from '../../db/index.js';
+import { isTestFile } from '../../infrastructure/test-filter.js';
+import { CodeGraph } from '../model.js';
+/**
+ * Build a dependency graph from an open database or Repository instance.
+ * Supports both file-level (import edges) and function-level (call edges) graphs.
+ */
+export function buildDependencyGraph(dbOrRepo, opts = {}) {
+    const fileLevel = opts.fileLevel !== false;
+    const noTests = opts.noTests || false;
+    if (fileLevel) {
+        return buildFileLevelGraph(dbOrRepo, noTests);
+    }
+    return buildFunctionLevelGraph(dbOrRepo, noTests, opts.minConfidence);
+}
+function buildFileLevelGraph(dbOrRepo, noTests) {
+    const graph = new CodeGraph();
+    const isRepo = dbOrRepo instanceof Repository;
+    let nodes = isRepo ? dbOrRepo.getFileNodesAll() : getFileNodesAll(dbOrRepo);
+    if (noTests)
+        nodes = nodes.filter((n) => !isTestFile(n.file));
+    const nodeIds = new Set();
+    for (const n of nodes) {
+        graph.addNode(String(n.id), { label: n.file, file: n.file, dbId: n.id });
+        nodeIds.add(n.id);
+    }
+    const edges = isRepo ? dbOrRepo.getImportEdges() : getImportEdges(dbOrRepo);
+    for (const e of edges) {
+        if (!nodeIds.has(e.source_id) || !nodeIds.has(e.target_id))
+            continue;
+        const src = String(e.source_id);
+        const tgt = String(e.target_id);
+        if (src === tgt)
+            continue;
+        if (!graph.hasEdge(src, tgt)) {
+            graph.addEdge(src, tgt, { kind: 'imports' });
+        }
+    }
+    return graph;
+}
+/**
+ * Fetch call edges from `dbOrRepo`, optionally filtered by a minimum confidence
+ * threshold. When `minConfidence` is unset, all call edges are returned.
+ */
+function resolveCallEdges(dbOrRepo, isRepo, minConfidence) {
+    if (minConfidence == null) {
+        return isRepo
+            ? dbOrRepo.getCallEdges()
+            : getCallEdges(dbOrRepo);
+    }
+    if (isRepo) {
+        // Trade-off: Repository.getCallEdges() returns all call edges, so we
+        // filter in JS. This is O(all call edges) rather than the SQL path's
+        // indexed WHERE clause. Acceptable for current data sizes; a dedicated
+        // getCallEdgesByMinConfidence(threshold) method on the Repository
+        // interface would be the proper fix if this becomes a bottleneck.
+        return dbOrRepo
+            .getCallEdges()
+            .filter((e) => e.confidence != null && e.confidence >= minConfidence);
+    }
+    return dbOrRepo
+        .prepare("SELECT source_id, target_id FROM edges WHERE kind = 'calls' AND confidence >= ?")
+        .all(minConfidence);
+}
+function buildFunctionLevelGraph(dbOrRepo, noTests, minConfidence) {
+    const graph = new CodeGraph();
+    const isRepo = dbOrRepo instanceof Repository;
+    let nodes = isRepo
+        ? dbOrRepo.getCallableNodes()
+        : getCallableNodes(dbOrRepo);
+    if (noTests)
+        nodes = nodes.filter((n) => !isTestFile(n.file));
+    const nodeIds = new Set();
+    for (const n of nodes) {
+        graph.addNode(String(n.id), {
+            label: n.name,
+            file: n.file,
+            kind: n.kind,
+            dbId: n.id,
+        });
+        nodeIds.add(n.id);
+    }
+    const edges = resolveCallEdges(dbOrRepo, isRepo, minConfidence);
+    for (const e of edges) {
+        if (!nodeIds.has(e.source_id) || !nodeIds.has(e.target_id))
+            continue;
+        const src = String(e.source_id);
+        const tgt = String(e.target_id);
+        if (src === tgt)
+            continue;
+        if (!graph.hasEdge(src, tgt)) {
+            graph.addEdge(src, tgt, { kind: 'calls' });
+        }
+    }
+    return graph;
+}
+//# sourceMappingURL=dependency.js.map

package/dist/graph/builders/dependency.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.js","sourceRoot":"","sources":["../../../src/graph/builders/dependency.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACL,gBAAgB,EAChB,YAAY,EACZ,eAAe,EACf,cAAc,EACd,UAAU,GACX,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AAQjE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAQxC;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAA4C,EAC5C,OAA+B,EAAE;IAEjC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC;IAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;IAEtC,IAAI,SAAS,EAAE,CAAC;QACd,OAAO,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,uBAAuB,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,mBAAmB,CAC1B,QAA4C,EAC5C,OAAgB;IAEhB,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,QAAQ,YAAY,UAAU,CAAC;IAE9C,IAAI,KAAK,GAAkB,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC3F,IAAI,OAAO;QAAE,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAE9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAyB,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;IAClG,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAAE,SAAS;QACrE,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAChC,IAAI,GAAG,KAAK,GAAG;YAAE,SAAS;QAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAOD;;;GAGG;AACH,SAAS,gBAAgB,CACvB,QAA4C,EAC5C,MAAe,EACf,aAAsB;IAEtB,IAAI,aAAa,IAAI,IAAI,EAAE,CAAC;QAC1B,OAAO,MAAM;YACX,CAAC,CAAE,QAAuB,CAAC,YAAY,EAAE;YACzC,CAAC,CAAC,YAAY,CAAC,QAAiC,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,MAAM,EAAE,CAAC;QACX,qEAAqE;QACrE,qEAAqE;QACrE,uEAAuE;QACvE,kEAAkE;QAClE,kEAAkE;QAClE,OAAQ,QAAuB;aAC5B,YAAY,EAAE;aACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;IAC1E,CAAC;IACD,OAAQ,QAAkC;SACvC,OAAO,CACN,iFAAiF,CAClF;SACA,GAAG,CAAC,aAAa,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,uBAAuB,CAC9B,QAA4C,EAC5C,OAAgB,EAChB,aAAsB;IAEtB,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,QAAQ,YAAY,UAAU,CAAC;IAE9C,IAAI,KAAK,GAAsB,MAAM;QACnC,CAAC,CAAE,QAAuB,CAAC,gBAAgB,EAAE;QAC7C,CAAC,CAAC,gBAAgB,CAAC,QAAiC,CAAC,CAAC;IACxD,IAAI,OAAO;QAAE,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAE9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAC1B,KAAK,EAAE,CAAC,CAAC,IAAI;YACb,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,EAAE;SACX,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;IAChE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAAE,SAAS;QACrE,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAChC,IAAI,GAAG,KAAK,GAAG;YAAE,SAAS;QAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/graph/builders/index.d.ts

@@ -0,0 +1,4 @@
+export { buildDependencyGraph } from './dependency.js';
+export { buildStructureGraph } from './structure.js';
+export { buildTemporalGraph } from './temporal.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/builders/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/graph/builders/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC"}

package/dist/graph/builders/index.js

@@ -0,0 +1,4 @@
+export { buildDependencyGraph } from './dependency.js';
+export { buildStructureGraph } from './structure.js';
+export { buildTemporalGraph } from './temporal.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/builders/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/graph/builders/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC"}

package/dist/graph/builders/structure.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Build a containment graph (directory -> file) from the SQLite database.
+ */
+import type { BetterSqlite3Database } from '../../types.js';
+import { CodeGraph } from '../model.js';
+/**
+ * Build a directed graph with directory->file containment edges.
+ */
+export declare function buildStructureGraph(db: BetterSqlite3Database): CodeGraph;
+//# sourceMappingURL=structure.d.ts.map

package/dist/graph/builders/structure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"structure.d.ts","sourceRoot":"","sources":["../../../src/graph/builders/structure.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAkBxC;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,qBAAqB,GAAG,SAAS,CA+BxE"}

package/dist/graph/builders/structure.js

@@ -0,0 +1,33 @@
+/**
+ * Build a containment graph (directory -> file) from the SQLite database.
+ */
+import { CodeGraph } from '../model.js';
+/**
+ * Build a directed graph with directory->file containment edges.
+ */
+export function buildStructureGraph(db) {
+    const graph = new CodeGraph();
+    const dirs = db.prepare("SELECT id, name FROM nodes WHERE kind = 'directory'").all();
+    for (const d of dirs) {
+        graph.addNode(String(d.id), { label: d.name, kind: 'directory' });
+    }
+    const files = db.prepare("SELECT id, name, file FROM nodes WHERE kind = 'file'").all();
+    for (const f of files) {
+        graph.addNode(String(f.id), { label: f.name, kind: 'file', file: f.file });
+    }
+    const containsEdges = db
+        .prepare(`
+      SELECT e.source_id, e.target_id
+      FROM edges e
+      JOIN nodes n ON e.source_id = n.id
+      WHERE e.kind = 'contains' AND n.kind = 'directory'
+    `)
+        .all();
+    for (const e of containsEdges) {
+        graph.addEdge(String(e.source_id), String(e.target_id), {
+            kind: 'contains',
+        });
+    }
+    return graph;
+}
+//# sourceMappingURL=structure.js.map

package/dist/graph/builders/structure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"structure.js","sourceRoot":"","sources":["../../../src/graph/builders/structure.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAkBxC;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAyB;IAC3D,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;IAE9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAS,qDAAqD,CAAC,CAAC,GAAG,EAAE,CAAC;IAE7F,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAU,sDAAsD,CAAC,CAAC,GAAG,EAAE,CAAC;IAEhG,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,aAAa,GAAG,EAAE;SACrB,OAAO,CAAkB;;;;;KAKzB,CAAC;SACD,GAAG,EAAE,CAAC;IAET,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;YACtD,IAAI,EAAE,UAAU;SACjB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/graph/builders/temporal.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Build a co-change (temporal) graph weighted by Jaccard similarity.
+ */
+import type { BetterSqlite3Database } from '../../types.js';
+import { CodeGraph } from '../model.js';
+export interface TemporalGraphOptions {
+    minJaccard?: number;
+}
+/**
+ * Build an undirected graph weighted by Jaccard similarity from the co_changes table.
+ */
+export declare function buildTemporalGraph(db: BetterSqlite3Database, opts?: TemporalGraphOptions): CodeGraph;
+//# sourceMappingURL=temporal.d.ts.map

package/dist/graph/builders/temporal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.d.ts","sourceRoot":"","sources":["../../../src/graph/builders/temporal.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,MAAM,WAAW,oBAAoB;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAYD;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,EAAE,EAAE,qBAAqB,EACzB,IAAI,GAAE,oBAAyB,GAC9B,SAAS,CAuBX"}

package/dist/graph/builders/temporal.js

@@ -0,0 +1,29 @@
+/**
+ * Build a co-change (temporal) graph weighted by Jaccard similarity.
+ */
+import { CodeGraph } from '../model.js';
+/**
+ * Build an undirected graph weighted by Jaccard similarity from the co_changes table.
+ */
+export function buildTemporalGraph(db, opts = {}) {
+    const minJaccard = opts.minJaccard ?? 0.0;
+    const graph = new CodeGraph({ directed: false });
+    // Check if co_changes table exists
+    const tableCheck = db
+        .prepare("SELECT name FROM sqlite_master WHERE type='table' AND name='co_changes'")
+        .get();
+    if (!tableCheck)
+        return graph;
+    const rows = db
+        .prepare('SELECT file_a, file_b, jaccard FROM co_changes WHERE jaccard >= ?')
+        .all(minJaccard);
+    for (const r of rows) {
+        if (!graph.hasNode(r.file_a))
+            graph.addNode(r.file_a, { label: r.file_a });
+        if (!graph.hasNode(r.file_b))
+            graph.addNode(r.file_b, { label: r.file_b });
+        graph.addEdge(r.file_a, r.file_b, { jaccard: r.jaccard });
+    }
+    return graph;
+}
+//# sourceMappingURL=temporal.js.map

package/dist/graph/builders/temporal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal.js","sourceRoot":"","sources":["../../../src/graph/builders/temporal.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAgBxC;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,EAAyB,EACzB,OAA6B,EAAE;IAE/B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAEjD,mCAAmC;IACnC,MAAM,UAAU,GAAG,EAAE;SAClB,OAAO,CACN,yEAAyE,CAC1E;SACA,GAAG,EAAE,CAAC;IACT,IAAI,CAAC,UAAU;QAAE,OAAO,KAAK,CAAC;IAE9B,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAc,mEAAmE,CAAC;SACzF,GAAG,CAAC,UAAU,CAAC,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3E,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/graph/classifiers/index.d.ts

@@ -0,0 +1,3 @@
+export { DEFAULT_WEIGHTS, minMaxNormalize, ROLE_WEIGHTS, scoreRisk } from './risk.js';
+export { classifyRoles, FRAMEWORK_ENTRY_PREFIXES } from './roles.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/classifiers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/graph/classifiers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC"}

package/dist/graph/classifiers/index.js

@@ -0,0 +1,3 @@
+export { DEFAULT_WEIGHTS, minMaxNormalize, ROLE_WEIGHTS, scoreRisk } from './risk.js';
+export { classifyRoles, FRAMEWORK_ENTRY_PREFIXES } from './roles.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/classifiers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/graph/classifiers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtF,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC"}

package/dist/graph/classifiers/risk.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Risk scoring — pure logic, no DB.
+ */
+import type { Role } from '../../types.js';
+export interface RiskWeights {
+    fanIn: number;
+    complexity: number;
+    churn: number;
+    role: number;
+    mi: number;
+}
+export declare const DEFAULT_WEIGHTS: RiskWeights;
+export declare const ROLE_WEIGHTS: Record<string, number>;
+/** Min-max normalize an array of numbers. All-equal → all zeros. */
+export declare function minMaxNormalize(values: number[]): number[];
+export interface RiskItem {
+    fan_in: number;
+    cognitive: number;
+    churn: number;
+    mi: number;
+    role: Role | string | null;
+}
+export interface RiskResult {
+    normFanIn: number;
+    normComplexity: number;
+    normChurn: number;
+    normMI: number;
+    roleWeight: number;
+    riskScore: number;
+}
+export interface ScoreRiskOpts {
+    roleWeights?: Record<string, number>;
+    defaultRoleWeight?: number;
+}
+/**
+ * Score risk for a list of items.
+ */
+export declare function scoreRisk(items: RiskItem[], weights?: Partial<RiskWeights>, opts?: ScoreRiskOpts): RiskResult[];
+//# sourceMappingURL=risk.d.ts.map

package/dist/graph/classifiers/risk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"risk.d.ts","sourceRoot":"","sources":["../../../src/graph/classifiers/risk.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAE3C,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ;AAMD,eAAO,MAAM,eAAe,EAAE,WAM7B,CAAC;AAMF,eAAO,MAAM,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAY/C,CAAC;AAIF,oEAAoE;AACpE,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAM1D;AAMD,MAAM,WAAW,QAAQ;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,aAAa;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrC,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,QAAQ,EAAE,EACjB,OAAO,GAAE,OAAO,CAAC,WAAW,CAAM,EAClC,IAAI,GAAE,aAAkB,GACvB,UAAU,EAAE,CAkCd"}

package/dist/graph/classifiers/risk.js

@@ -0,0 +1,78 @@
+/**
+ * Risk scoring — pure logic, no DB.
+ */
+// Weights sum to 1.0. Complexity gets the highest weight because cognitive load
+// is the strongest predictor of defect density. Fan-in and churn are next as
+// they reflect coupling and volatility. Role adds architectural context, and MI
+// (maintainability index) is a weaker composite signal, so it gets the least.
+export const DEFAULT_WEIGHTS = {
+    fanIn: 0.25,
+    complexity: 0.3,
+    churn: 0.2,
+    role: 0.15,
+    mi: 0.1,
+};
+// Role weights reflect structural importance: core modules are central to the
+// dependency graph, utilities are widely imported, entry points are API
+// surfaces. Adapters bridge subsystems but are replaceable. Leaves, dead
+// code, and test-only symbols have minimal downstream impact.
+export const ROLE_WEIGHTS = {
+    core: 1.0,
+    utility: 0.9,
+    entry: 0.8,
+    adapter: 0.5,
+    leaf: 0.2,
+    'test-only': 0.1,
+    dead: 0.1,
+    'dead-leaf': 0.0,
+    'dead-entry': 0.3,
+    'dead-ffi': 0.05,
+    'dead-unresolved': 0.15,
+};
+const DEFAULT_ROLE_WEIGHT = 0.5;
+/** Min-max normalize an array of numbers. All-equal → all zeros. */
+export function minMaxNormalize(values) {
+    const min = Math.min(...values);
+    const max = Math.max(...values);
+    if (max === min)
+        return values.map(() => 0);
+    const range = max - min;
+    return values.map((v) => (v - min) / range);
+}
+function round4(n) {
+    return Math.round(n * 10000) / 10000;
+}
+/**
+ * Score risk for a list of items.
+ */
+export function scoreRisk(items, weights = {}, opts = {}) {
+    const w = { ...DEFAULT_WEIGHTS, ...weights };
+    const rw = opts.roleWeights || ROLE_WEIGHTS;
+    const drw = opts.defaultRoleWeight ?? DEFAULT_ROLE_WEIGHT;
+    const fanIns = items.map((r) => r.fan_in);
+    const cognitives = items.map((r) => r.cognitive);
+    const churns = items.map((r) => r.churn);
+    const mis = items.map((r) => r.mi);
+    const normFanIns = minMaxNormalize(fanIns);
+    const normCognitives = minMaxNormalize(cognitives);
+    const normChurns = minMaxNormalize(churns);
+    const normMIsRaw = minMaxNormalize(mis);
+    const normMIs = normMIsRaw.map((v) => round4(1 - v));
+    return items.map((r, i) => {
+        const roleWeight = (r.role != null ? rw[r.role] : undefined) ?? drw;
+        const nfi = normFanIns[i] ?? 0;
+        const nci = normCognitives[i] ?? 0;
+        const nch = normChurns[i] ?? 0;
+        const nmi = normMIs[i] ?? 0;
+        const riskScore = w.fanIn * nfi + w.complexity * nci + w.churn * nch + w.role * roleWeight + w.mi * nmi;
+        return {
+            normFanIn: round4(nfi),
+            normComplexity: round4(nci),
+            normChurn: round4(nch),
+            normMI: round4(nmi),
+            roleWeight,
+            riskScore: round4(riskScore),
+        };
+    });
+}
+//# sourceMappingURL=risk.js.map

package/dist/graph/classifiers/risk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"risk.js","sourceRoot":"","sources":["../../../src/graph/classifiers/risk.ts"],"names":[],"mappings":"AAAA;;GAEG;AAYH,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,eAAe,GAAgB;IAC1C,KAAK,EAAE,IAAI;IACX,UAAU,EAAE,GAAG;IACf,KAAK,EAAE,GAAG;IACV,IAAI,EAAE,IAAI;IACV,EAAE,EAAE,GAAG;CACR,CAAC;AAEF,8EAA8E;AAC9E,wEAAwE;AACxE,yEAAyE;AACzE,8DAA8D;AAC9D,MAAM,CAAC,MAAM,YAAY,GAA2B;IAClD,IAAI,EAAE,GAAG;IACT,OAAO,EAAE,GAAG;IACZ,KAAK,EAAE,GAAG;IACV,OAAO,EAAE,GAAG;IACZ,IAAI,EAAE,GAAG;IACT,WAAW,EAAE,GAAG;IAChB,IAAI,EAAE,GAAG;IACT,WAAW,EAAE,GAAG;IAChB,YAAY,EAAE,GAAG;IACjB,UAAU,EAAE,IAAI;IAChB,iBAAiB,EAAE,IAAI;CACxB,CAAC;AAEF,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,oEAAoE;AACpE,MAAM,UAAU,eAAe,CAAC,MAAgB;IAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,IAAI,GAAG,KAAK,GAAG;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;IACxB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,MAAM,CAAC,CAAS;IACvB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AACvC,CAAC;AAwBD;;GAEG;AACH,MAAM,UAAU,SAAS,CACvB,KAAiB,EACjB,UAAgC,EAAE,EAClC,OAAsB,EAAE;IAExB,MAAM,CAAC,GAAgB,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,IAAI,YAAY,CAAC;IAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,IAAI,mBAAmB,CAAC;IAE1D,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEnC,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,cAAc,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAErD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC;QACpE,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,SAAS,GACb,CAAC,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,UAAU,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC;QAExF,OAAO;YACL,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC;YACtB,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC;YAC3B,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC;YACtB,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC;YACnB,UAAU;YACV,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC;SAC7B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/graph/classifiers/roles.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Node role classification — pure logic, no DB.
+ *
+ * Roles: entry, core, utility, adapter, leaf, dead-*, test-only
+ *
+ * Dead sub-categories refine the coarse "dead" bucket:
+ *   dead-leaf       — parameters, properties, constants (leaf nodes by definition)
+ *   dead-entry      — framework dispatch: CLI commands, MCP tools, event handlers
+ *   dead-ffi        — cross-language FFI boundaries (e.g. Rust napi-rs bindings)
+ *   dead-unresolved — genuinely unreferenced callables (the real dead code)
+ */
+import type { Role } from '../../types.js';
+export declare const FRAMEWORK_ENTRY_PREFIXES: readonly string[];
+export interface ClassifiableNode {
+    kind?: string;
+    file?: string;
+}
+export declare function median(sorted: number[]): number;
+export interface RoleClassificationNode {
+    id: string;
+    name: string;
+    kind?: string;
+    file?: string;
+    fanIn: number;
+    fanOut: number;
+    isExported: boolean;
+    testOnlyFanIn?: number;
+    productionFanIn?: number;
+    /**
+     * True when the same file contains at least one callable connected to the graph
+     * (fanIn > 0 or fanOut > 0) that is not itself an annotation-only kind.
+     * Annotation-only kinds are `constant` and all members of `TYPE_DEF_KINDS`
+     * (struct, enum, trait, type, interface, record) — these are excluded because
+     * they are consumed via references/type-annotations rather than call edges and
+     * would otherwise produce a circular dependency in the active-file heuristic.
+     * Populated only for `constant` and `TYPE_DEF_KINDS` nodes; `undefined` for
+     * regular callables (functions, methods, classes, etc.) which don't need it.
+     */
+    hasActiveFileSiblings?: boolean;
+}
+/**
+ * Classify nodes into architectural roles based on fan-in/fan-out metrics.
+ */
+export declare function classifyRoles(nodes: RoleClassificationNode[], medianOverrides?: {
+    fanIn: number;
+    fanOut: number;
+}): Map<string, Role>;
+//# sourceMappingURL=roles.d.ts.map

package/dist/graph/classifiers/roles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"roles.d.ts","sourceRoot":"","sources":["../../../src/graph/classifiers/roles.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAe,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAExD,eAAO,MAAM,wBAAwB,EAAE,SAAS,MAAM,EAAqC,CAAC;AAoC5F,MAAM,WAAW,gBAAgB;IAC/B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AA0BD,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAI/C;AAED,MAAM,WAAW,sBAAsB;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,OAAO,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;;;;;OASG;IACH,qBAAqB,CAAC,EAAE,OAAO,CAAC;CACjC;AAuGD;;GAEG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,sBAAsB,EAAE,EAC/B,eAAe,CAAC,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAClD,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAUnB"}