@monoes/monograph 1.5.4 → 1.5.6

package/dist/src/coverage/runtime.js

@@ -1,187 +0,0 @@
-export function analyzeRuntimeCoverage(db, coverage, repoRoot) {
-    // Build a map: filePath -> Map<functionName, CoverageMapEntry>
-    const fileCoverageMap = new Map();
-    for (const scriptCov of coverage.result) {
-        let filePath = scriptCov.url;
-        // Strip file:// prefix
-        if (filePath.startsWith('file://')) {
-            filePath = filePath.slice('file://'.length);
-        }
-        // Resolve relative to repoRoot if provided and path is relative
-        if (repoRoot && !filePath.startsWith('/')) {
-            filePath = repoRoot.replace(/\/$/, '') + '/' + filePath;
-        }
-        const fnMap = fileCoverageMap.get(filePath) ?? new Map();
-        for (const fn of scriptCov.functions) {
-            const covered = fn.ranges.some(r => r.count > 0);
-            const callCount = fn.ranges.reduce((max, r) => Math.max(max, r.count), 0);
-            const existing = fnMap.get(fn.functionName);
-            if (!existing || callCount > existing.callCount) {
-                fnMap.set(fn.functionName, { covered, callCount });
-            }
-        }
-        fileCoverageMap.set(filePath, fnMap);
-    }
-    // Helper: normalize a file path for lookup
-    function normalizeForLookup(fp) {
-        return fp.replace(/\\/g, '/');
-    }
-    // Build alternate lookup: basename -> filePath list
-    const filePathIndex = new Map();
-    for (const fp of fileCoverageMap.keys()) {
-        const norm = normalizeForLookup(fp);
-        filePathIndex.set(norm, (filePathIndex.get(norm) ?? []).concat(fp));
-        // Also store by just the filename for relative matching
-        const parts = norm.split('/');
-        const base = parts[parts.length - 1];
-        if (base && base !== norm) {
-            filePathIndex.set(base, (filePathIndex.get(base) ?? []).concat(fp));
-        }
-    }
-    // Compute total call count across all functions for LowTraffic threshold
-    let totalCallCount = 0;
-    for (const fnMap of fileCoverageMap.values()) {
-        for (const entry of fnMap.values()) {
-            totalCallCount += entry.callCount;
-        }
-    }
-    const lowTrafficThreshold = totalCallCount * 0.05;
-    // Query all Symbol nodes that are Functions/Methods
-    const rows = db.prepare(`
-    SELECT id, name, file_path, start_line, properties
-    FROM nodes
-    WHERE label IN ('Function', 'Method')
-  `).all();
-    const entries = [];
-    for (const row of rows) {
-        const props = row.properties ? JSON.parse(row.properties) : {};
-        const reachabilityRole = props.reachabilityRole ?? '';
-        let fnEntry = null;
-        if (row.file_path) {
-            const normFilePath = normalizeForLookup(row.file_path);
-            // Try exact match first
-            const exactFnMap = fileCoverageMap.get(normFilePath) ?? fileCoverageMap.get(row.file_path);
-            if (exactFnMap) {
-                const match = exactFnMap.get(row.name);
-                if (match)
-                    fnEntry = match;
-                // If no exact function name match, aggregate all functions for this file
-                if (!fnEntry) {
-                    // Best-effort: file is covered if any function is covered
-                    let fileCovered = false;
-                    let fileMaxCount = 0;
-                    for (const e of exactFnMap.values()) {
-                        if (e.covered)
-                            fileCovered = true;
-                        fileMaxCount = Math.max(fileMaxCount, e.callCount);
-                    }
-                    if (exactFnMap.size > 0) {
-                        fnEntry = { covered: fileCovered, callCount: fileMaxCount };
-                    }
-                }
-            }
-            else {
-                // Try relative path matching
-                for (const [covPath, fnMap] of fileCoverageMap.entries()) {
-                    if (covPath.endsWith(normFilePath) || normFilePath.endsWith(covPath.replace(/.*\//, ''))) {
-                        const match = fnMap.get(row.name);
-                        if (match) {
-                            fnEntry = match;
-                            break;
-                        }
-                        // Aggregate file-level coverage
-                        let fileCovered = false;
-                        let fileMaxCount = 0;
-                        for (const e of fnMap.values()) {
-                            if (e.covered)
-                                fileCovered = true;
-                            fileMaxCount = Math.max(fileMaxCount, e.callCount);
-                        }
-                        if (fnMap.size > 0) {
-                            fnEntry = { covered: fileCovered, callCount: fileMaxCount };
-                            break;
-                        }
-                    }
-                }
-            }
-        }
-        let classification;
-        let covered = false;
-        let callCount = 0;
-        if (!fnEntry) {
-            classification = 'CoverageUnavailable';
-        }
-        else {
-            covered = fnEntry.covered;
-            callCount = fnEntry.callCount;
-            if (!covered && reachabilityRole === 'unreachable') {
-                classification = 'SafeToDelete';
-            }
-            else if (covered && reachabilityRole === 'unreachable') {
-                classification = 'ReviewRequired';
-            }
-            else if (covered && callCount < lowTrafficThreshold) {
-                classification = 'LowTraffic';
-            }
-            else if (covered) {
-                classification = 'Active';
-            }
-            else {
-                // not covered, not unreachable — treat as unavailable
-                classification = 'CoverageUnavailable';
-            }
-        }
-        entries.push({
-            nodeId: row.id,
-            name: row.name,
-            filePath: row.file_path,
-            startLine: row.start_line,
-            covered,
-            callCount,
-            classification,
-        });
-    }
-    // Aggregate counts
-    let safeToDelete = 0;
-    let reviewRequired = 0;
-    let active = 0;
-    let coverageUnavailable = 0;
-    const blastRadiusSet = new Set();
-    for (const entry of entries) {
-        switch (entry.classification) {
-            case 'SafeToDelete':
-                safeToDelete++;
-                break;
-            case 'ReviewRequired':
-                reviewRequired++;
-                break;
-            case 'Active':
-                active++;
-                break;
-            case 'CoverageUnavailable':
-                coverageUnavailable++;
-                break;
-        }
-        // BlastRadius: Active nodes with reachabilityRole === 'runtime'
-        if (entry.classification === 'Active' && entry.filePath) {
-            const nodeProps = entries.find(e => e.nodeId === entry.nodeId);
-            // Re-query to get reachabilityRole for blast radius check
-            const nodeRow = db.prepare(`SELECT properties FROM nodes WHERE id = ?`).get(entry.nodeId);
-            if (nodeRow) {
-                const p = nodeRow.properties ? JSON.parse(nodeRow.properties) : {};
-                if (p.reachabilityRole === 'runtime') {
-                    blastRadiusSet.add(entry.filePath);
-                }
-            }
-        }
-    }
-    return {
-        entries,
-        safeToDelete,
-        reviewRequired,
-        active,
-        coverageUnavailable,
-        blastRadius: Array.from(blastRadiusSet),
-    };
-}
-//# sourceMappingURL=runtime.js.map

package/dist/src/coverage/runtime.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"runtime.js","sourceRoot":"","sources":["../../../src/coverage/runtime.ts"],"names":[],"mappings":"AAuDA,MAAM,UAAU,sBAAsB,CACpC,EAAe,EACf,QAAoB,EACpB,QAAiB;IAEjB,+DAA+D;IAC/D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyC,CAAC;IAEzE,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QACxC,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC;QAE7B,uBAAuB;QACvB,IAAI,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC9C,CAAC;QAED,gEAAgE;QAChE,IAAI,QAAQ,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1C,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC;QAC1D,CAAC;QAED,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAA4B,CAAC;QAEnF,KAAK,MAAM,EAAE,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1E,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,CAAC,QAAQ,IAAI,SAAS,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;gBAChD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,2CAA2C;IAC3C,SAAS,kBAAkB,CAAC,EAAU;QACpC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,oDAAoD;IACpD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;IAClD,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACpC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACpE,wDAAwD;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAC1B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,cAAc,IAAI,KAAK,CAAC,SAAS,CAAC;QACpC,CAAC;IACH,CAAC;IACD,MAAM,mBAAmB,GAAG,cAAc,GAAG,IAAI,CAAC;IAElD,oDAAoD;IACpD,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;GAIvB,CAAC,CAAC,GAAG,EAAqB,CAAC;IAE5B,MAAM,OAAO,GAA4B,EAAE,CAAC;IAE5C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,MAAM,gBAAgB,GAAW,KAAK,CAAC,gBAAgB,IAAI,EAAE,CAAC;QAE9D,IAAI,OAAO,GAA4B,IAAI,CAAC;QAE5C,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;YAClB,MAAM,YAAY,GAAG,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEvD,wBAAwB;YACxB,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3F,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACvC,IAAI,KAAK;oBAAE,OAAO,GAAG,KAAK,CAAC;gBAC3B,yEAAyE;gBACzE,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,0DAA0D;oBAC1D,IAAI,WAAW,GAAG,KAAK,CAAC;oBACxB,IAAI,YAAY,GAAG,CAAC,CAAC;oBACrB,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;wBACpC,IAAI,CAAC,CAAC,OAAO;4BAAE,WAAW,GAAG,IAAI,CAAC;wBAClC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;oBACrD,CAAC;oBACD,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;wBACxB,OAAO,GAAG,EAAE,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,6BAA6B;gBAC7B,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;oBACzD,IAAI,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;wBACzF,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAClC,IAAI,KAAK,EAAE,CAAC;4BAAC,OAAO,GAAG,KAAK,CAAC;4BAAC,MAAM;wBAAC,CAAC;wBACtC,gCAAgC;wBAChC,IAAI,WAAW,GAAG,KAAK,CAAC;wBACxB,IAAI,YAAY,GAAG,CAAC,CAAC;wBACrB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;4BAC/B,IAAI,CAAC,CAAC,OAAO;gCAAE,WAAW,GAAG,IAAI,CAAC;4BAClC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;wBACrD,CAAC;wBACD,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;4BACnB,OAAO,GAAG,EAAE,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,EAAE,CAAC;4BAC5D,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,cAAqC,CAAC;QAC1C,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,cAAc,GAAG,qBAAqB,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;YAC1B,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YAE9B,IAAI,CAAC,OAAO,IAAI,gBAAgB,KAAK,aAAa,EAAE,CAAC;gBACnD,cAAc,GAAG,cAAc,CAAC;YAClC,CAAC;iBAAM,IAAI,OAAO,IAAI,gBAAgB,KAAK,aAAa,EAAE,CAAC;gBACzD,cAAc,GAAG,gBAAgB,CAAC;YACpC,CAAC;iBAAM,IAAI,OAAO,IAAI,SAAS,GAAG,mBAAmB,EAAE,CAAC;gBACtD,cAAc,GAAG,YAAY,CAAC;YAChC,CAAC;iBAAM,IAAI,OAAO,EAAE,CAAC;gBACnB,cAAc,GAAG,QAAQ,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,sDAAsD;gBACtD,cAAc,GAAG,qBAAqB,CAAC;YACzC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC;YACX,MAAM,EAAE,GAAG,CAAC,EAAE;YACd,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,OAAO;YACP,SAAS;YACT,cAAc;SACf,CAAC,CAAC;IACL,CAAC;IAED,mBAAmB;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAE5B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IAEzC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,QAAQ,KAAK,CAAC,cAAc,EAAE,CAAC;YAC7B,KAAK,cAAc;gBAAE,YAAY,EAAE,CAAC;gBAAC,MAAM;YAC3C,KAAK,gBAAgB;gBAAE,cAAc,EAAE,CAAC;gBAAC,MAAM;YAC/C,KAAK,QAAQ;gBAAE,MAAM,EAAE,CAAC;gBAAC,MAAM;YAC/B,KAAK,qBAAqB;gBAAE,mBAAmB,EAAE,CAAC;gBAAC,MAAM;QAC3D,CAAC;QAED,gEAAgE;QAChE,IAAI,KAAK,CAAC,cAAc,KAAK,QAAQ,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACxD,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC;YAC/D,0DAA0D;YAC1D,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAA8C,CAAC;YACvI,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnE,IAAI,CAAC,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;oBACrC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO;QACP,YAAY;QACZ,cAAc;QACd,MAAM;QACN,mBAAmB;QACnB,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC;KACxC,CAAC;AACJ,CAAC"}

package/dist/src/graph/clone-detector.d.ts

@@ -1,15 +0,0 @@
-import type { MonographDb } from '../storage/db.js';
-export interface ClonePair {
-    fileA: string;
-    fileB: string;
-    similarity: number;
-    cloneType: 'exact' | 'renamed' | 'structural';
-    tokenCount: number;
-}
-export interface CloneDetectionResult {
-    pairs: ClonePair[];
-    totalFiles: number;
-    cloneRatio: number;
-}
-export declare function detectClones(db: MonographDb, minSimilarity?: number, minTokens?: number): CloneDetectionResult;
-//# sourceMappingURL=clone-detector.d.ts.map

package/dist/src/graph/clone-detector.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"clone-detector.d.ts","sourceRoot":"","sources":["../../../src/graph/clone-detector.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAIpD,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,OAAO,GAAG,SAAS,GAAG,YAAY,CAAC;IAC9C,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAwCD,wBAAgB,YAAY,CAC1B,EAAE,EAAE,WAAW,EACf,aAAa,SAAM,EACnB,SAAS,SAAI,GACZ,oBAAoB,CAsGtB"}

package/dist/src/graph/clone-detector.js

@@ -1,132 +0,0 @@
-import { insertEdge } from '../storage/edge-store.js';
-import { makeId } from '../types.js';
-/** Tokenize a file path into lowercase alphanumeric tokens. */
-function tokenizePath(filePath) {
-    return filePath
-        .toLowerCase()
-        .split(/[^a-z0-9]+/)
-        .filter(t => t.length > 0);
-}
-/** Extract the base filename (without directory) from a path. */
-function baseName(filePath) {
-    return filePath.replace(/^.*[\\/]/, '');
-}
-/**
- * Compute both Jaccard similarity and shared token count in a single pass.
- * Avoids building the countA Map twice (previously done separately in
- * jaccardSimilarity and sharedTokenCount).
- */
-function computeSimilarityAndShared(a, b) {
-    const countA = new Map();
-    for (const t of a)
-        countA.set(t, (countA.get(t) ?? 0) + 1);
-    let intersection = 0;
-    const seen = new Map();
-    for (const t of b) {
-        const limit = countA.get(t) ?? 0;
-        const used = seen.get(t) ?? 0;
-        if (used < limit) {
-            intersection++;
-            seen.set(t, used + 1);
-        }
-    }
-    const union = a.length + b.length - intersection;
-    const similarity = union === 0 ? 1 : intersection / union;
-    return { similarity, shared: intersection };
-}
-export function detectClones(db, minSimilarity = 0.8, minTokens = 2) {
-    // Query all File nodes with file_path
-    const rows = db
-        .prepare(`SELECT id, file_path FROM nodes WHERE label = 'File' AND file_path IS NOT NULL`)
-        .all();
-    const totalFiles = rows.length;
-    const pairs = [];
-    const involvedFiles = new Set();
-    // Pre-compute path tokens and name tokens for each file
-    const tokenMap = new Map();
-    for (const row of rows) {
-        const pathTokens = tokenizePath(row.file_path);
-        const nameTokens = tokenizePath(baseName(row.file_path));
-        tokenMap.set(row.file_path, { pathTokens, nameTokens });
-    }
-    // Compare all pairs
-    for (let i = 0; i < rows.length; i++) {
-        for (let j = i + 1; j < rows.length; j++) {
-            const pathA = rows[i].file_path;
-            const pathB = rows[j].file_path;
-            const entryA = tokenMap.get(pathA);
-            const entryB = tokenMap.get(pathB);
-            const { similarity: sim, shared } = computeSimilarityAndShared(entryA.pathTokens, entryB.pathTokens);
-            if (sim < minSimilarity || shared < minTokens) {
-                // Also check near-duplicate file names (same name, different dir)
-                const { similarity: nameSim, shared: nameShared } = computeSimilarityAndShared(entryA.nameTokens, entryB.nameTokens);
-                if (nameSim >= minSimilarity && nameShared >= Math.min(minTokens, entryA.nameTokens.length)) {
-                    // Same-name files in different directories → structural similarity
-                    const pair = {
-                        fileA: pathA,
-                        fileB: pathB,
-                        similarity: nameSim,
-                        cloneType: 'structural',
-                        tokenCount: nameShared,
-                    };
-                    pairs.push(pair);
-                    involvedFiles.add(pathA);
-                    involvedFiles.add(pathB);
-                    // Emit edge
-                    const edgeId = makeId('structurally_similar', rows[i].id, rows[j].id);
-                    try {
-                        insertEdge(db, {
-                            id: edgeId,
-                            sourceId: rows[i].id,
-                            targetId: rows[j].id,
-                            relation: 'STRUCTURALLY_SIMILAR',
-                            confidence: 'INFERRED',
-                            confidenceScore: nameSim,
-                            weight: nameSim,
-                        });
-                    }
-                    catch { /* ignore duplicate edge errors */ }
-                }
-                continue;
-            }
-            // Determine clone type
-            let cloneType;
-            if (sim >= 0.99) {
-                cloneType = 'exact';
-            }
-            else if (baseName(pathA) === baseName(pathB)) {
-                cloneType = 'renamed';
-            }
-            else {
-                cloneType = 'structural';
-            }
-            const pair = {
-                fileA: pathA,
-                fileB: pathB,
-                similarity: sim,
-                cloneType,
-                tokenCount: shared,
-            };
-            pairs.push(pair);
-            involvedFiles.add(pathA);
-            involvedFiles.add(pathB);
-            // Emit STRUCTURALLY_SIMILAR edge into the edges table
-            const edgeId = makeId('structurally_similar', rows[i].id, rows[j].id);
-            try {
-                insertEdge(db, {
-                    id: edgeId,
-                    sourceId: rows[i].id,
-                    targetId: rows[j].id,
-                    relation: 'STRUCTURALLY_SIMILAR',
-                    confidence: 'INFERRED',
-                    confidenceScore: sim,
-                    weight: sim,
-                });
-            }
-            catch { /* ignore duplicate edge errors */ }
-        }
-    }
-    const cloneRatio = totalFiles === 0 ? 0 : involvedFiles.size / totalFiles;
-    return { pairs, totalFiles, cloneRatio };
-}
-//# sourceMappingURL=clone-detector.js.map

package/dist/src/graph/clone-detector.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"clone-detector.js","sourceRoot":"","sources":["../../../src/graph/clone-detector.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAgBrC,+DAA+D;AAC/D,SAAS,YAAY,CAAC,QAAgB;IACpC,OAAO,QAAQ;SACZ,WAAW,EAAE;SACb,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,iEAAiE;AACjE,SAAS,QAAQ,CAAC,QAAgB;IAChC,OAAO,QAAQ,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,SAAS,0BAA0B,CAAC,CAAW,EAAE,CAAW;IAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE3D,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;YACjB,YAAY,EAAE,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC;IACjD,MAAM,UAAU,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;IAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,EAAe,EACf,aAAa,GAAG,GAAG,EACnB,SAAS,GAAG,CAAC;IAEb,sCAAsC;IACtC,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,gFAAgF,CAAC;SACzF,GAAG,EAAyC,CAAC;IAEhD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;IAC/B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IAExC,wDAAwD;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0D,CAAC;IACnF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACzD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,oBAAoB;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAChC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;YACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;YAEpC,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,0BAA0B,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAErG,IAAI,GAAG,GAAG,aAAa,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBAC9C,kEAAkE;gBAClE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,0BAA0B,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;gBAErH,IAAI,OAAO,IAAI,aAAa,IAAI,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC5F,mEAAmE;oBACnE,MAAM,IAAI,GAAc;wBACtB,KAAK,EAAE,KAAK;wBACZ,KAAK,EAAE,KAAK;wBACZ,UAAU,EAAE,OAAO;wBACnB,SAAS,EAAE,YAAY;wBACvB,UAAU,EAAE,UAAU;qBACvB,CAAC;oBACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBACzB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAEzB,YAAY;oBACZ,MAAM,MAAM,GAAG,MAAM,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACtE,IAAI,CAAC;wBACH,UAAU,CAAC,EAAE,EAAE;4BACb,EAAE,EAAE,MAAM;4BACV,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;4BACpB,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;4BACpB,QAAQ,EAAE,sBAAsB;4BAChC,UAAU,EAAE,UAAU;4BACtB,eAAe,EAAE,OAAO;4BACxB,MAAM,EAAE,OAAO;yBAChB,CAAC,CAAC;oBACL,CAAC;oBAAC,MAAM,CAAC,CAAC,kCAAkC,CAAC,CAAC;gBAChD,CAAC;gBACD,SAAS;YACX,CAAC;YAED,uBAAuB;YACvB,IAAI,SAAiC,CAAC;YACtC,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;gBAChB,SAAS,GAAG,OAAO,CAAC;YACtB,CAAC;iBAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/C,SAAS,GAAG,SAAS,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,YAAY,CAAC;YAC3B,CAAC;YAED,MAAM,IAAI,GAAc;gBACtB,KAAK,EAAE,KAAK;gBACZ,KAAK,EAAE,KAAK;gBACZ,UAAU,EAAE,GAAG;gBACf,SAAS;gBACT,UAAU,EAAE,MAAM;aACnB,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACzB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAEzB,sDAAsD;YACtD,MAAM,MAAM,GAAG,MAAM,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtE,IAAI,CAAC;gBACH,UAAU,CAAC,EAAE,EAAE;oBACb,EAAE,EAAE,MAAM;oBACV,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBACpB,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBACpB,QAAQ,EAAE,sBAAsB;oBAChC,UAAU,EAAE,UAAU;oBACtB,eAAe,EAAE,GAAG;oBACpB,MAAM,EAAE,GAAG;iBACZ,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC,CAAC,kCAAkC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,GAAG,UAAU,CAAC;IAE1E,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AAC3C,CAAC"}

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

@@ -1,6 +0,0 @@
-export interface ShingleFilter {
-    add(id: string, tokens: string[]): void;
-    candidates(tokens: string[], topK?: number): string[];
-}
-export declare function createShingleFilter(k?: number, numHashes?: number): ShingleFilter;
-//# sourceMappingURL=shingle-filter.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"shingle-filter.d.ts","sourceRoot":"","sources":["../../../src/graph/shingle-filter.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,aAAa;IAC5B,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACxC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;CACvD;AAwDD,wBAAgB,mBAAmB,CAAC,CAAC,SAAI,EAAE,SAAS,SAAM,GAAG,aAAa,CAyFzE"}

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

@@ -1,129 +0,0 @@
-/**
- * Generate k-shingles (k-grams) from a token array.
- * Each shingle is the concatenation of k consecutive tokens joined by a space.
- */
-function kShingles(tokens, k) {
-    if (tokens.length < k)
-        return [tokens.join(' ')];
-    const shingles = [];
-    for (let i = 0; i <= tokens.length - k; i++) {
-        shingles.push(tokens.slice(i, i + k).join(' '));
-    }
-    return shingles;
-}
-/**
- * Simple string hash that produces a non-negative 32-bit integer.
- * Uses a djb2-style hash.
- */
-function hashString(s) {
-    let h = 5381;
-    for (let i = 0; i < s.length; i++) {
-        h = ((h << 5) + h) ^ s.charCodeAt(i);
-        h = h >>> 0; // keep unsigned 32-bit
-    }
-    return h;
-}
-const MINHASH_PRIME = BigInt(4294967311); // first prime > 2^32
-/**
- * Compute a MinHash signature for a set of shingles using
- * numHashes linear hash functions: h_i(x) = (a_i * x + b_i) % prime.
- *
- * @param seedsA  Precomputed BigInt a-coefficients (length numHashes)
- * @param seedsB  Precomputed BigInt b-constants   (length numHashes)
- */
-function minHashSignature(shingles, numHashes, seedsA, seedsB) {
-    const sig = new Uint32Array(numHashes).fill(0xffffffff);
-    for (const shingle of shingles) {
-        const x = BigInt(hashString(shingle));
-        for (let i = 0; i < numHashes; i++) {
-            // Precomputed seeds avoid recomputing the same (a, b) per shingle per call.
-            const hashVal = Number((seedsA[i] * x + seedsB[i]) % MINHASH_PRIME) >>> 0;
-            if (hashVal < sig[i])
-                sig[i] = hashVal;
-        }
-    }
-    return sig;
-}
-export function createShingleFilter(k = 5, numHashes = 128) {
-    // Each entry: { sig: Uint32Array }
-    const index = new Map();
-    // LSH: split numHashes into bands of rows
-    // Standard LSH: numBands * numRows = numHashes, threshold ≈ (1/numBands)^(1/numRows)
-    // We target threshold ~0.5: solve (1/b)^(1/r) = 0.5 with b*r = numHashes
-    // A reasonable split is sqrt(numHashes) bands of sqrt(numHashes) rows each.
-    const numBands = Math.round(Math.sqrt(numHashes));
-    const numRows = Math.floor(numHashes / numBands);
-    // Precompute MinHash seeds once per filter instance to avoid recomputing
-    // (a, b) inside the hot inner loop of minHashSignature().
-    const seedsA = new BigInt64Array(numHashes);
-    const seedsB = new BigInt64Array(numHashes);
-    for (let i = 0; i < numHashes; i++) {
-        seedsA[i] = BigInt(((i * 2654435761 + 0x9e3779b9) >>> 0));
-        seedsB[i] = BigInt(((i * 2246822519 + 0x85ebca6b) >>> 0));
-    }
-    function getBandKey(band, sig) {
-        const parts = [];
-        for (let r = 0; r < numRows; r++) {
-            const idx = band * numRows + r;
-            if (idx < numHashes)
-                parts.push(sig[idx]);
-        }
-        return `b${band}:${parts.join(',')}`;
-    }
-    // Band bucket → list of candidate IDs
-    const bandBuckets = new Map();
-    return {
-        add(id, tokens) {
-            const shingles = kShingles(tokens, k);
-            const sig = minHashSignature(shingles, numHashes, seedsA, seedsB);
-            index.set(id, sig);
-            // Insert into LSH band buckets
-            for (let band = 0; band < numBands; band++) {
-                const key = getBandKey(band, sig);
-                const bucket = bandBuckets.get(key);
-                if (bucket) {
-                    bucket.push(id);
-                }
-                else {
-                    bandBuckets.set(key, [id]);
-                }
-            }
-        },
-        candidates(tokens, topK = 10) {
-            const shingles = kShingles(tokens, k);
-            const querySig = minHashSignature(shingles, numHashes, seedsA, seedsB);
-            // Collect candidate IDs via LSH band matching.
-            // Use getBandKey() consistently — eliminates the duplicate inline computation.
-            const candidateScores = new Map();
-            for (let band = 0; band < numBands; band++) {
-                const queryKey = getBandKey(band, querySig);
-                const bucket = bandBuckets.get(queryKey);
-                if (bucket) {
-                    for (const id of bucket) {
-                        candidateScores.set(id, (candidateScores.get(id) ?? 0) + 1);
-                    }
-                }
-            }
-            if (candidateScores.size === 0)
-                return [];
-            // Compute Jaccard estimate from signature agreement for ranked results
-            const ranked = [...candidateScores.keys()].map(id => {
-                const sig = index.get(id);
-                let matches = 0;
-                for (let i = 0; i < numHashes; i++) {
-                    if (sig[i] === querySig[i])
-                        matches++;
-                }
-                const jaccardEst = matches / numHashes;
-                return { id, jaccardEst };
-            });
-            // Filter by estimated Jaccard > 0.5 and return topK
-            return ranked
-                .filter(r => r.jaccardEst > 0.5)
-                .sort((a, b) => b.jaccardEst - a.jaccardEst)
-                .slice(0, topK)
-                .map(r => r.id);
-        },
-    };
-}
-//# sourceMappingURL=shingle-filter.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"shingle-filter.js","sourceRoot":"","sources":["../../../src/graph/shingle-filter.ts"],"names":[],"mappings":"AAKA;;;GAGG;AACH,SAAS,SAAS,CAAC,MAAgB,EAAE,CAAS;IAC5C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAS;IAC3B,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,uBAAuB;IACtC,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,qBAAqB;AAE/D;;;;;;GAMG;AACH,SAAS,gBAAgB,CACvB,QAAkB,EAClB,SAAiB,EACjB,MAAqB,EACrB,MAAqB;IAErB,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAExD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,4EAA4E;YAC5E,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YAC5E,IAAI,OAAO,GAAG,GAAG,CAAC,CAAC,CAAE;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,CAAC,GAAG,CAAC,EAAE,SAAS,GAAG,GAAG;IACxD,mCAAmC;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE7C,0CAA0C;IAC1C,qFAAqF;IACrF,yEAAyE;IACzE,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC;IAEjD,yEAAyE;IACzE,0DAA0D;IAC1D,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,SAAS,UAAU,CAAC,IAAY,EAAE,GAAgB;QAChD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC;YAC/B,IAAI,GAAG,GAAG,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;QAC7C,CAAC;QACD,OAAO,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACvC,CAAC;IAED,sCAAsC;IACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEhD,OAAO;QACL,GAAG,CAAC,EAAU,EAAE,MAAgB;YAC9B,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,gBAAgB,CAAC,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAClE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAEnB,+BAA+B;YAC/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC3C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAClC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,MAAM,EAAE,CAAC;oBACX,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClB,CAAC;qBAAM,CAAC;oBACN,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QAED,UAAU,CAAC,MAAgB,EAAE,IAAI,GAAG,EAAE;YACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAEvE,+CAA+C;YAC/C,+EAA+E;YAC/E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;YAElD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC5C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACzC,IAAI,MAAM,EAAE,CAAC;oBACX,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;wBACxB,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YAE1C,uEAAuE;YACvE,MAAM,MAAM,GAAG,CAAC,GAAG,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAClD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAC3B,IAAI,OAAO,GAAG,CAAC,CAAC;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC;wBAAE,OAAO,EAAE,CAAC;gBACxC,CAAC;gBACD,MAAM,UAAU,GAAG,OAAO,GAAG,SAAS,CAAC;gBACvC,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;YAC5B,CAAC,CAAC,CAAC;YAEH,oDAAoD;YACpD,OAAO,MAAM;iBACV,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;iBAC/B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;iBAC3C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;iBACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/src/watch/watch-runner.d.ts

@@ -1,16 +0,0 @@
-export declare function isRelevantSource(filePath: string): boolean;
-export declare function isRelevantConfig(filePath: string): boolean;
-export declare function collectChangedPaths(rawPaths: string[], root: string): string[];
-export interface WatchRunnerOptions {
-    root: string;
-    noCache?: boolean;
-    quiet?: boolean;
-    clearScreen?: boolean;
-    debounceMs?: number;
-    includeEntryExports?: boolean;
-    onAnalysis: (changedPaths: string[]) => Promise<void>;
-    loadConfig: () => Promise<unknown>;
-}
-export declare function reloadConfigOrKeepPrevious<T>(current: T, loader: () => Promise<T>, onError?: (err: unknown) => void): Promise<T>;
-export declare function debounce<T extends (...args: unknown[]) => void>(fn: T, ms: number): T;
-//# sourceMappingURL=watch-runner.d.ts.map

package/dist/src/watch/watch-runner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"watch-runner.d.ts","sourceRoot":"","sources":["../../../src/watch/watch-runner.ts"],"names":[],"mappings":"AAaA,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAG1D;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAE1D;AAED,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAS9E;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,UAAU,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IACtD,UAAU,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC;CACpC;AAED,wBAAsB,0BAA0B,CAAC,CAAC,EAChD,OAAO,EAAE,CAAC,EACV,MAAM,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACxB,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,KAAK,IAAI,GAC/B,OAAO,CAAC,CAAC,CAAC,CAOZ;AAED,wBAAgB,QAAQ,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,GAAG,CAAC,CAMrF"}

package/dist/src/watch/watch-runner.js

@@ -1,49 +0,0 @@
-import { extname, basename, relative } from 'node:path';
-const SOURCE_EXTENSIONS = new Set([
-    'ts', 'tsx', 'mts', 'cts', 'js', 'jsx', 'mjs', 'cjs',
-    'vue', 'svelte', 'astro', 'mdx', 'css', 'scss',
-]);
-const CONFIG_FILENAMES = new Set([
-    'package.json', '.fallowrc.json', '.fallowrc.jsonc',
-    'fallow.toml', '.fallow.toml', 'tsconfig.json',
-    'monograph.json', 'monograph.config.json', '.monographrc.json',
-]);
-export function isRelevantSource(filePath) {
-    const ext = extname(filePath).replace('.', '');
-    return SOURCE_EXTENSIONS.has(ext);
-}
-export function isRelevantConfig(filePath) {
-    return CONFIG_FILENAMES.has(basename(filePath));
-}
-export function collectChangedPaths(rawPaths, root) {
-    const seen = new Set();
-    const result = [];
-    for (const p of rawPaths) {
-        if (!isRelevantSource(p) && !isRelevantConfig(p))
-            continue;
-        const rel = relative(root, p);
-        if (!seen.has(rel)) {
-            seen.add(rel);
-            result.push(rel);
-        }
-    }
-    return result;
-}
-export async function reloadConfigOrKeepPrevious(current, loader, onError) {
-    try {
-        return await loader();
-    }
-    catch (err) {
-        onError?.(err);
-        return current;
-    }
-}
-export function debounce(fn, ms) {
-    let timer = null;
-    return ((...args) => {
-        if (timer !== null)
-            clearTimeout(timer);
-        timer = setTimeout(() => { timer = null; fn(...args); }, ms);
-    });
-}
-//# sourceMappingURL=watch-runner.js.map

package/dist/src/watch/watch-runner.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"watch-runner.js","sourceRoot":"","sources":["../../../src/watch/watch-runner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAExD,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC;IAChC,IAAI,EAAC,KAAK,EAAC,KAAK,EAAC,KAAK,EAAC,IAAI,EAAC,KAAK,EAAC,KAAK,EAAC,KAAK;IAC7C,KAAK,EAAC,QAAQ,EAAC,OAAO,EAAC,KAAK,EAAC,KAAK,EAAC,MAAM;CAC1C,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,cAAc,EAAE,gBAAgB,EAAE,iBAAiB;IACnD,aAAa,EAAE,cAAc,EAAE,eAAe;IAC9C,gBAAgB,EAAE,uBAAuB,EAAE,mBAAmB;CAC/D,CAAC,CAAC;AAEH,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC/C,OAAO,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,OAAO,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,QAAkB,EAAE,IAAY;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3D,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC;IAC1D,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAaD,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,OAAU,EACV,MAAwB,EACxB,OAAgC;IAEhC,IAAI,CAAC;QACH,OAAO,MAAM,MAAM,EAAE,CAAC;IACxB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;QACf,OAAO,OAAO,CAAC;IACjB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,QAAQ,CAAyC,EAAK,EAAE,EAAU;IAChF,IAAI,KAAK,GAAyC,IAAI,CAAC;IACvD,OAAO,CAAC,CAAC,GAAG,IAAe,EAAE,EAAE;QAC7B,IAAI,KAAK,KAAK,IAAI;YAAE,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/D,CAAC,CAAM,CAAC;AACV,CAAC"}

package/src/__tests__/pipeline/incremental.test.ts

@@ -1,41 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import Database from 'better-sqlite3';
-import { runIncrementalAst } from '../../pipeline/runner.js';
-
-function makeDb(): Database.Database {
-  const db = new Database(':memory:');
-  db.exec(`
-    CREATE TABLE nodes (id TEXT PRIMARY KEY, label TEXT NOT NULL, name TEXT NOT NULL,
-      norm_label TEXT, file_path TEXT, start_line INTEGER, end_line INTEGER,
-      community_id INTEGER, is_exported INTEGER DEFAULT 0, language TEXT, properties TEXT);
-    CREATE TABLE edges (id TEXT PRIMARY KEY, source_id TEXT NOT NULL, target_id TEXT NOT NULL,
-      relation TEXT NOT NULL, confidence TEXT DEFAULT 'EXTRACTED', confidence_score REAL DEFAULT 1.0,
-      properties TEXT);
-  `);
-  db.prepare(`INSERT INTO nodes VALUES ('existing','Function','old',null,'/x.ts',1,3,null,1,null,null)`).run();
-  db.prepare(`INSERT INTO edges VALUES ('inf1','existing','existing','CALLS','INFERRED',0.5,null)`).run();
-  return db;
-}
-
-describe('runIncrementalAst', () => {
-  it('is exported from runner', () => {
-    expect(typeof runIncrementalAst).toBe('function');
-  });
-
-  it('preserves INFERRED edges when running code-only update', async () => {
-    const db = makeDb();
-    const beforeEdges = db.prepare(`SELECT id FROM edges WHERE confidence = 'INFERRED'`).all();
-    expect(beforeEdges).toHaveLength(1);
-    await runIncrementalAst(db as any, [], { preserveInferred: true });
-    const afterEdges = db.prepare(`SELECT id FROM edges WHERE confidence = 'INFERRED'`).all();
-    expect(afterEdges).toHaveLength(1);
-  });
-
-  it('removes EXTRACTED edges when running code-only update', async () => {
-    const db = makeDb();
-    db.prepare(`INSERT INTO edges VALUES ('ext1','existing','existing','CALLS','EXTRACTED',0.9,null)`).run();
-    await runIncrementalAst(db as any, [], { preserveInferred: true });
-    const afterExtracted = db.prepare(`SELECT id FROM edges WHERE confidence = 'EXTRACTED'`).all();
-    expect(afterExtracted).toHaveLength(0);
-  });
-});