@monoes/monograph 1.5.6 → 1.5.7

package/src/__tests__/graph/dead-code.test.ts

@@ -1,174 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { detectDeadCode, detectDeadCodeNodes, formatDeadCode } from '../../graph/dead-code.js';
-import { openDb } from '../../storage/db.js';
-import Database from 'better-sqlite3';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-
-function makeTempDb() {
-  const dir = mkdtempSync(join(tmpdir(), 'monograph-deadcode-test-'));
-  return openDb(join(dir, 'test.db'));
-}
-
-function insertFileNode(db: Database.Database, filePath: string) {
-  const id = filePath.replace(/[/.]/g, '_') + '_file';
-  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, file_path, is_exported) VALUES (?, 'File', ?, ?, ?, 0)`)
-    .run(id, filePath.split('/').pop(), filePath.split('/').pop(), filePath);
-  return id;
-}
-
-function insertFunction(db: Database.Database, name: string, filePath: string, opts?: { exported?: boolean; startLine?: number }) {
-  const id = filePath.replace(/[/.]/g, '_') + '_' + name + '_function';
-  const fileId = filePath.replace(/[/.]/g, '_') + '_file';
-  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, file_path, start_line, is_exported) VALUES (?, 'Function', ?, ?, ?, ?, ?)`)
-    .run(id, name, name.toLowerCase(), filePath, opts?.startLine ?? 1, opts?.exported ? 1 : 0);
-  // CONTAINS edge from File → Function
-  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CONTAINS', 'EXTRACTED', 1.0)`)
-    .run(`${fileId}_${id}_contains`, fileId, id);
-  return id;
-}
-
-function insertCallEdge(db: Database.Database, src: string, tgt: string) {
-  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'CALLS', 'EXTRACTED', 1.0)`)
-    .run(`${src}_${tgt}_calls`, src, tgt);
-}
-
-function insertReExportEdge(db: Database.Database, srcFileId: string, tgtFileId: string) {
-  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'RE_EXPORTS', 'INFERRED', 0.8)`)
-    .run(`${srcFileId}_${tgtFileId}_reexports`, srcFileId, tgtFileId);
-}
-
-describe('detectDeadCode', () => {
-  it('returns empty array for empty graph', () => {
-    const db = makeTempDb();
-    expect(detectDeadCode(db)).toEqual([]);
-    db.close();
-  });
-
-  it('does NOT flag non-exported functions', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'src/utils.ts');
-    insertFunction(db, 'helper', 'src/utils.ts', { exported: false });
-    expect(detectDeadCode(db)).toEqual([]);
-    db.close();
-  });
-
-  it('flags exported function with no inbound edges', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'src/utils.ts');
-    const id = insertFunction(db, 'unused', 'src/utils.ts', { exported: true });
-    expect(detectDeadCode(db)).toContain(id);
-    db.close();
-  });
-
-  it('does NOT flag functions with CALLS edges', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'src/a.ts');
-    insertFileNode(db, 'src/b.ts');
-    const callerId = insertFunction(db, 'caller', 'src/a.ts', { exported: true });
-    const calleeId = insertFunction(db, 'callee', 'src/b.ts', { exported: true });
-    insertCallEdge(db, callerId, calleeId);
-    const result = detectDeadCode(db);
-    expect(result).not.toContain(calleeId);
-    db.close();
-  });
-
-  it('skips test files', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'src/__tests__/foo.test.ts');
-    insertFunction(db, 'testHelper', 'src/__tests__/foo.test.ts', { exported: true });
-    expect(detectDeadCode(db)).toEqual([]);
-    db.close();
-  });
-
-  it('skips dist files', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'packages/foo/dist/utils.ts');
-    insertFunction(db, 'built', 'packages/foo/dist/utils.ts', { exported: true });
-    expect(detectDeadCode(db)).toEqual([]);
-    db.close();
-  });
-
-  it('skips index files', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'src/index.ts');
-    insertFunction(db, 'main', 'src/index.ts', { exported: true });
-    expect(detectDeadCode(db)).toEqual([]);
-    db.close();
-  });
-
-  it('does NOT suppress on a same-name coincidence alone (no real edge)', () => {
-    // Regression test for P2-18(a): the old suppression matched on NAME EQUALITY
-    // anywhere in the codebase, so a genuinely-dead `shared()` in a.ts was hidden
-    // just because an unrelated `shared` also existed in b.ts. With no actual
-    // RE_EXPORTS/IMPORTS edge between them, the candidate must still be flagged.
-    const db = makeTempDb();
-    insertFileNode(db, 'src/a.ts');
-    insertFileNode(db, 'src/b.ts');
-    const id = insertFunction(db, 'shared', 'src/a.ts', { exported: true });
-    insertFunction(db, 'shared', 'src/b.ts', { exported: false });
-    expect(detectDeadCode(db)).toContain(id);
-    db.close();
-  });
-
-  it('does NOT suppress on same-name-in-index.ts alone (no real RE_EXPORTS edge)', () => {
-    // Regression test for P2-18(a): a function sharing a name with something
-    // index.ts happens to also define is not the same as being re-exported by it.
-    const db = makeTempDb();
-    insertFileNode(db, 'src/utils.ts');
-    insertFileNode(db, 'src/index.ts');
-    const id = insertFunction(db, 'helper', 'src/utils.ts', { exported: true });
-    insertFunction(db, 'helper', 'src/index.ts', { exported: true });
-    expect(detectDeadCode(db)).toContain(id);
-    db.close();
-  });
-
-  it('skips functions re-exported through a REAL RE_EXPORTS edge from a barrel', () => {
-    const db = makeTempDb();
-    const utilsFileId = insertFileNode(db, 'src/utils.ts');
-    const indexFileId = insertFileNode(db, 'src/index.ts');
-    insertFunction(db, 'helper', 'src/utils.ts', { exported: true });
-    // Actual barrel edge: src/index.ts RE_EXPORTS src/utils.ts's File node.
-    insertReExportEdge(db, indexFileId, utilsFileId);
-    expect(detectDeadCode(db)).toEqual([]);
-    db.close();
-  });
-});
-
-describe('detectDeadCodeNodes', () => {
-  it('returns structured nodes with file path and line', () => {
-    const db = makeTempDb();
-    insertFileNode(db, 'src/utils.ts');
-    insertFunction(db, 'unused', 'src/utils.ts', { exported: true, startLine: 42 });
-    const nodes = detectDeadCodeNodes(db);
-    expect(nodes).toHaveLength(1);
-    expect(nodes[0]).toMatchObject({
-      name: 'unused',
-      filePath: 'src/utils.ts',
-      startLine: 42,
-      label: 'Function',
-    });
-    db.close();
-  });
-});
-
-describe('formatDeadCode', () => {
-  it('returns "none detected" for empty list', () => {
-    expect(formatDeadCode([])).toBe('Dead code: none detected.');
-  });
-
-  it('includes candidate count and file locations', () => {
-    const result = formatDeadCode([{
-      id: 'test_id',
-      name: 'unused',
-      filePath: 'src/utils.ts',
-      startLine: 42,
-      label: 'Function',
-    }]);
-    expect(result).toContain('1 exported function');
-    expect(result).toContain('src/utils.ts:42');
-    expect(result).toContain('Candidates only');
-    expect(result).not.toContain('lacks cross-file');
-  });
-});

package/src/__tests__/graph/dfs.test.ts

@@ -1,62 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { dfsTraversal } from '../../graph/dfs.js';
-
-function makeGraph(): Map<string, string[]> {
-  const adj = new Map<string, string[]>();
-  adj.set('a', ['b', 'c']);
-  adj.set('b', ['d']);
-  adj.set('c', ['d', 'e']);
-  adj.set('d', []);
-  adj.set('e', []);
-  return adj;
-}
-
-describe('dfsTraversal', () => {
-  it('visits all reachable nodes', () => {
-    const visited: string[] = [];
-    dfsTraversal('a', makeGraph(), (node) => { visited.push(node.id); });
-    expect(visited.sort()).toEqual(['a', 'b', 'c', 'd', 'e'].sort());
-  });
-
-  it('respects depth limit', () => {
-    const visited: string[] = [];
-    dfsTraversal('a', makeGraph(), (node) => { visited.push(node.id); }, { maxDepth: 1 });
-    expect(visited).toContain('a');
-    expect(visited).toContain('b');
-    expect(visited).toContain('c');
-    expect(visited).not.toContain('d');
-    expect(visited).not.toContain('e');
-  });
-
-  it('provides depth info in visitor', () => {
-    const depths: Record<string, number> = {};
-    dfsTraversal('a', makeGraph(), (node) => { depths[node.id] = node.depth; });
-    expect(depths['a']).toBe(0);
-    expect(depths['b']).toBe(1);
-    expect(depths['d']).toBe(2);
-  });
-
-  it('does not revisit nodes (cycle safety)', () => {
-    const cyclic = new Map<string, string[]>();
-    cyclic.set('a', ['b']);
-    cyclic.set('b', ['c']);
-    cyclic.set('c', ['a']); // cycle
-    const visited: string[] = [];
-    dfsTraversal('a', cyclic, (node) => { visited.push(node.id); });
-    expect(visited.length).toBe(3);
-    expect(new Set(visited).size).toBe(3);
-  });
-
-  it('returns empty when start node not in graph', () => {
-    const visited: string[] = [];
-    dfsTraversal('z', makeGraph(), (node) => { visited.push(node.id); });
-    expect(visited).toEqual([]);
-  });
-
-  it('returns nodes in DFS pre-order', () => {
-    const visited: string[] = [];
-    dfsTraversal('a', makeGraph(), (node) => { visited.push(node.id); });
-    expect(visited.indexOf('a')).toBeLessThan(visited.indexOf('b'));
-    expect(visited.indexOf('b')).toBeLessThan(visited.indexOf('d'));
-  });
-});

package/src/__tests__/graph/diff-summary.test.ts

@@ -1,83 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { diffSnapshots, type GraphSnapshot } from '../../graph/diff.js';
-import type { MonographNode, MonographEdge } from '../../types.js';
-
-function node(id: string): MonographNode {
-  return {
-    id,
-    label: 'function',
-    name: id,
-    normLabel: id,
-    filePath: `${id}.ts`,
-    startLine: 1,
-    endLine: 10,
-    communityId: 0,
-    isExported: false,
-    language: 'typescript',
-    properties: {},
-  } as MonographNode;
-}
-
-function edge(sourceId: string, targetId: string): MonographEdge {
-  return { id: `${sourceId}->${targetId}`, sourceId, targetId, relation: 'imports' } as MonographEdge;
-}
-
-describe('GraphDiff.summary', () => {
-  it('includes summary string in diff result', () => {
-    const before: GraphSnapshot = { nodes: [node('a'), node('b')], edges: [], capturedAt: '' };
-    const after: GraphSnapshot = { nodes: [node('a'), node('b'), node('c')], edges: [edge('a', 'c')], capturedAt: '' };
-    const diff = diffSnapshots(before, after);
-    expect(typeof diff.summary).toBe('string');
-  });
-
-  it('reports new nodes in summary', () => {
-    const before: GraphSnapshot = { nodes: [node('a')], edges: [], capturedAt: '' };
-    const after: GraphSnapshot = { nodes: [node('a'), node('b'), node('c')], edges: [], capturedAt: '' };
-    const diff = diffSnapshots(before, after);
-    expect(diff.summary).toMatch(/2 new node/);
-  });
-
-  it('reports removed nodes in summary', () => {
-    const before: GraphSnapshot = { nodes: [node('a'), node('b')], edges: [], capturedAt: '' };
-    const after: GraphSnapshot = { nodes: [node('a')], edges: [], capturedAt: '' };
-    const diff = diffSnapshots(before, after);
-    expect(diff.summary).toMatch(/1 node removed/);
-  });
-
-  it('reports new edges in summary', () => {
-    const before: GraphSnapshot = { nodes: [node('a'), node('b')], edges: [], capturedAt: '' };
-    const after: GraphSnapshot = { nodes: [node('a'), node('b')], edges: [edge('a', 'b')], capturedAt: '' };
-    const diff = diffSnapshots(before, after);
-    expect(diff.summary).toMatch(/1 new edge/);
-  });
-
-  it('reports removed edges in summary', () => {
-    const before: GraphSnapshot = { nodes: [node('a'), node('b')], edges: [edge('a', 'b')], capturedAt: '' };
-    const after: GraphSnapshot = { nodes: [node('a'), node('b')], edges: [], capturedAt: '' };
-    const diff = diffSnapshots(before, after);
-    expect(diff.summary).toMatch(/1 edge removed/);
-  });
-
-  it('returns "no changes" when graph is unchanged', () => {
-    const snap: GraphSnapshot = { nodes: [node('a')], edges: [], capturedAt: '' };
-    const diff = diffSnapshots(snap, snap);
-    expect(diff.summary).toMatch(/no changes/i);
-  });
-
-  it('combines multiple changes in one summary', () => {
-    const before: GraphSnapshot = {
-      nodes: [node('a'), node('b')],
-      edges: [edge('a', 'b')],
-      capturedAt: '',
-    };
-    const after: GraphSnapshot = {
-      nodes: [node('a'), node('c')],
-      edges: [edge('a', 'c')],
-      capturedAt: '',
-    };
-    const diff = diffSnapshots(before, after);
-    // Should mention new node, removed node, new edge, removed edge
-    expect(diff.summary.length).toBeGreaterThan(5);
-    expect(typeof diff.summary).toBe('string');
-  });
-});

package/src/__tests__/graph/edge-filter.test.ts

@@ -1,129 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { filterEdges, filterEdgesInMemory } from '../../graph/edge-filter.js';
-import { openDb } from '../../storage/db.js';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-import type { MonographEdge } from '../../types.js';
-
-function makeTempDb() {
-  const dir = mkdtempSync(join(tmpdir(), 'monograph-edge-filter-test-'));
-  return openDb(join(dir, 'test.db'));
-}
-
-function insertNode(db: ReturnType<typeof openDb>, id: string) {
-  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'Function', ?, ?, 0)`)
-    .run(id, id, id.toLowerCase());
-}
-
-function insertEdge(
-  db: ReturnType<typeof openDb>,
-  id: string,
-  src: string,
-  tgt: string,
-  relation = 'CALLS',
-  confidence = 'EXTRACTED',
-  score = 1.0,
-) {
-  db.prepare(
-    `INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score)
-     VALUES (?, ?, ?, ?, ?, ?)`,
-  ).run(id, src, tgt, relation, confidence, score);
-}
-
-describe('filterEdges (DB-backed)', () => {
-  it('returns all edges when no filter options are given', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a'); insertNode(db, 'b'); insertNode(db, 'c');
-    insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'EXTRACTED', 1.0);
-    insertEdge(db, 'e2', 'b', 'c', 'IMPORTS', 'INFERRED', 0.5);
-    const result = filterEdges(db);
-    expect(result).toHaveLength(2);
-    db.close();
-  });
-
-  it('filters by relation type', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a'); insertNode(db, 'b'); insertNode(db, 'c');
-    insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'EXTRACTED', 1.0);
-    insertEdge(db, 'e2', 'b', 'c', 'IMPORTS', 'EXTRACTED', 1.0);
-    const result = filterEdges(db, { relations: ['CALLS'] });
-    expect(result).toHaveLength(1);
-    expect(result[0].relation).toBe('CALLS');
-    db.close();
-  });
-
-  it('filters by confidence label', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a'); insertNode(db, 'b'); insertNode(db, 'c');
-    insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'EXTRACTED', 1.0);
-    insertEdge(db, 'e2', 'b', 'c', 'CALLS', 'INFERRED', 0.5);
-    const result = filterEdges(db, { confidences: ['INFERRED'] });
-    expect(result).toHaveLength(1);
-    expect(result[0].confidence).toBe('INFERRED');
-    db.close();
-  });
-
-  it('filters by minConfidenceScore', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a'); insertNode(db, 'b'); insertNode(db, 'c');
-    insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'EXTRACTED', 0.9);
-    insertEdge(db, 'e2', 'b', 'c', 'CALLS', 'INFERRED', 0.3);
-    const result = filterEdges(db, { minConfidenceScore: 0.8 });
-    expect(result).toHaveLength(1);
-    expect(result[0].id).toBe('e1');
-    db.close();
-  });
-
-  it('filters by maxConfidenceScore', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a'); insertNode(db, 'b'); insertNode(db, 'c');
-    insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'EXTRACTED', 0.9);
-    insertEdge(db, 'e2', 'b', 'c', 'CALLS', 'AMBIGUOUS', 0.2);
-    const result = filterEdges(db, { maxConfidenceScore: 0.5 });
-    expect(result).toHaveLength(1);
-    expect(result[0].id).toBe('e2');
-    db.close();
-  });
-
-  it('combines relation and confidence filters (AND)', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a'); insertNode(db, 'b'); insertNode(db, 'c');
-    insertEdge(db, 'e1', 'a', 'b', 'CALLS', 'EXTRACTED', 1.0);
-    insertEdge(db, 'e2', 'b', 'c', 'IMPORTS', 'INFERRED', 0.5);
-    insertEdge(db, 'e3', 'a', 'c', 'CALLS', 'INFERRED', 0.5);
-    const result = filterEdges(db, { relations: ['CALLS'], confidences: ['INFERRED'] });
-    expect(result).toHaveLength(1);
-    expect(result[0].id).toBe('e3');
-    db.close();
-  });
-});
-
-describe('filterEdgesInMemory', () => {
-  const edges: MonographEdge[] = [
-    { id: 'e1', sourceId: 'a', targetId: 'b', relation: 'CALLS', confidence: 'EXTRACTED', confidenceScore: 1.0 },
-    { id: 'e2', sourceId: 'b', targetId: 'c', relation: 'IMPORTS', confidence: 'INFERRED', confidenceScore: 0.5 },
-    { id: 'e3', sourceId: 'c', targetId: 'a', relation: 'CALLS', confidence: 'AMBIGUOUS', confidenceScore: 0.2 },
-  ];
-
-  it('returns all edges with no options', () => {
-    expect(filterEdgesInMemory(edges)).toHaveLength(3);
-  });
-
-  it('filters by relation', () => {
-    const result = filterEdgesInMemory(edges, { relations: ['CALLS'] });
-    expect(result).toHaveLength(2);
-  });
-
-  it('filters by confidence', () => {
-    const result = filterEdgesInMemory(edges, { confidences: ['EXTRACTED'] });
-    expect(result).toHaveLength(1);
-    expect(result[0].id).toBe('e1');
-  });
-
-  it('filters by minConfidenceScore and maxConfidenceScore', () => {
-    const result = filterEdgesInMemory(edges, { minConfidenceScore: 0.3, maxConfidenceScore: 0.8 });
-    expect(result).toHaveLength(1);
-    expect(result[0].id).toBe('e2');
-  });
-});

package/src/__tests__/graph/import-chain.test.ts

@@ -1,111 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { traceImportChain } from '../../graph/import-chain.js';
-import { openDb } from '../../storage/db.js';
-import Database from 'better-sqlite3';
-import { join } from 'path';
-import { mkdtempSync } from 'fs';
-import { tmpdir } from 'os';
-
-function makeTempDb() {
-  const dir = mkdtempSync(join(tmpdir(), 'monograph-import-chain-test-'));
-  return openDb(join(dir, 'test.db'));
-}
-
-function insertNode(db: Database.Database, id: string) {
-  db.prepare(`INSERT INTO nodes (id, label, name, norm_label, is_exported) VALUES (?, 'File', ?, ?, 0)`)
-    .run(id, id, id.toLowerCase());
-}
-
-function insertEdge(db: Database.Database, src: string, tgt: string) {
-  db.prepare(`INSERT INTO edges (id, source_id, target_id, relation, confidence, confidence_score) VALUES (?, ?, ?, 'IMPORTS', 'EXTRACTED', 1.0)`)
-    .run(`${src}_${tgt}`, src, tgt);
-}
-
-describe('traceImportChain', () => {
-  it('returns empty array when source does not exist', () => {
-    const db = makeTempDb();
-    const result = traceImportChain(db, 'nonexistent', 'also-nonexistent');
-    expect(result).toEqual([]);
-    db.close();
-  });
-
-  it('returns empty array when no path exists', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a');
-    insertNode(db, 'b');
-    // no edge between them
-    const result = traceImportChain(db, 'a', 'b');
-    expect(result).toEqual([]);
-    db.close();
-  });
-
-  it('returns direct path when directly connected', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a');
-    insertNode(db, 'b');
-    insertEdge(db, 'a', 'b');
-    const result = traceImportChain(db, 'a', 'b');
-    expect(result.length).toBeGreaterThan(0);
-    expect(result[0]).toEqual(['a', 'b']);
-    db.close();
-  });
-
-  it('returns path through intermediate node a->b->c', () => {
-    const db = makeTempDb();
-    insertNode(db, 'a');
-    insertNode(db, 'b');
-    insertNode(db, 'c');
-    insertEdge(db, 'a', 'b');
-    insertEdge(db, 'b', 'c');
-    const result = traceImportChain(db, 'a', 'c');
-    expect(result.length).toBeGreaterThan(0);
-    const hasPath = result.some(p => JSON.stringify(p) === JSON.stringify(['a', 'b', 'c']));
-    expect(hasPath).toBe(true);
-    db.close();
-  });
-
-  it('returns multiple paths when they exist', () => {
-    const db = makeTempDb();
-    // a->b->d and a->c->d
-    insertNode(db, 'a');
-    insertNode(db, 'b');
-    insertNode(db, 'c');
-    insertNode(db, 'd');
-    insertEdge(db, 'a', 'b');
-    insertEdge(db, 'a', 'c');
-    insertEdge(db, 'b', 'd');
-    insertEdge(db, 'c', 'd');
-    const result = traceImportChain(db, 'a', 'd');
-    expect(result.length).toBe(2);
-    db.close();
-  });
-
-  it('respects maxDepth option', () => {
-    const db = makeTempDb();
-    // a->b->c->d (depth 3 to reach d from a)
-    ['a', 'b', 'c', 'd'].forEach(n => insertNode(db, n));
-    insertEdge(db, 'a', 'b');
-    insertEdge(db, 'b', 'c');
-    insertEdge(db, 'c', 'd');
-    // max depth 2 should not find a->b->c->d
-    const result = traceImportChain(db, 'a', 'd', { maxDepth: 2 });
-    expect(result).toEqual([]);
-    db.close();
-  });
-
-  it('returns paths as arrays of node id strings', () => {
-    const db = makeTempDb();
-    insertNode(db, 'x');
-    insertNode(db, 'y');
-    insertEdge(db, 'x', 'y');
-    const result = traceImportChain(db, 'x', 'y');
-    expect(Array.isArray(result)).toBe(true);
-    for (const path of result) {
-      expect(Array.isArray(path)).toBe(true);
-      for (const node of path) {
-        expect(typeof node).toBe('string');
-      }
-    }
-    db.close();
-  });
-});