@vibgrate/cli 2026.813.1 → 2026.814.2

package/dist/chunk-TVDYEHIM.js

@@ -0,0 +1,174 @@
+import { ensureVibgrateGitignore } from './chunk-75LJM5XD.js';
+import fs from 'fs';
+import path from 'path';
+
+function approvalsPath(root) {
+  return path.join(root, ".vibgrate", "code-approvals.json");
+}
+function ruleKey(rule) {
+  if (rule.kind === "run") return `run:${rule.prefix}`;
+  if (rule.kind === "tool") return `tool:${rule.tool}`;
+  return `${rule.kind}:${rule.glob}`;
+}
+function ruleLabel(rule) {
+  if (rule.kind === "run") return `run \`${rule.prefix} \u2026\``;
+  if (rule.kind === "tool") return `call ${rule.tool}`;
+  return `${rule.kind} ${rule.glob}`;
+}
+function loadApprovalRules(root) {
+  let raw;
+  try {
+    raw = JSON.parse(fs.readFileSync(approvalsPath(root), "utf8"));
+  } catch {
+    return [];
+  }
+  const list = Array.isArray(raw) ? raw : raw && typeof raw === "object" && Array.isArray(raw.rules) ? raw.rules : [];
+  const out = [];
+  for (const item of list) {
+    const rule = sanitizeRule(item);
+    if (rule) out.push(rule);
+  }
+  return dedupe(out);
+}
+function sanitizeRule(item) {
+  if (!item || typeof item !== "object") return null;
+  const o = item;
+  if (o.kind === "run" && typeof o.prefix === "string" && o.prefix.trim()) {
+    return { kind: "run", prefix: normalizeCommandPrefix(o.prefix) };
+  }
+  if (o.kind === "tool" && typeof o.tool === "string" && o.tool.trim()) {
+    return { kind: "tool", tool: o.tool.trim() };
+  }
+  if ((o.kind === "edit" || o.kind === "create" || o.kind === "delete") && typeof o.glob === "string" && o.glob.trim()) {
+    return { kind: o.kind, glob: o.glob.trim() };
+  }
+  return null;
+}
+function dedupe(rules) {
+  const seen = /* @__PURE__ */ new Set();
+  const out = [];
+  for (const r of rules) {
+    const key = ruleKey(r);
+    if (seen.has(key)) continue;
+    seen.add(key);
+    out.push(r);
+  }
+  return out;
+}
+function saveApprovalRules(root, rules) {
+  try {
+    const dir = path.join(root, ".vibgrate");
+    fs.mkdirSync(dir, { recursive: true });
+    ensureVibgrateGitignore(root);
+    const sorted = dedupe(rules).slice().sort((a, b) => ruleKey(a).localeCompare(ruleKey(b)));
+    fs.writeFileSync(approvalsPath(root), `${JSON.stringify({ rules: sorted }, null, 2)}
+`);
+    return true;
+  } catch {
+    return false;
+  }
+}
+function addApprovalRule(root, rule) {
+  const rules = loadApprovalRules(root);
+  if (rules.some((r) => ruleKey(r) === ruleKey(rule))) return rule;
+  rules.push(rule);
+  return saveApprovalRules(root, rules) ? rule : null;
+}
+function removeApprovalRule(root, key) {
+  const rules = loadApprovalRules(root);
+  const kept = rules.filter((r) => ruleKey(r) !== key);
+  if (kept.length === rules.length) return false;
+  return saveApprovalRules(root, kept);
+}
+function normalizeCommandPrefix(command) {
+  const tokens = command.trim().split(/\s+/).filter(Boolean);
+  const head = tokens[0] ?? "";
+  const second = tokens[1];
+  if (!second) return head;
+  if (second.startsWith("-")) return tokens.join(" ");
+  if (tokens.slice(2).some((t) => !t.startsWith("-"))) return tokens.join(" ");
+  return `${head} ${second}`;
+}
+function extensiblePrefix(prefix) {
+  return !prefix.split(" ").some((t) => t.startsWith("-"));
+}
+var SHELL_METACHARS = /[><;&|`\n(){}$]/;
+function ruleForAction(action) {
+  switch (action.kind) {
+    case "run":
+      return { kind: "run", prefix: normalizeCommandPrefix(action.command) };
+    case "tool":
+      return { kind: "tool", tool: action.name };
+    case "edit":
+    case "create":
+    case "delete":
+      return { kind: action.kind, glob: action.file };
+    case "patch":
+      return null;
+  }
+}
+function globMatch(glob, file) {
+  let re = "";
+  for (let i = 0; i < glob.length; i++) {
+    const c = glob[i];
+    if (c === "*") {
+      if (glob[i + 1] === "*") {
+        re += ".*";
+        i += glob[i + 2] === "/" ? 2 : 1;
+      } else {
+        re += "[^/]*";
+      }
+    } else if (c === "?") {
+      re += "[^/]";
+    } else if ("\\^$.|+()[]{}".includes(c)) {
+      re += `\\${c}`;
+    } else {
+      re += c;
+    }
+  }
+  try {
+    return new RegExp(`^${re}$`).test(file);
+  } catch {
+    return false;
+  }
+}
+function fileRuleMatches(rules, op, file) {
+  for (const r of rules) {
+    if (r.kind === op && globMatch(r.glob, file)) return r;
+  }
+  return null;
+}
+function findMatchingRule(action, rules) {
+  if (!rules.length) return null;
+  switch (action.kind) {
+    case "run": {
+      const full = action.command.trim().split(/\s+/).filter(Boolean).join(" ");
+      for (const r of rules) {
+        if (r.kind !== "run") continue;
+        if (full === r.prefix) return r;
+        if (extensiblePrefix(r.prefix) && full.startsWith(`${r.prefix} `)) {
+          const tail = full.slice(r.prefix.length + 1);
+          if (SHELL_METACHARS.test(tail)) continue;
+          const extension = tail.split(" ");
+          if (extension.every((t) => t.startsWith("-"))) return r;
+        }
+      }
+      return null;
+    }
+    case "tool":
+      return rules.find((r) => r.kind === "tool" && r.tool === action.name) ?? null;
+    case "edit":
+    case "create":
+    case "delete":
+      return fileRuleMatches(rules, action.kind, action.file);
+    case "patch": {
+      const covered = action.files.every((f) => fileRuleMatches(rules, f.op, f.file));
+      if (!covered) return null;
+      return fileRuleMatches(rules, action.files[0].op, action.files[0].file);
+    }
+  }
+}
+
+export { addApprovalRule, approvalsPath, findMatchingRule, globMatch, loadApprovalRules, normalizeCommandPrefix, removeApprovalRule, ruleForAction, ruleKey, ruleLabel, saveApprovalRules };
+//# sourceMappingURL=chunk-TVDYEHIM.js.map
+//# sourceMappingURL=chunk-TVDYEHIM.js.map

package/dist/chunk-TVDYEHIM.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/code/approvals.ts"],"names":[],"mappings":";;;;AA+BO,SAAS,cAAc,IAAA,EAAsB;AAClD,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,WAAA,EAAa,qBAAqB,CAAA;AAC3D;AAMO,SAAS,QAAQ,IAAA,EAA4B;AAClD,EAAA,IAAI,KAAK,IAAA,KAAS,KAAA,EAAO,OAAO,CAAA,IAAA,EAAO,KAAK,MAAM,CAAA,CAAA;AAClD,EAAA,IAAI,KAAK,IAAA,KAAS,MAAA,EAAQ,OAAO,CAAA,KAAA,EAAQ,KAAK,IAAI,CAAA,CAAA;AAClD,EAAA,OAAO,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,CAAA,EAAI,KAAK,IAAI,CAAA,CAAA;AAClC;AAGO,SAAS,UAAU,IAAA,EAA4B;AACpD,EAAA,IAAI,KAAK,IAAA,KAAS,KAAA,EAAO,OAAO,CAAA,MAAA,EAAS,KAAK,MAAM,CAAA,SAAA,CAAA;AACpD,EAAA,IAAI,KAAK,IAAA,KAAS,MAAA,EAAQ,OAAO,CAAA,KAAA,EAAQ,KAAK,IAAI,CAAA,CAAA;AAClD,EAAA,OAAO,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,CAAA,EAAI,KAAK,IAAI,CAAA,CAAA;AAClC;AAOO,SAAS,kBAAkB,IAAA,EAA8B;AAC9D,EAAA,IAAI,GAAA;AACJ,EAAA,IAAI;AACF,IAAA,GAAA,GAAM,IAAA,CAAK,MAAM,EAAA,CAAG,YAAA,CAAa,cAAc,IAAI,CAAA,EAAG,MAAM,CAAC,CAAA;AAAA,EAC/D,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAC1B,MACA,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,IAAY,MAAM,OAAA,CAAS,GAAA,CAA4B,KAAK,CAAA,GAC9E,GAAA,CAA6B,QAC/B,EAAC;AACP,EAAA,MAAM,MAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,QAAQ,IAAA,EAAM;AACvB,IAAA,MAAM,IAAA,GAAO,aAAa,IAAI,CAAA;AAC9B,IAAA,IAAI,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,IAAI,CAAA;AAAA,EACzB;AACA,EAAA,OAAO,OAAO,GAAG,CAAA;AACnB;AAEA,SAAS,aAAa,IAAA,EAAoC;AACxD,EAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,UAAU,OAAO,IAAA;AAC9C,EAAA,MAAM,CAAA,GAAI,IAAA;AACV,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,KAAA,IAAS,OAAO,CAAA,CAAE,WAAW,QAAA,IAAY,CAAA,CAAE,MAAA,CAAO,IAAA,EAAK,EAAG;AACvE,IAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,QAAQ,sBAAA,CAAuB,CAAA,CAAE,MAAM,CAAA,EAAE;AAAA,EACjE;AACA,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,OAAO,CAAA,CAAE,SAAS,QAAA,IAAY,CAAA,CAAE,IAAA,CAAK,IAAA,EAAK,EAAG;AACpE,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,MAAM,CAAA,CAAE,IAAA,CAAK,MAAK,EAAE;AAAA,EAC7C;AACA,EAAA,IAAA,CAAK,EAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,IAAA,KAAS,YAAY,CAAA,CAAE,IAAA,KAAS,QAAA,KAAa,OAAO,EAAE,IAAA,KAAS,QAAA,IAAY,CAAA,CAAE,IAAA,CAAK,MAAK,EAAG;AACpH,IAAA,OAAO,EAAE,MAAM,CAAA,CAAE,IAAA,EAAM,MAAM,CAAA,CAAE,IAAA,CAAK,MAAK,EAAE;AAAA,EAC7C;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,OAAO,KAAA,EAAuC;AACrD,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAAsB,EAAC;AAC7B,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,GAAA,GAAM,QAAQ,CAAC,CAAA;AACrB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,EAAG;AACnB,IAAA,IAAA,CAAK,IAAI,GAAG,CAAA;AACZ,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACZ;AACA,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,iBAAA,CAAkB,MAAc,KAAA,EAAgC;AAC9E,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,IAAA,CAAK,IAAA,EAAM,WAAW,CAAA;AACvC,IAAA,EAAA,CAAG,SAAA,CAAU,GAAA,EAAK,EAAE,SAAA,EAAW,MAAM,CAAA;AAGrC,IAAA,uBAAA,CAAwB,IAAI,CAAA;AAC5B,IAAA,MAAM,SAAS,MAAA,CAAO,KAAK,CAAA,CAAE,KAAA,GAAQ,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,QAAQ,CAAC,CAAA,CAAE,cAAc,OAAA,CAAQ,CAAC,CAAC,CAAC,CAAA;AACxF,IAAA,EAAA,CAAG,aAAA,CAAc,aAAA,CAAc,IAAI,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,EAAE,KAAA,EAAO,MAAA,EAAO,EAAG,IAAA,EAAM,CAAC,CAAC;AAAA,CAAI,CAAA;AACvF,IAAA,OAAO,IAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAGO,SAAS,eAAA,CAAgB,MAAc,IAAA,EAAyC;AACrF,EAAA,MAAM,KAAA,GAAQ,kBAAkB,IAAI,CAAA;AACpC,EAAA,IAAI,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,OAAA,CAAQ,CAAC,CAAA,KAAM,OAAA,CAAQ,IAAI,CAAC,CAAA,EAAG,OAAO,IAAA;AAC5D,EAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,EAAA,OAAO,iBAAA,CAAkB,IAAA,EAAM,KAAK,CAAA,GAAI,IAAA,GAAO,IAAA;AACjD;AAGO,SAAS,kBAAA,CAAmB,MAAc,GAAA,EAAsB;AACrE,EAAA,MAAM,KAAA,GAAQ,kBAAkB,IAAI,CAAA;AACpC,EAAA,MAAM,IAAA,GAAO,MAAM,MAAA,CAAO,CAAC,MAAM,OAAA,CAAQ,CAAC,MAAM,GAAG,CAAA;AACnD,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,KAAA,CAAM,MAAA,EAAQ,OAAO,KAAA;AACzC,EAAA,OAAO,iBAAA,CAAkB,MAAM,IAAI,CAAA;AACrC;AAYO,SAAS,uBAAuB,OAAA,EAAyB;AAC9D,EAAA,MAAM,MAAA,GAAS,QAAQ,IAAA,EAAK,CAAE,MAAM,KAAK,CAAA,CAAE,OAAO,OAAO,CAAA;AACzD,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,CAAC,CAAA,IAAK,EAAA;AAC1B,EAAA,MAAM,MAAA,GAAS,OAAO,CAAC,CAAA;AACvB,EAAA,IAAI,CAAC,QAAQ,OAAO,IAAA;AACpB,EAAA,IAAI,OAAO,UAAA,CAAW,GAAG,GAAG,OAAO,MAAA,CAAO,KAAK,GAAG,CAAA;AAGlD,EAAA,IAAI,OAAO,KAAA,CAAM,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,UAAA,CAAW,GAAG,CAAC,CAAA,EAAG,OAAO,MAAA,CAAO,KAAK,GAAG,CAAA;AAC3E,EAAA,OAAO,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA;AAC1B;AAGA,SAAS,iBAAiB,MAAA,EAAyB;AACjD,EAAA,OAAO,CAAC,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,GAAG,CAAC,CAAA;AACzD;AAUA,IAAM,eAAA,GAAkB,iBAAA;AAOjB,SAAS,cAAc,MAAA,EAA6C;AACzE,EAAA,QAAQ,OAAO,IAAA;AAAM,IACnB,KAAK,KAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,QAAQ,sBAAA,CAAuB,MAAA,CAAO,OAAO,CAAA,EAAE;AAAA,IACvE,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,IAC3C,KAAK,MAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AACH,MAAA,OAAO,EAAE,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,IAChD,KAAK,OAAA;AACH,MAAA,OAAO,IAAA;AAAA;AAEb;AAOO,SAAS,SAAA,CAAU,MAAc,IAAA,EAAuB;AAC7D,EAAA,IAAI,EAAA,GAAK,EAAA;AACT,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,IAAA,IAAI,MAAM,GAAA,EAAK;AACb,MAAA,IAAI,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,KAAM,GAAA,EAAK;AAEvB,QAAA,EAAA,IAAM,IAAA;AACN,QAAA,CAAA,IAAK,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,KAAM,MAAM,CAAA,GAAI,CAAA;AAAA,MACjC,CAAA,MAAO;AACL,QAAA,EAAA,IAAM,OAAA;AAAA,MACR;AAAA,IACF,CAAA,MAAA,IAAW,MAAM,GAAA,EAAK;AACpB,MAAA,EAAA,IAAM,MAAA;AAAA,IACR,CAAA,MAAA,IAAW,eAAA,CAAgB,QAAA,CAAS,CAAC,CAAA,EAAG;AACtC,MAAA,EAAA,IAAM,KAAK,CAAC,CAAA,CAAA;AAAA,IACd,CAAA,MAAO;AACL,MAAA,EAAA,IAAM,CAAA;AAAA,IACR;AAAA,EACF;AACA,EAAA,IAAI;AACF,IAAA,OAAO,IAAI,MAAA,CAAO,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA,CAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,EACxC,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAEA,SAAS,eAAA,CAAgB,KAAA,EAAuB,EAAA,EAAkC,IAAA,EAAmC;AACnH,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAA,CAAE,SAAS,EAAA,IAAM,SAAA,CAAU,EAAE,IAAA,EAAM,IAAI,GAAG,OAAO,CAAA;AAAA,EACvD;AACA,EAAA,OAAO,IAAA;AACT;AAOO,SAAS,gBAAA,CAAiB,QAAwB,KAAA,EAA4C;AACnG,EAAA,IAAI,CAAC,KAAA,CAAM,MAAA,EAAQ,OAAO,IAAA;AAC1B,EAAA,QAAQ,OAAO,IAAA;AAAM,IACnB,KAAK,KAAA,EAAO;AAKV,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,OAAA,CAAQ,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA;AACxE,MAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,QAAA,IAAI,CAAA,CAAE,SAAS,KAAA,EAAO;AACtB,QAAA,IAAI,IAAA,KAAS,CAAA,CAAE,MAAA,EAAQ,OAAO,CAAA;AAK9B,QAAA,IAAI,gBAAA,CAAiB,CAAA,CAAE,MAAM,CAAA,IAAK,IAAA,CAAK,WAAW,CAAA,EAAG,CAAA,CAAE,MAAM,CAAA,CAAA,CAAG,CAAA,EAAG;AACjE,UAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,MAAA,CAAO,SAAS,CAAC,CAAA;AAI3C,UAAA,IAAI,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA,EAAG;AAChC,UAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAChC,UAAA,IAAI,SAAA,CAAU,MAAM,CAAC,CAAA,KAAM,EAAE,UAAA,CAAW,GAAG,CAAC,CAAA,EAAG,OAAO,CAAA;AAAA,QACxD;AAAA,MACF;AACA,MAAA,OAAO,IAAA;AAAA,IACT;AAAA,IACA,KAAK,MAAA;AACH,MAAA,OAAO,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,IAAA,KAAS,MAAA,CAAO,IAAI,CAAA,IAAK,IAAA;AAAA,IAC3E,KAAK,MAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AACH,MAAA,OAAO,eAAA,CAAgB,KAAA,EAAO,MAAA,CAAO,IAAA,EAAM,OAAO,IAAI,CAAA;AAAA,IACxD,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,KAAuB,eAAA,CAAgB,KAAA,EAAO,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,IAAI,CAAC,CAAA;AAC/F,MAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AACrB,MAAA,OAAO,eAAA,CAAgB,KAAA,EAAO,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,CAAG,EAAA,EAAI,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,CAAG,IAAI,CAAA;AAAA,IAC1E;AAAA;AAEJ","file":"chunk-TVDYEHIM.js","sourcesContent":["/**\n * Allow-always approval rules (P2 — permission parity).\n *\n * The approval gate exists to review state changes, but reviewing the *same*\n * change shape every time (`pnpm test`, edits to a scratch dir) is friction\n * without safety. A user can promote an approval to a standing rule\n * (\"Always allow\"); rules live in `.vibgrate/code-approvals.json` at the repo\n * root so the CLI and VS Code honour the same set, and are re-read on every\n * approval so a revocation (from the VG Code manage UI or by editing the\n * file) takes effect immediately — no session restart, no stale cache.\n *\n * Rules never widen safety: {@link dangerousCommand} still screens every rule\n * match, plan mode still denies everything engine-side before rules are\n * consulted, and a rule-approved action is still announced (notice event) and\n * checkpointed like any human-approved change.\n */\n\nimport fs from 'node:fs';\nimport path from 'node:path';\nimport { ensureVibgrateGitignore } from '../engine/artifacts.js';\nimport type { MutatingAction, PatchFileAction } from './tools.js';\n\n/** One standing approval. Discriminated by `kind`, mirroring MutatingAction. */\nexport type ApprovalRule =\n  /** Matches `run` actions whose normalized command starts with these tokens. */\n  | { kind: 'run'; prefix: string }\n  /** Matches a single-file action of that op when the path matches the glob. */\n  | { kind: 'edit' | 'create' | 'delete'; glob: string }\n  /** Matches external `tool` calls by tool name. */\n  | { kind: 'tool'; tool: string };\n\nexport function approvalsPath(root: string): string {\n  return path.join(root, '.vibgrate', 'code-approvals.json');\n}\n\n/**\n * The stable identity of a rule — used for dedupe and for revocation from\n * hosts that only carry the display string.\n */\nexport function ruleKey(rule: ApprovalRule): string {\n  if (rule.kind === 'run') return `run:${rule.prefix}`;\n  if (rule.kind === 'tool') return `tool:${rule.tool}`;\n  return `${rule.kind}:${rule.glob}`;\n}\n\n/** Human-readable label for notices and manage UIs. */\nexport function ruleLabel(rule: ApprovalRule): string {\n  if (rule.kind === 'run') return `run \\`${rule.prefix} …\\``;\n  if (rule.kind === 'tool') return `call ${rule.tool}`;\n  return `${rule.kind} ${rule.glob}`;\n}\n\n/**\n * Load the rule set, tolerating absence and malformed JSON (an unreadable file\n * means \"no rules\", never a crash — same posture as `.vibgrate/code.json`).\n * Unknown shapes are dropped so an untrusted file cannot inject junk.\n */\nexport function loadApprovalRules(root: string): ApprovalRule[] {\n  let raw: unknown;\n  try {\n    raw = JSON.parse(fs.readFileSync(approvalsPath(root), 'utf8'));\n  } catch {\n    return [];\n  }\n  const list = Array.isArray(raw)\n    ? raw\n    : raw && typeof raw === 'object' && Array.isArray((raw as { rules?: unknown }).rules)\n      ? ((raw as { rules: unknown[] }).rules)\n      : [];\n  const out: ApprovalRule[] = [];\n  for (const item of list) {\n    const rule = sanitizeRule(item);\n    if (rule) out.push(rule);\n  }\n  return dedupe(out);\n}\n\nfunction sanitizeRule(item: unknown): ApprovalRule | null {\n  if (!item || typeof item !== 'object') return null;\n  const o = item as Record<string, unknown>;\n  if (o.kind === 'run' && typeof o.prefix === 'string' && o.prefix.trim()) {\n    return { kind: 'run', prefix: normalizeCommandPrefix(o.prefix) };\n  }\n  if (o.kind === 'tool' && typeof o.tool === 'string' && o.tool.trim()) {\n    return { kind: 'tool', tool: o.tool.trim() };\n  }\n  if ((o.kind === 'edit' || o.kind === 'create' || o.kind === 'delete') && typeof o.glob === 'string' && o.glob.trim()) {\n    return { kind: o.kind, glob: o.glob.trim() };\n  }\n  return null;\n}\n\nfunction dedupe(rules: ApprovalRule[]): ApprovalRule[] {\n  const seen = new Set<string>();\n  const out: ApprovalRule[] = [];\n  for (const r of rules) {\n    const key = ruleKey(r);\n    if (seen.has(key)) continue;\n    seen.add(key);\n    out.push(r);\n  }\n  return out;\n}\n\n/**\n * Persist the rule set, deterministically sorted so identical sets produce an\n * identical file. Best-effort like other `.vibgrate/` writers — a read-only\n * checkout means no standing rules, never a thrown error mid-approval.\n */\nexport function saveApprovalRules(root: string, rules: ApprovalRule[]): boolean {\n  try {\n    const dir = path.join(root, '.vibgrate');\n    fs.mkdirSync(dir, { recursive: true });\n    // First writer into .vibgrate/ creates its .gitignore (create-once): one\n    // developer's standing consents must not ride into the team's repo.\n    ensureVibgrateGitignore(root);\n    const sorted = dedupe(rules).slice().sort((a, b) => ruleKey(a).localeCompare(ruleKey(b)));\n    fs.writeFileSync(approvalsPath(root), `${JSON.stringify({ rules: sorted }, null, 2)}\\n`);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/** Add one rule (deduped). Returns the saved rule, or null when nothing was written. */\nexport function addApprovalRule(root: string, rule: ApprovalRule): ApprovalRule | null {\n  const rules = loadApprovalRules(root);\n  if (rules.some((r) => ruleKey(r) === ruleKey(rule))) return rule;\n  rules.push(rule);\n  return saveApprovalRules(root, rules) ? rule : null;\n}\n\n/** Remove the rule with this {@link ruleKey}. Returns true when one was removed and saved. */\nexport function removeApprovalRule(root: string, key: string): boolean {\n  const rules = loadApprovalRules(root);\n  const kept = rules.filter((r) => ruleKey(r) !== key);\n  if (kept.length === rules.length) return false;\n  return saveApprovalRules(root, kept);\n}\n\n/**\n * Normalize a shell command to its rule prefix: the first two tokens for the\n * `cmd subcommand [flags…]` shape (`git status`, `pnpm test --watch`), the\n * single token for a one-word command, and the *whole* command\n * (whitespace-normalized) in every other case. Collapsing `rm -f temp.log` to\n * bare `rm` — or `rm foo.log secrets.env` to `rm foo.log` — would turn one\n * blessed invocation into a standing grant covering paths the user never saw\n * (2026-08 audit, D2), so a command with a flag second-token or positional\n * arguments beyond the subcommand keeps its exact form.\n */\nexport function normalizeCommandPrefix(command: string): string {\n  const tokens = command.trim().split(/\\s+/).filter(Boolean);\n  const head = tokens[0] ?? '';\n  const second = tokens[1];\n  if (!second) return head;\n  if (second.startsWith('-')) return tokens.join(' ');\n  // Extra positionals after `cmd subcommand` make the rule exact; trailing\n  // flags still collapse to the extensible two-token prefix.\n  if (tokens.slice(2).some((t) => !t.startsWith('-'))) return tokens.join(' ');\n  return `${head} ${second}`;\n}\n\n/** True when a rule prefix is the extensible `cmd [subcommand]` shape (no flags). */\nfunction extensiblePrefix(prefix: string): boolean {\n  return !prefix.split(' ').some((t) => t.startsWith('-'));\n}\n\n/**\n * Shell constructs that can smuggle a second command into what looks like a\n * flag: command substitution, redirects, sequencing, backgrounding, subshells.\n * A `pnpm test` rule must not bless `pnpm test --reporter=$(curl … | sh)` —\n * the appended token is flag-shaped, but its *value* is another program the\n * user never saw. Same screen {@link readOnlyCommand} applies; kept local so\n * safety and approvals stay independent modules.\n */\nconst SHELL_METACHARS = /[><;&|`\\n(){}$]/;\n\n/**\n * Derive the standing rule an \"Always allow\" on this action should create.\n * Patch actions return null — an atomic multi-file transaction has no single\n * honest generalisation, so hosts do not offer Always on patch cards.\n */\nexport function ruleForAction(action: MutatingAction): ApprovalRule | null {\n  switch (action.kind) {\n    case 'run':\n      return { kind: 'run', prefix: normalizeCommandPrefix(action.command) };\n    case 'tool':\n      return { kind: 'tool', tool: action.name };\n    case 'edit':\n    case 'create':\n    case 'delete':\n      return { kind: action.kind, glob: action.file };\n    case 'patch':\n      return null;\n  }\n}\n\n/**\n * Minimal glob match for rule paths: `*` matches within a segment, `**`\n * across segments, `?` one character. Deterministic, no dependency, and\n * conservative — a malformed pattern simply never matches.\n */\nexport function globMatch(glob: string, file: string): boolean {\n  let re = '';\n  for (let i = 0; i < glob.length; i++) {\n    const c = glob[i];\n    if (c === '*') {\n      if (glob[i + 1] === '*') {\n        // `**/` or trailing `**` — match across segments.\n        re += '.*';\n        i += glob[i + 2] === '/' ? 2 : 1;\n      } else {\n        re += '[^/]*';\n      }\n    } else if (c === '?') {\n      re += '[^/]';\n    } else if ('\\\\^$.|+()[]{}'.includes(c)) {\n      re += `\\\\${c}`;\n    } else {\n      re += c;\n    }\n  }\n  try {\n    return new RegExp(`^${re}$`).test(file);\n  } catch {\n    return false;\n  }\n}\n\nfunction fileRuleMatches(rules: ApprovalRule[], op: 'edit' | 'create' | 'delete', file: string): ApprovalRule | null {\n  for (const r of rules) {\n    if (r.kind === op && globMatch(r.glob, file)) return r;\n  }\n  return null;\n}\n\n/**\n * The first rule matching this action, or null. A `patch` matches only when\n * *every* file in the transaction is covered by a matching file rule — an\n * atomic approval must never be half-earned.\n */\nexport function findMatchingRule(action: MutatingAction, rules: ApprovalRule[]): ApprovalRule | null {\n  if (!rules.length) return null;\n  switch (action.kind) {\n    case 'run': {\n      // Match the FULL whitespace-normalized command, never a truncated form:\n      // collapsing `rm foo.log secrets.env` to its first two tokens before\n      // comparing would silently discard the appended argument and let a rule\n      // saved for `rm foo.log` bless it (2026-08 audit, D2).\n      const full = action.command.trim().split(/\\s+/).filter(Boolean).join(' ');\n      for (const r of rules) {\n        if (r.kind !== 'run') continue;\n        if (full === r.prefix) return r;\n        // A `cmd [subcommand]` prefix extends to longer commands only when\n        // every appended token is a flag (`git status --short`). Appended\n        // positionals (extra paths, script arguments) are new state the user\n        // never blessed — they re-prompt, and can be Always-allowed exactly.\n        if (extensiblePrefix(r.prefix) && full.startsWith(`${r.prefix} `)) {\n          const tail = full.slice(r.prefix.length + 1);\n          // A flag whose value is a subshell is not an extension of the blessed\n          // command, it is a different one — screen the appended text before\n          // the flag-shape check, never after.\n          if (SHELL_METACHARS.test(tail)) continue;\n          const extension = tail.split(' ');\n          if (extension.every((t) => t.startsWith('-'))) return r;\n        }\n      }\n      return null;\n    }\n    case 'tool':\n      return rules.find((r) => r.kind === 'tool' && r.tool === action.name) ?? null;\n    case 'edit':\n    case 'create':\n    case 'delete':\n      return fileRuleMatches(rules, action.kind, action.file);\n    case 'patch': {\n      const covered = action.files.every((f: PatchFileAction) => fileRuleMatches(rules, f.op, f.file));\n      if (!covered) return null;\n      return fileRuleMatches(rules, action.files[0]!.op, action.files[0]!.file);\n    }\n  }\n}\n"]}

package/dist/{chunk-7ZHSSGUF.js → chunk-WQLZSVNF.js}

@@ -1,4 +1,5 @@
-import { loadGraphFileWithSnapshot, resolveGraphPath, cacheDir } from './chunk-EWZKOU66.js';
+import { cacheDir } from './chunk-2U37PFB2.js';
+import { loadGraphFileWithSnapshot, resolveGraphPath } from './chunk-75LJM5XD.js';
 import { __require } from './chunk-Z6ZWNWWR.js';
 import * as fs from 'fs';
 import * as path from 'path';
@@ -198,5 +199,5 @@ function loadGraph(root, graphPath) {
 }
 
 export { SCHEMA_VERSION, loadGraph, loadGraphPreferIndex, writeGraphIndex };
-//# sourceMappingURL=chunk-7ZHSSGUF.js.map
-//# sourceMappingURL=chunk-7ZHSSGUF.js.map
+//# sourceMappingURL=chunk-WQLZSVNF.js.map
+//# sourceMappingURL=chunk-WQLZSVNF.js.map

package/dist/chunk-WQLZSVNF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/schema.ts","../src/engine/index-db.ts","../src/engine/load.ts"],"names":[],"mappings":";;;;;;;AASO,IAAM,cAAA,GAAiB;;;AC2BvB,SAAS,YAAY,IAAA,EAAsB;AAChD,EAAA,OAAY,IAAA,CAAA,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG,UAAU,CAAA;AAC7C;AAGO,SAAS,eAAA,CAAgB,MAAc,KAAA,EAAkC;AAC9E,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI;AAEF,IAAA,MAAM,EAAE,YAAA,EAAa,GAAI,SAAA,CAAQ,QAAa,CAAA;AAC9C,IAAG,aAAe,IAAA,CAAA,OAAA,CAAQ,IAAI,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AACpD,IAAA,MAAM,GAAA,GAAM,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,QAAQ,GAAG,CAAA,IAAA,CAAA;AAClC,IAAA,IAAI;AACF,MAAA,IAAO,EAAA,CAAA,UAAA,CAAW,GAAG,CAAA,EAAM,cAAW,GAAG,CAAA;AAAA,IAC3C,CAAA,CAAA,MAAQ;AAAA,IAER;AAEA,IAAA,MAAM,EAAA,GAAK,IAAI,YAAA,CAAa,GAAG,CAAA;AAC/B,IAAA,EAAA,CAAG,IAAA,CAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAwCP,CAAA;AAED,IAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,CAAQ,4CAA4C,CAAA;AACvE,IAAA,OAAA,CAAQ,GAAA,CAAI,YAAA,EAAc,KAAA,CAAM,UAAA,CAAW,UAAU,CAAA;AACrD,IAAA,OAAA,CAAQ,GAAA,CAAI,eAAA,EAAiB,KAAA,CAAM,aAAa,CAAA;AAChD,IAAA,OAAA,CAAQ,GAAA,CAAI,aAAA,EAAe,KAAA,CAAM,WAAW,CAAA;AAC5C,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,GAAA,CAAI,cAAA,EAAgB,KAAA,CAAM,IAAA,CAAK,gBAAgB,MAAM,CAAA;AAC7D,IAAA,OAAA,CAAQ,GAAA,CAAI,gBAAgB,kBAAkB,CAAA;AAE9C,IAAA,OAAA,CAAQ,IAAI,WAAA,EAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAI,iBAAA,EAAmB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,UAAU,CAAC,CAAA;AAC/D,IAAA,IAAI,KAAA,CAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,aAAa,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,KAAK,CAAC,CAAA;AACrE,IAAA,IAAI,KAAA,CAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,iBAAiB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,SAAS,CAAC,CAAA;AACjF,IAAA,IAAI,KAAA,CAAM,WAAW,OAAA,CAAQ,GAAA,CAAI,iBAAiB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,SAAS,CAAC,CAAA;AACjF,IAAA,IAAI,KAAA,CAAM,UAAU,OAAA,CAAQ,GAAA,CAAI,gBAAgB,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,QAAQ,CAAC,CAAA;AAE9E,IAAA,MAAM,UAAU,EAAA,CAAG,OAAA;AAAA,MACjB,CAAA;AAAA,+CAAA;AAAA,KAEF;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,CAAE,EAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,aAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,EAAE,IAAA,CAAK,KAAA;AAAA,QACP,CAAA,CAAE,UAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA;AAAA,QACd,CAAA,CAAE,IAAA;AAAA,QACF,IAAA,CAAK,UAAU,CAAC;AAAA,OAClB;AAAA,IACF;AAEA,IAAA,MAAM,UAAU,EAAA,CAAG,OAAA;AAAA,MACjB,CAAA;AAAA,sCAAA;AAAA,KAEF;AACA,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,CAAA,CAAE,EAAA;AAAA,QACF,CAAA,CAAE,IAAA;AAAA,QACF,CAAA,CAAE,GAAA;AAAA,QACF,CAAA,CAAE,GAAA;AAAA,QACF,CAAA,CAAE,UAAA;AAAA,QACF,CAAA,CAAE,UAAA;AAAA,QACF,EAAE,SAAA,IAAa,UAAA;AAAA,QACf,IAAA,CAAK,UAAU,CAAC;AAAA,OAClB;AAAA,IACF;AAEA,IAAA,MAAM,OAAA,GAAU,EAAA,CAAG,OAAA,CAAQ,2CAA2C,CAAA;AACtE,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,MAAA,OAAA,CAAQ,IAAI,CAAA,CAAE,EAAA,EAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA;AAAA,IACrC;AAEA,IAAA,EAAA,CAAG,KAAA,EAAM;AACT,IAAG,EAAA,CAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AACvB,IAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,EAAA,EAAI,IAAA,EAAK;AAAA,EACtF,SAAS,GAAA,EAAK;AACZ,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,IAAA;AAAA,MACN,KAAA,EAAO,CAAA;AAAA,MACP,KAAA,EAAO,CAAA;AAAA,MACP,EAAA,EAAI,KAAA;AAAA,MACJ,QAAS,GAAA,CAAc;AAAA,KACzB;AAAA,EACF;AACF;AAoHO,SAAS,mBAAmB,IAAA,EAA8B;AAC/D,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI,CAAI,EAAA,CAAA,UAAA,CAAW,IAAI,CAAA,EAAG,OAAO,IAAA;AACjC,EAAA,IAAI;AAEF,IAAA,MAAM,EAAE,YAAA,EAAa,GAAI,SAAA,CAAQ,QAAa,CAAA;AAC9C,IAAA,MAAM,KAAK,IAAI,YAAA,CAAa,MAAM,EAAE,QAAA,EAAU,MAAM,CAAA;AACpD,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,6BAA6B,EAAE,GAAA,EAAI;AAI/D,IAAA,MAAM,OAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU,IAAA,CAAK,CAAA,CAAE,GAAG,IAAI,CAAA,CAAE,KAAA;AAE1C,IAAA,IAAI,IAAA,CAAK,iBAAiB,kBAAA,IAAsB,CAAC,KAAK,SAAA,IAAa,CAAC,KAAK,eAAA,EAAiB;AACxF,MAAA,EAAA,CAAG,KAAA,EAAM;AACT,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,MAAM,QAAA,GAAW,EAAA,CAAG,OAAA,CAAQ,oCAAoC,EAAE,GAAA,EAAI;AAGtE,IAAA,EAAA,CAAG,KAAA,EAAM;AAET,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAc,CAAA;AACjE,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAc,CAAA;AACjE,IAAA,MAAM,KAAA,GAAQ,SAAS,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAI,CAAS,CAAA;AAG5D,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,EAAA,CAAG,aAAA,CAAc,CAAA,CAAE,EAAE,CAAC,CAAA;AAC7C,IAAA,KAAA,CAAM,IAAA;AAAA,MACJ,CAAC,CAAA,EAAG,CAAA,KACF,EAAE,IAAA,CAAK,aAAA,CAAc,EAAE,IAAI,CAAA,IAAK,EAAE,GAAA,CAAI,aAAA,CAAc,EAAE,GAAG,CAAA,IAAK,EAAE,GAAA,CAAI,aAAA,CAAc,EAAE,GAAG;AAAA,KAC3F;AACA,IAAA,KAAA,CAAM,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,EAAA,GAAK,EAAE,EAAE,CAAA;AAEhC,IAAA,MAAM,KAAA,GAAiB;AAAA,MACrB,aAAA,EAAgB,KAAK,aAAA,IAA2C,cAAA;AAAA,MAChE,aAAa,IAAA,CAAK,WAAA,IAAA,qBAAmB,IAAA,CAAK,CAAC,GAAE,WAAA,EAAY;AAAA,MACzD,UAAA,EAAY,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,eAAe,CAAA;AAAA,MAC3C,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA;AAAA,MAC/B,KAAA;AAAA,MACA,KAAA;AAAA,MACA;AAAA,KACF;AACA,IAAA,IAAI,KAAK,SAAA,EAAW,KAAA,CAAM,QAAQ,IAAA,CAAK,KAAA,CAAM,KAAK,SAAS,CAAA;AAC3D,IAAA,IAAI,KAAK,aAAA,EAAe,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,aAAa,CAAA;AACvE,IAAA,IAAI,KAAK,aAAA,EAAe,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,aAAa,CAAA;AACvE,IAAA,IAAI,KAAK,YAAA,EAAc,KAAA,CAAM,WAAW,IAAA,CAAK,KAAA,CAAM,KAAK,YAAY,CAAA;AAGpE,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,CAAC,CAAA,CAAE,UAAA,EAAY,CAAA,CAAE,UAAA,GAAa,WAAA;AAClC,MAAA,IAAI,CAAC,CAAA,CAAE,SAAA,EAAW,CAAA,CAAE,SAAA,GAAY,UAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAOO,SAAS,oBAAA,CACd,MACA,aAAA,EACqD;AAIrD,EAAA,MAAM,SAAA,GAA4B,0BAA0B,aAAa,CAAA;AAEzE,EAAA,MAAM,SAAA,GAAY,mBAAmB,IAAI,CAAA;AACzC,EAAA,IAAI,SAAA,EAAW;AACb,IAAA,IAAI,CAAC,SAAA,IAAa,SAAA,CAAU,WAAW,UAAA,KAAe,SAAA,CAAU,WAAW,UAAA,EAAY;AACrF,MAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,MAAA,EAAQ,OAAA,EAAQ;AAAA,IAC7C;AAAA,EAEF;AACA,EAAA,IAAI,WAAW,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,QAAQ,MAAA,EAAO;AACzD,EAAA,OAAO,IAAA;AACT;;;ACxWO,SAAS,SAAA,CAAU,MAAc,SAAA,EAAoC;AAC1E,EAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,IAAA,EAAM,SAAS,CAAA;AAG7C,EAAA,IAAI,CAAC,SAAA,EAAW;AACd,IAAA,MAAM,SAAA,GAAY,oBAAA,CAAqB,IAAA,EAAM,IAAI,CAAA;AACjD,IAAA,IAAI,SAAA,SAAkB,SAAA,CAAU,KAAA;AAAA,EAClC;AACA,EAAA,OAAO,0BAA0B,IAAI,CAAA;AACvC","file":"chunk-WQLZSVNF.js","sourcesContent":["/**\n * The `vg-graph/1.0` on-disk schema.\n *\n * This is vg's own open schema (VG-PACKAGE-AND-SCHEMA.md §4) — informed by good\n * ideas (content-hashed ids, epistemic typing of facts) but standalone and\n * self-contained. Every collection is deterministically serialized\n * (sorted keys, stable element order). These TypeScript shapes are normative.\n */\n\nexport const SCHEMA_VERSION = 'vg-graph/1.0' as const;\n\nexport type ResolverKind = 'scip' | 'stackgraph' | 'tsc' | 'heuristic';\n\n/** Coarse, honest resolution tier for an edge (see engine/epistemic.ts). */\nexport type EpistemicTier = 'observed' | 'name-matched' | 'declared';\n\n/**\n * The toolchain that produced this graph — the reproducibility fingerprint.\n * Everything here deterministically affects graph *content* (parse trees change\n * between grammar releases; resolvers change which edges resolve), so a CI run\n * and a laptop run that disagree can be caught by comparing `fingerprint`.\n * Deliberately excludes the Node/OS version so the graph stays byte-stable\n * across host runtimes; `fingerprint` pins the parse/resolve toolchain only.\n */\nexport interface Toolchain {\n  schema: string; // SCHEMA_VERSION\n  tool: string; // vg calendar version\n  grammars: string; // tree-sitter grammar set version string\n  resolvers: ResolverKind[]; // resolver kinds available, sorted\n  fingerprint: string; // shortId over the fields above — the value `vg attest` signs\n}\n\nexport interface Provenance {\n  tool: 'vg';\n  version: string; // calendar version\n  grammars: Record<string, string>; // lang → grammar version (determinism input)\n  resolver: ResolverKind[];\n  deep: boolean; // did the heavier open passes run\n  semanticModel?: string; // embedding model id+version if --deep semantic links\n  corpusHash: string; // blake3 over the included file set + hashes\n  toolchain?: Toolchain; // reproducibility fingerprint (checked by `vg verify`)\n}\n\n/** Analysis cost tier — auto-selected by node count (or forced). Reported honestly. */\nexport type AnalysisTier = 'full' | 'large' | 'xl';\n\nexport interface GraphMeta {\n  root: string; // relative; portable across machines\n  languages: string[];\n  counts: {\n    nodes: number;\n    edges: number;\n    areas: number;\n    tests: number;\n    untested: number;\n  };\n  cluster: 'leiden' | 'louvain' | 'none';\n  /** Auto-selected (or forced) analysis tier for large maps. */\n  analysisTier?: AnalysisTier;\n  edgeKinds: EdgeKind[];\n}\n\nexport type NodeKind =\n  | 'file'\n  | 'module'\n  | 'package'\n  | 'class'\n  | 'interface'\n  | 'function'\n  | 'method'\n  | 'property'\n  | 'test'\n  | 'route'\n  | 'component'\n  /** Documentation / config text ingested for semantic ask (markdown, txt, env examples). */\n  | 'document'\n  | 'external';\n\nexport interface Span {\n  start: number; // 1-based start line\n  end: number; // 1-based end line\n}\n\nexport interface Centrality {\n  degree: number;\n  pagerank: number;\n  betweenness: number;\n  eigenvector: number;\n}\n\nexport interface GraphNode {\n  id: string; // blake3(canonical(kind, qualifiedName, file, signature))\n  kind: NodeKind;\n  name: string; // short name\n  qualifiedName: string;\n  file: string; // relative path\n  span: Span; // line range (excluded from id hash)\n  lang: string;\n  visibility?: 'public' | 'private' | 'protected' | 'internal';\n  signature?: string;\n  doc?: string; // short leading doc-comment / docstring summary (deterministic; not a full body)\n  importance: number; // 0..1 blended centrality\n  centrality: Centrality;\n  area: number; // area id (the node's community); -1 = unassigned (cluster \"none\")\n  isHub: boolean; // centrality outlier — surfaced by `vg hubs`\n  tested: boolean | null; // null = not analyzable (e.g. external)\n  coverage?: number; // 0..1 line coverage if a coverage report was ingested\n  changeCoupling?: string[]; // node ids that historically change together\n}\n\nexport type EdgeKind =\n  | 'call'\n  | 'import'\n  | 'contains'\n  | 'extends'\n  | 'implements'\n  | 'references'\n  | 'test'\n  | 'coverage';\n\nexport interface GraphEdge {\n  id: string; // blake3(canonical(kind, src, dst))\n  kind: EdgeKind;\n  src: string; // node id\n  dst: string; // node id\n  resolution: ResolverKind; // how the edge was resolved\n  confidence: number; // 0..1 (1.0 for scip/declared; lower for heuristic/dynamic)\n  epistemic?: EpistemicTier; // coarse honesty tier derived from resolution+kind\n  surprise?: number; // 0..1 improbability under the area model (`vg oddities`)\n  count?: number; // call-site multiplicity\n}\n\nexport interface Area {\n  id: number; // stable across runs (remapped to previous committed map)\n  label: string; // most-central member's name (editable via `vg label`)\n  size: number;\n  members: string[]; // node ids, sorted\n  cohesion: number; // 0..1\n  externalEdges: number; // cross-area edge count\n}\n\nexport type FactKind = 'contract' | 'invariant' | 'characterization';\nexport type DerivedBy = 'declared' | 'static';\nexport type FactConfidence = 'Observed' | 'Derived';\n\nexport interface Fact {\n  id: string; // blake3(canonical(kind, subjectIds, predicate))\n  kind: FactKind;\n  subjectIds: string[]; // node ids this fact constrains\n  predicate: unknown; // the constraint\n  derivedBy: DerivedBy;\n  confidence: FactConfidence;\n  evidence: { file: string; span: Span }[];\n}\n\n/**\n * A reference the graph could not resolve — surfaced by `vg unknowns`. Reporting\n * what it *cannot* connect (ranked by blast radius) is the honest inverse of a\n * scanner that hides its unknowns. Only unknowns the precise rungs (tsc/scip)\n * did not supersede are recorded, so a compiler-resolved file never shows here.\n */\nexport interface Unknown {\n  from: string; // node id where the unresolved reference occurs\n  name: string; // the callee/type name that could not be resolved\n  kind: 'call' | 'extends' | 'implements';\n  count: number; // occurrences at this site\n}\n\nexport type GroundingKind = 'should_follow' | 'smells_like' | 'relevant_to';\n\nexport interface GroundingEdge {\n  src: string; // node id\n  packEntryId: string;\n  kind: GroundingKind;\n  confidence: number; // 0..1\n  rationale: 'recommended' | 'conjectured';\n  citation: { title: string; url: string };\n}\n\n/** Precomputed hub blast-radius counts for fast agent answers (optional). */\nexport interface HubBlastSummary {\n  id: string;\n  name: string;\n  kind: string;\n  file: string;\n  importance: number;\n  direct: number;\n  depth2: number;\n  files: number;\n  tested: boolean | null;\n}\n\nexport interface GraphSummaries {\n  hubs: HubBlastSummary[];\n}\n\nexport interface VgGraph {\n  schemaVersion: typeof SCHEMA_VERSION;\n  generatedAt: string; // ISO; the ONLY nondeterministic field (pinned by --generated-at)\n  provenance: Provenance;\n  meta: GraphMeta;\n  nodes: GraphNode[]; // sorted by id\n  edges: GraphEdge[]; // sorted by (kind, src, dst)\n  areas: Area[]; // sorted by id\n  facts?: Fact[]; // open facts (contract/invariant/characterization); sorted by id\n  grounding?: GroundingEdge[]; // free-pack grounding (default on; omit with --no-ground)\n  unknowns?: Unknown[]; // heuristic references left unresolved; sorted by (from, kind, name)\n  /** Build-time hub blast-radius summaries (always on; tiny). */\n  summaries?: GraphSummaries;\n}\n","/**\n * SQLite serve index for large maps (scale past flat-JSON-only serve).\n *\n * The canonical artifact remains `graph.json` (determinism / git). The index\n * at `.vibgrate/cache/graph.db` is a derived, gitignored structure built after\n * every successful build:\n *   - denormalized name/edge columns for O(log n) lookup\n *   - full node/edge/area JSON for reconstructing a `VgGraph` without parsing\n *     the pretty-printed graph.json (faster cold serve on XL maps)\n *\n * Uses Node's built-in `node:sqlite` (Node ≥22) — no native npm dependency.\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { cacheDir } from './cache.js';\nimport { loadGraphFileWithSnapshot } from './snapshot.js';\nimport type {\n  Area,\n  EpistemicTier,\n  GraphEdge,\n  GraphNode,\n  ResolverKind,\n  VgGraph,\n} from '../schema.js';\nimport { SCHEMA_VERSION } from '../schema.js';\n\nexport interface IndexWriteResult {\n  path: string;\n  nodes: number;\n  edges: number;\n  /** False when node:sqlite is unavailable — callers should not fail the build. */\n  ok: boolean;\n  reason?: string;\n}\n\nexport function indexDbPath(root: string): string {\n  return path.join(cacheDir(root), 'graph.db');\n}\n\n/** Write (replace) the SQLite index from a built graph. Never throws to callers. */\nexport function writeGraphIndex(root: string, graph: VgGraph): IndexWriteResult {\n  const file = indexDbPath(root);\n  try {\n     \n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    fs.mkdirSync(path.dirname(file), { recursive: true });\n    const tmp = `${file}.${process.pid}.tmp`;\n    try {\n      if (fs.existsSync(tmp)) fs.unlinkSync(tmp);\n    } catch {\n      /* ignore */\n    }\n\n    const db = new DatabaseSync(tmp);\n    db.exec(`\n      PRAGMA journal_mode = OFF;\n      PRAGMA synchronous = OFF;\n      CREATE TABLE meta (\n        key TEXT PRIMARY KEY,\n        value TEXT NOT NULL\n      );\n      CREATE TABLE nodes (\n        id TEXT PRIMARY KEY,\n        name TEXT NOT NULL,\n        qualified_name TEXT NOT NULL,\n        kind TEXT NOT NULL,\n        file TEXT NOT NULL,\n        line INTEGER NOT NULL,\n        importance REAL NOT NULL,\n        area INTEGER NOT NULL,\n        is_hub INTEGER NOT NULL,\n        lang TEXT NOT NULL,\n        json TEXT NOT NULL\n      );\n      CREATE TABLE edges (\n        id TEXT PRIMARY KEY,\n        kind TEXT NOT NULL,\n        src TEXT NOT NULL,\n        dst TEXT NOT NULL,\n        resolution TEXT NOT NULL,\n        confidence REAL NOT NULL,\n        epistemic TEXT NOT NULL,\n        json TEXT NOT NULL\n      );\n      CREATE TABLE areas (\n        id INTEGER PRIMARY KEY,\n        json TEXT NOT NULL\n      );\n      CREATE INDEX idx_nodes_name ON nodes(name);\n      CREATE INDEX idx_nodes_qn ON nodes(qualified_name);\n      CREATE INDEX idx_nodes_file ON nodes(file);\n      CREATE INDEX idx_edges_src ON edges(src);\n      CREATE INDEX idx_edges_dst ON edges(dst);\n      CREATE INDEX idx_edges_kind ON edges(kind);\n    `);\n\n    const insMeta = db.prepare('INSERT INTO meta(key, value) VALUES (?, ?)');\n    insMeta.run('corpusHash', graph.provenance.corpusHash);\n    insMeta.run('schemaVersion', graph.schemaVersion);\n    insMeta.run('generatedAt', graph.generatedAt);\n    insMeta.run('nodeCount', String(graph.nodes.length));\n    insMeta.run('edgeCount', String(graph.edges.length));\n    insMeta.run('analysisTier', graph.meta.analysisTier ?? 'full');\n    insMeta.run('indexVersion', 'vg-graph-index/2');\n    // Full meta + provenance for reconstruct without graph.json parse.\n    insMeta.run('graphMeta', JSON.stringify(graph.meta));\n    insMeta.run('graphProvenance', JSON.stringify(graph.provenance));\n    if (graph.facts) insMeta.run('factsJson', JSON.stringify(graph.facts));\n    if (graph.grounding) insMeta.run('groundingJson', JSON.stringify(graph.grounding));\n    if (graph.summaries) insMeta.run('summariesJson', JSON.stringify(graph.summaries));\n    if (graph.unknowns) insMeta.run('unknownsJson', JSON.stringify(graph.unknowns));\n\n    const insNode = db.prepare(\n      `INSERT INTO nodes(id, name, qualified_name, kind, file, line, importance, area, is_hub, lang, json)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`,\n    );\n    for (const n of graph.nodes) {\n      insNode.run(\n        n.id,\n        n.name,\n        n.qualifiedName,\n        n.kind,\n        n.file,\n        n.span.start,\n        n.importance,\n        n.area,\n        n.isHub ? 1 : 0,\n        n.lang,\n        JSON.stringify(n),\n      );\n    }\n\n    const insEdge = db.prepare(\n      `INSERT INTO edges(id, kind, src, dst, resolution, confidence, epistemic, json)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`,\n    );\n    for (const e of graph.edges) {\n      insEdge.run(\n        e.id,\n        e.kind,\n        e.src,\n        e.dst,\n        e.resolution,\n        e.confidence,\n        e.epistemic ?? 'observed',\n        JSON.stringify(e),\n      );\n    }\n\n    const insArea = db.prepare('INSERT INTO areas(id, json) VALUES (?, ?)');\n    for (const a of graph.areas) {\n      insArea.run(a.id, JSON.stringify(a));\n    }\n\n    db.close();\n    fs.renameSync(tmp, file);\n    return { path: file, nodes: graph.nodes.length, edges: graph.edges.length, ok: true };\n  } catch (err) {\n    return {\n      path: file,\n      nodes: 0,\n      edges: 0,\n      ok: false,\n      reason: (err as Error).message,\n    };\n  }\n}\n\nexport interface NameHit {\n  id: string;\n  name: string;\n  qualifiedName: string;\n  kind: string;\n  file: string;\n  line: number;\n  importance: number;\n}\n\n/** Fast name / prefix lookup against the index. Empty if index missing. */\nexport function lookupNameIndex(root: string, query: string, limit = 20): NameHit[] {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file) || !query.trim()) return [];\n  try {\n     \n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const q = query.trim();\n    const rows = db\n      .prepare(\n        `SELECT id, name, qualified_name, kind, file, line, importance\n         FROM nodes\n         WHERE name = ? OR qualified_name = ? OR name LIKE ? OR qualified_name LIKE ?\n         ORDER BY\n           CASE WHEN name = ? OR qualified_name = ? THEN 0\n                WHEN name LIKE ? THEN 1\n                ELSE 2 END,\n           importance DESC\n         LIMIT ?`,\n      )\n      .all(q, q, `${q}%`, `%${q}%`, q, q, `${q}%`, limit) as Record<string, unknown>[];\n    db.close();\n    return rows.map((r) => ({\n      id: String(r.id),\n      name: String(r.name),\n      qualifiedName: String(r.qualified_name),\n      kind: String(r.kind),\n      file: String(r.file),\n      line: Number(r.line),\n      importance: Number(r.importance),\n    }));\n  } catch {\n    return [];\n  }\n}\n\n/** Neighbor edges for a node id (src or dst). Empty if index missing. */\nexport function lookupNeighbors(\n  root: string,\n  nodeId: string,\n  direction: 'out' | 'in' | 'both' = 'both',\n  limit = 50,\n): GraphEdge[] {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file) || !nodeId) return [];\n  try {\n     \n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    let rows: Record<string, unknown>[] = [];\n    if (direction === 'out' || direction === 'both') {\n      rows = rows.concat(\n        db\n          .prepare(`SELECT json FROM edges WHERE src = ? LIMIT ?`)\n          .all(nodeId, limit) as Record<string, unknown>[],\n      );\n    }\n    if (direction === 'in' || direction === 'both') {\n      rows = rows.concat(\n        db\n          .prepare(`SELECT json FROM edges WHERE dst = ? LIMIT ?`)\n          .all(nodeId, limit) as Record<string, unknown>[],\n      );\n    }\n    db.close();\n    const byId = new Map<string, GraphEdge>();\n    for (const r of rows) {\n      try {\n        const e = JSON.parse(String(r.json)) as GraphEdge;\n        byId.set(e.id, e);\n      } catch {\n        /* skip bad row */\n      }\n    }\n    return [...byId.values()];\n  } catch {\n    return [];\n  }\n}\n\n/** Read index meta (corpusHash etc.) or null if missing. */\nexport function readIndexMeta(root: string): Record<string, string> | null {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file)) return null;\n  try {\n     \n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const rows = db.prepare('SELECT key, value FROM meta').all() as { key: string; value: string }[];\n    db.close();\n    const out: Record<string, string> = {};\n    for (const r of rows) out[r.key] = r.value;\n    return out;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Reconstruct a full `VgGraph` from the SQLite index (indexVersion ≥ 2).\n * Returns null if the index is missing, stale schema, or incomplete.\n * Prefer this over JSON.parse of pretty graph.json for cold serve on large maps.\n */\nexport function loadGraphFromIndex(root: string): VgGraph | null {\n  const file = indexDbPath(root);\n  if (!fs.existsSync(file)) return null;\n  try {\n     \n    const { DatabaseSync } = require('node:sqlite') as typeof import('node:sqlite');\n    const db = new DatabaseSync(file, { readOnly: true });\n    const metaRows = db.prepare('SELECT key, value FROM meta').all() as {\n      key: string;\n      value: string;\n    }[];\n    const meta: Record<string, string> = {};\n    for (const r of metaRows) meta[r.key] = r.value;\n\n    if (meta.indexVersion !== 'vg-graph-index/2' || !meta.graphMeta || !meta.graphProvenance) {\n      db.close();\n      return null;\n    }\n\n    const nodeRows = db.prepare('SELECT json FROM nodes ORDER BY id').all() as {\n      json: string;\n    }[];\n    const edgeRows = db.prepare('SELECT json FROM edges ORDER BY id').all() as {\n      json: string;\n    }[];\n    const areaRows = db.prepare('SELECT json FROM areas ORDER BY id').all() as {\n      json: string;\n    }[];\n    db.close();\n\n    const nodes = nodeRows.map((r) => JSON.parse(r.json) as GraphNode);\n    const edges = edgeRows.map((r) => JSON.parse(r.json) as GraphEdge);\n    const areas = areaRows.map((r) => JSON.parse(r.json) as Area);\n\n    // Stable sorts match serialize contract (ids already ordered by SQL, re-sort for safety).\n    nodes.sort((a, b) => a.id.localeCompare(b.id));\n    edges.sort(\n      (a, b) =>\n        a.kind.localeCompare(b.kind) || a.src.localeCompare(b.src) || a.dst.localeCompare(b.dst),\n    );\n    areas.sort((a, b) => a.id - b.id);\n\n    const graph: VgGraph = {\n      schemaVersion: (meta.schemaVersion as typeof SCHEMA_VERSION) || SCHEMA_VERSION,\n      generatedAt: meta.generatedAt ?? new Date(0).toISOString(),\n      provenance: JSON.parse(meta.graphProvenance),\n      meta: JSON.parse(meta.graphMeta),\n      nodes,\n      edges,\n      areas,\n    };\n    if (meta.factsJson) graph.facts = JSON.parse(meta.factsJson);\n    if (meta.groundingJson) graph.grounding = JSON.parse(meta.groundingJson);\n    if (meta.summariesJson) graph.summaries = JSON.parse(meta.summariesJson);\n    if (meta.unknownsJson) graph.unknowns = JSON.parse(meta.unknownsJson);\n\n    // Lightweight integrity: edge resolution types stay valid.\n    for (const e of edges) {\n      if (!e.resolution) e.resolution = 'heuristic' as ResolverKind;\n      if (!e.epistemic) e.epistemic = 'observed' as EpistemicTier;\n    }\n    return graph;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Load the graph preferring the SQLite index when its corpusHash matches the\n * committed graph.json provenance (or when only the index exists). Falls back\n * to graph.json. Returns null if neither is usable.\n */\nexport function loadGraphPreferIndex(\n  root: string,\n  graphJsonPath: string,\n): { graph: VgGraph; source: 'index' | 'json' } | null {\n  // Snapshot-first: skips the large-string JSON.parse when a fresh binary\n  // snapshot exists (sidecar or store-mode standalone), and self-heals the\n  // sidecar when not (see engine/snapshot.ts).\n  const jsonGraph: VgGraph | null = loadGraphFileWithSnapshot(graphJsonPath);\n\n  const fromIndex = loadGraphFromIndex(root);\n  if (fromIndex) {\n    if (!jsonGraph || fromIndex.provenance.corpusHash === jsonGraph.provenance.corpusHash) {\n      return { graph: fromIndex, source: 'index' };\n    }\n    // Index stale vs graph.json — prefer canonical JSON and let next build refresh.\n  }\n  if (jsonGraph) return { graph: jsonGraph, source: 'json' };\n  return null;\n}\n","import { resolveGraphPath } from './artifacts.js';\nimport { loadGraphFileWithSnapshot } from './snapshot.js';\nimport { loadGraphPreferIndex } from './index-db.js';\nimport type { VgGraph } from '../schema.js';\n\n/**\n * Load the code map for a repository.\n *\n * When `graphPath` is omitted, prefers an existing global-store snapshot, then\n * the legacy `.vibgrate/graph.json`, matching {@link resolveGraphPath}.\n * Prefers the SQLite index when its corpusHash matches the committed map\n * (faster cold serve on large repos). Returns null if none exists.\n */\nexport function loadGraph(root: string, graphPath?: string): VgGraph | null {\n  const file = resolveGraphPath(root, graphPath);\n  // Index is always rooted at the project root; only use it when loading the\n  // default map for that root (not an arbitrary --graph path).\n  if (!graphPath) {\n    const preferred = loadGraphPreferIndex(root, file);\n    if (preferred) return preferred.graph;\n  }\n  return loadGraphFileWithSnapshot(file);\n}\n"]}

package/dist/{chunk-3WUTQYRY.js → chunk-WWGLVF7D.js}

@@ -1,13 +1,14 @@
-import { loadConfig, computeUpgradeImpact, getChangelogSignals, gitHistoryAvailable, buildVersionTimelines, findPackageTimeline, severityRank, projectTypeToVulnEcosystem } from './chunk-N6ZMZ5AI.js';
 import { availableRegionIds, resolveIngestHost, dashHostForIngestHost, ingestHostForRegionId } from './chunk-HTLDXEHW.js';
-import { searchSymbols, resolveVersion, resolveLib, loadCatalog, driftFor, localPackageDocs, readDoc, inventory, localApiSurface } from './chunk-UZP623Y4.js';
+import { loadConfig, computeUpgradeImpact, getChangelogSignals, gitHistoryAvailable, buildVersionTimelines, findPackageTimeline, severityRank, projectTypeToVulnEcosystem } from './chunk-N6ZMZ5AI.js';
+import { searchSymbols, resolveVersion, resolveLib, loadCatalog, driftFor, localPackageDocs, readDoc, inventory, localApiSurface } from './chunk-7QDHQLUS.js';
+import { resolveOne } from './chunk-J7LKEB2R.js';
+import { impactOf, indexFor, queryGraphSemantic, queryGraph } from './chunk-KGPX4EUN.js';
 import { discoverModels } from './chunk-CQDUBAQY.js';
 import { loadOrDiscoverFederation, highConfidenceBridges } from './chunk-5I4VSBWQ.js';
 import { writeTextFile, pathExists, readJsonFile } from './chunk-CRAMOEBE.js';
-import { resolveOne } from './chunk-J7LKEB2R.js';
-import { impactOf, indexFor, queryGraphSemantic, queryGraph } from './chunk-YJU7S7N6.js';
-import { withTimeout, getNodeEmbeddings, loadEmbedder, isModelReady } from './chunk-KBP7GJV6.js';
-import { parseGraph, analyzeQuestion, loadTopicTags, cacheDir } from './chunk-EWZKOU66.js';
+import { withTimeout, getNodeEmbeddings, loadEmbedder, isModelReady } from './chunk-X76VPOYH.js';
+import { cacheDir } from './chunk-2U37PFB2.js';
+import { parseGraph, analyzeQuestion, loadTopicTags } from './chunk-75LJM5XD.js';
 import { repositoryIdFromRoot } from './chunk-BWPBB45M.js';
 import { bidirectional } from 'graphology-shortest-path/unweighted.js';
 import Graph from 'graphology';
@@ -2223,5 +2224,5 @@ function navigationToolsetConfig(serverName = "vibgrate") {
 }
 
 export { FREE_PACK, HOT_TOOLS, TOOLS, assessDocQuality, budgetSuffix, clearStoredCredentials, countTokens, coveringTests, createWorkspaceDsn, credentialsPath, deferredToolNames, detectRunner, dsnCommand, ensureGitignored, fetchHostedDocsCached, findGitRoot, gitignoreEntryForCredentials, homeCredentialsPath, hostedBase, listedToolNames, navigationToolsetConfig, parseDsn, pathDisconnect, projectCredentialsPath, publishPrivateLibrary, pushCommand, readScanArtifact, readStoredCredentials, renderToolResult, resolveDsn, selectForBudget, shortestPath, symbolsFromApi, testsToRun, uploadScanArtifact, warmEmbedderInBackground, writeStoredCredentials };
-//# sourceMappingURL=chunk-3WUTQYRY.js.map
-//# sourceMappingURL=chunk-3WUTQYRY.js.map
+//# sourceMappingURL=chunk-WWGLVF7D.js.map
+//# sourceMappingURL=chunk-WWGLVF7D.js.map