@monoes/monograph 1.5.3 → 1.5.5

package/dist/src/__tests__/wiki/wiki-review-mode.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"wiki-review-mode.test.js","sourceRoot":"","sources":["../../../../src/__tests__/wiki/wiki-review-mode.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,YAAY,EAA6B,MAAM,8BAA8B,CAAC;AAEvF,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,IAAI,GAAyB;YACjC,QAAQ,EAAE,MAAM;YAChB,UAAU,EAAE,IAAI;SACjB,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;QACjF,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC;YAChC,QAAQ,EAAE,MAAM;YAChB,UAAU,EAAE,IAAI;YAChB,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAS;SAClD,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAClD,MAAM,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/analysis/cycles.d.ts

@@ -1,16 +0,0 @@
-import type { MonographDb } from '../storage/db.js';
-export interface DependencyCycle {
-    files: string[];
-    length: number;
-    isCrossCommunity: boolean;
-    edgeRelations: string[];
-}
-export interface CycleDetectionResult {
-    cycles: DependencyCycle[];
-    totalCycles: number;
-    filesInCycles: number;
-    longestCycle: number;
-    crossCommunityCycles: number;
-}
-export declare function detectCycles(db: MonographDb): CycleDetectionResult;
-//# sourceMappingURL=cycles.d.ts.map

package/dist/src/analysis/cycles.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cycles.d.ts","sourceRoot":"","sources":["../../../src/analysis/cycles.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,EAAE,OAAO,CAAC;IAC1B,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,eAAe,EAAE,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAsJD,wBAAgB,YAAY,CAAC,EAAE,EAAE,WAAW,GAAG,oBAAoB,CAsGlE"}

package/dist/src/analysis/cycles.js

@@ -1,203 +0,0 @@
-/**
- * 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);
-    // SCCs with size > 1 are multi-node cycles; size-1 SCCs are cycles only if self-referencing
-    const cycleSCCs = sccs.filter(scc => scc.length > 1 || (scc.length === 1 && adjacency.get(scc[0])?.includes(scc[0])));
-    const cycles = [];
-    const filesInCyclesSet = new Set();
-    for (const scc of cycleSCCs) {
-        const elementaryCycles = scc.length === 1
-            ? [[scc[0], scc[0]]]
-            : 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

@@ -1 +0,0 @@
-{"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,4FAA4F;IAC5F,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAClC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAChF,CAAC;IAEF,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,GAAG,CAAC,MAAM,KAAK,CAAC;YACvC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,CAAC,eAAe,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;QACxC,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/trace.d.ts

@@ -1,80 +0,0 @@
-export type TraceReason = 'no_references' | 'only_re_exported' | 'self_import' | 'has_references';
-export interface ReferenceLocation {
-    filePath: string;
-    line: number;
-    col: number;
-}
-export interface ReExportChain {
-    path: string;
-    exportName: string;
-}
-export interface ExportTrace {
-    file: string;
-    exportName: string;
-    isUsed: boolean;
-    directReferences: ReferenceLocation[];
-    reExportChains: ReExportChain[];
-    reason: TraceReason;
-}
-export interface FileTrace {
-    file: string;
-    exports: Array<{
-        name: string;
-        isUsed: boolean;
-        line: number;
-    }>;
-    importsFrom: string[];
-    importedBy: string[];
-    reExports: Array<{
-        name: string;
-        fromFile: string;
-    }>;
-}
-export interface DependencyTrace {
-    packageName: string;
-    directImporters: string[];
-    transitiveImporters: string[];
-    isUsed: boolean;
-}
-export interface CloneInstance {
-    filePath: string;
-    startLine: number;
-    endLine: number;
-    similarity: number;
-}
-export interface CloneTrace {
-    sourceFile: string;
-    sourceLine: number;
-    matchingInstances: CloneInstance[];
-    groupId?: number;
-}
-export interface GraphNode {
-    id: string;
-    filePath?: string;
-    name: string;
-    isExported: boolean;
-    startLine?: number;
-}
-interface GraphEdge {
-    sourceId: string;
-    targetId: string;
-    relation: string;
-}
-interface Graph {
-    nodes: GraphNode[];
-    edges: GraphEdge[];
-}
-/** Build an O(1) id→node index. Pass to the trace functions when calling multiple times on the same graph. */
-export declare function buildNodeIndex(graph: Graph): Map<string, GraphNode>;
-export declare function traceExport(graph: Graph, file: string, exportName: string, nodeIndex?: Map<string, GraphNode>): ExportTrace;
-export declare function traceFile(graph: Graph, file: string, nodeIndex?: Map<string, GraphNode>): FileTrace;
-export declare function traceDependency(importEdges: Array<{
-    sourceFile: string;
-    targetPackage: string;
-}>, packageName: string): DependencyTrace;
-export declare function traceClone(cloneGroups: Array<{
-    id: number;
-    instances: CloneInstance[];
-}>, file: string, line: number): CloneTrace;
-export {};
-//# sourceMappingURL=trace.d.ts.map

package/dist/src/analysis/trace.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"trace.d.ts","sourceRoot":"","sources":["../../../src/analysis/trace.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,WAAW,GAAG,eAAe,GAAG,kBAAkB,GAAG,aAAa,GAAG,gBAAgB,CAAC;AAElG,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,OAAO,CAAC;IAChB,gBAAgB,EAAE,iBAAiB,EAAE,CAAC;IACtC,cAAc,EAAE,aAAa,EAAE,CAAC;IAChC,MAAM,EAAE,WAAW,CAAC;CACrB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,OAAO,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAChE,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,SAAS,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtD;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,MAAM,EAAE,OAAO,CAAC;CACjB;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,aAAa,EAAE,CAAC;IACnC,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,OAAO,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,UAAU,SAAS;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,UAAU,KAAK;IACb,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;CACpB;AAED,8GAA8G;AAC9G,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAInE;AAED,wBAAgB,WAAW,CACzB,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,MAAM,EAClB,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,GACjC,WAAW,CA4Db;AAED,wBAAgB,SAAS,CACvB,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,MAAM,EACZ,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,GACjC,SAAS,CAmEX;AAED,wBAAgB,eAAe,CAC7B,WAAW,EAAE,KAAK,CAAC;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,CAAC,EACjE,WAAW,EAAE,MAAM,GAClB,eAAe,CAyCjB;AAED,wBAAgB,UAAU,CACxB,WAAW,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,aAAa,EAAE,CAAA;CAAE,CAAC,EAC9D,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,GACX,UAAU,CAgCZ"}

package/dist/src/analysis/trace.js

@@ -1,186 +0,0 @@
-/** Build an O(1) id→node index. Pass to the trace functions when calling multiple times on the same graph. */
-export function buildNodeIndex(graph) {
-    const index = new Map();
-    for (const n of graph.nodes)
-        index.set(n.id, n);
-    return index;
-}
-export function traceExport(graph, file, exportName, nodeIndex) {
-    // Build index once if not supplied — O(N) amortised when caller reuses it
-    const idx = nodeIndex ?? buildNodeIndex(graph);
-    // Find nodes in the target file matching exportName
-    const targetIds = new Set();
-    for (const n of graph.nodes) {
-        if (n.filePath === file && n.name === exportName)
-            targetIds.add(n.id);
-    }
-    // Find CALLS or IMPORTS edges pointing to these nodes from other files
-    const directReferences = [];
-    const reExportChains = [];
-    for (const edge of graph.edges) {
-        if (!targetIds.has(edge.targetId))
-            continue;
-        const sourceNode = idx.get(edge.sourceId);
-        if (!sourceNode)
-            continue;
-        // Skip self-references (same file)
-        if (sourceNode.filePath === file)
-            continue;
-        if (edge.relation === 'CALLS' || edge.relation === 'IMPORTS') {
-            directReferences.push({
-                filePath: sourceNode.filePath ?? sourceNode.id,
-                line: sourceNode.startLine ?? 0,
-                col: 0,
-            });
-        }
-        else if (edge.relation === 'RE_EXPORTS') {
-            reExportChains.push({
-                path: sourceNode.filePath ?? sourceNode.id,
-                exportName: sourceNode.name,
-            });
-        }
-    }
-    // Determine reason
-    let reason;
-    let isUsed;
-    if (directReferences.length > 0) {
-        reason = 'has_references';
-        isUsed = true;
-    }
-    else if (reExportChains.length > 0) {
-        reason = 'only_re_exported';
-        isUsed = false;
-    }
-    else {
-        reason = 'no_references';
-        isUsed = false;
-    }
-    return {
-        file,
-        exportName,
-        isUsed,
-        directReferences,
-        reExportChains,
-        reason,
-    };
-}
-export function traceFile(graph, file, nodeIndex) {
-    // Build index once if not supplied
-    const idx = nodeIndex ?? buildNodeIndex(graph);
-    // Find all nodes in this file
-    const fileNodes = graph.nodes.filter((n) => n.filePath === file);
-    const fileNodeIds = new Set(fileNodes.map((n) => n.id));
-    // Pre-compute which target node ids have external references in one edge pass
-    // to avoid O(exported_nodes * edges) in the map below.
-    const externallyReferenced = new Set();
-    const importsFromSet = new Set();
-    const importedBySet = new Set();
-    const reExports = [];
-    for (const edge of graph.edges) {
-        const srcInFile = fileNodeIds.has(edge.sourceId);
-        const tgtInFile = fileNodeIds.has(edge.targetId);
-        if (edge.relation === 'IMPORTS') {
-            if (srcInFile) {
-                const targetNode = idx.get(edge.targetId);
-                if (targetNode?.filePath && targetNode.filePath !== file) {
-                    importsFromSet.add(targetNode.filePath);
-                }
-            }
-            if (tgtInFile) {
-                const sourceNode = idx.get(edge.sourceId);
-                if (sourceNode?.filePath && sourceNode.filePath !== file) {
-                    importedBySet.add(sourceNode.filePath);
-                }
-            }
-            // External IMPORTS into a file node → that node is externally referenced
-            if (tgtInFile && !srcInFile) {
-                externallyReferenced.add(edge.targetId);
-            }
-        }
-        if (edge.relation === 'CALLS' && tgtInFile && !srcInFile) {
-            externallyReferenced.add(edge.targetId);
-        }
-        if (edge.relation === 'RE_EXPORTS' && srcInFile) {
-            const sourceNode = idx.get(edge.sourceId);
-            const targetNode = idx.get(edge.targetId);
-            if (sourceNode && targetNode?.filePath) {
-                reExports.push({ name: sourceNode.name, fromFile: targetNode.filePath });
-            }
-        }
-    }
-    // Build exports list using pre-computed set — O(exported_nodes) not O(exported_nodes * edges)
-    const exports = fileNodes
-        .filter((n) => n.isExported)
-        .map((n) => ({
-        name: n.name,
-        isUsed: externallyReferenced.has(n.id),
-        line: n.startLine ?? 0,
-    }));
-    return {
-        file,
-        exports,
-        importsFrom: Array.from(importsFromSet),
-        importedBy: Array.from(importedBySet),
-        reExports,
-    };
-}
-export function traceDependency(importEdges, packageName) {
-    // Find direct importers
-    const directImporters = importEdges
-        .filter((e) => e.targetPackage === packageName)
-        .map((e) => e.sourceFile);
-    const directSet = new Set(directImporters);
-    // BFS to find transitive importers via reverse import graph
-    const reverseImportMap = new Map();
-    for (const edge of importEdges) {
-        if (!reverseImportMap.has(edge.targetPackage)) {
-            reverseImportMap.set(edge.targetPackage, new Set());
-        }
-        reverseImportMap.get(edge.targetPackage).add(edge.sourceFile);
-    }
-    const transitiveSet = new Set();
-    const queue = [...directImporters];
-    const visited = new Set(directImporters);
-    while (queue.length > 0) {
-        const current = queue.shift();
-        const upstream = reverseImportMap.get(current);
-        if (upstream) {
-            for (const file of upstream) {
-                if (!visited.has(file) && !directSet.has(file)) {
-                    visited.add(file);
-                    transitiveSet.add(file);
-                    queue.push(file);
-                }
-            }
-        }
-    }
-    return {
-        packageName,
-        directImporters,
-        transitiveImporters: Array.from(transitiveSet),
-        isUsed: directImporters.length > 0 || transitiveSet.size > 0,
-    };
-}
-export function traceClone(cloneGroups, file, line) {
-    // Find groups containing an instance at (file, line)
-    const matchingGroups = cloneGroups.filter((group) => group.instances.some((inst) => inst.filePath === file && inst.startLine <= line && inst.endLine >= line));
-    if (matchingGroups.length === 0) {
-        return {
-            sourceFile: file,
-            sourceLine: line,
-            matchingInstances: [],
-            groupId: undefined,
-        };
-    }
-    // Use the first matching group
-    const group = matchingGroups[0];
-    // Return all OTHER instances (not the source one)
-    const matchingInstances = group.instances.filter((inst) => !(inst.filePath === file && inst.startLine <= line && inst.endLine >= line));
-    return {
-        sourceFile: file,
-        sourceLine: line,
-        matchingInstances,
-        groupId: group.id,
-    };
-}
-//# sourceMappingURL=trace.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"trace.js","sourceRoot":"","sources":["../../../src/analysis/trace.ts"],"names":[],"mappings":"AAsEA,8GAA8G;AAC9G,MAAM,UAAU,cAAc,CAAC,KAAY;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAChD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,KAAY,EACZ,IAAY,EACZ,UAAkB,EAClB,SAAkC;IAElC,0EAA0E;IAC1E,MAAM,GAAG,GAAG,SAAS,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC;IAE/C,oDAAoD;IACpD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxE,CAAC;IAED,uEAAuE;IACvE,MAAM,gBAAgB,GAAwB,EAAE,CAAC;IACjD,MAAM,cAAc,GAAoB,EAAE,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS;QAE5C,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU;YAAE,SAAS;QAE1B,mCAAmC;QACnC,IAAI,UAAU,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAS;QAE3C,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC7D,gBAAgB,CAAC,IAAI,CAAC;gBACpB,QAAQ,EAAE,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,EAAE;gBAC9C,IAAI,EAAE,UAAU,CAAC,SAAS,IAAI,CAAC;gBAC/B,GAAG,EAAE,CAAC;aACP,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC1C,cAAc,CAAC,IAAI,CAAC;gBAClB,IAAI,EAAE,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,EAAE;gBAC1C,UAAU,EAAE,UAAU,CAAC,IAAI;aAC5B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,IAAI,MAAmB,CAAC;IACxB,IAAI,MAAe,CAAC;IAEpB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,GAAG,gBAAgB,CAAC;QAC1B,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;SAAM,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,GAAG,kBAAkB,CAAC;QAC5B,MAAM,GAAG,KAAK,CAAC;IACjB,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,eAAe,CAAC;QACzB,MAAM,GAAG,KAAK,CAAC;IACjB,CAAC;IAED,OAAO;QACL,IAAI;QACJ,UAAU;QACV,MAAM;QACN,gBAAgB;QAChB,cAAc;QACd,MAAM;KACP,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,KAAY,EACZ,IAAY,EACZ,SAAkC;IAElC,mCAAmC;IACnC,MAAM,GAAG,GAAG,SAAS,IAAI,cAAc,CAAC,KAAK,CAAC,CAAC;IAE/C,8BAA8B;IAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,8EAA8E;IAC9E,uDAAuD;IACvD,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,MAAM,SAAS,GAA8C,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEjD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC1C,IAAI,UAAU,EAAE,QAAQ,IAAI,UAAU,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;oBACzD,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YACD,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC1C,IAAI,UAAU,EAAE,QAAQ,IAAI,UAAU,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;oBACzD,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;YACD,yEAAyE;YACzE,IAAI,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5B,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;YACzD,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,IAAI,SAAS,EAAE,CAAC;YAChD,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,UAAU,IAAI,UAAU,EAAE,QAAQ,EAAE,CAAC;gBACvC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC;IAED,8FAA8F;IAC9F,MAAM,OAAO,GAAG,SAAS;SACtB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACX,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,MAAM,EAAE,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACtC,IAAI,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC;KACvB,CAAC,CAAC,CAAC;IAEN,OAAO;QACL,IAAI;QACJ,OAAO;QACP,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC;QACvC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;QACrC,SAAS;KACV,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,WAAiE,EACjE,WAAmB;IAEnB,wBAAwB;IACxB,MAAM,eAAe,GAAG,WAAW;SAChC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,WAAW,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAE5B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;IAE3C,4DAA4D;IAC5D,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAuB,CAAC;IACxD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YAC9C,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,MAAM,KAAK,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;IAEzC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAClB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,WAAW;QACX,eAAe;QACf,mBAAmB,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;QAC9C,MAAM,EAAE,eAAe,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC;KAC7D,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,UAAU,CACxB,WAA8D,EAC9D,IAAY,EACZ,IAAY;IAEZ,qDAAqD;IACrD,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAClD,KAAK,CAAC,SAAS,CAAC,IAAI,CAClB,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAC3E,CACF,CAAC;IAEF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO;YACL,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;YAChB,iBAAiB,EAAE,EAAE;YACrB,OAAO,EAAE,SAAS;SACnB,CAAC;IACJ,CAAC;IAED,+BAA+B;IAC/B,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAEhC,kDAAkD;IAClD,MAAM,iBAAiB,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAC9C,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CACtF,CAAC;IAEF,OAAO;QACL,UAAU,EAAE,IAAI;QAChB,UAAU,EAAE,IAAI;QAChB,iBAAiB;QACjB,OAAO,EAAE,KAAK,CAAC,EAAE;KAClB,CAAC;AACJ,CAAC"}

package/dist/src/analysis/worker-pool.d.ts

@@ -1,17 +0,0 @@
-export interface WorkerPoolOptions {
-    threads?: number;
-    stackSizeMb?: number;
-}
-export declare class WorkerPool {
-    readonly threads: number;
-    readonly stackSizeMb: number;
-    private _active;
-    private readonly _queue;
-    constructor(opts?: WorkerPoolOptions);
-    run<T>(workerScript: string, input: unknown): Promise<T>;
-    private _drain;
-}
-export declare function configureGlobalPool(threads?: number, stackSizeMb?: number): WorkerPool;
-export declare function getGlobalPool(): WorkerPool;
-export declare function resetGlobalPool(): void;
-//# sourceMappingURL=worker-pool.d.ts.map

package/dist/src/analysis/worker-pool.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"worker-pool.d.ts","sourceRoot":"","sources":["../../../src/analysis/worker-pool.ts"],"names":[],"mappings":"AAKA,MAAM,WAAW,iBAAiB;IAChC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAWD,qBAAa,UAAU;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAE7B,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAoB;IAE3C,YAAY,IAAI,GAAE,iBAAsB,EAGvC;IAED,GAAG,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAKvD;IAED,OAAO,CAAC,MAAM;CA6Bf;AAED,wBAAgB,mBAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,UAAU,CAGtF;AAED,wBAAgB,aAAa,IAAI,UAAU,CAE1C;AAED,wBAAgB,eAAe,IAAI,IAAI,CAEtC"}

package/dist/src/analysis/worker-pool.js

@@ -1,62 +0,0 @@
-import { Worker } from 'node:worker_threads';
-import { cpus } from 'node:os';
-const DEFAULT_STACK_SIZE_MB = 16;
-let _globalPool = null;
-export class WorkerPool {
-    threads;
-    stackSizeMb;
-    _active = 0;
-    _queue = [];
-    constructor(opts = {}) {
-        this.threads = opts.threads ?? cpus().length;
-        this.stackSizeMb = opts.stackSizeMb ?? DEFAULT_STACK_SIZE_MB;
-    }
-    run(workerScript, input) {
-        return new Promise((resolve, reject) => {
-            this._queue.push({ script: workerScript, input, resolve: resolve, reject });
-            this._drain();
-        });
-    }
-    _drain() {
-        while (this._active < this.threads && this._queue.length > 0) {
-            const task = this._queue.shift();
-            this._active++;
-            const worker = new Worker(task.script, {
-                workerData: task.input,
-                resourceLimits: { stackSizeMb: this.stackSizeMb },
-            });
-            let settled = false;
-            const settle = (fn) => {
-                if (settled)
-                    return;
-                settled = true;
-                fn();
-                this._active--;
-                this._drain();
-            };
-            worker.on('message', (v) => {
-                settle(() => task.resolve(v));
-            });
-            worker.on('error', (err) => {
-                settle(() => task.reject(err));
-            });
-            worker.on('exit', (code) => {
-                if (code !== 0) {
-                    settle(() => task.reject(new Error(`Worker exited with code ${code}`)));
-                }
-            });
-        }
-    }
-}
-export function configureGlobalPool(threads, stackSizeMb) {
-    if (!_globalPool)
-        _globalPool = new WorkerPool({ threads, stackSizeMb });
-    return _globalPool;
-}
-export function getGlobalPool() {
-    return _globalPool ?? configureGlobalPool();
-}
-export function resetGlobalPool() {
-    _globalPool = null;
-}
-//# sourceMappingURL=worker-pool.js.map

package/dist/src/analysis/worker-pool.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"worker-pool.js","sourceRoot":"","sources":["../../../src/analysis/worker-pool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE/B,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAcjC,IAAI,WAAW,GAAsB,IAAI,CAAC;AAE1C,MAAM,OAAO,UAAU;IACZ,OAAO,CAAS;IAChB,WAAW,CAAS;IAErB,OAAO,GAAG,CAAC,CAAC;IACH,MAAM,GAAiB,EAAE,CAAC;IAE3C,YAAY,IAAI,GAAsB,EAAE;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,CAAC,MAAM,CAAC;QAC7C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,qBAAqB,CAAC;IAC/D,CAAC;IAED,GAAG,CAAI,YAAoB,EAAE,KAAc;QACzC,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,OAA+B,EAAE,MAAM,EAAE,CAAC,CAAC;YACpG,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,MAAM;QACZ,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAG,CAAC;YAClC,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE;gBACrC,UAAU,EAAE,IAAI,CAAC,KAAK;gBACtB,cAAc,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE;aAClD,CAAC,CAAC;YACH,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,MAAM,MAAM,GAAG,CAAC,EAAc,EAAE,EAAE;gBAChC,IAAI,OAAO;oBAAE,OAAO;gBACpB,OAAO,GAAG,IAAI,CAAC;gBACf,EAAE,EAAE,CAAC;gBACL,IAAI,CAAC,OAAO,EAAE,CAAC;gBACf,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC,CAAC;YACF,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,CAAU,EAAE,EAAE;gBAClC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAY,EAAE,EAAE;gBAClC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAY,EAAE,EAAE;gBACjC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBACf,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1E,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF;AAED,MAAM,UAAU,mBAAmB,CAAC,OAAgB,EAAE,WAAoB;IACxE,IAAI,CAAC,WAAW;QAAE,WAAW,GAAG,IAAI,UAAU,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;IACzE,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,aAAa;IAC3B,OAAO,WAAW,IAAI,mBAAmB,EAAE,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,eAAe;IAC7B,WAAW,GAAG,IAAI,CAAC;AACrB,CAAC"}

package/dist/src/coverage/runtime.d.ts

@@ -1,36 +0,0 @@
-import type { MonographDb } from '../storage/db.js';
-export type RuntimeClassification = 'SafeToDelete' | 'ReviewRequired' | 'LowTraffic' | 'Active' | 'CoverageUnavailable';
-export interface FunctionCoverageEntry {
-    nodeId: string;
-    name: string;
-    filePath: string | null;
-    startLine: number | null;
-    covered: boolean;
-    callCount: number;
-    classification: RuntimeClassification;
-}
-export interface RuntimeCoverageReport {
-    entries: FunctionCoverageEntry[];
-    safeToDelete: number;
-    reviewRequired: number;
-    active: number;
-    coverageUnavailable: number;
-    blastRadius: string[];
-}
-export interface V8CoverageFunction {
-    functionName: string;
-    url: string;
-    ranges: Array<{
-        startOffset: number;
-        endOffset: number;
-        count: number;
-    }>;
-}
-export interface V8Coverage {
-    result: Array<{
-        url: string;
-        functions: V8CoverageFunction[];
-    }>;
-}
-export declare function analyzeRuntimeCoverage(db: MonographDb, coverage: V8Coverage, repoRoot?: string): RuntimeCoverageReport;
-//# sourceMappingURL=runtime.d.ts.map

package/dist/src/coverage/runtime.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"runtime.d.ts","sourceRoot":"","sources":["../../../src/coverage/runtime.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,MAAM,qBAAqB,GAC7B,cAAc,GACd,gBAAgB,GAChB,YAAY,GACZ,QAAQ,GACR,qBAAqB,CAAC;AAE1B,MAAM,WAAW,qBAAqB;IACpC,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,qBAAqB,CAAC;CACvC;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,qBAAqB,EAAE,CAAC;IACjC,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,mBAAmB,EAAE,MAAM,CAAC;IAC5B,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAGD,MAAM,WAAW,kBAAkB;IACjC,YAAY,EAAE,MAAM,CAAC;IACrB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,KAAK,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1E;AAED,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,KAAK,CAAC;QACZ,GAAG,EAAE,MAAM,CAAC;QACZ,SAAS,EAAE,kBAAkB,EAAE,CAAC;KACjC,CAAC,CAAC;CACJ;AAeD,wBAAgB,sBAAsB,CACpC,EAAE,EAAE,WAAW,EACf,QAAQ,EAAE,UAAU,EACpB,QAAQ,CAAC,EAAE,MAAM,GAChB,qBAAqB,CA6LvB"}