@ngommans/codefocus 0.1.0

package/dist/graph-DZNBEATA.js

@@ -0,0 +1,189 @@
+#!/usr/bin/env node
+import {
+  resolveRoot
+} from "./chunk-7RYHZOYF.js";
+import {
+  IndexDatabase
+} from "./chunk-Q6DOBQ4F.js";
+
+// src/commands/graph.ts
+import { createRequire } from "module";
+import { resolve } from "path";
+import { existsSync } from "fs";
+var require2 = createRequire(import.meta.url);
+var { DirectedGraph } = require2("graphology");
+function isFilePath(target) {
+  return target.includes("/") || target.includes("\\") || /\.\w+$/.test(target);
+}
+function renderTree(heading, nodes) {
+  const lines = [heading];
+  for (let i = 0; i < nodes.length; i++) {
+    const isLast = i === nodes.length - 1;
+    const prefix = isLast ? "\u2514\u2500\u2500 " : "\u251C\u2500\u2500 ";
+    lines.push(`${prefix}${nodes[i].label}`);
+    if (nodes[i].detail) {
+      const cont = isLast ? "    " : "\u2502   ";
+      lines.push(`${cont}${nodes[i].detail}`);
+    }
+  }
+  return lines.join("\n");
+}
+function buildFileGraph(db) {
+  const graph = new DirectedGraph();
+  for (const file of db.getAllFiles()) {
+    graph.addNode(file.path);
+  }
+  for (const edge of db.getFileImportEdges()) {
+    const key = `${edge.source_file}->${edge.target_file}`;
+    if (graph.hasEdge(key)) {
+      const existing = graph.getEdgeAttributes(key);
+      graph.setEdgeAttribute(
+        key,
+        "specifiers",
+        `${existing.specifiers}, ${edge.specifiers}`
+      );
+    } else {
+      graph.addEdgeWithKey(key, edge.source_file, edge.target_file, {
+        specifiers: edge.specifiers
+      });
+    }
+  }
+  return graph;
+}
+function showFileGraph(db, target, direction) {
+  const graph = buildFileGraph(db);
+  if (!graph.hasNode(target)) {
+    console.error(`Error: file "${target}" not found in the index`);
+    process.exitCode = 1;
+    return;
+  }
+  const sections = [];
+  if (direction === "outgoing" || direction === "both") {
+    const outEdges = [];
+    graph.forEachOutEdge(
+      target,
+      (_edge, attrs, _src, tgt) => {
+        outEdges.push({ label: tgt, detail: `imports: ${attrs.specifiers}` });
+      }
+    );
+    if (outEdges.length > 0) {
+      sections.push(renderTree("Dependencies (outgoing):", outEdges));
+    } else {
+      sections.push("Dependencies (outgoing): (none)");
+    }
+  }
+  if (direction === "incoming" || direction === "both") {
+    const inEdges = [];
+    graph.forEachInEdge(
+      target,
+      (_edge, attrs, src) => {
+        inEdges.push({ label: src, detail: `imports: ${attrs.specifiers}` });
+      }
+    );
+    if (inEdges.length > 0) {
+      sections.push(renderTree("Dependents (incoming):", inEdges));
+    } else {
+      sections.push("Dependents (incoming): (none)");
+    }
+  }
+  console.log(`
+${target}
+`);
+  console.log(sections.join("\n\n"));
+}
+function showSymbolGraph(db, target, direction) {
+  const symbols = db.findSymbolsByName(target);
+  const exactMatch = symbols.find((s) => s.name === target);
+  const sym = exactMatch ?? symbols[0];
+  if (!sym || !sym.id) {
+    console.error(`Error: symbol "${target}" not found in the index`);
+    process.exitCode = 1;
+    return;
+  }
+  const heading = `${sym.name} (${sym.kind}) \u2014 ${sym.file_path}:${sym.start_line}`;
+  const sections = [];
+  if (direction === "outgoing" || direction === "both") {
+    const refs = db.getOutgoingReferences(sym.id);
+    const outNodes = refs.map((r) => ({
+      label: `${r.target_name} (${r.target_kind}) \u2014 ${r.target_file}:${r.target_line}`,
+      detail: `ref: ${r.ref_type}`
+    }));
+    if (outNodes.length > 0) {
+      sections.push(renderTree("Dependencies (outgoing):", outNodes));
+    } else {
+      sections.push("Dependencies (outgoing): (none)");
+    }
+  }
+  if (direction === "incoming" || direction === "both") {
+    const refs = db.getIncomingReferences(sym.id);
+    const inNodes = refs.map((r) => ({
+      label: `${r.source_name} (${r.source_kind}) \u2014 ${r.source_file}:${r.source_line}`,
+      detail: `ref: ${r.ref_type}`
+    }));
+    if (inNodes.length > 0) {
+      sections.push(renderTree("Dependents (incoming):", inNodes));
+    } else {
+      sections.push("Dependents (incoming): (none)");
+    }
+  }
+  console.log(`
+${heading}
+`);
+  console.log(sections.join("\n\n"));
+}
+async function runGraph(positional, flags) {
+  if (flags.help) {
+    console.log(`codefocus graph \u2014 Show dependency graph
+
+Usage: codefocus graph <file-or-symbol> [options]
+
+Options:
+  --direction <dir>  Graph direction: both, incoming, outgoing (default: both)
+  --root <path>      Root directory of indexed project (default: auto-detect)
+  --help             Show this help message
+
+Examples:
+  codefocus graph src/cli.ts
+  codefocus graph src/cli.ts --direction outgoing
+  codefocus graph Calculator --direction incoming`);
+    return;
+  }
+  const target = positional[0];
+  if (!target) {
+    console.error("Error: graph requires a file path or symbol name");
+    process.exitCode = 2;
+    return;
+  }
+  const direction = flags.direction || "both";
+  if (!["both", "incoming", "outgoing"].includes(direction)) {
+    console.error(
+      `Error: invalid direction "${direction}". Use both, incoming, or outgoing`
+    );
+    process.exitCode = 2;
+    return;
+  }
+  const root = resolveRoot(flags.root);
+  const dbPath = resolve(root, ".codefocus", "index.db");
+  if (!existsSync(dbPath)) {
+    console.error(
+      `Error: no index found at ${dbPath}
+Run 'codefocus index --root ${root}' first.`
+    );
+    process.exitCode = 1;
+    return;
+  }
+  const db = new IndexDatabase(dbPath);
+  try {
+    if (isFilePath(target)) {
+      showFileGraph(db, target, direction);
+    } else {
+      showSymbolGraph(db, target, direction);
+    }
+  } finally {
+    db.close();
+  }
+}
+export {
+  runGraph
+};
+//# sourceMappingURL=graph-DZNBEATA.js.map

package/dist/graph-DZNBEATA.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/commands/graph.ts"],"sourcesContent":["import { createRequire } from \"node:module\";\nimport { resolve } from \"node:path\";\nimport { existsSync } from \"node:fs\";\nimport { IndexDatabase } from \"../db.js\";\nimport { resolveRoot } from \"../root.js\";\n\nconst require = createRequire(import.meta.url);\nconst { DirectedGraph } = require(\"graphology\");\n\ntype Direction = \"both\" | \"incoming\" | \"outgoing\";\n\n// ── helpers ────────────────────────────────────────────────────────────\n\n/** Determine whether the target string looks like a file path. */\nfunction isFilePath(target: string): boolean {\n  return (\n    target.includes(\"/\") || target.includes(\"\\\\\") || /\\.\\w+$/.test(target)\n  );\n}\n\n// ── tree-rendering helpers ─────────────────────────────────────────────\n\ninterface TreeNode {\n  label: string;\n  detail?: string;\n}\n\nfunction renderTree(heading: string, nodes: TreeNode[]): string {\n  const lines: string[] = [heading];\n  for (let i = 0; i < nodes.length; i++) {\n    const isLast = i === nodes.length - 1;\n    const prefix = isLast ? \"└── \" : \"├── \";\n    lines.push(`${prefix}${nodes[i].label}`);\n    if (nodes[i].detail) {\n      const cont = isLast ? \"    \" : \"│   \";\n      lines.push(`${cont}${nodes[i].detail}`);\n    }\n  }\n  return lines.join(\"\\n\");\n}\n\n// ── file-level graph ───────────────────────────────────────────────────\n\nfunction buildFileGraph(\n  db: IndexDatabase,\n): InstanceType<typeof DirectedGraph> {\n  const graph = new DirectedGraph();\n\n  for (const file of db.getAllFiles()) {\n    graph.addNode(file.path);\n  }\n\n  for (const edge of db.getFileImportEdges()) {\n    const key = `${edge.source_file}->${edge.target_file}`;\n    if (graph.hasEdge(key)) {\n      const existing = graph.getEdgeAttributes(key);\n      graph.setEdgeAttribute(\n        key,\n        \"specifiers\",\n        `${existing.specifiers}, ${edge.specifiers}`,\n      );\n    } else {\n      graph.addEdgeWithKey(key, edge.source_file, edge.target_file, {\n        specifiers: edge.specifiers,\n      });\n    }\n  }\n\n  return graph;\n}\n\nfunction showFileGraph(\n  db: IndexDatabase,\n  target: string,\n  direction: Direction,\n): void {\n  const graph = buildFileGraph(db);\n\n  if (!graph.hasNode(target)) {\n    console.error(`Error: file \"${target}\" not found in the index`);\n    process.exitCode = 1;\n    return;\n  }\n\n  const sections: string[] = [];\n\n  if (direction === \"outgoing\" || direction === \"both\") {\n    const outEdges: TreeNode[] = [];\n    graph.forEachOutEdge(\n      target,\n      (\n        _edge: string,\n        attrs: { specifiers: string },\n        _src: string,\n        tgt: string,\n      ) => {\n        outEdges.push({ label: tgt, detail: `imports: ${attrs.specifiers}` });\n      },\n    );\n    if (outEdges.length > 0) {\n      sections.push(renderTree(\"Dependencies (outgoing):\", outEdges));\n    } else {\n      sections.push(\"Dependencies (outgoing): (none)\");\n    }\n  }\n\n  if (direction === \"incoming\" || direction === \"both\") {\n    const inEdges: TreeNode[] = [];\n    graph.forEachInEdge(\n      target,\n      (\n        _edge: string,\n        attrs: { specifiers: string },\n        src: string,\n      ) => {\n        inEdges.push({ label: src, detail: `imports: ${attrs.specifiers}` });\n      },\n    );\n    if (inEdges.length > 0) {\n      sections.push(renderTree(\"Dependents (incoming):\", inEdges));\n    } else {\n      sections.push(\"Dependents (incoming): (none)\");\n    }\n  }\n\n  console.log(`\\n${target}\\n`);\n  console.log(sections.join(\"\\n\\n\"));\n}\n\n// ── symbol-level graph ─────────────────────────────────────────────────\n\nfunction showSymbolGraph(\n  db: IndexDatabase,\n  target: string,\n  direction: Direction,\n): void {\n  const symbols = db.findSymbolsByName(target);\n  const exactMatch = symbols.find((s) => s.name === target);\n  const sym = exactMatch ?? symbols[0];\n\n  if (!sym || !sym.id) {\n    console.error(`Error: symbol \"${target}\" not found in the index`);\n    process.exitCode = 1;\n    return;\n  }\n\n  const heading = `${sym.name} (${sym.kind}) — ${sym.file_path}:${sym.start_line}`;\n  const sections: string[] = [];\n\n  if (direction === \"outgoing\" || direction === \"both\") {\n    const refs = db.getOutgoingReferences(sym.id);\n    const outNodes: TreeNode[] = refs.map((r) => ({\n      label: `${r.target_name} (${r.target_kind}) — ${r.target_file}:${r.target_line}`,\n      detail: `ref: ${r.ref_type}`,\n    }));\n    if (outNodes.length > 0) {\n      sections.push(renderTree(\"Dependencies (outgoing):\", outNodes));\n    } else {\n      sections.push(\"Dependencies (outgoing): (none)\");\n    }\n  }\n\n  if (direction === \"incoming\" || direction === \"both\") {\n    const refs = db.getIncomingReferences(sym.id);\n    const inNodes: TreeNode[] = refs.map((r) => ({\n      label: `${r.source_name} (${r.source_kind}) — ${r.source_file}:${r.source_line}`,\n      detail: `ref: ${r.ref_type}`,\n    }));\n    if (inNodes.length > 0) {\n      sections.push(renderTree(\"Dependents (incoming):\", inNodes));\n    } else {\n      sections.push(\"Dependents (incoming): (none)\");\n    }\n  }\n\n  console.log(`\\n${heading}\\n`);\n  console.log(sections.join(\"\\n\\n\"));\n}\n\n// ── command entry point ────────────────────────────────────────────────\n\nexport async function runGraph(\n  positional: string[],\n  flags: Record<string, string | boolean>,\n): Promise<void> {\n  if (flags.help) {\n    console.log(`codefocus graph — Show dependency graph\n\nUsage: codefocus graph <file-or-symbol> [options]\n\nOptions:\n  --direction <dir>  Graph direction: both, incoming, outgoing (default: both)\n  --root <path>      Root directory of indexed project (default: auto-detect)\n  --help             Show this help message\n\nExamples:\n  codefocus graph src/cli.ts\n  codefocus graph src/cli.ts --direction outgoing\n  codefocus graph Calculator --direction incoming`);\n    return;\n  }\n\n  const target = positional[0];\n  if (!target) {\n    console.error(\"Error: graph requires a file path or symbol name\");\n    process.exitCode = 2;\n    return;\n  }\n\n  const direction = (flags.direction as Direction) || \"both\";\n  if (![\"both\", \"incoming\", \"outgoing\"].includes(direction)) {\n    console.error(\n      `Error: invalid direction \"${direction}\". Use both, incoming, or outgoing`,\n    );\n    process.exitCode = 2;\n    return;\n  }\n\n  const root = resolveRoot(flags.root);\n  const dbPath = resolve(root, \".codefocus\", \"index.db\");\n\n  if (!existsSync(dbPath)) {\n    console.error(\n      `Error: no index found at ${dbPath}\\nRun 'codefocus index --root ${root}' first.`,\n    );\n    process.exitCode = 1;\n    return;\n  }\n\n  const db = new IndexDatabase(dbPath);\n  try {\n    if (isFilePath(target)) {\n      showFileGraph(db, target, direction);\n    } else {\n      showSymbolGraph(db, target, direction);\n    }\n  } finally {\n    db.close();\n  }\n}\n"],"mappings":";;;;;;;;;AAAA,SAAS,qBAAqB;AAC9B,SAAS,eAAe;AACxB,SAAS,kBAAkB;AAI3B,IAAMA,WAAU,cAAc,YAAY,GAAG;AAC7C,IAAM,EAAE,cAAc,IAAIA,SAAQ,YAAY;AAO9C,SAAS,WAAW,QAAyB;AAC3C,SACE,OAAO,SAAS,GAAG,KAAK,OAAO,SAAS,IAAI,KAAK,SAAS,KAAK,MAAM;AAEzE;AASA,SAAS,WAAW,SAAiB,OAA2B;AAC9D,QAAM,QAAkB,CAAC,OAAO;AAChC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,SAAS,MAAM,MAAM,SAAS;AACpC,UAAM,SAAS,SAAS,wBAAS;AACjC,UAAM,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC,EAAE,KAAK,EAAE;AACvC,QAAI,MAAM,CAAC,EAAE,QAAQ;AACnB,YAAM,OAAO,SAAS,SAAS;AAC/B,YAAM,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC,EAAE,MAAM,EAAE;AAAA,IACxC;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAIA,SAAS,eACP,IACoC;AACpC,QAAM,QAAQ,IAAI,cAAc;AAEhC,aAAW,QAAQ,GAAG,YAAY,GAAG;AACnC,UAAM,QAAQ,KAAK,IAAI;AAAA,EACzB;AAEA,aAAW,QAAQ,GAAG,mBAAmB,GAAG;AAC1C,UAAM,MAAM,GAAG,KAAK,WAAW,KAAK,KAAK,WAAW;AACpD,QAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,YAAM,WAAW,MAAM,kBAAkB,GAAG;AAC5C,YAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA,GAAG,SAAS,UAAU,KAAK,KAAK,UAAU;AAAA,MAC5C;AAAA,IACF,OAAO;AACL,YAAM,eAAe,KAAK,KAAK,aAAa,KAAK,aAAa;AAAA,QAC5D,YAAY,KAAK;AAAA,MACnB,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,cACP,IACA,QACA,WACM;AACN,QAAM,QAAQ,eAAe,EAAE;AAE/B,MAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,YAAQ,MAAM,gBAAgB,MAAM,0BAA0B;AAC9D,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,WAAqB,CAAC;AAE5B,MAAI,cAAc,cAAc,cAAc,QAAQ;AACpD,UAAM,WAAuB,CAAC;AAC9B,UAAM;AAAA,MACJ;AAAA,MACA,CACE,OACA,OACA,MACA,QACG;AACH,iBAAS,KAAK,EAAE,OAAO,KAAK,QAAQ,YAAY,MAAM,UAAU,GAAG,CAAC;AAAA,MACtE;AAAA,IACF;AACA,QAAI,SAAS,SAAS,GAAG;AACvB,eAAS,KAAK,WAAW,4BAA4B,QAAQ,CAAC;AAAA,IAChE,OAAO;AACL,eAAS,KAAK,iCAAiC;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,cAAc,cAAc,cAAc,QAAQ;AACpD,UAAM,UAAsB,CAAC;AAC7B,UAAM;AAAA,MACJ;AAAA,MACA,CACE,OACA,OACA,QACG;AACH,gBAAQ,KAAK,EAAE,OAAO,KAAK,QAAQ,YAAY,MAAM,UAAU,GAAG,CAAC;AAAA,MACrE;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,GAAG;AACtB,eAAS,KAAK,WAAW,0BAA0B,OAAO,CAAC;AAAA,IAC7D,OAAO;AACL,eAAS,KAAK,+BAA+B;AAAA,IAC/C;AAAA,EACF;AAEA,UAAQ,IAAI;AAAA,EAAK,MAAM;AAAA,CAAI;AAC3B,UAAQ,IAAI,SAAS,KAAK,MAAM,CAAC;AACnC;AAIA,SAAS,gBACP,IACA,QACA,WACM;AACN,QAAM,UAAU,GAAG,kBAAkB,MAAM;AAC3C,QAAM,aAAa,QAAQ,KAAK,CAAC,MAAM,EAAE,SAAS,MAAM;AACxD,QAAM,MAAM,cAAc,QAAQ,CAAC;AAEnC,MAAI,CAAC,OAAO,CAAC,IAAI,IAAI;AACnB,YAAQ,MAAM,kBAAkB,MAAM,0BAA0B;AAChE,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,UAAU,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,YAAO,IAAI,SAAS,IAAI,IAAI,UAAU;AAC9E,QAAM,WAAqB,CAAC;AAE5B,MAAI,cAAc,cAAc,cAAc,QAAQ;AACpD,UAAM,OAAO,GAAG,sBAAsB,IAAI,EAAE;AAC5C,UAAM,WAAuB,KAAK,IAAI,CAAC,OAAO;AAAA,MAC5C,OAAO,GAAG,EAAE,WAAW,KAAK,EAAE,WAAW,YAAO,EAAE,WAAW,IAAI,EAAE,WAAW;AAAA,MAC9E,QAAQ,QAAQ,EAAE,QAAQ;AAAA,IAC5B,EAAE;AACF,QAAI,SAAS,SAAS,GAAG;AACvB,eAAS,KAAK,WAAW,4BAA4B,QAAQ,CAAC;AAAA,IAChE,OAAO;AACL,eAAS,KAAK,iCAAiC;AAAA,IACjD;AAAA,EACF;AAEA,MAAI,cAAc,cAAc,cAAc,QAAQ;AACpD,UAAM,OAAO,GAAG,sBAAsB,IAAI,EAAE;AAC5C,UAAM,UAAsB,KAAK,IAAI,CAAC,OAAO;AAAA,MAC3C,OAAO,GAAG,EAAE,WAAW,KAAK,EAAE,WAAW,YAAO,EAAE,WAAW,IAAI,EAAE,WAAW;AAAA,MAC9E,QAAQ,QAAQ,EAAE,QAAQ;AAAA,IAC5B,EAAE;AACF,QAAI,QAAQ,SAAS,GAAG;AACtB,eAAS,KAAK,WAAW,0BAA0B,OAAO,CAAC;AAAA,IAC7D,OAAO;AACL,eAAS,KAAK,+BAA+B;AAAA,IAC/C;AAAA,EACF;AAEA,UAAQ,IAAI;AAAA,EAAK,OAAO;AAAA,CAAI;AAC5B,UAAQ,IAAI,SAAS,KAAK,MAAM,CAAC;AACnC;AAIA,eAAsB,SACpB,YACA,OACe;AACf,MAAI,MAAM,MAAM;AACd,YAAQ,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kDAYkC;AAC9C;AAAA,EACF;AAEA,QAAM,SAAS,WAAW,CAAC;AAC3B,MAAI,CAAC,QAAQ;AACX,YAAQ,MAAM,kDAAkD;AAChE,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,YAAa,MAAM,aAA2B;AACpD,MAAI,CAAC,CAAC,QAAQ,YAAY,UAAU,EAAE,SAAS,SAAS,GAAG;AACzD,YAAQ;AAAA,MACN,6BAA6B,SAAS;AAAA,IACxC;AACA,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,OAAO,YAAY,MAAM,IAAI;AACnC,QAAM,SAAS,QAAQ,MAAM,cAAc,UAAU;AAErD,MAAI,CAAC,WAAW,MAAM,GAAG;AACvB,YAAQ;AAAA,MACN,4BAA4B,MAAM;AAAA,8BAAiC,IAAI;AAAA,IACzE;AACA,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,KAAK,IAAI,cAAc,MAAM;AACnC,MAAI;AACF,QAAI,WAAW,MAAM,GAAG;AACtB,oBAAc,IAAI,QAAQ,SAAS;AAAA,IACrC,OAAO;AACL,sBAAgB,IAAI,QAAQ,SAAS;AAAA,IACvC;AAAA,EACF,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;","names":["require"]}

package/dist/map-6WOMDLCP.js

@@ -0,0 +1,131 @@
+#!/usr/bin/env node
+import {
+  resolveRoot
+} from "./chunk-7RYHZOYF.js";
+import {
+  IndexDatabase
+} from "./chunk-Q6DOBQ4F.js";
+
+// src/commands/map.ts
+import { createRequire } from "module";
+import { resolve } from "path";
+import { existsSync } from "fs";
+var require2 = createRequire(import.meta.url);
+var { DirectedGraph } = require2("graphology");
+var pagerank = require2("graphology-metrics/centrality/pagerank");
+var { getEncoding } = require2("js-tiktoken");
+function rankFilesByPagerank(db) {
+  const graph = new DirectedGraph();
+  for (const file of db.getAllFiles()) {
+    graph.addNode(file.path);
+  }
+  for (const edge of db.getFileImportEdges()) {
+    const key = `${edge.source_file}->${edge.target_file}`;
+    if (!graph.hasEdge(key)) {
+      graph.addEdgeWithKey(key, edge.source_file, edge.target_file);
+    }
+  }
+  const ranks = graph.order > 0 ? pagerank(graph, { getEdgeWeight: null }) : {};
+  return new Map(Object.entries(ranks));
+}
+function renderFileBlock(filePath, db) {
+  const symbols = db.getSymbolsByFile(filePath);
+  symbols.sort((a, b) => a.start_line - b.start_line);
+  const lines = [filePath];
+  for (const sym of symbols) {
+    if (sym.kind === "variable" && !sym.signature) continue;
+    const label = sym.signature ?? `${sym.kind} ${sym.name}`;
+    lines.push(`  ${label}`);
+  }
+  return lines.join("\n");
+}
+async function runMap(positional, flags) {
+  if (flags.help) {
+    console.log(`codefocus map \u2014 High-level codebase overview
+
+Usage: codefocus map [options]
+
+Options:
+  --budget <tokens>  Token budget for output (default: 2000)
+  --root <path>      Root directory of indexed project (default: auto-detect)
+  --help             Show this help message
+
+Examples:
+  codefocus map
+  codefocus map --budget 4000
+  codefocus map --root ./my-project`);
+    return;
+  }
+  const budget = parseInt(String(flags.budget || "2000"), 10);
+  if (isNaN(budget) || budget <= 0) {
+    console.error("Error: --budget must be a positive integer");
+    process.exitCode = 2;
+    return;
+  }
+  const root = resolveRoot(flags.root);
+  const dbPath = resolve(root, ".codefocus", "index.db");
+  if (!existsSync(dbPath)) {
+    console.error(
+      `Error: no index found at ${dbPath}
+Run 'codefocus index --root ${root}' first.`
+    );
+    process.exitCode = 1;
+    return;
+  }
+  const db = new IndexDatabase(dbPath);
+  try {
+    const files = db.getAllFiles();
+    if (files.length === 0) {
+      console.log("[map] Index is empty \u2014 no files to map.");
+      return;
+    }
+    const ranks = rankFilesByPagerank(db);
+    const rankedFiles = files.map((f) => ({ path: f.path, rank: ranks.get(f.path) ?? 0 })).sort((a, b) => b.rank - a.rank || a.path.localeCompare(b.path));
+    const enc = getEncoding("cl100k_base");
+    const blocks = [];
+    let tokenCount = 0;
+    let truncated = false;
+    for (const file of rankedFiles) {
+      const block = renderFileBlock(file.path, db);
+      const blockTokens = enc.encode(block).length;
+      if (tokenCount + blockTokens <= budget) {
+        blocks.push(block);
+        tokenCount += blockTokens;
+        continue;
+      }
+      const blockLines = block.split("\n");
+      let partial = blockLines[0];
+      let partialTokens = enc.encode(partial).length;
+      if (tokenCount + partialTokens > budget) {
+        truncated = true;
+        break;
+      }
+      for (let i = 1; i < blockLines.length; i++) {
+        const candidate = partial + "\n" + blockLines[i];
+        const candidateTokens = enc.encode(candidate).length;
+        if (tokenCount + candidateTokens > budget) break;
+        partial = candidate;
+        partialTokens = candidateTokens;
+      }
+      blocks.push(partial);
+      tokenCount += partialTokens;
+      truncated = true;
+      break;
+    }
+    console.log(blocks.join("\n\n"));
+    const shown = blocks.length;
+    const total = rankedFiles.length;
+    const parts = [`[map] ${shown}/${total} files, ~${tokenCount} tokens`];
+    if (truncated) {
+      parts.push(`(budget: ${budget}, truncated)`);
+    }
+    console.log(`
+${parts.join(" ")}`);
+  } finally {
+    db.close();
+  }
+}
+export {
+  runMap
+};
+//# sourceMappingURL=map-6WOMDLCP.js.map

package/dist/map-6WOMDLCP.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/commands/map.ts"],"sourcesContent":["import { createRequire } from \"node:module\";\nimport { resolve } from \"node:path\";\nimport { existsSync } from \"node:fs\";\nimport { IndexDatabase } from \"../db.js\";\nimport { resolveRoot } from \"../root.js\";\n\nconst require = createRequire(import.meta.url);\nconst { DirectedGraph } = require(\"graphology\");\nconst pagerank = require(\"graphology-metrics/centrality/pagerank\");\nconst { getEncoding } = require(\"js-tiktoken\");\n\n/**\n * Build a directed file-level graph and compute PageRank scores.\n * Returns a map from file path to its PageRank score.\n */\nfunction rankFilesByPagerank(\n  db: IndexDatabase,\n): Map<string, number> {\n  const graph = new DirectedGraph();\n\n  for (const file of db.getAllFiles()) {\n    graph.addNode(file.path);\n  }\n\n  for (const edge of db.getFileImportEdges()) {\n    const key = `${edge.source_file}->${edge.target_file}`;\n    if (!graph.hasEdge(key)) {\n      graph.addEdgeWithKey(key, edge.source_file, edge.target_file);\n    }\n  }\n\n  const ranks: Record<string, number> =\n    graph.order > 0 ? pagerank(graph, { getEdgeWeight: null }) : {};\n\n  return new Map(Object.entries(ranks));\n}\n\n/**\n * Render a single file's section: file path followed by its symbols.\n * Filters out low-value variable declarations (e.g. `require`, `const`\n * boilerplate) that lack signatures and add noise to the map.\n */\nfunction renderFileBlock(\n  filePath: string,\n  db: IndexDatabase,\n): string {\n  const symbols = db.getSymbolsByFile(filePath);\n  symbols.sort((a, b) => a.start_line - b.start_line);\n\n  const lines: string[] = [filePath];\n  for (const sym of symbols) {\n    // Skip variables without signatures — these are typically require()\n    // boilerplate, module-level constants, etc. that don't help orientation.\n    if (sym.kind === \"variable\" && !sym.signature) continue;\n    const label = sym.signature ?? `${sym.kind} ${sym.name}`;\n    lines.push(`  ${label}`);\n  }\n  return lines.join(\"\\n\");\n}\n\nexport async function runMap(\n  positional: string[],\n  flags: Record<string, string | boolean>,\n): Promise<void> {\n  if (flags.help) {\n    console.log(`codefocus map — High-level codebase overview\n\nUsage: codefocus map [options]\n\nOptions:\n  --budget <tokens>  Token budget for output (default: 2000)\n  --root <path>      Root directory of indexed project (default: auto-detect)\n  --help             Show this help message\n\nExamples:\n  codefocus map\n  codefocus map --budget 4000\n  codefocus map --root ./my-project`);\n    return;\n  }\n\n  const budget = parseInt(String(flags.budget || \"2000\"), 10);\n  if (isNaN(budget) || budget <= 0) {\n    console.error(\"Error: --budget must be a positive integer\");\n    process.exitCode = 2;\n    return;\n  }\n\n  const root = resolveRoot(flags.root);\n  const dbPath = resolve(root, \".codefocus\", \"index.db\");\n\n  if (!existsSync(dbPath)) {\n    console.error(\n      `Error: no index found at ${dbPath}\\nRun 'codefocus index --root ${root}' first.`,\n    );\n    process.exitCode = 1;\n    return;\n  }\n\n  const db = new IndexDatabase(dbPath);\n  try {\n    const files = db.getAllFiles();\n\n    if (files.length === 0) {\n      console.log(\"[map] Index is empty — no files to map.\");\n      return;\n    }\n\n    // Rank files by PageRank connectivity\n    const ranks = rankFilesByPagerank(db);\n\n    const rankedFiles = files\n      .map((f) => ({ path: f.path, rank: ranks.get(f.path) ?? 0 }))\n      .sort((a, b) => b.rank - a.rank || a.path.localeCompare(b.path));\n\n    // Token-budget enforcement via cl100k_base (GPT-4 family tokenizer)\n    const enc = getEncoding(\"cl100k_base\");\n    const blocks: string[] = [];\n    let tokenCount = 0;\n    let truncated = false;\n\n    for (const file of rankedFiles) {\n      const block = renderFileBlock(file.path, db);\n      const blockTokens = enc.encode(block).length;\n\n      if (tokenCount + blockTokens <= budget) {\n        blocks.push(block);\n        tokenCount += blockTokens;\n        continue;\n      }\n\n      // Block doesn't fit in full — try trimming symbols to partial fit.\n      // Always include at least the file path line.\n      const blockLines = block.split(\"\\n\");\n      let partial = blockLines[0]; // file path heading\n      let partialTokens = enc.encode(partial).length;\n\n      if (tokenCount + partialTokens > budget) {\n        truncated = true;\n        break;\n      }\n\n      for (let i = 1; i < blockLines.length; i++) {\n        const candidate = partial + \"\\n\" + blockLines[i];\n        const candidateTokens = enc.encode(candidate).length;\n        if (tokenCount + candidateTokens > budget) break;\n        partial = candidate;\n        partialTokens = candidateTokens;\n      }\n\n      blocks.push(partial);\n      tokenCount += partialTokens;\n      truncated = true;\n      break;\n    }\n\n    // Output the map\n    console.log(blocks.join(\"\\n\\n\"));\n\n    // Summary footer\n    const shown = blocks.length;\n    const total = rankedFiles.length;\n    const parts = [`[map] ${shown}/${total} files, ~${tokenCount} tokens`];\n    if (truncated) {\n      parts.push(`(budget: ${budget}, truncated)`);\n    }\n    console.log(`\\n${parts.join(\" \")}`);\n  } finally {\n    db.close();\n  }\n}\n"],"mappings":";;;;;;;;;AAAA,SAAS,qBAAqB;AAC9B,SAAS,eAAe;AACxB,SAAS,kBAAkB;AAI3B,IAAMA,WAAU,cAAc,YAAY,GAAG;AAC7C,IAAM,EAAE,cAAc,IAAIA,SAAQ,YAAY;AAC9C,IAAM,WAAWA,SAAQ,wCAAwC;AACjE,IAAM,EAAE,YAAY,IAAIA,SAAQ,aAAa;AAM7C,SAAS,oBACP,IACqB;AACrB,QAAM,QAAQ,IAAI,cAAc;AAEhC,aAAW,QAAQ,GAAG,YAAY,GAAG;AACnC,UAAM,QAAQ,KAAK,IAAI;AAAA,EACzB;AAEA,aAAW,QAAQ,GAAG,mBAAmB,GAAG;AAC1C,UAAM,MAAM,GAAG,KAAK,WAAW,KAAK,KAAK,WAAW;AACpD,QAAI,CAAC,MAAM,QAAQ,GAAG,GAAG;AACvB,YAAM,eAAe,KAAK,KAAK,aAAa,KAAK,WAAW;AAAA,IAC9D;AAAA,EACF;AAEA,QAAM,QACJ,MAAM,QAAQ,IAAI,SAAS,OAAO,EAAE,eAAe,KAAK,CAAC,IAAI,CAAC;AAEhE,SAAO,IAAI,IAAI,OAAO,QAAQ,KAAK,CAAC;AACtC;AAOA,SAAS,gBACP,UACA,IACQ;AACR,QAAM,UAAU,GAAG,iBAAiB,QAAQ;AAC5C,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAElD,QAAM,QAAkB,CAAC,QAAQ;AACjC,aAAW,OAAO,SAAS;AAGzB,QAAI,IAAI,SAAS,cAAc,CAAC,IAAI,UAAW;AAC/C,UAAM,QAAQ,IAAI,aAAa,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI;AACtD,UAAM,KAAK,KAAK,KAAK,EAAE;AAAA,EACzB;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,eAAsB,OACpB,YACA,OACe;AACf,MAAI,MAAM,MAAM;AACd,YAAQ,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oCAYoB;AAChC;AAAA,EACF;AAEA,QAAM,SAAS,SAAS,OAAO,MAAM,UAAU,MAAM,GAAG,EAAE;AAC1D,MAAI,MAAM,MAAM,KAAK,UAAU,GAAG;AAChC,YAAQ,MAAM,4CAA4C;AAC1D,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,OAAO,YAAY,MAAM,IAAI;AACnC,QAAM,SAAS,QAAQ,MAAM,cAAc,UAAU;AAErD,MAAI,CAAC,WAAW,MAAM,GAAG;AACvB,YAAQ;AAAA,MACN,4BAA4B,MAAM;AAAA,8BAAiC,IAAI;AAAA,IACzE;AACA,YAAQ,WAAW;AACnB;AAAA,EACF;AAEA,QAAM,KAAK,IAAI,cAAc,MAAM;AACnC,MAAI;AACF,UAAM,QAAQ,GAAG,YAAY;AAE7B,QAAI,MAAM,WAAW,GAAG;AACtB,cAAQ,IAAI,8CAAyC;AACrD;AAAA,IACF;AAGA,UAAM,QAAQ,oBAAoB,EAAE;AAEpC,UAAM,cAAc,MACjB,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,MAAM,IAAI,EAAE,IAAI,KAAK,EAAE,EAAE,EAC3D,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAGjE,UAAM,MAAM,YAAY,aAAa;AACrC,UAAM,SAAmB,CAAC;AAC1B,QAAI,aAAa;AACjB,QAAI,YAAY;AAEhB,eAAW,QAAQ,aAAa;AAC9B,YAAM,QAAQ,gBAAgB,KAAK,MAAM,EAAE;AAC3C,YAAM,cAAc,IAAI,OAAO,KAAK,EAAE;AAEtC,UAAI,aAAa,eAAe,QAAQ;AACtC,eAAO,KAAK,KAAK;AACjB,sBAAc;AACd;AAAA,MACF;AAIA,YAAM,aAAa,MAAM,MAAM,IAAI;AACnC,UAAI,UAAU,WAAW,CAAC;AAC1B,UAAI,gBAAgB,IAAI,OAAO,OAAO,EAAE;AAExC,UAAI,aAAa,gBAAgB,QAAQ;AACvC,oBAAY;AACZ;AAAA,MACF;AAEA,eAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,cAAM,YAAY,UAAU,OAAO,WAAW,CAAC;AAC/C,cAAM,kBAAkB,IAAI,OAAO,SAAS,EAAE;AAC9C,YAAI,aAAa,kBAAkB,OAAQ;AAC3C,kBAAU;AACV,wBAAgB;AAAA,MAClB;AAEA,aAAO,KAAK,OAAO;AACnB,oBAAc;AACd,kBAAY;AACZ;AAAA,IACF;AAGA,YAAQ,IAAI,OAAO,KAAK,MAAM,CAAC;AAG/B,UAAM,QAAQ,OAAO;AACrB,UAAM,QAAQ,YAAY;AAC1B,UAAM,QAAQ,CAAC,SAAS,KAAK,IAAI,KAAK,YAAY,UAAU,SAAS;AACrE,QAAI,WAAW;AACb,YAAM,KAAK,YAAY,MAAM,cAAc;AAAA,IAC7C;AACA,YAAQ,IAAI;AAAA,EAAK,MAAM,KAAK,GAAG,CAAC,EAAE;AAAA,EACpC,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;","names":["require"]}