@monoes/monograph 1.5.3 → 1.5.5

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@monoes/monograph",
-  "version": "1.5.3",
+  "version": "1.5.5",
   "type": "module",
   "description": "Native TypeScript code intelligence engine for monomind",
   "main": "dist/src/index.js",
@@ -19,8 +19,11 @@
     "tag": "latest"
   },
   "scripts": {
+    "prebuild": "node ../../../scripts/build-fs.mjs clean dist tsconfig.tsbuildinfo",
     "build": "tsc",
-    "test": "vitest run"
+    "prepublishOnly": "npm run build",
+    "test": "vitest run",
+    "test:coverage": "vitest run --coverage"
   },
   "dependencies": {
     "better-sqlite3": "^12.0.0",
@@ -56,4 +59,4 @@
     "typescript": "^7.0.2",
     "vitest": "^4.1.4"
   }
-}
+}

package/src/cli/eval-server.ts

@@ -9,6 +9,7 @@
  *   createEvalServer('/path/to/repo', 4848)
  */
 
+import { createRequire } from 'node:module';
 import type { Server } from 'http';
 import type { Application } from 'express';
 import { openDb, closeDb } from '../storage/db.js';
@@ -49,7 +50,13 @@ export function createEvalServer(repoPath: string, _port?: number): EvalServerHa
   function getApp(): Application {
     if (_app) return _app;
 
-    // eslint-disable-next-line @typescript-eslint/no-require-imports
+    // createRequire, not a bare require(): this package is ESM
+    // ("type": "module"), where `require` is undefined at runtime — the
+    // eslint-disable that used to sit here silenced the lint but the call
+    // still threw "require is not defined" the moment getApp() ran.
+    // getApp() is synchronous, so `await import()` is not an option; this is
+    // the correct ESM escape hatch for a deliberately deferred load.
+    const require = createRequire(import.meta.url);
     const express = require('express') as typeof import('express');
     const app = express();
     app.use(express.json());

package/src/cli/skill-gen.ts

@@ -60,29 +60,29 @@ export async function generateSkillFiles(
   const db = openDb(dbPath);
 
   try {
-  const communities = queryCommunities(db);
+    const communities = queryCommunities(db);
 
-  if (communities.length === 0) {
-    return { filesWritten: [], communityCount: 0 };
-  }
+    if (communities.length === 0) {
+      return { filesWritten: [], communityCount: 0 };
+    }
 
-  await fs.mkdir(skillsDir, { recursive: true });
+    await fs.mkdir(skillsDir, { recursive: true });
 
-  const filesWritten: string[] = [];
+    const filesWritten: string[] = [];
 
-  for (const community of communities) {
-    const members = queryMembers(db, community.community_id);
-    const crossConnections = queryCrossConnections(db, community.community_id);
+    for (const community of communities) {
+      const members = queryMembers(db, community.community_id);
+      const crossConnections = queryCrossConnections(db, community.community_id);
 
-    const content = renderSkillMarkdown(community, members, crossConnections, repoPath);
+      const content = renderSkillMarkdown(community, members, crossConnections, repoPath);
 
-    const kebab = toKebabName(community.label || `community-${community.community_id}`);
-    const filePath = path.join(skillsDir, `${kebab}.md`);
-    await fs.writeFile(filePath, content, 'utf-8');
-    filesWritten.push(filePath);
-  }
+      const kebab = toKebabName(community.label || `community-${community.community_id}`);
+      const filePath = path.join(skillsDir, `${kebab}.md`);
+      await fs.writeFile(filePath, content, 'utf-8');
+      filesWritten.push(filePath);
+    }
 
-  return { filesWritten, communityCount: communities.length };
+    return { filesWritten, communityCount: communities.length };
   } finally {
     closeDb(db);
   }

package/src/graph/regex-search.ts

@@ -48,20 +48,6 @@ export function regexSearchNodes(
   const results: RegexNodeMatch[] = [];
 
   for (const r of rows) {
-    const node: MonographNode = {
-      id: r.id,
-      label: r.label as MonographNode['label'],
-      name: r.name,
-      normLabel: r.norm_label,
-      filePath: r.file_path ?? undefined,
-      startLine: r.start_line ?? undefined,
-      endLine: r.end_line ?? undefined,
-      communityId: r.community_id ?? undefined,
-      isExported: r.is_exported === 1,
-      language: r.language ?? undefined,
-      properties: r.properties ? (JSON.parse(r.properties) as Record<string, unknown>) : undefined,
-    };
-
     for (const field of fields) {
       const value =
         field === 'name' ? r.name :
@@ -70,6 +56,19 @@ export function regexSearchNodes(
         r.label;
 
       if (value && re.test(value)) {
+        const node: MonographNode = {
+          id: r.id,
+          label: r.label as MonographNode['label'],
+          name: r.name,
+          normLabel: r.norm_label,
+          filePath: r.file_path ?? undefined,
+          startLine: r.start_line ?? undefined,
+          endLine: r.end_line ?? undefined,
+          communityId: r.community_id ?? undefined,
+          isExported: r.is_exported === 1,
+          language: r.language ?? undefined,
+          properties: r.properties ? (JSON.parse(r.properties) as Record<string, unknown>) : undefined,
+        };
         results.push({ node, field });
         break;
       }

package/src/graph/statistics.ts

@@ -27,14 +27,6 @@ function getGraph(db: MonographDb): Graph {
   return graph;
 }
 
-/**
- * Evict the cached graph for a given DB instance (call after writes).
- */
-export function invalidateGraphCache(db: MonographDb): void {
-  const key = (db as unknown as { name: string }).name ?? '__default__';
-  _graphCache.delete(key);
-}
-
 /**
  * Graph density: ratio of actual edges to maximum possible directed edges.
  * For a directed graph with n nodes: max = n * (n - 1).

package/src/pipeline/phases/call-site-extractors.ts

@@ -7,6 +7,14 @@ export interface CallSite {
   form: 'method' | 'direct' | 'dynamic';
   receiverName?: string;
   methodName?: string;
+  /**
+   * Byte offset of the match in the source, used by scope resolution to find
+   * the function enclosing this call. Without it every CALLS edge is
+   * attributed to the containing File, which makes a function look "used" by
+   * its own file just for being declared there — see the dead-code masking
+   * described in graph/dead-code.ts.
+   */
+  offset?: number;
 }
 
 // ── Language keyword sets ────────────────────────────────────────────────────
@@ -71,13 +79,13 @@ function extractSimpleCallSites(
   const methodPattern = /(\w+)\.(\w+)\s*\(/g;
   let m: RegExpExecArray | null;
   while ((m = methodPattern.exec(source)) !== null) {
-    sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `${m[1]}.${m[2]}`, form: 'method', receiverName: m[1], methodName: m[2] });
+    sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `${m[1]}.${m[2]}`, form: 'method', receiverName: m[1], methodName: m[2] });
   }
   const directPattern = new RegExp(`(?<![.[\\w])(${directCharClass})\\s*\\(`, 'g');
   while ((m = directPattern.exec(source)) !== null) {
     const name = m[1]!;
     if (keywords.has(name)) continue;
-    sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: name, form: 'direct' });
+    sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: name, form: 'direct' });
   }
   return sites;
 }
@@ -112,44 +120,44 @@ export function extractCallSites(
     const methodPattern = /(\w+)\.(\w+)\s*(?:<[^>]*>\s*)?\(/g;
     let m: RegExpExecArray | null;
     while ((m = methodPattern.exec(source)) !== null) {
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `${m[1]}.${m[2]}`, form: 'method', receiverName: m[1], methodName: m[2] });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `${m[1]}.${m[2]}`, form: 'method', receiverName: m[1], methodName: m[2] });
     }
 
     const chainedPattern = /[)\]]\s*\.(\w+)\s*(?:<[^>]*>\s*)?\(/g;
     while ((m = chainedPattern.exec(source)) !== null) {
       const name = m[1];
       if (JS_KEYWORDS.has(name)) continue;
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `?.${name}`, form: 'method', methodName: name });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `?.${name}`, form: 'method', methodName: name });
     }
 
     const directPattern = /(?<![.[\w])([A-Za-z_$][\w$]*)\s*(?:<[^>]*>\s*)?\(/g;
     while ((m = directPattern.exec(source)) !== null) {
       const name = m[1];
       if (JS_KEYWORDS.has(name)) continue;
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: name, form: 'direct', methodName: name });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: name, form: 'direct', methodName: name });
     }
 
     const newPattern = /\bnew\s+([A-Z][\w$]*)\s*(?:<[^>]*>\s*)?\(/g;
     while ((m = newPattern.exec(source)) !== null) {
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `new ${m[1]}`, form: 'direct', methodName: m[1] });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `new ${m[1]}`, form: 'direct', methodName: m[1] });
     }
 
     const dynamicPattern = /\w+\s*\[[\w'"` ]+\]\s*\(/g;
     while ((m = dynamicPattern.exec(source)) !== null) {
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: m[0], form: 'dynamic' });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: m[0], form: 'dynamic' });
     }
   } else if (PY_EXTS.has(ext)) {
     const methodPattern = /(\w+)\.(\w+)\s*\(/g;
     let m: RegExpExecArray | null;
     while ((m = methodPattern.exec(source)) !== null) {
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `${m[1]}.${m[2]}`, form: 'method', receiverName: m[1], methodName: m[2] });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: `${m[1]}.${m[2]}`, form: 'method', receiverName: m[1], methodName: m[2] });
     }
 
     const directPattern = /(?<![.[\w])([A-Za-z_][\w]*)\s*\(/g;
     while ((m = directPattern.exec(source)) !== null) {
       const name = m[1];
       if (PY_KEYWORDS.has(name)) continue;
-      sites.push({ callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: name, form: 'direct', methodName: name });
+      sites.push({ offset: m.index, callerFileNodeId: fileNodeId, callerFilePath: filePath, calleeRaw: name, form: 'direct', methodName: name });
     }
   }
 

package/src/pipeline/phases/llm-extract.ts

@@ -62,6 +62,20 @@ export const llmExtractPhase: PipelinePhase<LlmExtractOutput> = {
 
     const { isClaudeCliAvailable } = await import('../../claude-cli.js');
     if (!isClaudeCliAvailable()) {
+      // Say so. Returning 0 silently is indistinguishable from "your docs had
+      // nothing to infer", so `--llm` looked like it ran and found nothing —
+      // reported as "silently produces 0 inferred edges" (#43), with the
+      // reasonable but wrong conclusion that an API key was missing.
+      //
+      // No API key is involved: LLM work goes through `claude --print`, which
+      // reuses Claude Code's own auth. The only requirement is that `claude` is
+      // on PATH — which is why this can fail *inside* a Claude Code session,
+      // where users least expect it.
+      console.warn(
+        '[monograph] --llm skipped: the `claude` CLI was not found on PATH.\n' +
+        '  Semantic extraction runs through `claude --print` and needs no ANTHROPIC_API_KEY.\n' +
+        '  Install it with: npm install -g @anthropic-ai/claude-code',
+      );
       return { triplesExtracted: 0, sectionsProcessed: 0 };
     }
 

package/src/pipeline/phases/module-resolution.ts

@@ -1,6 +1,6 @@
 // ── Module resolution for import specifiers ──────────────────────────────────
 
-import { readFileSync, existsSync } from 'fs';
+import { readFileSync, existsSync, readdirSync } from 'fs';
 import { join, extname, dirname, resolve as resolvePath } from 'path';
 import type { MonographNode } from '../../types.js';
 import { TS_JS_EXTS, CJS_MJS_EXTS } from './call-site-extractors.js';
@@ -40,7 +40,7 @@ export function buildWorkspacePackageMap(repoPath: string): Map<string, string>
     const scanDirs = (base: string, depth: number) => {
       if (depth > 2) return;
       let entries: string[];
-      try { entries = require('fs').readdirSync(base); } catch { return; }
+      try { entries = readdirSync(base); } catch { return; }
       for (const e of entries) {
         const full = join(base, e);
         const pkgJson = join(full, 'package.json');

package/src/pipeline/phases/scope-resolution.ts

@@ -56,6 +56,86 @@ function buildFunctionIndex(ctx: PipelineContext): {
   return { byFilePath, nameCounts };
 }
 
+/** A callable node with a known line range, used to attribute a call to its caller. */
+interface EnclosingSymbol {
+  id: string;
+  startLine: number;
+  endLine: number;
+}
+
+/**
+ * Line ranges of every callable, grouped by file, innermost-first.
+ *
+ * Call edges are attributed to the enclosing function rather than the file.
+ * Attributing them to the file makes a function appear "used" by its own file
+ * purely because it is declared there, which silently disabled dead-export
+ * detection: `detectDeadCodeNodes` rejects any candidate with an inbound CALLS
+ * edge, and that self-edge always existed.
+ */
+function buildEnclosingIndex(ctx: PipelineContext): Map<string, EnclosingSymbol[]> {
+  const byFile = new Map<string, EnclosingSymbol[]>();
+  if (!ctx.db) return byFile;
+
+  const rows = ctx.db
+    .prepare(
+      `SELECT id, file_path, start_line, end_line FROM nodes
+        WHERE label IN ('Function', 'Method', 'Constructor')
+          AND file_path IS NOT NULL AND start_line IS NOT NULL AND end_line IS NOT NULL`
+    )
+    .all() as { id: string; file_path: string; start_line: number; end_line: number }[];
+
+  for (const row of rows) {
+    let list = byFile.get(row.file_path);
+    if (!list) { list = []; byFile.set(row.file_path, list); }
+    list.push({ id: row.id, startLine: row.start_line, endLine: row.end_line });
+  }
+
+  // Narrowest range first, so the first containing match is the innermost
+  // scope — a call inside a closure belongs to the closure, not the function
+  // that happens to wrap it.
+  for (const list of byFile.values()) {
+    list.sort((a, b) => (a.endLine - a.startLine) - (b.endLine - b.startLine));
+  }
+
+  return byFile;
+}
+
+/** Line-start offsets, for turning a match offset into a 1-based line number. */
+function buildLineOffsets(source: string): number[] {
+  const offsets = [0];
+  for (let i = 0; i < source.length; i++) {
+    if (source.charCodeAt(i) === 10) offsets.push(i + 1);
+  }
+  return offsets;
+}
+
+function lineAtOffset(lineOffsets: number[], offset: number): number {
+  let lo = 0, hi = lineOffsets.length - 1;
+  while (lo < hi) {
+    const mid = (lo + hi + 1) >> 1;
+    if (lineOffsets[mid]! <= offset) lo = mid; else hi = mid - 1;
+  }
+  return lo + 1;
+}
+
+/**
+ * The innermost callable containing `offset`, or null when the call sits at
+ * module top level — which is genuinely file-scoped, so the file node stays
+ * the correct source for those.
+ */
+function findEnclosingSymbolId(
+  enclosing: EnclosingSymbol[] | undefined,
+  lineOffsets: number[],
+  offset: number | undefined,
+): string | null {
+  if (!enclosing || enclosing.length === 0 || offset === undefined) return null;
+  const line = lineAtOffset(lineOffsets, offset);
+  for (const sym of enclosing) {
+    if (line >= sym.startLine && line <= sym.endLine) return sym.id;
+  }
+  return null;
+}
+
 // ── Target resolution ────────────────────────────────────────────────────────
 
 function pickBestId(ids: string[], site: CallSite): string | null {
@@ -226,6 +306,7 @@ export const scopeResolutionPhase: PipelinePhase<ScopeResolutionOutput> = {
 
     const allImportMaps = buildAllImportMapsFromSource(ctx.repoPath, fileNodesByPath, fileContents);
     const { byFilePath: fnIndex, nameCounts } = buildFunctionIndex(ctx);
+    const enclosingIndex = buildEnclosingIndex(ctx);
 
     const edgeStmts = ctx.db ? prepareEdgeStmts(ctx.db) : null;
     const resolveAllCalls = ctx.db?.transaction(() => {
@@ -243,6 +324,8 @@ export const scopeResolutionPhase: PipelinePhase<ScopeResolutionOutput> = {
         }
 
         const callSites = extractCallSites(source, filePath, fileNode.id, ext);
+        const lineOffsets = buildLineOffsets(source);
+        const enclosing = enclosingIndex.get(filePath);
         const importMap = getImportMap(allImportMaps, fileNode.id);
         const ctorMap = (TS_JS_EXTS.has(ext) || CJS_MJS_EXTS.has(ext)) ? extractConstructorAssignments(source) : undefined;
         const importedFiles = [...new Set(importMap.values())];
@@ -260,7 +343,12 @@ export const scopeResolutionPhase: PipelinePhase<ScopeResolutionOutput> = {
             ambiguous++;
           }
 
-          const result = edgeStmts ? emitEdge(edgeStmts, site.callerFileNodeId, resolved.targetId) : 'skipped';
+          // Attribute the call to the function it sits in; fall back to the
+          // file node for genuine module-top-level calls.
+          const sourceId =
+            findEnclosingSymbolId(enclosing, lineOffsets, site.offset) ?? site.callerFileNodeId;
+
+          const result = edgeStmts ? emitEdge(edgeStmts, sourceId, resolved.targetId) : 'skipped';
           if (result === 'inserted' || result === 'upgraded') {
             resolvedEdges++;
           }

package/src/registry/repo-registry.ts

@@ -4,7 +4,7 @@
  * Persists at ~/.monograph/registry.json and tracks all repos indexed by monograph.
  */
 
-import { mkdirSync, readFileSync, writeFileSync, existsSync } from 'fs';
+import { mkdirSync, readFileSync, writeFileSync, existsSync, renameSync } from 'fs';
 import { join, basename, dirname } from 'path';
 import { homedir } from 'os';
 
@@ -67,7 +67,6 @@ export function saveRegistry(registry: RepoRegistry): void {
   const tmpPath = registryPath + '.tmp';
   writeFileSync(tmpPath, JSON.stringify(registry, null, 2), 'utf8');
   // Rename is atomic on POSIX systems
-  const { renameSync } = require('fs') as typeof import('fs');
   renameSync(tmpPath, registryPath);
 }
 

package/src/wiki/wiki-generator.ts

@@ -150,7 +150,13 @@ export async function generateWikiPage(
   } else {
     const { claudeCliCall, isClaudeCliAvailable } = await import('../claude-cli.js');
     if (!isClaudeCliAvailable()) {
-      throw new Error('Claude Code CLI not found. Install with: npm install -g @anthropic-ai/claude-code');
+      // Spell out that no API key is wanted — users hitting this reasonably
+      // assume ANTHROPIC_API_KEY is the missing piece and go set one, which
+      // changes nothing (#43).
+      throw new Error(
+        'Claude Code CLI not found on PATH. Wiki generation runs through `claude --print` ' +
+        'and needs no ANTHROPIC_API_KEY. Install it with: npm install -g @anthropic-ai/claude-code',
+      );
     }
     content = await claudeCliCall(prompt);
   }

package/vitest.config.ts

@@ -6,8 +6,15 @@ export default defineConfig({
     include: ['__tests__/**/*.test.ts', 'src/__tests__/**/*.test.ts'],
     exclude: ['node_modules', 'dist', '**/._*'],
     globals: true,
+    // Off by default to keep the edit/test loop fast; run
+    // `npm run test:coverage` (or pass --coverage) to measure.
     coverage: {
       enabled: false,
+      provider: 'v8',
+      reporter: ['text-summary', 'json-summary', 'html'],
+      reportsDirectory: './coverage',
+      include: ['src/**/*.ts'],
+      exclude: ['src/**/*.test.ts', 'src/__tests__/**', 'src/**/*.d.ts'],
     },
   },
 });

package/dist/src/__tests__/analysis/benchmark.test.d.ts

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

package/dist/src/__tests__/analysis/benchmark.test.d.ts.map

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

package/dist/src/__tests__/analysis/benchmark.test.js

@@ -1,54 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import Database from 'better-sqlite3';
-import { runBenchmark, estimateTokens } from '../../analysis/benchmark.js';
-function makeDb(nodeCount) {
-    const db = new Database(':memory:');
-    db.exec(`
-    CREATE TABLE nodes (id TEXT PRIMARY KEY, name TEXT, label TEXT, file_path TEXT, start_line INTEGER, end_line INTEGER, community_id INTEGER);
-    CREATE TABLE edges (id TEXT PRIMARY KEY, source_id TEXT, target_id TEXT, relation TEXT, confidence TEXT, confidence_score REAL);
-  `);
-    const insert = db.prepare('INSERT INTO nodes VALUES (?,?,?,?,?,?,?)');
-    for (let i = 0; i < nodeCount; i++) {
-        insert.run(`n${i}`, `symbol_${i}`, 'Function', `/app/file${i % 10}.ts`, i * 5 + 1, i * 5 + 4, i % 3);
-    }
-    for (let i = 1; i < Math.min(nodeCount, 20); i++) {
-        db.prepare('INSERT INTO edges VALUES (?,?,?,?,?,?)').run(`e${i}`, `n${i - 1}`, `n${i}`, 'CALLS', 'EXTRACTED', 0.9);
-    }
-    return db;
-}
-describe('estimateTokens', () => {
-    it('estimates tokens as text length divided by 4', () => {
-        expect(estimateTokens('a'.repeat(400))).toBe(100);
-        expect(estimateTokens('')).toBe(0);
-    });
-});
-describe('runBenchmark', () => {
-    it('returns corpus_tokens, avg_query_tokens, and reduction_ratio', () => {
-        const db = makeDb(50);
-        const result = runBenchmark(db, { corpusWordCount: 5000 });
-        expect(result.corpus_tokens).toBeGreaterThan(0);
-        expect(result.avg_query_tokens).toBeGreaterThanOrEqual(0);
-        expect(result.reduction_ratio).toBeGreaterThanOrEqual(0);
-        expect(result.nodes).toBe(50);
-    });
-    it('returns per_question breakdown', () => {
-        const db = makeDb(30);
-        const result = runBenchmark(db, {
-            questions: ['how does authentication work', 'what is the entry point'],
-            corpusWordCount: 3000,
-        });
-        expect(Array.isArray(result.per_question)).toBe(true);
-    });
-    it('works with no matching nodes gracefully', () => {
-        const db = makeDb(5);
-        const result = runBenchmark(db, { questions: ['zzz_nonexistent_xyz'] });
-        expect(result.nodes).toBe(5);
-        expect(typeof result.reduction_ratio).toBe('number');
-    });
-    it('uses default questions when none provided', () => {
-        const db = makeDb(20);
-        const result = runBenchmark(db);
-        expect(result.per_question.length).toBeGreaterThan(0);
-    });
-});
-//# sourceMappingURL=benchmark.test.js.map

package/dist/src/__tests__/analysis/benchmark.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"benchmark.test.js","sourceRoot":"","sources":["../../../../src/__tests__/analysis/benchmark.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAE3E,SAAS,MAAM,CAAC,SAAiB;IAC/B,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,UAAU,CAAC,CAAC;IACpC,EAAE,CAAC,IAAI,CAAC;;;GAGP,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;IACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,EAAE,UAAU,EAAE,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvG,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;IACrH,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3D,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,EAAE;YAC9B,SAAS,EAAE,CAAC,8BAA8B,EAAE,yBAAyB,CAAC;YACtE,eAAe,EAAE,IAAI;SACtB,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;QACxE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,OAAO,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,MAAM,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/analysis/cluster-quality.test.d.ts

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

package/dist/src/__tests__/analysis/cluster-quality.test.d.ts.map

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

package/dist/src/__tests__/analysis/cluster-quality.test.js

@@ -1,99 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { silhouetteScore, modularityScore } from '../../analysis/cluster-quality.js';
-describe('silhouetteScore', () => {
-    it('returns 0 for a single node', () => {
-        const memberships = new Map([['a', 0]]);
-        const edges = [];
-        expect(silhouetteScore(memberships, edges)).toBeCloseTo(0);
-    });
-    it('returns 1 for two perfectly separated communities with no cross edges', () => {
-        // Community 0: a-b-c fully connected, Community 1: d-e-f fully connected
-        const memberships = new Map([
-            ['a', 0], ['b', 0], ['c', 0],
-            ['d', 1], ['e', 1], ['f', 1],
-        ]);
-        const edges = [
-            { sourceId: 'a', targetId: 'b' },
-            { sourceId: 'b', targetId: 'c' },
-            { sourceId: 'a', targetId: 'c' },
-            { sourceId: 'd', targetId: 'e' },
-            { sourceId: 'e', targetId: 'f' },
-            { sourceId: 'd', targetId: 'f' },
-        ];
-        const score = silhouetteScore(memberships, edges);
-        expect(score).toBeGreaterThan(0.5);
-    });
-    it('returns negative score for misassigned nodes (cross edges dominate)', () => {
-        // Node 'a' is in community 0 but only connected to community 1 nodes
-        const memberships = new Map([
-            ['a', 0],
-            ['b', 1], ['c', 1], ['d', 1],
-        ]);
-        const edges = [
-            { sourceId: 'a', targetId: 'b' },
-            { sourceId: 'a', targetId: 'c' },
-            { sourceId: 'a', targetId: 'd' },
-            { sourceId: 'b', targetId: 'c' },
-            { sourceId: 'c', targetId: 'd' },
-        ];
-        const score = silhouetteScore(memberships, edges);
-        // 'a' is isolated in its community, so its silhouette is negative
-        expect(score).toBeLessThan(0.5);
-    });
-    it('handles nodes with no edges gracefully', () => {
-        const memberships = new Map([['x', 0], ['y', 1]]);
-        const edges = [];
-        const score = silhouetteScore(memberships, edges);
-        expect(typeof score).toBe('number');
-        expect(isNaN(score)).toBe(false);
-    });
-});
-describe('modularityScore', () => {
-    it('returns 0 for empty graph', () => {
-        const memberships = new Map();
-        const edges = [];
-        expect(modularityScore(memberships, edges)).toBeCloseTo(0);
-    });
-    it('returns positive value for well-structured communities', () => {
-        // Two dense clusters with few cross edges
-        const memberships = new Map([
-            ['a', 0], ['b', 0], ['c', 0],
-            ['d', 1], ['e', 1], ['f', 1],
-        ]);
-        const edges = [
-            { sourceId: 'a', targetId: 'b' },
-            { sourceId: 'b', targetId: 'c' },
-            { sourceId: 'a', targetId: 'c' },
-            { sourceId: 'd', targetId: 'e' },
-            { sourceId: 'e', targetId: 'f' },
-            { sourceId: 'd', targetId: 'f' },
-            { sourceId: 'c', targetId: 'd' }, // one bridge edge
-        ];
-        const q = modularityScore(memberships, edges);
-        expect(q).toBeGreaterThan(0);
-    });
-    it('returns close to 0 or negative for random partition', () => {
-        // All edges cross community boundaries
-        const memberships = new Map([
-            ['a', 0], ['b', 1], ['c', 0], ['d', 1],
-        ]);
-        const edges = [
-            { sourceId: 'a', targetId: 'b' },
-            { sourceId: 'b', targetId: 'c' },
-            { sourceId: 'c', targetId: 'd' },
-            { sourceId: 'd', targetId: 'a' },
-        ];
-        const q = modularityScore(memberships, edges);
-        expect(q).toBeLessThan(0.3);
-    });
-    it('handles single-community graph', () => {
-        const memberships = new Map([['a', 0], ['b', 0], ['c', 0]]);
-        const edges = [
-            { sourceId: 'a', targetId: 'b' },
-            { sourceId: 'b', targetId: 'c' },
-        ];
-        const q = modularityScore(memberships, edges);
-        expect(typeof q).toBe('number');
-    });
-});
-//# sourceMappingURL=cluster-quality.test.js.map

package/dist/src/__tests__/analysis/cluster-quality.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cluster-quality.test.js","sourceRoot":"","sources":["../../../../src/__tests__/analysis/cluster-quality.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,mCAAmC,CAAC;AAErF,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAkD,EAAE,CAAC;QAChE,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,yEAAyE;QACzE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;YAC1B,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;YAC5B,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;SAC7B,CAAC,CAAC;QACH,MAAM,KAAK,GAAG;YACZ,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;YAChC,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;SACjC,CAAC;QACF,MAAM,KAAK,GAAG,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,qEAAqE;QACrE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;YAC1B,CAAC,GAAG,EAAE,CAAC,CAAC;YACR,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;SAC7B,CAAC,CAAC;QACH,MAAM,KAAK,GAAG;YACZ,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;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;SACjC,CAAC;QACF,MAAM,KAAK,GAAG,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAClD,kEAAkE;QAClE,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,KAAK,GAAkD,EAAE,CAAC;QAChE,MAAM,KAAK,GAAG,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,CAAC,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,MAAM,KAAK,GAAkD,EAAE,CAAC;QAChE,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,0CAA0C;QAC1C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;YAC1B,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;YAC5B,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;SAC7B,CAAC,CAAC;QACH,MAAM,KAAK,GAAG;YACZ,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;YAChC,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;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,kBAAkB;SACrD,CAAC;QACF,MAAM,CAAC,GAAG,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC9C,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,uCAAuC;QACvC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;YAC1B,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;SACvC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG;YACZ,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;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;SACjC,CAAC;QACF,MAAM,CAAC,GAAG,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC9C,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG;YACZ,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;YAChC,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE;SACjC,CAAC;QACF,MAAM,CAAC,GAAG,eAAe,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC9C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/src/__tests__/analysis/corpus-health.test.d.ts

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

package/dist/src/__tests__/analysis/corpus-health.test.d.ts.map

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