@vibgrate/cli 2026.722.1 → 2026.727.1

package/dist/chunk-JIBOJTGS.js

@@ -0,0 +1,313 @@
+import { createHash } from 'crypto';
+
+// src/runtime/identifier-trie.ts
+function createTrieNode() {
+  return { children: /* @__PURE__ */ new Map(), terminal: false };
+}
+function trieInsert(root, word) {
+  let node = root;
+  for (const ch of word) {
+    let next = node.children.get(ch);
+    if (!next) {
+      next = createTrieNode();
+      node.children.set(ch, next);
+    }
+    node = next;
+  }
+  node.terminal = true;
+}
+function trieHas(root, word) {
+  let node = root;
+  for (const ch of word) {
+    const next = node.children.get(ch);
+    if (!next) return false;
+    node = next;
+  }
+  return node.terminal;
+}
+function trieHasPrefix(root, prefix) {
+  let node = root;
+  for (const ch of prefix) {
+    const next = node.children.get(ch);
+    if (!next) return false;
+    node = next;
+  }
+  return true;
+}
+function buildIdentifierTrieFromGraph(graph) {
+  const root = createTrieNode();
+  const seen = /* @__PURE__ */ new Set();
+  const add = (s) => {
+    const t = (s ?? "").trim();
+    if (!t || seen.has(t)) return;
+    seen.add(t);
+    trieInsert(root, t);
+    for (const part of t.split(/[./:#]/)) {
+      const p = part.trim();
+      if (!p || seen.has(p)) continue;
+      seen.add(p);
+      trieInsert(root, p);
+    }
+  };
+  for (const n of graph.nodes) {
+    add(n.name);
+    add(n.qualifiedName);
+    add(n.id);
+  }
+  return root;
+}
+function trieAllowedNextChars(root, prefix) {
+  let node = root;
+  for (const ch of prefix) {
+    const next = node.children.get(ch);
+    if (!next) return [];
+    node = next;
+  }
+  return [...node.children.keys()].sort();
+}
+function trieEnumerateWords(root, limit = 4096) {
+  const out = [];
+  const walk = (n, acc) => {
+    if (out.length >= limit) return;
+    if (n.terminal && acc.length > 0) out.push(acc);
+    for (const [ch, child] of [...n.children.entries()].sort((a, b) => a[0].localeCompare(b[0]))) {
+      walk(child, acc + ch);
+      if (out.length >= limit) return;
+    }
+  };
+  walk(root, "");
+  return out;
+}
+
+// src/runtime/identifier-mask.ts
+var IDENT_RE = /\b[A-Za-z_][A-Za-z0-9_]{2,}\b/g;
+var STOP = /* @__PURE__ */ new Set([
+  "the",
+  "and",
+  "for",
+  "var",
+  "let",
+  "const",
+  "function",
+  "class",
+  "return",
+  "import",
+  "export",
+  "from",
+  "async",
+  "await",
+  "true",
+  "false",
+  "null",
+  "undefined",
+  "this",
+  "new",
+  "typeof",
+  "interface",
+  "type",
+  "string",
+  "number",
+  "boolean",
+  "void",
+  "any",
+  "unknown",
+  "Promise",
+  "Array",
+  "Object",
+  "Error",
+  "console",
+  "process",
+  "require",
+  "module",
+  "exports",
+  "default",
+  "extends",
+  "implements",
+  "public",
+  "private",
+  "protected",
+  "static",
+  "readonly",
+  "if",
+  "else",
+  "while",
+  "switch",
+  "case",
+  "break",
+  "continue",
+  "try",
+  "catch",
+  "finally",
+  "throw",
+  "with",
+  "yield",
+  "of",
+  "in",
+  "as",
+  "is",
+  "get",
+  "set"
+]);
+function extractIdentifiers(text) {
+  const out = /* @__PURE__ */ new Set();
+  for (const m of text.matchAll(IDENT_RE)) {
+    const t = m[0];
+    if (STOP.has(t) || STOP.has(t.toLowerCase())) continue;
+    out.add(t);
+  }
+  return [...out].sort();
+}
+function scanIdentifiersAgainstTrie(text, trie) {
+  const known = [];
+  const unknown = [];
+  for (const id of extractIdentifiers(text)) {
+    if (trieHas(trie, id) || trieHasPrefix(trie, id)) known.push(id);
+    else unknown.push(id);
+  }
+  return { known, unknown, clean: unknown.length === 0 };
+}
+function maskAllowedNextChars(trie, partialIdent) {
+  return trieAllowedNextChars(trie, partialIdent);
+}
+function annotateUnknownIdentifiers(text, trie) {
+  const scan = scanIdentifiersAgainstTrie(text, trie);
+  if (scan.clean) return { text, unknown: [] };
+  const note = `
+
+/* vg: unknown identifiers vs graph (not rewritten): ${scan.unknown.slice(0, 12).join(", ")}${scan.unknown.length > 12 ? "\u2026" : ""} */`;
+  return { text: text + note, unknown: scan.unknown };
+}
+var KV_CACHE_SCHEMA = "kv-cache/0";
+function contentHash(text) {
+  return createHash("sha256").update(text, "utf8").digest("hex");
+}
+function approxTokens(text) {
+  return Math.max(1, Math.ceil(text.length / 4));
+}
+function blockMeta(kind, text, now = Date.now()) {
+  return {
+    hash: contentHash(text),
+    kind,
+    bytes: Buffer.byteLength(text, "utf8"),
+    approxTokens: approxTokens(text),
+    createdAt: now
+  };
+}
+var KvBlockRegistry = class {
+  warm = /* @__PURE__ */ new Map();
+  markWarm(meta) {
+    this.warm.set(meta.hash, meta);
+  }
+  isWarm(hash) {
+    return this.warm.has(hash);
+  }
+  get(hash) {
+    return this.warm.get(hash);
+  }
+  clear() {
+    this.warm.clear();
+  }
+  size() {
+    return this.warm.size;
+  }
+  /**
+   * Plan assembly for ordered text segments. Hits reuse warm blocks; misses
+   * need prefill. After a successful forward pass, call {@link commit} on miss hashes.
+   */
+  plan(segments, cursor) {
+    const order = [];
+    const hit = [];
+    const miss = [];
+    let hitTokens = 0;
+    let totalTokens = 0;
+    for (const seg of segments) {
+      const meta = blockMeta(seg.kind, seg.text);
+      order.push(meta.hash);
+      totalTokens += meta.approxTokens;
+      if (this.isWarm(meta.hash)) {
+        hit.push(meta.hash);
+        hitTokens += meta.approxTokens;
+      } else {
+        miss.push({ hash: meta.hash, kind: meta.kind, approxTokens: meta.approxTokens });
+      }
+    }
+    let cursorSkipBlocks = 0;
+    let deltaTokens = totalTokens;
+    if (cursor) {
+      const d = cursor.delta(order, segments);
+      cursorSkipBlocks = d.skipBlocks;
+      deltaTokens = d.evaluateTokens;
+    }
+    return {
+      schemaVersion: KV_CACHE_SCHEMA,
+      hit,
+      miss,
+      order,
+      hitTokens,
+      totalTokens,
+      cursorSkipBlocks,
+      deltaTokens
+    };
+  }
+  /** After prefill, mark miss segments warm. */
+  commit(segments) {
+    for (const seg of segments) {
+      this.markWarm(blockMeta(seg.kind, seg.text));
+    }
+  }
+};
+var SessionPrefixCursor = class {
+  chain = [];
+  /** Hashes currently considered evaluated on the sequence. */
+  get evaluatedHashes() {
+    return this.chain;
+  }
+  /**
+   * Compute how many leading blocks match the previous chain and how many
+   * approx tokens still need evaluate (from the fork point).
+   */
+  delta(order, segments) {
+    let skip = 0;
+    while (skip < order.length && skip < this.chain.length && order[skip] === this.chain[skip]) {
+      skip++;
+    }
+    let evaluateTokens = 0;
+    const parts = [];
+    for (let i = skip; i < segments.length; i++) {
+      const meta = blockMeta(segments[i].kind, segments[i].text);
+      evaluateTokens += meta.approxTokens;
+      parts.push(segments[i].text);
+    }
+    return { skipBlocks: skip, evaluateTokens, evaluateText: parts.join("\n") };
+  }
+  /** After successful evaluate of full ordered hashes, advance the cursor. */
+  commit(order) {
+    this.chain = [...order];
+  }
+  /** Reset after sequence dispose / model reload. */
+  reset() {
+    this.chain = [];
+  }
+};
+function longestWarmPrefix(registry, segments) {
+  let count = 0;
+  let tokens = 0;
+  const hashes = [];
+  const parts = [];
+  for (const seg of segments) {
+    const meta = blockMeta(seg.kind, seg.text);
+    if (!registry.isWarm(meta.hash)) break;
+    count++;
+    tokens += meta.approxTokens;
+    hashes.push(meta.hash);
+    parts.push(seg.text);
+  }
+  return { count, tokens, text: parts.join("\n"), hashes };
+}
+function graphDraftCandidates(knownVerbatim, max = 8) {
+  return knownVerbatim.map((s) => s.trim()).filter((s) => s.length >= 8 && s.length <= 400).slice(0, max);
+}
+
+export { KvBlockRegistry, SessionPrefixCursor, annotateUnknownIdentifiers, buildIdentifierTrieFromGraph, contentHash, extractIdentifiers, graphDraftCandidates, longestWarmPrefix, maskAllowedNextChars, scanIdentifiersAgainstTrie, trieEnumerateWords, trieHas, trieHasPrefix };
+//# sourceMappingURL=chunk-JIBOJTGS.js.map
+//# sourceMappingURL=chunk-JIBOJTGS.js.map

package/dist/chunk-JIBOJTGS.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/runtime/identifier-trie.ts","../src/runtime/identifier-mask.ts","../src/runtime/kv-cache.ts"],"names":[],"mappings":";;;AAaO,SAAS,cAAA,GAA2B;AACzC,EAAA,OAAO,EAAE,QAAA,kBAAU,IAAI,GAAA,EAAI,EAAG,UAAU,KAAA,EAAM;AAChD;AAEO,SAAS,UAAA,CAAW,MAAgB,IAAA,EAAoB;AAC7D,EAAA,IAAI,IAAA,GAAO,IAAA;AACX,EAAA,KAAA,MAAW,MAAM,IAAA,EAAM;AACrB,IAAA,IAAI,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAC/B,IAAA,IAAI,CAAC,IAAA,EAAM;AACT,MAAA,IAAA,GAAO,cAAA,EAAe;AACtB,MAAA,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAA,EAAI,IAAI,CAAA;AAAA,IAC5B;AACA,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAClB;AAEO,SAAS,OAAA,CAAQ,MAAgB,IAAA,EAAuB;AAC7D,EAAA,IAAI,IAAA,GAAO,IAAA;AACX,EAAA,KAAA,MAAW,MAAM,IAAA,EAAM;AACrB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AACjC,IAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA,CAAK,QAAA;AACd;AAEO,SAAS,aAAA,CAAc,MAAgB,MAAA,EAAyB;AACrE,EAAA,IAAI,IAAA,GAAO,IAAA;AACX,EAAA,KAAA,MAAW,MAAM,MAAA,EAAQ;AACvB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AACjC,IAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA;AACT;AA+BO,SAAS,6BAA6B,KAAA,EAAmC;AAC9E,EAAA,MAAM,OAAO,cAAA,EAAe;AAC5B,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,GAAA,GAAM,CAAC,CAAA,KAAgC;AAC3C,IAAA,MAAM,CAAA,GAAA,CAAK,CAAA,IAAK,EAAA,EAAI,IAAA,EAAK;AACzB,IAAA,IAAI,CAAC,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,EAAG;AACvB,IAAA,IAAA,CAAK,IAAI,CAAC,CAAA;AACV,IAAA,UAAA,CAAW,MAAM,CAAC,CAAA;AAElB,IAAA,KAAA,MAAW,IAAA,IAAQ,CAAA,CAAE,KAAA,CAAM,QAAQ,CAAA,EAAG;AACpC,MAAA,MAAM,CAAA,GAAI,KAAK,IAAA,EAAK;AACpB,MAAA,IAAI,CAAC,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,EAAG;AACvB,MAAA,IAAA,CAAK,IAAI,CAAC,CAAA;AACV,MAAA,UAAA,CAAW,MAAM,CAAC,CAAA;AAAA,IACpB;AAAA,EACF,CAAA;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,MAAM,KAAA,EAAO;AAC3B,IAAA,GAAA,CAAI,EAAE,IAAI,CAAA;AACV,IAAA,GAAA,CAAI,EAAE,aAAa,CAAA;AACnB,IAAA,GAAA,CAAI,EAAE,EAAE,CAAA;AAAA,EACV;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,oBAAA,CAAqB,MAAgB,MAAA,EAA0B;AAC7E,EAAA,IAAI,IAAA,GAAO,IAAA;AACX,EAAA,KAAA,MAAW,MAAM,MAAA,EAAQ;AACvB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AACjC,IAAA,IAAI,CAAC,IAAA,EAAM,OAAO,EAAC;AACnB,IAAA,IAAA,GAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,SAAS,IAAA,EAAM,EAAE,IAAA,EAAK;AACxC;AAMO,SAAS,kBAAA,CAAmB,IAAA,EAAgB,KAAA,GAAQ,IAAA,EAAgB;AACzE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,IAAA,GAAO,CAAC,CAAA,EAAa,GAAA,KAAsB;AAC/C,IAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AACzB,IAAA,IAAI,EAAE,QAAA,IAAY,GAAA,CAAI,SAAS,CAAA,EAAG,GAAA,CAAI,KAAK,GAAG,CAAA;AAC9C,IAAA,KAAA,MAAW,CAAC,IAAI,KAAK,CAAA,IAAK,CAAC,GAAG,CAAA,CAAE,QAAA,CAAS,OAAA,EAAS,CAAA,CAAE,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAC,CAAA,CAAE,cAAc,CAAA,CAAE,CAAC,CAAC,CAAC,CAAA,EAAG;AAC5F,MAAA,IAAA,CAAK,KAAA,EAAO,MAAM,EAAE,CAAA;AACpB,MAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AAAA,IAC3B;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAK,MAAM,EAAE,CAAA;AACb,EAAA,OAAO,GAAA;AACT;;;ACpHA,IAAM,QAAA,GAAW,gCAAA;AAGjB,IAAM,IAAA,uBAAW,GAAA,CAAI;AAAA,EACnB,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA,UAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,WAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,QAAA;AAAA,EACA,WAAA;AAAA,EACA,MAAA;AAAA,EACA,QAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EACA,QAAA;AAAA,EACA,SAAA;AAAA,EACA,WAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,UAAA;AAAA,EACA,KAAA;AAAA,EACA,OAAA;AAAA,EACA,SAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA;AACF,CAAC,CAAA;AAYM,SAAS,mBAAmB,IAAA,EAAwB;AACzD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAG;AACvC,IAAA,MAAM,CAAA,GAAI,EAAE,CAAC,CAAA;AACb,IAAA,IAAI,IAAA,CAAK,IAAI,CAAC,CAAA,IAAK,KAAK,GAAA,CAAI,CAAA,CAAE,WAAA,EAAa,CAAA,EAAG;AAC9C,IAAA,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,EACX;AACA,EAAA,OAAO,CAAC,GAAG,GAAG,CAAA,CAAE,IAAA,EAAK;AACvB;AAEO,SAAS,0BAAA,CAA2B,MAAc,IAAA,EAAsC;AAC7F,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,EAAA,IAAM,kBAAA,CAAmB,IAAI,CAAA,EAAG;AACzC,IAAA,IAAI,OAAA,CAAQ,IAAA,EAAM,EAAE,CAAA,IAAK,aAAA,CAAc,MAAM,EAAE,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA;AAAA,SAC1D,OAAA,CAAQ,KAAK,EAAE,CAAA;AAAA,EACtB;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,OAAA,EAAS,KAAA,EAAO,OAAA,CAAQ,WAAW,CAAA,EAAE;AACvD;AAMO,SAAS,oBAAA,CAAqB,MAAgB,YAAA,EAAgC;AACnF,EAAA,OAAO,oBAAA,CAAqB,MAAM,YAAY,CAAA;AAChD;AAOO,SAAS,0BAAA,CAA2B,MAAc,IAAA,EAAqD;AAC5G,EAAA,MAAM,IAAA,GAAO,0BAAA,CAA2B,IAAA,EAAM,IAAI,CAAA;AAClD,EAAA,IAAI,KAAK,KAAA,EAAO,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,EAAC,EAAE;AAC3C,EAAA,MAAM,IAAA,GAAO;;AAAA,qDAAA,EAA4D,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,GAAG,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAS,EAAA,GAAK,WAAM,EAAE,CAAA,GAAA,CAAA;AACnJ,EAAA,OAAO,EAAE,IAAA,EAAM,IAAA,GAAO,IAAA,EAAM,OAAA,EAAS,KAAK,OAAA,EAAQ;AACpD;ACxHO,IAAM,eAAA,GAAkB,YAAA;AAmCxB,SAAS,YAAY,IAAA,EAAsB;AAChD,EAAA,OAAO,UAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,MAAM,MAAM,CAAA,CAAE,OAAO,KAAK,CAAA;AAC/D;AAEO,SAAS,aAAa,IAAA,EAAsB;AACjD,EAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,KAAK,IAAA,CAAK,MAAA,GAAS,CAAC,CAAC,CAAA;AAC/C;AAEO,SAAS,UAAU,IAAA,EAAc,IAAA,EAAc,GAAA,GAAM,IAAA,CAAK,KAAI,EAAgB;AACnF,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,YAAY,IAAI,CAAA;AAAA,IACtB,IAAA;AAAA,IACA,KAAA,EAAO,MAAA,CAAO,UAAA,CAAW,IAAA,EAAM,MAAM,CAAA;AAAA,IACrC,YAAA,EAAc,aAAa,IAAI,CAAA;AAAA,IAC/B,SAAA,EAAW;AAAA,GACb;AACF;AAGO,IAAM,kBAAN,MAAsB;AAAA,EACV,IAAA,uBAAW,GAAA,EAAyB;AAAA,EAErD,SAAS,IAAA,EAAyB;AAChC,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,IAAA,EAAM,IAAI,CAAA;AAAA,EAC/B;AAAA,EAEA,OAAO,IAAA,EAAuB;AAC5B,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA;AAAA,EAC3B;AAAA,EAEA,IAAI,IAAA,EAAuC;AACzC,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA;AAAA,EAC3B;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,KAAK,KAAA,EAAM;AAAA,EAClB;AAAA,EAEA,IAAA,GAAe;AACb,IAAA,OAAO,KAAK,IAAA,CAAK,IAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAA,CAAK,UAAiD,MAAA,EAA8C;AAClG,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,MAAM,MAAgB,EAAC;AACvB,IAAA,MAAM,OAA+B,EAAC;AACtC,IAAA,IAAI,SAAA,GAAY,CAAA;AAChB,IAAA,IAAI,WAAA,GAAc,CAAA;AAClB,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,MAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,IAAA,EAAM,IAAI,IAAI,CAAA;AACzC,MAAA,KAAA,CAAM,IAAA,CAAK,KAAK,IAAI,CAAA;AACpB,MAAA,WAAA,IAAe,IAAA,CAAK,YAAA;AACpB,MAAA,IAAI,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,EAAG;AAC1B,QAAA,GAAA,CAAI,IAAA,CAAK,KAAK,IAAI,CAAA;AAClB,QAAA,SAAA,IAAa,IAAA,CAAK,YAAA;AAAA,MACpB,CAAA,MAAO;AACL,QAAA,IAAA,CAAK,IAAA,CAAK,EAAE,IAAA,EAAM,IAAA,CAAK,IAAA,EAAM,IAAA,EAAM,IAAA,CAAK,IAAA,EAAM,YAAA,EAAc,IAAA,CAAK,YAAA,EAAc,CAAA;AAAA,MACjF;AAAA,IACF;AACA,IAAA,IAAI,gBAAA,GAAmB,CAAA;AACvB,IAAA,IAAI,WAAA,GAAc,WAAA;AAClB,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,MAAM,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,KAAA,EAAO,QAAQ,CAAA;AACtC,MAAA,gBAAA,GAAmB,CAAA,CAAE,UAAA;AACrB,MAAA,WAAA,GAAc,CAAA,CAAE,cAAA;AAAA,IAClB;AACA,IAAA,OAAO;AAAA,MACL,aAAA,EAAe,eAAA;AAAA,MACf,GAAA;AAAA,MACA,IAAA;AAAA,MACA,KAAA;AAAA,MACA,SAAA;AAAA,MACA,WAAA;AAAA,MACA,gBAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,QAAA,EAAuD;AAC5D,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,MAAA,IAAA,CAAK,SAAS,SAAA,CAAU,GAAA,CAAI,IAAA,EAAM,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IAC7C;AAAA,EACF;AACF;AAMO,IAAM,sBAAN,MAA0B;AAAA,EACvB,QAAkB,EAAC;AAAA;AAAA,EAG3B,IAAI,eAAA,GAAqC;AACvC,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAA,CACE,OACA,QAAA,EACsE;AACtE,IAAA,IAAI,IAAA,GAAO,CAAA;AACX,IAAA,OAAO,IAAA,GAAO,KAAA,CAAM,MAAA,IAAU,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,MAAA,IAAU,KAAA,CAAM,IAAI,CAAA,KAAM,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,EAAG;AAC1F,MAAA,IAAA,EAAA;AAAA,IACF;AACA,IAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,KAAA,IAAS,CAAA,GAAI,IAAA,EAAM,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC3C,MAAA,MAAM,IAAA,GAAO,UAAU,QAAA,CAAS,CAAC,EAAE,IAAA,EAAM,QAAA,CAAS,CAAC,CAAA,CAAE,IAAI,CAAA;AACzD,MAAA,cAAA,IAAkB,IAAA,CAAK,YAAA;AACvB,MAAA,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA,CAAE,IAAI,CAAA;AAAA,IAC7B;AACA,IAAA,OAAO,EAAE,YAAY,IAAA,EAAM,cAAA,EAAgB,cAAc,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,EAAE;AAAA,EAC5E;AAAA;AAAA,EAGA,OAAO,KAAA,EAAuB;AAC5B,IAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,GAAG,KAAK,CAAA;AAAA,EACxB;AAAA;AAAA,EAGA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,QAAQ,EAAC;AAAA,EAChB;AACF;AAMO,SAAS,iBAAA,CACd,UACA,QAAA,EAMA;AACA,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,GAAA,CAAI,IAAA,EAAM,IAAI,IAAI,CAAA;AACzC,IAAA,IAAI,CAAC,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,EAAG;AACjC,IAAA,KAAA,EAAA;AACA,IAAA,MAAA,IAAU,IAAA,CAAK,YAAA;AACf,IAAA,MAAA,CAAO,IAAA,CAAK,KAAK,IAAI,CAAA;AACrB,IAAA,KAAA,CAAM,IAAA,CAAK,IAAI,IAAI,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,EAAE,OAAO,MAAA,EAAQ,IAAA,EAAM,MAAM,IAAA,CAAK,IAAI,GAAG,MAAA,EAAO;AACzD;AAOO,SAAS,oBAAA,CACd,aAAA,EACA,GAAA,GAAM,CAAA,EACI;AACV,EAAA,OAAO,aAAA,CACJ,IAAI,CAAC,CAAA,KAAM,EAAE,IAAA,EAAM,EACnB,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,MAAA,IAAU,KAAK,CAAA,CAAE,MAAA,IAAU,GAAG,CAAA,CAC9C,KAAA,CAAM,GAAG,GAAG,CAAA;AACjB","file":"chunk-JIBOJTGS.js","sourcesContent":["/**\n * Identifier trie for future logit masking (Approach B sampler hooks).\n *\n * Built from ActiveGraph symbol short/qualified names so constrained generation\n * can refuse identifiers that do not exist in the repo. Pure data structure —\n * no model binding required to unit-test.\n */\n\nexport interface TrieNode {\n  children: Map<string, TrieNode>;\n  terminal: boolean;\n}\n\nexport function createTrieNode(): TrieNode {\n  return { children: new Map(), terminal: false };\n}\n\nexport function trieInsert(root: TrieNode, word: string): void {\n  let node = root;\n  for (const ch of word) {\n    let next = node.children.get(ch);\n    if (!next) {\n      next = createTrieNode();\n      node.children.set(ch, next);\n    }\n    node = next;\n  }\n  node.terminal = true;\n}\n\nexport function trieHas(root: TrieNode, word: string): boolean {\n  let node = root;\n  for (const ch of word) {\n    const next = node.children.get(ch);\n    if (!next) return false;\n    node = next;\n  }\n  return node.terminal;\n}\n\nexport function trieHasPrefix(root: TrieNode, prefix: string): boolean {\n  let node = root;\n  for (const ch of prefix) {\n    const next = node.children.get(ch);\n    if (!next) return false;\n    node = next;\n  }\n  return true;\n}\n\n/** Completions that extend `prefix` (capped). */\nexport function trieComplete(root: TrieNode, prefix: string, limit = 32): string[] {\n  let node = root;\n  for (const ch of prefix) {\n    const next = node.children.get(ch);\n    if (!next) return [];\n    node = next;\n  }\n  const out: string[] = [];\n  const walk = (n: TrieNode, acc: string): void => {\n    if (out.length >= limit) return;\n    if (n.terminal) out.push(acc);\n    for (const [ch, child] of [...n.children.entries()].sort((a, b) => a[0].localeCompare(b[0]))) {\n      walk(child, acc + ch);\n      if (out.length >= limit) return;\n    }\n  };\n  walk(node, prefix);\n  return out;\n}\n\nexport interface GraphLikeForTrie {\n  nodes: Array<{ name?: string; qualifiedName?: string; id?: string }>;\n}\n\n/**\n * Build a trie of symbol identifiers from a graph. Includes short names and\n * the last segment of qualified names (e.g. `Foo` from `pkg.Foo`).\n */\nexport function buildIdentifierTrieFromGraph(graph: GraphLikeForTrie): TrieNode {\n  const root = createTrieNode();\n  const seen = new Set<string>();\n  const add = (s: string | undefined): void => {\n    const t = (s ?? '').trim();\n    if (!t || seen.has(t)) return;\n    seen.add(t);\n    trieInsert(root, t);\n    // Path segments for dotted / slash-qualified names (e.g. pkg.util.Foo → util, Foo).\n    for (const part of t.split(/[./:#]/)) {\n      const p = part.trim();\n      if (!p || seen.has(p)) continue;\n      seen.add(p);\n      trieInsert(root, p);\n    }\n  };\n  for (const n of graph.nodes) {\n    add(n.name);\n    add(n.qualifiedName);\n    add(n.id);\n  }\n  return root;\n}\n\n/** Characters allowed to continue after `prefix` under the trie (for logit mask). */\nexport function trieAllowedNextChars(root: TrieNode, prefix: string): string[] {\n  let node = root;\n  for (const ch of prefix) {\n    const next = node.children.get(ch);\n    if (!next) return [];\n    node = next;\n  }\n  return [...node.children.keys()].sort();\n}\n\n/**\n * Enumerate terminal words in the trie (capped). Used to positively bias known\n * graph identifiers when building a TokenBias without scanning the full vocab.\n */\nexport function trieEnumerateWords(root: TrieNode, limit = 4096): string[] {\n  const out: string[] = [];\n  const walk = (n: TrieNode, acc: string): void => {\n    if (out.length >= limit) return;\n    if (n.terminal && acc.length > 0) out.push(acc);\n    for (const [ch, child] of [...n.children.entries()].sort((a, b) => a[0].localeCompare(b[0]))) {\n      walk(child, acc + ch);\n      if (out.length >= limit) return;\n    }\n  };\n  walk(root, '');\n  return out;\n}\n","/**\n * Identifier masking helpers for Approach B sampler integration.\n *\n * Full logit masking needs the llama.cpp binding's token callback. Until that\n * hook is universal across binding versions, we:\n *  1. Expose allowed-next-char sets from the trie (for native mask hooks)\n *  2. Post-validate free-text model output for repo identifiers\n *  3. Optionally rewrite / flag unknown identifiers in code-like spans\n */\n\nimport type { TrieNode } from './identifier-trie.js';\nimport { trieAllowedNextChars, trieHas, trieHasPrefix } from './identifier-trie.js';\n\n/** JS/TS-ish identifier token (conservative). */\nconst IDENT_RE = /\\b[A-Za-z_][A-Za-z0-9_]{2,}\\b/g;\n\n/** Tokens we never treat as \"must exist in the graph\". */\nconst STOP = new Set([\n  'the',\n  'and',\n  'for',\n  'var',\n  'let',\n  'const',\n  'function',\n  'class',\n  'return',\n  'import',\n  'export',\n  'from',\n  'async',\n  'await',\n  'true',\n  'false',\n  'null',\n  'undefined',\n  'this',\n  'new',\n  'typeof',\n  'interface',\n  'type',\n  'string',\n  'number',\n  'boolean',\n  'void',\n  'any',\n  'unknown',\n  'Promise',\n  'Array',\n  'Object',\n  'Error',\n  'console',\n  'process',\n  'require',\n  'module',\n  'exports',\n  'default',\n  'extends',\n  'implements',\n  'public',\n  'private',\n  'protected',\n  'static',\n  'readonly',\n  'if',\n  'else',\n  'while',\n  'switch',\n  'case',\n  'break',\n  'continue',\n  'try',\n  'catch',\n  'finally',\n  'throw',\n  'with',\n  'yield',\n  'of',\n  'in',\n  'as',\n  'is',\n  'get',\n  'set',\n]);\n\nexport interface IdentifierScanResult {\n  /** Identifiers that appear in text and exist in the trie. */\n  known: string[];\n  /** Identifiers that appear in text but are absent from the trie. */\n  unknown: string[];\n  /** True when every scanned identifier is known (or stopword). */\n  clean: boolean;\n}\n\n/** Extract candidate identifiers from model text. */\nexport function extractIdentifiers(text: string): string[] {\n  const out = new Set<string>();\n  for (const m of text.matchAll(IDENT_RE)) {\n    const t = m[0];\n    if (STOP.has(t) || STOP.has(t.toLowerCase())) continue;\n    out.add(t);\n  }\n  return [...out].sort();\n}\n\nexport function scanIdentifiersAgainstTrie(text: string, trie: TrieNode): IdentifierScanResult {\n  const known: string[] = [];\n  const unknown: string[] = [];\n  for (const id of extractIdentifiers(text)) {\n    if (trieHas(trie, id) || trieHasPrefix(trie, id)) known.push(id);\n    else unknown.push(id);\n  }\n  return { known, unknown, clean: unknown.length === 0 };\n}\n\n/**\n * Allowed next characters for a partial identifier under the trie — the hook\n * surface for real logit masks when the binding supports custom samplers.\n */\nexport function maskAllowedNextChars(trie: TrieNode, partialIdent: string): string[] {\n  return trieAllowedNextChars(trie, partialIdent);\n}\n\n/**\n * Annotate model output when unknown identifiers appear (non-destructive).\n * Returns original text when clean; otherwise appends a short warning block the\n * agent/tools can surface without rewriting the patch body blindly.\n */\nexport function annotateUnknownIdentifiers(text: string, trie: TrieNode): { text: string; unknown: string[] } {\n  const scan = scanIdentifiersAgainstTrie(text, trie);\n  if (scan.clean) return { text, unknown: [] };\n  const note = `\\n\\n/* vg: unknown identifiers vs graph (not rewritten): ${scan.unknown.slice(0, 12).join(', ')}${scan.unknown.length > 12 ? '…' : ''} */`;\n  return { text: text + note, unknown: scan.unknown };\n}\n","/**\n * Block-level KV / prompt prefix cache keyed by content hash (Approach B).\n *\n * Pure planning layer + multi-turn prefix cursor (P1/P2). The warm host uses\n * {@link longestWarmPrefix} / {@link SessionPrefixCursor} and may call the\n * binding's `evaluateWithoutGeneratingNewTokens` so RoPE state for warm\n * system/capsule blocks is not rebuilt every turn.\n *\n * schemaVersion: kv-cache/0\n */\n\nimport { createHash } from 'node:crypto';\n\nexport const KV_CACHE_SCHEMA = 'kv-cache/0' as const;\n\nexport interface KvBlockMeta {\n  /** Content hash (sha256 hex, truncated in keys for path safety). */\n  hash: string;\n  /** Human label (system, capsule, tools, …). */\n  kind: string;\n  /** UTF-8 byte length of the source text. */\n  bytes: number;\n  /** Approx token count (chars/4 heuristic when unknown). */\n  approxTokens: number;\n  /** When this block entered the registry. */\n  createdAt: number;\n}\n\nexport interface KvAssemblyPlan {\n  schemaVersion: typeof KV_CACHE_SCHEMA;\n  /** Blocks to reuse from cache (hashes). */\n  hit: string[];\n  /** Blocks that must be prefilled (hash + kind). */\n  miss: Array<{ hash: string; kind: string; approxTokens: number }>;\n  /** Ordered sequence of block hashes for the full prompt. */\n  order: string[];\n  /** Estimated tokens already “warm” vs total. */\n  hitTokens: number;\n  totalTokens: number;\n  /**\n   * P2: tokens that must be re-evaluated because the multi-turn cursor\n   * diverged (subset of miss + trailing hits after fork).\n   */\n  deltaTokens?: number;\n  /** How many leading blocks the session cursor already has evaluated. */\n  cursorSkipBlocks?: number;\n}\n\nexport function contentHash(text: string): string {\n  return createHash('sha256').update(text, 'utf8').digest('hex');\n}\n\nexport function approxTokens(text: string): number {\n  return Math.max(1, Math.ceil(text.length / 4));\n}\n\nexport function blockMeta(kind: string, text: string, now = Date.now()): KvBlockMeta {\n  return {\n    hash: contentHash(text),\n    kind,\n    bytes: Buffer.byteLength(text, 'utf8'),\n    approxTokens: approxTokens(text),\n    createdAt: now,\n  };\n}\n\n/** In-memory registry of which content hashes are considered warm. */\nexport class KvBlockRegistry {\n  private readonly warm = new Map<string, KvBlockMeta>();\n\n  markWarm(meta: KvBlockMeta): void {\n    this.warm.set(meta.hash, meta);\n  }\n\n  isWarm(hash: string): boolean {\n    return this.warm.has(hash);\n  }\n\n  get(hash: string): KvBlockMeta | undefined {\n    return this.warm.get(hash);\n  }\n\n  clear(): void {\n    this.warm.clear();\n  }\n\n  size(): number {\n    return this.warm.size;\n  }\n\n  /**\n   * Plan assembly for ordered text segments. Hits reuse warm blocks; misses\n   * need prefill. After a successful forward pass, call {@link commit} on miss hashes.\n   */\n  plan(segments: Array<{ kind: string; text: string }>, cursor?: SessionPrefixCursor): KvAssemblyPlan {\n    const order: string[] = [];\n    const hit: string[] = [];\n    const miss: KvAssemblyPlan['miss'] = [];\n    let hitTokens = 0;\n    let totalTokens = 0;\n    for (const seg of segments) {\n      const meta = blockMeta(seg.kind, seg.text);\n      order.push(meta.hash);\n      totalTokens += meta.approxTokens;\n      if (this.isWarm(meta.hash)) {\n        hit.push(meta.hash);\n        hitTokens += meta.approxTokens;\n      } else {\n        miss.push({ hash: meta.hash, kind: meta.kind, approxTokens: meta.approxTokens });\n      }\n    }\n    let cursorSkipBlocks = 0;\n    let deltaTokens = totalTokens;\n    if (cursor) {\n      const d = cursor.delta(order, segments);\n      cursorSkipBlocks = d.skipBlocks;\n      deltaTokens = d.evaluateTokens;\n    }\n    return {\n      schemaVersion: KV_CACHE_SCHEMA,\n      hit,\n      miss,\n      order,\n      hitTokens,\n      totalTokens,\n      cursorSkipBlocks,\n      deltaTokens,\n    };\n  }\n\n  /** After prefill, mark miss segments warm. */\n  commit(segments: Array<{ kind: string; text: string }>): void {\n    for (const seg of segments) {\n      this.markWarm(blockMeta(seg.kind, seg.text));\n    }\n  }\n}\n\n/**\n * Multi-turn cursor: remembers the hash chain last evaluated on the sequence\n * so we only re-evaluate from the first divergence (P2 RoPE-friendly delta).\n */\nexport class SessionPrefixCursor {\n  private chain: string[] = [];\n\n  /** Hashes currently considered evaluated on the sequence. */\n  get evaluatedHashes(): readonly string[] {\n    return this.chain;\n  }\n\n  /**\n   * Compute how many leading blocks match the previous chain and how many\n   * approx tokens still need evaluate (from the fork point).\n   */\n  delta(\n    order: string[],\n    segments: Array<{ kind: string; text: string }>,\n  ): { skipBlocks: number; evaluateTokens: number; evaluateText: string } {\n    let skip = 0;\n    while (skip < order.length && skip < this.chain.length && order[skip] === this.chain[skip]) {\n      skip++;\n    }\n    let evaluateTokens = 0;\n    const parts: string[] = [];\n    for (let i = skip; i < segments.length; i++) {\n      const meta = blockMeta(segments[i].kind, segments[i].text);\n      evaluateTokens += meta.approxTokens;\n      parts.push(segments[i].text);\n    }\n    return { skipBlocks: skip, evaluateTokens, evaluateText: parts.join('\\n') };\n  }\n\n  /** After successful evaluate of full ordered hashes, advance the cursor. */\n  commit(order: string[]): void {\n    this.chain = [...order];\n  }\n\n  /** Reset after sequence dispose / model reload. */\n  reset(): void {\n    this.chain = [];\n  }\n}\n\n/**\n * Longest leading run of warm segments (stable system/capsule prefix).\n * Host can skip re-prefilling these when the sequence API allows evaluate-only.\n */\nexport function longestWarmPrefix(\n  registry: KvBlockRegistry,\n  segments: Array<{ kind: string; text: string }>,\n): {\n  count: number;\n  tokens: number;\n  text: string;\n  hashes: string[];\n} {\n  let count = 0;\n  let tokens = 0;\n  const hashes: string[] = [];\n  const parts: string[] = [];\n  for (const seg of segments) {\n    const meta = blockMeta(seg.kind, seg.text);\n    if (!registry.isWarm(meta.hash)) break;\n    count++;\n    tokens += meta.approxTokens;\n    hashes.push(meta.hash);\n    parts.push(seg.text);\n  }\n  return { count, tokens, text: parts.join('\\n'), hashes };\n}\n\n/**\n * Speculative draft tokens for quotational spans the graph already knows\n * verbatim (signatures / imports). The big model verifies; high acceptance\n * expected on code. Pure: returns candidate draft strings, does not call a model.\n */\nexport function graphDraftCandidates(\n  knownVerbatim: string[],\n  max = 8,\n): string[] {\n  return knownVerbatim\n    .map((s) => s.trim())\n    .filter((s) => s.length >= 8 && s.length <= 400)\n    .slice(0, max);\n}\n"]}

package/dist/chunk-JZYGEZTU.js

@@ -0,0 +1,82 @@
+import { startVgdServer } from './chunk-SZLF66FJ.js';
+import { vgdIsRunning, vgdRequest } from './chunk-PMYWZRRS.js';
+
+// src/code/runtime-session.ts
+async function startCodeRuntimeSession(options) {
+  const socketPath = options.socketPath;
+  const isRunning = options.isRunning ?? ((sp) => vgdIsRunning({ socketPath: sp }));
+  const request = options.request ?? vgdRequest;
+  const startServer = options.startServer ?? ((opts) => startVgdServer(opts));
+  try {
+    if (await isRunning(socketPath)) {
+      return await attachExisting(options.root, socketPath, request);
+    }
+    return await startOwned(options.root, socketPath, startServer, request);
+  } catch {
+    return noneSession();
+  }
+}
+async function attachExisting(root, socketPath, request) {
+  const clientOpts = { socketPath };
+  const reg = await request({ op: "register", root }, clientOpts);
+  if (!reg.ok || !("workspace" in reg)) return noneSession();
+  const status = await request({ op: "status" }, clientOpts).catch(() => null);
+  const pid = status && status.ok && "pid" in status ? status.pid : void 0;
+  let disposed = false;
+  return {
+    kind: "attached",
+    pid,
+    workspace: reg.workspace,
+    socketPath: status && status.ok && "socketPath" in status ? status.socketPath : socketPath,
+    label: pid != null ? `vgd ${pid}` : "vgd",
+    async dispose() {
+      if (disposed) return;
+      disposed = true;
+      try {
+        await request({ op: "unregister", root }, clientOpts);
+      } catch {
+      }
+    }
+  };
+}
+async function startOwned(root, socketPath, startServer, request) {
+  const server = await startServer({ socketPath });
+  const clientOpts = { socketPath: server.socketPath };
+  let workspace;
+  try {
+    const reg = await request({ op: "register", root }, clientOpts);
+    if (reg.ok && "workspace" in reg) workspace = reg.workspace;
+  } catch {
+  }
+  let disposed = false;
+  return {
+    kind: "owned",
+    pid: process.pid,
+    workspace,
+    socketPath: server.socketPath,
+    label: `vgd (session)`,
+    async dispose() {
+      if (disposed) return;
+      disposed = true;
+      try {
+        await server.close();
+      } catch {
+      }
+    }
+  };
+}
+function noneSession() {
+  return {
+    kind: "none",
+    pid: void 0,
+    workspace: void 0,
+    socketPath: void 0,
+    label: "",
+    async dispose() {
+    }
+  };
+}
+
+export { startCodeRuntimeSession };
+//# sourceMappingURL=chunk-JZYGEZTU.js.map
+//# sourceMappingURL=chunk-JZYGEZTU.js.map

package/dist/chunk-JZYGEZTU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/code/runtime-session.ts"],"names":[],"mappings":";;;;AA4CA,eAAsB,wBAAwB,OAAA,EAA6D;AACzG,EAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAC3B,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,KAAc,CAAC,OAAgB,YAAA,CAAa,EAAE,UAAA,EAAY,EAAA,EAAI,CAAA,CAAA;AACxF,EAAA,MAAM,OAAA,GAAU,QAAQ,OAAA,IAAW,UAAA;AACnC,EAAA,MAAM,cAAc,OAAA,CAAQ,WAAA,KAAgB,CAAC,IAAA,KAAkC,eAAe,IAAI,CAAA,CAAA;AAElG,EAAA,IAAI;AACF,IAAA,IAAI,MAAM,SAAA,CAAU,UAAU,CAAA,EAAG;AAC/B,MAAA,OAAO,MAAM,cAAA,CAAe,OAAA,CAAQ,IAAA,EAAM,YAAY,OAAO,CAAA;AAAA,IAC/D;AACA,IAAA,OAAO,MAAM,UAAA,CAAW,OAAA,CAAQ,IAAA,EAAM,UAAA,EAAY,aAAa,OAAO,CAAA;AAAA,EACxE,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,WAAA,EAAY;AAAA,EACrB;AACF;AAEA,eAAe,cAAA,CACb,IAAA,EACA,UAAA,EACA,OAAA,EAC6B;AAC7B,EAAA,MAAM,UAAA,GAAa,EAAE,UAAA,EAAW;AAChC,EAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,EAAE,IAAI,UAAA,EAAY,IAAA,IAAQ,UAAU,CAAA;AAC9D,EAAA,IAAI,CAAC,GAAA,CAAI,EAAA,IAAM,EAAE,WAAA,IAAe,GAAA,CAAA,SAAa,WAAA,EAAY;AACzD,EAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,EAAE,EAAA,EAAI,QAAA,EAAS,EAAG,UAAU,CAAA,CAAE,KAAA,CAAM,MAAM,IAAI,CAAA;AAC3E,EAAA,MAAM,MAAM,MAAA,IAAU,MAAA,CAAO,MAAM,KAAA,IAAS,MAAA,GAAS,OAAO,GAAA,GAAM,MAAA;AAClE,EAAA,IAAI,QAAA,GAAW,KAAA;AACf,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,UAAA;AAAA,IACN,GAAA;AAAA,IACA,WAAW,GAAA,CAAI,SAAA;AAAA,IACf,YAAY,MAAA,IAAU,MAAA,CAAO,MAAM,YAAA,IAAgB,MAAA,GAAS,OAAO,UAAA,GAAa,UAAA;AAAA,IAChF,KAAA,EAAO,GAAA,IAAO,IAAA,GAAO,CAAA,IAAA,EAAO,GAAG,CAAA,CAAA,GAAK,KAAA;AAAA,IACpC,MAAM,OAAA,GAAU;AACd,MAAA,IAAI,QAAA,EAAU;AACd,MAAA,QAAA,GAAW,IAAA;AACX,MAAA,IAAI;AACF,QAAA,MAAM,QAAQ,EAAE,EAAA,EAAI,YAAA,EAAc,IAAA,IAAQ,UAAU,CAAA;AAAA,MACtD,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACF;AAAA,GACF;AACF;AAEA,eAAe,UAAA,CACb,IAAA,EACA,UAAA,EACA,WAAA,EACA,OAAA,EAC6B;AAC7B,EAAA,MAAM,MAAA,GAAS,MAAM,WAAA,CAAY,EAAE,YAAY,CAAA;AAC/C,EAAA,MAAM,UAAA,GAAa,EAAE,UAAA,EAAY,MAAA,CAAO,UAAA,EAAW;AACnD,EAAA,IAAI,SAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,MAAM,OAAA,CAAQ,EAAE,IAAI,UAAA,EAAY,IAAA,IAAQ,UAAU,CAAA;AAC9D,IAAA,IAAI,GAAA,CAAI,EAAA,IAAM,WAAA,IAAe,GAAA,cAAiB,GAAA,CAAI,SAAA;AAAA,EACpD,CAAA,CAAA,MAAQ;AAAA,EAER;AACA,EAAA,IAAI,QAAA,GAAW,KAAA;AACf,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,OAAA;AAAA,IACN,KAAK,OAAA,CAAQ,GAAA;AAAA,IACb,SAAA;AAAA,IACA,YAAY,MAAA,CAAO,UAAA;AAAA,IACnB,KAAA,EAAO,CAAA,aAAA,CAAA;AAAA,IACP,MAAM,OAAA,GAAU;AACd,MAAA,IAAI,QAAA,EAAU;AACd,MAAA,QAAA,GAAW,IAAA;AACX,MAAA,IAAI;AACF,QAAA,MAAM,OAAO,KAAA,EAAM;AAAA,MACrB,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACF;AAAA,GACF;AACF;AAEA,SAAS,WAAA,GAAkC;AACzC,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,MAAA;AAAA,IACN,GAAA,EAAK,MAAA;AAAA,IACL,SAAA,EAAW,MAAA;AAAA,IACX,UAAA,EAAY,MAAA;AAAA,IACZ,KAAA,EAAO,EAAA;AAAA,IACP,MAAM,OAAA,GAAU;AAAA,IAEhB;AAAA,GACF;AACF","file":"chunk-JZYGEZTU.js","sourcesContent":["/**\n * Session boundary between VG Code and the Fusion Runtime daemon (`vgd`).\n *\n * Replaces the old {@link GraphProcess} (`vg serve` child) for the interactive\n * coding REPL. Behaviour:\n *\n * 1. If a local vgd is already running — register this workspace and leave the\n *    daemon running when the session ends (unregister only).\n * 2. Otherwise — start an **in-process** vgd for the life of the session and\n *    tear it down on dispose. No second OS process, no `vg serve` spawn.\n *\n * Never throws: a failure to attach degrades to “no runtime session” and the\n * agent continues with the in-process graph only (same safety as GraphProcess).\n */\n\nimport { startVgdServer, vgdIsRunning, vgdRequest, type VgdServer } from '../runtime/vgd/index.js';\nimport type { WorkspaceRecord } from '../runtime/vgd/protocol.js';\n\nexport type RuntimeSessionKind = 'attached' | 'owned' | 'none';\n\nexport interface RuntimeSessionOptions {\n  root: string;\n  /** Override socket path (tests). */\n  socketPath?: string;\n  /** Injectable connect/start hooks (tests). */\n  isRunning?: (socketPath?: string) => Promise<boolean>;\n  request?: typeof vgdRequest;\n  startServer?: (opts: { socketPath?: string }) => Promise<VgdServer>;\n}\n\nexport interface CodeRuntimeSession {\n  readonly kind: RuntimeSessionKind;\n  /** Daemon pid when known (attached status or owned process). */\n  readonly pid: number | undefined;\n  readonly workspace: WorkspaceRecord | undefined;\n  readonly socketPath: string | undefined;\n  /** Human label for the REPL intro line. */\n  readonly label: string;\n  dispose(): Promise<void>;\n}\n\n/**\n * Attach VG Code to vgd for one coding session. Always resolves (never throws).\n */\nexport async function startCodeRuntimeSession(options: RuntimeSessionOptions): Promise<CodeRuntimeSession> {\n  const socketPath = options.socketPath;\n  const isRunning = options.isRunning ?? ((sp?: string) => vgdIsRunning({ socketPath: sp }));\n  const request = options.request ?? vgdRequest;\n  const startServer = options.startServer ?? ((opts: { socketPath?: string }) => startVgdServer(opts));\n\n  try {\n    if (await isRunning(socketPath)) {\n      return await attachExisting(options.root, socketPath, request);\n    }\n    return await startOwned(options.root, socketPath, startServer, request);\n  } catch {\n    return noneSession();\n  }\n}\n\nasync function attachExisting(\n  root: string,\n  socketPath: string | undefined,\n  request: typeof vgdRequest,\n): Promise<CodeRuntimeSession> {\n  const clientOpts = { socketPath };\n  const reg = await request({ op: 'register', root }, clientOpts);\n  if (!reg.ok || !('workspace' in reg)) return noneSession();\n  const status = await request({ op: 'status' }, clientOpts).catch(() => null);\n  const pid = status && status.ok && 'pid' in status ? status.pid : undefined;\n  let disposed = false;\n  return {\n    kind: 'attached',\n    pid,\n    workspace: reg.workspace,\n    socketPath: status && status.ok && 'socketPath' in status ? status.socketPath : socketPath,\n    label: pid != null ? `vgd ${pid}` : 'vgd',\n    async dispose() {\n      if (disposed) return;\n      disposed = true;\n      try {\n        await request({ op: 'unregister', root }, clientOpts);\n      } catch {\n        /* best-effort */\n      }\n    },\n  };\n}\n\nasync function startOwned(\n  root: string,\n  socketPath: string | undefined,\n  startServer: (opts: { socketPath?: string }) => Promise<VgdServer>,\n  request: typeof vgdRequest,\n): Promise<CodeRuntimeSession> {\n  const server = await startServer({ socketPath });\n  const clientOpts = { socketPath: server.socketPath };\n  let workspace: WorkspaceRecord | undefined;\n  try {\n    const reg = await request({ op: 'register', root }, clientOpts);\n    if (reg.ok && 'workspace' in reg) workspace = reg.workspace;\n  } catch {\n    /* registry optional for an empty session */\n  }\n  let disposed = false;\n  return {\n    kind: 'owned',\n    pid: process.pid,\n    workspace,\n    socketPath: server.socketPath,\n    label: `vgd (session)`,\n    async dispose() {\n      if (disposed) return;\n      disposed = true;\n      try {\n        await server.close();\n      } catch {\n        /* best-effort */\n      }\n    },\n  };\n}\n\nfunction noneSession(): CodeRuntimeSession {\n  return {\n    kind: 'none',\n    pid: undefined,\n    workspace: undefined,\n    socketPath: undefined,\n    label: '',\n    async dispose() {\n      /* no-op */\n    },\n  };\n}\n"]}