@monoes/monograph 1.0.0 → 1.2.0

package/dist/src/analysis/cycles.js

@@ -0,0 +1,201 @@
+/**
+ * Iterative Tarjan's SCC algorithm to avoid stack overflow on large graphs.
+ * Returns arrays of node IDs, each array is one SCC.
+ */
+function tarjanSCC(adjacency, nodes) {
+    const index = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const sccs = [];
+    let counter = 0;
+    // Iterative DFS using explicit call stack
+    for (const startNode of nodes) {
+        if (index.has(startNode))
+            continue;
+        const callStack = [{ node: startNode, neighborIdx: 0 }];
+        index.set(startNode, counter);
+        lowlink.set(startNode, counter);
+        counter++;
+        stack.push(startNode);
+        onStack.add(startNode);
+        while (callStack.length > 0) {
+            const frame = callStack[callStack.length - 1];
+            const { node } = frame;
+            const neighbors = adjacency.get(node) ?? [];
+            if (frame.neighborIdx < neighbors.length) {
+                const neighbor = neighbors[frame.neighborIdx];
+                frame.neighborIdx++;
+                if (!index.has(neighbor)) {
+                    index.set(neighbor, counter);
+                    lowlink.set(neighbor, counter);
+                    counter++;
+                    stack.push(neighbor);
+                    onStack.add(neighbor);
+                    callStack.push({ node: neighbor, neighborIdx: 0 });
+                }
+                else if (onStack.has(neighbor)) {
+                    const curLow = lowlink.get(node);
+                    const neighborIdx = index.get(neighbor);
+                    if (neighborIdx < curLow) {
+                        lowlink.set(node, neighborIdx);
+                    }
+                }
+            }
+            else {
+                // Done with this node — pop and propagate lowlink to parent
+                callStack.pop();
+                if (callStack.length > 0) {
+                    const parent = callStack[callStack.length - 1].node;
+                    const parentLow = lowlink.get(parent);
+                    const nodeLow = lowlink.get(node);
+                    if (nodeLow < parentLow) {
+                        lowlink.set(parent, nodeLow);
+                    }
+                }
+                // If this is an SCC root, pop the stack
+                if (lowlink.get(node) === index.get(node)) {
+                    const scc = [];
+                    let w;
+                    do {
+                        w = stack.pop();
+                        onStack.delete(w);
+                        scc.push(w);
+                    } while (w !== node);
+                    sccs.push(scc);
+                }
+            }
+        }
+    }
+    return sccs;
+}
+/**
+ * Enumerate elementary cycles within a given SCC using DFS.
+ * Caps at maxCycles to avoid exponential blowup.
+ */
+function findCyclesInSCC(scc, adjacency, maxCycles) {
+    const sccSet = new Set(scc);
+    const cycles = [];
+    const seen = new Set();
+    for (const startNode of scc) {
+        if (cycles.length >= maxCycles)
+            break;
+        const path = [startNode];
+        const onPath = new Set([startNode]);
+        const dfs = (node) => {
+            if (cycles.length >= maxCycles)
+                return;
+            const neighbors = adjacency.get(node) ?? [];
+            for (const neighbor of neighbors) {
+                if (!sccSet.has(neighbor))
+                    continue;
+                if (neighbor === startNode && path.length > 1) {
+                    // Found a cycle — normalize via smallest-index-first rotation
+                    const canonical = canonicalRotation([...path]);
+                    const key = canonical.join('\0');
+                    if (!seen.has(key)) {
+                        seen.add(key);
+                        cycles.push([...path, startNode]);
+                    }
+                }
+                else if (!onPath.has(neighbor)) {
+                    path.push(neighbor);
+                    onPath.add(neighbor);
+                    dfs(neighbor);
+                    path.pop();
+                    onPath.delete(neighbor);
+                }
+            }
+        };
+        dfs(startNode);
+    }
+    return cycles;
+}
+function canonicalRotation(cycle) {
+    // Find index of lexicographically smallest element
+    let minIdx = 0;
+    for (let i = 1; i < cycle.length; i++) {
+        if (cycle[i] < cycle[minIdx])
+            minIdx = i;
+    }
+    return [...cycle.slice(minIdx), ...cycle.slice(0, minIdx)];
+}
+export function detectCycles(db) {
+    // Load all File nodes
+    const nodeRows = db.prepare(`SELECT id, file_path, community_id FROM nodes WHERE label = 'File'`).all();
+    const nodeMap = new Map();
+    for (const row of nodeRows) {
+        nodeMap.set(row.id, row);
+    }
+    // Load all IMPORTS and RE_EXPORTS edges between File nodes
+    const edgeRows = db.prepare(`SELECT e.source_id, e.target_id, e.relation
+     FROM edges e
+     WHERE e.relation IN ('IMPORTS', 'RE_EXPORTS')
+       AND e.source_id IN (SELECT id FROM nodes WHERE label = 'File')
+       AND e.target_id IN (SELECT id FROM nodes WHERE label = 'File')`).all();
+    // Build adjacency list
+    const adjacency = new Map();
+    const edgeRelationMap = new Map(); // "src\0tgt" -> relation
+    for (const row of nodeRows) {
+        adjacency.set(row.id, []);
+    }
+    for (const edge of edgeRows) {
+        const neighbors = adjacency.get(edge.source_id);
+        if (neighbors) {
+            neighbors.push(edge.target_id);
+        }
+        edgeRelationMap.set(`${edge.source_id}\0${edge.target_id}`, edge.relation);
+    }
+    // Run Tarjan's SCC
+    const nodeIds = nodeRows.map(n => n.id);
+    const sccs = tarjanSCC(adjacency, nodeIds);
+    // Only SCCs with size > 1 are actual cycles
+    const cycleSCCs = sccs.filter(scc => scc.length > 1);
+    const cycles = [];
+    const filesInCyclesSet = new Set();
+    for (const scc of cycleSCCs) {
+        const elementaryCycles = findCyclesInSCC(scc, adjacency, 20);
+        for (const cyclePath of elementaryCycles) {
+            // cyclePath is [...nodes, startNode] — last element = first
+            const cycleNodes = cyclePath.slice(0, -1);
+            for (const nodeId of cycleNodes) {
+                filesInCyclesSet.add(nodeId);
+            }
+            // Collect file paths
+            const files = cycleNodes.map(id => nodeMap.get(id)?.file_path ?? id);
+            // isCrossCommunity: any two nodes with different community_id
+            const communityIds = cycleNodes
+                .map(id => nodeMap.get(id)?.community_id)
+                .filter((c) => c !== null && c !== undefined);
+            const uniqueCommunities = new Set(communityIds);
+            const isCrossCommunity = uniqueCommunities.size > 1;
+            // Collect edge relations used in this cycle
+            const edgeRelations = [];
+            for (let i = 0; i < cyclePath.length - 1; i++) {
+                const key = `${cyclePath[i]}\0${cyclePath[i + 1]}`;
+                const rel = edgeRelationMap.get(key);
+                if (rel && !edgeRelations.includes(rel)) {
+                    edgeRelations.push(rel);
+                }
+            }
+            cycles.push({
+                files,
+                length: cycleNodes.length,
+                isCrossCommunity,
+                edgeRelations,
+            });
+        }
+    }
+    // Sort by length ascending
+    cycles.sort((a, b) => a.length - b.length);
+    const longestCycle = cycles.length > 0 ? cycles.reduce((a, c) => Math.max(a, c.length), 0) : 0;
+    const crossCommunityCycles = cycles.filter(c => c.isCrossCommunity).length;
+    return {
+        cycles,
+        totalCycles: cycles.length,
+        filesInCycles: filesInCyclesSet.size,
+        longestCycle,
+        crossCommunityCycles,
+    };
+}
+//# sourceMappingURL=cycles.js.map

package/dist/src/analysis/cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycles.js","sourceRoot":"","sources":["../../../src/analysis/cycles.ts"],"names":[],"mappings":"AA6BA;;;GAGG;AACH,SAAS,SAAS,CAAC,SAAgC,EAAE,KAAe;IAClE,MAAM,KAAK,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC7C,MAAM,OAAO,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC/C,MAAM,OAAO,GAAgB,IAAI,GAAG,EAAE,CAAC;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,0CAA0C;IAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,SAAS;QAInC,MAAM,SAAS,GAAY,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAEjE,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAChC,OAAO,EAAE,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAEvB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9C,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;YACvB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAE5C,IAAI,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBAC9C,KAAK,CAAC,WAAW,EAAE,CAAC;gBAEpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzB,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;oBAC/B,OAAO,EAAE,CAAC;oBACV,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;gBACrD,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;oBAClC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;oBACzC,IAAI,WAAW,GAAG,MAAM,EAAE,CAAC;wBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,4DAA4D;gBAC5D,SAAS,CAAC,GAAG,EAAE,CAAC;gBAChB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;oBACpD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBACvC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;oBACnC,IAAI,OAAO,GAAG,SAAS,EAAE,CAAC;wBACxB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;gBAED,wCAAwC;gBACxC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1C,MAAM,GAAG,GAAa,EAAE,CAAC;oBACzB,IAAI,CAAS,CAAC;oBACd,GAAG,CAAC;wBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;wBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE;oBACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CACtB,GAAa,EACb,SAAgC,EAChC,SAAiB;IAEjB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,SAAS,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;YAAE,MAAM;QAEtC,MAAM,IAAI,GAAa,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;QAE5C,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;YACjC,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;gBAAE,OAAO;YACvC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBACpC,IAAI,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9C,8DAA8D;oBAC9D,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;qBAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACpB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACrB,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACd,IAAI,CAAC,GAAG,EAAE,CAAC;oBACX,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,SAAS,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAe;IACxC,mDAAmD;IACnD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YAAE,MAAM,GAAG,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,EAAe;IAC1C,sBAAsB;IACtB,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CACzB,oEAAoE,CACrE,CAAC,GAAG,EAAe,CAAC;IAErB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,2DAA2D;IAC3D,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CACzB;;;;sEAIkE,CACnE,CAAC,GAAG,EAAe,CAAC;IAErB,uBAAuB;IACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,yBAAyB;IAE5E,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChD,IAAI,SAAS,EAAE,CAAC;YACd,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7E,CAAC;IAED,mBAAmB;IACnB,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAE3C,4CAA4C;IAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAErD,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAE3C,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,MAAM,gBAAgB,GAAG,eAAe,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;YACzC,4DAA4D;YAC5D,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE1C,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;YAED,qBAAqB;YACrB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC;YAErE,8DAA8D;YAC9D,MAAM,YAAY,GAAG,UAAU;iBAC5B,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC;iBACxC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC;YAC7D,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;YAChD,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAAC;YAEpD,4CAA4C;YAC5C,MAAM,aAAa,GAAa,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACnD,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YAED,MAAM,CAAC,IAAI,CAAC;gBACV,KAAK;gBACL,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,gBAAgB;gBAChB,aAAa;aACd,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE3C,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,MAAM,oBAAoB,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC;IAE3E,OAAO;QACL,MAAM;QACN,WAAW,EAAE,MAAM,CAAC,MAAM;QAC1B,aAAa,EAAE,gBAAgB,CAAC,IAAI;QACpC,YAAY;QACZ,oBAAoB;KACrB,CAAC;AACJ,CAAC"}

package/dist/src/analysis/dep-classification.d.ts

@@ -0,0 +1,17 @@
+import type { MonographDb } from '../storage/db.js';
+export interface PackageDepClassification {
+    packageName: string;
+    usedAsValue: boolean;
+    usedAsTypeOnly: boolean;
+    recommendation: 'keep-as-dep' | 'move-to-devdeps' | 'type-only' | 'unused';
+    importCount: number;
+    typeOnlyImportCount: number;
+}
+export interface DepClassificationResult {
+    packages: PackageDepClassification[];
+    typeOnlyCount: number;
+    mixedCount: number;
+    valueOnlyCount: number;
+}
+export declare function classifyDependencies(db: MonographDb): DepClassificationResult;
+//# sourceMappingURL=dep-classification.d.ts.map

package/dist/src/analysis/dep-classification.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-classification.d.ts","sourceRoot":"","sources":["../../../src/analysis/dep-classification.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,wBAAwB;IACvC,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,OAAO,CAAC;IACrB,cAAc,EAAE,OAAO,CAAC;IACxB,cAAc,EAAE,aAAa,GAAG,iBAAiB,GAAG,WAAW,GAAG,QAAQ,CAAC;IAC3E,WAAW,EAAE,MAAM,CAAC;IACpB,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,wBAAwB,EAAE,CAAC;IACrC,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;CACxB;AA+BD,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,WAAW,GAAG,uBAAuB,CAqF7E"}

package/dist/src/analysis/dep-classification.js

@@ -0,0 +1,99 @@
+function isExternalPackage(tgtName, tgtFilePath) {
+    // External if the file_path doesn't start with '/' or '.'
+    // and doesn't look like a relative import
+    if (!tgtFilePath) {
+        // Fall back to name heuristic: starts with alpha, no path separators
+        return /^[a-zA-Z@]/.test(tgtName) && !tgtName.includes('/') || /^@[a-zA-Z]/.test(tgtName);
+    }
+    return !tgtFilePath.startsWith('/') && !tgtFilePath.startsWith('.');
+}
+function extractPackageName(tgt) {
+    // Handle scoped packages like @scope/name
+    if (tgt.startsWith('@')) {
+        const parts = tgt.split('/');
+        return parts.slice(0, 2).join('/');
+    }
+    // Plain packages: take only the package name portion (before any '/')
+    return tgt.split('/')[0];
+}
+export function classifyDependencies(db) {
+    const rows = db.prepare(`
+    SELECT e.relation, e.confidence, n_src.file_path as src, n_tgt.file_path as tgt, n_tgt.name as tgt_name, e.properties
+    FROM edges e
+    JOIN nodes n_src ON n_src.id = e.source_id
+    JOIN nodes n_tgt ON n_tgt.id = e.target_id
+    WHERE e.relation = 'IMPORTS'
+  `).all();
+    // Aggregate per external package
+    const packageMap = new Map();
+    for (const row of rows) {
+        const tgtPath = row.tgt ?? '';
+        const tgtName = row.tgt_name ?? '';
+        if (!isExternalPackage(tgtName, tgtPath))
+            continue;
+        const packageName = extractPackageName(tgtName || tgtPath);
+        if (!packageName)
+            continue;
+        // Check if type-only: parse properties JSON for isTypeOnly flag
+        let isTypeOnly = false;
+        if (row.properties) {
+            try {
+                const props = JSON.parse(row.properties);
+                isTypeOnly = props['isTypeOnly'] === true;
+            }
+            catch {
+                // fall through — infer from confidence
+            }
+        }
+        // Note: INFERRED confidence is NOT a reliable signal for type-only imports —
+        // re-export propagation and wildcard synthesis both emit INFERRED edges for real
+        // runtime imports. Only trust the explicit isTypeOnly property.
+        const existing = packageMap.get(packageName) ?? { valueImports: 0, typeImports: 0 };
+        if (isTypeOnly) {
+            existing.typeImports++;
+        }
+        else {
+            existing.valueImports++;
+        }
+        packageMap.set(packageName, existing);
+    }
+    const packages = [];
+    for (const [packageName, counts] of packageMap) {
+        const usedAsValue = counts.valueImports > 0;
+        const usedAsTypeOnly = counts.typeImports > 0;
+        let recommendation;
+        if (usedAsValue && usedAsTypeOnly) {
+            recommendation = 'keep-as-dep';
+        }
+        else if (usedAsValue && !usedAsTypeOnly) {
+            recommendation = 'keep-as-dep';
+        }
+        else if (!usedAsValue && usedAsTypeOnly) {
+            recommendation = 'type-only';
+        }
+        else {
+            recommendation = 'unused';
+        }
+        packages.push({
+            packageName,
+            usedAsValue,
+            usedAsTypeOnly,
+            recommendation,
+            importCount: counts.valueImports + counts.typeImports,
+            typeOnlyImportCount: counts.typeImports,
+        });
+    }
+    // Sort: 'type-only' first, then 'unused', then rest
+    const ORDER = { 'type-only': 0, 'unused': 1, 'move-to-devdeps': 2, 'keep-as-dep': 3 };
+    packages.sort((a, b) => (ORDER[a.recommendation] ?? 3) - (ORDER[b.recommendation] ?? 3));
+    const typeOnlyCount = packages.filter(p => p.recommendation === 'type-only').length;
+    const mixedCount = packages.filter(p => p.usedAsValue && p.usedAsTypeOnly).length;
+    const valueOnlyCount = packages.filter(p => p.usedAsValue && !p.usedAsTypeOnly).length;
+    return {
+        packages,
+        typeOnlyCount,
+        mixedCount,
+        valueOnlyCount,
+    };
+}
+//# sourceMappingURL=dep-classification.js.map

package/dist/src/analysis/dep-classification.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-classification.js","sourceRoot":"","sources":["../../../src/analysis/dep-classification.ts"],"names":[],"mappings":"AA2BA,SAAS,iBAAiB,CAAC,OAAe,EAAE,WAAmB;IAC7D,0DAA0D;IAC1D,0CAA0C;IAC1C,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,qEAAqE;QACrE,OAAO,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,kBAAkB,CAAC,GAAW;IACrC,0CAA0C;IAC1C,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,sEAAsE;IACtE,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,EAAe;IAClD,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;GAMvB,CAAC,CAAC,GAAG,EAAe,CAAC;IAEtB,iCAAiC;IACjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyD,CAAC;IAEpF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC;QAEnC,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,OAAO,CAAC;YAAE,SAAS;QAEnD,MAAM,WAAW,GAAG,kBAAkB,CAAC,OAAO,IAAI,OAAO,CAAC,CAAC;QAC3D,IAAI,CAAC,WAAW;YAAE,SAAS;QAE3B,gEAAgE;QAChE,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAA4B,CAAC;gBACpE,UAAU,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,IAAI,CAAC;YAC5C,CAAC;YAAC,MAAM,CAAC;gBACP,uCAAuC;YACzC,CAAC;QACH,CAAC;QACD,6EAA6E;QAC7E,iFAAiF;QACjF,gEAAgE;QAEhE,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QACpF,IAAI,UAAU,EAAE,CAAC;YACf,QAAQ,CAAC,WAAW,EAAE,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC1B,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,QAAQ,GAA+B,EAAE,CAAC;IAEhD,KAAK,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC;QAC5C,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;QAE9C,IAAI,cAA0D,CAAC;QAC/D,IAAI,WAAW,IAAI,cAAc,EAAE,CAAC;YAClC,cAAc,GAAG,aAAa,CAAC;QACjC,CAAC;aAAM,IAAI,WAAW,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1C,cAAc,GAAG,aAAa,CAAC;QACjC,CAAC;aAAM,IAAI,CAAC,WAAW,IAAI,cAAc,EAAE,CAAC;YAC1C,cAAc,GAAG,WAAW,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,cAAc,GAAG,QAAQ,CAAC;QAC5B,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,WAAW;YACX,WAAW;YACX,cAAc;YACd,cAAc;YACd,WAAW,EAAE,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,WAAW;YACrD,mBAAmB,EAAE,MAAM,CAAC,WAAW;SACxC,CAAC,CAAC;IACL,CAAC;IAED,oDAAoD;IACpD,MAAM,KAAK,GAA2B,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC;IAC9G,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEzF,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,WAAW,CAAC,CAAC,MAAM,CAAC;IACpF,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC;IAClF,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC;IAEvF,OAAO;QACL,QAAQ;QACR,aAAa;QACb,UAAU;QACV,cAAc;KACf,CAAC;AACJ,CAAC"}

package/dist/src/analysis/dependency-health.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Dependency health scoring.
+ *
+ * Produces a composite [0, 1] score by combining four sub-metrics:
+ *
+ *  1. Cycle penalty   — fraction of nodes involved in cycles (lower = worse)
+ *  2. Dead-code ratio — fraction of nodes that are unreachable / unused
+ *  3. Fan-out skew    — coefficient of variation of out-degrees (high skew = god nodes)
+ *  4. God-node concentration — max in-degree / total edges (hub dominance)
+ *
+ * Final score = 1 − weighted average of penalties.
+ * All individual penalty components are clamped to [0, 1].
+ */
+export interface DependencyHealthEdge {
+    sourceId: string;
+    targetId: string;
+}
+export interface DependencyHealthInput {
+    /** All node IDs in the graph. */
+    nodes: string[];
+    /** All directed edges. */
+    edges: DependencyHealthEdge[];
+    /** Pre-computed number of cycles (e.g., from detectCycles). */
+    cycleCount: number;
+    /** Pre-computed count of dead nodes (e.g., from detectDeadCode). */
+    deadNodeCount: number;
+}
+export interface DependencyHealthDetails {
+    /** Fraction of nodes involved in cycles in [0, 1]. */
+    cyclePenalty: number;
+    /** Fraction of dead nodes in [0, 1]. */
+    deadCodeRatio: number;
+    /** Coefficient of variation for out-degree distribution (normalised to [0,1]). */
+    fanSkew: number;
+    /** Max in-degree / total edge count — hub dominance in [0, 1]. */
+    godNodeConcentration: number;
+}
+export interface DependencyHealthResult {
+    /** Composite health score in [0, 1] where 1 is perfectly healthy. */
+    score: number;
+    details: DependencyHealthDetails;
+}
+/**
+ * Compute a composite dependency health score for the given graph.
+ */
+export declare function dependencyHealth(input: DependencyHealthInput): DependencyHealthResult;
+//# sourceMappingURL=dependency-health.d.ts.map

package/dist/src/analysis/dependency-health.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-health.d.ts","sourceRoot":"","sources":["../../../src/analysis/dependency-health.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,qBAAqB;IACpC,iCAAiC;IACjC,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,0BAA0B;IAC1B,KAAK,EAAE,oBAAoB,EAAE,CAAC;IAC9B,+DAA+D;IAC/D,UAAU,EAAE,MAAM,CAAC;IACnB,oEAAoE;IACpE,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,uBAAuB;IACtC,sDAAsD;IACtD,YAAY,EAAE,MAAM,CAAC;IACrB,wCAAwC;IACxC,aAAa,EAAE,MAAM,CAAC;IACtB,kFAAkF;IAClF,OAAO,EAAE,MAAM,CAAC;IAChB,kEAAkE;IAClE,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,sBAAsB;IACrC,qEAAqE;IACrE,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,uBAAuB,CAAC;CAClC;AAaD;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,qBAAqB,GAAG,sBAAsB,CA2DrF"}

package/dist/src/analysis/dependency-health.js

@@ -0,0 +1,77 @@
+/**
+ * Dependency health scoring.
+ *
+ * Produces a composite [0, 1] score by combining four sub-metrics:
+ *
+ *  1. Cycle penalty   — fraction of nodes involved in cycles (lower = worse)
+ *  2. Dead-code ratio — fraction of nodes that are unreachable / unused
+ *  3. Fan-out skew    — coefficient of variation of out-degrees (high skew = god nodes)
+ *  4. God-node concentration — max in-degree / total edges (hub dominance)
+ *
+ * Final score = 1 − weighted average of penalties.
+ * All individual penalty components are clamped to [0, 1].
+ */
+function stdDev(values) {
+    if (values.length === 0)
+        return 0;
+    const mean = values.reduce((a, b) => a + b, 0) / values.length;
+    const variance = values.reduce((a, b) => a + (b - mean) ** 2, 0) / values.length;
+    return Math.sqrt(variance);
+}
+function clamp(x) {
+    return Math.max(0, Math.min(1, x));
+}
+/**
+ * Compute a composite dependency health score for the given graph.
+ */
+export function dependencyHealth(input) {
+    const { nodes, edges, cycleCount, deadNodeCount } = input;
+    const n = nodes.length;
+    const m = edges.length;
+    if (n === 0) {
+        return {
+            score: 1,
+            details: { cyclePenalty: 0, deadCodeRatio: 0, fanSkew: 0, godNodeConcentration: 0 },
+        };
+    }
+    // 1. Cycle penalty: cycleCount is the number of nodes in cycles (from topologicalLevelSort)
+    //    Normalised by node count. Capped at 1.
+    const cyclePenalty = clamp(cycleCount / n);
+    // 2. Dead-code ratio
+    const deadCodeRatio = clamp(deadNodeCount / n);
+    // 3. Fan-out skew: coefficient of variation of out-degrees, normalised
+    const outDegree = new Map(nodes.map(id => [id, 0]));
+    for (const { sourceId } of edges) {
+        outDegree.set(sourceId, (outDegree.get(sourceId) ?? 0) + 1);
+    }
+    const outValues = [...outDegree.values()];
+    const outMean = outValues.reduce((a, b) => a + b, 0) / n;
+    const cv = outMean > 0 ? stdDev(outValues) / outMean : 0;
+    // CV > 2 → very skewed; normalise to [0,1] by clamping at 4
+    const fanSkew = clamp(cv / 4);
+    // 4. God-node concentration: max in-degree / total edges
+    const inDegree = new Map(nodes.map(id => [id, 0]));
+    for (const { targetId } of edges) {
+        inDegree.set(targetId, (inDegree.get(targetId) ?? 0) + 1);
+    }
+    // Use reduce instead of spread to avoid RangeError on graphs with 65k+ nodes
+    const maxInDeg = inDegree.size > 0
+        ? [...inDegree.values()].reduce((a, b) => Math.max(a, b), 0)
+        : 0;
+    const godNodeConcentration = m > 0 ? clamp(maxInDeg / m) : 0;
+    // Weighted composite penalty (weights sum to 1)
+    const W_CYCLE = 0.35;
+    const W_DEAD = 0.25;
+    const W_FAN = 0.20;
+    const W_GOD = 0.20;
+    const penalty = W_CYCLE * cyclePenalty +
+        W_DEAD * deadCodeRatio +
+        W_FAN * fanSkew +
+        W_GOD * godNodeConcentration;
+    const score = clamp(1 - penalty);
+    return {
+        score,
+        details: { cyclePenalty, deadCodeRatio, fanSkew, godNodeConcentration },
+    };
+}
+//# sourceMappingURL=dependency-health.js.map

package/dist/src/analysis/dependency-health.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-health.js","sourceRoot":"","sources":["../../../src/analysis/dependency-health.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAmCH,SAAS,MAAM,CAAC,MAAgB;IAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACjF,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,KAAK,CAAC,CAAS;IACtB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,KAAK,CAAC;IAC1D,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO;YACL,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,oBAAoB,EAAE,CAAC,EAAE;SACpF,CAAC;IACJ,CAAC;IAED,4FAA4F;IAC5F,4CAA4C;IAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAE3C,qBAAqB;IACrB,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;IAE/C,uEAAuE;IACvE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,KAAK,EAAE,CAAC;QACjC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACzD,MAAM,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,4DAA4D;IAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAE9B,yDAAyD;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,KAAK,EAAE,CAAC;QACjC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,6EAA6E;IAC7E,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,GAAG,CAAC;QAChC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC,CAAC;IACN,MAAM,oBAAoB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7D,gDAAgD;IAChD,MAAM,OAAO,GAAG,IAAI,CAAC;IACrB,MAAM,MAAM,GAAG,IAAI,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,CAAC;IACnB,MAAM,KAAK,GAAG,IAAI,CAAC;IAEnB,MAAM,OAAO,GACX,OAAO,GAAG,YAAY;QACtB,MAAM,GAAG,aAAa;QACtB,KAAK,GAAG,OAAO;QACf,KAAK,GAAG,oBAAoB,CAAC;IAE/B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;IAEjC,OAAO;QACL,KAAK;QACL,OAAO,EAAE,EAAE,YAAY,EAAE,aAAa,EAAE,OAAO,EAAE,oBAAoB,EAAE;KACxE,CAAC;AACJ,CAAC"}

package/dist/src/analysis/duplicate-exports.d.ts

@@ -0,0 +1,17 @@
+import type { MonographDb } from '../storage/db.js';
+export interface DuplicateExportGroup {
+    exportName: string;
+    locations: Array<{
+        nodeId: string;
+        filePath: string | null;
+        label: string;
+    }>;
+    count: number;
+}
+export interface DuplicateExportsResult {
+    groups: DuplicateExportGroup[];
+    totalDuplicates: number;
+    affectedFiles: number;
+}
+export declare function detectDuplicateExports(db: MonographDb): DuplicateExportsResult;
+//# sourceMappingURL=duplicate-exports.d.ts.map

package/dist/src/analysis/duplicate-exports.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-exports.d.ts","sourceRoot":"","sources":["../../../src/analysis/duplicate-exports.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,oBAAoB;IACnC,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC7E,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,sBAAsB;IACrC,MAAM,EAAE,oBAAoB,EAAE,CAAC;IAC/B,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;CACvB;AAYD,wBAAgB,sBAAsB,CAAC,EAAE,EAAE,WAAW,GAAG,sBAAsB,CAiD9E"}

package/dist/src/analysis/duplicate-exports.js

@@ -0,0 +1,45 @@
+/** Generic names that are too common to be meaningful duplicates. */
+const GENERIC_NAMES = new Set(['default', 'index', 'module']);
+export function detectDuplicateExports(db) {
+    const rows = db.prepare(`SELECT id, name, file_path, label
+     FROM nodes
+     WHERE is_exported = 1
+       AND label IN ('Function','Class','Method','Interface','Const','TypeAlias','Enum','Variable')`).all();
+    // Group by normalized name
+    const groups = new Map();
+    for (const row of rows) {
+        const normalized = row.name.toLowerCase().trim();
+        if (GENERIC_NAMES.has(normalized))
+            continue;
+        let list = groups.get(normalized);
+        if (!list) {
+            list = [];
+            groups.set(normalized, list);
+        }
+        list.push({ nodeId: row.id, filePath: row.file_path, label: row.label });
+    }
+    // Filter to duplicates only (count > 1)
+    const duplicateGroups = [];
+    const affectedFileSet = new Set();
+    for (const [name, locations] of groups) {
+        if (locations.length <= 1)
+            continue;
+        duplicateGroups.push({
+            exportName: name,
+            locations,
+            count: locations.length,
+        });
+        for (const loc of locations) {
+            if (loc.filePath)
+                affectedFileSet.add(loc.filePath);
+        }
+    }
+    // Sort by count descending
+    duplicateGroups.sort((a, b) => b.count - a.count);
+    return {
+        groups: duplicateGroups,
+        totalDuplicates: duplicateGroups.length,
+        affectedFiles: affectedFileSet.size,
+    };
+}
+//# sourceMappingURL=duplicate-exports.js.map

package/dist/src/analysis/duplicate-exports.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-exports.js","sourceRoot":"","sources":["../../../src/analysis/duplicate-exports.ts"],"names":[],"mappings":"AAqBA,qEAAqE;AACrE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;AAE9D,MAAM,UAAU,sBAAsB,CAAC,EAAe;IACpD,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;;oGAGgG,CACjG,CAAC,GAAG,EAAmB,CAAC;IAEzB,2BAA2B;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6E,CAAC;IAEpG,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QACjD,IAAI,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,SAAS;QAE5C,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;YACV,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,wCAAwC;IACxC,MAAM,eAAe,GAA2B,EAAE,CAAC;IACnD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAE1C,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,MAAM,EAAE,CAAC;QACvC,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC;YAAE,SAAS;QAEpC,eAAe,CAAC,IAAI,CAAC;YACnB,UAAU,EAAE,IAAI;YAChB,SAAS;YACT,KAAK,EAAE,SAAS,CAAC,MAAM;SACxB,CAAC,CAAC;QAEH,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,IAAI,GAAG,CAAC,QAAQ;gBAAE,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAElD,OAAO;QACL,MAAM,EAAE,eAAe;QACvB,eAAe,EAAE,eAAe,CAAC,MAAM;QACvC,aAAa,EAAE,eAAe,CAAC,IAAI;KACpC,CAAC;AACJ,CAAC"}

package/dist/src/analysis/fallow-suppression.d.ts

@@ -0,0 +1,12 @@
+export type FallowIssueKind = 'unused-file' | 'unused-export' | 'unused-type' | 'private-type-leak' | 'unused-dependency' | 'unused-dev-dependency' | 'unused-enum-member' | 'unused-class-member' | 'unresolved-import' | 'unlisted-dependency' | 'duplicate-export' | 'code-duplication' | 'circular-dependency' | 'type-only-dependency' | 'test-only-dependency' | 'boundary-violation' | 'coverage-gaps' | 'feature-flag' | 'complexity' | 'stale-suppression';
+export interface FallowSuppression {
+    line: number;
+    commentLine: number;
+    kind: FallowIssueKind | null;
+}
+export declare function parseFallowIssueKind(s: string): FallowIssueKind | undefined;
+export declare function issueKindToDiscriminant(kind: FallowIssueKind): number;
+export declare function issueKindFromDiscriminant(d: number): FallowIssueKind | undefined;
+export declare function isFallowSuppression(line: number): boolean;
+export declare function isFileWideSuppression(suppression: FallowSuppression): boolean;
+//# sourceMappingURL=fallow-suppression.d.ts.map

package/dist/src/analysis/fallow-suppression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fallow-suppression.d.ts","sourceRoot":"","sources":["../../../src/analysis/fallow-suppression.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,eAAe,GACvB,aAAa,GACb,eAAe,GACf,aAAa,GACb,mBAAmB,GACnB,mBAAmB,GACnB,uBAAuB,GACvB,oBAAoB,GACpB,qBAAqB,GACrB,mBAAmB,GACnB,qBAAqB,GACrB,kBAAkB,GAClB,kBAAkB,GAClB,qBAAqB,GACrB,sBAAsB,GACtB,sBAAsB,GACtB,oBAAoB,GACpB,eAAe,GACf,cAAc,GACd,YAAY,GACZ,mBAAmB,CAAC;AAExB,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,eAAe,GAAG,IAAI,CAAC;CAC9B;AAkDD,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAI3E;AAED,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,eAAe,GAAG,MAAM,CAErE;AAED,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAGhF;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEzD;AAED,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,GAAG,OAAO,CAE7E"}

package/dist/src/analysis/fallow-suppression.js

@@ -0,0 +1,67 @@
+const DISCRIMINANT_MAP = {
+    'unused-file': 1,
+    'unused-export': 2,
+    'unused-type': 3,
+    'private-type-leak': 4,
+    'unused-dependency': 5,
+    'unused-dev-dependency': 6,
+    'unused-enum-member': 7,
+    'unused-class-member': 8,
+    'unresolved-import': 9,
+    'unlisted-dependency': 10,
+    'duplicate-export': 11,
+    'code-duplication': 12,
+    'circular-dependency': 13,
+    'type-only-dependency': 14,
+    'test-only-dependency': 15,
+    'boundary-violation': 16,
+    'coverage-gaps': 17,
+    'feature-flag': 18,
+    'complexity': 19,
+    'stale-suppression': 20,
+};
+const DISCRIMINANT_REVERSE = [
+    'unused-file',
+    'unused-export',
+    'unused-type',
+    'private-type-leak',
+    'unused-dependency',
+    'unused-dev-dependency',
+    'unused-enum-member',
+    'unused-class-member',
+    'unresolved-import',
+    'unlisted-dependency',
+    'duplicate-export',
+    'code-duplication',
+    'circular-dependency',
+    'type-only-dependency',
+    'test-only-dependency',
+    'boundary-violation',
+    'coverage-gaps',
+    'feature-flag',
+    'complexity',
+    'stale-suppression',
+];
+const VALID_KINDS = new Set(Object.keys(DISCRIMINANT_MAP));
+export function parseFallowIssueKind(s) {
+    if (s === 'circular-dependencies')
+        return 'circular-dependency';
+    if (VALID_KINDS.has(s))
+        return s;
+    return undefined;
+}
+export function issueKindToDiscriminant(kind) {
+    return DISCRIMINANT_MAP[kind];
+}
+export function issueKindFromDiscriminant(d) {
+    if (d <= 0 || d > 20)
+        return undefined;
+    return DISCRIMINANT_REVERSE[d - 1];
+}
+export function isFallowSuppression(line) {
+    return line === 0 || line > 0;
+}
+export function isFileWideSuppression(suppression) {
+    return suppression.line === 0;
+}
+//# sourceMappingURL=fallow-suppression.js.map

package/dist/src/analysis/fallow-suppression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fallow-suppression.js","sourceRoot":"","sources":["../../../src/analysis/fallow-suppression.ts"],"names":[],"mappings":"AA4BA,MAAM,gBAAgB,GAAoC;IACxD,aAAa,EAAE,CAAC;IAChB,eAAe,EAAE,CAAC;IAClB,aAAa,EAAE,CAAC;IAChB,mBAAmB,EAAE,CAAC;IACtB,mBAAmB,EAAE,CAAC;IACtB,uBAAuB,EAAE,CAAC;IAC1B,oBAAoB,EAAE,CAAC;IACvB,qBAAqB,EAAE,CAAC;IACxB,mBAAmB,EAAE,CAAC;IACtB,qBAAqB,EAAE,EAAE;IACzB,kBAAkB,EAAE,EAAE;IACtB,kBAAkB,EAAE,EAAE;IACtB,qBAAqB,EAAE,EAAE;IACzB,sBAAsB,EAAE,EAAE;IAC1B,sBAAsB,EAAE,EAAE;IAC1B,oBAAoB,EAAE,EAAE;IACxB,eAAe,EAAE,EAAE;IACnB,cAAc,EAAE,EAAE;IAClB,YAAY,EAAE,EAAE;IAChB,mBAAmB,EAAE,EAAE;CACxB,CAAC;AAEF,MAAM,oBAAoB,GAAsB;IAC9C,aAAa;IACb,eAAe;IACf,aAAa;IACb,mBAAmB;IACnB,mBAAmB;IACnB,uBAAuB;IACvB,oBAAoB;IACpB,qBAAqB;IACrB,mBAAmB;IACnB,qBAAqB;IACrB,kBAAkB;IAClB,kBAAkB;IAClB,qBAAqB;IACrB,sBAAsB;IACtB,sBAAsB;IACtB,oBAAoB;IACpB,eAAe;IACf,cAAc;IACd,YAAY;IACZ,mBAAmB;CACpB,CAAC;AAEF,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;AAEnE,MAAM,UAAU,oBAAoB,CAAC,CAAS;IAC5C,IAAI,CAAC,KAAK,uBAAuB;QAAE,OAAO,qBAAqB,CAAC;IAChE,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,OAAO,CAAoB,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,IAAqB;IAC3D,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,yBAAyB,CAAC,CAAS;IACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,SAAS,CAAC;IACvC,OAAO,oBAAoB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,IAAI,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,WAA8B;IAClE,OAAO,WAAW,CAAC,IAAI,KAAK,CAAC,CAAC;AAChC,CAAC"}