@vibgrate/cli 2026.709.1 → 2026.709.2

package/README.md

@@ -269,42 +269,49 @@ See [docs/QUICKSTART-PROMPT.md](./docs/QUICKSTART-PROMPT.md) for the full prompt
 
 | Command | Description |
 | --- | --- |
-| `vg build [path]` | Build / update the code map (incremental, deterministic) |
-| `vg show <file>` | Explain a node: what it is, what it calls, what calls it |
 | `vg ask "<question>"` | Query the map in natural language |
+| `vg benchmark` | Reproducible build + memory + token-reduction benchmark (honest estimates) |
+| `vg build [path]` | Build / update the code map (incremental, deterministic) |
+| `vg bundle` | Build an air-gapped bundle (grammars + graph + library catalog) |
+| `vg embed` | Precompute the semantic index for instant `vg ask` |
+| `vg export` | Export the map (json / ndjson / graphml / dot / cypher / md / html / SBOM) |
+| `vg facts <file>` | Deterministic facts for a node (contracts, invariants) |
+| `vg guide <file>` | Cited standards / practices for a node (free pack) |
 | `vg impact <file>` | What breaks if you change it — and the tests to run |
-| `vg path <from> <to>` | How A connects to B (shortest path) |
-| `vg tree <file>` | Call tree rooted at a node |
-| `vg insights` | Overview: hubs, hotspots, untested paths |
+| `vg install` / `vg uninstall` | Wire (or remove) **Vibgrate AI Context** + skill in your AI assistant |
 | `vg lib <package>` | Version-correct, drift-annotated library docs |
+| `vg map` / `vg hubs` / `vg areas` / `vg oddities` | Map insights: overview, most-depended-on code, natural groupings, cross-area smells |
+| `vg models` | The local model fleet (Ollama / LM Studio / gguf), discovered offline |
+| `vg path <from> <to>` | How A connects to B (shortest path) |
+| `vg savings` | Local report of tokens/$ saved vs a grep baseline (estimates) |
 | `vg serve` | Start **Vibgrate AI Context** (local-first MCP: code map + drift + version-correct docs) |
-| `vg install` | Wire **Vibgrate AI Context** + skill into your AI assistant |
 | `vg share` | Make the graph committable + auto-updating for your team |
+| `vg show <file>` | Explain a node: what it is, what it calls, what calls it |
 | `vg status` | Cache/freshness, counts, staleness |
-| `vg facts <file>` | Deterministic facts for a node (contracts, invariants) |
 | `vg tests <file>` | Which tests cover a node |
-| `vg embed` | Precompute the semantic index for instant `vg ask` |
-| `vg export` | Export the map (json / ndjson / graphml / dot / cypher / md / html / SBOM) |
+| `vg tree <file>` | Call tree rooted at a node |
+| `vg unknowns` | What the graph cannot resolve, ranked by blast radius |
 
 ### Drift reporting
 
 | Command | Description |
 | --- | --- |
+| `vg baseline [path]` | Create a drift baseline |
+| `vg bisect <package> <constraint>` | The commit where a dependency crossed a version line (`--assert` to gate CI) |
+| `vg drift` | What is outdated across dependencies (offline; `--online` for currency) |
+| `vg dsn create` | Generate a DSN token |
+| `vg fix` | Ranked, risk-tiered upgrade plans from the hosted planner — then apply the one you choose |
+| `vg init [path]` | Initialise config and `.vibgrate/` |
+| `vg login` / `vg logout` | Authenticate the CLI with your Vibgrate workspace (or clear stored credentials) |
+| `vg push` | Upload scan results to Vibgrate Cloud |
+| `vg report` | Generate a report from a scan artifact |
+| `vg sbom export` / `delta` / `vex` | Export CycloneDX/SPDX SBOM, diff two artifacts, or emit an OpenVEX document |
 | `vg scan [path]` | Scan for upgrade drift |
 | `vg scan --vulns` | Also detect known vulnerabilities (OSV; offline via `--package-manifest`) |
 | `vg scan --full` | Comprehensive scan: drift + vulnerabilities + a banned-dependency report |
-| `vg why <package>` | Who introduced a dependency, its version history, and any open vulnerabilities |
-| `vg bisect <package> <constraint>` | The commit where a dependency crossed a version line (`--assert` to gate CI) |
 | `vg scan --push` | Scan and push results to Vibgrate Cloud |
-| `vg baseline [path]` | Create a drift baseline |
-| `vg report` | Generate a report from a scan artifact |
-| `vg sbom export` | Export CycloneDX or SPDX SBOM |
-| `vg sbom delta` | Compare two artifacts for SBOM drift |
-| `vg vex` | Generate an OpenVEX document for attestation |
-| `vg init [path]` | Initialise config and `.vibgrate/` |
-| `vg push` | Upload scan results to Vibgrate Cloud |
-| `vg dsn create` | Generate a DSN token |
 | `vg update` | Check for and install updates |
+| `vg why <package>` | Who introduced a dependency, its version history, and any open vulnerabilities |
 
 ```bash
 vg scan [path] [--vulns] [--full] [--format text|json|sarif|md] [--out <file>] [--fail-on warn|error] \

package/dist/baseline-VGDQ33ZE.js

@@ -0,0 +1,6 @@
+export { baselineCommand, runBaseline } from './chunk-FU4MOQTC.js';
+import './chunk-PIWHQSAR.js';
+import './chunk-RXP66R2E.js';
+import './chunk-GI6W53LM.js';
+//# sourceMappingURL=baseline-VGDQ33ZE.js.map
+//# sourceMappingURL=baseline-VGDQ33ZE.js.map

package/dist/{baseline-7AFTGG3I.js.map → baseline-VGDQ33ZE.js.map}

@@ -1 +1 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"baseline-7AFTGG3I.js"}
+{"version":3,"sources":[],"names":[],"mappings":"","file":"baseline-VGDQ33ZE.js"}

package/dist/{chunk-MPKMAERO.js → chunk-3TCE6IGZ.js}

@@ -1,7 +1,7 @@
 import { hashString, langById, shortId, canonicalize, grammarSetVersion, hashBytes, langForExtension, setGrammarsOverride, parseSource } from './chunk-X5YT263H.js';
-import { writeTextFile, pathExists, readJsonFile, computeUpgradeImpact, getChangelogSignals, gitHistoryAvailable, buildVersionTimelines, findPackageTimeline, severityRank, projectTypeToVulnEcosystem, VERSION } from './chunk-PXZ5KPVN.js';
+import { writeTextFile, pathExists, readJsonFile, computeUpgradeImpact, getChangelogSignals, gitHistoryAvailable, buildVersionTimelines, findPackageTimeline, severityRank, projectTypeToVulnEcosystem, VERSION } from './chunk-PIWHQSAR.js';
 import * as fs19 from 'fs';
-import { execFileSync } from 'child_process';
+import { spawnSync, execFileSync } from 'child_process';
 import * as path19 from 'path';
 import ignore from 'ignore';
 import * as v8 from 'v8';
@@ -20,6 +20,7 @@ import chalk from 'chalk';
 import * as zlib from 'zlib';
 import { promisify } from 'util';
 import { encode, decode } from 'gpt-tokenizer/encoding/cl100k_base';
+import { Worker } from 'worker_threads';
 import { Server } from '@modelcontextprotocol/sdk/server/index.js';
 import { StdioServerTransport } from '@modelcontextprotocol/sdk/server/stdio.js';
 import { ListToolsRequestSchema, CallToolRequestSchema } from '@modelcontextprotocol/sdk/types.js';
@@ -5671,19 +5672,165 @@ function boundList(items, max) {
   return { items: items.slice(0, max), total: items.length };
 }
 var NODE_EDGE_CAP = 50;
-var IGNORE_DIRS = /* @__PURE__ */ new Set([".git", ".vibgrate", "node_modules", "dist", "build", "out", "target", "vendor", "__pycache__"]);
 var MAX_FILE_BYTES = 1e6;
-var MAX_FILES_SCANNED = 2e4;
 var PREVIEW_CHARS = 120;
-function searchSymbols(graph, root, query, limit) {
+var NUL = "\0";
+var PARALLEL_MIN_BYTES = 64e6;
+var PARALLEL_MIN_FILES = 2e3;
+var ROW_CAP = 1e4;
+async function scanCandidates(root, files, needle, opts) {
+  const needleLower = needle.toLowerCase();
+  if (!needleLower || files.length === 0) return { hits: [], total: 0, truncated: false };
+  if (!opts.collectAll) return scanInline(root, files, needleLower, opts.budget, true, void 0);
+  if (files.length < PARALLEL_MIN_FILES && !process.env.VG_PARALLEL_MIN_BYTES) {
+    return scanInline(root, files, needleLower, ROW_CAP, false, void 0);
+  }
+  const { over, sizes } = measure(root, files);
+  if (!over) return scanInline(root, files, needleLower, ROW_CAP, false, sizes);
+  return scanParallel(root, files, needleLower);
+}
+function parallelMinBytes() {
+  const v = Number(process.env.VG_PARALLEL_MIN_BYTES);
+  return Number.isFinite(v) && v >= 0 ? v : PARALLEL_MIN_BYTES;
+}
+function measure(root, files) {
+  const threshold = parallelMinBytes();
+  const sizes = /* @__PURE__ */ new Map();
+  let total = 0;
+  for (const rel2 of files) {
+    let size;
+    try {
+      size = fs19.statSync(path19.join(root, rel2)).size;
+    } catch {
+      continue;
+    }
+    sizes.set(rel2, size);
+    if (size <= MAX_FILE_BYTES) total += size;
+    if (total >= threshold) return { over: true, sizes };
+  }
+  return { over: false, sizes };
+}
+function matchLines(text, needleLower) {
+  const low = text.toLowerCase();
+  if (!low.includes(needleLower)) return [];
+  const lowLines = low.split("\n");
+  const rawLines = text.split("\n");
+  const hits = [];
+  for (let i = 0; i < lowLines.length; i++) {
+    if (lowLines[i].includes(needleLower)) hits.push({ line: i + 1, preview: rawLines[i].trim().slice(0, PREVIEW_CHARS) });
+  }
+  return hits;
+}
+function readCandidate(abs, knownSize) {
+  try {
+    const size = knownSize ?? fs19.statSync(abs).size;
+    if (size > MAX_FILE_BYTES) return null;
+    const text = fs19.readFileSync(abs, "utf8");
+    return text.includes(NUL) ? null : text;
+  } catch {
+    return null;
+  }
+}
+function scanInline(root, files, needleLower, cap, stopAtCap, sizes) {
+  const hits = [];
+  let total = 0;
+  let truncated = false;
+  for (const rel2 of files) {
+    const text = readCandidate(path19.join(root, rel2), sizes?.get(rel2));
+    if (text === null) continue;
+    for (const h of matchLines(text, needleLower)) {
+      total++;
+      if (hits.length < cap) hits.push({ file: rel2, line: h.line, preview: h.preview });
+      else {
+        truncated = true;
+        if (stopAtCap) return { hits, total, truncated };
+      }
+    }
+  }
+  return { hits, total, truncated };
+}
+async function scanParallel(root, files, needleLower) {
+  const n = Math.min(files.length, Math.max(2, Math.min(8, os.cpus().length - 1)));
+  const shards = Array.from({ length: n }, () => []);
+  files.forEach((f, i) => shards[i % n].push(f));
+  let results;
+  try {
+    results = await Promise.all(shards.map((shard) => runWorker(root, shard, needleLower)));
+  } catch {
+    return scanInline(root, files, needleLower, ROW_CAP, false, void 0);
+  }
+  const hits = [];
+  let total = 0;
+  let truncated = false;
+  for (const r of results) {
+    total += r.total;
+    truncated = truncated || r.truncated;
+    for (const h of r.hits) hits.push(h);
+  }
+  hits.sort((a, b) => a.file < b.file ? -1 : a.file > b.file ? 1 : a.line - b.line);
+  if (hits.length > ROW_CAP) {
+    hits.length = ROW_CAP;
+    truncated = true;
+  }
+  return { hits, total, truncated };
+}
+var WORKER_SOURCE = [
+  "const { parentPort, workerData } = require('worker_threads');",
+  "const fs = require('fs');",
+  "const path = require('path');",
+  `const MAX = ${MAX_FILE_BYTES};`,
+  `const PREVIEW = ${PREVIEW_CHARS};`,
+  `const CAP = ${ROW_CAP};`,
+  "const NUL = String.fromCharCode(0);",
+  "const NL = String.fromCharCode(10);",
+  "const { root, files, needleLower } = workerData;",
+  "const hits = []; let total = 0, truncated = false;",
+  "for (const rel of files) {",
+  "  const abs = path.join(root, rel);",
+  "  let text;",
+  '  try { if (fs.statSync(abs).size > MAX) continue; text = fs.readFileSync(abs, "utf8"); } catch { continue; }',
+  "  if (text.includes(NUL)) continue;",
+  "  const low = text.toLowerCase();",
+  "  if (!low.includes(needleLower)) continue;",
+  "  const lowLines = low.split(NL); const rawLines = text.split(NL);",
+  "  for (let i = 0; i < lowLines.length; i++) {",
+  "    if (!lowLines[i].includes(needleLower)) continue;",
+  "    total++;",
+  "    if (hits.length < CAP) hits.push({ file: rel, line: i + 1, preview: rawLines[i].trim().slice(0, PREVIEW) });",
+  "    else truncated = true;",
+  "  }",
+  "}",
+  "parentPort.postMessage({ hits, total, truncated });"
+].join("\n");
+function runWorker(root, files, needleLower) {
+  return new Promise((resolve12, reject) => {
+    const w = new Worker(WORKER_SOURCE, { eval: true, workerData: { root, files, needleLower } });
+    let settled = false;
+    w.once("message", (m) => {
+      settled = true;
+      resolve12(m);
+    });
+    w.once("error", reject);
+    w.once("exit", (code) => {
+      if (!settled && code !== 0) reject(new Error(`literal-scan worker exited with code ${code}`));
+    });
+  });
+}
+
+// src/engine/search.ts
+var IGNORE_DIRS = /* @__PURE__ */ new Set([".git", ".vibgrate", "node_modules", "dist", "build", "out", "target", "vendor", "__pycache__"]);
+var MAX_FILES_SCANNED = 2e4;
+async function searchSymbols(graph, root, query, limit) {
   const q2 = query.trim();
   if (!q2) return { matches: [], moreAvailable: false, hint: "query is required" };
+  const isPhrase = /\s/.test(q2);
   let nodes = findNodes(graph, q2).filter((n) => n.kind !== "file");
   if (nodes.length === 0) {
     const tokens = queryTokens(q2);
     if (tokens.length >= 2) nodes = multiTokenNodes(graph, tokens);
   }
-  const symbolHits = nodes.slice(0, limit).map((n, i) => ({
+  const symbolCap = isPhrase ? Math.max(1, Math.floor(limit / 3)) : limit;
+  const symbolHits = nodes.slice(0, symbolCap).map((n, i) => ({
     kind: n.kind,
     name: n.qualifiedName,
     file: n.file,
@@ -5693,9 +5840,12 @@ function searchSymbols(graph, root, query, limit) {
   const spare = limit - symbolHits.length;
   const textHits = [];
   let truncatedScan = false;
+  let totalTextMatches;
   if (spare > 0) {
     const seen = new Set(symbolHits.map((h) => `${h.file}:${h.line}`));
-    truncatedScan = scanFiles(root, q2, spare, seen, textHits);
+    const scan = await scanFiles(root, q2, spare, seen, textHits, isPhrase);
+    truncatedScan = scan.truncated;
+    if (isPhrase) totalTextMatches = scan.total;
   }
   const matches = [...symbolHits, ...textHits];
   if (matches.length === 0) {
@@ -5705,7 +5855,14 @@ function searchSymbols(graph, root, query, limit) {
       hint: "no symbol or text match \u2014 for meaning-level questions (symptoms, relationships, what-breaks-if) use query_graph"
     };
   }
-  return { matches, moreAvailable: nodes.length > symbolHits.length || truncatedScan };
+  const literalTruncated = totalTextMatches !== void 0 && totalTextMatches > textHits.length;
+  const moreAvailable = isPhrase ? literalTruncated || truncatedScan : nodes.length > symbolHits.length || truncatedScan;
+  const result = { matches, moreAvailable };
+  if (totalTextMatches !== void 0) result.totalTextMatches = totalTextMatches;
+  if (literalTruncated) {
+    result.hint = `showing ${textHits.length} of ${totalTextMatches}${truncatedScan ? "+" : ""} literal matches \u2014 raise limit or narrow the query to get them all`;
+  }
+  return result;
 }
 function queryTokens(q2) {
   return [...new Set(q2.toLowerCase().split(/[^a-z0-9]+/).filter((t) => t.length >= 2))];
@@ -5722,9 +5879,26 @@ function multiTokenNodes(graph, tokens) {
   }
   return [...cov.values()].sort((a, b) => b.hits - a.hits || b.node.importance - a.node.importance).map((e) => e.node);
 }
-function scanFiles(root, needle, budget, seen, out) {
-  const lower = needle.toLowerCase();
-  let scanned = 0;
+async function scanFiles(root, needle, budget, seen, out, countAll) {
+  const listing = listCandidateFiles(root, needle);
+  const outcome = await scanCandidates(root, listing.files, needle, { collectAll: countAll, budget });
+  let overlap = 0;
+  for (const h of outcome.hits) {
+    if (seen.has(`${h.file}:${h.line}`)) {
+      overlap++;
+      continue;
+    }
+    seen.add(`${h.file}:${h.line}`);
+    if (out.length < budget) out.push({ kind: "text", file: h.file, line: h.line, preview: h.preview });
+  }
+  return { total: outcome.total - overlap, truncated: listing.truncated || outcome.truncated };
+}
+function listCandidateFiles(root, needle) {
+  return ripgrepCandidates(root, needle) ?? walkCandidates(root);
+}
+function walkCandidates(root) {
+  const files = [];
+  let truncated = false;
   const stack = [root];
   while (stack.length) {
     const dir = stack.pop();
@@ -5734,7 +5908,6 @@ function scanFiles(root, needle, budget, seen, out) {
     } catch {
       continue;
     }
-    entries.sort((a, b) => a.name.localeCompare(b.name));
     for (const e of entries) {
       if (e.name.startsWith(".") || IGNORE_DIRS.has(e.name)) continue;
       const abs = path19.join(dir, e.name);
@@ -5742,28 +5915,48 @@ function scanFiles(root, needle, budget, seen, out) {
         stack.push(abs);
         continue;
       }
-      if (++scanned > MAX_FILES_SCANNED) return true;
-      let text;
-      try {
-        if (fs19.statSync(abs).size > MAX_FILE_BYTES) continue;
-        text = fs19.readFileSync(abs, "utf8");
-      } catch {
+      if (files.length >= MAX_FILES_SCANNED) {
+        truncated = true;
         continue;
       }
-      if (!text.toLowerCase().includes(lower)) continue;
-      const rel2 = path19.relative(root, abs);
-      const lines = text.split("\n");
-      for (let i = 0; i < lines.length; i++) {
-        if (!lines[i].toLowerCase().includes(lower)) continue;
-        const key = `${rel2}:${i + 1}`;
-        if (seen.has(key)) continue;
-        seen.add(key);
-        out.push({ kind: "text", file: rel2, line: i + 1, preview: lines[i].trim().slice(0, PREVIEW_CHARS) });
-        if (out.length >= budget) return true;
-      }
+      files.push(path19.relative(root, abs));
     }
   }
-  return false;
+  files.sort();
+  return { files, truncated };
+}
+var rgAvailable;
+function hasRipgrep() {
+  if (process.env.VG_DISABLE_RIPGREP) return false;
+  if (rgAvailable === void 0) {
+    try {
+      rgAvailable = spawnSync("rg", ["--version"], { stdio: "ignore", timeout: 3e3 }).status === 0;
+    } catch {
+      rgAvailable = false;
+    }
+  }
+  return rgAvailable;
+}
+function ripgrepCandidates(root, needle) {
+  if (!hasRipgrep()) return null;
+  const globs = [...IGNORE_DIRS].flatMap((d) => ["--glob", `!**/${d}/**`, "--glob", `!${d}/**`]);
+  const res = spawnSync(
+    "rg",
+    ["--files-with-matches", "--fixed-strings", "--ignore-case", "--no-ignore", "--no-messages", ...globs, "--", needle, "."],
+    { cwd: root, encoding: "utf8", timeout: 15e3, maxBuffer: 32 * 1024 * 1024 }
+  );
+  if (res.error || res.status !== 0 && res.status !== 1 || res.signal) return null;
+  const seen = /* @__PURE__ */ new Set();
+  for (const raw of res.stdout.split("\n")) {
+    const rel2 = raw.startsWith("./") ? raw.slice(2) : raw;
+    if (!rel2) continue;
+    const segs = rel2.split("/");
+    if (segs.some((s) => s.startsWith(".") || IGNORE_DIRS.has(s))) continue;
+    seen.add(rel2);
+  }
+  const files = [...seen].sort();
+  if (files.length > MAX_FILES_SCANNED) return { files: files.slice(0, MAX_FILES_SCANNED), truncated: true };
+  return { files, truncated: false };
 }
 
 // src/mcp/tools.ts
@@ -5882,16 +6075,16 @@ var TOOLS = [
   },
   {
     name: "search_symbols",
-    description: "Find a known name or string fast: ranked symbol lookup with literal file-search fallthrough. Use first for most discovery; use query_graph for meaning.",
+    description: "Find a known name or literal string fast: ranked symbol lookup, plus a complete literal file-search for any quoted/multi-word phrase (config keys, log lines, UI copy). A phrase query reports totalTextMatches so you know you have every occurrence \u2014 use it instead of grep. Use first for most discovery; use query_graph for meaning.",
     inputSchema: obj(
       {
-        query: { type: "string", maxLength: 120 },
-        limit: { type: "number", description: "default 8, max 20" }
+        query: { type: "string", maxLength: 120, description: "a symbol name, or a literal phrase to sweep for every occurrence of" },
+        limit: { type: "number", description: "default 8, max 50 (raise it to fetch a whole literal sweep in one call)" }
       },
       ["query"]
     ),
-    handler: (graph, args, ctx) => {
-      const limit = Math.min(20, numOr(args.limit, 8));
+    handler: async (graph, args, ctx) => {
+      const limit = Math.min(50, numOr(args.limit, 8));
       return searchSymbols(graph, ctx.root, String(args.query ?? ""), limit);
     }
   },
@@ -6506,7 +6699,7 @@ function createServer(source, opts = {}) {
       // Routing guidance once at the server level (hosts that surface
       // `instructions` get it at zero per-step schema cost): the flashlight
       // vs the map.
-      instructions: 'vg is a code map. Use search_symbols to find a known name or literal string fast. Use orient/query_graph for meaning: symptoms, relationships, and what-breaks-if. Responses are concise by default; pass response_format:"detailed" only when a node proves load-bearing. Navigate as little as possible: one good search/query usually locates the code. As soon as you have the file and line, read that file and make the edit \u2014 do not call further graph tools unless the edit fails or the match was wrong.'
+      instructions: 'vg is a code map. Use search_symbols to find a known name or literal string fast \u2014 a multi-word/quoted phrase runs a complete literal sweep and reports totalTextMatches, so reach for it instead of grep even for plain-string "find every occurrence" lookups. Use orient/query_graph for meaning: symptoms, relationships, and what-breaks-if. Responses are concise by default; pass response_format:"detailed" only when a node proves load-bearing. Navigate as little as possible: one good search/query usually locates the code. As soon as you have the file and line, read that file and make the edit \u2014 do not call further graph tools unless the edit fails or the match was wrong.'
     }
   );
   server.setRequestHandler(ListToolsRequestSchema, async () => ({
@@ -7131,5 +7324,5 @@ function spdx(ctx) {
 }
 
 export { ASSISTANTS, CLI_TOOL_ALIASES, CliError, ECOSYSTEMS, ExitCode, FREE_PACK, GraphIndex, GraphSource, NPX_INVOCATION, ResourceLimitError, SCHEMA_VERSION, SKIP_DIRS, SKIP_FILES, TOOLS, UsageError, addLibrary, analyze, applyCoverage, applyStaticTestLinkage, assessDocQuality, assistantById, availableRegionIds, buildFacts, buildGraph, buildModuleResolver, cacheDir, catalogPath, clearModelCache, clearStoredCredentials, cosine, countPending, countTokens, coveringTests, createServer, createWorkspaceDsn, credentialsPath, dashHostForIngestHost, decodeScipIndex, defaultGraphPath, detectRunner, detectServeLaunch, discover, discoverModels, driftCount, driftFor, dsnCommand, embeddingsCached, enrichOnline, ensureGitignored, epistemicBreakdown, exportGraph, fetchHostedDocs, findGitRoot, findNodes, formatForExt, getNodeEmbeddings, gitignoreEntryForCredentials, groundGraph, hasDrift, identifierParts, impactOf, indexFor, ingestHostForRegionId, installAssistant, inventory, isModelReady, isTestFile, libDir, libId, loadCatalog, loadCoverage, loadEmbedder, loadGraph, loadSnapshot, localApiSurface, localPackageDocs, modelCacheInfo, nodeById, nodeEmbedText, parseDsn, parseGraph, parseJsonc, probeFreshness, publishPrivateLibrary, pushCommand, queryGraph, queryGraphSemantic, readDoc, readSavings, readScanArtifact, readUsage, recordCliCall, recordSaving, refreshIfStale, relativeResolver, renderHtml, renderReport, resolveCliInvocation, resolveDsn, resolveEmbedModel, resolveIngestHost, resolveLib, resolveLimits, resolveOne, resolveVersion, saveCatalog, savingsRecorded, scipEdges, selectForBudget, serializeGraph, serveStdio, shortestPath, stableStringify, symbolsFromApi, testsToRun, unavailableMessage, uninstallAssistant, uploadScanArtifact, usageError, verifyDeterminism, vibgrateDir, writeArtifacts, writeNavigationConfig, writeSnapshot, writeStoredCredentials };
-//# sourceMappingURL=chunk-MPKMAERO.js.map
-//# sourceMappingURL=chunk-MPKMAERO.js.map
+//# sourceMappingURL=chunk-3TCE6IGZ.js.map
+//# sourceMappingURL=chunk-3TCE6IGZ.js.map