@optave/codegraph 3.2.0 → 3.3.0

package/dist/features/triage.js

@@ -0,0 +1,133 @@
+import { openRepo } from '../db/index.js';
+import { DEFAULT_WEIGHTS, scoreRisk } from '../graph/classifiers/risk.js';
+import { loadConfig } from '../infrastructure/config.js';
+import { warn } from '../infrastructure/logger.js';
+import { isTestFile } from '../infrastructure/test-filter.js';
+import { paginateResult } from '../shared/paginate.js';
+// ─── Scoring ─────────────────────────────────────────────────────────
+const SORT_FNS = {
+    risk: (a, b) => b.riskScore - a.riskScore,
+    complexity: (a, b) => b.cognitive - a.cognitive,
+    churn: (a, b) => b.churn - a.churn,
+    'fan-in': (a, b) => b.fanIn - a.fanIn,
+    mi: (a, b) => a.maintainabilityIndex - b.maintainabilityIndex,
+};
+/**
+ * Build scored triage items from raw rows and risk metrics.
+ * @param {object[]} rows - Raw DB rows
+ * @param {object[]} riskMetrics - Per-row risk metric objects from scoreRisk
+ * @returns {object[]}
+ */
+function buildTriageItems(rows, riskMetrics) {
+    return rows.map((r, i) => ({
+        name: r.name,
+        kind: r.kind,
+        file: r.file,
+        line: r.line,
+        role: r.role || null,
+        fanIn: r.fan_in,
+        cognitive: r.cognitive,
+        churn: r.churn,
+        maintainabilityIndex: r.mi,
+        normFanIn: riskMetrics[i].normFanIn,
+        normComplexity: riskMetrics[i].normComplexity,
+        normChurn: riskMetrics[i].normChurn,
+        normMI: riskMetrics[i].normMI,
+        roleWeight: riskMetrics[i].roleWeight,
+        riskScore: riskMetrics[i].riskScore,
+    }));
+}
+/**
+ * Compute signal coverage and summary statistics.
+ * @param {object[]} filtered - All filtered rows
+ * @param {object[]} scored - Scored and filtered items
+ * @param {object} weights - Active weights
+ * @returns {object}
+ */
+function computeTriageSummary(filtered, scored, weights) {
+    const signalCoverage = {
+        complexity: round4(filtered.filter((r) => r.cognitive > 0).length / filtered.length),
+        churn: round4(filtered.filter((r) => r.churn > 0).length / filtered.length),
+        fanIn: round4(filtered.filter((r) => r.fan_in > 0).length / filtered.length),
+        mi: round4(filtered.filter((r) => r.mi > 0).length / filtered.length),
+    };
+    const scores = scored.map((it) => it.riskScore);
+    const avgScore = scores.length > 0 ? round4(scores.reduce((a, b) => a + b, 0) / scores.length) : 0;
+    const maxScore = scores.length > 0 ? round4(Math.max(...scores)) : 0;
+    return {
+        total: filtered.length,
+        analyzed: scored.length,
+        avgScore,
+        maxScore,
+        weights,
+        signalCoverage,
+    };
+}
+// ─── Data Function ────────────────────────────────────────────────────
+const EMPTY_SUMMARY = (weights) => ({
+    total: 0,
+    analyzed: 0,
+    avgScore: 0,
+    maxScore: 0,
+    weights,
+    signalCoverage: {},
+});
+/**
+ * Compute composite risk scores for all symbols.
+ *
+ * @param {string} [customDbPath] - Path to graph.db
+ * @param {object} [opts]
+ * @returns {{ items: object[], summary: object, _pagination?: object }}
+ */
+export function triageData(customDbPath, opts = {}) {
+    const { repo, close } = openRepo(customDbPath, opts);
+    try {
+        const noTests = opts.noTests || false;
+        const minScore = opts.minScore != null ? Number(opts.minScore) : null;
+        const sort = opts.sort || 'risk';
+        const config = opts.config || loadConfig();
+        const riskConfig = config.risk || {};
+        const weights = { ...DEFAULT_WEIGHTS, ...(riskConfig.weights || {}), ...(opts.weights || {}) };
+        const riskOpts = {
+            roleWeights: riskConfig.roleWeights,
+            defaultRoleWeight: riskConfig.defaultRoleWeight,
+        };
+        let rows;
+        try {
+            rows = repo.findNodesForTriage({
+                noTests,
+                file: opts.file || null,
+                kind: opts.kind || null,
+                role: opts.role || null,
+            });
+        }
+        catch (err) {
+            warn(`triage query failed: ${err.message}`);
+            return { items: [], summary: EMPTY_SUMMARY(weights) };
+        }
+        const filtered = noTests ? rows.filter((r) => !isTestFile(r.file)) : rows;
+        if (filtered.length === 0) {
+            return { items: [], summary: EMPTY_SUMMARY(weights) };
+        }
+        const riskMetrics = scoreRisk(filtered, weights, riskOpts);
+        const items = buildTriageItems(filtered, riskMetrics);
+        const scored = minScore != null ? items.filter((it) => it.riskScore >= minScore) : items;
+        scored.sort(SORT_FNS[sort] || SORT_FNS.risk);
+        const result = {
+            items: scored,
+            summary: computeTriageSummary(filtered, scored, weights),
+        };
+        return paginateResult(result, 'items', {
+            limit: opts.limit,
+            offset: opts.offset,
+        });
+    }
+    finally {
+        close();
+    }
+}
+// ─── Utilities ────────────────────────────────────────────────────────
+function round4(n) {
+    return Math.round(n * 10000) / 10000;
+}
+//# sourceMappingURL=triage.js.map

package/dist/features/triage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"triage.js","sourceRoot":"","sources":["../../src/features/triage.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,kCAAkC,CAAC;AAC9D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAEvD,wEAAwE;AAExE,MAAM,QAAQ,GAAG;IACf,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;IACzC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS;IAC/C,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;IAClC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;IACrC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB,GAAG,CAAC,CAAC,oBAAoB;CAC9D,CAAC;AAEF;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAI,EAAE,WAAW;IACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;QACpB,KAAK,EAAE,CAAC,CAAC,MAAM;QACf,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,oBAAoB,EAAE,CAAC,CAAC,EAAE;QAC1B,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS;QACnC,cAAc,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,cAAc;QAC7C,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS;QACnC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM;QAC7B,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU;QACrC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS;KACpC,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO;IACrD,MAAM,cAAc,GAAG;QACrB,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QACpF,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC3E,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC5E,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;KACtE,CAAC;IAEF,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAChD,MAAM,QAAQ,GACZ,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAErE,OAAO;QACL,KAAK,EAAE,QAAQ,CAAC,MAAM;QACtB,QAAQ,EAAE,MAAM,CAAC,MAAM;QACvB,QAAQ;QACR,QAAQ;QACR,OAAO;QACP,cAAc;KACf,CAAC;AACJ,CAAC;AAED,yEAAyE;AAEzE,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAClC,KAAK,EAAE,CAAC;IACR,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,CAAC;IACX,OAAO;IACP,cAAc,EAAE,EAAE;CACnB,CAAC,CAAC;AAEH;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE;IAChD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IACrD,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACtE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,EAAE,CAAC;QAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,CAAC,UAAU,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;QAC/F,MAAM,QAAQ,GAAG;YACf,WAAW,EAAE,UAAU,CAAC,WAAW;YACnC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB;SAChD,CAAC;QAEF,IAAI,IAAI,CAAC;QACT,IAAI,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC;gBAC7B,OAAO;gBACP,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI;gBACvB,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI;gBACvB,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI;aACxB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,wBAAwB,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YAC5C,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QACxD,CAAC;QAED,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC1E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QACxD,CAAC;QAED,MAAM,WAAW,GAAG,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QAEtD,MAAM,MAAM,GAAG,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACzF,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAE7C,MAAM,MAAM,GAAG;YACb,KAAK,EAAE,MAAM;YACb,OAAO,EAAE,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC;SACzD,CAAC;QAEF,OAAO,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC;IACL,CAAC;YAAS,CAAC;QACT,KAAK,EAAE,CAAC;IACV,CAAC;AACH,CAAC;AAED,yEAAyE;AAEzE,SAAS,MAAM,CAAC,CAAC;IACf,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AACvC,CAAC"}

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

@@ -0,0 +1,13 @@
+/**
+ * Breadth-first traversal on a CodeGraph.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @param {string|string[]} startIds - One or more starting node IDs
+ * @param {{ maxDepth?: number, direction?: 'forward'|'backward'|'both' }} [opts]
+ * @returns {Map<string, number>} nodeId → depth from nearest start node
+ */
+export function bfs(graph: import("../model.js").CodeGraph, startIds: string | string[], opts?: {
+    maxDepth?: number;
+    direction?: "forward" | "backward" | "both";
+}): Map<string, number>;
+//# sourceMappingURL=bfs.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/bfs.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,2BALW,OAAO,aAAa,EAAE,SAAS,YAC/B,MAAM,GAAC,MAAM,EAAE,SACf;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,SAAS,GAAC,UAAU,GAAC,MAAM,CAAA;CAAE,GAC5D,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA0C/B"}

package/dist/graph/algorithms/bfs.js

@@ -0,0 +1,47 @@
+/**
+ * Breadth-first traversal on a CodeGraph.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @param {string|string[]} startIds - One or more starting node IDs
+ * @param {{ maxDepth?: number, direction?: 'forward'|'backward'|'both' }} [opts]
+ * @returns {Map<string, number>} nodeId → depth from nearest start node
+ */
+export function bfs(graph, startIds, opts = {}) {
+    const maxDepth = opts.maxDepth ?? Infinity;
+    const direction = opts.direction ?? 'forward';
+    const starts = Array.isArray(startIds) ? startIds : [startIds];
+    const depths = new Map();
+    const queue = [];
+    for (const id of starts) {
+        const key = String(id);
+        if (graph.hasNode(key)) {
+            depths.set(key, 0);
+            queue.push(key);
+        }
+    }
+    let head = 0;
+    while (head < queue.length) {
+        const current = queue[head++];
+        const depth = depths.get(current);
+        if (depth >= maxDepth)
+            continue;
+        let neighbors;
+        if (direction === 'forward') {
+            neighbors = graph.successors(current);
+        }
+        else if (direction === 'backward') {
+            neighbors = graph.predecessors(current);
+        }
+        else {
+            neighbors = graph.neighbors(current);
+        }
+        for (const n of neighbors) {
+            if (!depths.has(n)) {
+                depths.set(n, depth + 1);
+                queue.push(n);
+            }
+        }
+    }
+    return depths;
+}
+//# sourceMappingURL=bfs.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/graph/algorithms/bfs.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE;IAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;IAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAE/D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,EAAE,CAAC;IAEjB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,KAAK,IAAI,QAAQ;YAAE,SAAS;QAEhC,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;aAAM,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,11 @@
+/**
+ * Fan-in / fan-out centrality for all nodes in a CodeGraph.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @returns {Map<string, { fanIn: number, fanOut: number }>}
+ */
+export function fanInOut(graph: import("../model.js").CodeGraph): Map<string, {
+    fanIn: number;
+    fanOut: number;
+}>;
+//# sourceMappingURL=centrality.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"centrality.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/centrality.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,gCAHW,OAAO,aAAa,EAAE,SAAS,GAC7B,GAAG,CAAC,MAAM,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAW1D"}

package/dist/graph/algorithms/centrality.js

@@ -0,0 +1,17 @@
+/**
+ * Fan-in / fan-out centrality for all nodes in a CodeGraph.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @returns {Map<string, { fanIn: number, fanOut: number }>}
+ */
+export function fanInOut(graph) {
+    const result = new Map();
+    for (const id of graph.nodeIds()) {
+        result.set(id, {
+            fanIn: graph.inDegree(id),
+            fanOut: graph.outDegree(id),
+        });
+    }
+    return result;
+}
+//# sourceMappingURL=centrality.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"centrality.js","sourceRoot":"","sources":["../../../src/graph/algorithms/centrality.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAK;IAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;YACb,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,6 @@
+export { bfs } from "./bfs.js";
+export { fanInOut } from "./centrality.js";
+export { louvainCommunities } from "./louvain.js";
+export { shortestPath } from "./shortest-path.js";
+export { tarjan } from "./tarjan.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/index.js"],"names":[],"mappings":""}

package/dist/graph/algorithms/index.js

@@ -0,0 +1,6 @@
+export { bfs } from './bfs.js';
+export { fanInOut } from './centrality.js';
+export { louvainCommunities } from './louvain.js';
+export { shortestPath } from './shortest-path.js';
+export { tarjan } from './tarjan.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/graph/algorithms/index.js"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAC/B,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC"}

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

@@ -0,0 +1,5 @@
+export function louvainCommunities(graph: any, opts?: {}): {
+    assignments: Map<any, any>;
+    modularity: any;
+};
+//# sourceMappingURL=louvain.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.js"],"names":[],"mappings":"AASA;;;EAgBC"}

package/dist/graph/algorithms/louvain.js

@@ -0,0 +1,22 @@
+/**
+ * Louvain community detection via graphology.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @param {{ resolution?: number }} [opts]
+ * @returns {{ assignments: Map<string, number>, modularity: number }}
+ */
+import graphologyLouvain from 'graphology-communities-louvain';
+export function louvainCommunities(graph, opts = {}) {
+    const gy = graph.toGraphology({ type: 'undirected' });
+    if (gy.order === 0 || gy.size === 0) {
+        return { assignments: new Map(), modularity: 0 };
+    }
+    const resolution = opts.resolution ?? 1.0;
+    const details = graphologyLouvain.detailed(gy, { resolution });
+    const assignments = new Map();
+    for (const [nodeId, communityId] of Object.entries(details.communities)) {
+        assignments.set(nodeId, communityId);
+    }
+    return { assignments, modularity: details.modularity };
+}
+//# sourceMappingURL=louvain.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,iBAAiB,MAAM,gCAAgC,CAAC;AAE/D,MAAM,UAAU,kBAAkB,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE;IACjD,MAAM,EAAE,GAAG,KAAK,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;IAEtD,IAAI,EAAE,CAAC,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAC1C,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;IAE/D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACxE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC;AACzD,CAAC"}

package/dist/graph/algorithms/shortest-path.d.ts

@@ -0,0 +1,10 @@
+/**
+ * BFS-based shortest path on a CodeGraph.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @param {string} fromId
+ * @param {string} toId
+ * @returns {string[]|null} Path from fromId to toId (inclusive), or null if unreachable
+ */
+export function shortestPath(graph: import("../model.js").CodeGraph, fromId: string, toId: string): string[] | null;
+//# sourceMappingURL=shortest-path.d.ts.map

package/dist/graph/algorithms/shortest-path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortest-path.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,oCALW,OAAO,aAAa,EAAE,SAAS,UAC/B,MAAM,QACN,MAAM,GACJ,MAAM,EAAE,GAAC,IAAI,CAkCzB"}

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

@@ -0,0 +1,41 @@
+/**
+ * BFS-based shortest path on a CodeGraph.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @param {string} fromId
+ * @param {string} toId
+ * @returns {string[]|null} 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 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) {
+                // Reconstruct path
+                const path = [];
+                let node = to;
+                while (node !== null) {
+                    path.push(node);
+                    node = parent.get(node);
+                }
+                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.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI;IAC9C,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,IAAI,GAAG,EAAE,CAAC;IACzB,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,CAAC,CAAC;QAC9B,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,mBAAmB;gBACnB,MAAM,IAAI,GAAG,EAAE,CAAC;gBAChB,IAAI,IAAI,GAAG,EAAE,CAAC;gBACd,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC1B,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 @@
+/**
+ * Tarjan's strongly connected components algorithm.
+ * Operates on a CodeGraph instance.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @returns {string[][]} SCCs with length > 1 (cycles)
+ */
+export function tarjan(graph: import("../model.js").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.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,8BAHW,OAAO,aAAa,EAAE,SAAS,GAC7B,MAAM,EAAE,EAAE,CA2CtB"}

package/dist/graph/algorithms/tarjan.js

@@ -0,0 +1,48 @@
+/**
+ * Tarjan's strongly connected components algorithm.
+ * Operates on a CodeGraph instance.
+ *
+ * @param {import('../model.js').CodeGraph} graph
+ * @returns {string[][]} 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) {
+        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)) {
+                strongconnect(w);
+                lowlinks.set(v, Math.min(lowlinks.get(v), lowlinks.get(w)));
+            }
+            else if (onStack.has(w)) {
+                lowlinks.set(v, Math.min(lowlinks.get(v), indices.get(w)));
+            }
+        }
+        if (lowlinks.get(v) === indices.get(v)) {
+            const scc = [];
+            let w;
+            do {
+                w = stack.pop();
+                onStack.delete(w);
+                scc.push(w);
+            } while (w !== v);
+            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.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,KAAK;IAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,EAAE,CAAC;IAEhB,SAAS,aAAa,CAAC,CAAC;QACtB,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,aAAa,CAAC,CAAC,CAAC,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,IAAI,CAAC,CAAC;YACN,GAAG,CAAC;gBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBAChB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAClB,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,15 @@
+/**
+ * @param {object} dbOrRepo - Open better-sqlite3 database (readonly) or a Repository instance
+ * @param {object} [opts]
+ * @param {boolean} [opts.fileLevel=true] - File-level (imports) or function-level (calls)
+ * @param {boolean} [opts.noTests=false] - Exclude test files
+ * @param {number}  [opts.minConfidence] - Minimum edge confidence (function-level only)
+ * @returns {CodeGraph}
+ */
+export function buildDependencyGraph(dbOrRepo: object, opts?: {
+    fileLevel?: boolean | undefined;
+    noTests?: boolean | undefined;
+    minConfidence?: number | undefined;
+}): CodeGraph;
+import { CodeGraph } from '../model.js';
+//# 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.js"],"names":[],"mappings":"AAeA;;;;;;;GAOG;AACH,+CAPW,MAAM,SAEd;IAAuB,SAAS;IACT,OAAO;IACP,aAAa;CACpC,GAAU,SAAS,CAUrB;0BAlByB,aAAa"}

package/dist/graph/builders/dependency.js

@@ -0,0 +1,99 @@
+/**
+ * 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';
+/**
+ * @param {object} dbOrRepo - Open better-sqlite3 database (readonly) or a Repository instance
+ * @param {object} [opts]
+ * @param {boolean} [opts.fileLevel=true] - File-level (imports) or function-level (calls)
+ * @param {boolean} [opts.noTests=false] - Exclude test files
+ * @param {number}  [opts.minConfidence] - Minimum edge confidence (function-level only)
+ * @returns {CodeGraph}
+ */
+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;
+}
+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);
+    }
+    let edges;
+    if (minConfidence != null) {
+        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.
+            edges = dbOrRepo
+                .getCallEdges()
+                .filter((e) => e.confidence != null && e.confidence >= minConfidence);
+        }
+        else {
+            edges = dbOrRepo
+                .prepare("SELECT source_id, target_id FROM edges WHERE kind = 'calls' AND confidence >= ?")
+                .all(minConfidence);
+        }
+    }
+    else {
+        edges = isRepo ? dbOrRepo.getCallEdges() : getCallEdges(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: '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.js"],"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;AACjE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE;IACtD,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,CAAC,QAAQ,EAAE,OAAO;IAC5C,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,QAAQ,YAAY,UAAU,CAAC;IAE9C,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC5E,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,EAAE,CAAC;IAC1B,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,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC5E,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;AAED,SAAS,uBAAuB,CAAC,QAAQ,EAAE,OAAO,EAAE,aAAa;IAC/D,MAAM,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,QAAQ,YAAY,UAAU,CAAC;IAE9C,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAC9E,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,EAAE,CAAC;IAC1B,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,IAAI,KAAK,CAAC;IACV,IAAI,aAAa,IAAI,IAAI,EAAE,CAAC;QAC1B,IAAI,MAAM,EAAE,CAAC;YACX,qEAAqE;YACrE,qEAAqE;YACrE,uEAAuE;YACvE,kEAAkE;YAClE,kEAAkE;YAClE,KAAK,GAAG,QAAQ;iBACb,YAAY,EAAE;iBACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;QAC1E,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,QAAQ;iBACb,OAAO,CAAC,iFAAiF,CAAC;iBAC1F,GAAG,CAAC,aAAa,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IACpE,CAAC;IAED,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.js"],"names":[],"mappings":""}

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.js"],"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,7 @@
+/**
+ * @param {object} db - Open better-sqlite3 database (readonly)
+ * @returns {CodeGraph} Directed graph with directory→file containment edges
+ */
+export function buildStructureGraph(db: object): CodeGraph;
+import { CodeGraph } from '../model.js';
+//# 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.js"],"names":[],"mappings":"AAMA;;;GAGG;AACH,wCAHW,MAAM,GACJ,SAAS,CA+BrB;0BAnCyB,aAAa"}

package/dist/graph/builders/structure.js

@@ -0,0 +1,32 @@
+/**
+ * Build a containment graph (directory → file) from the SQLite database.
+ */
+import { CodeGraph } from '../model.js';
+/**
+ * @param {object} db - Open better-sqlite3 database (readonly)
+ * @returns {CodeGraph} 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