@dreamtree-org/graphify 1.0.0 → 1.1.1

package/dist/index.cjs

@@ -31,23 +31,44 @@ var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: tru
 var index_exports = {};
 __export(index_exports, {
   EXTRACTOR_REGISTRY: () => EXTRACTOR_REGISTRY,
+  ExtractionCache: () => ExtractionCache,
   ExtractionResultSchema: () => ExtractionResultSchema,
   ExtractionValidationError: () => ExtractionValidationError,
+  affectedBy: () => affectedBy,
   analyze: () => analyze,
+  buildContextPack: () => buildContextPack,
   buildGraph: () => buildGraph,
+  checkRules: () => checkRules,
   cluster: () => cluster,
   collectFiles: () => collectFiles,
+  diffGraphs: () => diffGraphs,
   explainNode: () => explainNode,
   exportGraph: () => exportGraph,
   extract: () => extract,
+  extractMysql: () => extractMysql,
+  globToRegExp: () => globToRegExp,
+  graphForDirectory: () => graphForDirectory,
+  isTestFile: () => isTestFile,
   loadGraph: () => loadGraph,
+  loadResults: () => loadResults,
+  mergeGraphs: () => mergeGraphs,
   queryGraph: () => queryGraph,
+  rankForTask: () => rankForTask,
+  renderContextPack: () => renderContextPack,
+  renderLessons: () => renderLessons,
   renderReport: () => renderReport,
+  renderReview: () => renderReview,
+  resolveCrossFileReferences: () => resolveCrossFileReferences,
   resolveNode: () => resolveNode,
+  reviewRevisions: () => reviewRevisions,
   runPipeline: () => runPipeline,
+  saveResult: () => saveResult,
   scoreNodes: () => scoreNodes,
   shortestPath: () => shortestPath,
-  validateExtraction: () => validateExtraction
+  testsForChangedFiles: () => testsForChangedFiles,
+  testsForNode: () => testsForNode,
+  validateExtraction: () => validateExtraction,
+  validateRules: () => validateRules
 });
 module.exports = __toCommonJS(index_exports);
 
@@ -293,7 +314,7 @@ async function createParser(grammarName) {
 }
 
 // src/extractors/csharp.ts
-async function extractCSharp(filePath) {
+async function extractCSharp(filePath, displayPath) {
   const parser = await createParser("c_sharp");
   const raw = await fs2.readFile(filePath);
   const content = raw.toString("utf-8");
@@ -302,7 +323,7 @@ async function extractCSharp(filePath) {
     throw new Error(`extractCSharp: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -506,7 +527,7 @@ function defaultPackageQualifier(importPath) {
   const segments = importPath.split("/");
   return segments[segments.length - 1] ?? importPath;
 }
-async function extractGo(filePath) {
+async function extractGo(filePath, displayPath) {
   const parser = await createParser("go");
   const raw = await fs3.readFile(filePath);
   const content = raw.toString("utf-8");
@@ -515,7 +536,7 @@ async function extractGo(filePath) {
     throw new Error(`extractGo: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -713,7 +734,7 @@ async function extractGo(filePath) {
 
 // src/extractors/java.ts
 var fs4 = __toESM(require("fs/promises"), 1);
-async function extractJava(filePath) {
+async function extractJava(filePath, displayPath) {
   const parser = await createParser("java");
   const raw = await fs4.readFile(filePath);
   const content = raw.toString("utf-8");
@@ -722,7 +743,7 @@ async function extractJava(filePath) {
     throw new Error(`extractJava: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -914,7 +935,7 @@ async function extractJava(filePath) {
 
 // src/extractors/python.ts
 var fs5 = __toESM(require("fs/promises"), 1);
-async function extractPython(filePath) {
+async function extractPython(filePath, displayPath) {
   const parser = await createParser("python");
   const raw = await fs5.readFile(filePath);
   const content = raw.toString("utf-8");
@@ -923,7 +944,7 @@ async function extractPython(filePath) {
     throw new Error(`extractPython: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -1158,7 +1179,7 @@ function stringLiteralContent(node) {
   const content = namedChildren(node).find((c) => c.type === "string_content");
   return content ? content.text : "";
 }
-async function extractRuby(filePath) {
+async function extractRuby(filePath, displayPath) {
   const parser = await createParser("ruby");
   const raw = await fs6.readFile(filePath);
   const content = raw.toString("utf-8");
@@ -1167,7 +1188,7 @@ async function extractRuby(filePath) {
     throw new Error(`extractRuby: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -1360,7 +1381,7 @@ function convertUsePath(segments) {
   }
   return segments.join("::");
 }
-async function extractRust(filePath) {
+async function extractRust(filePath, displayPath) {
   const parser = await createParser("rust");
   const raw = await fs7.readFile(filePath);
   const content = raw.toString("utf-8");
@@ -1369,7 +1390,7 @@ async function extractRust(filePath) {
     throw new Error(`extractRust: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -1582,10 +1603,10 @@ async function extractRust(filePath) {
         }
       }
     } else if (fn.type === "scoped_identifier") {
-      const path8 = fn.childForFieldName("path")?.text;
+      const path11 = fn.childForFieldName("path")?.text;
       const name = fn.childForFieldName("name")?.text;
-      if (path8 && name) {
-        const viaImport = importIndex.get(path8);
+      if (path11 && name) {
+        const viaImport = importIndex.get(path11);
         if (viaImport) {
           targetId = viaImport.id;
           confidence = "INFERRED";
@@ -1626,7 +1647,7 @@ function firstStringArgument(call) {
   if (!first || first.type !== "string") return null;
   return stripQuotes2(first.text);
 }
-async function extractTypeScript(filePath) {
+async function extractTypeScript(filePath, displayPath) {
   const ext = path3.extname(filePath);
   const grammar = grammarForExtension(ext);
   const parser = await createParser(grammar);
@@ -1637,7 +1658,7 @@ async function extractTypeScript(filePath) {
     throw new Error(`extractTypeScript: parser produced no tree for ${filePath}`);
   }
   const root = tree.rootNode;
-  const sourceFile = toPosix(filePath);
+  const sourceFile = toPosix(displayPath ?? filePath);
   const builder = new ExtractionBuilder();
   const fileId = sourceFile;
   builder.addNode({ id: fileId, label: sourceFile, sourceFile, sourceLocation: "L1" });
@@ -1954,13 +1975,13 @@ var EXTRACTOR_REGISTRY = {
   ".cs": extractCSharp,
   ".rb": extractRuby
 };
-async function extract(filePath) {
+async function extract(filePath, displayPath) {
   const ext = path4.extname(filePath);
   const extractor = EXTRACTOR_REGISTRY[ext];
   if (!extractor) {
     return { nodes: [], edges: [] };
   }
-  return extractor(filePath);
+  return extractor(filePath, displayPath);
 }
 
 // src/build.ts
@@ -2065,6 +2086,107 @@ function buildGraph(extractions) {
   return graph;
 }
 
+// src/resolve.ts
+var CODE_EXTENSIONS2 = [
+  ".ts",
+  ".tsx",
+  ".mts",
+  ".cts",
+  ".js",
+  ".jsx",
+  ".mjs",
+  ".cjs",
+  ".py",
+  ".go",
+  ".rs",
+  ".java",
+  ".cs",
+  ".rb"
+];
+function isOpaque(id) {
+  return id.startsWith("module:") || id.startsWith("external:") || id.startsWith("db:");
+}
+function stripKnownExtension(p) {
+  for (const ext of CODE_EXTENSIONS2) {
+    if (p.endsWith(ext)) return p.slice(0, -ext.length);
+  }
+  return null;
+}
+function candidatePaths(guessed) {
+  const stem = stripKnownExtension(guessed) ?? guessed;
+  const candidates = [];
+  for (const ext of CODE_EXTENSIONS2) candidates.push(`${stem}${ext}`);
+  for (const ext of CODE_EXTENSIONS2) candidates.push(`${guessed}/index${ext}`);
+  if (stem !== guessed) {
+    for (const ext of CODE_EXTENSIONS2) candidates.push(`${stem}/index${ext}`);
+  }
+  return candidates.filter((c) => c !== guessed);
+}
+function uniqueMatch(guessed, candidates, realIds) {
+  const matches = /* @__PURE__ */ new Set();
+  for (const candidate of candidates) {
+    if (realIds.has(candidate)) matches.add(candidate);
+  }
+  if (matches.size !== 1) return null;
+  return [...matches][0];
+}
+function resolveCrossFileReferences(extractions) {
+  const realIds = /* @__PURE__ */ new Set();
+  const realFiles = /* @__PURE__ */ new Set();
+  for (const extraction of extractions) {
+    for (const node of extraction.nodes) realIds.add(node.id);
+    for (const node of extraction.nodes) {
+      const sep3 = node.id.indexOf("::");
+      if (sep3 > 0) realFiles.add(node.id.slice(0, sep3));
+    }
+    for (const edge of extraction.edges) {
+      if (edge.relation === "contains") realFiles.add(edge.source);
+    }
+  }
+  const remap = /* @__PURE__ */ new Map();
+  const resolveId = (id) => {
+    if (isOpaque(id)) return null;
+    const cached = remap.get(id);
+    if (cached !== void 0) return cached;
+    const sep3 = id.indexOf("::");
+    let resolved;
+    if (sep3 > 0) {
+      if (realIds.has(id)) return null;
+      const guessedPath = id.slice(0, sep3);
+      const name = id.slice(sep3);
+      const candidates = candidatePaths(guessedPath).map((p) => `${p}${name}`);
+      resolved = uniqueMatch(id, candidates, realIds);
+    } else {
+      if (realFiles.has(id)) return null;
+      resolved = uniqueMatch(id, candidatePaths(id), realFiles);
+    }
+    if (resolved !== null) remap.set(id, resolved);
+    return resolved;
+  };
+  let resolvedEndpoints = 0;
+  for (const extraction of extractions) {
+    for (const edge of extraction.edges) {
+      const source = resolveId(edge.source);
+      if (source !== null) {
+        edge.source = source;
+        resolvedEndpoints++;
+      }
+      const target = resolveId(edge.target);
+      if (target !== null) {
+        edge.target = target;
+        resolvedEndpoints++;
+      }
+    }
+  }
+  let droppedPlaceholders = 0;
+  for (const extraction of extractions) {
+    const before = extraction.nodes.length;
+    extraction.nodes = extraction.nodes.filter((node) => !remap.has(node.id));
+    droppedPlaceholders += before - extraction.nodes.length;
+  }
+  return { resolvedEndpoints, droppedPlaceholders };
+}
+
 // src/cluster.ts
 var import_node_crypto = require("crypto");
 var import_graphology2 = __toESM(require("graphology"), 1);
@@ -2345,7 +2467,37 @@ var nodePath = __toESM(require("path"), 1);
 var MAX_FETCH_BYTES = 50 * 1024 * 1024;
 var MAX_TEXT_BYTES = 10 * 1024 * 1024;
 var MAX_LABEL_LEN = 256;
-function validateGraphPath(path8, base) {
+var DEFAULT_MYSQL_PORT = 3306;
+function validateDsn(dsn) {
+  let parsed;
+  try {
+    parsed = new URL(dsn);
+  } catch {
+    throw new Error("Invalid DSN \u2014 expected mysql://user:pass@host:port/database");
+  }
+  if (parsed.protocol !== "mysql:") {
+    throw new Error(`DSN scheme not supported: "${parsed.protocol}" (only mysql: is supported)`);
+  }
+  const database = decodeURIComponent(parsed.pathname.replace(/^\//, ""));
+  if (!database || database.includes("/")) {
+    throw new Error("DSN must name exactly one database, e.g. mysql://localhost:3306/mydb");
+  }
+  if (!parsed.hostname) {
+    throw new Error("DSN must include a host, e.g. mysql://localhost:3306/mydb");
+  }
+  const port = parsed.port ? Number(parsed.port) : DEFAULT_MYSQL_PORT;
+  return {
+    safeDisplay: `mysql://${parsed.hostname}:${port}/${database}`,
+    connection: {
+      host: parsed.hostname,
+      port,
+      user: decodeURIComponent(parsed.username) || "root",
+      password: decodeURIComponent(parsed.password),
+      database
+    }
+  };
+}
+function validateGraphPath(path11, base) {
   const baseDir = base ?? nodePath.join(process.cwd(), "graphify-out");
   let resolvedBase;
   try {
@@ -2353,7 +2505,7 @@ function validateGraphPath(path8, base) {
   } catch {
     throw new Error(`Base directory does not exist: ${baseDir}`);
   }
-  const candidate = nodePath.isAbsolute(path8) ? path8 : nodePath.join(resolvedBase, path8);
+  const candidate = nodePath.isAbsolute(path11) ? path11 : nodePath.join(resolvedBase, path11);
   const resolvedCandidate = nodePath.resolve(candidate);
   let realCandidate = resolvedCandidate;
   try {
@@ -2363,7 +2515,7 @@ function validateGraphPath(path8, base) {
   const relative4 = nodePath.relative(resolvedBase, realCandidate);
   const escapes = relative4 === ".." || relative4.startsWith(`..${nodePath.sep}`) || nodePath.isAbsolute(relative4);
   if (escapes) {
-    throw new Error(`Path escapes graphify-out/: ${path8}`);
+    throw new Error(`Path escapes graphify-out/: ${path11}`);
   }
   return realCandidate;
 }
@@ -2506,28 +2658,82 @@ async function exportGraph(graph, options, report) {
 }
 
 // src/pipeline.ts
+var fs12 = __toESM(require("fs/promises"), 1);
+var path7 = __toESM(require("path"), 1);
+
+// src/extractionCache.ts
+var import_node_crypto3 = require("crypto");
+var fs11 = __toESM(require("fs/promises"), 1);
 var path6 = __toESM(require("path"), 1);
+var ExtractionCache = class {
+  dir;
+  constructor(outDir) {
+    this.dir = path6.join(outDir, "cache");
+  }
+  key(relFile, content) {
+    return (0, import_node_crypto3.createHash)("sha256").update(relFile).update("\0").update(content).digest("hex");
+  }
+  async get(key) {
+    try {
+      const raw = await fs11.readFile(path6.join(this.dir, `${key}.json`), "utf-8");
+      const parsed = JSON.parse(raw);
+      if (!Array.isArray(parsed.nodes) || !Array.isArray(parsed.edges)) return null;
+      return parsed;
+    } catch {
+      return null;
+    }
+  }
+  async put(key, extraction) {
+    await fs11.mkdir(this.dir, { recursive: true });
+    await fs11.writeFile(path6.join(this.dir, `${key}.json`), JSON.stringify(extraction), "utf-8");
+  }
+};
+
+// src/pipeline.ts
 async function runPipeline(root, options = {}) {
   const progress = options.onProgress ?? (() => {
   });
-  const resolvedRoot = path6.resolve(root);
+  const resolvedRoot = path7.resolve(root);
   progress(`Scanning ${resolvedRoot} ...`);
   const manifest = collectFiles(resolvedRoot);
   progress(
     `Found ${manifest.totalFiles} file(s) (${manifest.files.code.length} code, ${manifest.skippedSensitive.length} skipped as sensitive).`
   );
+  const outDir = options.outDir ?? path7.join(resolvedRoot, "graphify-out");
+  const cache = new ExtractionCache(outDir);
   progress("Extracting...");
   const extractions = [];
+  let cacheHits = 0;
   for (const relFile of manifest.files.code.sort((a, b) => a.localeCompare(b))) {
-    const filePath = path6.relative(process.cwd(), path6.join(resolvedRoot, relFile)) || relFile;
+    const filePath = path7.relative(process.cwd(), path7.join(resolvedRoot, relFile)) || relFile;
     try {
-      const extraction = await extract(filePath);
+      const key = cache.key(relFile, await fs12.readFile(path7.join(resolvedRoot, relFile)));
+      let extraction = options.update ? await cache.get(key) : null;
+      if (extraction) {
+        cacheHits++;
+      } else {
+        extraction = await extract(filePath, relFile);
+        await cache.put(key, extraction);
+      }
       extractions.push(extraction);
     } catch (error) {
       progress(`  extraction failed for ${relFile}: ${error.message}`);
       throw error;
     }
   }
+  if (options.update) {
+    progress(`  cache: ${cacheHits} hit(s), ${extractions.length - cacheHits} re-extracted.`);
+  }
+  if (options.extraExtractions && options.extraExtractions.length > 0) {
+    extractions.push(...options.extraExtractions);
+  }
+  progress("Resolving cross-file references...");
+  const resolveStats = resolveCrossFileReferences(extractions);
+  if (resolveStats.resolvedEndpoints > 0) {
+    progress(
+      `  re-pointed ${resolveStats.resolvedEndpoints} guessed reference(s) at real nodes (${resolveStats.droppedPlaceholders} placeholder node(s) dropped).`
+    );
+  }
   progress("Building graph...");
   const graph = buildGraph(extractions);
   progress(`Clustering (${options.algorithm ?? "louvain"})...`);
@@ -2536,7 +2742,6 @@ async function runPipeline(root, options = {}) {
   const analysis = analyze(graph);
   progress("Rendering report...");
   const report = renderReport(graph, analysis);
-  const outDir = options.outDir ?? path6.join(resolvedRoot, "graphify-out");
   progress(`Exporting to ${outDir} ...`);
   await exportGraph(
     graph,
@@ -2555,12 +2760,12 @@ async function runPipeline(root, options = {}) {
 }
 
 // src/graphStore.ts
-var fs11 = __toESM(require("fs/promises"), 1);
-var path7 = __toESM(require("path"), 1);
+var fs13 = __toESM(require("fs/promises"), 1);
+var path8 = __toESM(require("path"), 1);
 var import_graphology3 = __toESM(require("graphology"), 1);
-async function loadGraph(outDir = path7.join(process.cwd(), "graphify-out")) {
+async function loadGraph(outDir = path8.join(process.cwd(), "graphify-out")) {
   const jsonPath = validateGraphPath("graph.json", outDir);
-  const raw = await fs11.readFile(jsonPath, "utf-8");
+  const raw = await fs13.readFile(jsonPath, "utf-8");
   const data = JSON.parse(raw);
   return import_graphology3.default.from(data);
 }
@@ -2597,8 +2802,48 @@ var STOPWORDS = /* @__PURE__ */ new Set([
   "does",
   "that's"
 ]);
+function splitCamelCase(text) {
+  return text.replace(/([a-z0-9])([A-Z])/g, "$1 $2").replace(/([A-Z]+)([A-Z][a-z])/g, "$1 $2");
+}
 function tokenize(text) {
-  return text.toLowerCase().split(/[^a-z0-9_.]+/).filter((token) => token.length > 1 && !STOPWORDS.has(token));
+  return splitCamelCase(text).toLowerCase().split(/[^a-z0-9]+/).filter((token) => token.length > 1 && !STOPWORDS.has(token));
+}
+function subtokenize(text) {
+  return splitCamelCase(text).toLowerCase().split(/[^a-z0-9]+/).filter((token) => token.length > 1);
+}
+var FUZZY_MIN_TOKEN_LEN = 3;
+var FUZZY_THRESHOLD = 0.7;
+var SUBTOKEN_MATCH_SCORE = 1;
+var SUBSTRING_MATCH_SCORE = 0.6;
+var FUZZY_MATCH_WEIGHT = 0.5;
+function osaDistance(a, b) {
+  let prev2 = [];
+  let prev = Array.from({ length: b.length + 1 }, (_, j) => j);
+  let curr = new Array(b.length + 1).fill(0);
+  for (let i = 1; i <= a.length; i++) {
+    curr[0] = i;
+    for (let j = 1; j <= b.length; j++) {
+      const substitution = a[i - 1] === b[j - 1] ? 0 : 1;
+      let best = Math.min(
+        prev[j] + 1,
+        curr[j - 1] + 1,
+        prev[j - 1] + substitution
+      );
+      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+        best = Math.min(best, prev2[j - 2] + 1);
+      }
+      curr[j] = best;
+    }
+    [prev2, prev, curr] = [prev, curr, new Array(b.length + 1).fill(0)];
+  }
+  return prev[b.length];
+}
+function fuzzySimilarity(a, b) {
+  if (a === b) return 1;
+  const maxLen = Math.max(a.length, b.length);
+  if (maxLen === 0) return 1;
+  if (Math.abs(a.length - b.length) / maxLen > 1 - FUZZY_THRESHOLD) return 0;
+  return 1 - osaDistance(a, b) / maxLen;
 }
 function scoreNodes(graph, query) {
   const tokens = tokenize(query);
@@ -2606,9 +2851,25 @@ function scoreNodes(graph, query) {
   graph.forEachNode((id, attributes) => {
     const label = attributes.label ?? id;
     const haystack = `${label} ${id}`.toLowerCase();
+    const subtokens = new Set(subtokenize(`${label} ${id}`));
     let score = 0;
     for (const token of tokens) {
-      if (haystack.includes(token)) score += 1;
+      if (subtokens.has(token)) {
+        score += SUBTOKEN_MATCH_SCORE;
+        continue;
+      }
+      if (haystack.includes(token)) {
+        score += SUBSTRING_MATCH_SCORE;
+        continue;
+      }
+      if (token.length >= FUZZY_MIN_TOKEN_LEN) {
+        let best = 0;
+        for (const subtoken of subtokens) {
+          const similarity = fuzzySimilarity(token, subtoken);
+          if (similarity > best) best = similarity;
+        }
+        if (best >= FUZZY_THRESHOLD) score += best * FUZZY_MATCH_WEIGHT;
+      }
     }
     if (score > 0) matches.push({ id, label, score });
   });
@@ -2622,22 +2883,36 @@ function resolveNode(graph, query) {
 var DEFAULT_MAX_DEPTH = 2;
 var DEFAULT_MAX_SEEDS = 5;
 var DEFAULT_BUDGET = 40;
+var DEFAULT_TOKEN_BUDGET = 2e3;
+var NODES_PER_TOKEN = 1 / 10;
+function nodeTokenCost(graph, id) {
+  const attrs = graph.getNodeAttributes(id);
+  const label = attrs.label ?? id;
+  const sourceFile = attrs.sourceFile ?? "";
+  return Math.ceil((id.length * 2 + label.length + sourceFile.length + 24) / 4);
+}
 function queryGraph(graph, question, options = {}) {
   const maxDepth = options.maxDepth ?? DEFAULT_MAX_DEPTH;
   const maxSeeds = options.maxSeeds ?? DEFAULT_MAX_SEEDS;
-  const budget = options.budget ?? DEFAULT_BUDGET;
+  const tokenBudget = options.tokenBudget ?? DEFAULT_TOKEN_BUDGET;
+  const budget = options.budget ?? Math.max(DEFAULT_BUDGET, Math.ceil(tokenBudget * NODES_PER_TOKEN));
   const allMatches = scoreNodes(graph, question);
   const seeds = allMatches.length > 0 ? allMatches.slice(0, maxSeeds) : [];
   const visited = /* @__PURE__ */ new Map();
   const frontier = seeds.map((s) => ({ id: s.id, depth: 0 }));
-  for (const seed of seeds) visited.set(seed.id, 0);
-  while (frontier.length > 0 && visited.size < budget) {
+  let spentTokens = 0;
+  for (const seed of seeds) {
+    visited.set(seed.id, 0);
+    spentTokens += nodeTokenCost(graph, seed.id);
+  }
+  while (frontier.length > 0 && visited.size < budget && spentTokens < tokenBudget) {
     const current = options.dfs ? frontier.pop() : frontier.shift();
     if (current.depth >= maxDepth) continue;
     const neighbors = [...graph.neighbors(current.id)].sort((a, b) => a.localeCompare(b));
     for (const neighbor of neighbors) {
-      if (visited.has(neighbor) || visited.size >= budget) continue;
+      if (visited.has(neighbor) || visited.size >= budget || spentTokens >= tokenBudget) continue;
       visited.set(neighbor, current.depth + 1);
+      spentTokens += nodeTokenCost(graph, neighbor);
       frontier.push({ id: neighbor, depth: current.depth + 1 });
     }
   }
@@ -2665,7 +2940,30 @@ function queryGraph(graph, question, options = {}) {
   edges.sort(
     (a, b) => a.source.localeCompare(b.source) || a.target.localeCompare(b.target) || a.relation.localeCompare(b.relation)
   );
-  return { seeds, visited: visitedNodes, edges };
+  return enforceTokenBudget({ seeds, visited: visitedNodes, edges }, tokenBudget);
+}
+function enforceTokenBudget(result, tokenBudget) {
+  const cost = (value) => Math.ceil(JSON.stringify(value).length / 4);
+  const visited = [...result.visited];
+  let edges = [...result.edges];
+  let total = cost(result.seeds) + visited.reduce((s, n) => s + cost(n), 0) + edges.reduce((s, e) => s + cost(e), 0);
+  const seedIds = new Set(result.seeds.map((s) => s.id));
+  while (total > tokenBudget && visited.length > 0) {
+    const last = visited[visited.length - 1];
+    if (seedIds.has(last.id)) break;
+    visited.pop();
+    total -= cost(last);
+    const remaining = [];
+    for (const edge of edges) {
+      if (edge.source === last.id || edge.target === last.id) {
+        total -= cost(edge);
+      } else {
+        remaining.push(edge);
+      }
+    }
+    edges = remaining;
+  }
+  return { seeds: result.seeds, visited, edges };
 }
 function shortestPath(graph, fromQuery, toQuery) {
   const from = resolveNode(graph, fromQuery);
@@ -2691,25 +2989,25 @@ function shortestPath(graph, fromQuery, toQuery) {
   if (!visited.has(to.id)) {
     return { from, to, found: false, path: [], edges: [] };
   }
-  const path8 = [to.id];
+  const path11 = [to.id];
   let cursor = to.id;
   while (cursor !== from.id) {
     const prev = predecessor.get(cursor);
     if (!prev) break;
-    path8.unshift(prev);
+    path11.unshift(prev);
     cursor = prev;
   }
   const edges = [];
-  for (let i = 0; i < path8.length - 1; i++) {
-    const a = path8[i];
-    const b = path8[i + 1];
+  for (let i = 0; i < path11.length - 1; i++) {
+    const a = path11[i];
+    const b = path11[i + 1];
     const key = graph.edges(a, b)[0] ?? graph.edges(b, a)[0];
     if (key) {
       const attrs = graph.getEdgeAttributes(key);
       edges.push({ source: a, target: b, relation: String(attrs.relation), confidence: String(attrs.confidence) });
     }
   }
-  return { from, to, found: true, path: path8, edges };
+  return { from, to, found: true, path: path11, edges };
 }
 function explainNode(graph, query) {
   const match = resolveNode(graph, query);
@@ -2735,25 +3033,813 @@ function explainNode(graph, query) {
     incoming
   };
 }
+
+// src/impact.ts
+var DEPENDENCY_RELATIONS = /* @__PURE__ */ new Set([
+  "calls",
+  "imports",
+  "imports_from",
+  "inherits",
+  "implements",
+  "mixes_in",
+  "embeds",
+  "references",
+  "re_exports",
+  "method",
+  "contains"
+]);
+var DEFAULT_IMPACT_DEPTH = 3;
+var DEFAULT_IMPACT_LIMIT = 200;
+var CONFIDENCE_RANK2 = { EXTRACTED: 3, INFERRED: 2, AMBIGUOUS: 1 };
+function affectedBy(graph, nodeQuery, options = {}) {
+  const target = resolveNode(graph, nodeQuery);
+  if (!target) return null;
+  const maxDepth = options.maxDepth ?? DEFAULT_IMPACT_DEPTH;
+  const limit = options.limit ?? DEFAULT_IMPACT_LIMIT;
+  const affected = [];
+  const visited = /* @__PURE__ */ new Set([target.id]);
+  let frontier = [target.id];
+  let truncated = false;
+  for (let depth = 1; depth <= maxDepth && frontier.length > 0 && !truncated; depth++) {
+    const nextFrontier = /* @__PURE__ */ new Map();
+    for (const current of [...frontier].sort((a, b) => a.localeCompare(b))) {
+      graph.forEachInEdge(current, (_edge, edgeAttrs, source) => {
+        if (visited.has(source)) return;
+        const relation = edgeAttrs.relation;
+        if (!DEPENDENCY_RELATIONS.has(relation)) return;
+        const confidence = edgeAttrs.confidence;
+        const existing = nextFrontier.get(source);
+        if (existing && CONFIDENCE_RANK2[existing.via.confidence] >= CONFIDENCE_RANK2[confidence]) return;
+        const attrs = graph.getNodeAttributes(source);
+        nextFrontier.set(source, {
+          id: source,
+          label: attrs.label ?? source,
+          sourceFile: attrs.sourceFile ?? "",
+          sourceLocation: attrs.sourceLocation ?? "",
+          depth,
+          via: { relation, confidence, dependsOn: current }
+        });
+      });
+    }
+    const roundNodes = [...nextFrontier.values()].sort((a, b) => a.id.localeCompare(b.id));
+    for (const node of roundNodes) {
+      if (affected.length >= limit) {
+        truncated = true;
+        break;
+      }
+      visited.add(node.id);
+      affected.push(node);
+    }
+    frontier = roundNodes.filter((n) => visited.has(n.id)).map((n) => n.id);
+  }
+  const byConfidence = { EXTRACTED: 0, INFERRED: 0, AMBIGUOUS: 0 };
+  for (const node of affected) byConfidence[node.via.confidence] += 1;
+  return { target, affected, byConfidence, maxDepth, truncated };
+}
+
+// src/merge.ts
+var import_graphology4 = __toESM(require("graphology"), 1);
+var CONFIDENCE_RANK3 = { EXTRACTED: 3, INFERRED: 2, AMBIGUOUS: 1 };
+function strongerConfidence2(a, b) {
+  return CONFIDENCE_RANK3[a] >= CONFIDENCE_RANK3[b] ? a : b;
+}
+function isShared(id) {
+  return id.startsWith("external:") || id.startsWith("module:");
+}
+function namespaced(project, id) {
+  return isShared(id) ? id : `${project}/${id}`;
+}
+function mergeGraphs(entries) {
+  const names = entries.map((e) => e.name);
+  const duplicate = names.find((name, i) => names.indexOf(name) !== i);
+  if (duplicate !== void 0) {
+    throw new Error(`Duplicate project name in merge: "${duplicate}" \u2014 every entry needs a unique name.`);
+  }
+  const merged = new import_graphology4.default({ type: "directed", multi: true, allowSelfLoops: true });
+  const sorted = [...entries].sort((a, b) => a.name.localeCompare(b.name));
+  for (const { name, graph } of sorted) {
+    const nodeIds = [...graph.nodes()].sort((a, b) => a.localeCompare(b));
+    for (const id of nodeIds) {
+      const attrs = graph.getNodeAttributes(id);
+      const newId = namespaced(name, id);
+      if (merged.hasNode(newId)) {
+        merged.setNodeAttribute(newId, "project", "(shared)");
+        continue;
+      }
+      const sourceFile = attrs.sourceFile ?? "";
+      merged.addNode(newId, {
+        label: attrs.label ?? id,
+        sourceFile: isShared(id) || sourceFile === "" ? sourceFile : `${name}/${sourceFile}`,
+        sourceLocation: attrs.sourceLocation ?? "",
+        project: name
+      });
+    }
+    const edgeKeys = [...graph.edges()].sort((a, b) => a.localeCompare(b));
+    for (const edgeKey of edgeKeys) {
+      const attrs = graph.getEdgeAttributes(edgeKey);
+      const source = namespaced(name, graph.source(edgeKey));
+      const target = namespaced(name, graph.target(edgeKey));
+      const relation = String(attrs.relation);
+      const confidence = attrs.confidence;
+      const key = `${source}|${relation}|${target}`;
+      if (merged.hasEdge(key)) {
+        const existing = merged.getEdgeAttribute(key, "confidence");
+        merged.setEdgeAttribute(key, "confidence", strongerConfidence2(existing, confidence));
+        continue;
+      }
+      merged.addEdgeWithKey(key, source, target, { relation, confidence });
+    }
+  }
+  return merged;
+}
+
+// src/extractors/mysql.ts
+var schemaId = (schema) => `db:${schema}`;
+var tableId = (schema, table) => `db:${schema}::${table}`;
+var columnId = (schema, table, column) => `db:${schema}::${table}.${column}`;
+async function defaultQueryFn(dsn) {
+  const { connection } = validateDsn(dsn);
+  const mysql = await import("mysql2/promise");
+  const conn = await mysql.createConnection({
+    host: connection.host,
+    port: connection.port,
+    user: connection.user,
+    password: connection.password,
+    database: connection.database
+  });
+  return {
+    query: async (sql, params) => {
+      const [rows] = await conn.execute(sql, [...params]);
+      return rows;
+    },
+    close: () => conn.end()
+  };
+}
+async function extractMysql(dsn, queryFn) {
+  const { safeDisplay, connection } = validateDsn(dsn);
+  const schema = connection.database;
+  let query = queryFn;
+  let close;
+  if (!query) {
+    const live = await defaultQueryFn(dsn);
+    query = live.query;
+    close = live.close;
+  }
+  try {
+    const nodes = [];
+    const edges = [];
+    nodes.push({ id: schemaId(schema), label: schema, sourceFile: safeDisplay, sourceLocation: schema });
+    const tableRows = await query(
+      "SELECT TABLE_NAME, TABLE_TYPE FROM information_schema.TABLES WHERE TABLE_SCHEMA = ? ORDER BY TABLE_NAME",
+      [schema]
+    );
+    const tables = tableRows.map((row) => ({
+      name: String(row.TABLE_NAME),
+      isView: String(row.TABLE_TYPE).toUpperCase() === "VIEW"
+    }));
+    const tableNames = new Set(tables.map((t) => t.name));
+    for (const table of tables) {
+      nodes.push({
+        id: tableId(schema, table.name),
+        label: `${table.isView ? "view" : "table"} ${table.name}`,
+        sourceFile: safeDisplay,
+        sourceLocation: table.name
+      });
+      edges.push({
+        source: schemaId(schema),
+        target: tableId(schema, table.name),
+        relation: "contains",
+        confidence: "EXTRACTED"
+      });
+    }
+    const columnRows = await query(
+      "SELECT TABLE_NAME, COLUMN_NAME, COLUMN_TYPE FROM information_schema.COLUMNS WHERE TABLE_SCHEMA = ? ORDER BY TABLE_NAME, ORDINAL_POSITION",
+      [schema]
+    );
+    for (const row of columnRows) {
+      const table = String(row.TABLE_NAME);
+      const column = String(row.COLUMN_NAME);
+      if (!tableNames.has(table)) continue;
+      nodes.push({
+        id: columnId(schema, table, column),
+        label: `${table}.${column}: ${String(row.COLUMN_TYPE)}`,
+        sourceFile: safeDisplay,
+        sourceLocation: `${table}.${column}`
+      });
+      edges.push({
+        source: tableId(schema, table),
+        target: columnId(schema, table, column),
+        relation: "contains",
+        confidence: "EXTRACTED"
+      });
+    }
+    const fkRows = await query(
+      "SELECT TABLE_NAME, COLUMN_NAME, REFERENCED_TABLE_NAME FROM information_schema.KEY_COLUMN_USAGE WHERE TABLE_SCHEMA = ? AND REFERENCED_TABLE_NAME IS NOT NULL ORDER BY TABLE_NAME, COLUMN_NAME",
+      [schema]
+    );
+    for (const row of fkRows) {
+      const table = String(row.TABLE_NAME);
+      const column = String(row.COLUMN_NAME);
+      const referenced = String(row.REFERENCED_TABLE_NAME);
+      if (!tableNames.has(table) || !tableNames.has(referenced)) continue;
+      edges.push({
+        source: columnId(schema, table, column),
+        target: tableId(schema, referenced),
+        relation: "references",
+        confidence: "EXTRACTED"
+      });
+    }
+    const viewNames = tables.filter((t) => t.isView).map((t) => t.name);
+    if (viewNames.length > 0) {
+      await addViewEdges(query, schema, viewNames, tableNames, edges);
+    }
+    return { nodes, edges };
+  } finally {
+    await close?.();
+  }
+}
+async function addViewEdges(query, schema, viewNames, tableNames, edges) {
+  try {
+    const usageRows = await query(
+      "SELECT VIEW_NAME, TABLE_NAME FROM information_schema.VIEW_TABLE_USAGE WHERE VIEW_SCHEMA = ? AND TABLE_SCHEMA = ? ORDER BY VIEW_NAME, TABLE_NAME",
+      [schema, schema]
+    );
+    for (const row of usageRows) {
+      const view = String(row.VIEW_NAME);
+      const table = String(row.TABLE_NAME);
+      if (!tableNames.has(view) || !tableNames.has(table) || view === table) continue;
+      edges.push({
+        source: tableId(schema, view),
+        target: tableId(schema, table),
+        relation: "references",
+        confidence: "EXTRACTED"
+      });
+    }
+    return;
+  } catch {
+  }
+  const definitionRows = await query(
+    "SELECT TABLE_NAME, VIEW_DEFINITION FROM information_schema.VIEWS WHERE TABLE_SCHEMA = ? ORDER BY TABLE_NAME",
+    [schema]
+  );
+  for (const row of definitionRows) {
+    const view = String(row.TABLE_NAME);
+    if (!viewNames.includes(view)) continue;
+    const definition = String(row.VIEW_DEFINITION ?? "").toLowerCase();
+    for (const table of [...tableNames].sort((a, b) => a.localeCompare(b))) {
+      if (table === view) continue;
+      if (new RegExp(`\\b${table.toLowerCase()}\\b`).test(definition)) {
+        edges.push({
+          source: tableId(schema, view),
+          target: tableId(schema, table),
+          relation: "references",
+          confidence: "INFERRED"
+        });
+      }
+    }
+  }
+}
+
+// src/memory.ts
+var import_node_crypto4 = require("crypto");
+var fs14 = __toESM(require("fs/promises"), 1);
+var path9 = __toESM(require("path"), 1);
+var OUTCOMES = /* @__PURE__ */ new Set(["useful", "dead_end", "corrected"]);
+var TYPES = /* @__PURE__ */ new Set(["query", "path", "explain", "affected"]);
+function validateResult(value) {
+  if (!value.question) throw new Error("save-result requires --question");
+  if (!value.answer) throw new Error("save-result requires --answer");
+  if (!OUTCOMES.has(value.outcome)) {
+    throw new Error(`--outcome must be one of: useful, dead_end, corrected (got "${value.outcome}")`);
+  }
+  if (!TYPES.has(value.type)) {
+    throw new Error(`--type must be one of: query, path, explain, affected (got "${value.type}")`);
+  }
+  if (value.outcome === "corrected" && !value.correction) {
+    throw new Error("--outcome corrected requires --correction with what the right answer was");
+  }
+}
+async function saveResult(entry, memoryDir, now = /* @__PURE__ */ new Date()) {
+  validateResult(entry);
+  await fs14.mkdir(memoryDir, { recursive: true });
+  const saved = { ...entry, savedAt: now.toISOString() };
+  const hash = (0, import_node_crypto4.createHash)("sha256").update(JSON.stringify(saved)).digest("hex").slice(0, 8);
+  const stamp = saved.savedAt.replace(/[:.]/g, "-");
+  const filePath = path9.join(memoryDir, `result-${stamp}-${hash}.json`);
+  await fs14.writeFile(filePath, JSON.stringify(saved, null, 2), "utf-8");
+  return filePath;
+}
+async function loadResults(memoryDir) {
+  let files;
+  try {
+    files = (await fs14.readdir(memoryDir)).filter((f) => f.startsWith("result-") && f.endsWith(".json"));
+  } catch {
+    return [];
+  }
+  const results = [];
+  for (const file of files.sort((a, b) => a.localeCompare(b))) {
+    try {
+      const parsed = JSON.parse(await fs14.readFile(path9.join(memoryDir, file), "utf-8"));
+      if (parsed.question && parsed.savedAt) results.push(parsed);
+    } catch {
+    }
+  }
+  return results;
+}
+function renderLessons(results, options = {}) {
+  const halfLife = options.halfLifeDays ?? 30;
+  const now = options.now ?? /* @__PURE__ */ new Date();
+  const minCorroboration = options.minCorroboration ?? 2;
+  const weightOf = (savedAt) => {
+    const ageDays = Math.max(0, (now.getTime() - new Date(savedAt).getTime()) / 864e5);
+    return Math.pow(0.5, ageDays / halfLife);
+  };
+  const signals = /* @__PURE__ */ new Map();
+  const corrections = [];
+  for (const result of results) {
+    const weight = weightOf(result.savedAt);
+    for (const node of result.nodes ?? []) {
+      const signal = signals.get(node) ?? { useful: 0, deadEnd: 0, usefulCount: 0, deadEndCount: 0 };
+      if (result.outcome === "useful") {
+        signal.useful += weight;
+        signal.usefulCount++;
+      } else if (result.outcome === "dead_end") {
+        signal.deadEnd += weight;
+        signal.deadEndCount++;
+      }
+      signals.set(node, signal);
+    }
+    if (result.outcome === "corrected" && result.correction) {
+      corrections.push({ question: result.question, correction: result.correction, savedAt: result.savedAt });
+    }
+  }
+  const byScore = (kind) => [...signals.entries()].filter(([, s]) => kind === "useful" ? s.usefulCount >= minCorroboration : s.deadEndCount > 0).sort((a, b) => b[1][kind] - a[1][kind] || a[0].localeCompare(b[0])).slice(0, 10);
+  const lines = [
+    "# Graph lessons",
+    "",
+    `_Aggregated from ${results.length} saved result(s); signal half-life ${halfLife} day(s)._`,
+    "",
+    "## Nodes that keep answering",
+    ""
+  ];
+  const useful = byScore("useful");
+  if (useful.length === 0) {
+    lines.push(`(none yet with >= ${minCorroboration} corroborating results \u2014 keep saving results)`);
+  } else {
+    for (const [node, s] of useful) {
+      lines.push(`- **${node}** \u2014 score ${s.useful.toFixed(2)} across ${s.usefulCount} useful result(s)`);
+    }
+  }
+  lines.push("", "## Dead ends", "");
+  const deadEnds = byScore("deadEnd");
+  if (deadEnds.length === 0) {
+    lines.push("(none recorded)");
+  } else {
+    for (const [node, s] of deadEnds) {
+      lines.push(`- **${node}** \u2014 score ${s.deadEnd.toFixed(2)} across ${s.deadEndCount} dead-end result(s)`);
+    }
+  }
+  lines.push("", "## Corrections", "");
+  if (corrections.length === 0) {
+    lines.push("(none recorded)");
+  } else {
+    corrections.sort((a, b) => b.savedAt.localeCompare(a.savedAt));
+    for (const c of corrections.slice(0, 20)) {
+      lines.push(`- (${c.savedAt.slice(0, 10)}) Q: ${c.question}`);
+      lines.push(`  Right answer: ${c.correction}`);
+    }
+  }
+  lines.push("");
+  return lines.join("\n");
+}
+
+// src/context.ts
+var DEFAULT_CONTEXT_BUDGET = 4e3;
+var DEFAULT_MAX_SEEDS2 = 8;
+var DEFAULT_MAX_SNIPPET_LINES = 60;
+var NEIGHBOR_DECAY = 0.4;
+var tokensOf = (text) => Math.ceil(text.length / 4);
+function lineNumberOf(sourceLocation) {
+  const match = /^L(\d+)$/.exec(sourceLocation);
+  return match ? Number(match[1]) : null;
+}
+function isReadableFile(sourceFile) {
+  return sourceFile !== "" && !sourceFile.startsWith("<") && !sourceFile.includes("://");
+}
+function rankForTask(graph, task, maxSeeds = DEFAULT_MAX_SEEDS2) {
+  const seeds = scoreNodes(graph, task).slice(0, maxSeeds);
+  const ranked = /* @__PURE__ */ new Map();
+  for (const seed of seeds) {
+    ranked.set(seed.id, { id: seed.id, score: seed.score, reason: "matches the task" });
+  }
+  for (const seed of seeds) {
+    graph.forEachEdge(seed.id, (_edge, attrs, source, target) => {
+      const neighbor = source === seed.id ? target : source;
+      if (ranked.has(neighbor)) return;
+      const relation = String(attrs.relation);
+      const direction = source === seed.id ? `${relation} ->` : `<- ${relation}`;
+      ranked.set(neighbor, {
+        id: neighbor,
+        score: seed.score * NEIGHBOR_DECAY,
+        reason: `${direction} ${seed.label}`
+      });
+    });
+  }
+  return [...ranked.values()].sort((a, b) => b.score - a.score || a.id.localeCompare(b.id));
+}
+function snippetRange(startLine, fileLineCount, entityStartsInFile, maxLines) {
+  const nextStart = entityStartsInFile.find((l) => l > startLine);
+  const hardEnd = nextStart !== void 0 ? nextStart - 1 : fileLineCount;
+  return { start: startLine, end: Math.min(hardEnd, startLine + maxLines - 1) };
+}
+async function buildContextPack(graph, task, readFile13, options = {}) {
+  const tokenBudget = options.tokenBudget ?? DEFAULT_CONTEXT_BUDGET;
+  const maxSnippetLines = options.maxSnippetLines ?? DEFAULT_MAX_SNIPPET_LINES;
+  const ranked = rankForTask(graph, task, options.maxSeeds);
+  const entityStarts = /* @__PURE__ */ new Map();
+  graph.forEachNode((_id, attrs) => {
+    const file = attrs.sourceFile;
+    const line = lineNumberOf(attrs.sourceLocation ?? "");
+    if (file && line !== null) {
+      const starts = entityStarts.get(file) ?? [];
+      starts.push(line);
+      entityStarts.set(file, starts);
+    }
+  });
+  for (const starts of entityStarts.values()) starts.sort((a, b) => a - b);
+  const fileCache = /* @__PURE__ */ new Map();
+  const readLines = async (file) => {
+    const cached = fileCache.get(file);
+    if (cached !== void 0) return cached;
+    let lines;
+    try {
+      lines = (await readFile13(file)).split("\n");
+    } catch {
+      lines = null;
+    }
+    fileCache.set(file, lines);
+    return lines;
+  };
+  const snippets = [];
+  const overflow = [];
+  const coveredRanges = /* @__PURE__ */ new Map();
+  let tokens = 0;
+  for (const node of ranked) {
+    const attrs = graph.getNodeAttributes(node.id);
+    const file = attrs.sourceFile ?? "";
+    const startLine = lineNumberOf(attrs.sourceLocation ?? "");
+    if (!isReadableFile(file) || startLine === null) continue;
+    const lines = await readLines(file);
+    if (lines === null) continue;
+    const { start, end } = snippetRange(startLine, lines.length, entityStarts.get(file) ?? [], maxSnippetLines);
+    const covered = (coveredRanges.get(file) ?? []).some((r) => start >= r.start && end <= r.end);
+    if (covered) continue;
+    const code = lines.slice(start - 1, end).join("\n");
+    const cost = tokensOf(code) + 15;
+    if (tokens + cost > tokenBudget) {
+      overflow.push({ nodeId: node.id, file: `${file}:L${startLine}` });
+      continue;
+    }
+    tokens += cost;
+    snippets.push({
+      nodeId: node.id,
+      label: attrs.label ?? node.id,
+      file,
+      startLine: start,
+      endLine: end,
+      code,
+      reason: node.reason,
+      score: node.score
+    });
+    const ranges = coveredRanges.get(file) ?? [];
+    ranges.push({ start, end });
+    coveredRanges.set(file, ranges);
+  }
+  return { task, snippets, tokens, tokenBudget, overflow };
+}
+function renderContextPack(pack) {
+  const lines = [
+    `# Context pack: ${pack.task}`,
+    "",
+    `_~${pack.tokens} of ${pack.tokenBudget} token budget, ${pack.snippets.length} snippet(s)._`,
+    ""
+  ];
+  if (pack.snippets.length === 0) {
+    lines.push("No matching code found \u2014 try different keywords.");
+    return lines.join("\n");
+  }
+  for (const snippet of pack.snippets) {
+    lines.push(`## ${snippet.label} \u2014 \`${snippet.file}:L${snippet.startLine}-L${snippet.endLine}\``);
+    lines.push(`_${snippet.reason}_`);
+    lines.push("```");
+    lines.push(snippet.code);
+    lines.push("```");
+    lines.push("");
+  }
+  if (pack.overflow.length > 0) {
+    lines.push(`## Didn't fit the budget (${pack.overflow.length})`);
+    for (const item of pack.overflow.slice(0, 15)) {
+      lines.push(`- ${item.nodeId} (${item.file})`);
+    }
+    lines.push("");
+  }
+  return lines.join("\n");
+}
+
+// src/testmap.ts
+var TEST_FILE_PATTERNS = [
+  /(^|\/)tests?\//,
+  // tests/ or test/ directory
+  /(^|\/)__tests__\//,
+  /(^|\/)spec\//,
+  /\.test\.[cm]?[jt]sx?$/,
+  /\.spec\.[cm]?[jt]sx?$/,
+  /(^|\/)test_[^/]+\.py$/,
+  /_test\.py$/,
+  /_test\.go$/,
+  /Tests?\.(java|cs)$/,
+  /_spec\.rb$/,
+  /_test\.rb$/
+];
+function isTestFile(path11) {
+  return TEST_FILE_PATTERNS.some((p) => p.test(path11));
+}
+var TEST_REACH_DEPTH = 4;
+var TEST_REACH_LIMIT = 2e3;
+function selectionFromImpact(graph, targetIds, targetLabel) {
+  const best = /* @__PURE__ */ new Map();
+  let affectedNodeCount = 0;
+  for (const id of targetIds) {
+    const impact = affectedBy(graph, id, { maxDepth: TEST_REACH_DEPTH, limit: TEST_REACH_LIMIT });
+    if (!impact) continue;
+    affectedNodeCount += impact.affected.length;
+    for (const node of impact.affected) {
+      if (!isTestFile(node.sourceFile)) continue;
+      const existing = best.get(node.sourceFile);
+      if (!existing || node.depth < existing.depth) {
+        best.set(node.sourceFile, { depth: node.depth, via: node.via.dependsOn });
+      }
+    }
+  }
+  const testFiles = [...best.entries()].map(([file, info]) => ({ file, depth: info.depth, via: info.via })).sort((a, b) => a.depth - b.depth || a.file.localeCompare(b.file));
+  return { target: targetLabel, testFiles, affectedNodeCount };
+}
+function testsForNode(graph, nodeQuery) {
+  const match = resolveNode(graph, nodeQuery);
+  if (!match) return null;
+  return selectionFromImpact(graph, [match.id], match.id);
+}
+function testsForChangedFiles(graph, changedFiles) {
+  const fileIds = [];
+  const selfSelected = /* @__PURE__ */ new Map();
+  for (const file of changedFiles) {
+    if (isTestFile(file)) {
+      selfSelected.set(file, { depth: 0, via: "(changed directly)" });
+      continue;
+    }
+    if (graph.hasNode(file)) fileIds.push(file);
+  }
+  const selection = selectionFromImpact(graph, fileIds, changedFiles.join(", "));
+  for (const [file, info] of selfSelected) {
+    if (!selection.testFiles.some((t) => t.file === file)) {
+      selection.testFiles.push({ file, depth: info.depth, via: info.via });
+    }
+  }
+  selection.testFiles.sort((a, b) => a.depth - b.depth || a.file.localeCompare(b.file));
+  return selection;
+}
+
+// src/diff.ts
+var import_node_child_process = require("child_process");
+var fs15 = __toESM(require("fs/promises"), 1);
+var os = __toESM(require("os"), 1);
+var path10 = __toESM(require("path"), 1);
+var import_node_util = require("util");
+var execFileAsync = (0, import_node_util.promisify)(import_node_child_process.execFile);
+async function graphForDirectory(root) {
+  const manifest = collectFiles(root);
+  const extractions = [];
+  for (const relFile of manifest.files.code.sort((a, b) => a.localeCompare(b))) {
+    extractions.push(await extract(path10.join(root, relFile), relFile));
+  }
+  resolveCrossFileReferences(extractions);
+  return buildGraph(extractions);
+}
+async function checkoutRev(repoRoot, rev) {
+  const dest = await fs15.mkdtemp(path10.join(os.tmpdir(), `graphify-review-${rev.replace(/[^a-zA-Z0-9]/g, "_")}-`));
+  const { stdout } = await execFileAsync(
+    "git",
+    ["-C", repoRoot, "archive", "--format=tar", rev],
+    { encoding: "buffer", maxBuffer: 512 * 1024 * 1024 }
+  );
+  await new Promise((resolve5, reject) => {
+    const tar = (0, import_node_child_process.execFile)("tar", ["-x", "-C", dest], (error) => error ? reject(error) : resolve5());
+    tar.stdin?.end(stdout);
+  });
+  return dest;
+}
+function edgeSignature(graph, id) {
+  const signature = /* @__PURE__ */ new Set();
+  graph.forEachOutEdge(id, (_e, attrs, _s, target) => signature.add(`-> ${String(attrs.relation)} ${target}`));
+  graph.forEachInEdge(id, (_e, attrs, source) => signature.add(`<- ${String(attrs.relation)} ${source}`));
+  return signature;
+}
+function describeSymbol(graph, id) {
+  const attrs = graph.getNodeAttributes(id);
+  const impact = affectedBy(graph, id, { maxDepth: 3 });
+  const tests = testsForNode(graph, id);
+  return {
+    id,
+    label: attrs.label ?? id,
+    sourceFile: attrs.sourceFile ?? "",
+    blastRadius: impact?.affected.length ?? 0,
+    tests: tests?.testFiles.map((t) => t.file) ?? []
+  };
+}
+function entityIds(graph) {
+  const ids = /* @__PURE__ */ new Set();
+  graph.forEachNode((id) => {
+    if (id.includes("::")) ids.add(id);
+  });
+  return ids;
+}
+function diffGraphs(baseGraph, headGraph, base, head) {
+  const baseIds = entityIds(baseGraph);
+  const headIds = entityIds(headGraph);
+  const added = [];
+  const removed = [];
+  const rewired = [];
+  for (const id of [...headIds].sort((a, b) => a.localeCompare(b))) {
+    if (!baseIds.has(id)) {
+      added.push(describeSymbol(headGraph, id));
+      continue;
+    }
+    const before = edgeSignature(baseGraph, id);
+    const after = edgeSignature(headGraph, id);
+    const gained = [...after].filter((e) => !before.has(e)).sort((a, b) => a.localeCompare(b));
+    const lost = [...before].filter((e) => !after.has(e)).sort((a, b) => a.localeCompare(b));
+    if (gained.length > 0 || lost.length > 0) {
+      rewired.push({ ...describeSymbol(headGraph, id), gainedEdges: gained, lostEdges: lost });
+    }
+  }
+  for (const id of [...baseIds].sort((a, b) => a.localeCompare(b))) {
+    if (!headIds.has(id)) removed.push(describeSymbol(baseGraph, id));
+  }
+  return { base, head, added, removed, rewired };
+}
+async function reviewRevisions(repoRoot, base, head = "HEAD") {
+  const [baseDir, headDir] = await Promise.all([checkoutRev(repoRoot, base), checkoutRev(repoRoot, head)]);
+  try {
+    const [baseGraph, headGraph] = [await graphForDirectory(baseDir), await graphForDirectory(headDir)];
+    return diffGraphs(baseGraph, headGraph, base, head);
+  } finally {
+    await Promise.all([
+      fs15.rm(baseDir, { recursive: true, force: true }),
+      fs15.rm(headDir, { recursive: true, force: true })
+    ]);
+  }
+}
+function renderReview(diff) {
+  const lines = [
+    `# Structural review: ${diff.base}..${diff.head}`,
+    "",
+    `${diff.added.length} symbol(s) added, ${diff.removed.length} removed, ${diff.rewired.length} rewired.`,
+    ""
+  ];
+  const section = (title, symbols) => {
+    lines.push(`## ${title} (${symbols.length})`, "");
+    if (symbols.length === 0) {
+      lines.push("(none)", "");
+      return;
+    }
+    for (const s of symbols) {
+      const tests = s.tests.length > 0 ? ` | tests: ${s.tests.join(", ")}` : " | tests: none found";
+      lines.push(`- **${s.label}** (${s.sourceFile}) \u2014 blast radius ${s.blastRadius}${tests}`);
+      const r = s;
+      if (r.gainedEdges) {
+        for (const e of r.gainedEdges.slice(0, 5)) lines.push(`  - gained: ${e}`);
+        for (const e of r.lostEdges.slice(0, 5)) lines.push(`  - lost: ${e}`);
+      }
+    }
+    lines.push("");
+  };
+  section("Removed \u2014 check every caller", diff.removed);
+  section("Rewired \u2014 dependencies changed", diff.rewired);
+  section("Added", diff.added);
+  const allTests = /* @__PURE__ */ new Set();
+  for (const s of [...diff.removed, ...diff.rewired, ...diff.added]) {
+    for (const t of s.tests) allTests.add(t);
+  }
+  lines.push(`## Suggested test run (${allTests.size} file(s))`, "");
+  for (const t of [...allTests].sort((a, b) => a.localeCompare(b))) lines.push(`- ${t}`);
+  lines.push("");
+  return lines.join("\n");
+}
+
+// src/check.ts
+var DEPENDENCY_RELATIONS2 = /* @__PURE__ */ new Set([
+  "calls",
+  "imports",
+  "imports_from",
+  "inherits",
+  "implements",
+  "mixes_in",
+  "embeds",
+  "re_exports"
+]);
+function globToRegExp(glob) {
+  const escaped = glob.replace(/[.+^${}()|[\]\\]/g, "\\$&");
+  const pattern = escaped.replace(
+    /\*\*|\*|\?/g,
+    (token) => token === "**" ? ".*" : token === "*" ? "[^/]*" : "[^/]"
+  );
+  return new RegExp(`^${pattern}$`);
+}
+function validateRules(value) {
+  const config = value;
+  if (!config || !Array.isArray(config.rules)) {
+    throw new Error('Rules file must be JSON of shape { "rules": [{ "name", "from", "disallow": [...] }] }');
+  }
+  for (const rule of config.rules) {
+    if (!rule.name || typeof rule.from !== "string" || !Array.isArray(rule.disallow)) {
+      throw new Error(`Malformed rule "${rule.name ?? "(unnamed)"}" \u2014 need name, from, and disallow[].`);
+    }
+  }
+  return config;
+}
+function checkRules(graph, config) {
+  const compiled = config.rules.map((rule) => ({
+    rule,
+    from: globToRegExp(rule.from),
+    disallow: rule.disallow.map(globToRegExp)
+  }));
+  const violations = [];
+  graph.forEachEdge((_edge, attrs, source, target) => {
+    const relation = String(attrs.relation);
+    if (!DEPENDENCY_RELATIONS2.has(relation)) return;
+    const fromFile = graph.getNodeAttribute(source, "sourceFile") ?? "";
+    const toFile = graph.getNodeAttribute(target, "sourceFile") ?? "";
+    if (!fromFile || !toFile || fromFile === toFile) return;
+    for (const { rule, from, disallow } of compiled) {
+      if (!from.test(fromFile)) continue;
+      if (disallow.some((d) => d.test(toFile))) {
+        violations.push({
+          rule: rule.name,
+          reason: rule.reason,
+          fromFile,
+          fromNode: source,
+          toFile,
+          toNode: target,
+          relation
+        });
+      }
+    }
+  });
+  violations.sort(
+    (a, b) => a.rule.localeCompare(b.rule) || a.fromFile.localeCompare(b.fromFile) || a.toFile.localeCompare(b.toFile) || a.fromNode.localeCompare(b.fromNode)
+  );
+  return violations;
+}
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   EXTRACTOR_REGISTRY,
+  ExtractionCache,
   ExtractionResultSchema,
   ExtractionValidationError,
+  affectedBy,
   analyze,
+  buildContextPack,
   buildGraph,
+  checkRules,
   cluster,
   collectFiles,
+  diffGraphs,
   explainNode,
   exportGraph,
   extract,
+  extractMysql,
+  globToRegExp,
+  graphForDirectory,
+  isTestFile,
   loadGraph,
+  loadResults,
+  mergeGraphs,
   queryGraph,
+  rankForTask,
+  renderContextPack,
+  renderLessons,
   renderReport,
+  renderReview,
+  resolveCrossFileReferences,
   resolveNode,
+  reviewRevisions,
   runPipeline,
+  saveResult,
   scoreNodes,
   shortestPath,
-  validateExtraction
+  testsForChangedFiles,
+  testsForNode,
+  validateExtraction,
+  validateRules
 });
 //# sourceMappingURL=index.cjs.map