@vibgrate/cli 2026.819.3 → 2026.824.3

package/dist/chunk-VEQA2FSM.js

@@ -1,699 +0,0 @@
-import { cosine } from './chunk-DMI4BMUL.js';
-import { bigramConsumedTokens, WEAK_TERMS, expandConcepts } from './chunk-C5AOLTQS.js';
-
-// src/engine/relations.ts
-var GraphIndex = class {
-  constructor(graph) {
-    this.graph = graph;
-    for (const n of graph.nodes) this.nodeById.set(n.id, n);
-    for (const e of graph.edges) {
-      push(this.outById, e.src, e);
-      push(this.inById, e.dst, e);
-    }
-  }
-  graph;
-  nodeById = /* @__PURE__ */ new Map();
-  outById = /* @__PURE__ */ new Map();
-  inById = /* @__PURE__ */ new Map();
-  out(id, kind) {
-    const all = this.outById.get(id) ?? [];
-    return kind ? all.filter((e) => e.kind === kind) : all;
-  }
-  in(id, kind) {
-    const all = this.inById.get(id) ?? [];
-    return kind ? all.filter((e) => e.kind === kind) : all;
-  }
-  node(id) {
-    return this.nodeById.get(id);
-  }
-  /**
-   * Resolved nodes called by `id` — invocations (`call`) plus structural
-   * dependency references (`references`, e.g. a constructor-injected field's
-   * type), since both represent real usage a caller/impact question cares
-   * about. `references` is otherwise only emitted by the precise SCIP/tsc
-   * rungs and (for Java DI wiring) the heuristic rung — never a guess.
-   */
-  callees(id) {
-    return this.resolveTargets(this.out(id).filter(isUsageEdge), "dst");
-  }
-  /** Resolved nodes that call or structurally reference `id`. */
-  callers(id) {
-    return this.resolveTargets(this.in(id).filter(isUsageEdge), "src");
-  }
-  resolveTargets(edges, end) {
-    const out = [];
-    for (const e of edges) {
-      const node = this.nodeById.get(e[end]);
-      if (node) out.push({ edge: e, node });
-    }
-    return out;
-  }
-};
-var USAGE_KINDS = /* @__PURE__ */ new Set(["call", "references"]);
-function isUsageEdge(e) {
-  return USAGE_KINDS.has(e.kind);
-}
-function push(map, key, value) {
-  const list = map.get(key);
-  if (list) list.push(value);
-  else map.set(key, [value]);
-}
-var INDEX_CACHE = /* @__PURE__ */ new WeakMap();
-function indexFor(graph) {
-  let idx = INDEX_CACHE.get(graph);
-  if (!idx) {
-    idx = new GraphIndex(graph);
-    INDEX_CACHE.set(graph, idx);
-  }
-  return idx;
-}
-
-// src/engine/user-ask.ts
-function userAskFromInstruction(instruction) {
-  if (!instruction) return instruction;
-  const fenced = /\n---\s*\n## User attachments\b[^\n]*\n?/;
-  const m = fenced.exec(instruction);
-  if (m && m.index != null) {
-    return instruction.slice(0, m.index).trimEnd();
-  }
-  const bare = instruction.search(/(?:^|\n)## User attachments\b/);
-  if (bare > 0) {
-    return instruction.slice(0, bare).trimEnd();
-  }
-  if (bare === 0) {
-    return "";
-  }
-  return instruction;
-}
-
-// src/engine/query.ts
-var STOPWORDS = /* @__PURE__ */ new Set([
-  "the",
-  "a",
-  "an",
-  "is",
-  "are",
-  "was",
-  "were",
-  "be",
-  "to",
-  "of",
-  "in",
-  "on",
-  "for",
-  "and",
-  "or",
-  "where",
-  "what",
-  "which",
-  "how",
-  "do",
-  "does",
-  "did",
-  "i",
-  "we",
-  "it",
-  "this",
-  "that",
-  "with",
-  "when",
-  "who",
-  "why",
-  "can",
-  "should",
-  "my",
-  "our",
-  "you",
-  "your",
-  "from",
-  "by",
-  "at",
-  "as",
-  // Discovery-question scaffolding: words a caller uses to FRAME the ask
-  // ("find the code responsible for X", "I need to modify X, where do I
-  // start?", "explain how X works in this codebase") rather than to name the
-  // target. Left in, these compete on equal footing with the real identifier
-  // terms and can outrank it outright — e.g. "find the code responsible for
-  // deleteAsync" let "find" alone drag in every FindByIdAsync/FindAll method
-  // in the repo, none of them the target (VG-LOCATE-FAILURE-ANALYSIS.md).
-  "find",
-  "code",
-  "responsible",
-  "need",
-  "modify",
-  "me",
-  "implementation",
-  "explain",
-  "works",
-  "codebase",
-  "contains",
-  "file",
-  // String/URL occurrence scaffolding: "does not exist", "find occurrences of …"
-  // must not light up DoesNot*/NonExisting*/commandExists via weak substrings
-  // (field report: https://…/signup does not exist find occurrences).
-  "not",
-  "no",
-  "exist",
-  "exists",
-  "existing",
-  "occurrence",
-  "occurrences",
-  "occurence",
-  "occurences",
-  "every",
-  "place",
-  "places",
-  "string",
-  "literal",
-  "text",
-  "search",
-  "locate",
-  "look",
-  "looking",
-  "show",
-  "list",
-  "all"
-]);
-function cleanUrlNeedle(raw) {
-  let s = raw.trim();
-  s = s.replace(/[.,;:!)\]}>]+$/g, "");
-  if (s.endsWith("?")) {
-    const qi = s.lastIndexOf("?");
-    if (qi === s.length - 1) s = s.slice(0, -1);
-  }
-  return s;
-}
-function extractLiteralNeedles(question) {
-  const out = [];
-  const seen = /* @__PURE__ */ new Set();
-  const push2 = (raw, kind) => {
-    let s = raw.trim();
-    s = kind === "url" ? cleanUrlNeedle(s) : s.replace(/[.,;:!)\]}>?]+$/g, "");
-    if (s.length < 2 || seen.has(s)) return;
-    seen.add(s);
-    out.push(s);
-  };
-  for (const m of question.matchAll(/https?:\/\/[^\s"'`<>]+/gi)) push2(m[0], "url");
-  for (const m of question.matchAll(/(["'`])((?:(?!\1)[^\\]|\\.){2,})\1/g)) {
-    push2(m[2].replace(/\\(.)/g, "$1"), "quote");
-  }
-  return out;
-}
-function stripLiteralNeedles(question) {
-  let s = question;
-  for (const m of question.matchAll(/https?:\/\/[^\s"'`<>]+/gi)) {
-    s = s.split(m[0]).join(" ");
-  }
-  for (const lit of extractLiteralNeedles(question)) {
-    s = s.split(lit).join(" ");
-  }
-  s = s.replace(/(["'`])\s*\1/g, " ");
-  return s.replace(/\s+/g, " ").trim();
-}
-function residualForSymbolSearch(question) {
-  const literals = extractLiteralNeedles(question);
-  if (literals.length === 0) return question.trim();
-  const stripped = stripLiteralNeedles(question);
-  return tokenize(stripped).length === 0 ? "" : stripped;
-}
-function isLocateOnlyInstruction(instruction) {
-  const q = userAskFromInstruction(instruction).trim();
-  if (!q) return false;
-  const needles = extractLiteralNeedles(q);
-  const hasLocateFrame = /\b(where\s+is|where\s+are|find\s+(all\s+|every\s+)?occurrence|find\s+occurrences|does\s+not\s+exist|locate|search\s+for)\b/i.test(
-    q
-  ) || needles.length > 0 && /^https?:\/\//i.test(q);
-  const withoutExist = q.replace(/\bdoes\s+not\s+exist\b/gi, " ");
-  if (/\b(fix|edit|change|replace|implement|refactor|rename|patch|create\s+file|delete\s+file|add\s+a\b|remove\s+the\b)\b/i.test(
-    withoutExist
-  )) {
-    return false;
-  }
-  if (needles.some((n) => /^https?:\/\//i.test(n))) return true;
-  return hasLocateFrame && needles.length > 0;
-}
-function queryGraph(graph, question, options = {}) {
-  const budget = options.budget ?? 2e3;
-  const limit = options.limit ?? 12;
-  const literals = extractLiteralNeedles(question);
-  const forTokens = literals.length > 0 ? stripLiteralNeedles(question) : question;
-  const prep = prepareTerms(forTokens, options.relevance, priorResidual(options.priorQuestion));
-  const weightOf = termWeights(graph, prep.terms.map((t) => t.term));
-  const index = indexFor(graph);
-  const scored = [];
-  if (prep.hasContent) {
-    for (const node of graph.nodes) {
-      if (node.kind === "file" || node.kind === "external") continue;
-      const { score, why } = scoreNode(node, prep.terms, weightOf);
-      if (score > 0) {
-        const affinity = topicAffinity(node.id, options.relevance, options.topicTags);
-        scored.push({
-          node,
-          score: round(score * affinity.boost * (1 + IMPORTANCE_WEIGHT * node.importance)),
-          why: why + affinity.label
-        });
-      }
-    }
-    scored.sort((a, b) => b.score - a.score || a.node.qualifiedName.localeCompare(b.node.qualifiedName));
-  }
-  const seeds = scored.slice(0, limit);
-  const { context, tokensEstimate } = buildContext(graph, index, question, seeds, budget, literals);
-  return { question, matches: seeds, context, tokensEstimate };
-}
-var RRF_K = 60;
-function ranksOf(scores, nameOf) {
-  const ids = [...scores.entries()].filter(([, s]) => s > 0).sort((a, b) => b[1] - a[1] || nameOf(a[0]).localeCompare(nameOf(b[0]))).map(([id]) => id);
-  return new Map(ids.map((id, i) => [id, i + 1]));
-}
-async function queryGraphSemantic(graph, question, options) {
-  const budget = options.budget ?? 2e3;
-  const limit = options.limit ?? 12;
-  const literals = extractLiteralNeedles(question);
-  const forTokens = literals.length > 0 ? stripLiteralNeedles(question) : question;
-  const prep = prepareTerms(forTokens, options.relevance, priorResidual(options.priorQuestion));
-  const terms = prep.terms.map((t) => t.term);
-  const weightOf = termWeights(graph, terms);
-  const index = indexFor(graph);
-  const queryVec = options.semanticRanked ? null : await options.embedder?.embedQuery(forTokens || question);
-  const lexRaw = /* @__PURE__ */ new Map();
-  const whyById = /* @__PURE__ */ new Map();
-  if (prep.hasContent) {
-    for (const node of graph.nodes) {
-      if (node.kind === "file" || node.kind === "external") continue;
-      const { score, why } = scoreNode(node, prep.terms, weightOf);
-      lexRaw.set(node.id, score);
-      whyById.set(node.id, why);
-    }
-  }
-  const scored = [];
-  if (terms.length > 0 || literals.length === 0) {
-    const semRaw = /* @__PURE__ */ new Map();
-    const nodeById = /* @__PURE__ */ new Map();
-    for (const node of graph.nodes) {
-      if (node.kind === "file" || node.kind === "external") continue;
-      nodeById.set(node.id, node);
-      if (options.semanticRanked || !queryVec) continue;
-      const vec = options.nodeVectors?.get(node.id);
-      const sem = vec && terms.length > 0 ? Math.max(0, cosine(queryVec, vec)) : 0;
-      if (sem > 0) semRaw.set(node.id, sem);
-    }
-    if (options.semanticRanked && terms.length > 0) {
-      for (const { id, score } of options.semanticRanked) {
-        if (score > 0 && nodeById.has(id)) semRaw.set(id, score);
-      }
-    }
-    const nameOf = (id) => nodeById.get(id)?.qualifiedName ?? id;
-    const lexRanks = ranksOf(lexRaw, nameOf);
-    const semRanks = ranksOf(semRaw, nameOf);
-    for (const [id, node] of nodeById) {
-      const lr = lexRanks.get(id);
-      const sr = semRanks.get(id);
-      if (lr === void 0 && sr === void 0) continue;
-      const fused = (lr !== void 0 ? 1 / (RRF_K + lr) : 0) + (sr !== void 0 ? 1 / (RRF_K + sr) : 0);
-      const sem = semRaw.get(id) ?? 0;
-      const lexWhy = whyById.get(id);
-      const affinity = topicAffinity(id, options.relevance, options.topicTags);
-      const why = (lexWhy || (sem > 0.3 ? `semantic match (${sem.toFixed(2)})` : "weak match")) + affinity.label;
-      scored.push({ node, score: round(fused * affinity.boost * (1 + IMPORTANCE_WEIGHT * node.importance)), why });
-    }
-    scored.sort((a, b) => b.score - a.score || a.node.qualifiedName.localeCompare(b.node.qualifiedName));
-  }
-  const seeds = scored.slice(0, limit);
-  const { context, tokensEstimate } = buildContext(graph, index, question, seeds, budget, literals);
-  return { question, matches: seeds, context, tokensEstimate };
-}
-function tokenize(q) {
-  return [
-    ...new Set(
-      q.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((t) => t.length >= 1 && !STOPWORDS.has(t))
-    )
-  ];
-}
-function tokenizeOrdered(q) {
-  return q.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((t) => t.length >= 1);
-}
-var WEAK_TERM_WEIGHT = 0.25;
-var EXPANSION_WEIGHT = 0.7;
-var COVERAGE_BONUS = 0.35;
-var CARRY_WEIGHT = 0.5;
-function prepareTerms(forTokens, relevance, prior) {
-  const base = tokenize(forTokens);
-  const ordered = tokenizeOrdered(forTokens);
-  const baseSet = new Set(base);
-  const consumed = bigramConsumedTokens(ordered);
-  const terms = base.map((t) => ({ term: t, weak: WEAK_TERMS.has(t) || consumed.has(t) }));
-  const have = new Set(base);
-  for (const e of expandConcepts(ordered)) {
-    if (baseSet.has(e.term)) continue;
-    terms.push({ term: e.term, weak: false, from: e.from });
-    have.add(e.term);
-  }
-  for (const e of relevance?.expansions ?? []) {
-    if (have.has(e.term)) continue;
-    terms.push({ term: e.term, weak: false, from: e.from, providerWeight: e.weight });
-    have.add(e.term);
-  }
-  if (prior?.trim()) {
-    const priorOrdered = tokenizeOrdered(prior);
-    const priorConsumed = bigramConsumedTokens(priorOrdered);
-    for (const t of tokenize(prior)) {
-      if (have.has(t) || WEAK_TERMS.has(t) || priorConsumed.has(t)) continue;
-      terms.push({ term: t, weak: false, carried: true });
-      have.add(t);
-    }
-    for (const e of expandConcepts(priorOrdered)) {
-      if (have.has(e.term)) continue;
-      terms.push({ term: e.term, weak: false, from: e.from, carried: true });
-      have.add(e.term);
-    }
-  }
-  const hasContent = terms.some((t) => !t.weak);
-  return { terms, hasContent };
-}
-function priorResidual(prior) {
-  const raw = prior?.trim();
-  if (!raw) return null;
-  return extractLiteralNeedles(raw).length > 0 ? stripLiteralNeedles(raw) : raw;
-}
-function conceptMapLines(question, relevance, priorQuestion) {
-  const cap = (xs) => [...new Set(xs)].slice(0, 8).join(", ");
-  const literals = extractLiteralNeedles(question);
-  const residual = literals.length > 0 ? stripLiteralNeedles(question) : question;
-  const lines = [];
-  const byFrom = /* @__PURE__ */ new Map();
-  for (const e of expandConcepts(tokenizeOrdered(residual))) {
-    const list = byFrom.get(e.from) ?? [];
-    list.push(e.term);
-    byFrom.set(e.from, list);
-  }
-  for (const [from, terms] of byFrom) {
-    lines.push(`- "${from}" in the ask implies these codebase identifiers: ${cap(terms)}.`);
-  }
-  const matches = relevance?.taxonomy ?? [];
-  if (matches.length) {
-    const seenPath = /* @__PURE__ */ new Set();
-    const levels = [];
-    for (const m of matches) {
-      for (const l of m.levels) {
-        if (seenPath.has(l.path)) continue;
-        seenPath.add(l.path);
-        levels.push({ path: l.path, id: l.id, depth: l.path.split("/").length, terms: l.terms });
-      }
-    }
-    const deepest = Math.max(...levels.map((l) => l.depth));
-    const describe = (l, lead) => l.terms.length ? `${lead} ${l.id}; code for it typically uses: ${cap(l.terms)}.` : `${lead} ${l.id}.`;
-    for (const l of levels.filter((l2) => l2.depth === deepest)) {
-      lines.push(describe(l, "- The ask is specifically about"));
-    }
-    const deepestIds = new Set(levels.filter((l) => l.depth === deepest).map((l) => l.id));
-    for (const v of (relevance?.vendors ?? []).filter((v2) => v2.score > 0).slice(0, 3)) {
-      if (deepestIds.has(v.name)) {
-        if (v.from !== v.name) lines.push(`- That product was typed "${v.from}".`);
-        continue;
-      }
-      lines.push(
-        v.from === v.name ? `- It names the product "${v.name}".` : `- It names the product "${v.name}" (typed "${v.from}").`
-      );
-    }
-    const named = new Set((relevance?.vendors ?? []).map((v) => v.name));
-    for (let d = deepest - 1; d >= 1; d--) {
-      for (const l of levels.filter((l2) => l2.depth === d && !named.has(l2.id))) {
-        lines.push(describe(l, "- More broadly, this is"));
-      }
-    }
-  } else if (relevance?.topics?.length) {
-    const topicVocab = /* @__PURE__ */ new Map();
-    for (const e of relevance.expansions ?? []) {
-      const list = topicVocab.get(e.from) ?? [];
-      list.push(e.term);
-      topicVocab.set(e.from, list);
-    }
-    for (const t of relevance.topics.slice(0, 3)) {
-      const vocab = topicVocab.get(t.id);
-      lines.push(
-        vocab?.length ? `- The ask is about the "${t.id}" domain; code for it typically uses: ${cap(vocab)}.` : `- The ask is about the "${t.id}" domain.`
-      );
-    }
-  }
-  const standards = relevance?.standards ?? [];
-  if (standards.length) {
-    const specs = standards.filter((st) => st.kind !== "regulation");
-    const rules = standards.filter((st) => st.kind === "regulation");
-    const render = (list) => list.slice(0, 3).map((st) => st.publisher ? `${st.name} (${st.publisher})` : st.name).join("; ");
-    if (specs.length) lines.push(`- Standards that govern this area: ${render(specs)}.`);
-    if (rules.length) lines.push(`- Regulations that apply here: ${render(rules)}.`);
-  }
-  const categories = relevance?.categories ?? [];
-  if (categories.length) {
-    lines.push(`- Related categories: ${cap(categories)}.`);
-  }
-  const fileHints = relevance?.files ?? [];
-  if (fileHints.length) {
-    lines.push(`- Files for this kind of work are usually named or extended: ${cap(fileHints)}.`);
-  }
-  for (const c of (relevance?.corrections ?? []).slice(0, 3)) {
-    lines.push(`- Read "${c.from}" in the ask as "${c.to}".`);
-  }
-  const priorText = priorResidual(priorQuestion);
-  if (priorText) {
-    const current = new Set(tokenize(residual));
-    const consumed = bigramConsumedTokens(tokenizeOrdered(priorText));
-    const carried = tokenize(priorText).filter((t) => !current.has(t) && !WEAK_TERMS.has(t) && !consumed.has(t));
-    if (carried.length) {
-      lines.push(`- This is a follow-up; topic words carried from the previous ask: ${cap(carried)}.`);
-    }
-  }
-  if (lines.length) {
-    lines.push(
-      '- Seed notation below: `a\u2192b` = ask term "a" implied identifier "b"; `~t` = word-form match; `\u21A9t` = carried from the previous ask.'
-    );
-  }
-  return lines;
-}
-function scoreNode(node, terms, weightOf = () => 1) {
-  let score = 0;
-  let contentHits = 0;
-  const hits = [];
-  const name = node.name.toLowerCase();
-  const qn = node.qualifiedName.toLowerCase();
-  const file = node.file.toLowerCase();
-  const dirSegments = new Set(file.split("/").slice(0, -1));
-  const nameParts = identifierParts(node.name);
-  for (const { term: t, weak, from, providerWeight, carried } of terms) {
-    const expansionW = providerWeight !== void 0 ? Math.min(providerWeight, EXPANSION_WEIGHT) : from ? EXPANSION_WEIGHT : 1;
-    const w = weightOf(t) * (weak ? WEAK_TERM_WEIGHT : 1) * expansionW * (carried ? CARRY_WEIGHT : 1);
-    const label = (carried ? "\u21A9" : "") + (from ? `${from}\u2192${t}` : t);
-    let contribution = 0;
-    if (name === t) {
-      contribution = 10 * w;
-      hits.push(label);
-    } else if (nameParts.has(t)) {
-      contribution = 6 * w;
-      hits.push(label);
-    } else if (name.includes(t)) {
-      contribution = 4 * w;
-      hits.push(label);
-    } else if (qn.includes(t)) {
-      contribution = 3 * w;
-      hits.push(label);
-    } else if (fuzzyPartMatch(t, nameParts)) {
-      contribution = 2 * w;
-      hits.push((carried ? "\u21A9" : "") + (from ? `~${from}\u2192${t}` : `~${t}`));
-    } else if (dirSegments.has(t)) {
-      contribution = 2 * w;
-      hits.push(label);
-    } else if (file.includes(t)) {
-      contribution = 1 * w;
-      hits.push(label);
-    }
-    if (contribution > 0) {
-      score += contribution;
-      if (!weak) contentHits += 1;
-    }
-  }
-  if (contentHits === 0) return { score: 0, why: "" };
-  score *= 1 + COVERAGE_BONUS * Math.min(contentHits - 1, 4);
-  return { score, why: hits.length ? `matched: ${hits.join(", ")}` : "" };
-}
-var IMPORTANCE_WEIGHT = 0.4;
-var TOPIC_AFFINITY_WEIGHT = 0.3;
-function sharedDepth(a, b) {
-  const as = a.split("/");
-  const bs = b.split("/");
-  let n = 0;
-  while (n < as.length && n < bs.length && as[n] === bs[n]) n++;
-  return n;
-}
-function topicAffinity(nodeId, relevance, topicTags) {
-  if (!topicTags) return { boost: 1, label: "" };
-  const tags = topicTags.get(nodeId);
-  if (!tags?.length) return { boost: 1, label: "" };
-  const paths = relevance?.taxonomy ?? [];
-  if (paths.length && tags.some((t) => t.includes("/"))) {
-    let best = 0;
-    let label = "";
-    for (const match of paths) {
-      const askDepth = match.path.split("/").length;
-      for (const tag of tags) {
-        const shared = sharedDepth(match.path, tag);
-        if (shared === 0) continue;
-        const affinity2 = shared / askDepth * match.score;
-        if (affinity2 > best) {
-          best = affinity2;
-          label = shared === askDepth ? match.path : match.path.split("/").slice(0, shared).join("/");
-        }
-      }
-    }
-    if (best <= 0) return { boost: 1, label: "" };
-    return { boost: 1 + TOPIC_AFFINITY_WEIGHT * Math.min(best, 1), label: `, topic:${label}` };
-  }
-  if (!relevance?.topics?.length) return { boost: 1, label: "" };
-  let affinity = 0;
-  const matched = [];
-  for (const t of relevance.topics) {
-    if (tags.includes(t.id)) {
-      affinity += t.score;
-      matched.push(t.id);
-    }
-  }
-  if (affinity <= 0) return { boost: 1, label: "" };
-  return { boost: 1 + TOPIC_AFFINITY_WEIGHT * Math.min(affinity, 1), label: `, topic:${matched.sort().join("+")}` };
-}
-function termWeights(graph, terms) {
-  if (terms.length === 0) return () => 1;
-  const df = /* @__PURE__ */ new Map();
-  let n = 0;
-  for (const node of graph.nodes) {
-    if (node.kind === "file" || node.kind === "external") continue;
-    n++;
-    const name = node.name.toLowerCase();
-    const parts = identifierParts(node.name);
-    for (const t of terms) {
-      if (parts.has(t) || name.includes(t)) df.set(t, (df.get(t) ?? 0) + 1);
-    }
-  }
-  const w = /* @__PURE__ */ new Map();
-  for (const t of terms) {
-    const idf = Math.log((n + 1) / ((df.get(t) ?? 0) + 1)) + 1;
-    w.set(t, Math.max(0.5, Math.min(8, idf)));
-  }
-  return (t) => w.get(t) ?? 1;
-}
-function identifierParts(name) {
-  return new Set(
-    name.split(/[^\p{L}\p{N}]+|(?<=[a-z0-9])(?=[A-Z])|(?<=[A-Z])(?=[A-Z][a-z])/u).filter(Boolean).map((s) => s.toLowerCase())
-  );
-}
-function fuzzyPartMatch(term, parts) {
-  for (const part of parts) {
-    const shared = sharedPrefixLen(term, part);
-    if (shared >= 5 && shared >= 0.6 * Math.min(term.length, part.length)) return true;
-  }
-  return false;
-}
-function sharedPrefixLen(a, b) {
-  const n = Math.min(a.length, b.length);
-  let i = 0;
-  while (i < n && a[i] === b[i]) i++;
-  return i;
-}
-function buildContext(graph, index, question, seeds, budget, literals = []) {
-  const lines = [];
-  lines.push(`# Context for: ${question}`);
-  lines.push("");
-  if (literals.length) {
-    lines.push("## Literal string(s) to locate (exact text, not symbol names)");
-    for (const lit of literals) lines.push(`- \`${lit}\``);
-    lines.push(
-      "_Use a quoted phrase / URL search (`search_symbols` or `search_code` with the exact needle) for occurrences. Graph symbols below (if any) are residual identifier hints only._"
-    );
-    lines.push("");
-  }
-  if (seeds.length === 0) {
-    lines.push(
-      literals.length ? "_No graph symbols matched residual terms \u2014 this is expected for a pure string/URL occurrence search. Run a literal sweep on the needle(s) above._" : "_No matching symbols found in the map. Try different terms, or `vg hubs` for the most important code._"
-    );
-    const text2 = lines.join("\n");
-    return { context: text2, tokensEstimate: estimateTokens(text2) };
-  }
-  for (const { node, why } of seeds) {
-    const block = [];
-    block.push(`## ${node.qualifiedName}  (${node.kind}, ${node.file}:${node.span.start})`);
-    if (node.signature) block.push("`" + node.signature + "`");
-    const callees = index.callees(node.id).map((x) => x.node.qualifiedName);
-    const callers = index.callers(node.id).map((x) => x.node.qualifiedName);
-    if (callees.length) block.push(`calls: ${unique(callees).slice(0, 8).join(", ")}`);
-    if (callers.length) block.push(`called by: ${unique(callers).slice(0, 8).join(", ")}`);
-    block.push(`importance ${node.importance.toFixed(3)} \xB7 area #${node.area}${node.isHub ? " \xB7 hub" : ""} \xB7 ${why}`);
-    block.push("");
-    const candidate = lines.concat(block).join("\n");
-    if (estimateTokens(candidate) > budget && lines.length > 2) break;
-    lines.push(...block);
-  }
-  const text = lines.join("\n");
-  return { context: text, tokensEstimate: estimateTokens(text) };
-}
-function unique(xs) {
-  return [...new Set(xs)];
-}
-function estimateTokens(text) {
-  return Math.ceil(text.length / 4);
-}
-function round(x) {
-  return Math.round(x * 1e6) / 1e6;
-}
-
-// src/engine/impact.ts
-var DEPEND_EDGES = /* @__PURE__ */ new Set(["call", "import", "extends", "implements", "references"]);
-function impactOf(graph, rootId, opts = {}) {
-  const maxDepth = Math.max(1, opts.depth ?? 4);
-  const index = indexFor(graph);
-  const root = index.node(rootId);
-  const affected = /* @__PURE__ */ new Map();
-  let minEdgeConfidence = 1;
-  let frontier = [{ id: rootId, conf: 1 }];
-  for (let depth = 1; depth <= maxDepth; depth++) {
-    const nextFrontier = [];
-    for (const { id, conf } of frontier) {
-      for (const e of index.in(id)) {
-        if (!DEPEND_EDGES.has(e.kind)) continue;
-        minEdgeConfidence = Math.min(minEdgeConfidence, e.confidence);
-        const dependentId = e.src;
-        if (dependentId === rootId || affected.has(dependentId)) continue;
-        const node = index.node(dependentId);
-        if (!node) continue;
-        const conf2 = round2(conf * e.confidence * 0.9);
-        affected.set(dependentId, {
-          id: node.id,
-          name: node.qualifiedName,
-          kind: node.kind,
-          file: node.file,
-          line: node.span.start,
-          depth,
-          confidence: conf2
-        });
-        nextFrontier.push({ id: dependentId, conf: conf2 });
-      }
-    }
-    frontier = nextFrontier;
-    if (frontier.length === 0) break;
-  }
-  const items = [...affected.values()].sort(
-    (a, b) => a.depth - b.depth || b.confidence - a.confidence || a.name.localeCompare(b.name)
-  );
-  return {
-    root: { id: rootId, name: root?.qualifiedName ?? rootId },
-    depth: maxDepth,
-    affected: items,
-    direct: items.filter((i) => i.depth === 1).length,
-    transitive: items.filter((i) => i.depth > 1).length,
-    minEdgeConfidence: round2(minEdgeConfidence)
-  };
-}
-function round2(x) {
-  return Math.round(x * 1e6) / 1e6;
-}
-
-export { GraphIndex, conceptMapLines, extractLiteralNeedles, identifierParts, impactOf, indexFor, isLocateOnlyInstruction, queryGraph, queryGraphSemantic, residualForSymbolSearch, userAskFromInstruction };
-//# sourceMappingURL=chunk-VEQA2FSM.js.map
-//# sourceMappingURL=chunk-VEQA2FSM.js.map