@brightbeamai/chap-coordinator 0.3.3 → 0.3.5

package/dist/patch.js

@@ -107,77 +107,116 @@ function deepEqual(a, b) {
   }
   return true;
 }
-function applyOne(doc, op) {
+function addAt(doc, path, value, size, copied = false, movedFrom) {
+  const parts = splitPath(path);
+  if (parts.length === 0) {
+    if (size) {
+      size.reset(value);
+      if (copied || movedFrom !== void 0) size.carry(size);
+    }
+    return value;
+  }
+  const [parent, key] = navigate(doc, parts);
+  let newKey;
+  if (Array.isArray(parent)) {
+    if (key === "-") {
+      parent.push(value);
+    } else {
+      const idx = key;
+      if (idx < 0 || idx > parent.length) {
+        throw new PatchError(`Index out of range for add: ${path}`);
+      }
+      parent.splice(idx, 0, value);
+    }
+  } else if (parent !== null && typeof parent === "object") {
+    if (Object.prototype.hasOwnProperty.call(parent, key)) size?.take(parent[key]);
+    else newKey = key;
+    parent[key] = value;
+  } else {
+    throw new PatchError(`Cannot add into ${jsonType(parent)}`);
+  }
+  if (size) {
+    if (movedFrom === void 0) {
+      const inserted = size.insert(value, parts.length, newKey);
+      if (copied) size.carry(inserted);
+    } else {
+      if (newKey !== void 0) size.bytes += utf8Length(newKey);
+      if (parts.length > movedFrom) {
+        const moved = sizeOf(value);
+        size.depth = Math.max(size.depth, parts.length + moved.depth);
+        size.carry(moved);
+      }
+    }
+  }
+  return doc;
+}
+function removeAt(doc, path, size, moved = false) {
+  const parts = splitPath(path);
+  if (parts.length === 0) throw new PatchError("Cannot remove root.");
+  const [parent, key] = navigate(doc, parts);
+  if (Array.isArray(parent)) {
+    const idx = key === "-" ? -1 : key;
+    if (idx < 0 || idx >= parent.length) {
+      throw new PatchError(`Index out of range for remove: ${path}`);
+    }
+    if (size && !moved) size.take(parent[idx]);
+    parent.splice(idx, 1);
+  } else if (parent !== null && typeof parent === "object") {
+    if (!Object.prototype.hasOwnProperty.call(parent, key)) {
+      throw new PatchError(`Path not found for remove: ${path}`);
+    }
+    if (size) {
+      if (moved) size.bytes -= utf8Length(key);
+      else size.take(parent[key], key);
+    }
+    delete parent[key];
+  } else {
+    throw new PatchError(`Cannot remove from ${jsonType(parent)}`);
+  }
+  return doc;
+}
+function applyOne(doc, op, size) {
   const kind = op.op;
   const path = op.path ?? "";
   if (kind === "add") {
     if (!("value" in op)) throw new PatchError("'add' requires 'value'");
-    const parts = splitPath(path);
-    if (parts.length === 0) return op.value;
-    const [parent, key] = navigate(doc, parts);
-    if (Array.isArray(parent)) {
-      if (key === "-") {
-        parent.push(op.value);
-      } else {
-        const idx = key;
-        if (idx < 0 || idx > parent.length) {
-          throw new PatchError(`Index out of range for add: ${path}`);
-        }
-        parent.splice(idx, 0, op.value);
-      }
-    } else if (parent !== null && typeof parent === "object") {
-      parent[key] = op.value;
-    } else {
-      throw new PatchError(`Cannot add into ${jsonType(parent)}`);
-    }
-    return doc;
+    return addAt(doc, path, clone(op.value), size);
   }
   if (kind === "replace") {
     if (!("value" in op)) throw new PatchError("'replace' requires 'value'");
     const parts = splitPath(path);
-    if (parts.length === 0) return op.value;
+    const value = clone(op.value);
+    if (parts.length === 0) {
+      size?.reset(value);
+      return value;
+    }
     const [parent, key] = navigate(doc, parts);
     if (Array.isArray(parent)) {
       const idx = key === "-" ? -1 : key;
       if (idx < 0 || idx >= parent.length) {
         throw new PatchError(`Path not found for replace: ${path}`);
       }
-      parent[idx] = op.value;
+      size?.take(parent[idx]);
+      parent[idx] = value;
     } else if (parent !== null && typeof parent === "object") {
       if (!Object.prototype.hasOwnProperty.call(parent, key)) {
         throw new PatchError(`Path not found for replace: ${path}`);
       }
-      parent[key] = op.value;
+      size?.take(parent[key]);
+      parent[key] = value;
     } else {
       throw new PatchError(`Cannot replace in ${jsonType(parent)}`);
     }
+    size?.insert(value, parts.length);
     return doc;
   }
   if (kind === "remove") {
-    const parts = splitPath(path);
-    if (parts.length === 0) throw new PatchError("Cannot remove root.");
-    const [parent, key] = navigate(doc, parts);
-    if (Array.isArray(parent)) {
-      const idx = key === "-" ? -1 : key;
-      if (idx < 0 || idx >= parent.length) {
-        throw new PatchError(`Index out of range for remove: ${path}`);
-      }
-      parent.splice(idx, 1);
-    } else if (parent !== null && typeof parent === "object") {
-      if (!Object.prototype.hasOwnProperty.call(parent, key)) {
-        throw new PatchError(`Path not found for remove: ${path}`);
-      }
-      delete parent[key];
-    } else {
-      throw new PatchError(`Cannot remove from ${jsonType(parent)}`);
-    }
-    return doc;
+    return removeAt(doc, path, size);
   }
   if (kind === "copy") {
     const src = op.from;
     if (src === void 0) throw new PatchError("'copy' requires 'from'");
-    const value = clone(getAt(doc, src));
-    return applyOne(doc, { op: "add", path, value });
+    return addAt(doc, path, clone(getAt(doc, src)), size, true);
   }
   if (kind === "move") {
     const src = op.from;
@@ -185,9 +224,9 @@ function applyOne(doc, op) {
     if (path.startsWith(src + "/")) {
       throw new PatchError("'move' cannot move a location into its own child.");
     }
-    const value = clone(getAt(doc, src));
-    doc = applyOne(doc, { op: "remove", path: src });
-    return applyOne(doc, { op: "add", path, value });
+    const value = getAt(doc, src);
+    doc = removeAt(doc, src, size, true);
+    return addAt(doc, path, value, size, false, splitPath(src).length);
   }
   if (kind === "test") {
     if (!("value" in op)) throw new PatchError("'test' requires 'value'");
@@ -199,29 +238,122 @@ function applyOne(doc, op) {
 }
 var MAX_PATCH_OPS = 1e3;
 var MAX_DOCUMENT_NODES = 1e5;
-function nodeCount(value) {
-  if (Array.isArray(value)) {
-    let n = 1;
-    for (const v of value) n += nodeCount(v);
-    return n;
-  }
-  if (value !== null && typeof value === "object") {
-    let n = 1;
-    for (const v of Object.values(value)) n += nodeCount(v);
-    return n;
-  }
-  return 1;
+var MAX_DOCUMENT_DEPTH = 64;
+var MAX_CARRIED_TIMES = 3;
+var DEFAULT_MAX_PATCHED_BYTES = 1048576;
+function utf8Length(s) {
+  const buffer = globalThis.Buffer;
+  if (typeof buffer === "function") {
+    return buffer.byteLength(s, "utf8");
+  }
+  let n = 0;
+  for (let i = 0; i < s.length; i++) {
+    const c = s.charCodeAt(i);
+    if (c < 128) n += 1;
+    else if (c < 2048) n += 2;
+    else if (c >= 55296 && c <= 56319 && i + 1 < s.length) {
+      const d = s.charCodeAt(i + 1);
+      if (d >= 56320 && d <= 57343) {
+        n += 4;
+        i++;
+      } else n += 3;
+    } else n += 3;
+  }
+  return n;
 }
-function applyJsonPatch(doc, ops) {
+function sizeOf(value) {
+  if (value === null || typeof value !== "object") {
+    return { nodes: 1, bytes: typeof value === "string" ? utf8Length(value) : 0, depth: 1 };
+  }
+  let nodes = 0;
+  let bytes = 0;
+  let depth = 0;
+  const values = [value];
+  const levels = [1];
+  const visit = (x, level) => {
+    if (x !== null && typeof x === "object") {
+      values.push(x);
+      levels.push(level);
+      return;
+    }
+    nodes += 1;
+    if (level > depth) depth = level;
+    if (typeof x === "string") bytes += utf8Length(x);
+  };
+  while (values.length > 0) {
+    const v = values.pop();
+    const level = levels.pop();
+    nodes += 1;
+    if (level > depth) depth = level;
+    if (Array.isArray(v)) {
+      for (const x of v) visit(x, level + 1);
+    } else {
+      const o = v;
+      for (const k of Object.keys(o)) {
+        bytes += utf8Length(k);
+        visit(o[k], level + 1);
+      }
+    }
+  }
+  return { nodes, bytes, depth };
+}
+var Size = class {
+  nodes = 0;
+  bytes = 0;
+  depth = 0;
+  /** What copies, and moves to a deeper place or onto the whole document, have carried. */
+  carriedNodes = 0;
+  carriedBytes = 0;
+  constructor(doc) {
+    this.reset(doc);
+  }
+  reset(doc) {
+    const s = sizeOf(doc);
+    this.nodes = s.nodes;
+    this.bytes = s.bytes;
+    this.depth = s.depth;
+  }
+  /** `value` goes in `segments` levels below the top, under a new `key`. */
+  insert(value, segments, key) {
+    const s = sizeOf(value);
+    this.nodes += s.nodes;
+    this.bytes += s.bytes + (key === void 0 ? 0 : utf8Length(key));
+    this.depth = Math.max(this.depth, segments + s.depth);
+    return s;
+  }
+  carry(s) {
+    this.carriedNodes += s.nodes;
+    this.carriedBytes += s.bytes;
+  }
+  /** `value` comes out, with its `key`. */
+  take(value, key) {
+    const s = sizeOf(value);
+    this.nodes -= s.nodes;
+    this.bytes -= s.bytes + (key === void 0 ? 0 : utf8Length(key));
+  }
+};
+function applyJsonPatch(doc, ops, limits = {}) {
+  const maxBytes = limits.maxStringBytes ?? DEFAULT_MAX_PATCHED_BYTES;
   if (ops.length > MAX_PATCH_OPS) {
     throw new PatchError(`Patch has too many operations (${ops.length} > ${MAX_PATCH_OPS})`);
   }
   let out = JSON.parse(JSON.stringify(doc));
+  const size = new Size(out);
   for (const op of ops) {
-    out = applyOne(out, op);
-    if (nodeCount(out) > MAX_DOCUMENT_NODES) {
+    out = applyOne(out, op, size);
+    if (size.depth > MAX_DOCUMENT_DEPTH) size.depth = sizeOf(out).depth;
+    if (size.nodes > MAX_DOCUMENT_NODES) {
       throw new PatchError(`Patched document exceeds the node limit (${MAX_DOCUMENT_NODES})`);
     }
+    if (size.bytes > maxBytes) {
+      throw new PatchError(`Patched document exceeds the size limit (${maxBytes} bytes of strings and keys)`);
+    }
+    if (size.depth > MAX_DOCUMENT_DEPTH) {
+      throw new PatchError(`Patched document nests deeper than ${MAX_DOCUMENT_DEPTH} levels`);
+    }
+    if (size.carriedNodes > MAX_CARRIED_TIMES * MAX_DOCUMENT_NODES || size.carriedBytes > MAX_CARRIED_TIMES * maxBytes) {
+      throw new PatchError(`Patch copies or moves more than its limit (${MAX_CARRIED_TIMES * MAX_DOCUMENT_NODES} values or ${MAX_CARRIED_TIMES * maxBytes} bytes of strings and keys)`);
+    }
   }
   return out;
 }
@@ -260,6 +392,7 @@ function diffJsonPatch(from, to, basePath = "") {
   return ops;
 }
 export {
+  DEFAULT_MAX_PATCHED_BYTES,
   PatchError,
   applyJsonPatch,
   diffJsonPatch

package/dist/patch.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/patch.ts"],"sourcesContent":["/**\n * @brightbeamai/chap-coordinator/patch\n *\n * RFC 6902 JSON Patch implementation, plus a small diff computer that\n * produces a patch from two values. Used by the Coordinator for\n * `decide.override` apply and by the playground UI (in the browser) to\n * compute the patch from a textarea edit.\n *\n * Implements all six RFC 6902 operations (add, remove, replace, move,\n * copy, test) with semantics identical to the Python reference. Path\n * segments that enable prototype pollution in a JavaScript runtime\n * (`__proto__`, `constructor`, `prototype`) are rejected, so the two\n * references accept and reject exactly the same patches.\n */\n\nimport type { JsonPatchOp } from \"./types.js\";\n\nexport class PatchError extends Error {}\n\n// Rejected in every JSON Pointer segment: these enable prototype pollution.\nconst DANGEROUS_KEYS = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n\n// An array index is an RFC 6901 array index: \"0\" or a positive integer with no\n// leading zero. A shared strict rule keeps the two references in step -- JS\n// Number() and Python int() otherwise accept disjoint token sets (e.g. \"1e1\",\n// \"0x0a\", \"3.0\", \"\", \"1_0\"), which would apply the same patch differently.\nconst ARRAY_INDEX_RE = /^(0|[1-9][0-9]*)$/;\n\n// The JSON type name of a value. Python and JavaScript name their own types\n// differently (dict against object, list against object, str against string).\n// The refusal names the JSON type, which both references and the\n// specification share.\nfunction jsonType(value: unknown): string {\n  if (value === null) return \"null\";\n  if (Array.isArray(value)) return \"array\";\n  switch (typeof value) {\n    case \"object\":  return \"object\";\n    case \"string\":  return \"string\";\n    case \"number\":  return \"number\";\n    case \"boolean\": return \"boolean\";\n    default:        return \"null\";\n  }\n}\n\nfunction arrayIndex(seg: string): number {\n  if (!ARRAY_INDEX_RE.test(seg)) throw new PatchError(`Array index expected at ${JSON.stringify(seg)}`);\n  return Number(seg);\n}\n\nfunction unescape(token: string): string {\n  return token.replace(/~1/g, \"/\").replace(/~0/g, \"~\");\n}\n\nfunction splitPath(path: string): string[] {\n  if (path === \"\") return [];\n  if (!path.startsWith(\"/\")) {\n    throw new PatchError(`JSON Pointer must start with '/': ${JSON.stringify(path)}`);\n  }\n  const segments = path.slice(1).split(\"/\").map(unescape);\n  for (const seg of segments) {\n    if (DANGEROUS_KEYS.has(seg)) {\n      throw new PatchError(`Refusing unsafe path segment ${JSON.stringify(seg)}`);\n    }\n  }\n  return segments;\n}\n\n/** Navigate to the parent of the target; return [parent, lastKey]. */\nfunction navigate(doc: any, parts: string[]): [any, string | number] {\n  if (parts.length === 0) {\n    throw new PatchError(\"Cannot operate on root with this helper.\");\n  }\n  let parent = doc;\n  for (let i = 0; i < parts.length - 1; i++) {\n    const part = parts[i];\n    if (Array.isArray(parent)) {\n      const idx = arrayIndex(part);\n      if (idx >= parent.length) {\n        throw new PatchError(`Index out of range at /${parts.slice(0, i + 1).join(\"/\")}`);\n      }\n      parent = parent[idx];\n    } else if (parent !== null && typeof parent === \"object\") {\n      if (!Object.prototype.hasOwnProperty.call(parent, part)) {\n        throw new PatchError(`Path not found: /${parts.slice(0, i + 1).join(\"/\")}`);\n      }\n      parent = parent[part];\n    } else {\n      throw new PatchError(`Cannot traverse into ${jsonType(parent)} at ${JSON.stringify(part)}`);\n    }\n  }\n  const last = parts[parts.length - 1];\n  if (Array.isArray(parent)) {\n    if (last === \"-\") return [parent, \"-\"];\n    return [parent, arrayIndex(last)];\n  }\n  return [parent, last];\n}\n\nfunction getAt(doc: any, path: string): any {\n  const parts = splitPath(path);\n  if (parts.length === 0) return doc;\n  const [parent, key] = navigate(doc, parts);\n  if (Array.isArray(parent)) {\n    if (key === \"-\") throw new PatchError(\"Cannot read '-' position.\");\n    const idx = key as number;\n    if (idx < 0 || idx >= parent.length) throw new PatchError(`Index out of range: ${path}`);\n    return parent[idx];\n  }\n  if (\n    parent === null ||\n    typeof parent !== \"object\" ||\n    !Object.prototype.hasOwnProperty.call(parent, key)\n  ) {\n    throw new PatchError(`Path not found: ${path}`);\n  }\n  return parent[key as string];\n}\n\nfunction clone<T>(v: T): T {\n  return v === undefined ? v : (JSON.parse(JSON.stringify(v)) as T);\n}\n\nfunction deepEqual(a: any, b: any): boolean {\n  if (a === b) return true;\n  if (a === null || b === null) return a === b;\n  if (typeof a !== typeof b) return false;\n  if (typeof a !== \"object\") return a === b;\n  const aArr = Array.isArray(a);\n  if (aArr !== Array.isArray(b)) return false;\n  if (aArr) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) if (!deepEqual(a[i], b[i])) return false;\n    return true;\n  }\n  const ak = Object.keys(a);\n  const bk = Object.keys(b);\n  if (ak.length !== bk.length) return false;\n  for (const k of ak) {\n    if (!Object.prototype.hasOwnProperty.call(b, k)) return false;\n    if (!deepEqual(a[k], b[k])) return false;\n  }\n  return true;\n}\n\nfunction applyOne(doc: any, op: JsonPatchOp): any {\n  const kind = op.op;\n  const path = op.path ?? \"\";\n\n  if (kind === \"add\") {\n    if (!(\"value\" in op)) throw new PatchError(\"'add' requires 'value'\");\n    const parts = splitPath(path);\n    if (parts.length === 0) return op.value; // replace whole document\n    const [parent, key] = navigate(doc, parts);\n    if (Array.isArray(parent)) {\n      if (key === \"-\") {\n        parent.push(op.value);\n      } else {\n        const idx = key as number;\n        if (idx < 0 || idx > parent.length) {\n          throw new PatchError(`Index out of range for add: ${path}`);\n        }\n        parent.splice(idx, 0, op.value);\n      }\n    } else if (parent !== null && typeof parent === \"object\") {\n      parent[key as string] = op.value;\n    } else {\n      throw new PatchError(`Cannot add into ${jsonType(parent)}`);\n    }\n    return doc;\n  }\n\n  if (kind === \"replace\") {\n    if (!(\"value\" in op)) throw new PatchError(\"'replace' requires 'value'\");\n    const parts = splitPath(path);\n    if (parts.length === 0) return op.value;\n    const [parent, key] = navigate(doc, parts);\n    if (Array.isArray(parent)) {\n      // RFC 6901: \"-\" names the position after the last element, which no\n      // element occupies, so only \"add\" can use it. Left as a string it slips\n      // through a numeric range check and writes a \"-\" property on the array.\n      const idx = key === \"-\" ? -1 : (key as number);\n      if (idx < 0 || idx >= parent.length) {\n        throw new PatchError(`Path not found for replace: ${path}`);\n      }\n      parent[idx] = op.value;\n    } else if (parent !== null && typeof parent === \"object\") {\n      if (!Object.prototype.hasOwnProperty.call(parent, key)) {\n        throw new PatchError(`Path not found for replace: ${path}`);\n      }\n      parent[key as string] = op.value;\n    } else {\n      throw new PatchError(`Cannot replace in ${jsonType(parent)}`);\n    }\n    return doc;\n  }\n\n  if (kind === \"remove\") {\n    const parts = splitPath(path);\n    if (parts.length === 0) throw new PatchError(\"Cannot remove root.\");\n    const [parent, key] = navigate(doc, parts);\n    if (Array.isArray(parent)) {\n      // RFC 6901: \"-\" names no existing element, so it cannot be removed.\n      // Left as a string it passes the numeric range check and then splice\n      // coerces it to zero, removing the first element instead.\n      const idx = key === \"-\" ? -1 : (key as number);\n      if (idx < 0 || idx >= parent.length) {\n        throw new PatchError(`Index out of range for remove: ${path}`);\n      }\n      parent.splice(idx, 1);\n    } else if (parent !== null && typeof parent === \"object\") {\n      if (!Object.prototype.hasOwnProperty.call(parent, key)) {\n        throw new PatchError(`Path not found for remove: ${path}`);\n      }\n      delete parent[key as string];\n    } else {\n      throw new PatchError(`Cannot remove from ${jsonType(parent)}`);\n    }\n    return doc;\n  }\n\n  if (kind === \"copy\") {\n    const src = op.from;\n    if (src === undefined) throw new PatchError(\"'copy' requires 'from'\");\n    const value = clone(getAt(doc, src));\n    return applyOne(doc, { op: \"add\", path, value });\n  }\n\n  if (kind === \"move\") {\n    const src = op.from;\n    if (src === undefined) throw new PatchError(\"'move' requires 'from'\");\n    // RFC 6902 4.4: 'from' MUST NOT be a proper prefix of 'path'.\n    if (path.startsWith(src + \"/\")) {\n      throw new PatchError(\"'move' cannot move a location into its own child.\");\n    }\n    const value = clone(getAt(doc, src));\n    doc = applyOne(doc, { op: \"remove\", path: src });\n    return applyOne(doc, { op: \"add\", path, value });\n  }\n\n  if (kind === \"test\") {\n    if (!(\"value\" in op)) throw new PatchError(\"'test' requires 'value'\");\n    const actual = getAt(doc, path);\n    if (!deepEqual(actual, op.value)) throw new PatchError(`'test' failed at ${path}`);\n    return doc;\n  }\n\n  throw new PatchError(`Unsupported op: ${JSON.stringify(kind)}`);\n}\n\nconst MAX_PATCH_OPS = 1000;\nconst MAX_DOCUMENT_NODES = 100_000;\n\nfunction nodeCount(value: unknown): number {\n  if (Array.isArray(value)) {\n    let n = 1;\n    for (const v of value) n += nodeCount(v);\n    return n;\n  }\n  if (value !== null && typeof value === \"object\") {\n    let n = 1;\n    for (const v of Object.values(value as Record<string, unknown>)) n += nodeCount(v);\n    return n;\n  }\n  return 1;\n}\n\nexport function applyJsonPatch(doc: unknown, ops: JsonPatchOp[]): unknown {\n  if (ops.length > MAX_PATCH_OPS) {\n    throw new PatchError(`Patch has too many operations (${ops.length} > ${MAX_PATCH_OPS})`);\n  }\n  let out: any = JSON.parse(JSON.stringify(doc));\n  for (const op of ops) {\n    out = applyOne(out, op);\n    if (nodeCount(out) > MAX_DOCUMENT_NODES) {\n      throw new PatchError(`Patched document exceeds the node limit (${MAX_DOCUMENT_NODES})`);\n    }\n  }\n  return out;\n}\n\n// ============================================================\n//   diff: produce a patch that transforms `from` into `to`\n// ============================================================\n\n/**\n * Compute an RFC 6902 patch that, when applied to `from`, produces\n * `to`. Walks objects key-by-key; arrays use a shallow whole-array\n * replace if any element differs. Sufficient for the playground's\n * draft-edit use case where drafts are small JSON objects.\n */\nexport function diffJsonPatch(from: unknown, to: unknown, basePath = \"\"): JsonPatchOp[] {\n  const ops: JsonPatchOp[] = [];\n\n  if (typeof from !== typeof to || Array.isArray(from) !== Array.isArray(to)) {\n    ops.push({ op: \"replace\", path: basePath || \"/\", value: to });\n    return ops;\n  }\n\n  if (from === null || to === null || typeof from !== \"object\") {\n    if (from !== to) {\n      ops.push({ op: \"replace\", path: basePath || \"/\", value: to });\n    }\n    return ops;\n  }\n\n  if (Array.isArray(from) && Array.isArray(to)) {\n    if (JSON.stringify(from) !== JSON.stringify(to)) {\n      ops.push({ op: \"replace\", path: basePath || \"/\", value: to });\n    }\n    return ops;\n  }\n\n  const fromObj = from as Record<string, unknown>;\n  const toObj = to as Record<string, unknown>;\n  const allKeys = new Set([...Object.keys(fromObj), ...Object.keys(toObj)]);\n\n  for (const key of allKeys) {\n    const escaped = key.replace(/~/g, \"~0\").replace(/\\//g, \"~1\");\n    const path = `${basePath}/${escaped}`;\n    if (!(key in fromObj)) {\n      ops.push({ op: \"add\", path, value: toObj[key] });\n    } else if (!(key in toObj)) {\n      ops.push({ op: \"remove\", path });\n    } else {\n      ops.push(...diffJsonPatch(fromObj[key], toObj[key], path));\n    }\n  }\n\n  return ops;\n}\n"],"mappings":";AAiBO,IAAM,aAAN,cAAyB,MAAM;AAAC;AAGvC,IAAM,iBAAiB,oBAAI,IAAI,CAAC,aAAa,eAAe,WAAW,CAAC;AAMxE,IAAM,iBAAiB;AAMvB,SAAS,SAAS,OAAwB;AACxC,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAW,aAAO;AAAA,IACvB;AAAgB,aAAO;AAAA,EACzB;AACF;AAEA,SAAS,WAAW,KAAqB;AACvC,MAAI,CAAC,eAAe,KAAK,GAAG,EAAG,OAAM,IAAI,WAAW,2BAA2B,KAAK,UAAU,GAAG,CAAC,EAAE;AACpG,SAAO,OAAO,GAAG;AACnB;AAEA,SAAS,SAAS,OAAuB;AACvC,SAAO,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AACrD;AAEA,SAAS,UAAU,MAAwB;AACzC,MAAI,SAAS,GAAI,QAAO,CAAC;AACzB,MAAI,CAAC,KAAK,WAAW,GAAG,GAAG;AACzB,UAAM,IAAI,WAAW,qCAAqC,KAAK,UAAU,IAAI,CAAC,EAAE;AAAA,EAClF;AACA,QAAM,WAAW,KAAK,MAAM,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,QAAQ;AACtD,aAAW,OAAO,UAAU;AAC1B,QAAI,eAAe,IAAI,GAAG,GAAG;AAC3B,YAAM,IAAI,WAAW,gCAAgC,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,IAC5E;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,SAAS,KAAU,OAAyC;AACnE,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,WAAW,0CAA0C;AAAA,EACjE;AACA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACzC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,YAAM,MAAM,WAAW,IAAI;AAC3B,UAAI,OAAO,OAAO,QAAQ;AACxB,cAAM,IAAI,WAAW,0BAA0B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;AAAA,MAClF;AACA,eAAS,OAAO,GAAG;AAAA,IACrB,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,UAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,IAAI,GAAG;AACvD,cAAM,IAAI,WAAW,oBAAoB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;AAAA,MAC5E;AACA,eAAS,OAAO,IAAI;AAAA,IACtB,OAAO;AACL,YAAM,IAAI,WAAW,wBAAwB,SAAS,MAAM,CAAC,OAAO,KAAK,UAAU,IAAI,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF;AACA,QAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,QAAI,SAAS,IAAK,QAAO,CAAC,QAAQ,GAAG;AACrC,WAAO,CAAC,QAAQ,WAAW,IAAI,CAAC;AAAA,EAClC;AACA,SAAO,CAAC,QAAQ,IAAI;AACtB;AAEA,SAAS,MAAM,KAAU,MAAmB;AAC1C,QAAM,QAAQ,UAAU,IAAI;AAC5B,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,QAAI,QAAQ,IAAK,OAAM,IAAI,WAAW,2BAA2B;AACjE,UAAM,MAAM;AACZ,QAAI,MAAM,KAAK,OAAO,OAAO,OAAQ,OAAM,IAAI,WAAW,uBAAuB,IAAI,EAAE;AACvF,WAAO,OAAO,GAAG;AAAA,EACnB;AACA,MACE,WAAW,QACX,OAAO,WAAW,YAClB,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GACjD;AACA,UAAM,IAAI,WAAW,mBAAmB,IAAI,EAAE;AAAA,EAChD;AACA,SAAO,OAAO,GAAa;AAC7B;AAEA,SAAS,MAAS,GAAS;AACzB,SAAO,MAAM,SAAY,IAAK,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC;AAC5D;AAEA,SAAS,UAAU,GAAQ,GAAiB;AAC1C,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM,QAAQ,MAAM,KAAM,QAAO,MAAM;AAC3C,MAAI,OAAO,MAAM,OAAO,EAAG,QAAO;AAClC,MAAI,OAAO,MAAM,SAAU,QAAO,MAAM;AACxC,QAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,MAAI,SAAS,MAAM,QAAQ,CAAC,EAAG,QAAO;AACtC,MAAI,MAAM;AACR,QAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AACtE,WAAO;AAAA,EACT;AACA,QAAM,KAAK,OAAO,KAAK,CAAC;AACxB,QAAM,KAAK,OAAO,KAAK,CAAC;AACxB,MAAI,GAAG,WAAW,GAAG,OAAQ,QAAO;AACpC,aAAW,KAAK,IAAI;AAClB,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG,CAAC,EAAG,QAAO;AACxD,QAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAEA,SAAS,SAAS,KAAU,IAAsB;AAChD,QAAM,OAAO,GAAG;AAChB,QAAM,OAAO,GAAG,QAAQ;AAExB,MAAI,SAAS,OAAO;AAClB,QAAI,EAAE,WAAW,IAAK,OAAM,IAAI,WAAW,wBAAwB;AACnE,UAAM,QAAQ,UAAU,IAAI;AAC5B,QAAI,MAAM,WAAW,EAAG,QAAO,GAAG;AAClC,UAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,QAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,UAAI,QAAQ,KAAK;AACf,eAAO,KAAK,GAAG,KAAK;AAAA,MACtB,OAAO;AACL,cAAM,MAAM;AACZ,YAAI,MAAM,KAAK,MAAM,OAAO,QAAQ;AAClC,gBAAM,IAAI,WAAW,+BAA+B,IAAI,EAAE;AAAA,QAC5D;AACA,eAAO,OAAO,KAAK,GAAG,GAAG,KAAK;AAAA,MAChC;AAAA,IACF,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,aAAO,GAAa,IAAI,GAAG;AAAA,IAC7B,OAAO;AACL,YAAM,IAAI,WAAW,mBAAmB,SAAS,MAAM,CAAC,EAAE;AAAA,IAC5D;AACA,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,WAAW;AACtB,QAAI,EAAE,WAAW,IAAK,OAAM,IAAI,WAAW,4BAA4B;AACvE,UAAM,QAAQ,UAAU,IAAI;AAC5B,QAAI,MAAM,WAAW,EAAG,QAAO,GAAG;AAClC,UAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,QAAI,MAAM,QAAQ,MAAM,GAAG;AAIzB,YAAM,MAAM,QAAQ,MAAM,KAAM;AAChC,UAAI,MAAM,KAAK,OAAO,OAAO,QAAQ;AACnC,cAAM,IAAI,WAAW,+BAA+B,IAAI,EAAE;AAAA,MAC5D;AACA,aAAO,GAAG,IAAI,GAAG;AAAA,IACnB,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,UAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACtD,cAAM,IAAI,WAAW,+BAA+B,IAAI,EAAE;AAAA,MAC5D;AACA,aAAO,GAAa,IAAI,GAAG;AAAA,IAC7B,OAAO;AACL,YAAM,IAAI,WAAW,qBAAqB,SAAS,MAAM,CAAC,EAAE;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,UAAU;AACrB,UAAM,QAAQ,UAAU,IAAI;AAC5B,QAAI,MAAM,WAAW,EAAG,OAAM,IAAI,WAAW,qBAAqB;AAClE,UAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,QAAI,MAAM,QAAQ,MAAM,GAAG;AAIzB,YAAM,MAAM,QAAQ,MAAM,KAAM;AAChC,UAAI,MAAM,KAAK,OAAO,OAAO,QAAQ;AACnC,cAAM,IAAI,WAAW,kCAAkC,IAAI,EAAE;AAAA,MAC/D;AACA,aAAO,OAAO,KAAK,CAAC;AAAA,IACtB,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,UAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACtD,cAAM,IAAI,WAAW,8BAA8B,IAAI,EAAE;AAAA,MAC3D;AACA,aAAO,OAAO,GAAa;AAAA,IAC7B,OAAO;AACL,YAAM,IAAI,WAAW,sBAAsB,SAAS,MAAM,CAAC,EAAE;AAAA,IAC/D;AACA,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,QAAQ;AACnB,UAAM,MAAM,GAAG;AACf,QAAI,QAAQ,OAAW,OAAM,IAAI,WAAW,wBAAwB;AACpE,UAAM,QAAQ,MAAM,MAAM,KAAK,GAAG,CAAC;AACnC,WAAO,SAAS,KAAK,EAAE,IAAI,OAAO,MAAM,MAAM,CAAC;AAAA,EACjD;AAEA,MAAI,SAAS,QAAQ;AACnB,UAAM,MAAM,GAAG;AACf,QAAI,QAAQ,OAAW,OAAM,IAAI,WAAW,wBAAwB;AAEpE,QAAI,KAAK,WAAW,MAAM,GAAG,GAAG;AAC9B,YAAM,IAAI,WAAW,mDAAmD;AAAA,IAC1E;AACA,UAAM,QAAQ,MAAM,MAAM,KAAK,GAAG,CAAC;AACnC,UAAM,SAAS,KAAK,EAAE,IAAI,UAAU,MAAM,IAAI,CAAC;AAC/C,WAAO,SAAS,KAAK,EAAE,IAAI,OAAO,MAAM,MAAM,CAAC;AAAA,EACjD;AAEA,MAAI,SAAS,QAAQ;AACnB,QAAI,EAAE,WAAW,IAAK,OAAM,IAAI,WAAW,yBAAyB;AACpE,UAAM,SAAS,MAAM,KAAK,IAAI;AAC9B,QAAI,CAAC,UAAU,QAAQ,GAAG,KAAK,EAAG,OAAM,IAAI,WAAW,oBAAoB,IAAI,EAAE;AACjF,WAAO;AAAA,EACT;AAEA,QAAM,IAAI,WAAW,mBAAmB,KAAK,UAAU,IAAI,CAAC,EAAE;AAChE;AAEA,IAAM,gBAAgB;AACtB,IAAM,qBAAqB;AAE3B,SAAS,UAAU,OAAwB;AACzC,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,IAAI;AACR,eAAW,KAAK,MAAO,MAAK,UAAU,CAAC;AACvC,WAAO;AAAA,EACT;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,QAAI,IAAI;AACR,eAAW,KAAK,OAAO,OAAO,KAAgC,EAAG,MAAK,UAAU,CAAC;AACjF,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEO,SAAS,eAAe,KAAc,KAA6B;AACxE,MAAI,IAAI,SAAS,eAAe;AAC9B,UAAM,IAAI,WAAW,kCAAkC,IAAI,MAAM,MAAM,aAAa,GAAG;AAAA,EACzF;AACA,MAAI,MAAW,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAC7C,aAAW,MAAM,KAAK;AACpB,UAAM,SAAS,KAAK,EAAE;AACtB,QAAI,UAAU,GAAG,IAAI,oBAAoB;AACvC,YAAM,IAAI,WAAW,4CAA4C,kBAAkB,GAAG;AAAA,IACxF;AAAA,EACF;AACA,SAAO;AACT;AAYO,SAAS,cAAc,MAAe,IAAa,WAAW,IAAmB;AACtF,QAAM,MAAqB,CAAC;AAE5B,MAAI,OAAO,SAAS,OAAO,MAAM,MAAM,QAAQ,IAAI,MAAM,MAAM,QAAQ,EAAE,GAAG;AAC1E,QAAI,KAAK,EAAE,IAAI,WAAW,MAAM,YAAY,KAAK,OAAO,GAAG,CAAC;AAC5D,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,QAAQ,OAAO,QAAQ,OAAO,SAAS,UAAU;AAC5D,QAAI,SAAS,IAAI;AACf,UAAI,KAAK,EAAE,IAAI,WAAW,MAAM,YAAY,KAAK,OAAO,GAAG,CAAC;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC5C,QAAI,KAAK,UAAU,IAAI,MAAM,KAAK,UAAU,EAAE,GAAG;AAC/C,UAAI,KAAK,EAAE,IAAI,WAAW,MAAM,YAAY,KAAK,OAAO,GAAG,CAAC;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAEA,QAAM,UAAU;AAChB,QAAM,QAAQ;AACd,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,OAAO,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AAExE,aAAW,OAAO,SAAS;AACzB,UAAM,UAAU,IAAI,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AAC3D,UAAM,OAAO,GAAG,QAAQ,IAAI,OAAO;AACnC,QAAI,EAAE,OAAO,UAAU;AACrB,UAAI,KAAK,EAAE,IAAI,OAAO,MAAM,OAAO,MAAM,GAAG,EAAE,CAAC;AAAA,IACjD,WAAW,EAAE,OAAO,QAAQ;AAC1B,UAAI,KAAK,EAAE,IAAI,UAAU,KAAK,CAAC;AAAA,IACjC,OAAO;AACL,UAAI,KAAK,GAAG,cAAc,QAAQ,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,CAAC;AAAA,IAC3D;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../src/patch.ts"],"sourcesContent":["/**\n * @brightbeamai/chap-coordinator/patch\n *\n * RFC 6902 JSON Patch implementation, plus a small diff computer that\n * produces a patch from two values. Used by the Coordinator for\n * `decide.override` apply and by the playground UI (in the browser) to\n * compute the patch from a textarea edit.\n *\n * Implements all six RFC 6902 operations (add, remove, replace, move,\n * copy, test) with semantics identical to the Python reference. Path\n * segments that enable prototype pollution in a JavaScript runtime\n * (`__proto__`, `constructor`, `prototype`) are rejected, so the two\n * references accept and reject exactly the same patches.\n */\n\nimport type { JsonPatchOp } from \"./types.js\";\n\nexport class PatchError extends Error {}\n\n// Rejected in every JSON Pointer segment: these enable prototype pollution.\nconst DANGEROUS_KEYS = new Set([\"__proto__\", \"constructor\", \"prototype\"]);\n\n// An array index is an RFC 6901 array index: \"0\" or a positive integer with no\n// leading zero. A shared strict rule keeps the two references in step -- JS\n// Number() and Python int() otherwise accept disjoint token sets (e.g. \"1e1\",\n// \"0x0a\", \"3.0\", \"\", \"1_0\"), which would apply the same patch differently.\nconst ARRAY_INDEX_RE = /^(0|[1-9][0-9]*)$/;\n\n// The JSON type name of a value. Python and JavaScript name their own types\n// differently (dict against object, list against object, str against string).\n// The refusal names the JSON type, which both references and the\n// specification share.\nfunction jsonType(value: unknown): string {\n  if (value === null) return \"null\";\n  if (Array.isArray(value)) return \"array\";\n  switch (typeof value) {\n    case \"object\":  return \"object\";\n    case \"string\":  return \"string\";\n    case \"number\":  return \"number\";\n    case \"boolean\": return \"boolean\";\n    default:        return \"null\";\n  }\n}\n\nfunction arrayIndex(seg: string): number {\n  if (!ARRAY_INDEX_RE.test(seg)) throw new PatchError(`Array index expected at ${JSON.stringify(seg)}`);\n  return Number(seg);\n}\n\nfunction unescape(token: string): string {\n  return token.replace(/~1/g, \"/\").replace(/~0/g, \"~\");\n}\n\nfunction splitPath(path: string): string[] {\n  if (path === \"\") return [];\n  if (!path.startsWith(\"/\")) {\n    throw new PatchError(`JSON Pointer must start with '/': ${JSON.stringify(path)}`);\n  }\n  const segments = path.slice(1).split(\"/\").map(unescape);\n  for (const seg of segments) {\n    if (DANGEROUS_KEYS.has(seg)) {\n      throw new PatchError(`Refusing unsafe path segment ${JSON.stringify(seg)}`);\n    }\n  }\n  return segments;\n}\n\n/** Navigate to the parent of the target; return [parent, lastKey]. */\nfunction navigate(doc: any, parts: string[]): [any, string | number] {\n  if (parts.length === 0) {\n    throw new PatchError(\"Cannot operate on root with this helper.\");\n  }\n  let parent = doc;\n  for (let i = 0; i < parts.length - 1; i++) {\n    const part = parts[i];\n    if (Array.isArray(parent)) {\n      const idx = arrayIndex(part);\n      if (idx >= parent.length) {\n        throw new PatchError(`Index out of range at /${parts.slice(0, i + 1).join(\"/\")}`);\n      }\n      parent = parent[idx];\n    } else if (parent !== null && typeof parent === \"object\") {\n      if (!Object.prototype.hasOwnProperty.call(parent, part)) {\n        throw new PatchError(`Path not found: /${parts.slice(0, i + 1).join(\"/\")}`);\n      }\n      parent = parent[part];\n    } else {\n      throw new PatchError(`Cannot traverse into ${jsonType(parent)} at ${JSON.stringify(part)}`);\n    }\n  }\n  const last = parts[parts.length - 1];\n  if (Array.isArray(parent)) {\n    if (last === \"-\") return [parent, \"-\"];\n    return [parent, arrayIndex(last)];\n  }\n  return [parent, last];\n}\n\nfunction getAt(doc: any, path: string): any {\n  const parts = splitPath(path);\n  if (parts.length === 0) return doc;\n  const [parent, key] = navigate(doc, parts);\n  if (Array.isArray(parent)) {\n    if (key === \"-\") throw new PatchError(\"Cannot read '-' position.\");\n    const idx = key as number;\n    if (idx < 0 || idx >= parent.length) throw new PatchError(`Index out of range: ${path}`);\n    return parent[idx];\n  }\n  if (\n    parent === null ||\n    typeof parent !== \"object\" ||\n    !Object.prototype.hasOwnProperty.call(parent, key)\n  ) {\n    throw new PatchError(`Path not found: ${path}`);\n  }\n  return parent[key as string];\n}\n\nfunction clone<T>(v: T): T {\n  return v === undefined ? v : (JSON.parse(JSON.stringify(v)) as T);\n}\n\nfunction deepEqual(a: any, b: any): boolean {\n  if (a === b) return true;\n  if (a === null || b === null) return a === b;\n  if (typeof a !== typeof b) return false;\n  if (typeof a !== \"object\") return a === b;\n  const aArr = Array.isArray(a);\n  if (aArr !== Array.isArray(b)) return false;\n  if (aArr) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) if (!deepEqual(a[i], b[i])) return false;\n    return true;\n  }\n  const ak = Object.keys(a);\n  const bk = Object.keys(b);\n  if (ak.length !== bk.length) return false;\n  for (const k of ak) {\n    if (!Object.prototype.hasOwnProperty.call(b, k)) return false;\n    if (!deepEqual(a[k], b[k])) return false;\n  }\n  return true;\n}\n\n/**\n * Puts `value`, which the document owns from here on, at `path`. A copied\n * value counts towards what the patch carries. A moved value is counted\n * already: `movedFrom` is the number of segments of the place it left, and\n * only its key, a value it replaces and how deep it now reaches change the\n * count. A move to a deeper place, or onto the whole document, costs a pass\n * over the value, so it counts towards what the patch carries as well.\n */\nfunction addAt(doc: any, path: string, value: unknown, size: Size | undefined,\n               copied = false, movedFrom?: number): any {\n  const parts = splitPath(path);\n  if (parts.length === 0) {\n    if (size) {\n      size.reset(value);\n      if (copied || movedFrom !== undefined) size.carry(size);\n    }\n    return value; // replace whole document\n  }\n  const [parent, key] = navigate(doc, parts);\n  let newKey: string | undefined;\n  if (Array.isArray(parent)) {\n    if (key === \"-\") {\n      parent.push(value);\n    } else {\n      const idx = key as number;\n      if (idx < 0 || idx > parent.length) {\n        throw new PatchError(`Index out of range for add: ${path}`);\n      }\n      parent.splice(idx, 0, value);\n    }\n  } else if (parent !== null && typeof parent === \"object\") {\n    if (Object.prototype.hasOwnProperty.call(parent, key)) size?.take(parent[key as string]);\n    else newKey = key as string;\n    parent[key as string] = value;\n  } else {\n    throw new PatchError(`Cannot add into ${jsonType(parent)}`);\n  }\n  if (size) {\n    if (movedFrom === undefined) {\n      const inserted = size.insert(value, parts.length, newKey);\n      if (copied) size.carry(inserted);\n    } else {\n      if (newKey !== undefined) size.bytes += utf8Length(newKey);\n      if (parts.length > movedFrom) {\n        // A move to a deeper place costs a pass over the value, for its depth.\n        const moved = sizeOf(value);\n        size.depth = Math.max(size.depth, parts.length + moved.depth);\n        size.carry(moved);\n      }\n    }\n  }\n  return doc;\n}\n\n/** Removes the value at `path`. A moved value goes back in elsewhere, so only its key leaves the count. */\nfunction removeAt(doc: any, path: string, size: Size | undefined, moved = false): any {\n  const parts = splitPath(path);\n  if (parts.length === 0) throw new PatchError(\"Cannot remove root.\");\n  const [parent, key] = navigate(doc, parts);\n  if (Array.isArray(parent)) {\n    // RFC 6901: \"-\" names no existing element, so it cannot be removed.\n    // Left as a string it passes the numeric range check and then splice\n    // coerces it to zero, removing the first element instead.\n    const idx = key === \"-\" ? -1 : (key as number);\n    if (idx < 0 || idx >= parent.length) {\n      throw new PatchError(`Index out of range for remove: ${path}`);\n    }\n    if (size && !moved) size.take(parent[idx]);\n    parent.splice(idx, 1);\n  } else if (parent !== null && typeof parent === \"object\") {\n    if (!Object.prototype.hasOwnProperty.call(parent, key)) {\n      throw new PatchError(`Path not found for remove: ${path}`);\n    }\n    if (size) {\n      if (moved) size.bytes -= utf8Length(key as string);\n      else size.take(parent[key as string], key as string);\n    }\n    delete parent[key as string];\n  } else {\n    throw new PatchError(`Cannot remove from ${jsonType(parent)}`);\n  }\n  return doc;\n}\n\nfunction applyOne(doc: any, op: JsonPatchOp, size?: Size): any {\n  const kind = op.op;\n  const path = op.path ?? \"\";\n\n  if (kind === \"add\") {\n    if (!(\"value\" in op)) throw new PatchError(\"'add' requires 'value'\");\n    // A copy, so an operation on the inserted value leaves the patch as it\n    // was sent.\n    return addAt(doc, path, clone(op.value), size);\n  }\n\n  if (kind === \"replace\") {\n    if (!(\"value\" in op)) throw new PatchError(\"'replace' requires 'value'\");\n    const parts = splitPath(path);\n    const value = clone(op.value);\n    if (parts.length === 0) {\n      size?.reset(value);\n      return value;\n    }\n    const [parent, key] = navigate(doc, parts);\n    if (Array.isArray(parent)) {\n      // RFC 6901: \"-\" names the position after the last element, which no\n      // element occupies, so only \"add\" can use it. Left as a string it slips\n      // through a numeric range check and writes a \"-\" property on the array.\n      const idx = key === \"-\" ? -1 : (key as number);\n      if (idx < 0 || idx >= parent.length) {\n        throw new PatchError(`Path not found for replace: ${path}`);\n      }\n      size?.take(parent[idx]);\n      parent[idx] = value;\n    } else if (parent !== null && typeof parent === \"object\") {\n      if (!Object.prototype.hasOwnProperty.call(parent, key)) {\n        throw new PatchError(`Path not found for replace: ${path}`);\n      }\n      size?.take(parent[key as string]);\n      parent[key as string] = value;\n    } else {\n      throw new PatchError(`Cannot replace in ${jsonType(parent)}`);\n    }\n    size?.insert(value, parts.length);\n    return doc;\n  }\n\n  if (kind === \"remove\") {\n    return removeAt(doc, path, size);\n  }\n\n  if (kind === \"copy\") {\n    const src = op.from;\n    if (src === undefined) throw new PatchError(\"'copy' requires 'from'\");\n    return addAt(doc, path, clone(getAt(doc, src)), size, true);\n  }\n\n  if (kind === \"move\") {\n    const src = op.from;\n    if (src === undefined) throw new PatchError(\"'move' requires 'from'\");\n    // RFC 6902 4.4: 'from' MUST NOT be a proper prefix of 'path'.\n    if (path.startsWith(src + \"/\")) {\n      throw new PatchError(\"'move' cannot move a location into its own child.\");\n    }\n    // The remove detaches the value, so it moves as it is, uncopied.\n    const value = getAt(doc, src);\n    doc = removeAt(doc, src, size, true);\n    return addAt(doc, path, value, size, false, splitPath(src).length);\n  }\n\n  if (kind === \"test\") {\n    if (!(\"value\" in op)) throw new PatchError(\"'test' requires 'value'\");\n    const actual = getAt(doc, path);\n    if (!deepEqual(actual, op.value)) throw new PatchError(`'test' failed at ${path}`);\n    return doc;\n  }\n\n  throw new PatchError(`Unsupported op: ${JSON.stringify(kind)}`);\n}\n\nconst MAX_PATCH_OPS = 1000;\nconst MAX_DOCUMENT_NODES = 100_000;\n\n/**\n * How deeply a patched document may nest, counting the document as level one,\n * as the coordinator counts a request's nesting. Each operation's value comes\n * within the request's limit, and a patch that puts one value inside another\n * would otherwise nest the document without limit.\n */\nconst MAX_DOCUMENT_DEPTH = 64;\n\n/**\n * How much a patch's copies, and its moves to a deeper place or onto the whole\n * document, may carry between them, as a multiple of the document's limits.\n * Each costs a pass over the value it carries, so a patch that copied the same\n * large value back and forth could otherwise keep a coordinator busy for\n * seconds.\n */\nconst MAX_CARRIED_TIMES = 3;\n\n/**\n * The default cap on the string and key text a patched document may hold, in\n * UTF-8 bytes: the default `max_envelope_bytes`. An artefact that arrives in a\n * request holds no more text than the request's size. The node cap alone does\n * not bound size: a `copy` of the root doubles the document, long strings\n * included, so fifteen of them grow 64 KiB to about 2 GiB within 100,000\n * nodes.\n */\nexport const DEFAULT_MAX_PATCHED_BYTES = 1_048_576;\n\n/** Limits a caller can set on {@link applyJsonPatch}. */\nexport interface PatchLimits {\n  /** The most UTF-8 bytes of string and key text the result may hold. */\n  maxStringBytes?: number;\n}\n\n/**\n * UTF-8 length of a string: Buffer's count where Node provides it, and the\n * same count by hand elsewhere, so the module runs anywhere. A lone surrogate\n * counts three bytes either way, as does Python's\n * `len(s.encode(\"utf-8\", \"surrogatepass\"))`, which keeps the two references\n * refusing the same patches.\n */\nfunction utf8Length(s: string): number {\n  const buffer = (globalThis as { Buffer?: unknown }).Buffer;\n  if (typeof buffer === \"function\") {\n    return (buffer as unknown as { byteLength(s: string, encoding: \"utf8\"): number }).byteLength(s, \"utf8\");\n  }\n  let n = 0;\n  for (let i = 0; i < s.length; i++) {\n    const c = s.charCodeAt(i);\n    if (c < 0x80) n += 1;\n    else if (c < 0x800) n += 2;\n    else if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n      const d = s.charCodeAt(i + 1);\n      if (d >= 0xdc00 && d <= 0xdfff) { n += 4; i++; } else n += 3;\n    } else n += 3;\n  }\n  return n;\n}\n\ninterface Measured { nodes: number; bytes: number; depth: number }\n\n/**\n * A value's count of values, the UTF-8 bytes of its strings and keys, and its\n * depth, counting the value itself as level one, in one pass that does not\n * recurse.\n */\nfunction sizeOf(value: unknown): Measured {\n  if (value === null || typeof value !== \"object\") {\n    return { nodes: 1, bytes: typeof value === \"string\" ? utf8Length(value) : 0, depth: 1 };\n  }\n  let nodes = 0;\n  let bytes = 0;\n  let depth = 0;\n  const values: object[] = [value];\n  const levels: number[] = [1];\n  // A scalar child is counted where it is found, which saves a trip through\n  // the stack.\n  const visit = (x: unknown, level: number): void => {\n    if (x !== null && typeof x === \"object\") {\n      values.push(x);\n      levels.push(level);\n      return;\n    }\n    nodes += 1;\n    if (level > depth) depth = level;\n    if (typeof x === \"string\") bytes += utf8Length(x);\n  };\n  while (values.length > 0) {\n    const v = values.pop()!;\n    const level = levels.pop()!;\n    nodes += 1;\n    if (level > depth) depth = level;\n    if (Array.isArray(v)) {\n      for (const x of v) visit(x, level + 1);\n    } else {\n      const o = v as Record<string, unknown>;\n      for (const k of Object.keys(o)) {\n        bytes += utf8Length(k);\n        visit(o[k], level + 1);\n      }\n    }\n  }\n  return { nodes, bytes, depth };\n}\n\n/**\n * What the working document holds, kept in step by each operation. The values\n * and the bytes are exact: each operation counts what it puts in and what it\n * takes out, so a patch costs what it changes, whatever the document's size.\n * The depth is a bound, raised by what each operation puts in; it passes the\n * limit when the document does, or when the document started deeper.\n */\nclass Size implements Measured {\n  nodes = 0;\n  bytes = 0;\n  depth = 0;\n  /** What copies, and moves to a deeper place or onto the whole document, have carried. */\n  carriedNodes = 0;\n  carriedBytes = 0;\n\n  constructor(doc: unknown) {\n    this.reset(doc);\n  }\n\n  reset(doc: unknown): void {\n    const s = sizeOf(doc);\n    this.nodes = s.nodes;\n    this.bytes = s.bytes;\n    this.depth = s.depth;\n  }\n\n  /** `value` goes in `segments` levels below the top, under a new `key`. */\n  insert(value: unknown, segments: number, key?: string): Measured {\n    const s = sizeOf(value);\n    this.nodes += s.nodes;\n    this.bytes += s.bytes + (key === undefined ? 0 : utf8Length(key));\n    this.depth = Math.max(this.depth, segments + s.depth);\n    return s;\n  }\n\n  carry(s: Measured): void {\n    this.carriedNodes += s.nodes;\n    this.carriedBytes += s.bytes;\n  }\n\n  /** `value` comes out, with its `key`. */\n  take(value: unknown, key?: string): void {\n    const s = sizeOf(value);\n    this.nodes -= s.nodes;\n    this.bytes -= s.bytes + (key === undefined ? 0 : utf8Length(key));\n  }\n}\n\nexport function applyJsonPatch(doc: unknown, ops: JsonPatchOp[], limits: PatchLimits = {}): unknown {\n  const maxBytes = limits.maxStringBytes ?? DEFAULT_MAX_PATCHED_BYTES;\n  if (ops.length > MAX_PATCH_OPS) {\n    throw new PatchError(`Patch has too many operations (${ops.length} > ${MAX_PATCH_OPS})`);\n  }\n  let out: any = JSON.parse(JSON.stringify(doc));\n  const size = new Size(out);\n  for (const op of ops) {\n    out = applyOne(out, op, size);\n    if (size.depth > MAX_DOCUMENT_DEPTH) size.depth = sizeOf(out).depth;\n    if (size.nodes > MAX_DOCUMENT_NODES) {\n      throw new PatchError(`Patched document exceeds the node limit (${MAX_DOCUMENT_NODES})`);\n    }\n    if (size.bytes > maxBytes) {\n      throw new PatchError(`Patched document exceeds the size limit (${maxBytes} bytes of strings and keys)`);\n    }\n    if (size.depth > MAX_DOCUMENT_DEPTH) {\n      throw new PatchError(`Patched document nests deeper than ${MAX_DOCUMENT_DEPTH} levels`);\n    }\n    if (size.carriedNodes > MAX_CARRIED_TIMES * MAX_DOCUMENT_NODES || size.carriedBytes > MAX_CARRIED_TIMES * maxBytes) {\n      throw new PatchError(`Patch copies or moves more than its limit (${MAX_CARRIED_TIMES * MAX_DOCUMENT_NODES} values or ${MAX_CARRIED_TIMES * maxBytes} bytes of strings and keys)`);\n    }\n  }\n  return out;\n}\n\n// ============================================================\n//   diff: produce a patch that transforms `from` into `to`\n// ============================================================\n\n/**\n * Compute an RFC 6902 patch that, when applied to `from`, produces\n * `to`. Walks objects key-by-key; arrays use a shallow whole-array\n * replace if any element differs. Sufficient for the playground's\n * draft-edit use case where drafts are small JSON objects.\n */\nexport function diffJsonPatch(from: unknown, to: unknown, basePath = \"\"): JsonPatchOp[] {\n  const ops: JsonPatchOp[] = [];\n\n  if (typeof from !== typeof to || Array.isArray(from) !== Array.isArray(to)) {\n    ops.push({ op: \"replace\", path: basePath || \"/\", value: to });\n    return ops;\n  }\n\n  if (from === null || to === null || typeof from !== \"object\") {\n    if (from !== to) {\n      ops.push({ op: \"replace\", path: basePath || \"/\", value: to });\n    }\n    return ops;\n  }\n\n  if (Array.isArray(from) && Array.isArray(to)) {\n    if (JSON.stringify(from) !== JSON.stringify(to)) {\n      ops.push({ op: \"replace\", path: basePath || \"/\", value: to });\n    }\n    return ops;\n  }\n\n  const fromObj = from as Record<string, unknown>;\n  const toObj = to as Record<string, unknown>;\n  const allKeys = new Set([...Object.keys(fromObj), ...Object.keys(toObj)]);\n\n  for (const key of allKeys) {\n    const escaped = key.replace(/~/g, \"~0\").replace(/\\//g, \"~1\");\n    const path = `${basePath}/${escaped}`;\n    if (!(key in fromObj)) {\n      ops.push({ op: \"add\", path, value: toObj[key] });\n    } else if (!(key in toObj)) {\n      ops.push({ op: \"remove\", path });\n    } else {\n      ops.push(...diffJsonPatch(fromObj[key], toObj[key], path));\n    }\n  }\n\n  return ops;\n}\n"],"mappings":";AAiBO,IAAM,aAAN,cAAyB,MAAM;AAAC;AAGvC,IAAM,iBAAiB,oBAAI,IAAI,CAAC,aAAa,eAAe,WAAW,CAAC;AAMxE,IAAM,iBAAiB;AAMvB,SAAS,SAAS,OAAwB;AACxC,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAW,aAAO;AAAA,IACvB;AAAgB,aAAO;AAAA,EACzB;AACF;AAEA,SAAS,WAAW,KAAqB;AACvC,MAAI,CAAC,eAAe,KAAK,GAAG,EAAG,OAAM,IAAI,WAAW,2BAA2B,KAAK,UAAU,GAAG,CAAC,EAAE;AACpG,SAAO,OAAO,GAAG;AACnB;AAEA,SAAS,SAAS,OAAuB;AACvC,SAAO,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG;AACrD;AAEA,SAAS,UAAU,MAAwB;AACzC,MAAI,SAAS,GAAI,QAAO,CAAC;AACzB,MAAI,CAAC,KAAK,WAAW,GAAG,GAAG;AACzB,UAAM,IAAI,WAAW,qCAAqC,KAAK,UAAU,IAAI,CAAC,EAAE;AAAA,EAClF;AACA,QAAM,WAAW,KAAK,MAAM,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,QAAQ;AACtD,aAAW,OAAO,UAAU;AAC1B,QAAI,eAAe,IAAI,GAAG,GAAG;AAC3B,YAAM,IAAI,WAAW,gCAAgC,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,IAC5E;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,SAAS,KAAU,OAAyC;AACnE,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,WAAW,0CAA0C;AAAA,EACjE;AACA,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;AACzC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,YAAM,MAAM,WAAW,IAAI;AAC3B,UAAI,OAAO,OAAO,QAAQ;AACxB,cAAM,IAAI,WAAW,0BAA0B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;AAAA,MAClF;AACA,eAAS,OAAO,GAAG;AAAA,IACrB,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,UAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,IAAI,GAAG;AACvD,cAAM,IAAI,WAAW,oBAAoB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;AAAA,MAC5E;AACA,eAAS,OAAO,IAAI;AAAA,IACtB,OAAO;AACL,YAAM,IAAI,WAAW,wBAAwB,SAAS,MAAM,CAAC,OAAO,KAAK,UAAU,IAAI,CAAC,EAAE;AAAA,IAC5F;AAAA,EACF;AACA,QAAM,OAAO,MAAM,MAAM,SAAS,CAAC;AACnC,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,QAAI,SAAS,IAAK,QAAO,CAAC,QAAQ,GAAG;AACrC,WAAO,CAAC,QAAQ,WAAW,IAAI,CAAC;AAAA,EAClC;AACA,SAAO,CAAC,QAAQ,IAAI;AACtB;AAEA,SAAS,MAAM,KAAU,MAAmB;AAC1C,QAAM,QAAQ,UAAU,IAAI;AAC5B,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,QAAI,QAAQ,IAAK,OAAM,IAAI,WAAW,2BAA2B;AACjE,UAAM,MAAM;AACZ,QAAI,MAAM,KAAK,OAAO,OAAO,OAAQ,OAAM,IAAI,WAAW,uBAAuB,IAAI,EAAE;AACvF,WAAO,OAAO,GAAG;AAAA,EACnB;AACA,MACE,WAAW,QACX,OAAO,WAAW,YAClB,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GACjD;AACA,UAAM,IAAI,WAAW,mBAAmB,IAAI,EAAE;AAAA,EAChD;AACA,SAAO,OAAO,GAAa;AAC7B;AAEA,SAAS,MAAS,GAAS;AACzB,SAAO,MAAM,SAAY,IAAK,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC;AAC5D;AAEA,SAAS,UAAU,GAAQ,GAAiB;AAC1C,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM,QAAQ,MAAM,KAAM,QAAO,MAAM;AAC3C,MAAI,OAAO,MAAM,OAAO,EAAG,QAAO;AAClC,MAAI,OAAO,MAAM,SAAU,QAAO,MAAM;AACxC,QAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,MAAI,SAAS,MAAM,QAAQ,CAAC,EAAG,QAAO;AACtC,MAAI,MAAM;AACR,QAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,aAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AACtE,WAAO;AAAA,EACT;AACA,QAAM,KAAK,OAAO,KAAK,CAAC;AACxB,QAAM,KAAK,OAAO,KAAK,CAAC;AACxB,MAAI,GAAG,WAAW,GAAG,OAAQ,QAAO;AACpC,aAAW,KAAK,IAAI;AAClB,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG,CAAC,EAAG,QAAO;AACxD,QAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAUA,SAAS,MAAM,KAAU,MAAc,OAAgB,MACxC,SAAS,OAAO,WAAyB;AACtD,QAAM,QAAQ,UAAU,IAAI;AAC5B,MAAI,MAAM,WAAW,GAAG;AACtB,QAAI,MAAM;AACR,WAAK,MAAM,KAAK;AAChB,UAAI,UAAU,cAAc,OAAW,MAAK,MAAM,IAAI;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AACA,QAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,MAAI;AACJ,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,QAAI,QAAQ,KAAK;AACf,aAAO,KAAK,KAAK;AAAA,IACnB,OAAO;AACL,YAAM,MAAM;AACZ,UAAI,MAAM,KAAK,MAAM,OAAO,QAAQ;AAClC,cAAM,IAAI,WAAW,+BAA+B,IAAI,EAAE;AAAA,MAC5D;AACA,aAAO,OAAO,KAAK,GAAG,KAAK;AAAA,IAC7B;AAAA,EACF,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,QAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,EAAG,OAAM,KAAK,OAAO,GAAa,CAAC;AAAA,QAClF,UAAS;AACd,WAAO,GAAa,IAAI;AAAA,EAC1B,OAAO;AACL,UAAM,IAAI,WAAW,mBAAmB,SAAS,MAAM,CAAC,EAAE;AAAA,EAC5D;AACA,MAAI,MAAM;AACR,QAAI,cAAc,QAAW;AAC3B,YAAM,WAAW,KAAK,OAAO,OAAO,MAAM,QAAQ,MAAM;AACxD,UAAI,OAAQ,MAAK,MAAM,QAAQ;AAAA,IACjC,OAAO;AACL,UAAI,WAAW,OAAW,MAAK,SAAS,WAAW,MAAM;AACzD,UAAI,MAAM,SAAS,WAAW;AAE5B,cAAM,QAAQ,OAAO,KAAK;AAC1B,aAAK,QAAQ,KAAK,IAAI,KAAK,OAAO,MAAM,SAAS,MAAM,KAAK;AAC5D,aAAK,MAAM,KAAK;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGA,SAAS,SAAS,KAAU,MAAc,MAAwB,QAAQ,OAAY;AACpF,QAAM,QAAQ,UAAU,IAAI;AAC5B,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,WAAW,qBAAqB;AAClE,QAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,MAAI,MAAM,QAAQ,MAAM,GAAG;AAIzB,UAAM,MAAM,QAAQ,MAAM,KAAM;AAChC,QAAI,MAAM,KAAK,OAAO,OAAO,QAAQ;AACnC,YAAM,IAAI,WAAW,kCAAkC,IAAI,EAAE;AAAA,IAC/D;AACA,QAAI,QAAQ,CAAC,MAAO,MAAK,KAAK,OAAO,GAAG,CAAC;AACzC,WAAO,OAAO,KAAK,CAAC;AAAA,EACtB,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,QAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACtD,YAAM,IAAI,WAAW,8BAA8B,IAAI,EAAE;AAAA,IAC3D;AACA,QAAI,MAAM;AACR,UAAI,MAAO,MAAK,SAAS,WAAW,GAAa;AAAA,UAC5C,MAAK,KAAK,OAAO,GAAa,GAAG,GAAa;AAAA,IACrD;AACA,WAAO,OAAO,GAAa;AAAA,EAC7B,OAAO;AACL,UAAM,IAAI,WAAW,sBAAsB,SAAS,MAAM,CAAC,EAAE;AAAA,EAC/D;AACA,SAAO;AACT;AAEA,SAAS,SAAS,KAAU,IAAiB,MAAkB;AAC7D,QAAM,OAAO,GAAG;AAChB,QAAM,OAAO,GAAG,QAAQ;AAExB,MAAI,SAAS,OAAO;AAClB,QAAI,EAAE,WAAW,IAAK,OAAM,IAAI,WAAW,wBAAwB;AAGnE,WAAO,MAAM,KAAK,MAAM,MAAM,GAAG,KAAK,GAAG,IAAI;AAAA,EAC/C;AAEA,MAAI,SAAS,WAAW;AACtB,QAAI,EAAE,WAAW,IAAK,OAAM,IAAI,WAAW,4BAA4B;AACvE,UAAM,QAAQ,UAAU,IAAI;AAC5B,UAAM,QAAQ,MAAM,GAAG,KAAK;AAC5B,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,MAAM,KAAK;AACjB,aAAO;AAAA,IACT;AACA,UAAM,CAAC,QAAQ,GAAG,IAAI,SAAS,KAAK,KAAK;AACzC,QAAI,MAAM,QAAQ,MAAM,GAAG;AAIzB,YAAM,MAAM,QAAQ,MAAM,KAAM;AAChC,UAAI,MAAM,KAAK,OAAO,OAAO,QAAQ;AACnC,cAAM,IAAI,WAAW,+BAA+B,IAAI,EAAE;AAAA,MAC5D;AACA,YAAM,KAAK,OAAO,GAAG,CAAC;AACtB,aAAO,GAAG,IAAI;AAAA,IAChB,WAAW,WAAW,QAAQ,OAAO,WAAW,UAAU;AACxD,UAAI,CAAC,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACtD,cAAM,IAAI,WAAW,+BAA+B,IAAI,EAAE;AAAA,MAC5D;AACA,YAAM,KAAK,OAAO,GAAa,CAAC;AAChC,aAAO,GAAa,IAAI;AAAA,IAC1B,OAAO;AACL,YAAM,IAAI,WAAW,qBAAqB,SAAS,MAAM,CAAC,EAAE;AAAA,IAC9D;AACA,UAAM,OAAO,OAAO,MAAM,MAAM;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,UAAU;AACrB,WAAO,SAAS,KAAK,MAAM,IAAI;AAAA,EACjC;AAEA,MAAI,SAAS,QAAQ;AACnB,UAAM,MAAM,GAAG;AACf,QAAI,QAAQ,OAAW,OAAM,IAAI,WAAW,wBAAwB;AACpE,WAAO,MAAM,KAAK,MAAM,MAAM,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,IAAI;AAAA,EAC5D;AAEA,MAAI,SAAS,QAAQ;AACnB,UAAM,MAAM,GAAG;AACf,QAAI,QAAQ,OAAW,OAAM,IAAI,WAAW,wBAAwB;AAEpE,QAAI,KAAK,WAAW,MAAM,GAAG,GAAG;AAC9B,YAAM,IAAI,WAAW,mDAAmD;AAAA,IAC1E;AAEA,UAAM,QAAQ,MAAM,KAAK,GAAG;AAC5B,UAAM,SAAS,KAAK,KAAK,MAAM,IAAI;AACnC,WAAO,MAAM,KAAK,MAAM,OAAO,MAAM,OAAO,UAAU,GAAG,EAAE,MAAM;AAAA,EACnE;AAEA,MAAI,SAAS,QAAQ;AACnB,QAAI,EAAE,WAAW,IAAK,OAAM,IAAI,WAAW,yBAAyB;AACpE,UAAM,SAAS,MAAM,KAAK,IAAI;AAC9B,QAAI,CAAC,UAAU,QAAQ,GAAG,KAAK,EAAG,OAAM,IAAI,WAAW,oBAAoB,IAAI,EAAE;AACjF,WAAO;AAAA,EACT;AAEA,QAAM,IAAI,WAAW,mBAAmB,KAAK,UAAU,IAAI,CAAC,EAAE;AAChE;AAEA,IAAM,gBAAgB;AACtB,IAAM,qBAAqB;AAQ3B,IAAM,qBAAqB;AAS3B,IAAM,oBAAoB;AAUnB,IAAM,4BAA4B;AAezC,SAAS,WAAW,GAAmB;AACrC,QAAM,SAAU,WAAoC;AACpD,MAAI,OAAO,WAAW,YAAY;AAChC,WAAQ,OAA0E,WAAW,GAAG,MAAM;AAAA,EACxG;AACA,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,IAAI,EAAE,WAAW,CAAC;AACxB,QAAI,IAAI,IAAM,MAAK;AAAA,aACV,IAAI,KAAO,MAAK;AAAA,aAChB,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,QAAQ;AACvD,YAAM,IAAI,EAAE,WAAW,IAAI,CAAC;AAC5B,UAAI,KAAK,SAAU,KAAK,OAAQ;AAAE,aAAK;AAAG;AAAA,MAAK,MAAO,MAAK;AAAA,IAC7D,MAAO,MAAK;AAAA,EACd;AACA,SAAO;AACT;AASA,SAAS,OAAO,OAA0B;AACxC,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,WAAO,EAAE,OAAO,GAAG,OAAO,OAAO,UAAU,WAAW,WAAW,KAAK,IAAI,GAAG,OAAO,EAAE;AAAA,EACxF;AACA,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,QAAM,SAAmB,CAAC,KAAK;AAC/B,QAAM,SAAmB,CAAC,CAAC;AAG3B,QAAM,QAAQ,CAAC,GAAY,UAAwB;AACjD,QAAI,MAAM,QAAQ,OAAO,MAAM,UAAU;AACvC,aAAO,KAAK,CAAC;AACb,aAAO,KAAK,KAAK;AACjB;AAAA,IACF;AACA,aAAS;AACT,QAAI,QAAQ,MAAO,SAAQ;AAC3B,QAAI,OAAO,MAAM,SAAU,UAAS,WAAW,CAAC;AAAA,EAClD;AACA,SAAO,OAAO,SAAS,GAAG;AACxB,UAAM,IAAI,OAAO,IAAI;AACrB,UAAM,QAAQ,OAAO,IAAI;AACzB,aAAS;AACT,QAAI,QAAQ,MAAO,SAAQ;AAC3B,QAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,iBAAW,KAAK,EAAG,OAAM,GAAG,QAAQ,CAAC;AAAA,IACvC,OAAO;AACL,YAAM,IAAI;AACV,iBAAW,KAAK,OAAO,KAAK,CAAC,GAAG;AAC9B,iBAAS,WAAW,CAAC;AACrB,cAAM,EAAE,CAAC,GAAG,QAAQ,CAAC;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,OAAO,OAAO,MAAM;AAC/B;AASA,IAAM,OAAN,MAA+B;AAAA,EAC7B,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA;AAAA,EAER,eAAe;AAAA,EACf,eAAe;AAAA,EAEf,YAAY,KAAc;AACxB,SAAK,MAAM,GAAG;AAAA,EAChB;AAAA,EAEA,MAAM,KAAoB;AACxB,UAAM,IAAI,OAAO,GAAG;AACpB,SAAK,QAAQ,EAAE;AACf,SAAK,QAAQ,EAAE;AACf,SAAK,QAAQ,EAAE;AAAA,EACjB;AAAA;AAAA,EAGA,OAAO,OAAgB,UAAkB,KAAwB;AAC/D,UAAM,IAAI,OAAO,KAAK;AACtB,SAAK,SAAS,EAAE;AAChB,SAAK,SAAS,EAAE,SAAS,QAAQ,SAAY,IAAI,WAAW,GAAG;AAC/D,SAAK,QAAQ,KAAK,IAAI,KAAK,OAAO,WAAW,EAAE,KAAK;AACpD,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,GAAmB;AACvB,SAAK,gBAAgB,EAAE;AACvB,SAAK,gBAAgB,EAAE;AAAA,EACzB;AAAA;AAAA,EAGA,KAAK,OAAgB,KAAoB;AACvC,UAAM,IAAI,OAAO,KAAK;AACtB,SAAK,SAAS,EAAE;AAChB,SAAK,SAAS,EAAE,SAAS,QAAQ,SAAY,IAAI,WAAW,GAAG;AAAA,EACjE;AACF;AAEO,SAAS,eAAe,KAAc,KAAoB,SAAsB,CAAC,GAAY;AAClG,QAAM,WAAW,OAAO,kBAAkB;AAC1C,MAAI,IAAI,SAAS,eAAe;AAC9B,UAAM,IAAI,WAAW,kCAAkC,IAAI,MAAM,MAAM,aAAa,GAAG;AAAA,EACzF;AACA,MAAI,MAAW,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC;AAC7C,QAAM,OAAO,IAAI,KAAK,GAAG;AACzB,aAAW,MAAM,KAAK;AACpB,UAAM,SAAS,KAAK,IAAI,IAAI;AAC5B,QAAI,KAAK,QAAQ,mBAAoB,MAAK,QAAQ,OAAO,GAAG,EAAE;AAC9D,QAAI,KAAK,QAAQ,oBAAoB;AACnC,YAAM,IAAI,WAAW,4CAA4C,kBAAkB,GAAG;AAAA,IACxF;AACA,QAAI,KAAK,QAAQ,UAAU;AACzB,YAAM,IAAI,WAAW,4CAA4C,QAAQ,6BAA6B;AAAA,IACxG;AACA,QAAI,KAAK,QAAQ,oBAAoB;AACnC,YAAM,IAAI,WAAW,sCAAsC,kBAAkB,SAAS;AAAA,IACxF;AACA,QAAI,KAAK,eAAe,oBAAoB,sBAAsB,KAAK,eAAe,oBAAoB,UAAU;AAClH,YAAM,IAAI,WAAW,8CAA8C,oBAAoB,kBAAkB,cAAc,oBAAoB,QAAQ,6BAA6B;AAAA,IAClL;AAAA,EACF;AACA,SAAO;AACT;AAYO,SAAS,cAAc,MAAe,IAAa,WAAW,IAAmB;AACtF,QAAM,MAAqB,CAAC;AAE5B,MAAI,OAAO,SAAS,OAAO,MAAM,MAAM,QAAQ,IAAI,MAAM,MAAM,QAAQ,EAAE,GAAG;AAC1E,QAAI,KAAK,EAAE,IAAI,WAAW,MAAM,YAAY,KAAK,OAAO,GAAG,CAAC;AAC5D,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,QAAQ,OAAO,QAAQ,OAAO,SAAS,UAAU;AAC5D,QAAI,SAAS,IAAI;AACf,UAAI,KAAK,EAAE,IAAI,WAAW,MAAM,YAAY,KAAK,OAAO,GAAG,CAAC;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC5C,QAAI,KAAK,UAAU,IAAI,MAAM,KAAK,UAAU,EAAE,GAAG;AAC/C,UAAI,KAAK,EAAE,IAAI,WAAW,MAAM,YAAY,KAAK,OAAO,GAAG,CAAC;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAEA,QAAM,UAAU;AAChB,QAAM,QAAQ;AACd,QAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,OAAO,GAAG,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC;AAExE,aAAW,OAAO,SAAS;AACzB,UAAM,UAAU,IAAI,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AAC3D,UAAM,OAAO,GAAG,QAAQ,IAAI,OAAO;AACnC,QAAI,EAAE,OAAO,UAAU;AACrB,UAAI,KAAK,EAAE,IAAI,OAAO,MAAM,OAAO,MAAM,GAAG,EAAE,CAAC;AAAA,IACjD,WAAW,EAAE,OAAO,QAAQ;AAC1B,UAAI,KAAK,EAAE,IAAI,UAAU,KAAK,CAAC;AAAA,IACjC,OAAO;AACL,UAAI,KAAK,GAAG,cAAc,QAAQ,GAAG,GAAG,MAAM,GAAG,GAAG,IAAI,CAAC;AAAA,IAC3D;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/storage/sqlite.cjs

@@ -34,7 +34,8 @@ var COLLECTIONS = [
   "deliberations",
   "handoffs",
   "snapshots",
-  "route_decisions"
+  "route_decisions",
+  "invitations"
 ];
 var IDEMPOTENCY_KEYS = "idempotency_keys";
 var StoreConflictError = class extends Error {
@@ -45,7 +46,7 @@ var StoreConflictError = class extends Error {
   base;
   constructor(workspace, held, base) {
     super(
-      `The store holds ${held} audit entries for workspace ${workspace} and this write expected ${base}, so nothing was written. Another coordinator may be writing to this workspace, the store may have been changed outside this coordinator, or this coordinator could not load the workspace when it started. Restart this coordinator to reload.`
+      `The store holds ${held} audit entries for workspace ${workspace} and this write expected ${base}, so nothing was written. Another coordinator may be writing to this workspace, or the store may have been changed outside this coordinator. A coordinator reloads the workspace and answers the call as failed, and the call may be sent again.`
     );
     this.name = "StoreConflictError";
     this.workspace = workspace;
@@ -122,6 +123,54 @@ function assembleSnapshot(meta, entries, objects) {
 
 // src/storage/sqlite.ts
 var import_meta = {};
+function fromNodeSqlite(db) {
+  const transaction = (fn) => {
+    const run = (begin) => (...args) => {
+      db.exec(begin);
+      try {
+        const result = fn(...args);
+        db.exec("COMMIT");
+        return result;
+      } catch (err) {
+        db.exec("ROLLBACK");
+        throw err;
+      }
+    };
+    return Object.assign(run("BEGIN"), { immediate: run("BEGIN IMMEDIATE") });
+  };
+  return {
+    exec: (sql) => db.exec(sql),
+    prepare: (sql) => db.prepare(sql),
+    pragma: (name, options) => {
+      const row = db.prepare(`PRAGMA ${name}`).get();
+      return options?.simple ? row ? Object.values(row)[0] : void 0 : row;
+    },
+    transaction,
+    close: () => db.close()
+  };
+}
+function openDatabase(path, driver) {
+  const failures = [];
+  const load = (name) => {
+    try {
+      return (0, import_node_module.createRequire)(typeof __filename === "string" ? __filename : import_meta.url)(name);
+    } catch (err) {
+      failures.push(`${name}: ${err instanceof Error ? err.message.split("\n")[0] : String(err)}`);
+      return void 0;
+    }
+  };
+  if (driver !== "node:sqlite") {
+    const Database = load("better-sqlite3");
+    if (Database) return new Database(path);
+  }
+  if (driver !== "better-sqlite3") {
+    const sqlite = load("node:sqlite");
+    if (sqlite) return fromNodeSqlite(new sqlite.DatabaseSync(path));
+  }
+  throw new Error(
+    `SqliteStore needs the \`better-sqlite3\` package, or Node 22.13 or later for node:sqlite. Install it with \`npm install better-sqlite3\` or use MemoryStore for non-persistent workloads (${failures.join("; ")})`
+  );
+}
 var SCHEMA = `
   CREATE TABLE IF NOT EXISTS chap_meta (
     workspace  TEXT PRIMARY KEY,
@@ -148,23 +197,15 @@ var LEGACY_VIEW = `CREATE VIEW IF NOT EXISTS ${LEGACY_TABLE} AS SELECT m.workspa
   "'$.audit', json((SELECT json_group_array(json(e.data)) FROM (SELECT data FROM chap_entries WHERE workspace = m.workspace ORDER BY seq) AS e))",
   ...[...COLLECTIONS, IDEMPOTENCY_KEYS].map((c) => `'$.${c}', json((SELECT json_group_object(id, json(data)) FROM chap_objects WHERE workspace = m.workspace AND collection = '${c}'))`)
 ].join(", ") + ") AS data, m.version AS version, m.updated_at AS updated_at FROM chap_meta AS m";
+var LEGACY_VIEW_RECORDED = LEGACY_VIEW.replace("CREATE VIEW IF NOT EXISTS ", "CREATE VIEW ");
 var SqliteStore = class {
   db;
   stmt;
   txWrite;
   txDelete;
   constructor(path, options = {}) {
-    let Database;
-    try {
-      const here = typeof __filename === "string" ? __filename : import_meta.url;
-      Database = (0, import_node_module.createRequire)(here)("better-sqlite3");
-    } catch (err) {
-      const detail = err instanceof Error ? `: ${err.message.split("\n")[0]}` : "";
-      throw new Error(
-        `SqliteStore requires the \`better-sqlite3\` package. Install it with \`npm install better-sqlite3\` or use MemoryStore for non-persistent workloads${detail}`
-      );
-    }
-    this.db = new Database(path);
+    this.db = openDatabase(path, options.driver);
+    this.db.pragma("busy_timeout = 5000");
     if (path !== ":memory:" && options.wal !== false) {
       this.db.pragma("journal_mode = WAL");
     }
@@ -188,7 +229,10 @@ var SqliteStore = class {
       dropObjects: prepare("DELETE FROM chap_objects WHERE workspace = ?"),
       metas: prepare("SELECT workspace, data, version, updated_at FROM chap_meta"),
       entries: prepare("SELECT workspace, seq, data FROM chap_entries ORDER BY workspace, seq"),
-      objects: prepare("SELECT workspace, collection, id, data FROM chap_objects ORDER BY rowid")
+      objects: prepare("SELECT workspace, collection, id, data FROM chap_objects ORDER BY rowid"),
+      metaOf: prepare("SELECT workspace, data, version, updated_at FROM chap_meta WHERE workspace = ?"),
+      entriesOf: prepare("SELECT workspace, seq, data FROM chap_entries WHERE workspace = ? ORDER BY seq"),
+      objectsOf: prepare("SELECT workspace, collection, id, data FROM chap_objects WHERE workspace = ? ORDER BY rowid")
     };
     this.txWrite = this.db.transaction((change) => this.write(change));
     this.txDelete = this.db.transaction((id) => this.drop(id));
@@ -230,6 +274,8 @@ var SqliteStore = class {
         }
         this.db.exec("DROP INDEX IF EXISTS idx_chap_workspaces_updated_at");
       }
+      const view = this.db.prepare("SELECT type, sql FROM sqlite_master WHERE name = ?").get(LEGACY_TABLE);
+      if (view?.type === "view" && view.sql !== LEGACY_VIEW_RECORDED) this.db.exec(`DROP VIEW ${LEGACY_TABLE}`);
       if (!this.stmt.hasName.get(LEGACY_TABLE)) this.db.exec(LEGACY_VIEW);
     }).immediate();
     for (const id of unreadable) {
@@ -263,12 +309,28 @@ var SqliteStore = class {
     this.stmt.dropObjects.run(id);
   }
   load() {
-    return this.db.transaction(() => this.readAll())();
+    return this.db.transaction(() => this.read(
+      this.stmt.metas.all(),
+      this.stmt.entries.all(),
+      this.stmt.objects.all()
+    ))();
+  }
+  loadOne(id) {
+    return this.db.transaction(() => this.read(
+      this.stmt.metaOf.all(id),
+      this.stmt.entriesOf.all(id),
+      this.stmt.objectsOf.all(id)
+    ))()[0];
+  }
+  version(id) {
+    if (!this.stmt.hasMeta.get(id)) return void 0;
+    const last = this.stmt.held.get(id)?.last;
+    return last === null || last === void 0 ? 0 : last + 1;
   }
-  readAll() {
+  read(metas, entryRows, objectRows) {
     const broken = /* @__PURE__ */ new Map();
     const entries = /* @__PURE__ */ new Map();
-    for (const r of this.stmt.entries.all()) {
+    for (const r of entryRows) {
       if (broken.has(r.workspace)) continue;
       let list = entries.get(r.workspace);
       if (!list) entries.set(r.workspace, list = []);
@@ -283,7 +345,7 @@ var SqliteStore = class {
       }
     }
     const objects = /* @__PURE__ */ new Map();
-    for (const r of this.stmt.objects.all()) {
+    for (const r of objectRows) {
       if (broken.has(r.workspace)) continue;
       let list = objects.get(r.workspace);
       if (!list) objects.set(r.workspace, list = []);
@@ -294,7 +356,7 @@ var SqliteStore = class {
       }
     }
     const out = [];
-    for (const r of this.stmt.metas.all()) {
+    for (const r of metas) {
       let meta;
       if (!broken.has(r.workspace)) {
         try {