@monoes/monograph 1.5.3 → 1.5.5

package/dist/src/__tests__/graph/prune.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=prune.test.d.ts.map

package/dist/src/__tests__/graph/prune.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prune.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/prune.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/prune.test.js

@@ -1,98 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { pruneDanglingEdges } from '../../graph/prune.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-prune-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
-        .run(id, id, id.toLowerCase());
-}
-function insertEdge(db, src, tgt) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-}
-function insertEdgeRaw(db, src, tgt) {
-    // inserts edge without inserting nodes — creates dangling edge
-    // temporarily disable FK checks to allow dangling edges
-    db.pragma('foreign_keys = OFF');
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-    db.pragma('foreign_keys = ON');
-}
-function getEdgeCount(db) {
-    return db.prepare('SELECT COUNT(*) AS n FROM edges').get().n;
-}
-describe('pruneDanglingEdges', () => {
-    it('returns 0 pruned for empty graph', () => {
-        const db = makeTempDb();
-        const pruned = pruneDanglingEdges(db);
-        expect(pruned).toBe(0);
-        db.close();
-    });
-    it('returns 0 pruned when all edges reference existing nodes', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        const pruned = pruneDanglingEdges(db);
-        expect(pruned).toBe(0);
-        expect(getEdgeCount(db)).toBe(1);
-        db.close();
-    });
-    it('removes edge with missing source node', () => {
-        const db = makeTempDb();
-        insertNode(db, 'b');
-        insertEdgeRaw(db, 'ghost', 'b');
-        expect(getEdgeCount(db)).toBe(1);
-        const pruned = pruneDanglingEdges(db);
-        expect(pruned).toBe(1);
-        expect(getEdgeCount(db)).toBe(0);
-        db.close();
-    });
-    it('removes edge with missing target node', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertEdgeRaw(db, 'a', 'missing');
-        expect(getEdgeCount(db)).toBe(1);
-        const pruned = pruneDanglingEdges(db);
-        expect(pruned).toBe(1);
-        expect(getEdgeCount(db)).toBe(0);
-        db.close();
-    });
-    it('removes multiple dangling edges', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b'); // valid
-        insertEdgeRaw(db, 'ghost1', 'a'); // dangling source
-        insertEdgeRaw(db, 'b', 'ghost2'); // dangling target
-        expect(getEdgeCount(db)).toBe(3);
-        const pruned = pruneDanglingEdges(db);
-        expect(pruned).toBe(2);
-        expect(getEdgeCount(db)).toBe(1);
-        db.close();
-    });
-    it('returns the count of pruned edges', () => {
-        const db = makeTempDb();
-        insertEdgeRaw(db, 'x', 'y'); // both nodes missing
-        const pruned = pruneDanglingEdges(db);
-        expect(typeof pruned).toBe('number');
-        expect(pruned).toBe(1);
-        db.close();
-    });
-    it('is idempotent — second call returns 0', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertEdgeRaw(db, 'a', 'missing');
-        pruneDanglingEdges(db);
-        const second = pruneDanglingEdges(db);
-        expect(second).toBe(0);
-        db.close();
-    });
-});
-//# sourceMappingURL=prune.test.js.map

package/dist/src/__tests__/graph/prune.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prune.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/prune.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAE5B,SAAS,UAAU;IACjB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,uBAAuB,CAAC,CAAC,CAAC;IACjE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,EAAU;IACnD,EAAE,CAAC,OAAO,CAAC,8FAA8F,CAAC;SACvG,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,GAAW,EAAE,GAAW;IACjE,EAAE,CAAC,OAAO,CAAC,kIAAkI,CAAC;SAC3I,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,aAAa,CAAC,EAAqB,EAAE,GAAW,EAAE,GAAW;IACpE,+DAA+D;IAC/D,wDAAwD;IACxD,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;IAChC,EAAE,CAAC,OAAO,CAAC,kIAAkI,CAAC;SAC3I,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAClC,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,YAAY,CAAC,EAAqB;IACzC,OAAQ,EAAE,CAAC,OAAO,CAAC,iCAAiC,CAAC,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;AAClF,CAAC;AAED,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,aAAa,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QAChC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QAClC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAO,QAAQ;QACxC,aAAa,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,kBAAkB;QACpD,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,kBAAkB;QACpD,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,qBAAqB;QAClD,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QAClC,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/graph/regex-search.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=regex-search.test.d.ts.map

package/dist/src/__tests__/graph/regex-search.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"regex-search.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/regex-search.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/regex-search.test.js

@@ -1,128 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { regexSearchNodes, regexSearchEdges, regexSearchNodesInMemory, regexSearchEdgesInMemory, } from '../../graph/regex-search.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-regex-search-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id, name = id, opts = {}) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, file_path, language, is_exported)
-     VALUES (?, ?, ?, ?, ?, ?, 0)`).run(id, opts.label ?? 'Function', name, name.toLowerCase(), opts.filePath ?? null, opts.language ?? null);
-}
-function insertEdge(db, id, src, tgt, relation = 'CALLS', reason = null) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score, reason)
-     VALUES (?, ?, ?, ?, 'EXTRACTED', 1.0, ?)`).run(id, src, tgt, relation, reason);
-}
-// ── DB-backed node search ──────────────────────────────────────────────────────
-describe('regexSearchNodes (DB)', () => {
-    it('matches nodes by name using regex', () => {
-        const db = makeTempDb();
-        insertNode(db, 'n1', 'authenticateUser');
-        insertNode(db, 'n2', 'validateInput');
-        insertNode(db, 'n3', 'handleRequest');
-        const results = regexSearchNodes(db, /authenticate/i);
-        expect(results).toHaveLength(1);
-        expect(results[0].node.id).toBe('n1');
-        expect(results[0].field).toBe('name');
-        db.close();
-    });
-    it('accepts string pattern', () => {
-        const db = makeTempDb();
-        insertNode(db, 'n1', 'UserService');
-        insertNode(db, 'n2', 'OrderService');
-        const results = regexSearchNodes(db, 'User');
-        expect(results).toHaveLength(1);
-        db.close();
-    });
-    it('matches by filePath', () => {
-        const db = makeTempDb();
-        insertNode(db, 'n1', 'login', { filePath: '/auth/login.ts' });
-        insertNode(db, 'n2', 'hash', { filePath: '/utils/crypto.ts' });
-        const results = regexSearchNodes(db, /\/auth\//, ['filePath']);
-        expect(results).toHaveLength(1);
-        expect(results[0].field).toBe('filePath');
-        db.close();
-    });
-    it('returns empty for no match', () => {
-        const db = makeTempDb();
-        insertNode(db, 'n1', 'fooBar');
-        const results = regexSearchNodes(db, /^zzz/);
-        expect(results).toHaveLength(0);
-        db.close();
-    });
-    it('reports each node at most once', () => {
-        const db = makeTempDb();
-        // name and filePath both match but should only appear once
-        insertNode(db, 'n1', 'auth', { filePath: '/auth/index.ts' });
-        const results = regexSearchNodes(db, /auth/, ['name', 'filePath']);
-        expect(results).toHaveLength(1);
-        db.close();
-    });
-});
-// ── DB-backed edge search ──────────────────────────────────────────────────────
-describe('regexSearchEdges (DB)', () => {
-    it('matches edges by relation', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'e1', 'a', 'b', 'CALLS');
-        insertEdge(db, 'e2', 'b', 'c', 'IMPORTS');
-        const results = regexSearchEdges(db, /^CALLS$/);
-        expect(results).toHaveLength(1);
-        expect(results[0].edge.id).toBe('e1');
-        expect(results[0].field).toBe('relation');
-        db.close();
-    });
-    it('matches edges by reason', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'direct function call');
-        insertEdge(db, 'e2', 'a', 'b', 'CALLS', null);
-        const results = regexSearchEdges(db, /direct/, ['reason']);
-        expect(results).toHaveLength(1);
-        expect(results[0].edge.id).toBe('e1');
-        db.close();
-    });
-});
-// ── In-memory variants ─────────────────────────────────────────────────────────
-describe('regexSearchNodesInMemory', () => {
-    const nodes = [
-        { id: 'n1', label: 'Function', name: 'loginUser', normLabel: 'loginuser', filePath: '/auth/login.ts', isExported: true },
-        { id: 'n2', label: 'Class', name: 'UserService', normLabel: 'userservice', filePath: '/services/user.ts', isExported: true },
-        { id: 'n3', label: 'Function', name: 'hash', normLabel: 'hash', isExported: false },
-    ];
-    it('matches by name', () => {
-        const results = regexSearchNodesInMemory(nodes, /User/);
-        expect(results.map(r => r.node.id)).toContain('n2');
-        expect(results.map(r => r.node.id)).toContain('n1');
-    });
-    it('matches by filePath', () => {
-        const results = regexSearchNodesInMemory(nodes, /\/auth\//, ['filePath']);
-        expect(results).toHaveLength(1);
-    });
-    it('returns empty for no match', () => {
-        expect(regexSearchNodesInMemory(nodes, /^zzz/)).toHaveLength(0);
-    });
-});
-describe('regexSearchEdgesInMemory', () => {
-    const edges = [
-        { id: 'e1', sourceId: 'a', targetId: 'b', relation: 'CALLS', confidence: 'EXTRACTED', confidenceScore: 1, reason: 'function call' },
-        { id: 'e2', sourceId: 'b', targetId: 'c', relation: 'IMPORTS', confidence: 'INFERRED', confidenceScore: 0.5 },
-    ];
-    it('matches by relation', () => {
-        const results = regexSearchEdgesInMemory(edges, /^IMPORTS$/);
-        expect(results).toHaveLength(1);
-        expect(results[0].edge.id).toBe('e2');
-    });
-    it('matches by reason', () => {
-        const results = regexSearchEdgesInMemory(edges, /function/, ['reason']);
-        expect(results).toHaveLength(1);
-        expect(results[0].field).toBe('reason');
-    });
-});
-//# sourceMappingURL=regex-search.test.js.map

package/dist/src/__tests__/graph/regex-search.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"regex-search.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/regex-search.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,wBAAwB,EACxB,wBAAwB,GACzB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAG5B,SAAS,UAAU;IACjB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,8BAA8B,CAAC,CAAC,CAAC;IACxE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU,CACjB,EAA6B,EAC7B,EAAU,EACV,IAAI,GAAG,EAAE,EACT,OAAiE,EAAE;IAEnE,EAAE,CAAC,OAAO,CACR;kCAC8B,CAC/B,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,IAAI,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;AAC9G,CAAC;AAED,SAAS,UAAU,CACjB,EAA6B,EAC7B,EAAU,EACV,GAAW,EACX,GAAW,EACX,QAAQ,GAAG,OAAO,EAClB,SAAwB,IAAI;IAE5B,EAAE,CAAC,OAAO,CACR;8CAC0C,CAC3C,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,kFAAkF;AAElF,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC;QACzC,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QACtC,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC;QACtD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;QACpC,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC,CAAC;QAC9D,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,2DAA2D;QAC3D,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;QACnE,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,kFAAkF;AAElF,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAAC,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAAC,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC9D,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACxC,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAChD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAAC,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACzC,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,sBAAsB,CAAC,CAAC;QAChE,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,kFAAkF;AAElF,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,MAAM,KAAK,GAAoB;QAC7B,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,IAAI,EAAE;QACxH,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,QAAQ,EAAE,mBAAmB,EAAE,UAAU,EAAE,IAAI,EAAE;QAC5H,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE;KACpF,CAAC;IAEF,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,OAAO,GAAG,wBAAwB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,OAAO,GAAG,wBAAwB,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,wBAAwB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,MAAM,KAAK,GAAoB;QAC7B,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE;QACnI,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,eAAe,EAAE,GAAG,EAAE;KAC9G,CAAC;IAEF,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,OAAO,GAAG,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAC7D,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,MAAM,OAAO,GAAG,wBAAwB,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxE,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/graph/ripple-impact.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=ripple-impact.test.d.ts.map

package/dist/src/__tests__/graph/ripple-impact.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ripple-impact.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/ripple-impact.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/ripple-impact.test.js

@@ -1,64 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { rippleImpact } from '../../graph/ripple-impact.js';
-const edges = [
-    { sourceId: 'a', targetId: 'b' },
-    { sourceId: 'b', targetId: 'c' },
-    { sourceId: 'c', targetId: 'd' },
-    { sourceId: 'd', targetId: 'e' },
-];
-describe('rippleImpact', () => {
-    it('returns only direct neighbors at depth 1', () => {
-        const result = rippleImpact('a', edges, 1);
-        expect(result.byDepth[1]).toContain('b');
-        expect(result.byDepth[2]).toBeUndefined();
-    });
-    it('returns nodes at each depth level', () => {
-        const result = rippleImpact('a', edges, 3);
-        expect(result.byDepth[1]).toContain('b');
-        expect(result.byDepth[2]).toContain('c');
-        expect(result.byDepth[3]).toContain('d');
-    });
-    it('does not repeat nodes across depths', () => {
-        const loopyEdges = [
-            { sourceId: 'a', targetId: 'b' },
-            { sourceId: 'b', targetId: 'c' },
-            { sourceId: 'c', targetId: 'a' }, // cycle
-        ];
-        const result = rippleImpact('a', loopyEdges, 5);
-        const allNodes = Object.values(result.byDepth).flat();
-        const unique = new Set(allNodes);
-        expect(unique.size).toBe(allNodes.length);
-    });
-    it('totalScore is positive and decreases with depth-only paths', () => {
-        const result = rippleImpact('a', edges, 4);
-        expect(result.totalScore).toBeGreaterThan(0);
-    });
-    it('score at depth 2 is less than score at depth 1 (decay)', () => {
-        const result = rippleImpact('a', edges, 2);
-        expect(result.byDepth[1]?.length ?? 0).toBeGreaterThan(0);
-        // total score should reflect decay weighting
-        const result1 = rippleImpact('a', edges, 1);
-        expect(result.totalScore).toBeGreaterThan(result1.totalScore);
-    });
-    it('returns empty result for unknown node', () => {
-        const result = rippleImpact('unknown', edges, 3);
-        expect(Object.keys(result.byDepth)).toHaveLength(0);
-        expect(result.totalScore).toBe(0);
-    });
-    it('respects maxDepth boundary', () => {
-        const result = rippleImpact('a', edges, 2);
-        expect(result.byDepth[3]).toBeUndefined();
-    });
-    it('works on directed edges (not traversing backwards)', () => {
-        // directed: a→b→c only; starting from 'c' should yield nothing
-        const result = rippleImpact('c', edges, 3);
-        // 'd' is downstream of c
-        expect(result.byDepth[1]).toContain('d');
-    });
-    it('returns totalScore 0 when node has no outgoing edges', () => {
-        const result = rippleImpact('e', edges, 3);
-        expect(result.totalScore).toBe(0);
-        expect(Object.keys(result.byDepth)).toHaveLength(0);
-    });
-});
-//# sourceMappingURL=ripple-impact.test.js.map

package/dist/src/__tests__/graph/ripple-impact.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ripple-impact.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/ripple-impact.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAE5D,MAAM,KAAK,GAAG;IACZ,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;IAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;IAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;IAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;CACjC,CAAC;AAEF,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,UAAU,GAAG;YACjB,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,QAAQ;SAC3C,CAAC;QACF,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACtD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1D,6CAA6C;QAC7C,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,+DAA+D;QAC/D,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,yBAAyB;QACzB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/graph/scc.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=scc.test.d.ts.map

package/dist/src/__tests__/graph/scc.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"scc.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/scc.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/scc.test.js

@@ -1,77 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { findStronglyConnectedComponents } from '../../graph/cycles.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-scc-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
-        .run(id, id, id.toLowerCase());
-}
-function insertEdge(db, src, tgt) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-}
-describe('findStronglyConnectedComponents', () => {
-    it('returns empty array for empty graph', () => {
-        const db = makeTempDb();
-        expect(findStronglyConnectedComponents(db)).toEqual([]);
-        db.close();
-    });
-    it('returns each single node as its own SCC in a DAG', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        const result = findStronglyConnectedComponents(db);
-        // In a DAG, every node is its own SCC
-        expect(result.length).toBe(3);
-        expect(result.every(comp => comp.length === 1)).toBe(true);
-        db.close();
-    });
-    it('returns single SCC containing both nodes for a->b->a cycle', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'a');
-        const result = findStronglyConnectedComponents(db);
-        const cycleScc = result.find(comp => comp.length === 2);
-        expect(cycleScc).toBeDefined();
-        expect(cycleScc.sort()).toEqual(['a', 'b']);
-        db.close();
-    });
-    it('covers all nodes across all SCCs', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertNode(db, 'd');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'a'); // cycle: {a, b}
-        insertEdge(db, 'c', 'd'); // DAG tail: {c}, {d}
-        const result = findStronglyConnectedComponents(db);
-        const allNodes = result.flat().sort();
-        expect(allNodes).toEqual(['a', 'b', 'c', 'd'].sort());
-        db.close();
-    });
-    it('returns each node in exactly one SCC', () => {
-        const db = makeTempDb();
-        ['a', 'b', 'c'].forEach(n => insertNode(db, n));
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        insertEdge(db, 'c', 'a');
-        const result = findStronglyConnectedComponents(db);
-        const allNodes = result.flat();
-        const unique = new Set(allNodes);
-        expect(unique.size).toBe(allNodes.length); // no duplicates
-        db.close();
-    });
-});
-//# sourceMappingURL=scc.test.js.map

package/dist/src/__tests__/graph/scc.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scc.test.js","sourceRoot":"","sources":["../../../../src/__tests__/graph/scc.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,+BAA+B,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,IAAI,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAE5B,SAAS,UAAU;IACjB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,qBAAqB,CAAC,CAAC,CAAC;IAC/D,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,EAAU;IACnD,EAAE,CAAC,OAAO,CAAC,8FAA8F,CAAC;SACvG,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,UAAU,CAAC,EAAqB,EAAE,GAAW,EAAE,GAAW;IACjE,EAAE,CAAC,OAAO,CAAC,kIAAkI,CAAC;SAC3I,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,MAAM,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,+BAA+B,CAAC,EAAE,CAAC,CAAC;QACnD,sCAAsC;QACtC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,+BAA+B,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;QAC/B,MAAM,CAAC,QAAS,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7C,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,gBAAgB;QAC1C,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,qBAAqB;QAC/C,MAAM,MAAM,GAAG,+BAA+B,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;QACtC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACtD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,+BAA+B,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB;QAC3D,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/graph/statistics.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=statistics.test.d.ts.map

package/dist/src/__tests__/graph/statistics.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"statistics.test.d.ts","sourceRoot":"","sources":["../../../../src/__tests__/graph/statistics.test.ts"],"names":[],"mappings":""}

package/dist/src/__tests__/graph/statistics.test.js

@@ -1,197 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { graphDensity, clusteringCoefficient, averagePathLength, graphDiameter } from '../../graph/statistics.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-function makeTempDb() {
-    const dir = mkdtempSync(join(tmpdir(), 'monograph-stats-test-'));
-    return openDb(join(dir, 'test.db'));
-}
-function insertNode(db, id) {
-    db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
-        .run(id, id, id.toLowerCase());
-}
-function insertEdge(db, src, tgt) {
-    db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-        .run(`${src}_${tgt}`, src, tgt);
-}
-describe('graphDensity', () => {
-    it('returns 0 for empty graph', () => {
-        const db = makeTempDb();
-        expect(graphDensity(db)).toBe(0);
-        db.close();
-    });
-    it('returns 0 for graph with only nodes and no edges', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        expect(graphDensity(db)).toBe(0);
-        db.close();
-    });
-    it('returns 1 for complete directed graph of 3 nodes (6 edges)', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'a', 'c');
-        insertEdge(db, 'b', 'a');
-        insertEdge(db, 'b', 'c');
-        insertEdge(db, 'c', 'a');
-        insertEdge(db, 'c', 'b');
-        expect(graphDensity(db)).toBeCloseTo(1, 5);
-        db.close();
-    });
-    it('returns value between 0 and 1 for partial graph', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        const d = graphDensity(db);
-        expect(d).toBeGreaterThan(0);
-        expect(d).toBeLessThan(1);
-        db.close();
-    });
-    it('returns a number', () => {
-        const db = makeTempDb();
-        insertNode(db, 'x');
-        expect(typeof graphDensity(db)).toBe('number');
-        db.close();
-    });
-});
-describe('clusteringCoefficient', () => {
-    it('returns 0 for empty graph', () => {
-        const db = makeTempDb();
-        expect(clusteringCoefficient(db)).toBe(0);
-        db.close();
-    });
-    it('returns 0 for a chain graph (no triangles)', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        const cc = clusteringCoefficient(db);
-        expect(cc).toBeGreaterThanOrEqual(0);
-        expect(cc).toBeLessThanOrEqual(1);
-        db.close();
-    });
-    it('returns 1 for fully connected triangle', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        // bidirectional triangle
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'a');
-        insertEdge(db, 'b', 'c');
-        insertEdge(db, 'c', 'b');
-        insertEdge(db, 'a', 'c');
-        insertEdge(db, 'c', 'a');
-        const cc = clusteringCoefficient(db);
-        expect(cc).toBeGreaterThanOrEqual(0);
-        expect(cc).toBeLessThanOrEqual(1);
-        db.close();
-    });
-    it('returns a number between 0 and 1', () => {
-        const db = makeTempDb();
-        insertNode(db, 'x');
-        insertNode(db, 'y');
-        insertEdge(db, 'x', 'y');
-        const cc = clusteringCoefficient(db);
-        expect(typeof cc).toBe('number');
-        expect(cc).toBeGreaterThanOrEqual(0);
-        expect(cc).toBeLessThanOrEqual(1);
-        db.close();
-    });
-});
-describe('averagePathLength', () => {
-    it('returns 0 for empty graph', () => {
-        const db = makeTempDb();
-        expect(averagePathLength(db)).toBe(0);
-        db.close();
-    });
-    it('returns 0 for single node', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        expect(averagePathLength(db)).toBe(0);
-        db.close();
-    });
-    it('returns 1 for two directly connected nodes', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        // a->b has path length 1; b->a unreachable
-        expect(averagePathLength(db)).toBeCloseTo(1, 5);
-        db.close();
-    });
-    it('returns 4/3 for a->b->c chain (a->b=1, a->c=2, b->c=1)', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        // reachable pairs: (a,b)=1, (a,c)=2, (b,c)=1 => total 4 / 3 pairs
-        const apl = averagePathLength(db);
-        expect(apl).toBeCloseTo(4 / 3, 5);
-        db.close();
-    });
-    it('returns a non-negative number', () => {
-        const db = makeTempDb();
-        insertNode(db, 'x');
-        insertNode(db, 'y');
-        insertEdge(db, 'x', 'y');
-        expect(averagePathLength(db)).toBeGreaterThanOrEqual(0);
-        db.close();
-    });
-});
-describe('graphDiameter', () => {
-    it('returns 0 for empty graph', () => {
-        const db = makeTempDb();
-        expect(graphDiameter(db)).toBe(0);
-        db.close();
-    });
-    it('returns 0 for single node', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        expect(graphDiameter(db)).toBe(0);
-        db.close();
-    });
-    it('returns 1 for two directly connected nodes', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertEdge(db, 'a', 'b');
-        expect(graphDiameter(db)).toBe(1);
-        db.close();
-    });
-    it('returns 2 for a->b->c chain', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        expect(graphDiameter(db)).toBe(2);
-        db.close();
-    });
-    it('returns 3 for a->b->c->d chain', () => {
-        const db = makeTempDb();
-        insertNode(db, 'a');
-        insertNode(db, 'b');
-        insertNode(db, 'c');
-        insertNode(db, 'd');
-        insertEdge(db, 'a', 'b');
-        insertEdge(db, 'b', 'c');
-        insertEdge(db, 'c', 'd');
-        expect(graphDiameter(db)).toBe(3);
-        db.close();
-    });
-});
-//# sourceMappingURL=statistics.test.js.map