@monoes/monograph 1.1.0 → 1.2.0

package/dist/src/graph/codeowners.js

@@ -0,0 +1,153 @@
+import { existsSync, readFileSync } from 'fs';
+import { join, relative } from 'path';
+// Convert a CODEOWNERS glob pattern to a RegExp
+function globToRegex(pattern) {
+    // Strip leading slash (anchors to root — handle separately)
+    const anchored = pattern.startsWith('/');
+    let p = pattern;
+    if (anchored)
+        p = p.slice(1);
+    // Trailing slash: match directory and everything beneath it
+    const dirOnly = p.endsWith('/');
+    if (dirOnly)
+        p = p.slice(0, -1);
+    // Escape special regex chars except * and ?
+    p = p.replace(/[.+^${}()|[\]\\]/g, '\\$&');
+    // ** → match anything (including slashes)
+    p = p.replace(/\*\*/g, '§DOUBLESTAR§');
+    // * → match anything except slash
+    p = p.replace(/\*/g, '[^/]*');
+    // ? → match any single char except slash
+    p = p.replace(/\?/g, '[^/]');
+    // Restore **
+    p = p.replace(/§DOUBLESTAR§/g, '.*');
+    let regexStr;
+    if (anchored) {
+        // Anchored to repo root
+        if (dirOnly) {
+            regexStr = `^${p}(/|$)`;
+        }
+        else if (p.includes('/')) {
+            // has slash → match full path from root
+            regexStr = `^${p}(/.*)?$`;
+        }
+        else {
+            regexStr = `^${p}(/.*)?$`;
+        }
+    }
+    else if (p.includes('/')) {
+        // Contains slash but not anchored → match from root
+        regexStr = `(^|/)${p}(/.*)?$`;
+    }
+    else {
+        // No slash → match filename anywhere in tree
+        if (dirOnly) {
+            regexStr = `(^|/)${p}(/|$)`;
+        }
+        else {
+            regexStr = `(^|/)${p}(/.*)?$`;
+        }
+    }
+    return new RegExp(regexStr);
+}
+// Parse CODEOWNERS from repoRoot/.github/CODEOWNERS, repoRoot/CODEOWNERS, or repoRoot/docs/CODEOWNERS
+// Last matching rule wins (GitHub semantics)
+export function parseCodeowners(repoRoot) {
+    const candidates = [
+        join(repoRoot, '.github', 'CODEOWNERS'),
+        join(repoRoot, 'CODEOWNERS'),
+        join(repoRoot, 'docs', 'CODEOWNERS'),
+    ];
+    let content = null;
+    for (const candidate of candidates) {
+        if (existsSync(candidate)) {
+            content = readFileSync(candidate, 'utf-8');
+            break;
+        }
+    }
+    if (!content)
+        return [];
+    const entries = [];
+    for (const rawLine of content.split('\n')) {
+        const line = rawLine.trim();
+        if (!line || line.startsWith('#'))
+            continue;
+        const parts = line.split(/\s+/);
+        const pattern = parts[0];
+        const owners = parts.slice(1).filter(o => o.startsWith('@') || o.includes('@'));
+        if (pattern) {
+            entries.push({ pattern, owners });
+        }
+    }
+    return entries;
+}
+// Resolve owner for a single file path (relative to repoRoot)
+// Last matching entry wins
+export function resolveOwner(entries, filePath) {
+    // Normalize path to use forward slashes, remove leading ./
+    const normalised = filePath.replace(/\\/g, '/').replace(/^\.\//, '');
+    let lastMatch = null;
+    for (const entry of entries) {
+        const regex = globToRegex(entry.pattern);
+        if (regex.test(normalised)) {
+            lastMatch = entry;
+        }
+    }
+    return lastMatch ? lastMatch.owners : [];
+}
+// Annotate all File nodes in the DB with their owners (stored in properties.codeowners)
+export function annotateOwnership(db, repoRoot) {
+    const entries = parseCodeowners(repoRoot);
+    const fileNodes = db
+        .prepare(`SELECT id, file_path, properties FROM nodes WHERE label = 'File' AND file_path IS NOT NULL`)
+        .all();
+    let annotated = 0;
+    let unowned = 0;
+    const update = db.prepare(`UPDATE nodes SET properties = ? WHERE id = ?`);
+    const updateAll = db.transaction(() => {
+        for (const node of fileNodes) {
+            const relPath = relative(repoRoot, node.file_path).replace(/\\/g, '/');
+            const owners = resolveOwner(entries, relPath);
+            const existing = node.properties ? JSON.parse(node.properties) : {};
+            const updated = { ...existing, codeowners: owners };
+            update.run(JSON.stringify(updated), node.id);
+            if (owners.length > 0) {
+                annotated++;
+            }
+            else {
+                unowned++;
+            }
+        }
+    });
+    updateAll();
+    return { annotated, unowned };
+}
+// Group a list of findings by owner
+// Findings with no filePath or no matching pattern bucket under 'unowned'
+// If a file has multiple owners, the finding appears under each owner key
+export function groupByOwner(findings, entries) {
+    const result = new Map();
+    for (const finding of findings) {
+        if (!finding.filePath) {
+            const bucket = result.get('unowned') ?? [];
+            bucket.push(finding);
+            result.set('unowned', bucket);
+            continue;
+        }
+        const owners = resolveOwner(entries, finding.filePath);
+        if (owners.length === 0) {
+            const bucket = result.get('unowned') ?? [];
+            bucket.push(finding);
+            result.set('unowned', bucket);
+        }
+        else {
+            for (const owner of owners) {
+                const bucket = result.get(owner) ?? [];
+                bucket.push(finding);
+                result.set(owner, bucket);
+            }
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=codeowners.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"codeowners.js","sourceRoot":"","sources":["../../../src/graph/codeowners.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,MAAM,CAAC;AActC,gDAAgD;AAChD,SAAS,WAAW,CAAC,OAAe;IAClC,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IACzC,IAAI,CAAC,GAAG,OAAO,CAAC;IAChB,IAAI,QAAQ;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE7B,4DAA4D;IAC5D,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,OAAO;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhC,4CAA4C;IAC5C,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,mBAAmB,EAAE,MAAM,CAAC,CAAC;IAE3C,0CAA0C;IAC1C,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IACvC,kCAAkC;IAClC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC9B,yCAAyC;IACzC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC7B,aAAa;IACb,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC;IAErC,IAAI,QAAgB,CAAC;IACrB,IAAI,QAAQ,EAAE,CAAC;QACb,wBAAwB;QACxB,IAAI,OAAO,EAAE,CAAC;YACZ,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,CAAC;aAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,wCAAwC;YACxC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAC5B,CAAC;IACH,CAAC;SAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3B,oDAAoD;QACpD,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC;IAChC,CAAC;SAAM,CAAC;QACN,6CAA6C;QAC7C,IAAI,OAAO,EAAE,CAAC;YACZ,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED,sGAAsG;AACtG,6CAA6C;AAC7C,MAAM,UAAU,eAAe,CAAC,QAAgB;IAC9C,MAAM,UAAU,GAAG;QACjB,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,YAAY,CAAC;QACvC,IAAI,CAAC,QAAQ,EAAE,YAAY,CAAC;QAC5B,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC;KACrC,CAAC;IAEF,IAAI,OAAO,GAAkB,IAAI,CAAC;IAClC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC1B,OAAO,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC3C,MAAM;QACR,CAAC;IACH,CAAC;IAED,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,KAAK,MAAM,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS;QAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAEhF,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8DAA8D;AAC9D,2BAA2B;AAC3B,MAAM,UAAU,YAAY,CAAC,OAA0B,EAAE,QAAgB;IACvE,2DAA2D;IAC3D,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAErE,IAAI,SAAS,GAA2B,IAAI,CAAC;IAC7C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3B,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,iBAAiB,CAC/B,EAAqB,EACrB,QAAgB;IAEhB,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,EAAE;SACjB,OAAO,CAAC,4FAA4F,CAAC;SACrG,GAAG,EAAoE,CAAC;IAE3E,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC;IAE1E,MAAM,SAAS,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;QACpC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACvE,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,MAAM,OAAO,GAAG,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;YACpD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAE7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,SAAS,EAAE,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,SAAS,EAAE,CAAC;IAEZ,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC;AAED,oCAAoC;AACpC,0EAA0E;AAC1E,0EAA0E;AAC1E,MAAM,UAAU,YAAY,CAC1B,QAAa,EACb,OAA0B;IAE1B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;IAEtC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAC9B,SAAS;QACX,CAAC;QAED,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,39 @@
+import type { MonographDb } from '../storage/db.js';
+export interface FunctionComplexity {
+    nodeId: string;
+    name: string;
+    filePath: string | null;
+    startLine: number | null;
+    endLine: number | null;
+    cyclomaticComplexity: number;
+    cognitiveComplexity: number;
+    linesOfCode: number;
+    paramCount: number;
+    crapScore: number;
+}
+export interface ComplexityReport {
+    functions: FunctionComplexity[];
+    p50cc: number;
+    p90cc: number;
+    p95cc: number;
+    highComplexityCount: number;
+    criticalCount: number;
+}
+/**
+ * Compute CRAP score for a function.
+ * Formula: CC² × (1 - coverage)³ + CC
+ * where coverage is a 0-1 fraction (0 = no tests, 1 = fully covered).
+ */
+export declare function computeCrapScore(cc: number, coverage: number): number;
+/**
+ * Compute cyclomatic and cognitive complexity for all Function/Method nodes
+ * in the knowledge graph. Uses graph degree as a proxy for decision points
+ * since AST is not available at this layer.
+ *
+ * - Cyclomatic complexity proxy: outgoing CALLS × 0.5 + outgoing ACCESSES × 0.2 + 1
+ * - Cognitive complexity proxy: (endLine - startLine) / 10, capped at 20
+ * - LOC: endLine - startLine + 1 (or 1 if missing)
+ * - CRAP: computed with coverage = 0 (worst-case, no test data available)
+ */
+export declare function computeComplexity(db: MonographDb): ComplexityReport;
+//# sourceMappingURL=complexity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"complexity.d.ts","sourceRoot":"","sources":["../../../src/graph/complexity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,kBAAkB;IACjC,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,MAAM,GAAG,IAAI,CAAC;IACvB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,kBAAkB,EAAE,CAAC;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,mBAAmB,EAAE,MAAM,CAAC;IAC5B,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAGrE;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,WAAW,GAAG,gBAAgB,CAoGnE"}

package/dist/src/graph/complexity.js

@@ -0,0 +1,100 @@
+/**
+ * Compute CRAP score for a function.
+ * Formula: CC² × (1 - coverage)³ + CC
+ * where coverage is a 0-1 fraction (0 = no tests, 1 = fully covered).
+ */
+export function computeCrapScore(cc, coverage) {
+    const cov = Math.max(0, Math.min(1, coverage));
+    return cc * cc * Math.pow(1 - cov, 3) + cc;
+}
+/**
+ * Compute cyclomatic and cognitive complexity for all Function/Method nodes
+ * in the knowledge graph. Uses graph degree as a proxy for decision points
+ * since AST is not available at this layer.
+ *
+ * - Cyclomatic complexity proxy: outgoing CALLS × 0.5 + outgoing ACCESSES × 0.2 + 1
+ * - Cognitive complexity proxy: (endLine - startLine) / 10, capped at 20
+ * - LOC: endLine - startLine + 1 (or 1 if missing)
+ * - CRAP: computed with coverage = 0 (worst-case, no test data available)
+ */
+export function computeComplexity(db) {
+    // Query all function/method nodes
+    const rows = db.prepare(`
+    SELECT id, name, file_path, start_line, end_line, properties
+    FROM nodes
+    WHERE label IN ('Function', 'Method')
+  `).all();
+    const functions = [];
+    for (const row of rows) {
+        const props = row.properties ? JSON.parse(row.properties) : {};
+        // Outgoing CALLS edges (decision points proxy)
+        const callsCount = db.prepare(`
+      SELECT COUNT(*) as c FROM edges
+      WHERE source_id = ? AND relation = 'CALLS'
+    `).get(row.id).c;
+        // Outgoing ACCESSES edges
+        const accessesCount = db.prepare(`
+      SELECT COUNT(*) as c FROM edges
+      WHERE source_id = ? AND relation = 'ACCESSES'
+    `).get(row.id).c;
+        // Cyclomatic complexity proxy: decision points + 1
+        const cyclomaticComplexity = Math.round(callsCount * 0.5 + accessesCount * 0.2 + 1);
+        // Cognitive complexity proxy: nesting depth approximation capped at 20
+        const lineSpan = (row.start_line != null && row.end_line != null)
+            ? row.end_line - row.start_line
+            : 0;
+        const cognitiveComplexity = Math.min(Math.round(lineSpan / 10), 20);
+        // LOC
+        const linesOfCode = (row.start_line != null && row.end_line != null)
+            ? row.end_line - row.start_line + 1
+            : 1;
+        // Param count from stored properties
+        const paramCount = typeof props.paramCount === 'number' ? props.paramCount : 0;
+        // CRAP score with no coverage data (worst-case: coverage = 0)
+        const crapScore = computeCrapScore(cyclomaticComplexity, 0);
+        // Store computed metrics back onto the node properties
+        const updatedProps = {
+            ...props,
+            cyclomaticComplexity,
+            cognitiveComplexity,
+            crapScore,
+        };
+        db.prepare('UPDATE nodes SET properties = ? WHERE id = ?')
+            .run(JSON.stringify(updatedProps), row.id);
+        functions.push({
+            nodeId: row.id,
+            name: row.name,
+            filePath: row.file_path,
+            startLine: row.start_line,
+            endLine: row.end_line,
+            cyclomaticComplexity,
+            cognitiveComplexity,
+            linesOfCode,
+            paramCount,
+            crapScore,
+        });
+    }
+    // Compute percentiles for cyclomatic complexity
+    const ccValues = functions.map(f => f.cyclomaticComplexity).sort((a, b) => a - b);
+    const len = ccValues.length;
+    function percentile(arr, p) {
+        if (arr.length === 0)
+            return 0;
+        const idx = Math.floor((p / 100) * (arr.length - 1));
+        return arr[idx];
+    }
+    const p50cc = percentile(ccValues, 50);
+    const p90cc = percentile(ccValues, 90);
+    const p95cc = percentile(ccValues, 95);
+    const highComplexityCount = functions.filter(f => f.cyclomaticComplexity > 10).length;
+    const criticalCount = functions.filter(f => f.cyclomaticComplexity > 20).length;
+    return {
+        functions,
+        p50cc,
+        p90cc,
+        p95cc,
+        highComplexityCount,
+        criticalCount,
+    };
+}
+//# sourceMappingURL=complexity.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"complexity.js","sourceRoot":"","sources":["../../../src/graph/complexity.ts"],"names":[],"mappings":"AAwBA;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAU,EAAE,QAAgB;IAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC/C,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAe;IAC/C,kCAAkC;IAClC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;GAIvB,CAAC,CAAC,GAAG,EAOJ,CAAC;IAEH,MAAM,SAAS,GAAyB,EAAE,CAAC;IAE3C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAA4B,CAAC,CAAC,CAAC,EAAE,CAAC;QAE1F,+CAA+C;QAC/C,MAAM,UAAU,GAAI,EAAE,CAAC,OAAO,CAAC;;;KAG9B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAmB,CAAC,CAAC,CAAC;QAEnC,0BAA0B;QAC1B,MAAM,aAAa,GAAI,EAAE,CAAC,OAAO,CAAC;;;KAGjC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAmB,CAAC,CAAC,CAAC;QAEnC,mDAAmD;QACnD,MAAM,oBAAoB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,GAAG,aAAa,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;QAEpF,uEAAuE;QACvE,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,UAAU,IAAI,IAAI,IAAI,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;YAC/D,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,UAAU;YAC/B,CAAC,CAAC,CAAC,CAAC;QACN,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAEpE,MAAM;QACN,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,UAAU,IAAI,IAAI,IAAI,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;YAClE,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,UAAU,GAAG,CAAC;YACnC,CAAC,CAAC,CAAC,CAAC;QAEN,qCAAqC;QACrC,MAAM,UAAU,GAAG,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/E,8DAA8D;QAC9D,MAAM,SAAS,GAAG,gBAAgB,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAE5D,uDAAuD;QACvD,MAAM,YAAY,GAAG;YACnB,GAAG,KAAK;YACR,oBAAoB;YACpB,mBAAmB;YACnB,SAAS;SACV,CAAC;QACF,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC;aACvD,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAE7C,SAAS,CAAC,IAAI,CAAC;YACb,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,EAAE,GAAG,CAAC,QAAQ;YACrB,oBAAoB;YACpB,mBAAmB;YACnB,WAAW;YACX,UAAU;YACV,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,gDAAgD;IAChD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClF,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;IAE5B,SAAS,UAAU,CAAC,GAAa,EAAE,CAAS;QAC1C,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACvC,MAAM,mBAAmB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,oBAAoB,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC;IACtF,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,oBAAoB,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC;IAEhF,OAAO;QACL,SAAS;QACT,KAAK;QACL,KAAK;QACL,KAAK;QACL,mBAAmB;QACnB,aAAa;KACd,CAAC;AACJ,CAAC"}

package/dist/src/graph/cross-reference-findings.d.ts

@@ -0,0 +1,46 @@
+export type DeadCodeKind = {
+    type: 'unused-file';
+} | {
+    type: 'unused-export';
+    exportName: string;
+} | {
+    type: 'unused-type';
+    typeName: string;
+};
+export interface CloneInstanceRef {
+    file: string;
+    startLine: number;
+    endLine: number;
+    tokenCount?: number;
+}
+export interface CombinedFinding {
+    cloneInstance: CloneInstanceRef;
+    deadCodeKind: DeadCodeKind;
+    groupIndex: number;
+}
+export interface CrossReferenceResult {
+    combinedFindings: CombinedFinding[];
+    clonesInUnusedFiles: number;
+    clonesWithUnusedExports: number;
+}
+export interface CrossRefDeadCodeSummary {
+    unusedFiles: Set<string>;
+    unusedExports: Array<{
+        path: string;
+        exportName: string;
+        line: number;
+    }>;
+    unusedTypes: Array<{
+        path: string;
+        typeName: string;
+        line: number;
+    }>;
+}
+export interface CrossRefDuplicationReport {
+    cloneGroups: Array<{
+        instances: CloneInstanceRef[];
+    }>;
+}
+export declare function crossReference(duplication: CrossRefDuplicationReport, deadCode: CrossRefDeadCodeSummary): CrossReferenceResult;
+export declare function affectedGroupIndices(result: CrossReferenceResult): Set<number>;
+//# sourceMappingURL=cross-reference-findings.d.ts.map

package/dist/src/graph/cross-reference-findings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-reference-findings.d.ts","sourceRoot":"","sources":["../../../src/graph/cross-reference-findings.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,YAAY,GACpB;IAAE,IAAI,EAAE,aAAa,CAAA;CAAE,GACvB;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC;AAE9C,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,eAAe;IAC9B,aAAa,EAAE,gBAAgB,CAAC;IAChC,YAAY,EAAE,YAAY,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,oBAAoB;IACnC,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,uBAAuB,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,uBAAuB;IACtC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACzB,aAAa,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACzE,WAAW,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtE;AAED,MAAM,WAAW,yBAAyB;IACxC,WAAW,EAAE,KAAK,CAAC;QAAE,SAAS,EAAE,gBAAgB,EAAE,CAAA;KAAE,CAAC,CAAC;CACvD;AAED,wBAAgB,cAAc,CAAC,WAAW,EAAE,yBAAyB,EAAE,QAAQ,EAAE,uBAAuB,GAAG,oBAAoB,CAyB9H;AAED,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,oBAAoB,GAAG,GAAG,CAAC,MAAM,CAAC,CAE9E"}

package/dist/src/graph/cross-reference-findings.js

@@ -0,0 +1,29 @@
+export function crossReference(duplication, deadCode) {
+    const findings = [];
+    let clonesInUnusedFiles = 0, clonesWithUnusedExports = 0;
+    for (let gi = 0; gi < duplication.cloneGroups.length; gi++) {
+        for (const inst of duplication.cloneGroups[gi].instances) {
+            if (deadCode.unusedFiles.has(inst.file)) {
+                findings.push({ cloneInstance: inst, deadCodeKind: { type: 'unused-file' }, groupIndex: gi });
+                clonesInUnusedFiles++;
+                continue;
+            }
+            const overlap = deadCode.unusedExports.find(e => e.path === inst.file && e.line >= inst.startLine && e.line <= inst.endLine);
+            if (overlap) {
+                findings.push({ cloneInstance: inst, deadCodeKind: { type: 'unused-export', exportName: overlap.exportName }, groupIndex: gi });
+                clonesWithUnusedExports++;
+                continue;
+            }
+            const typeOverlap = deadCode.unusedTypes.find(t => t.path === inst.file && t.line >= inst.startLine && t.line <= inst.endLine);
+            if (typeOverlap) {
+                findings.push({ cloneInstance: inst, deadCodeKind: { type: 'unused-type', typeName: typeOverlap.typeName }, groupIndex: gi });
+                clonesWithUnusedExports++;
+            }
+        }
+    }
+    return { combinedFindings: findings, clonesInUnusedFiles, clonesWithUnusedExports };
+}
+export function affectedGroupIndices(result) {
+    return new Set(result.combinedFindings.map(f => f.groupIndex));
+}
+//# sourceMappingURL=cross-reference-findings.js.map

package/dist/src/graph/cross-reference-findings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-reference-findings.js","sourceRoot":"","sources":["../../../src/graph/cross-reference-findings.ts"],"names":[],"mappings":"AAkCA,MAAM,UAAU,cAAc,CAAC,WAAsC,EAAE,QAAiC;IACtG,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,IAAI,mBAAmB,GAAG,CAAC,EAAE,uBAAuB,GAAG,CAAC,CAAC;IAEzD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC3D,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC;YACzD,IAAI,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC9F,mBAAmB,EAAE,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7H,IAAI,OAAO,EAAE,CAAC;gBACZ,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChI,uBAAuB,EAAE,CAAC;gBAC1B,SAAS;YACX,CAAC;YACD,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/H,IAAI,WAAW,EAAE,CAAC;gBAChB,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC9H,uBAAuB,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,CAAC;AACtF,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,MAA4B;IAC/D,OAAO,IAAI,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AACjE,CAAC"}

package/dist/src/graph/cross-reference.d.ts

@@ -0,0 +1,22 @@
+import type { MonographDb } from '../storage/db.js';
+import type { AnnotatedFinding } from '../types.js';
+export interface CrossReferenceFinding extends AnnotatedFinding {
+    crossRefType: 'dead+duplicate';
+    nodeIds: string[];
+    description: string;
+}
+export interface CrossReferenceReport {
+    findings: CrossReferenceFinding[];
+    deadCount: number;
+    duplicateCount: number;
+    crossCount: number;
+}
+/**
+ * Cross-reference unreachable files with duplicated files.
+ * Files that are BOTH dead code AND structurally duplicated are
+ * the highest-confidence safe-delete candidates.
+ *
+ * @param db - monograph database
+ */
+export declare function crossReferenceDuplicatesAndDeadCode(db: MonographDb): CrossReferenceReport;
+//# sourceMappingURL=cross-reference.d.ts.map

package/dist/src/graph/cross-reference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-reference.d.ts","sourceRoot":"","sources":["../../../src/graph/cross-reference.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEpD,MAAM,WAAW,qBAAsB,SAAQ,gBAAgB;IAC7D,YAAY,EAAE,gBAAgB,CAAC;IAC/B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,qBAAqB,EAAE,CAAC;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;GAMG;AACH,wBAAgB,mCAAmC,CAAC,EAAE,EAAE,WAAW,GAAG,oBAAoB,CAyFzF"}

package/dist/src/graph/cross-reference.js

@@ -0,0 +1,92 @@
+/**
+ * Cross-reference unreachable files with duplicated files.
+ * Files that are BOTH dead code AND structurally duplicated are
+ * the highest-confidence safe-delete candidates.
+ *
+ * @param db - monograph database
+ */
+export function crossReferenceDuplicatesAndDeadCode(db) {
+    // ── Step 1: Find dead (unreachable) file nodes ────────────────────────────
+    const deadRows = db.prepare(`
+    SELECT id, name, file_path
+    FROM nodes
+    WHERE label = 'File'
+      AND json_extract(properties, '$.reachabilityRole') = 'unreachable'
+  `).all();
+    const deadIds = new Set(deadRows.map(r => r.id));
+    const deadById = new Map(deadRows.map(r => [r.id, r]));
+    // ── Step 2: Find duplicated file nodes ───────────────────────────────────
+    // Primary: nodes connected by STRUCTURALLY_SIMILAR edges
+    let duplicateIds = new Set();
+    try {
+        const simRows = db.prepare(`
+      SELECT source_id, target_id
+      FROM edges
+      WHERE relation = 'STRUCTURALLY_SIMILAR'
+    `).all();
+        for (const row of simRows) {
+            duplicateIds.add(row.source_id);
+            duplicateIds.add(row.target_id);
+        }
+    }
+    catch {
+        // relation may not exist in this graph
+    }
+    // Fallback: files with the same basename in multiple directories
+    if (duplicateIds.size === 0) {
+        const allFiles = db.prepare(`
+      SELECT id, file_path
+      FROM nodes
+      WHERE label = 'File' AND file_path IS NOT NULL
+    `).all();
+        const byBasename = new Map();
+        for (const { id, file_path } of allFiles) {
+            const lastSlash = Math.max(file_path.lastIndexOf('/'), file_path.lastIndexOf('\\'));
+            const base = lastSlash === -1 ? file_path : file_path.slice(lastSlash + 1);
+            if (!byBasename.has(base))
+                byBasename.set(base, []);
+            byBasename.get(base).push(id);
+        }
+        for (const ids of byBasename.values()) {
+            if (ids.length > 1) {
+                for (const id of ids)
+                    duplicateIds.add(id);
+            }
+        }
+    }
+    // ── Step 3: Cross-reference ──────────────────────────────────────────────
+    const crossIds = [];
+    for (const id of deadIds) {
+        if (duplicateIds.has(id))
+            crossIds.push(id);
+    }
+    // ── Step 4: Build findings ───────────────────────────────────────────────
+    const findings = crossIds.map(id => {
+        const node = deadById.get(id);
+        return {
+            crossRefType: 'dead+duplicate',
+            nodeIds: [id],
+            description: `File "${node.name}" is both unreachable (dead code) and structurally duplicated — highest-confidence safe-delete candidate.`,
+            title: 'Unreachable duplicate file',
+            severity: 'warning',
+            nodeId: id,
+            nodeName: node.name,
+            filePath: node.file_path,
+            actions: [
+                {
+                    type: 'delete',
+                    file: node.file_path ?? undefined,
+                    description: 'Safe to remove — file is both unreachable and duplicated',
+                    confidence: 'high',
+                },
+            ],
+        };
+    });
+    return {
+        findings,
+        deadCount: deadIds.size,
+        duplicateCount: duplicateIds.size,
+        crossCount: crossIds.length,
+    };
+}
+//# sourceMappingURL=cross-reference.js.map

package/dist/src/graph/cross-reference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-reference.js","sourceRoot":"","sources":["../../../src/graph/cross-reference.ts"],"names":[],"mappings":"AAgBA;;;;;;GAMG;AACH,MAAM,UAAU,mCAAmC,CAAC,EAAe;IACjE,6EAA6E;IAC7E,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;GAK3B,CAAC,CAAC,GAAG,EAA8D,CAAC;IAErE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvD,4EAA4E;IAC5E,yDAAyD;IACzD,IAAI,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;;KAI1B,CAAC,CAAC,GAAG,EAAgD,CAAC;QAEvD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAChC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,uCAAuC;IACzC,CAAC;IAED,iEAAiE;IACjE,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;KAI3B,CAAC,CAAC,GAAG,EAAyC,CAAC;QAEhD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC/C,KAAK,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,QAAQ,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,IAAI,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3E,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACpD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,KAAK,MAAM,EAAE,IAAI,GAAG;oBAAE,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,4EAA4E;IAC5E,MAAM,QAAQ,GAA4B,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAC1D,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC/B,OAAO;YACL,YAAY,EAAE,gBAAgB;YAC9B,OAAO,EAAE,CAAC,EAAE,CAAC;YACb,WAAW,EAAE,SAAS,IAAI,CAAC,IAAI,2GAA2G;YAC1I,KAAK,EAAE,4BAA4B;YACnC,QAAQ,EAAE,SAAS;YACnB,MAAM,EAAE,EAAE;YACV,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,OAAO,EAAE;gBACP;oBACE,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,IAAI,CAAC,SAAS,IAAI,SAAS;oBACjC,WAAW,EAAE,0DAA0D;oBACvE,UAAU,EAAE,MAAM;iBACnB;aACF;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,QAAQ;QACR,SAAS,EAAE,OAAO,CAAC,IAAI;QACvB,cAAc,EAAE,YAAY,CAAC,IAAI;QACjC,UAAU,EAAE,QAAQ,CAAC,MAAM;KAC5B,CAAC;AACJ,CAAC"}

package/dist/src/graph/cycle-detection.d.ts

@@ -0,0 +1,6 @@
+export interface CycleGroup {
+    files: string[];
+    length: number;
+}
+export declare function findCycles(fileIds: number[], edges: Map<number, number[]>, idToPath: Map<number, string>, skipTypeOnly?: boolean, typeOnlyEdges?: Set<string>): CycleGroup[];
+//# sourceMappingURL=cycle-detection.d.ts.map

package/dist/src/graph/cycle-detection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle-detection.d.ts","sourceRoot":"","sources":["../../../src/graph/cycle-detection.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAkID,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAC5B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC7B,YAAY,UAAQ,EACpB,aAAa,GAAE,GAAG,CAAC,MAAM,CAAa,GACrC,UAAU,EAAE,CAwJd"}