@monoes/monograph 1.1.0 → 1.2.0

package/dist/src/graph/diff.js

@@ -1,17 +1,39 @@
+function buildDiffSummary(newNodes, removedNodes, newEdges, removedEdges, modifiedNodes) {
+    const parts = [];
+    if (newNodes.length > 0)
+        parts.push(`${newNodes.length} new node${newNodes.length !== 1 ? 's' : ''}`);
+    if (newEdges.length > 0)
+        parts.push(`${newEdges.length} new edge${newEdges.length !== 1 ? 's' : ''}`);
+    if (removedNodes.length > 0)
+        parts.push(`${removedNodes.length} node${removedNodes.length !== 1 ? 's' : ''} removed`);
+    if (removedEdges.length > 0)
+        parts.push(`${removedEdges.length} edge${removedEdges.length !== 1 ? 's' : ''} removed`);
+    if (modifiedNodes.length > 0)
+        parts.push(`${modifiedNodes.length} node${modifiedNodes.length !== 1 ? 's' : ''} modified`);
+    return parts.length > 0 ? parts.join(', ') : 'no changes';
+}
 export function diffSnapshots(before, after) {
     const beforeNodeIds = new Map(before.nodes.map(n => [n.id, n]));
     const afterNodeIds = new Map(after.nodes.map(n => [n.id, n]));
-    const beforeEdgeIds = new Set(before.edges.map(e => e.id));
-    const afterEdgeIds = new Set(after.edges.map(e => e.id));
+    // Key edges by sourceId+relation+targetId — stable across snapshots regardless of synthetic id
+    const edgeKey = (e) => `${e.sourceId}|${e.relation}|${e.targetId}`;
+    const beforeEdgeKeys = new Set(before.edges.map(edgeKey));
+    const afterEdgeKeys = new Set(after.edges.map(edgeKey));
+    const newNodes = after.nodes.filter(n => !beforeNodeIds.has(n.id));
+    const removedNodes = before.nodes.filter(n => !afterNodeIds.has(n.id));
+    const newEdges = after.edges.filter(e => !beforeEdgeKeys.has(edgeKey(e)));
+    const removedEdges = before.edges.filter(e => !afterEdgeKeys.has(edgeKey(e)));
+    const modifiedNodes = after.nodes
+        .filter(n => beforeNodeIds.has(n.id))
+        .filter(n => JSON.stringify(n) !== JSON.stringify(beforeNodeIds.get(n.id)))
+        .map(n => ({ before: beforeNodeIds.get(n.id), after: n }));
     return {
-        newNodes: after.nodes.filter(n => !beforeNodeIds.has(n.id)),
-        removedNodes: before.nodes.filter(n => !afterNodeIds.has(n.id)),
-        newEdges: after.edges.filter(e => !beforeEdgeIds.has(e.id)),
-        removedEdges: before.edges.filter(e => !afterEdgeIds.has(e.id)),
-        modifiedNodes: after.nodes
-            .filter(n => beforeNodeIds.has(n.id))
-            .filter(n => JSON.stringify(n) !== JSON.stringify(beforeNodeIds.get(n.id)))
-            .map(n => ({ before: beforeNodeIds.get(n.id), after: n })),
+        newNodes,
+        removedNodes,
+        newEdges,
+        removedEdges,
+        modifiedNodes,
+        summary: buildDiffSummary(newNodes, removedNodes, newEdges, removedEdges, modifiedNodes),
     };
 }
 export function snapshotFromDb(db) {

package/dist/src/graph/diff.js.map

@@ -1 +1 @@
-{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../../src/graph/diff.ts"],"names":[],"mappings":"AAgBA,MAAM,UAAU,aAAa,CAAC,MAAqB,EAAE,KAAoB;IACvE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEzD,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3D,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/D,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3D,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/D,aAAa,EAAE,KAAK,CAAC,KAAK;aACvB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aAC1E,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;KAC9D,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,EAA0C;IACvE,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;GAU3B,CAAC,CAAC,GAAG,EAAoC,CAAC;IAE3C,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;GAO3B,CAAC,CAAC,GAAG,EAAoC,CAAC;IAE3C,MAAM,KAAK,GAAoB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChD,GAAG,CAAC;QACJ,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;KACnB,CAAA,CAAC,CAAC;IAErB,MAAM,KAAK,GAAG,QAAsC,CAAC;IAErD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;AAChE,CAAC"}
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../../src/graph/diff.ts"],"names":[],"mappings":"AAkBA,SAAS,gBAAgB,CACvB,QAAyB,EACzB,YAA6B,EAC7B,QAAyB,EACzB,YAA6B,EAC7B,aAAqE;IAErE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,YAAY,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtG,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,YAAY,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACtG,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,QAAQ,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACtH,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,QAAQ,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACtH,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,QAAQ,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC1H,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,MAAqB,EAAE,KAAoB;IACvE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,+FAA+F;IAC/F,MAAM,OAAO,GAAG,CAAC,CAAgB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;IAClF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1D,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAExD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC1E,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAE9D,OAAO;QACL,QAAQ;QACR,YAAY;QACZ,QAAQ;QACR,YAAY;QACZ,aAAa;QACb,OAAO,EAAE,gBAAgB,CAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,CAAC;KACzF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,EAA0C;IACvE,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;GAU3B,CAAC,CAAC,GAAG,EAAoC,CAAC;IAE3C,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;GAO3B,CAAC,CAAC,GAAG,EAAoC,CAAC;IAE3C,MAAM,KAAK,GAAoB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChD,GAAG,CAAC;QACJ,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;KACnB,CAAA,CAAC,CAAC;IAErB,MAAM,KAAK,GAAG,QAAsC,CAAC;IAErD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;AAChE,CAAC"}

package/dist/src/graph/duplication-stats.d.ts

@@ -0,0 +1,22 @@
+export interface DuplicationStats {
+    totalFiles: number;
+    filesWithClones: number;
+    totalLines: number;
+    duplicatedLines: number;
+    totalTokens: number;
+    duplicatedTokens: number;
+    cloneGroups: number;
+    cloneInstances: number;
+    duplicationPct: number;
+}
+export interface CloneGroupInput {
+    instances: Array<{
+        filePath: string;
+        startLine: number;
+        endLine: number;
+        tokenCount?: number;
+    }>;
+}
+export declare function computeDuplicationStats(groups: CloneGroupInput[], allFilePaths: string[], totalLines: number, totalTokens: number): DuplicationStats;
+export declare function formatDuplicationStats(stats: DuplicationStats): string;
+//# sourceMappingURL=duplication-stats.d.ts.map

package/dist/src/graph/duplication-stats.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplication-stats.d.ts","sourceRoot":"","sources":["../../../src/graph/duplication-stats.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,KAAK,CAAC;QACf,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,CAAC,EAAE,MAAM,CAAC;KACrB,CAAC,CAAC;CACJ;AAED,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,eAAe,EAAE,EACzB,YAAY,EAAE,MAAM,EAAE,EACtB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,GAClB,gBAAgB,CAgClB;AAED,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,gBAAgB,GAAG,MAAM,CAOtE"}

package/dist/src/graph/duplication-stats.js

@@ -0,0 +1,38 @@
+export function computeDuplicationStats(groups, allFilePaths, totalLines, totalTokens) {
+    // Per-file deduplicated line sets to avoid double-counting
+    const fileLines = new Map();
+    let cloneInstances = 0;
+    for (const group of groups) {
+        for (const inst of group.instances) {
+            cloneInstances++;
+            if (!fileLines.has(inst.filePath))
+                fileLines.set(inst.filePath, new Set());
+            const set = fileLines.get(inst.filePath);
+            for (let l = inst.startLine; l <= inst.endLine; l++)
+                set.add(l);
+        }
+    }
+    const filesWithClones = fileLines.size;
+    const duplicatedLines = [...fileLines.values()].reduce((s, set) => s + set.size, 0);
+    const duplicatedTokens = Math.min(totalTokens, groups.reduce((s, g) => s + g.instances.reduce((t, i) => t + (i.tokenCount ?? 0), 0), 0));
+    return {
+        totalFiles: allFilePaths.length,
+        filesWithClones,
+        totalLines,
+        duplicatedLines,
+        totalTokens,
+        duplicatedTokens,
+        cloneGroups: groups.length,
+        cloneInstances,
+        duplicationPct: totalLines > 0 ? (duplicatedLines / totalLines) * 100 : 0,
+    };
+}
+export function formatDuplicationStats(stats) {
+    return [
+        `Clone groups:      ${stats.cloneGroups}`,
+        `Clone instances:   ${stats.cloneInstances}`,
+        `Files with clones: ${stats.filesWithClones} / ${stats.totalFiles}`,
+        `Duplicated lines:  ${stats.duplicatedLines} / ${stats.totalLines} (${stats.duplicationPct.toFixed(1)}%)`,
+    ].join('\n');
+}
+//# sourceMappingURL=duplication-stats.js.map

package/dist/src/graph/duplication-stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplication-stats.js","sourceRoot":"","sources":["../../../src/graph/duplication-stats.ts"],"names":[],"mappings":"AAqBA,MAAM,UAAU,uBAAuB,CACrC,MAAyB,EACzB,YAAsB,EACtB,UAAkB,EAClB,WAAmB;IAEnB,2DAA2D;IAC3D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACnC,cAAc,EAAE,CAAC;YACjB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC3E,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAG,SAAS,CAAC,IAAI,CAAC;IACvC,MAAM,eAAe,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAC/B,WAAW,EACX,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CACzF,CAAC;IAEF,OAAO;QACL,UAAU,EAAE,YAAY,CAAC,MAAM;QAC/B,eAAe;QACf,UAAU;QACV,eAAe;QACf,WAAW;QACX,gBAAgB;QAChB,WAAW,EAAE,MAAM,CAAC,MAAM;QAC1B,cAAc;QACd,cAAc,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;KAC1E,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,KAAuB;IAC5D,OAAO;QACL,sBAAsB,KAAK,CAAC,WAAW,EAAE;QACzC,sBAAsB,KAAK,CAAC,cAAc,EAAE;QAC5C,sBAAsB,KAAK,CAAC,eAAe,MAAM,KAAK,CAAC,UAAU,EAAE;QACnE,sBAAsB,KAAK,CAAC,eAAe,MAAM,KAAK,CAAC,UAAU,KAAK,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;KAC1G,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC"}

package/dist/src/graph/edge-filter.d.ts

@@ -0,0 +1,23 @@
+import type { MonographEdge, EdgeRelation, EdgeConfidence } from '../types.js';
+import type { MonographDb } from '../storage/db.js';
+export interface EdgeFilterOptions {
+    /** Only return edges whose relation matches one of these values. */
+    relations?: EdgeRelation[];
+    /** Only return edges whose confidence label matches one of these values. */
+    confidences?: EdgeConfidence[];
+    /** Only return edges with a confidence_score >= this value (0–1). */
+    minConfidenceScore?: number;
+    /** Only return edges with a confidence_score <= this value (0–1). */
+    maxConfidenceScore?: number;
+}
+/**
+ * Query edges from a MonographDb with optional relation / confidence filters.
+ * All filters are combined with AND.
+ */
+export declare function filterEdges(db: MonographDb, options?: EdgeFilterOptions): MonographEdge[];
+/**
+ * Filter an already-loaded array of edges in memory.
+ * Useful when the caller already has edges and does not need a DB round-trip.
+ */
+export declare function filterEdgesInMemory(edges: MonographEdge[], options?: EdgeFilterOptions): MonographEdge[];
+//# sourceMappingURL=edge-filter.d.ts.map

package/dist/src/graph/edge-filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-filter.d.ts","sourceRoot":"","sources":["../../../src/graph/edge-filter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC/E,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAIpD,MAAM,WAAW,iBAAiB;IAChC,oEAAoE;IACpE,SAAS,CAAC,EAAE,YAAY,EAAE,CAAC;IAC3B,4EAA4E;IAC5E,WAAW,CAAC,EAAE,cAAc,EAAE,CAAC;IAC/B,qEAAqE;IACrE,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,qEAAqE;IACrE,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAID;;;GAGG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,WAAW,EACf,OAAO,GAAE,iBAAsB,GAC9B,aAAa,EAAE,CAkDjB;AAID;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,aAAa,EAAE,EACtB,OAAO,GAAE,iBAAsB,GAC9B,aAAa,EAAE,CAgBjB"}

package/dist/src/graph/edge-filter.js

@@ -0,0 +1,65 @@
+// ── DB-backed filter ───────────────────────────────────────────────────────────
+/**
+ * Query edges from a MonographDb with optional relation / confidence filters.
+ * All filters are combined with AND.
+ */
+export function filterEdges(db, options = {}) {
+    const conditions = [];
+    const params = [];
+    if (options.relations && options.relations.length > 0) {
+        const ph = options.relations.map(() => '?').join(',');
+        conditions.push(`relation IN (${ph})`);
+        params.push(...options.relations);
+    }
+    if (options.confidences && options.confidences.length > 0) {
+        const ph = options.confidences.map(() => '?').join(',');
+        conditions.push(`confidence IN (${ph})`);
+        params.push(...options.confidences);
+    }
+    if (options.minConfidenceScore !== undefined) {
+        conditions.push('confidence_score >= ?');
+        params.push(options.minConfidenceScore);
+    }
+    if (options.maxConfidenceScore !== undefined) {
+        conditions.push('confidence_score <= ?');
+        params.push(options.maxConfidenceScore);
+    }
+    const where = conditions.length > 0 ? `WHERE ${conditions.join(' AND ')}` : '';
+    const sql = `SELECT id, source_id, target_id, relation, confidence, confidence_score, reason, evidence
+               FROM edges ${where}`;
+    const rows = db.prepare(sql).all(...params);
+    return rows.map(r => ({
+        id: r.id,
+        sourceId: r.source_id,
+        targetId: r.target_id,
+        relation: r.relation,
+        confidence: r.confidence,
+        confidenceScore: r.confidence_score,
+        reason: r.reason ?? undefined,
+    }));
+}
+// ── In-memory filter ───────────────────────────────────────────────────────────
+/**
+ * Filter an already-loaded array of edges in memory.
+ * Useful when the caller already has edges and does not need a DB round-trip.
+ */
+export function filterEdgesInMemory(edges, options = {}) {
+    return edges.filter(e => {
+        if (options.relations && options.relations.length > 0) {
+            if (!options.relations.includes(e.relation))
+                return false;
+        }
+        if (options.confidences && options.confidences.length > 0) {
+            if (!options.confidences.includes(e.confidence))
+                return false;
+        }
+        if (options.minConfidenceScore !== undefined && e.confidenceScore < options.minConfidenceScore) {
+            return false;
+        }
+        if (options.maxConfidenceScore !== undefined && e.confidenceScore > options.maxConfidenceScore) {
+            return false;
+        }
+        return true;
+    });
+}
+//# sourceMappingURL=edge-filter.js.map

package/dist/src/graph/edge-filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edge-filter.js","sourceRoot":"","sources":["../../../src/graph/edge-filter.ts"],"names":[],"mappings":"AAgBA,kFAAkF;AAElF;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,EAAe,EACf,UAA6B,EAAE;IAE/B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,MAAM,GAAc,EAAE,CAAC;IAE7B,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtD,UAAU,CAAC,IAAI,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,UAAU,CAAC,IAAI,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,OAAO,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;QAC7C,UAAU,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,OAAO,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;QAC7C,UAAU,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/E,MAAM,GAAG,GAAG;4BACc,KAAK,EAAE,CAAC;IAElC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CASvC,CAAC;IAEJ,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,QAAQ,EAAE,CAAC,CAAC,SAAS;QACrB,QAAQ,EAAE,CAAC,CAAC,SAAS;QACrB,QAAQ,EAAE,CAAC,CAAC,QAAwB;QACpC,UAAU,EAAE,CAAC,CAAC,UAA4B;QAC1C,eAAe,EAAE,CAAC,CAAC,gBAAgB;QACnC,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,SAAS;KAC9B,CAAC,CAAC,CAAC;AACN,CAAC;AAED,kFAAkF;AAElF;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAsB,EACtB,UAA6B,EAAE;IAE/B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QACtB,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC5D,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChE,CAAC;QACD,IAAI,OAAO,CAAC,kBAAkB,KAAK,SAAS,IAAI,CAAC,CAAC,eAAe,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC/F,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,OAAO,CAAC,kBAAkB,KAAK,SAAS,IAAI,CAAC,CAAC,eAAe,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC/F,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/src/graph/explain.d.ts

@@ -0,0 +1,28 @@
+export interface RuleDef {
+    id: string;
+    name?: string;
+    title?: string;
+    description: string;
+    rationale?: string;
+    remediation?: string;
+    severity?: 'error' | 'warning' | 'info';
+    docsUrl?: string;
+    docs?: string;
+}
+export declare const CHECK_RULES: RuleDef[];
+export declare function explainRule(ruleId: string): RuleDef | undefined;
+export declare function listRules(): RuleDef[];
+export declare function getRulesByFinding(findingTitle: string): RuleDef[];
+export interface RuleGuide {
+    rule: string;
+    checklist: string[];
+    relatedRules: string[];
+    antiPatterns: string[];
+    examples: string[];
+}
+export declare const HEALTH_RULES: RuleDef[];
+export declare const DUPES_RULES: RuleDef[];
+export declare function getRuleGuide(ruleId: string): RuleGuide | null;
+export declare function healthMeta(): Record<string, unknown>;
+export declare function dupesMeta(): Record<string, unknown>;
+//# sourceMappingURL=explain.d.ts.map

package/dist/src/graph/explain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"explain.d.ts","sourceRoot":"","sources":["../../../src/graph/explain.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,GAAG,MAAM,CAAC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,eAAO,MAAM,WAAW,EAAE,OAAO,EAyDhC,CAAC;AAEF,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAE/D;AAED,wBAAgB,SAAS,IAAI,OAAO,EAAE,CAErC;AAED,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,EAAE,CAGjE;AAID,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,eAAO,MAAM,YAAY,EAAE,OAAO,EAMjC,CAAC;AAEF,eAAO,MAAM,WAAW,EAAE,OAAO,EAEhC,CAAC;AAEF,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAkB7D;AAED,wBAAgB,UAAU,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAEpD;AAED,wBAAgB,SAAS,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAEnD"}

package/dist/src/graph/explain.js

@@ -0,0 +1,104 @@
+export const CHECK_RULES = [
+    {
+        id: 'god-node',
+        name: 'God Node',
+        description: 'A file or class with too many incoming dependencies (high fan-in).',
+        rationale: 'God nodes create fragile coupling — any change ripples across many files.',
+        remediation: 'Split into smaller, focused modules. Extract shared logic into utility files.',
+        severity: 'warning',
+    },
+    {
+        id: 'unreachable-file',
+        name: 'Unreachable File',
+        description: 'A file that cannot be reached from any runtime or test entry point.',
+        rationale: 'Unreachable files are dead code — they increase build size and maintenance burden.',
+        remediation: 'Delete or connect the file to a live import chain. Check if it was accidentally disconnected.',
+        severity: 'warning',
+    },
+    {
+        id: 'circular-deps',
+        name: 'Circular Dependencies',
+        description: 'Files that form an import cycle.',
+        rationale: 'Circular imports complicate initialization order, testing, and refactoring.',
+        remediation: 'Extract shared types/utilities to a new file that neither participant imports from.',
+        severity: 'error',
+    },
+    {
+        id: 'high-coupling',
+        name: 'High Coupling Concentration',
+        description: 'A disproportionate share of imports targeting a small number of files.',
+        rationale: 'Over-coupled files become change bottlenecks — every feature touches them.',
+        remediation: 'Break up the central file using the facade pattern or dependency inversion.',
+        severity: 'warning',
+    },
+    {
+        id: 'isolated-node',
+        name: 'Isolated Node',
+        description: 'A file with no imports and no importers.',
+        rationale: 'Isolated files have no connection to the codebase — likely dead or forgotten.',
+        remediation: 'Either connect it to the dependency graph or delete it.',
+        severity: 'info',
+    },
+    {
+        id: 'boundary-violation',
+        name: 'Boundary Zone Violation',
+        description: 'An import that crosses a forbidden architectural boundary.',
+        rationale: 'Boundary violations break layer isolation and make the architecture drift over time.',
+        remediation: 'Introduce an anti-corruption layer or move the logic to the correct zone.',
+        severity: 'error',
+    },
+    {
+        id: 'low-cohesion',
+        name: 'Low Community Cohesion',
+        description: 'A module community with a low ratio of internal to possible edges.',
+        rationale: 'Low cohesion means the community is an arbitrary grouping, not a real module.',
+        remediation: 'Re-organize files so that related functionality is co-located.',
+        severity: 'info',
+    },
+];
+export function explainRule(ruleId) {
+    return CHECK_RULES.find(r => r.id === ruleId);
+}
+export function listRules() {
+    return CHECK_RULES;
+}
+export function getRulesByFinding(findingTitle) {
+    const lower = findingTitle.toLowerCase();
+    return CHECK_RULES.filter(r => lower.includes(r.id) || (r.name && lower.includes(r.name.toLowerCase())));
+}
+export const HEALTH_RULES = [
+    { id: 'health/cyclomatic', title: 'High Cyclomatic Complexity', description: 'Function has too many independent execution paths', docs: 'https://en.wikipedia.org/wiki/Cyclomatic_complexity' },
+    { id: 'health/cognitive', title: 'High Cognitive Complexity', description: 'Function is hard to understand for human readers', docs: 'https://www.sonarsource.com/docs/CognitiveComplexity.pdf' },
+    { id: 'health/crap', title: 'High CRAP Score', description: 'Function has high complexity and low test coverage', docs: '' },
+    { id: 'health/maintainability', title: 'Low Maintainability Index', description: 'File has a low maintainability index score', docs: '' },
+    { id: 'health/large-function', title: 'Large Function', description: 'Function exceeds the maximum allowed lines of code', docs: '' },
+];
+export const DUPES_RULES = [
+    { id: 'duplication/clone', title: 'Code Duplication', description: 'Code block is duplicated across multiple files', docs: '' },
+];
+export function getRuleGuide(ruleId) {
+    const guides = {
+        'health/cyclomatic': {
+            rule: 'health/cyclomatic',
+            checklist: ['Extract complex conditionals into named predicates', 'Split large functions into smaller helpers', 'Use early returns to reduce nesting'],
+            relatedRules: ['health/cognitive', 'health/crap'],
+            antiPatterns: ['Deeply nested if/else chains', 'Long switch statements without extraction'],
+            examples: ['Extract `isEligible()` from a 15-branch function'],
+        },
+        'health/crap': {
+            rule: 'health/crap',
+            checklist: ['Add tests to increase coverage', 'Refactor to reduce cyclomatic complexity', 'Break into smaller testable units'],
+            relatedRules: ['health/cyclomatic', 'health/cognitive'],
+            antiPatterns: ['Complex functions with zero test coverage'],
+            examples: [],
+        },
+    };
+    return guides[ruleId] ?? null;
+}
+export function healthMeta() {
+    return { version: 1, rules: HEALTH_RULES.map(r => ({ id: r.id, title: r.title, description: r.description })) };
+}
+export function dupesMeta() {
+    return { version: 1, rules: DUPES_RULES.map(r => ({ id: r.id, title: r.title, description: r.description })) };
+}
+//# sourceMappingURL=explain.js.map

package/dist/src/graph/explain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"explain.js","sourceRoot":"","sources":["../../../src/graph/explain.ts"],"names":[],"mappings":"AAYA,MAAM,CAAC,MAAM,WAAW,GAAc;IACpC;QACE,EAAE,EAAE,UAAU;QACd,IAAI,EAAE,UAAU;QAChB,WAAW,EAAE,oEAAoE;QACjF,SAAS,EAAE,2EAA2E;QACtF,WAAW,EAAE,+EAA+E;QAC5F,QAAQ,EAAE,SAAS;KACpB;IACD;QACE,EAAE,EAAE,kBAAkB;QACtB,IAAI,EAAE,kBAAkB;QACxB,WAAW,EAAE,qEAAqE;QAClF,SAAS,EAAE,oFAAoF;QAC/F,WAAW,EAAE,+FAA+F;QAC5G,QAAQ,EAAE,SAAS;KACpB;IACD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,uBAAuB;QAC7B,WAAW,EAAE,kCAAkC;QAC/C,SAAS,EAAE,6EAA6E;QACxF,WAAW,EAAE,qFAAqF;QAClG,QAAQ,EAAE,OAAO;KAClB;IACD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,6BAA6B;QACnC,WAAW,EAAE,wEAAwE;QACrF,SAAS,EAAE,4EAA4E;QACvF,WAAW,EAAE,6EAA6E;QAC1F,QAAQ,EAAE,SAAS;KACpB;IACD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,eAAe;QACrB,WAAW,EAAE,0CAA0C;QACvD,SAAS,EAAE,+EAA+E;QAC1F,WAAW,EAAE,yDAAyD;QACtE,QAAQ,EAAE,MAAM;KACjB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,yBAAyB;QAC/B,WAAW,EAAE,4DAA4D;QACzE,SAAS,EAAE,sFAAsF;QACjG,WAAW,EAAE,2EAA2E;QACxF,QAAQ,EAAE,OAAO;KAClB;IACD;QACE,EAAE,EAAE,cAAc;QAClB,IAAI,EAAE,wBAAwB;QAC9B,WAAW,EAAE,oEAAoE;QACjF,SAAS,EAAE,+EAA+E;QAC1F,WAAW,EAAE,gEAAgE;QAC7E,QAAQ,EAAE,MAAM;KACjB;CACF,CAAC;AAEF,MAAM,UAAU,WAAW,CAAC,MAAc;IACxC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,SAAS;IACvB,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,YAAoB;IACpD,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,EAAE,CAAC;IACzC,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;AAC3G,CAAC;AAYD,MAAM,CAAC,MAAM,YAAY,GAAc;IACrC,EAAE,EAAE,EAAE,mBAAmB,EAAE,KAAK,EAAE,4BAA4B,EAAE,WAAW,EAAE,mDAAmD,EAAE,IAAI,EAAE,qDAAqD,EAAE;IAC/L,EAAE,EAAE,EAAE,kBAAkB,EAAE,KAAK,EAAE,2BAA2B,EAAE,WAAW,EAAE,kDAAkD,EAAE,IAAI,EAAE,0DAA0D,EAAE;IACjM,EAAE,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,iBAAiB,EAAE,WAAW,EAAE,oDAAoD,EAAE,IAAI,EAAE,EAAE,EAAE;IAC5H,EAAE,EAAE,EAAE,wBAAwB,EAAE,KAAK,EAAE,2BAA2B,EAAE,WAAW,EAAE,4CAA4C,EAAE,IAAI,EAAE,EAAE,EAAE;IACzI,EAAE,EAAE,EAAE,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,oDAAoD,EAAE,IAAI,EAAE,EAAE,EAAE;CACtI,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAc;IACpC,EAAE,EAAE,EAAE,mBAAmB,EAAE,KAAK,EAAE,kBAAkB,EAAE,WAAW,EAAE,gDAAgD,EAAE,IAAI,EAAE,EAAE,EAAE;CAChI,CAAC;AAEF,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,MAAM,MAAM,GAA8B;QACxC,mBAAmB,EAAE;YACnB,IAAI,EAAE,mBAAmB;YACzB,SAAS,EAAE,CAAC,oDAAoD,EAAE,4CAA4C,EAAE,qCAAqC,CAAC;YACtJ,YAAY,EAAE,CAAC,kBAAkB,EAAE,aAAa,CAAC;YACjD,YAAY,EAAE,CAAC,8BAA8B,EAAE,2CAA2C,CAAC;YAC3F,QAAQ,EAAE,CAAC,kDAAkD,CAAC;SAC/D;QACD,aAAa,EAAE;YACb,IAAI,EAAE,aAAa;YACnB,SAAS,EAAE,CAAC,gCAAgC,EAAE,0CAA0C,EAAE,mCAAmC,CAAC;YAC9H,YAAY,EAAE,CAAC,mBAAmB,EAAE,kBAAkB,CAAC;YACvD,YAAY,EAAE,CAAC,2CAA2C,CAAC;YAC3D,QAAQ,EAAE,EAAE;SACb;KACF,CAAC;IACF,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,UAAU;IACxB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC;AAClH,CAAC;AAED,MAAM,UAAU,SAAS;IACvB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC;AACjH,CAAC"}

package/dist/src/graph/external-style-usage.d.ts

@@ -0,0 +1,22 @@
+export interface ExternalStyleImport {
+    importingFile: string;
+    stylePath: string;
+    packageName: string;
+}
+export interface ExternalStyleScanResult {
+    injectedEdges: ExternalStyleImport[];
+    scannedFiles: number;
+    skippedCycles: number;
+}
+/** Returns true if a path looks like a trackable external stylesheet. */
+export declare function isTrackableExternalStylePath(path: string): boolean;
+/** Extract the npm package name from a node_modules path. */
+export declare function packageNameFromPath(path: string): string;
+/** Scan @import statements in a stylesheet source, yielding resolved paths. */
+export declare function scanStyleImports(source: string): string[];
+/** Walk a list of resolved import paths and return synthetic external-style package edges. */
+export declare function augmentExternalStylePackageUsage(importEdges: Array<{
+    importingFile: string;
+    resolvedPath: string;
+}>, getSource?: (path: string) => string | undefined): ExternalStyleScanResult;
+//# sourceMappingURL=external-style-usage.d.ts.map

package/dist/src/graph/external-style-usage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"external-style-usage.d.ts","sourceRoot":"","sources":["../../../src/graph/external-style-usage.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,mBAAmB;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,uBAAuB;IACtC,aAAa,EAAE,mBAAmB,EAAE,CAAC;IACrC,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;CACvB;AAKD,yEAAyE;AACzE,wBAAgB,4BAA4B,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAIlE;AAED,6DAA6D;AAC7D,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAQxD;AAED,+EAA+E;AAC/E,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAMzD;AAED,8FAA8F;AAC9F,wBAAgB,gCAAgC,CAC9C,WAAW,EAAE,KAAK,CAAC;IAAE,aAAa,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAAC,EACnE,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,GAC/C,uBAAuB,CA+BzB"}

package/dist/src/graph/external-style-usage.js

@@ -0,0 +1,66 @@
+// Augments the module graph with synthetic npm-package import edges for
+// style-only packages (.css/.scss/.sass under node_modules).
+const STYLE_EXTS = ['.css', '.scss', '.sass', '.less'];
+const AT_IMPORT_RE = /@import\s+['"]([^'"]+)['"]/g;
+/** Returns true if a path looks like a trackable external stylesheet. */
+export function isTrackableExternalStylePath(path) {
+    const norm = path.replace(/\\/g, '/');
+    if (!norm.includes('node_modules/'))
+        return false;
+    return STYLE_EXTS.some(ext => norm.endsWith(ext));
+}
+/** Extract the npm package name from a node_modules path. */
+export function packageNameFromPath(path) {
+    const norm = path.replace(/\\/g, '/');
+    const idx = norm.lastIndexOf('node_modules/');
+    if (idx === -1)
+        return '';
+    const rest = norm.slice(idx + 'node_modules/'.length);
+    const parts = rest.split('/');
+    if (parts[0].startsWith('@') && parts.length >= 2)
+        return `${parts[0]}/${parts[1]}`;
+    return parts[0];
+}
+/** Scan @import statements in a stylesheet source, yielding resolved paths. */
+export function scanStyleImports(source) {
+    const results = [];
+    let m;
+    AT_IMPORT_RE.lastIndex = 0;
+    while ((m = AT_IMPORT_RE.exec(source)) !== null)
+        results.push(m[1]);
+    return results;
+}
+/** Walk a list of resolved import paths and return synthetic external-style package edges. */
+export function augmentExternalStylePackageUsage(importEdges, getSource) {
+    const injectedEdges = [];
+    const visited = new Set();
+    let scannedFiles = 0;
+    let skippedCycles = 0;
+    function processStyleFile(importingFile, stylePath) {
+        if (!isTrackableExternalStylePath(stylePath))
+            return;
+        const packageName = packageNameFromPath(stylePath);
+        if (!packageName)
+            return;
+        injectedEdges.push({ importingFile, stylePath, packageName });
+        if (getSource && !visited.has(stylePath)) {
+            if (visited.size > 500) {
+                skippedCycles++;
+                return;
+            }
+            visited.add(stylePath);
+            scannedFiles++;
+            const src = getSource(stylePath);
+            if (src) {
+                for (const imp of scanStyleImports(src)) {
+                    processStyleFile(stylePath, imp);
+                }
+            }
+        }
+    }
+    for (const edge of importEdges) {
+        processStyleFile(edge.importingFile, edge.resolvedPath);
+    }
+    return { injectedEdges, scannedFiles, skippedCycles };
+}
+//# sourceMappingURL=external-style-usage.js.map

package/dist/src/graph/external-style-usage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"external-style-usage.js","sourceRoot":"","sources":["../../../src/graph/external-style-usage.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,6DAA6D;AAc7D,MAAM,UAAU,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AACvD,MAAM,YAAY,GAAG,6BAA6B,CAAC;AAEnD,yEAAyE;AACzE,MAAM,UAAU,4BAA4B,CAAC,IAAY;IACvD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACtC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC;QAAE,OAAO,KAAK,CAAC;IAClD,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;IAC9C,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACpF,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,gBAAgB,CAAC,MAAc;IAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAyB,CAAC;IAC9B,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC;IAC3B,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,gCAAgC,CAC9C,WAAmE,EACnE,SAAgD;IAEhD,MAAM,aAAa,GAA0B,EAAE,CAAC;IAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,SAAS,gBAAgB,CAAC,aAAqB,EAAE,SAAiB;QAChE,IAAI,CAAC,4BAA4B,CAAC,SAAS,CAAC;YAAE,OAAO;QACrD,MAAM,WAAW,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACnD,IAAI,CAAC,WAAW;YAAE,OAAO;QAEzB,aAAa,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC;QAE9D,IAAI,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;gBAAC,aAAa,EAAE,CAAC;gBAAC,OAAO;YAAC,CAAC;YACpD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvB,YAAY,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACjC,IAAI,GAAG,EAAE,CAAC;gBACR,KAAK,MAAM,GAAG,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,gBAAgB,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;AACxD,CAAC"}

package/dist/src/graph/health-score.d.ts

@@ -0,0 +1,18 @@
+import type Database from 'better-sqlite3';
+export interface HealthScorePenalties {
+    unreachableFilePct: number;
+    godNodePct: number;
+    circularEdgePct: number;
+    hotspotPct: number;
+    isolatedNodePct: number;
+    crossCommunityEdgePct: number;
+}
+export interface HealthScoreResult {
+    score: number;
+    grade: 'A' | 'B' | 'C' | 'D' | 'F';
+    penalties: HealthScorePenalties;
+    summary: string;
+}
+export declare function letterGrade(score: number): 'A' | 'B' | 'C' | 'D' | 'F';
+export declare function computeHealthScore(db: Database.Database): HealthScoreResult;
+//# sourceMappingURL=health-score.d.ts.map

package/dist/src/graph/health-score.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"health-score.d.ts","sourceRoot":"","sources":["../../../src/graph/health-score.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAE3C,MAAM,WAAW,oBAAoB;IACnC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACnC,SAAS,EAAE,oBAAoB,CAAC;IAChC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAMtE;AAED,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,iBAAiB,CA6H3E"}

package/dist/src/graph/health-score.js

@@ -0,0 +1,117 @@
+export function letterGrade(score) {
+    if (score >= 90)
+        return 'A';
+    if (score >= 80)
+        return 'B';
+    if (score >= 70)
+        return 'C';
+    if (score >= 60)
+        return 'D';
+    return 'F';
+}
+export function computeHealthScore(db) {
+    // ── Total file nodes ──────────────────────────────────────────────────────
+    const totalFilesRow = db.prepare("SELECT COUNT(*) as c FROM nodes WHERE label = 'File'").get();
+    const totalFiles = totalFilesRow.c;
+    // ── Unreachable file nodes ────────────────────────────────────────────────
+    const unreachableRow = db.prepare("SELECT COUNT(*) as c FROM nodes WHERE label = 'File' AND properties LIKE '%\"unreachable\"%'").get();
+    const unreachableFiles = unreachableRow.c;
+    // ── Total nodes ───────────────────────────────────────────────────────────
+    const totalNodesRow = db.prepare('SELECT COUNT(*) as c FROM nodes').get();
+    const totalNodes = totalNodesRow.c;
+    // ── p95 degree (god nodes) ────────────────────────────────────────────────
+    const degreesRows = db.prepare(`
+    SELECT source_id as node_id, COUNT(*) as deg FROM edges GROUP BY source_id
+    UNION ALL
+    SELECT target_id as node_id, COUNT(*) as deg FROM edges GROUP BY target_id
+  `).all();
+    // Sum degrees per node
+    const degMap = new Map();
+    for (const row of degreesRows) {
+        degMap.set(row.node_id, (degMap.get(row.node_id) ?? 0) + row.deg);
+    }
+    const degrees = [...degMap.values()].sort((a, b) => a - b);
+    const p95Index = Math.floor(degrees.length * 0.95);
+    const p95Degree = degrees[p95Index] ?? 0;
+    const godNodeCount = p95Degree > 0
+        ? [...degMap.values()].filter(d => d > p95Degree).length
+        : 0;
+    // ── Circular edges (bidirectional import pairs) ───────────────────────────
+    const totalEdgesRow = db.prepare('SELECT COUNT(*) as c FROM edges').get();
+    const totalEdges = totalEdgesRow.c;
+    const circularRow = db.prepare(`
+    SELECT COUNT(*) as c FROM edges e1
+    JOIN edges e2 ON e1.source_id = e2.target_id AND e1.target_id = e2.source_id
+    WHERE e1.relation = 'IMPORTS' AND e2.relation = 'IMPORTS'
+      AND e1.source_id < e1.target_id
+  `).get();
+    // Each circular pair is counted once; each pair has 2 edges contributing
+    const circularEdges = circularRow.c * 2;
+    // ── Hotspot files (churnScore > 0.5 in properties) ───────────────────────
+    // Files where properties contain a churnScore > 0.5
+    // We detect presence of churnScore via LIKE and then evaluate in JS
+    const hotspotCandidates = db.prepare("SELECT properties FROM nodes WHERE label = 'File' AND properties LIKE '%churnScore%'").all();
+    let hotspotCount = 0;
+    for (const row of hotspotCandidates) {
+        if (!row.properties)
+            continue;
+        try {
+            const props = JSON.parse(row.properties);
+            const churn = props['churnScore'];
+            if (typeof churn === 'number' && churn > 0.5)
+                hotspotCount++;
+        }
+        catch {
+            // ignore malformed JSON
+        }
+    }
+    // ── Isolated nodes (degree = 0) ───────────────────────────────────────────
+    const isolatedRow = db.prepare(`
+    SELECT COUNT(*) as c FROM nodes n
+    WHERE NOT EXISTS (SELECT 1 FROM edges e WHERE e.source_id = n.id OR e.target_id = n.id)
+  `).get();
+    const isolatedNodes = isolatedRow.c;
+    // ── Cross-community edges ─────────────────────────────────────────────────
+    const crossCommRow = db.prepare(`
+    SELECT COUNT(*) as c FROM edges e
+    JOIN nodes n1 ON n1.id = e.source_id
+    JOIN nodes n2 ON n2.id = e.target_id
+    WHERE n1.community_id IS NOT NULL
+      AND n2.community_id IS NOT NULL
+      AND n1.community_id != n2.community_id
+  `).get();
+    const crossCommunityEdges = crossCommRow.c;
+    // ── Compute percentages ───────────────────────────────────────────────────
+    const pct = (count, total) => total > 0 ? (count / total) * 100 : 0;
+    const penalties = {
+        unreachableFilePct: pct(unreachableFiles, totalFiles),
+        godNodePct: pct(godNodeCount, totalNodes),
+        circularEdgePct: pct(circularEdges, totalEdges),
+        hotspotPct: pct(hotspotCount, totalFiles),
+        isolatedNodePct: pct(isolatedNodes, totalNodes),
+        crossCommunityEdgePct: pct(crossCommunityEdges, totalEdges),
+    };
+    // ── Score formula ─────────────────────────────────────────────────────────
+    let score = 100;
+    score -= Math.min(penalties.unreachableFilePct * 0.25, 25);
+    score -= Math.min(penalties.godNodePct * 0.20, 20);
+    score -= Math.min(penalties.circularEdgePct * 0.20, 20);
+    score -= Math.min(penalties.hotspotPct * 0.15, 15);
+    score -= Math.min(penalties.isolatedNodePct * 0.10, 10);
+    score -= Math.min(penalties.crossCommunityEdgePct * 0.10, 10);
+    score = Math.max(0, Math.round(score * 10) / 10);
+    const grade = letterGrade(score);
+    const fmt = (pct, penalty) => `${pct.toFixed(1)}% (-${penalty.toFixed(1)})`;
+    const summary = [
+        `Grade: ${grade} (score: ${score}/100)`,
+        `Penalties:`,
+        `  unreachable files: ${fmt(penalties.unreachableFilePct, Math.min(penalties.unreachableFilePct * 0.25, 25))}`,
+        `  god nodes: ${fmt(penalties.godNodePct, Math.min(penalties.godNodePct * 0.20, 20))}`,
+        `  circular edges: ${fmt(penalties.circularEdgePct, Math.min(penalties.circularEdgePct * 0.20, 20))}`,
+        `  hotspot files: ${fmt(penalties.hotspotPct, Math.min(penalties.hotspotPct * 0.15, 15))}`,
+        `  isolated nodes: ${fmt(penalties.isolatedNodePct, Math.min(penalties.isolatedNodePct * 0.10, 10))}`,
+        `  cross-community edges: ${fmt(penalties.crossCommunityEdgePct, Math.min(penalties.crossCommunityEdgePct * 0.10, 10))}`,
+    ].join('\n');
+    return { score, grade, penalties, summary };
+}
+//# sourceMappingURL=health-score.js.map