grepmax 0.22.0 → 0.23.0

package/.claude-plugin/marketplace.json

@@ -10,7 +10,7 @@
       "name": "grepmax",
       "source": "./plugins/grepmax",
       "description": "Semantic code search for Claude Code. Automatically indexes your project and provides intelligent search capabilities.",
-      "version": "0.22.0",
+      "version": "0.23.0",
       "author": {
         "name": "Robert Owens",
         "email": "robowens@me.com"

package/README.md

@@ -72,6 +72,7 @@ gmax log src/lib/auth.ts                 # Git commit history for a path or symb
 gmax test handleAuth                     # Find tests via reverse call graph
 gmax impact handleAuth                   # Dependents + affected tests
 gmax similar handleAuth                  # Find similar code patterns
+gmax audit --top 10                      # God nodes, hub files, file cycles, dead candidates
 gmax dead handleAuth                     # Unused-symbol check via call graph (DEAD / PUBLIC EXPORT / LIVE)
 gmax context "auth system" --budget 4000 # Token-budgeted topic summary
 gmax context src/lib/auth.ts --budget 4000 # Deterministic file/path context
@@ -132,7 +133,7 @@ Plugins auto-update when you run `npm install -g grepmax@latest` — no need to
 | `extract_symbol` | Complete function/class body by symbol name. |
 | `peek_symbol` | Compact overview: signature + callers + callees. |
 | `dead` | Unused-symbol check via call graph. Returns `DEAD`, `PUBLIC EXPORT`, or `LIVE` with caller count. |
-| `audit` | Graph summary: god nodes, hub files, and dead-code candidates in one call. |
+| `audit` | Graph summary: god nodes, hub files, symbol-derived file dependency cycles, and dead-code candidates. |
 | `get_neighbors` | Graph primitive: symbols reachable from a node along call edges within N hops. |
 | `find_paths` | Graph primitive: shortest call-graph path between two symbols. |
 | `subgraph_for_files` | Graph primitive: local dependency subgraph for a set of files. |

package/dist/commands/audit.js

@@ -64,6 +64,73 @@ const MIN_GOD_NAME_LEN = 3;
 function rel(p, prefix) {
     return p.startsWith(prefix) ? p.slice(prefix.length) : p;
 }
+function findFileCycles(deps, prefix, top) {
+    const indexByFile = new Map();
+    const lowlink = new Map();
+    const stack = [];
+    const onStack = new Set();
+    const components = [];
+    let index = 0;
+    const strongConnect = (file) => {
+        var _a, _b, _c, _d, _e;
+        indexByFile.set(file, index);
+        lowlink.set(file, index);
+        index++;
+        stack.push(file);
+        onStack.add(file);
+        for (const dep of (_a = deps.get(file)) !== null && _a !== void 0 ? _a : []) {
+            if (!indexByFile.has(dep)) {
+                strongConnect(dep);
+                lowlink.set(file, Math.min((_b = lowlink.get(file)) !== null && _b !== void 0 ? _b : 0, (_c = lowlink.get(dep)) !== null && _c !== void 0 ? _c : 0));
+            }
+            else if (onStack.has(dep)) {
+                lowlink.set(file, Math.min((_d = lowlink.get(file)) !== null && _d !== void 0 ? _d : 0, (_e = indexByFile.get(dep)) !== null && _e !== void 0 ? _e : 0));
+            }
+        }
+        if (lowlink.get(file) !== indexByFile.get(file))
+            return;
+        const component = [];
+        while (stack.length > 0) {
+            const dep = stack.pop();
+            onStack.delete(dep);
+            component.push(dep);
+            if (dep === file)
+                break;
+        }
+        if (component.length > 1)
+            components.push(component);
+    };
+    const files = new Set();
+    for (const [file, targets] of deps) {
+        files.add(file);
+        for (const target of targets)
+            files.add(target);
+    }
+    for (const file of [...files].sort()) {
+        if (!indexByFile.has(file))
+            strongConnect(file);
+    }
+    return components
+        .map((component) => {
+        var _a;
+        const set = new Set(component);
+        let edgeCount = 0;
+        for (const file of component) {
+            for (const dep of (_a = deps.get(file)) !== null && _a !== void 0 ? _a : []) {
+                if (set.has(dep))
+                    edgeCount++;
+            }
+        }
+        return {
+            files: component.map((f) => rel(f, prefix)).sort(),
+            edgeCount,
+        };
+    })
+        .sort((a, b) => b.files.length - a.files.length ||
+        b.edgeCount - a.edgeCount ||
+        a.files.join("\0").localeCompare(b.files.join("\0")))
+        .slice(0, top);
+}
 /**
  * Pure aggregation over chunk rows — no DB, no I/O. Builds the symbol→def map,
  * cross-file inbound edges, and per-file fan-in/out, then derives god nodes
@@ -170,6 +237,23 @@ function computeAudit(rows, prefix, top) {
         });
     }
     hubFiles.sort((a, b) => b.dependents - a.dependents || b.defines - a.defines);
+    const fileDeps = new Map();
+    for (const [file, refs] of fileOutRefs) {
+        for (const s of refs) {
+            if ((0, callsites_1.isBuiltinCallee)(s))
+                continue;
+            const defFiles = defFileCounts.get(s);
+            if (!defFiles || defFiles.size !== 1)
+                continue;
+            const [depFile] = defFiles;
+            if (!depFile || depFile === file)
+                continue;
+            if (!fileDeps.has(file))
+                fileDeps.set(file, new Set());
+            fileDeps.get(file).add(depFile);
+        }
+    }
+    const fileCycles = findFileCycles(fileDeps, prefix, top);
     // Dead candidates — non-exported in-project symbols with zero inbound
     // references anywhere (including their own file).
     const deadAll = [];
@@ -186,10 +270,17 @@ function computeAudit(rows, prefix, top) {
         scannedFiles: files.size,
         godNodes: godNodes.slice(0, top),
         hubFiles: hubFiles.filter((h) => h.dependents > 0).slice(0, top),
+        fileCycles,
         deadCandidates: deadAll.slice(0, top),
         deadTotal: deadAll.length,
     };
 }
+function formatCycle(files) {
+    const shown = files.length > 6
+        ? [...files.slice(0, 6), `... ${files.length - 6} more`]
+        : files;
+    return shown.join(", ");
+}
 function formatHuman(r) {
     const out = [];
     out.push(`${style.bold("Audit")} ${style.dim(`— ${r.scannedChunks} chunks across ${r.scannedFiles} files`)}`);
@@ -217,6 +308,17 @@ function formatHuman(r) {
         }
     }
     out.push("");
+    out.push(style.bold("File dependency cycles") +
+        style.dim(" (symbol-derived, bounded SCCs)"));
+    if (r.fileCycles.length === 0) {
+        out.push(style.dim("  none"));
+    }
+    else {
+        for (const c of r.fileCycles) {
+            out.push(`  ${formatCycle(c.files)}  ${style.dim(`${c.files.length} files, ${c.edgeCount} internal edges`)}`);
+        }
+    }
+    out.push("");
     out.push(style.bold("Dead-code candidates") +
         style.dim(` (${r.deadTotal} non-exported symbols with zero inbound refs)`));
     if (r.deadCandidates.length === 0) {
@@ -246,6 +348,9 @@ function formatAgent(r) {
     for (const h of r.hubFiles) {
         lines.push(`hub\t${h.file}\t${h.dependents}\t${h.defines}\t${h.fanOut}`);
     }
+    for (const c of r.fileCycles) {
+        lines.push(`cycle\t${c.files.join(",")}\t${c.files.length}\t${c.edgeCount}`);
+    }
     for (const d of r.deadCandidates) {
         lines.push(`dead\t${d.symbol}\t${d.file}:${d.line + 1}`);
     }
@@ -253,11 +358,12 @@ function formatAgent(r) {
     return lines.join("\n");
 }
 exports.audit = new commander_1.Command("audit")
-    .description("Graph-summary of the indexed project — god nodes (most depended-upon " +
-    "symbols), hub files (most depended-upon files), and dead-code candidates " +
-    "(non-exported symbols with zero inbound references). One pass over the " +
-    "static call graph; dynamic dispatch / reflection / eval are invisible, so " +
-    "dead candidates are hypotheses, not proof.")
+    .description("Graph-summary of the indexed project: god nodes (most depended-upon " +
+    "symbols), hub files (most depended-upon files), symbol-derived file " +
+    "dependency cycles, and dead-code candidates (non-exported symbols with " +
+    "zero inbound references). One pass over the static reference graph; " +
+    "dynamic dispatch / reflection / eval are invisible, so dead candidates " +
+    "are hypotheses, not proof.")
     .option("--root <dir>", "Project root directory")
     .option("--in <subpath>", "Restrict to a sub-path of the project (repeatable)", (value, prev) => prev ? [...prev, value] : [value])
     .option("--exclude <subpath>", "Exclude a sub-path of the project (repeatable)", (value, prev) => prev ? [...prev, value] : [value])

package/dist/commands/mcp.js

@@ -1042,6 +1042,7 @@ exports.mcp = new commander_1.Command("mcp")
                     "start_line",
                     "defined_symbols",
                     "referenced_symbols",
+                    "type_referenced_symbols",
                     "is_exported",
                 ])
                     .where((0, filter_builder_1.pathStartsWith)(prefix))
@@ -1055,7 +1056,12 @@ exports.mcp = new commander_1.Command("mcp")
                     start_line: Number(r.start_line || 0),
                     is_exported: Boolean(r.is_exported),
                     defined_symbols: toStringArray(r.defined_symbols),
-                    referenced_symbols: toStringArray(r.referenced_symbols),
+                    referenced_symbols: [
+                        ...new Set([
+                            ...toStringArray(r.referenced_symbols),
+                            ...toStringArray(r.type_referenced_symbols),
+                        ]),
+                    ],
                 })), prefix, top);
                 const lines = [];
                 lines.push(`Audit — ${audit.scannedChunks} chunks across ${audit.scannedFiles} files`);
@@ -1074,6 +1080,13 @@ exports.mcp = new commander_1.Command("mcp")
                 if (audit.hubFiles.length === 0)
                     lines.push("  none");
                 lines.push("");
+                lines.push("File dependency cycles (symbol-derived):");
+                for (const c of audit.fileCycles) {
+                    lines.push(`  ${c.files.join(", ")} - ${c.files.length} files, ${c.edgeCount} internal edges`);
+                }
+                if (audit.fileCycles.length === 0)
+                    lines.push("  none");
+                lines.push("");
                 lines.push(`Dead-code candidates (${audit.deadTotal} non-exported symbols with zero inbound refs):`);
                 for (const d of audit.deadCandidates) {
                     lines.push(`  ${d.symbol} (${d.file}:${d.line + 1})`);
@@ -2204,7 +2217,7 @@ exports.mcp = new commander_1.Command("mcp")
         },
     }, handleDead);
     tool("audit", {
-        description: "Graph-summary of the indexed project in one call: god nodes (most depended-upon symbols), hub files (most depended-upon files), and dead-code candidates (non-exported symbols with zero inbound references). Built from the static call graph — dynamic dispatch, reflection, eval, and type-position-only references are invisible, so dead candidates are hypotheses; verify with the `dead` tool before acting.",
+        description: "Graph-summary of the indexed project in one call: god nodes (most depended-upon symbols), hub files (most depended-upon files), symbol-derived file dependency cycles, and dead-code candidates (non-exported symbols with zero inbound references). Built from the static reference graph; dynamic dispatch, reflection, and eval are invisible, so dead candidates are hypotheses; verify with the `dead` tool before acting.",
         inputSchema: {
             root: zod_1.z
                 .string()

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "grepmax",
-  "version": "0.22.0",
+  "version": "0.23.0",
   "author": "Robert Owens <78518764+reowens@users.noreply.github.com>",
   "homepage": "https://github.com/reowens/grepmax",
   "bugs": {
@@ -37,7 +37,7 @@
     "lint:fix": "biome check --write .",
     "typecheck": "tsc --noEmit",
     "prepublishOnly": "pnpm build",
-    "preversion": "pnpm test && pnpm typecheck",
+    "preversion": "pnpm test && pnpm typecheck && pnpm run format:check",
     "version": "bash scripts/sync-versions.sh && git add -A",
     "postversion": "bash scripts/postrelease.sh"
   },

package/plugins/grepmax/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "grepmax",
-  "version": "0.22.0",
+  "version": "0.23.0",
   "description": "Semantic code search for Claude Code. Automatically indexes your project and provides intelligent search capabilities.",
   "author": {
     "name": "Robert Owens",