@absolutejs/sync 0.13.0 → 0.14.0

package/dist/crdt/index.js

@@ -68,6 +68,203 @@ var __decorateElement = (array, flags, name, decorators, target, extra) => {
   return k || __decoratorMetadata(array, target), desc && __defProp(target, name, desc), p ? k ^ 4 ? extra : desc : target;
 };
 
+// src/crdt/orSet.ts
+var newTag = () => globalThis.crypto.randomUUID();
+var defaultEquals = (a, b) => Object.is(a, b);
+var orSet = {
+  create: () => ({ adds: [], removed: [] }),
+  add: (state, value, tag = newTag()) => ({
+    adds: [...state.adds, { value, tag }],
+    removed: state.removed
+  }),
+  remove: (state, value, equals = defaultEquals) => {
+    const tags = state.adds.filter((entry) => equals(entry.value, value)).map((entry) => entry.tag);
+    return {
+      adds: state.adds,
+      removed: [...new Set([...state.removed, ...tags])]
+    };
+  },
+  has: (state, value, equals = defaultEquals) => {
+    const removed = new Set(state.removed);
+    return state.adds.some((entry) => equals(entry.value, value) && !removed.has(entry.tag));
+  },
+  values: (state, equals = defaultEquals) => {
+    const removed = new Set(state.removed);
+    const out = [];
+    for (const entry of state.adds) {
+      if (!removed.has(entry.tag) && !out.some((value) => equals(value, entry.value))) {
+        out.push(entry.value);
+      }
+    }
+    return out;
+  },
+  merge: (a, b) => {
+    const byTag = new Map;
+    for (const entry of [...a.adds, ...b.adds]) {
+      byTag.set(entry.tag, entry);
+    }
+    return {
+      adds: [...byTag.values()],
+      removed: [...new Set([...a.removed, ...b.removed])]
+    };
+  }
+};
+// src/crdt/lwwMap.ts
+var pick = (a, b) => {
+  if (b.timestamp > a.timestamp) {
+    return b;
+  }
+  if (b.timestamp < a.timestamp) {
+    return a;
+  }
+  return b.replica > a.replica ? b : a;
+};
+var lwwMap = {
+  create: () => ({}),
+  set: (state, key, value, replica, timestamp = Date.now()) => ({
+    ...state,
+    [key]: { value, deleted: false, timestamp, replica }
+  }),
+  delete: (state, key, replica, timestamp = Date.now()) => ({
+    ...state,
+    [key]: { value: state[key]?.value, deleted: true, timestamp, replica }
+  }),
+  get: (state, key) => {
+    const entry = state[key];
+    return entry !== undefined && !entry.deleted ? entry.value : undefined;
+  },
+  has: (state, key) => {
+    const entry = state[key];
+    return entry !== undefined && !entry.deleted;
+  },
+  keys: (state) => Object.keys(state).filter((key) => !state[key]?.deleted),
+  entries: (state) => {
+    const out = [];
+    for (const [key, entry] of Object.entries(state)) {
+      if (!entry.deleted && entry.value !== undefined) {
+        out.push([key, entry.value]);
+      }
+    }
+    return out;
+  },
+  merge: (a, b) => {
+    const out = { ...a };
+    for (const [key, entry] of Object.entries(b)) {
+      const existing = out[key];
+      out[key] = existing === undefined ? entry : pick(existing, entry);
+    }
+    return out;
+  }
+};
+// src/crdt/list.ts
+var order = (a, b) => {
+  if (a.clock !== b.clock) {
+    return b.clock - a.clock;
+  }
+  if (a.replica === b.replica) {
+    return 0;
+  }
+  return a.replica > b.replica ? -1 : 1;
+};
+var linearize = (elements) => {
+  const present = new Set(elements.map((element) => element.id));
+  const children = new Map;
+  for (const element of elements) {
+    const anchor = element.after !== null && !present.has(element.after) ? null : element.after;
+    const list = children.get(anchor);
+    if (list === undefined) {
+      children.set(anchor, [element]);
+    } else {
+      list.push(element);
+    }
+  }
+  for (const list of children.values()) {
+    list.sort(order);
+  }
+  const ordered = [];
+  const stack = [...children.get(null) ?? []].reverse();
+  while (stack.length > 0) {
+    const element = stack.pop();
+    ordered.push(element);
+    const kids = children.get(element.id);
+    if (kids !== undefined) {
+      for (let index = kids.length - 1;index >= 0; index -= 1) {
+        stack.push(kids[index]);
+      }
+    }
+  }
+  return ordered;
+};
+var listOf = (state) => linearize(state.elements).filter((element) => !element.deleted).map((element) => element.value);
+var mergeListState = (a, b) => {
+  const byId = new Map;
+  for (const element of [...a.elements, ...b.elements]) {
+    const existing = byId.get(element.id);
+    byId.set(element.id, existing === undefined ? element : { ...existing, deleted: existing.deleted || element.deleted });
+  }
+  return { elements: [...byId.values()] };
+};
+var createList = (replica, initial) => {
+  const elements = new Map;
+  const pending = new Map;
+  let clock = 0;
+  if (initial !== undefined) {
+    for (const element of initial.elements) {
+      elements.set(element.id, element);
+      clock = Math.max(clock, element.clock);
+    }
+  }
+  const visible = () => linearize([...elements.values()]).filter((element) => !element.deleted);
+  return {
+    list: () => listOf({ elements: [...elements.values()] }),
+    insert: (index, items) => {
+      const seen = visible();
+      let after = index <= 0 ? null : seen[index - 1]?.id ?? null;
+      for (const value of items) {
+        clock += 1;
+        const element = {
+          id: `${replica}:${clock}`,
+          replica,
+          clock,
+          after,
+          value,
+          deleted: false
+        };
+        elements.set(element.id, element);
+        pending.set(element.id, element);
+        after = element.id;
+      }
+    },
+    delete: (index, count) => {
+      const seen = visible();
+      for (let offset = 0;offset < count; offset += 1) {
+        const target = seen[index + offset];
+        if (target !== undefined) {
+          const tombstoned = { ...target, deleted: true };
+          elements.set(target.id, tombstoned);
+          pending.set(target.id, tombstoned);
+        }
+      }
+    },
+    merge: (state) => {
+      for (const element of state.elements) {
+        const existing = elements.get(element.id);
+        elements.set(element.id, existing === undefined ? element : {
+          ...existing,
+          deleted: existing.deleted || element.deleted
+        });
+        clock = Math.max(clock, element.clock);
+      }
+    },
+    state: () => ({ elements: [...elements.values()] }),
+    takeDelta: () => {
+      const delta = { elements: [...pending.values()] };
+      pending.clear();
+      return delta;
+    }
+  };
+};
+
 // src/crdt/index.ts
 var sumValues = (counts) => Object.values(counts).reduce((total, value) => total + value, 0);
 var mergeMax = (a, b) => {
@@ -125,7 +322,7 @@ var compare = (a, b) => {
   }
   return a.replica > b.replica ? -1 : 1;
 };
-var linearize = (elements) => {
+var linearize2 = (elements) => {
   const present = new Set(elements.map((element) => element.id));
   const children = new Map;
   for (const element of elements) {
@@ -154,7 +351,7 @@ var linearize = (elements) => {
   }
   return ordered;
 };
-var textOf = (state) => linearize(state.elements).filter((element) => !element.deleted).map((element) => element.value).join("");
+var textOf = (state) => linearize2(state.elements).filter((element) => !element.deleted).map((element) => element.value).join("");
 var mergeTextState = (a, b) => {
   const byId = new Map;
   for (const element of [...a.elements, ...b.elements]) {
@@ -195,7 +392,7 @@ var createTextCrdt = (replica, initial) => {
       clock = Math.max(clock, element.clock);
     }
   }
-  const visible = () => linearize([...elements.values()]).filter((element) => !element.deleted);
+  const visible = () => linearize2([...elements.values()]).filter((element) => !element.deleted);
   const insert = (index, value) => {
     const seen = visible();
     let after = index <= 0 ? null : seen[index - 1]?.id ?? null;
@@ -281,12 +478,17 @@ export {
   tombstoneCount,
   textOf,
   rgaText,
+  orSet,
   mergeTextState,
+  mergeListState,
+  lwwMap,
   lww,
+  listOf,
   createTextCrdt,
+  createList,
   counter,
   compact
 };
 
-//# debugId=2171A288067B9EDE64756E2164756E21
+//# debugId=069846F8A56300A364756E2164756E21
 //# sourceMappingURL=index.js.map

package/dist/crdt/index.js.map

@@ -1,10 +1,13 @@
 {
   "version": 3,
-  "sources": ["../src/crdt/index.ts"],
+  "sources": ["../src/crdt/orSet.ts", "../src/crdt/lwwMap.ts", "../src/crdt/list.ts", "../src/crdt/index.ts"],
   "sourcesContent": [
-    "/**\n * Conflict-free replicated data types (CRDTs) for multiplayer/offline editing —\n * pure, dependency-free, and isomorphic (use the same code client and server).\n *\n * These are *state-based* CRDTs (CvRDTs): every `merge` is commutative,\n * associative, and idempotent, so replicas that exchange state in any order\n * converge to the same value. That fits the sync engine without engine changes:\n * store the CRDT state as a row field, have a mutation `merge` the incoming\n * state into the stored one (concurrent writes combine instead of clobbering),\n * and have each client merge the broadcast state into its local edits.\n */\n\nconst sumValues = (counts: Record<string, number>) =>\n\tObject.values(counts).reduce((total, value) => total + value, 0);\n\nconst mergeMax = (\n\ta: Record<string, number>,\n\tb: Record<string, number>\n): Record<string, number> => {\n\tconst merged: Record<string, number> = { ...a };\n\tfor (const [replica, value] of Object.entries(b)) {\n\t\tmerged[replica] = Math.max(merged[replica] ?? 0, value);\n\t}\n\treturn merged;\n};\n\n/* ─── PN-counter ─── */\n\n/** A counter that survives concurrent increments/decrements across replicas. */\nexport type CounterState = {\n\tincrements: Record<string, number>;\n\tdecrements: Record<string, number>;\n};\n\nexport const counter = {\n\tcreate: (): CounterState => ({ increments: {}, decrements: {} }),\n\t/** Current value: total increments minus total decrements. */\n\tvalue: (state: CounterState) =>\n\t\tsumValues(state.increments) - sumValues(state.decrements),\n\tincrement: (\n\t\tstate: CounterState,\n\t\treplica: string,\n\t\tby = 1\n\t): CounterState => ({\n\t\tincrements: {\n\t\t\t...state.increments,\n\t\t\t[replica]: (state.increments[replica] ?? 0) + by\n\t\t},\n\t\tdecrements: state.decrements\n\t}),\n\tdecrement: (\n\t\tstate: CounterState,\n\t\treplica: string,\n\t\tby = 1\n\t): CounterState => ({\n\t\tincrements: state.increments,\n\t\tdecrements: {\n\t\t\t...state.decrements,\n\t\t\t[replica]: (state.decrements[replica] ?? 0) + by\n\t\t}\n\t}),\n\t/** Merge by taking the max count seen per replica (monotonic). */\n\tmerge: (a: CounterState, b: CounterState): CounterState => ({\n\t\tincrements: mergeMax(a.increments, b.increments),\n\t\tdecrements: mergeMax(a.decrements, b.decrements)\n\t})\n};\n\n/* ─── LWW register ─── */\n\n/** A single value where the latest write wins (ties broken by replica id). */\nexport type LwwState<T> = { value: T; timestamp: number; replica: string };\n\nexport const lww = {\n\tcreate: <T>(\n\t\tvalue: T,\n\t\treplica: string,\n\t\ttimestamp = Date.now()\n\t): LwwState<T> => ({ value, timestamp, replica }),\n\tset: <T>(\n\t\tvalue: T,\n\t\treplica: string,\n\t\ttimestamp = Date.now()\n\t): LwwState<T> => ({\n\t\tvalue,\n\t\ttimestamp,\n\t\treplica\n\t}),\n\t/** Keep the entry with the higher timestamp (replica id breaks ties). */\n\tmerge: <T>(a: LwwState<T>, b: LwwState<T>): LwwState<T> => {\n\t\tif (b.timestamp > a.timestamp) {\n\t\t\treturn b;\n\t\t}\n\t\tif (b.timestamp < a.timestamp) {\n\t\t\treturn a;\n\t\t}\n\t\treturn b.replica > a.replica ? b : a;\n\t}\n};\n\n/* ─── Collaborative text ─── */\n\n/**\n * The contract a collaborative-text CRDT exposes, independent of the algorithm\n * behind it. Implemented first-party by the RGA below ({@link createTextCrdt})\n * and by third-party backends in the `sync-adapters` repo (e.g.\n * `@absolutejs/sync-yjs`). `State` is whatever that backend persists and\n * broadcasts — JSON ({@link TextState}) for the RGA, a base64 update for Yjs.\n */\nexport type CrdtText<State> = {\n\t/** The current visible text. */\n\ttext: () => string;\n\t/** Reconcile the local text to `next` (the backend computes the edit). */\n\tsetText: (next: string) => void;\n\t/** Merge another replica's state in (e.g. a broadcast from the server). */\n\tmerge: (state: State) => void;\n\t/** The full serializable state to persist/broadcast (for hydration). */\n\tstate: () => State;\n\t/**\n\t * The locally-authored changes since the last call (a delta-state), then clears\n\t * the buffer. A delta merges exactly like a full state (union), so a client can\n\t * upload just its new ops — O(edit) instead of O(doc) — while the server keeps\n\t * full state. Optional: backends without delta support fall back to `state()`.\n\t */\n\ttakeDelta?: () => State;\n};\n\n/**\n * The minimal server-side surface the engine needs to auto-merge a CRDT field on\n * write (see `engine.registerCrdt`): combine two states and produce an empty one.\n * Both the first-party {@link rgaText} and `@absolutejs/sync-yjs`'s `yjsText`\n * satisfy it, as does any {@link TextCrdtAdapter}.\n */\nexport type CrdtMergeable<State> = {\n\tempty: () => State;\n\tmerge: (a: State, b: State) => State;\n};\n\n/**\n * A pluggable collaborative-text backend. `create` mints a live doc for a\n * replica; `merge` combines two persisted states server-side (no live instance\n * needed — for the merge-on-write mutation); `empty`/`textOf` are conveniences.\n * Swap the first-party {@link rgaText} for an adapter to get a different engine\n * (e.g. Yjs) behind the exact same call sites.\n */\nexport type TextCrdtAdapter<State> = CrdtMergeable<State> & {\n\tcreate: (replica: string, initial?: State) => CrdtText<State>;\n\ttextOf: (state: State) => string;\n\t/** Optionally bound state growth (e.g. drop unreferenced tombstones). */\n\tcompact?: (state: State) => State;\n};\n\n/* ─── Collaborative text (RGA) — the first-party backend ─── */\n\n/** One inserted character in the replicated sequence (kept as a tombstone if deleted). */\nexport type TextElement = {\n\tid: string;\n\treplica: string;\n\tclock: number;\n\t/** Id of the element this was inserted after (`null` = start of document). */\n\tafter: string | null;\n\tvalue: string;\n\tdeleted: boolean;\n};\n\n/** Serializable state of a {@link TextCrdt} — safe to store as a row field. */\nexport type TextState = { elements: TextElement[] };\n\n// Sibling order (same `after`): higher clock first, then higher replica id.\nconst compare = (a: TextElement, b: TextElement) => {\n\tif (a.clock !== b.clock) {\n\t\treturn b.clock - a.clock;\n\t}\n\tif (a.replica === b.replica) {\n\t\treturn 0;\n\t}\n\treturn a.replica > b.replica ? -1 : 1;\n};\n\n/** Flatten the sequence into document order (an iterative RGA pre-order walk). */\nconst linearize = (elements: TextElement[]): TextElement[] => {\n\tconst present = new Set(elements.map((element) => element.id));\n\tconst children = new Map<string | null, TextElement[]>();\n\tfor (const element of elements) {\n\t\t// An element whose anchor was compacted/GC'd away (or never seen) is an\n\t\t// orphan — re-root it deterministically instead of dropping its content.\n\t\tconst anchor =\n\t\t\telement.after !== null && !present.has(element.after)\n\t\t\t\t? null\n\t\t\t\t: element.after;\n\t\tconst list = children.get(anchor);\n\t\tif (list === undefined) {\n\t\t\tchildren.set(anchor, [element]);\n\t\t} else {\n\t\t\tlist.push(element);\n\t\t}\n\t}\n\tfor (const list of children.values()) {\n\t\tlist.sort(compare);\n\t}\n\tconst ordered: TextElement[] = [];\n\tconst stack = [...(children.get(null) ?? [])].reverse();\n\twhile (stack.length > 0) {\n\t\tconst element = stack.pop()!;\n\t\tordered.push(element);\n\t\tconst kids = children.get(element.id);\n\t\tif (kids !== undefined) {\n\t\t\tfor (let index = kids.length - 1; index >= 0; index -= 1) {\n\t\t\t\tstack.push(kids[index]!);\n\t\t\t}\n\t\t}\n\t}\n\treturn ordered;\n};\n\n/** The visible string of a text-CRDT state. Pure — use it server-side too. */\nexport const textOf = (state: TextState): string =>\n\tlinearize(state.elements)\n\t\t.filter((element) => !element.deleted)\n\t\t.map((element) => element.value)\n\t\t.join('');\n\n/** Merge two text-CRDT states (commutative/idempotent). Pure — for server mutations. */\nexport const mergeTextState = (a: TextState, b: TextState): TextState => {\n\tconst byId = new Map<string, TextElement>();\n\tfor (const element of [...a.elements, ...b.elements]) {\n\t\tconst existing = byId.get(element.id);\n\t\tbyId.set(\n\t\t\telement.id,\n\t\t\texisting === undefined\n\t\t\t\t? element\n\t\t\t\t: { ...existing, deleted: existing.deleted || element.deleted }\n\t\t);\n\t}\n\treturn { elements: [...byId.values()] };\n};\n\n/** How many tombstones (deleted-but-retained elements) a state carries. Use it\n * to decide when to {@link compact} (e.g. a server-side threshold). */\nexport const tombstoneCount = (state: TextState): number =>\n\tstate.elements.reduce(\n\t\t(total, element) => (element.deleted ? total + 1 : total),\n\t\t0\n\t);\n\n/**\n * Drop tombstones that no remaining element anchors to (`after`), bounding state\n * growth from deletions — the visible text is unchanged. Pure.\n *\n * Future inserts only ever anchor to *visible* elements, so a tombstone nothing\n * currently references will never be referenced again; removing it is safe for\n * the canonical (server-held) state. Run it server-side on the stored state\n * (e.g. once `tombstoneCount` crosses a threshold); clients adopt the compacted\n * state on the next broadcast. {@link textOf}/{@link mergeTextState} and the\n * linearizer tolerate a stale client that briefly references a compacted\n * tombstone (its insert is re-rooted deterministically, not lost).\n */\nexport const compact = (state: TextState): TextState => {\n\tconst byId = new Map(\n\t\tstate.elements.map((element) => [element.id, element])\n\t);\n\t// Keep a tombstone only if it lies on the `after`-chain from a live element\n\t// (so positions are preserved); a deleted run that nothing live anchors\n\t// through is dropped. Walk each live element's chain of tombstone anchors.\n\tconst keep = new Set<string>();\n\tfor (const element of state.elements) {\n\t\tif (element.deleted) {\n\t\t\tcontinue;\n\t\t}\n\t\tlet anchor = element.after;\n\t\twhile (anchor !== null && !keep.has(anchor)) {\n\t\t\tconst target = byId.get(anchor);\n\t\t\tif (target === undefined || !target.deleted) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tkeep.add(anchor);\n\t\t\tanchor = target.after;\n\t\t}\n\t}\n\treturn {\n\t\telements: state.elements.filter(\n\t\t\t(element) => !element.deleted || keep.has(element.id)\n\t\t)\n\t};\n};\n\n/** The RGA text CRDT — {@link CrdtText} plus direct positional edits. */\nexport type TextCrdt = CrdtText<TextState> & {\n\t/** Insert `value` at visible `index`. */\n\tinsert: (index: number, value: string) => void;\n\t/** Tombstone `count` visible characters from `index`. */\n\tdelete: (index: number, count: number) => void;\n\t/** Locally-authored changes since the last call, then clears the buffer. */\n\ttakeDelta: () => TextState;\n};\n\n/**\n * A collaborative text buffer backed by an RGA sequence CRDT. Concurrent inserts\n * and deletes from different replicas merge without conflict and converge. Drive\n * it from an input via {@link TextCrdt.setText}; persist/broadcast\n * {@link TextCrdt.state}; apply remote state via {@link TextCrdt.merge}.\n */\nexport const createTextCrdt = (\n\treplica: string,\n\tinitial?: TextState\n): TextCrdt => {\n\tconst elements = new Map<string, TextElement>();\n\t// Elements this replica created or tombstoned since the last takeDelta — the\n\t// delta to broadcast. Local edits add here; `merge` (remote) deliberately\n\t// does not, so a client only ever re-broadcasts its own ops.\n\tconst pending = new Map<string, TextElement>();\n\tlet clock = 0;\n\tif (initial !== undefined) {\n\t\tfor (const element of initial.elements) {\n\t\t\telements.set(element.id, element);\n\t\t\tclock = Math.max(clock, element.clock);\n\t\t}\n\t}\n\n\tconst visible = () =>\n\t\tlinearize([...elements.values()]).filter((element) => !element.deleted);\n\n\tconst insert = (index: number, value: string) => {\n\t\tconst seen = visible();\n\t\tlet after = index <= 0 ? null : (seen[index - 1]?.id ?? null);\n\t\tfor (const char of [...value]) {\n\t\t\tclock += 1;\n\t\t\tconst element: TextElement = {\n\t\t\t\tid: `${replica}:${clock}`,\n\t\t\t\treplica,\n\t\t\t\tclock,\n\t\t\t\tafter,\n\t\t\t\tvalue: char,\n\t\t\t\tdeleted: false\n\t\t\t};\n\t\t\telements.set(element.id, element);\n\t\t\tpending.set(element.id, element);\n\t\t\tafter = element.id;\n\t\t}\n\t};\n\n\tconst remove = (index: number, count: number) => {\n\t\tconst seen = visible();\n\t\tfor (let offset = 0; offset < count; offset += 1) {\n\t\t\tconst target = seen[index + offset];\n\t\t\tif (target !== undefined) {\n\t\t\t\tconst tombstoned = { ...target, deleted: true };\n\t\t\t\telements.set(target.id, tombstoned);\n\t\t\t\tpending.set(target.id, tombstoned);\n\t\t\t}\n\t\t}\n\t};\n\n\treturn {\n\t\ttext: () => textOf({ elements: [...elements.values()] }),\n\t\tinsert,\n\t\tdelete: remove,\n\t\tmerge: (state) => {\n\t\t\tfor (const element of state.elements) {\n\t\t\t\tconst existing = elements.get(element.id);\n\t\t\t\telements.set(\n\t\t\t\t\telement.id,\n\t\t\t\t\texisting === undefined\n\t\t\t\t\t\t? element\n\t\t\t\t\t\t: {\n\t\t\t\t\t\t\t\t...existing,\n\t\t\t\t\t\t\t\tdeleted: existing.deleted || element.deleted\n\t\t\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t\tclock = Math.max(clock, element.clock);\n\t\t\t}\n\t\t},\n\t\t// Reconcile to `next` by editing only the changed middle: keep the common\n\t\t// prefix/suffix, delete the old middle, insert the new — so two clients\n\t\t// typing in different places merge instead of overwriting.\n\t\tsetText: (next) => {\n\t\t\tconst current = textOf({ elements: [...elements.values()] });\n\t\t\tif (current === next) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet prefix = 0;\n\t\t\tconst maxPrefix = Math.min(current.length, next.length);\n\t\t\twhile (prefix < maxPrefix && current[prefix] === next[prefix]) {\n\t\t\t\tprefix += 1;\n\t\t\t}\n\t\t\tlet suffix = 0;\n\t\t\twhile (\n\t\t\t\tsuffix < maxPrefix - prefix &&\n\t\t\t\tcurrent[current.length - 1 - suffix] ===\n\t\t\t\t\tnext[next.length - 1 - suffix]\n\t\t\t) {\n\t\t\t\tsuffix += 1;\n\t\t\t}\n\t\t\tconst removed = current.length - prefix - suffix;\n\t\t\tif (removed > 0) {\n\t\t\t\tremove(prefix, removed);\n\t\t\t}\n\t\t\tconst inserted = next.slice(prefix, next.length - suffix);\n\t\t\tif (inserted.length > 0) {\n\t\t\t\tinsert(prefix, inserted);\n\t\t\t}\n\t\t},\n\t\tstate: () => ({ elements: [...elements.values()] }),\n\t\ttakeDelta: () => {\n\t\t\tconst delta = { elements: [...pending.values()] };\n\t\t\tpending.clear();\n\n\t\t\treturn delta;\n\t\t}\n\t};\n};\n\n/**\n * The first-party collaborative-text backend (the RGA above) packaged as a\n * {@link TextCrdtAdapter}. Zero dependencies. Use it directly, or swap in an\n * adapter from `sync-adapters` (e.g. `@absolutejs/sync-yjs`) for the same shape.\n */\nexport const rgaText: TextCrdtAdapter<TextState> = {\n\tcompact,\n\tcreate: createTextCrdt,\n\tempty: () => ({ elements: [] }),\n\tmerge: mergeTextState,\n\ttextOf\n};\n"
+    "/**\n * An observed-remove set (OR-Set) — a CRDT set where concurrent add/remove of an\n * element resolves **add-wins**: each `add` tags the element with a unique tag,\n * and `remove` only retracts the tags it has observed, so a concurrent add (a new\n * tag) survives. State-based: `merge` is union of tags minus removed tags.\n */\n\nconst newTag = (): string => globalThis.crypto.randomUUID();\nconst defaultEquals = <T>(a: T, b: T): boolean => Object.is(a, b);\n\nexport type OrSetState<T> = {\n\t/** Each add: the value plus the unique tag that observed it. */\n\tadds: { value: T; tag: string }[];\n\t/** Tags retracted by `remove`. */\n\tremoved: string[];\n};\n\nexport const orSet = {\n\tcreate: <T>(): OrSetState<T> => ({ adds: [], removed: [] }),\n\n\tadd: <T>(\n\t\tstate: OrSetState<T>,\n\t\tvalue: T,\n\t\ttag = newTag()\n\t): OrSetState<T> => ({\n\t\tadds: [...state.adds, { value, tag }],\n\t\tremoved: state.removed\n\t}),\n\n\t/** Retract every tag currently observed for `value` (add-wins on re-add). */\n\tremove: <T>(\n\t\tstate: OrSetState<T>,\n\t\tvalue: T,\n\t\tequals: (a: T, b: T) => boolean = defaultEquals\n\t): OrSetState<T> => {\n\t\tconst tags = state.adds\n\t\t\t.filter((entry) => equals(entry.value, value))\n\t\t\t.map((entry) => entry.tag);\n\n\t\treturn {\n\t\t\tadds: state.adds,\n\t\t\tremoved: [...new Set([...state.removed, ...tags])]\n\t\t};\n\t},\n\n\thas: <T>(\n\t\tstate: OrSetState<T>,\n\t\tvalue: T,\n\t\tequals: (a: T, b: T) => boolean = defaultEquals\n\t): boolean => {\n\t\tconst removed = new Set(state.removed);\n\n\t\treturn state.adds.some(\n\t\t\t(entry) => equals(entry.value, value) && !removed.has(entry.tag)\n\t\t);\n\t},\n\n\t/** The live, de-duplicated members. */\n\tvalues: <T>(\n\t\tstate: OrSetState<T>,\n\t\tequals: (a: T, b: T) => boolean = defaultEquals\n\t): T[] => {\n\t\tconst removed = new Set(state.removed);\n\t\tconst out: T[] = [];\n\t\tfor (const entry of state.adds) {\n\t\t\tif (\n\t\t\t\t!removed.has(entry.tag) &&\n\t\t\t\t!out.some((value) => equals(value, entry.value))\n\t\t\t) {\n\t\t\t\tout.push(entry.value);\n\t\t\t}\n\t\t}\n\n\t\treturn out;\n\t},\n\n\t/** Union the observed tags and the removed tags (commutative/idempotent). */\n\tmerge: <T>(a: OrSetState<T>, b: OrSetState<T>): OrSetState<T> => {\n\t\tconst byTag = new Map<string, { value: T; tag: string }>();\n\t\tfor (const entry of [...a.adds, ...b.adds]) {\n\t\t\tbyTag.set(entry.tag, entry);\n\t\t}\n\n\t\treturn {\n\t\t\tadds: [...byTag.values()],\n\t\t\tremoved: [...new Set([...a.removed, ...b.removed])]\n\t\t};\n\t}\n};\n",
+    "/**\n * A last-write-wins map (LWW-Map) — a CRDT key→value map. Each key is an\n * independent LWW register: the write (set or delete) with the highest timestamp\n * wins, ties broken by replica id. `delete` is a tombstone so it can lose to a\n * later concurrent `set`. State-based: `merge` is per-key LWW.\n */\n\nexport type LwwMapEntry<V> = {\n\tvalue?: V;\n\tdeleted: boolean;\n\ttimestamp: number;\n\treplica: string;\n};\n\nexport type LwwMapState<V> = Record<string, LwwMapEntry<V>>;\n\nconst pick = <V>(a: LwwMapEntry<V>, b: LwwMapEntry<V>): LwwMapEntry<V> => {\n\tif (b.timestamp > a.timestamp) {\n\t\treturn b;\n\t}\n\tif (b.timestamp < a.timestamp) {\n\t\treturn a;\n\t}\n\treturn b.replica > a.replica ? b : a;\n};\n\nexport const lwwMap = {\n\tcreate: <V>(): LwwMapState<V> => ({}),\n\n\tset: <V>(\n\t\tstate: LwwMapState<V>,\n\t\tkey: string,\n\t\tvalue: V,\n\t\treplica: string,\n\t\ttimestamp = Date.now()\n\t): LwwMapState<V> => ({\n\t\t...state,\n\t\t[key]: { value, deleted: false, timestamp, replica }\n\t}),\n\n\tdelete: <V>(\n\t\tstate: LwwMapState<V>,\n\t\tkey: string,\n\t\treplica: string,\n\t\ttimestamp = Date.now()\n\t): LwwMapState<V> => ({\n\t\t...state,\n\t\t[key]: { value: state[key]?.value, deleted: true, timestamp, replica }\n\t}),\n\n\tget: <V>(state: LwwMapState<V>, key: string): V | undefined => {\n\t\tconst entry = state[key];\n\n\t\treturn entry !== undefined && !entry.deleted ? entry.value : undefined;\n\t},\n\n\thas: <V>(state: LwwMapState<V>, key: string): boolean => {\n\t\tconst entry = state[key];\n\n\t\treturn entry !== undefined && !entry.deleted;\n\t},\n\n\tkeys: <V>(state: LwwMapState<V>): string[] =>\n\t\tObject.keys(state).filter((key) => !state[key]?.deleted),\n\n\tentries: <V>(state: LwwMapState<V>): [string, V][] => {\n\t\tconst out: [string, V][] = [];\n\t\tfor (const [key, entry] of Object.entries(state)) {\n\t\t\tif (!entry.deleted && entry.value !== undefined) {\n\t\t\t\tout.push([key, entry.value]);\n\t\t\t}\n\t\t}\n\n\t\treturn out;\n\t},\n\n\t/** Per-key last-write-wins (commutative/idempotent). */\n\tmerge: <V>(a: LwwMapState<V>, b: LwwMapState<V>): LwwMapState<V> => {\n\t\tconst out: LwwMapState<V> = { ...a };\n\t\tfor (const [key, entry] of Object.entries(b)) {\n\t\t\tconst existing = out[key];\n\t\t\tout[key] = existing === undefined ? entry : pick(existing, entry);\n\t\t}\n\n\t\treturn out;\n\t}\n};\n",
+    "/**\n * An ordered list CRDT — the same RGA sequence type as the collaborative text,\n * but over arbitrary items instead of characters. Concurrent inserts and deletes\n * at any position merge without conflict and converge. State-based, with delta\n * support (`takeDelta`) so a client uploads only its new ops.\n */\n\nexport type ListElement<T> = {\n\tid: string;\n\treplica: string;\n\tclock: number;\n\tafter: string | null;\n\tvalue: T;\n\tdeleted: boolean;\n};\n\nexport type ListState<T> = { elements: ListElement<T>[] };\n\nconst order = <T>(a: ListElement<T>, b: ListElement<T>) => {\n\tif (a.clock !== b.clock) {\n\t\treturn b.clock - a.clock;\n\t}\n\tif (a.replica === b.replica) {\n\t\treturn 0;\n\t}\n\treturn a.replica > b.replica ? -1 : 1;\n};\n\nconst linearize = <T>(elements: ListElement<T>[]): ListElement<T>[] => {\n\tconst present = new Set(elements.map((element) => element.id));\n\tconst children = new Map<string | null, ListElement<T>[]>();\n\tfor (const element of elements) {\n\t\tconst anchor =\n\t\t\telement.after !== null && !present.has(element.after)\n\t\t\t\t? null\n\t\t\t\t: element.after;\n\t\tconst list = children.get(anchor);\n\t\tif (list === undefined) {\n\t\t\tchildren.set(anchor, [element]);\n\t\t} else {\n\t\t\tlist.push(element);\n\t\t}\n\t}\n\tfor (const list of children.values()) {\n\t\tlist.sort(order);\n\t}\n\tconst ordered: ListElement<T>[] = [];\n\tconst stack = [...(children.get(null) ?? [])].reverse();\n\twhile (stack.length > 0) {\n\t\tconst element = stack.pop()!;\n\t\tordered.push(element);\n\t\tconst kids = children.get(element.id);\n\t\tif (kids !== undefined) {\n\t\t\tfor (let index = kids.length - 1; index >= 0; index -= 1) {\n\t\t\t\tstack.push(kids[index]!);\n\t\t\t}\n\t\t}\n\t}\n\treturn ordered;\n};\n\n/** The visible items of a list-CRDT state. Pure. */\nexport const listOf = <T>(state: ListState<T>): T[] =>\n\tlinearize(state.elements)\n\t\t.filter((element) => !element.deleted)\n\t\t.map((element) => element.value);\n\n/** Merge two list-CRDT states (commutative/idempotent). Pure. */\nexport const mergeListState = <T>(\n\ta: ListState<T>,\n\tb: ListState<T>\n): ListState<T> => {\n\tconst byId = new Map<string, ListElement<T>>();\n\tfor (const element of [...a.elements, ...b.elements]) {\n\t\tconst existing = byId.get(element.id);\n\t\tbyId.set(\n\t\t\telement.id,\n\t\t\texisting === undefined\n\t\t\t\t? element\n\t\t\t\t: { ...existing, deleted: existing.deleted || element.deleted }\n\t\t);\n\t}\n\treturn { elements: [...byId.values()] };\n};\n\nexport type ListCrdt<T> = {\n\t/** The current visible items. */\n\tlist: () => T[];\n\t/** Insert `items` at visible `index`. */\n\tinsert: (index: number, items: T[]) => void;\n\t/** Tombstone `count` visible items from `index`. */\n\tdelete: (index: number, count: number) => void;\n\t/** Merge another replica's state in. */\n\tmerge: (state: ListState<T>) => void;\n\t/** The full serializable state (for hydration). */\n\tstate: () => ListState<T>;\n\t/** The locally-authored ops since the last call, then clears the buffer. */\n\ttakeDelta: () => ListState<T>;\n};\n\n/** Create a live ordered-list CRDT for `replica`. */\nexport const createList = <T>(\n\treplica: string,\n\tinitial?: ListState<T>\n): ListCrdt<T> => {\n\tconst elements = new Map<string, ListElement<T>>();\n\tconst pending = new Map<string, ListElement<T>>();\n\tlet clock = 0;\n\tif (initial !== undefined) {\n\t\tfor (const element of initial.elements) {\n\t\t\telements.set(element.id, element);\n\t\t\tclock = Math.max(clock, element.clock);\n\t\t}\n\t}\n\n\tconst visible = () =>\n\t\tlinearize([...elements.values()]).filter((element) => !element.deleted);\n\n\treturn {\n\t\tlist: () => listOf({ elements: [...elements.values()] }),\n\t\tinsert: (index, items) => {\n\t\t\tconst seen = visible();\n\t\t\tlet after = index <= 0 ? null : (seen[index - 1]?.id ?? null);\n\t\t\tfor (const value of items) {\n\t\t\t\tclock += 1;\n\t\t\t\tconst element: ListElement<T> = {\n\t\t\t\t\tid: `${replica}:${clock}`,\n\t\t\t\t\treplica,\n\t\t\t\t\tclock,\n\t\t\t\t\tafter,\n\t\t\t\t\tvalue,\n\t\t\t\t\tdeleted: false\n\t\t\t\t};\n\t\t\t\telements.set(element.id, element);\n\t\t\t\tpending.set(element.id, element);\n\t\t\t\tafter = element.id;\n\t\t\t}\n\t\t},\n\t\tdelete: (index, count) => {\n\t\t\tconst seen = visible();\n\t\t\tfor (let offset = 0; offset < count; offset += 1) {\n\t\t\t\tconst target = seen[index + offset];\n\t\t\t\tif (target !== undefined) {\n\t\t\t\t\tconst tombstoned = { ...target, deleted: true };\n\t\t\t\t\telements.set(target.id, tombstoned);\n\t\t\t\t\tpending.set(target.id, tombstoned);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\tmerge: (state) => {\n\t\t\tfor (const element of state.elements) {\n\t\t\t\tconst existing = elements.get(element.id);\n\t\t\t\telements.set(\n\t\t\t\t\telement.id,\n\t\t\t\t\texisting === undefined\n\t\t\t\t\t\t? element\n\t\t\t\t\t\t: {\n\t\t\t\t\t\t\t\t...existing,\n\t\t\t\t\t\t\t\tdeleted: existing.deleted || element.deleted\n\t\t\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t\tclock = Math.max(clock, element.clock);\n\t\t\t}\n\t\t},\n\t\tstate: () => ({ elements: [...elements.values()] }),\n\t\ttakeDelta: () => {\n\t\t\tconst delta = { elements: [...pending.values()] };\n\t\t\tpending.clear();\n\n\t\t\treturn delta;\n\t\t}\n\t};\n};\n",
+    "/**\n * Conflict-free replicated data types (CRDTs) for multiplayer/offline editing —\n * pure, dependency-free, and isomorphic (use the same code client and server).\n *\n * These are *state-based* CRDTs (CvRDTs): every `merge` is commutative,\n * associative, and idempotent, so replicas that exchange state in any order\n * converge to the same value. That fits the sync engine without engine changes:\n * store the CRDT state as a row field, have a mutation `merge` the incoming\n * state into the stored one (concurrent writes combine instead of clobbering),\n * and have each client merge the broadcast state into its local edits.\n */\n\nexport { orSet } from './orSet';\nexport type { OrSetState } from './orSet';\nexport { lwwMap } from './lwwMap';\nexport type { LwwMapEntry, LwwMapState } from './lwwMap';\nexport { createList, listOf, mergeListState } from './list';\nexport type { ListCrdt, ListElement, ListState } from './list';\n\nconst sumValues = (counts: Record<string, number>) =>\n\tObject.values(counts).reduce((total, value) => total + value, 0);\n\nconst mergeMax = (\n\ta: Record<string, number>,\n\tb: Record<string, number>\n): Record<string, number> => {\n\tconst merged: Record<string, number> = { ...a };\n\tfor (const [replica, value] of Object.entries(b)) {\n\t\tmerged[replica] = Math.max(merged[replica] ?? 0, value);\n\t}\n\treturn merged;\n};\n\n/* ─── PN-counter ─── */\n\n/** A counter that survives concurrent increments/decrements across replicas. */\nexport type CounterState = {\n\tincrements: Record<string, number>;\n\tdecrements: Record<string, number>;\n};\n\nexport const counter = {\n\tcreate: (): CounterState => ({ increments: {}, decrements: {} }),\n\t/** Current value: total increments minus total decrements. */\n\tvalue: (state: CounterState) =>\n\t\tsumValues(state.increments) - sumValues(state.decrements),\n\tincrement: (\n\t\tstate: CounterState,\n\t\treplica: string,\n\t\tby = 1\n\t): CounterState => ({\n\t\tincrements: {\n\t\t\t...state.increments,\n\t\t\t[replica]: (state.increments[replica] ?? 0) + by\n\t\t},\n\t\tdecrements: state.decrements\n\t}),\n\tdecrement: (\n\t\tstate: CounterState,\n\t\treplica: string,\n\t\tby = 1\n\t): CounterState => ({\n\t\tincrements: state.increments,\n\t\tdecrements: {\n\t\t\t...state.decrements,\n\t\t\t[replica]: (state.decrements[replica] ?? 0) + by\n\t\t}\n\t}),\n\t/** Merge by taking the max count seen per replica (monotonic). */\n\tmerge: (a: CounterState, b: CounterState): CounterState => ({\n\t\tincrements: mergeMax(a.increments, b.increments),\n\t\tdecrements: mergeMax(a.decrements, b.decrements)\n\t})\n};\n\n/* ─── LWW register ─── */\n\n/** A single value where the latest write wins (ties broken by replica id). */\nexport type LwwState<T> = { value: T; timestamp: number; replica: string };\n\nexport const lww = {\n\tcreate: <T>(\n\t\tvalue: T,\n\t\treplica: string,\n\t\ttimestamp = Date.now()\n\t): LwwState<T> => ({ value, timestamp, replica }),\n\tset: <T>(\n\t\tvalue: T,\n\t\treplica: string,\n\t\ttimestamp = Date.now()\n\t): LwwState<T> => ({\n\t\tvalue,\n\t\ttimestamp,\n\t\treplica\n\t}),\n\t/** Keep the entry with the higher timestamp (replica id breaks ties). */\n\tmerge: <T>(a: LwwState<T>, b: LwwState<T>): LwwState<T> => {\n\t\tif (b.timestamp > a.timestamp) {\n\t\t\treturn b;\n\t\t}\n\t\tif (b.timestamp < a.timestamp) {\n\t\t\treturn a;\n\t\t}\n\t\treturn b.replica > a.replica ? b : a;\n\t}\n};\n\n/* ─── Collaborative text ─── */\n\n/**\n * The contract a collaborative-text CRDT exposes, independent of the algorithm\n * behind it. Implemented first-party by the RGA below ({@link createTextCrdt})\n * and by third-party backends in the `sync-adapters` repo (e.g.\n * `@absolutejs/sync-yjs`). `State` is whatever that backend persists and\n * broadcasts — JSON ({@link TextState}) for the RGA, a base64 update for Yjs.\n */\nexport type CrdtText<State> = {\n\t/** The current visible text. */\n\ttext: () => string;\n\t/** Reconcile the local text to `next` (the backend computes the edit). */\n\tsetText: (next: string) => void;\n\t/** Merge another replica's state in (e.g. a broadcast from the server). */\n\tmerge: (state: State) => void;\n\t/** The full serializable state to persist/broadcast (for hydration). */\n\tstate: () => State;\n\t/**\n\t * The locally-authored changes since the last call (a delta-state), then clears\n\t * the buffer. A delta merges exactly like a full state (union), so a client can\n\t * upload just its new ops — O(edit) instead of O(doc) — while the server keeps\n\t * full state. Optional: backends without delta support fall back to `state()`.\n\t */\n\ttakeDelta?: () => State;\n};\n\n/**\n * The minimal server-side surface the engine needs to auto-merge a CRDT field on\n * write (see `engine.registerCrdt`): combine two states and produce an empty one.\n * Both the first-party {@link rgaText} and `@absolutejs/sync-yjs`'s `yjsText`\n * satisfy it, as does any {@link TextCrdtAdapter}.\n */\nexport type CrdtMergeable<State> = {\n\tempty: () => State;\n\tmerge: (a: State, b: State) => State;\n};\n\n/**\n * A pluggable collaborative-text backend. `create` mints a live doc for a\n * replica; `merge` combines two persisted states server-side (no live instance\n * needed — for the merge-on-write mutation); `empty`/`textOf` are conveniences.\n * Swap the first-party {@link rgaText} for an adapter to get a different engine\n * (e.g. Yjs) behind the exact same call sites.\n */\nexport type TextCrdtAdapter<State> = CrdtMergeable<State> & {\n\tcreate: (replica: string, initial?: State) => CrdtText<State>;\n\ttextOf: (state: State) => string;\n\t/** Optionally bound state growth (e.g. drop unreferenced tombstones). */\n\tcompact?: (state: State) => State;\n};\n\n/* ─── Collaborative text (RGA) — the first-party backend ─── */\n\n/** One inserted character in the replicated sequence (kept as a tombstone if deleted). */\nexport type TextElement = {\n\tid: string;\n\treplica: string;\n\tclock: number;\n\t/** Id of the element this was inserted after (`null` = start of document). */\n\tafter: string | null;\n\tvalue: string;\n\tdeleted: boolean;\n};\n\n/** Serializable state of a {@link TextCrdt} — safe to store as a row field. */\nexport type TextState = { elements: TextElement[] };\n\n// Sibling order (same `after`): higher clock first, then higher replica id.\nconst compare = (a: TextElement, b: TextElement) => {\n\tif (a.clock !== b.clock) {\n\t\treturn b.clock - a.clock;\n\t}\n\tif (a.replica === b.replica) {\n\t\treturn 0;\n\t}\n\treturn a.replica > b.replica ? -1 : 1;\n};\n\n/** Flatten the sequence into document order (an iterative RGA pre-order walk). */\nconst linearize = (elements: TextElement[]): TextElement[] => {\n\tconst present = new Set(elements.map((element) => element.id));\n\tconst children = new Map<string | null, TextElement[]>();\n\tfor (const element of elements) {\n\t\t// An element whose anchor was compacted/GC'd away (or never seen) is an\n\t\t// orphan — re-root it deterministically instead of dropping its content.\n\t\tconst anchor =\n\t\t\telement.after !== null && !present.has(element.after)\n\t\t\t\t? null\n\t\t\t\t: element.after;\n\t\tconst list = children.get(anchor);\n\t\tif (list === undefined) {\n\t\t\tchildren.set(anchor, [element]);\n\t\t} else {\n\t\t\tlist.push(element);\n\t\t}\n\t}\n\tfor (const list of children.values()) {\n\t\tlist.sort(compare);\n\t}\n\tconst ordered: TextElement[] = [];\n\tconst stack = [...(children.get(null) ?? [])].reverse();\n\twhile (stack.length > 0) {\n\t\tconst element = stack.pop()!;\n\t\tordered.push(element);\n\t\tconst kids = children.get(element.id);\n\t\tif (kids !== undefined) {\n\t\t\tfor (let index = kids.length - 1; index >= 0; index -= 1) {\n\t\t\t\tstack.push(kids[index]!);\n\t\t\t}\n\t\t}\n\t}\n\treturn ordered;\n};\n\n/** The visible string of a text-CRDT state. Pure — use it server-side too. */\nexport const textOf = (state: TextState): string =>\n\tlinearize(state.elements)\n\t\t.filter((element) => !element.deleted)\n\t\t.map((element) => element.value)\n\t\t.join('');\n\n/** Merge two text-CRDT states (commutative/idempotent). Pure — for server mutations. */\nexport const mergeTextState = (a: TextState, b: TextState): TextState => {\n\tconst byId = new Map<string, TextElement>();\n\tfor (const element of [...a.elements, ...b.elements]) {\n\t\tconst existing = byId.get(element.id);\n\t\tbyId.set(\n\t\t\telement.id,\n\t\t\texisting === undefined\n\t\t\t\t? element\n\t\t\t\t: { ...existing, deleted: existing.deleted || element.deleted }\n\t\t);\n\t}\n\treturn { elements: [...byId.values()] };\n};\n\n/** How many tombstones (deleted-but-retained elements) a state carries. Use it\n * to decide when to {@link compact} (e.g. a server-side threshold). */\nexport const tombstoneCount = (state: TextState): number =>\n\tstate.elements.reduce(\n\t\t(total, element) => (element.deleted ? total + 1 : total),\n\t\t0\n\t);\n\n/**\n * Drop tombstones that no remaining element anchors to (`after`), bounding state\n * growth from deletions — the visible text is unchanged. Pure.\n *\n * Future inserts only ever anchor to *visible* elements, so a tombstone nothing\n * currently references will never be referenced again; removing it is safe for\n * the canonical (server-held) state. Run it server-side on the stored state\n * (e.g. once `tombstoneCount` crosses a threshold); clients adopt the compacted\n * state on the next broadcast. {@link textOf}/{@link mergeTextState} and the\n * linearizer tolerate a stale client that briefly references a compacted\n * tombstone (its insert is re-rooted deterministically, not lost).\n */\nexport const compact = (state: TextState): TextState => {\n\tconst byId = new Map(\n\t\tstate.elements.map((element) => [element.id, element])\n\t);\n\t// Keep a tombstone only if it lies on the `after`-chain from a live element\n\t// (so positions are preserved); a deleted run that nothing live anchors\n\t// through is dropped. Walk each live element's chain of tombstone anchors.\n\tconst keep = new Set<string>();\n\tfor (const element of state.elements) {\n\t\tif (element.deleted) {\n\t\t\tcontinue;\n\t\t}\n\t\tlet anchor = element.after;\n\t\twhile (anchor !== null && !keep.has(anchor)) {\n\t\t\tconst target = byId.get(anchor);\n\t\t\tif (target === undefined || !target.deleted) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tkeep.add(anchor);\n\t\t\tanchor = target.after;\n\t\t}\n\t}\n\treturn {\n\t\telements: state.elements.filter(\n\t\t\t(element) => !element.deleted || keep.has(element.id)\n\t\t)\n\t};\n};\n\n/** The RGA text CRDT — {@link CrdtText} plus direct positional edits. */\nexport type TextCrdt = CrdtText<TextState> & {\n\t/** Insert `value` at visible `index`. */\n\tinsert: (index: number, value: string) => void;\n\t/** Tombstone `count` visible characters from `index`. */\n\tdelete: (index: number, count: number) => void;\n\t/** Locally-authored changes since the last call, then clears the buffer. */\n\ttakeDelta: () => TextState;\n};\n\n/**\n * A collaborative text buffer backed by an RGA sequence CRDT. Concurrent inserts\n * and deletes from different replicas merge without conflict and converge. Drive\n * it from an input via {@link TextCrdt.setText}; persist/broadcast\n * {@link TextCrdt.state}; apply remote state via {@link TextCrdt.merge}.\n */\nexport const createTextCrdt = (\n\treplica: string,\n\tinitial?: TextState\n): TextCrdt => {\n\tconst elements = new Map<string, TextElement>();\n\t// Elements this replica created or tombstoned since the last takeDelta — the\n\t// delta to broadcast. Local edits add here; `merge` (remote) deliberately\n\t// does not, so a client only ever re-broadcasts its own ops.\n\tconst pending = new Map<string, TextElement>();\n\tlet clock = 0;\n\tif (initial !== undefined) {\n\t\tfor (const element of initial.elements) {\n\t\t\telements.set(element.id, element);\n\t\t\tclock = Math.max(clock, element.clock);\n\t\t}\n\t}\n\n\tconst visible = () =>\n\t\tlinearize([...elements.values()]).filter((element) => !element.deleted);\n\n\tconst insert = (index: number, value: string) => {\n\t\tconst seen = visible();\n\t\tlet after = index <= 0 ? null : (seen[index - 1]?.id ?? null);\n\t\tfor (const char of [...value]) {\n\t\t\tclock += 1;\n\t\t\tconst element: TextElement = {\n\t\t\t\tid: `${replica}:${clock}`,\n\t\t\t\treplica,\n\t\t\t\tclock,\n\t\t\t\tafter,\n\t\t\t\tvalue: char,\n\t\t\t\tdeleted: false\n\t\t\t};\n\t\t\telements.set(element.id, element);\n\t\t\tpending.set(element.id, element);\n\t\t\tafter = element.id;\n\t\t}\n\t};\n\n\tconst remove = (index: number, count: number) => {\n\t\tconst seen = visible();\n\t\tfor (let offset = 0; offset < count; offset += 1) {\n\t\t\tconst target = seen[index + offset];\n\t\t\tif (target !== undefined) {\n\t\t\t\tconst tombstoned = { ...target, deleted: true };\n\t\t\t\telements.set(target.id, tombstoned);\n\t\t\t\tpending.set(target.id, tombstoned);\n\t\t\t}\n\t\t}\n\t};\n\n\treturn {\n\t\ttext: () => textOf({ elements: [...elements.values()] }),\n\t\tinsert,\n\t\tdelete: remove,\n\t\tmerge: (state) => {\n\t\t\tfor (const element of state.elements) {\n\t\t\t\tconst existing = elements.get(element.id);\n\t\t\t\telements.set(\n\t\t\t\t\telement.id,\n\t\t\t\t\texisting === undefined\n\t\t\t\t\t\t? element\n\t\t\t\t\t\t: {\n\t\t\t\t\t\t\t\t...existing,\n\t\t\t\t\t\t\t\tdeleted: existing.deleted || element.deleted\n\t\t\t\t\t\t\t}\n\t\t\t\t);\n\t\t\t\tclock = Math.max(clock, element.clock);\n\t\t\t}\n\t\t},\n\t\t// Reconcile to `next` by editing only the changed middle: keep the common\n\t\t// prefix/suffix, delete the old middle, insert the new — so two clients\n\t\t// typing in different places merge instead of overwriting.\n\t\tsetText: (next) => {\n\t\t\tconst current = textOf({ elements: [...elements.values()] });\n\t\t\tif (current === next) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet prefix = 0;\n\t\t\tconst maxPrefix = Math.min(current.length, next.length);\n\t\t\twhile (prefix < maxPrefix && current[prefix] === next[prefix]) {\n\t\t\t\tprefix += 1;\n\t\t\t}\n\t\t\tlet suffix = 0;\n\t\t\twhile (\n\t\t\t\tsuffix < maxPrefix - prefix &&\n\t\t\t\tcurrent[current.length - 1 - suffix] ===\n\t\t\t\t\tnext[next.length - 1 - suffix]\n\t\t\t) {\n\t\t\t\tsuffix += 1;\n\t\t\t}\n\t\t\tconst removed = current.length - prefix - suffix;\n\t\t\tif (removed > 0) {\n\t\t\t\tremove(prefix, removed);\n\t\t\t}\n\t\t\tconst inserted = next.slice(prefix, next.length - suffix);\n\t\t\tif (inserted.length > 0) {\n\t\t\t\tinsert(prefix, inserted);\n\t\t\t}\n\t\t},\n\t\tstate: () => ({ elements: [...elements.values()] }),\n\t\ttakeDelta: () => {\n\t\t\tconst delta = { elements: [...pending.values()] };\n\t\t\tpending.clear();\n\n\t\t\treturn delta;\n\t\t}\n\t};\n};\n\n/**\n * The first-party collaborative-text backend (the RGA above) packaged as a\n * {@link TextCrdtAdapter}. Zero dependencies. Use it directly, or swap in an\n * adapter from `sync-adapters` (e.g. `@absolutejs/sync-yjs`) for the same shape.\n */\nexport const rgaText: TextCrdtAdapter<TextState> = {\n\tcompact,\n\tcreate: createTextCrdt,\n\tempty: () => ({ elements: [] }),\n\tmerge: mergeTextState,\n\ttextOf\n};\n"
   ],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAYA,IAAM,YAAY,CAAC,WAClB,OAAO,OAAO,MAAM,EAAE,OAAO,CAAC,OAAO,UAAU,QAAQ,OAAO,CAAC;AAEhE,IAAM,WAAW,CAChB,GACA,MAC4B;AAAA,EAC5B,MAAM,SAAiC,KAAK,EAAE;AAAA,EAC9C,YAAY,SAAS,UAAU,OAAO,QAAQ,CAAC,GAAG;AAAA,IACjD,OAAO,WAAW,KAAK,IAAI,OAAO,YAAY,GAAG,KAAK;AAAA,EACvD;AAAA,EACA,OAAO;AAAA;AAWD,IAAM,UAAU;AAAA,EACtB,QAAQ,OAAqB,EAAE,YAAY,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,EAE9D,OAAO,CAAC,UACP,UAAU,MAAM,UAAU,IAAI,UAAU,MAAM,UAAU;AAAA,EACzD,WAAW,CACV,OACA,SACA,KAAK,OACc;AAAA,IACnB,YAAY;AAAA,SACR,MAAM;AAAA,OACR,WAAW,MAAM,WAAW,YAAY,KAAK;AAAA,IAC/C;AAAA,IACA,YAAY,MAAM;AAAA,EACnB;AAAA,EACA,WAAW,CACV,OACA,SACA,KAAK,OACc;AAAA,IACnB,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,SACR,MAAM;AAAA,OACR,WAAW,MAAM,WAAW,YAAY,KAAK;AAAA,IAC/C;AAAA,EACD;AAAA,EAEA,OAAO,CAAC,GAAiB,OAAmC;AAAA,IAC3D,YAAY,SAAS,EAAE,YAAY,EAAE,UAAU;AAAA,IAC/C,YAAY,SAAS,EAAE,YAAY,EAAE,UAAU;AAAA,EAChD;AACD;AAOO,IAAM,MAAM;AAAA,EAClB,QAAQ,CACP,OACA,SACA,YAAY,KAAK,IAAI,OACH,EAAE,OAAO,WAAW,QAAQ;AAAA,EAC/C,KAAK,CACJ,OACA,SACA,YAAY,KAAK,IAAI,OACH;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAAA,EAEA,OAAO,CAAI,GAAgB,MAAgC;AAAA,IAC1D,IAAI,EAAE,YAAY,EAAE,WAAW;AAAA,MAC9B,OAAO;AAAA,IACR;AAAA,IACA,IAAI,EAAE,YAAY,EAAE,WAAW;AAAA,MAC9B,OAAO;AAAA,IACR;AAAA,IACA,OAAO,EAAE,UAAU,EAAE,UAAU,IAAI;AAAA;AAErC;AAuEA,IAAM,UAAU,CAAC,GAAgB,MAAmB;AAAA,EACnD,IAAI,EAAE,UAAU,EAAE,OAAO;AAAA,IACxB,OAAO,EAAE,QAAQ,EAAE;AAAA,EACpB;AAAA,EACA,IAAI,EAAE,YAAY,EAAE,SAAS;AAAA,IAC5B,OAAO;AAAA,EACR;AAAA,EACA,OAAO,EAAE,UAAU,EAAE,UAAU,KAAK;AAAA;AAIrC,IAAM,YAAY,CAAC,aAA2C;AAAA,EAC7D,MAAM,UAAU,IAAI,IAAI,SAAS,IAAI,CAAC,YAAY,QAAQ,EAAE,CAAC;AAAA,EAC7D,MAAM,WAAW,IAAI;AAAA,EACrB,WAAW,WAAW,UAAU;AAAA,IAG/B,MAAM,SACL,QAAQ,UAAU,QAAQ,CAAC,QAAQ,IAAI,QAAQ,KAAK,IACjD,OACA,QAAQ;AAAA,IACZ,MAAM,OAAO,SAAS,IAAI,MAAM;AAAA,IAChC,IAAI,SAAS,WAAW;AAAA,MACvB,SAAS,IAAI,QAAQ,CAAC,OAAO,CAAC;AAAA,IAC/B,EAAO;AAAA,MACN,KAAK,KAAK,OAAO;AAAA;AAAA,EAEnB;AAAA,EACA,WAAW,QAAQ,SAAS,OAAO,GAAG;AAAA,IACrC,KAAK,KAAK,OAAO;AAAA,EAClB;AAAA,EACA,MAAM,UAAyB,CAAC;AAAA,EAChC,MAAM,QAAQ,CAAC,GAAI,SAAS,IAAI,IAAI,KAAK,CAAC,CAAE,EAAE,QAAQ;AAAA,EACtD,OAAO,MAAM,SAAS,GAAG;AAAA,IACxB,MAAM,UAAU,MAAM,IAAI;AAAA,IAC1B,QAAQ,KAAK,OAAO;AAAA,IACpB,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE;AAAA,IACpC,IAAI,SAAS,WAAW;AAAA,MACvB,SAAS,QAAQ,KAAK,SAAS,EAAG,SAAS,GAAG,SAAS,GAAG;AAAA,QACzD,MAAM,KAAK,KAAK,MAAO;AAAA,MACxB;AAAA,IACD;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAID,IAAM,SAAS,CAAC,UACtB,UAAU,MAAM,QAAQ,EACtB,OAAO,CAAC,YAAY,CAAC,QAAQ,OAAO,EACpC,IAAI,CAAC,YAAY,QAAQ,KAAK,EAC9B,KAAK,EAAE;AAGH,IAAM,iBAAiB,CAAC,GAAc,MAA4B;AAAA,EACxE,MAAM,OAAO,IAAI;AAAA,EACjB,WAAW,WAAW,CAAC,GAAG,EAAE,UAAU,GAAG,EAAE,QAAQ,GAAG;AAAA,IACrD,MAAM,WAAW,KAAK,IAAI,QAAQ,EAAE;AAAA,IACpC,KAAK,IACJ,QAAQ,IACR,aAAa,YACV,UACA,KAAK,UAAU,SAAS,SAAS,WAAW,QAAQ,QAAQ,CAChE;AAAA,EACD;AAAA,EACA,OAAO,EAAE,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE;AAAA;AAKhC,IAAM,iBAAiB,CAAC,UAC9B,MAAM,SAAS,OACd,CAAC,OAAO,YAAa,QAAQ,UAAU,QAAQ,IAAI,OACnD,CACD;AAcM,IAAM,UAAU,CAAC,UAAgC;AAAA,EACvD,MAAM,OAAO,IAAI,IAChB,MAAM,SAAS,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,OAAO,CAAC,CACtD;AAAA,EAIA,MAAM,OAAO,IAAI;AAAA,EACjB,WAAW,WAAW,MAAM,UAAU;AAAA,IACrC,IAAI,QAAQ,SAAS;AAAA,MACpB;AAAA,IACD;AAAA,IACA,IAAI,SAAS,QAAQ;AAAA,IACrB,OAAO,WAAW,QAAQ,CAAC,KAAK,IAAI,MAAM,GAAG;AAAA,MAC5C,MAAM,SAAS,KAAK,IAAI,MAAM;AAAA,MAC9B,IAAI,WAAW,aAAa,CAAC,OAAO,SAAS;AAAA,QAC5C;AAAA,MACD;AAAA,MACA,KAAK,IAAI,MAAM;AAAA,MACf,SAAS,OAAO;AAAA,IACjB;AAAA,EACD;AAAA,EACA,OAAO;AAAA,IACN,UAAU,MAAM,SAAS,OACxB,CAAC,YAAY,CAAC,QAAQ,WAAW,KAAK,IAAI,QAAQ,EAAE,CACrD;AAAA,EACD;AAAA;AAmBM,IAAM,iBAAiB,CAC7B,SACA,YACc;AAAA,EACd,MAAM,WAAW,IAAI;AAAA,EAIrB,MAAM,UAAU,IAAI;AAAA,EACpB,IAAI,QAAQ;AAAA,EACZ,IAAI,YAAY,WAAW;AAAA,IAC1B,WAAW,WAAW,QAAQ,UAAU;AAAA,MACvC,SAAS,IAAI,QAAQ,IAAI,OAAO;AAAA,MAChC,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK;AAAA,IACtC;AAAA,EACD;AAAA,EAEA,MAAM,UAAU,MACf,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,QAAQ,OAAO;AAAA,EAEvE,MAAM,SAAS,CAAC,OAAe,UAAkB;AAAA,IAChD,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,QAAQ,SAAS,IAAI,OAAQ,KAAK,QAAQ,IAAI,MAAM;AAAA,IACxD,WAAW,QAAQ,CAAC,GAAG,KAAK,GAAG;AAAA,MAC9B,SAAS;AAAA,MACT,MAAM,UAAuB;AAAA,QAC5B,IAAI,GAAG,WAAW;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP,SAAS;AAAA,MACV;AAAA,MACA,SAAS,IAAI,QAAQ,IAAI,OAAO;AAAA,MAChC,QAAQ,IAAI,QAAQ,IAAI,OAAO;AAAA,MAC/B,QAAQ,QAAQ;AAAA,IACjB;AAAA;AAAA,EAGD,MAAM,SAAS,CAAC,OAAe,UAAkB;AAAA,IAChD,MAAM,OAAO,QAAQ;AAAA,IACrB,SAAS,SAAS,EAAG,SAAS,OAAO,UAAU,GAAG;AAAA,MACjD,MAAM,SAAS,KAAK,QAAQ;AAAA,MAC5B,IAAI,WAAW,WAAW;AAAA,QACzB,MAAM,aAAa,KAAK,QAAQ,SAAS,KAAK;AAAA,QAC9C,SAAS,IAAI,OAAO,IAAI,UAAU;AAAA,QAClC,QAAQ,IAAI,OAAO,IAAI,UAAU;AAAA,MAClC;AAAA,IACD;AAAA;AAAA,EAGD,OAAO;AAAA,IACN,MAAM,MAAM,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,IACvD;AAAA,IACA,QAAQ;AAAA,IACR,OAAO,CAAC,UAAU;AAAA,MACjB,WAAW,WAAW,MAAM,UAAU;AAAA,QACrC,MAAM,WAAW,SAAS,IAAI,QAAQ,EAAE;AAAA,QACxC,SAAS,IACR,QAAQ,IACR,aAAa,YACV,UACA;AAAA,aACG;AAAA,UACH,SAAS,SAAS,WAAW,QAAQ;AAAA,QACtC,CACH;AAAA,QACA,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK;AAAA,MACtC;AAAA;AAAA,IAKD,SAAS,CAAC,SAAS;AAAA,MAClB,MAAM,UAAU,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,MAC3D,IAAI,YAAY,MAAM;AAAA,QACrB;AAAA,MACD;AAAA,MACA,IAAI,SAAS;AAAA,MACb,MAAM,YAAY,KAAK,IAAI,QAAQ,QAAQ,KAAK,MAAM;AAAA,MACtD,OAAO,SAAS,aAAa,QAAQ,YAAY,KAAK,SAAS;AAAA,QAC9D,UAAU;AAAA,MACX;AAAA,MACA,IAAI,SAAS;AAAA,MACb,OACC,SAAS,YAAY,UACrB,QAAQ,QAAQ,SAAS,IAAI,YAC5B,KAAK,KAAK,SAAS,IAAI,SACvB;AAAA,QACD,UAAU;AAAA,MACX;AAAA,MACA,MAAM,UAAU,QAAQ,SAAS,SAAS;AAAA,MAC1C,IAAI,UAAU,GAAG;AAAA,QAChB,OAAO,QAAQ,OAAO;AAAA,MACvB;AAAA,MACA,MAAM,WAAW,KAAK,MAAM,QAAQ,KAAK,SAAS,MAAM;AAAA,MACxD,IAAI,SAAS,SAAS,GAAG;AAAA,QACxB,OAAO,QAAQ,QAAQ;AAAA,MACxB;AAAA;AAAA,IAED,OAAO,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE;AAAA,IACjD,WAAW,MAAM;AAAA,MAChB,MAAM,QAAQ,EAAE,UAAU,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE;AAAA,MAChD,QAAQ,MAAM;AAAA,MAEd,OAAO;AAAA;AAAA,EAET;AAAA;AAQM,IAAM,UAAsC;AAAA,EAClD;AAAA,EACA,QAAQ;AAAA,EACR,OAAO,OAAO,EAAE,UAAU,CAAC,EAAE;AAAA,EAC7B,OAAO;AAAA,EACP;AACD;",
-  "debugId": "2171A288067B9EDE64756E2164756E21",
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,IAAM,SAAS,MAAc,WAAW,OAAO,WAAW;AAC1D,IAAM,gBAAgB,CAAI,GAAM,MAAkB,OAAO,GAAG,GAAG,CAAC;AASzD,IAAM,QAAQ;AAAA,EACpB,QAAQ,OAAyB,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE;AAAA,EAEzD,KAAK,CACJ,OACA,OACA,MAAM,OAAO,OACO;AAAA,IACpB,MAAM,CAAC,GAAG,MAAM,MAAM,EAAE,OAAO,IAAI,CAAC;AAAA,IACpC,SAAS,MAAM;AAAA,EAChB;AAAA,EAGA,QAAQ,CACP,OACA,OACA,SAAkC,kBACf;AAAA,IACnB,MAAM,OAAO,MAAM,KACjB,OAAO,CAAC,UAAU,OAAO,MAAM,OAAO,KAAK,CAAC,EAC5C,IAAI,CAAC,UAAU,MAAM,GAAG;AAAA,IAE1B,OAAO;AAAA,MACN,MAAM,MAAM;AAAA,MACZ,SAAS,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC;AAAA,IAClD;AAAA;AAAA,EAGD,KAAK,CACJ,OACA,OACA,SAAkC,kBACrB;AAAA,IACb,MAAM,UAAU,IAAI,IAAI,MAAM,OAAO;AAAA,IAErC,OAAO,MAAM,KAAK,KACjB,CAAC,UAAU,OAAO,MAAM,OAAO,KAAK,KAAK,CAAC,QAAQ,IAAI,MAAM,GAAG,CAChE;AAAA;AAAA,EAID,QAAQ,CACP,OACA,SAAkC,kBACzB;AAAA,IACT,MAAM,UAAU,IAAI,IAAI,MAAM,OAAO;AAAA,IACrC,MAAM,MAAW,CAAC;AAAA,IAClB,WAAW,SAAS,MAAM,MAAM;AAAA,MAC/B,IACC,CAAC,QAAQ,IAAI,MAAM,GAAG,KACtB,CAAC,IAAI,KAAK,CAAC,UAAU,OAAO,OAAO,MAAM,KAAK,CAAC,GAC9C;AAAA,QACD,IAAI,KAAK,MAAM,KAAK;AAAA,MACrB;AAAA,IACD;AAAA,IAEA,OAAO;AAAA;AAAA,EAIR,OAAO,CAAI,GAAkB,MAAoC;AAAA,IAChE,MAAM,QAAQ,IAAI;AAAA,IAClB,WAAW,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,IAAI,GAAG;AAAA,MAC3C,MAAM,IAAI,MAAM,KAAK,KAAK;AAAA,IAC3B;AAAA,IAEA,OAAO;AAAA,MACN,MAAM,CAAC,GAAG,MAAM,OAAO,CAAC;AAAA,MACxB,SAAS,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,OAAO,CAAC,CAAC;AAAA,IACnD;AAAA;AAEF;;ACxEA,IAAM,OAAO,CAAI,GAAmB,MAAsC;AAAA,EACzE,IAAI,EAAE,YAAY,EAAE,WAAW;AAAA,IAC9B,OAAO;AAAA,EACR;AAAA,EACA,IAAI,EAAE,YAAY,EAAE,WAAW;AAAA,IAC9B,OAAO;AAAA,EACR;AAAA,EACA,OAAO,EAAE,UAAU,EAAE,UAAU,IAAI;AAAA;AAG7B,IAAM,SAAS;AAAA,EACrB,QAAQ,OAA0B,CAAC;AAAA,EAEnC,KAAK,CACJ,OACA,KACA,OACA,SACA,YAAY,KAAK,IAAI,OACA;AAAA,OAClB;AAAA,KACF,MAAM,EAAE,OAAO,SAAS,OAAO,WAAW,QAAQ;AAAA,EACpD;AAAA,EAEA,QAAQ,CACP,OACA,KACA,SACA,YAAY,KAAK,IAAI,OACA;AAAA,OAClB;AAAA,KACF,MAAM,EAAE,OAAO,MAAM,MAAM,OAAO,SAAS,MAAM,WAAW,QAAQ;AAAA,EACtE;AAAA,EAEA,KAAK,CAAI,OAAuB,QAA+B;AAAA,IAC9D,MAAM,QAAQ,MAAM;AAAA,IAEpB,OAAO,UAAU,aAAa,CAAC,MAAM,UAAU,MAAM,QAAQ;AAAA;AAAA,EAG9D,KAAK,CAAI,OAAuB,QAAyB;AAAA,IACxD,MAAM,QAAQ,MAAM;AAAA,IAEpB,OAAO,UAAU,aAAa,CAAC,MAAM;AAAA;AAAA,EAGtC,MAAM,CAAI,UACT,OAAO,KAAK,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,MAAM,OAAO;AAAA,EAExD,SAAS,CAAI,UAAyC;AAAA,IACrD,MAAM,MAAqB,CAAC;AAAA,IAC5B,YAAY,KAAK,UAAU,OAAO,QAAQ,KAAK,GAAG;AAAA,MACjD,IAAI,CAAC,MAAM,WAAW,MAAM,UAAU,WAAW;AAAA,QAChD,IAAI,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC;AAAA,MAC5B;AAAA,IACD;AAAA,IAEA,OAAO;AAAA;AAAA,EAIR,OAAO,CAAI,GAAmB,MAAsC;AAAA,IACnE,MAAM,MAAsB,KAAK,EAAE;AAAA,IACnC,YAAY,KAAK,UAAU,OAAO,QAAQ,CAAC,GAAG;AAAA,MAC7C,MAAM,WAAW,IAAI;AAAA,MACrB,IAAI,OAAO,aAAa,YAAY,QAAQ,KAAK,UAAU,KAAK;AAAA,IACjE;AAAA,IAEA,OAAO;AAAA;AAET;;ACpEA,IAAM,QAAQ,CAAI,GAAmB,MAAsB;AAAA,EAC1D,IAAI,EAAE,UAAU,EAAE,OAAO;AAAA,IACxB,OAAO,EAAE,QAAQ,EAAE;AAAA,EACpB;AAAA,EACA,IAAI,EAAE,YAAY,EAAE,SAAS;AAAA,IAC5B,OAAO;AAAA,EACR;AAAA,EACA,OAAO,EAAE,UAAU,EAAE,UAAU,KAAK;AAAA;AAGrC,IAAM,YAAY,CAAI,aAAiD;AAAA,EACtE,MAAM,UAAU,IAAI,IAAI,SAAS,IAAI,CAAC,YAAY,QAAQ,EAAE,CAAC;AAAA,EAC7D,MAAM,WAAW,IAAI;AAAA,EACrB,WAAW,WAAW,UAAU;AAAA,IAC/B,MAAM,SACL,QAAQ,UAAU,QAAQ,CAAC,QAAQ,IAAI,QAAQ,KAAK,IACjD,OACA,QAAQ;AAAA,IACZ,MAAM,OAAO,SAAS,IAAI,MAAM;AAAA,IAChC,IAAI,SAAS,WAAW;AAAA,MACvB,SAAS,IAAI,QAAQ,CAAC,OAAO,CAAC;AAAA,IAC/B,EAAO;AAAA,MACN,KAAK,KAAK,OAAO;AAAA;AAAA,EAEnB;AAAA,EACA,WAAW,QAAQ,SAAS,OAAO,GAAG;AAAA,IACrC,KAAK,KAAK,KAAK;AAAA,EAChB;AAAA,EACA,MAAM,UAA4B,CAAC;AAAA,EACnC,MAAM,QAAQ,CAAC,GAAI,SAAS,IAAI,IAAI,KAAK,CAAC,CAAE,EAAE,QAAQ;AAAA,EACtD,OAAO,MAAM,SAAS,GAAG;AAAA,IACxB,MAAM,UAAU,MAAM,IAAI;AAAA,IAC1B,QAAQ,KAAK,OAAO;AAAA,IACpB,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE;AAAA,IACpC,IAAI,SAAS,WAAW;AAAA,MACvB,SAAS,QAAQ,KAAK,SAAS,EAAG,SAAS,GAAG,SAAS,GAAG;AAAA,QACzD,MAAM,KAAK,KAAK,MAAO;AAAA,MACxB;AAAA,IACD;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAID,IAAM,SAAS,CAAI,UACzB,UAAU,MAAM,QAAQ,EACtB,OAAO,CAAC,YAAY,CAAC,QAAQ,OAAO,EACpC,IAAI,CAAC,YAAY,QAAQ,KAAK;AAG1B,IAAM,iBAAiB,CAC7B,GACA,MACkB;AAAA,EAClB,MAAM,OAAO,IAAI;AAAA,EACjB,WAAW,WAAW,CAAC,GAAG,EAAE,UAAU,GAAG,EAAE,QAAQ,GAAG;AAAA,IACrD,MAAM,WAAW,KAAK,IAAI,QAAQ,EAAE;AAAA,IACpC,KAAK,IACJ,QAAQ,IACR,aAAa,YACV,UACA,KAAK,UAAU,SAAS,SAAS,WAAW,QAAQ,QAAQ,CAChE;AAAA,EACD;AAAA,EACA,OAAO,EAAE,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE;AAAA;AAmBhC,IAAM,aAAa,CACzB,SACA,YACiB;AAAA,EACjB,MAAM,WAAW,IAAI;AAAA,EACrB,MAAM,UAAU,IAAI;AAAA,EACpB,IAAI,QAAQ;AAAA,EACZ,IAAI,YAAY,WAAW;AAAA,IAC1B,WAAW,WAAW,QAAQ,UAAU;AAAA,MACvC,SAAS,IAAI,QAAQ,IAAI,OAAO;AAAA,MAChC,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK;AAAA,IACtC;AAAA,EACD;AAAA,EAEA,MAAM,UAAU,MACf,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,QAAQ,OAAO;AAAA,EAEvE,OAAO;AAAA,IACN,MAAM,MAAM,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,IACvD,QAAQ,CAAC,OAAO,UAAU;AAAA,MACzB,MAAM,OAAO,QAAQ;AAAA,MACrB,IAAI,QAAQ,SAAS,IAAI,OAAQ,KAAK,QAAQ,IAAI,MAAM;AAAA,MACxD,WAAW,SAAS,OAAO;AAAA,QAC1B,SAAS;AAAA,QACT,MAAM,UAA0B;AAAA,UAC/B,IAAI,GAAG,WAAW;AAAA,UAClB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS;AAAA,QACV;AAAA,QACA,SAAS,IAAI,QAAQ,IAAI,OAAO;AAAA,QAChC,QAAQ,IAAI,QAAQ,IAAI,OAAO;AAAA,QAC/B,QAAQ,QAAQ;AAAA,MACjB;AAAA;AAAA,IAED,QAAQ,CAAC,OAAO,UAAU;AAAA,MACzB,MAAM,OAAO,QAAQ;AAAA,MACrB,SAAS,SAAS,EAAG,SAAS,OAAO,UAAU,GAAG;AAAA,QACjD,MAAM,SAAS,KAAK,QAAQ;AAAA,QAC5B,IAAI,WAAW,WAAW;AAAA,UACzB,MAAM,aAAa,KAAK,QAAQ,SAAS,KAAK;AAAA,UAC9C,SAAS,IAAI,OAAO,IAAI,UAAU;AAAA,UAClC,QAAQ,IAAI,OAAO,IAAI,UAAU;AAAA,QAClC;AAAA,MACD;AAAA;AAAA,IAED,OAAO,CAAC,UAAU;AAAA,MACjB,WAAW,WAAW,MAAM,UAAU;AAAA,QACrC,MAAM,WAAW,SAAS,IAAI,QAAQ,EAAE;AAAA,QACxC,SAAS,IACR,QAAQ,IACR,aAAa,YACV,UACA;AAAA,aACG;AAAA,UACH,SAAS,SAAS,WAAW,QAAQ;AAAA,QACtC,CACH;AAAA,QACA,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK;AAAA,MACtC;AAAA;AAAA,IAED,OAAO,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE;AAAA,IACjD,WAAW,MAAM;AAAA,MAChB,MAAM,QAAQ,EAAE,UAAU,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE;AAAA,MAChD,QAAQ,MAAM;AAAA,MAEd,OAAO;AAAA;AAAA,EAET;AAAA;;;ACxJD,IAAM,YAAY,CAAC,WAClB,OAAO,OAAO,MAAM,EAAE,OAAO,CAAC,OAAO,UAAU,QAAQ,OAAO,CAAC;AAEhE,IAAM,WAAW,CAChB,GACA,MAC4B;AAAA,EAC5B,MAAM,SAAiC,KAAK,EAAE;AAAA,EAC9C,YAAY,SAAS,UAAU,OAAO,QAAQ,CAAC,GAAG;AAAA,IACjD,OAAO,WAAW,KAAK,IAAI,OAAO,YAAY,GAAG,KAAK;AAAA,EACvD;AAAA,EACA,OAAO;AAAA;AAWD,IAAM,UAAU;AAAA,EACtB,QAAQ,OAAqB,EAAE,YAAY,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,EAE9D,OAAO,CAAC,UACP,UAAU,MAAM,UAAU,IAAI,UAAU,MAAM,UAAU;AAAA,EACzD,WAAW,CACV,OACA,SACA,KAAK,OACc;AAAA,IACnB,YAAY;AAAA,SACR,MAAM;AAAA,OACR,WAAW,MAAM,WAAW,YAAY,KAAK;AAAA,IAC/C;AAAA,IACA,YAAY,MAAM;AAAA,EACnB;AAAA,EACA,WAAW,CACV,OACA,SACA,KAAK,OACc;AAAA,IACnB,YAAY,MAAM;AAAA,IAClB,YAAY;AAAA,SACR,MAAM;AAAA,OACR,WAAW,MAAM,WAAW,YAAY,KAAK;AAAA,IAC/C;AAAA,EACD;AAAA,EAEA,OAAO,CAAC,GAAiB,OAAmC;AAAA,IAC3D,YAAY,SAAS,EAAE,YAAY,EAAE,UAAU;AAAA,IAC/C,YAAY,SAAS,EAAE,YAAY,EAAE,UAAU;AAAA,EAChD;AACD;AAOO,IAAM,MAAM;AAAA,EAClB,QAAQ,CACP,OACA,SACA,YAAY,KAAK,IAAI,OACH,EAAE,OAAO,WAAW,QAAQ;AAAA,EAC/C,KAAK,CACJ,OACA,SACA,YAAY,KAAK,IAAI,OACH;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAAA,EAEA,OAAO,CAAI,GAAgB,MAAgC;AAAA,IAC1D,IAAI,EAAE,YAAY,EAAE,WAAW;AAAA,MAC9B,OAAO;AAAA,IACR;AAAA,IACA,IAAI,EAAE,YAAY,EAAE,WAAW;AAAA,MAC9B,OAAO;AAAA,IACR;AAAA,IACA,OAAO,EAAE,UAAU,EAAE,UAAU,IAAI;AAAA;AAErC;AAuEA,IAAM,UAAU,CAAC,GAAgB,MAAmB;AAAA,EACnD,IAAI,EAAE,UAAU,EAAE,OAAO;AAAA,IACxB,OAAO,EAAE,QAAQ,EAAE;AAAA,EACpB;AAAA,EACA,IAAI,EAAE,YAAY,EAAE,SAAS;AAAA,IAC5B,OAAO;AAAA,EACR;AAAA,EACA,OAAO,EAAE,UAAU,EAAE,UAAU,KAAK;AAAA;AAIrC,IAAM,aAAY,CAAC,aAA2C;AAAA,EAC7D,MAAM,UAAU,IAAI,IAAI,SAAS,IAAI,CAAC,YAAY,QAAQ,EAAE,CAAC;AAAA,EAC7D,MAAM,WAAW,IAAI;AAAA,EACrB,WAAW,WAAW,UAAU;AAAA,IAG/B,MAAM,SACL,QAAQ,UAAU,QAAQ,CAAC,QAAQ,IAAI,QAAQ,KAAK,IACjD,OACA,QAAQ;AAAA,IACZ,MAAM,OAAO,SAAS,IAAI,MAAM;AAAA,IAChC,IAAI,SAAS,WAAW;AAAA,MACvB,SAAS,IAAI,QAAQ,CAAC,OAAO,CAAC;AAAA,IAC/B,EAAO;AAAA,MACN,KAAK,KAAK,OAAO;AAAA;AAAA,EAEnB;AAAA,EACA,WAAW,QAAQ,SAAS,OAAO,GAAG;AAAA,IACrC,KAAK,KAAK,OAAO;AAAA,EAClB;AAAA,EACA,MAAM,UAAyB,CAAC;AAAA,EAChC,MAAM,QAAQ,CAAC,GAAI,SAAS,IAAI,IAAI,KAAK,CAAC,CAAE,EAAE,QAAQ;AAAA,EACtD,OAAO,MAAM,SAAS,GAAG;AAAA,IACxB,MAAM,UAAU,MAAM,IAAI;AAAA,IAC1B,QAAQ,KAAK,OAAO;AAAA,IACpB,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE;AAAA,IACpC,IAAI,SAAS,WAAW;AAAA,MACvB,SAAS,QAAQ,KAAK,SAAS,EAAG,SAAS,GAAG,SAAS,GAAG;AAAA,QACzD,MAAM,KAAK,KAAK,MAAO;AAAA,MACxB;AAAA,IACD;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAID,IAAM,SAAS,CAAC,UACtB,WAAU,MAAM,QAAQ,EACtB,OAAO,CAAC,YAAY,CAAC,QAAQ,OAAO,EACpC,IAAI,CAAC,YAAY,QAAQ,KAAK,EAC9B,KAAK,EAAE;AAGH,IAAM,iBAAiB,CAAC,GAAc,MAA4B;AAAA,EACxE,MAAM,OAAO,IAAI;AAAA,EACjB,WAAW,WAAW,CAAC,GAAG,EAAE,UAAU,GAAG,EAAE,QAAQ,GAAG;AAAA,IACrD,MAAM,WAAW,KAAK,IAAI,QAAQ,EAAE;AAAA,IACpC,KAAK,IACJ,QAAQ,IACR,aAAa,YACV,UACA,KAAK,UAAU,SAAS,SAAS,WAAW,QAAQ,QAAQ,CAChE;AAAA,EACD;AAAA,EACA,OAAO,EAAE,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE;AAAA;AAKhC,IAAM,iBAAiB,CAAC,UAC9B,MAAM,SAAS,OACd,CAAC,OAAO,YAAa,QAAQ,UAAU,QAAQ,IAAI,OACnD,CACD;AAcM,IAAM,UAAU,CAAC,UAAgC;AAAA,EACvD,MAAM,OAAO,IAAI,IAChB,MAAM,SAAS,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,OAAO,CAAC,CACtD;AAAA,EAIA,MAAM,OAAO,IAAI;AAAA,EACjB,WAAW,WAAW,MAAM,UAAU;AAAA,IACrC,IAAI,QAAQ,SAAS;AAAA,MACpB;AAAA,IACD;AAAA,IACA,IAAI,SAAS,QAAQ;AAAA,IACrB,OAAO,WAAW,QAAQ,CAAC,KAAK,IAAI,MAAM,GAAG;AAAA,MAC5C,MAAM,SAAS,KAAK,IAAI,MAAM;AAAA,MAC9B,IAAI,WAAW,aAAa,CAAC,OAAO,SAAS;AAAA,QAC5C;AAAA,MACD;AAAA,MACA,KAAK,IAAI,MAAM;AAAA,MACf,SAAS,OAAO;AAAA,IACjB;AAAA,EACD;AAAA,EACA,OAAO;AAAA,IACN,UAAU,MAAM,SAAS,OACxB,CAAC,YAAY,CAAC,QAAQ,WAAW,KAAK,IAAI,QAAQ,EAAE,CACrD;AAAA,EACD;AAAA;AAmBM,IAAM,iBAAiB,CAC7B,SACA,YACc;AAAA,EACd,MAAM,WAAW,IAAI;AAAA,EAIrB,MAAM,UAAU,IAAI;AAAA,EACpB,IAAI,QAAQ;AAAA,EACZ,IAAI,YAAY,WAAW;AAAA,IAC1B,WAAW,WAAW,QAAQ,UAAU;AAAA,MACvC,SAAS,IAAI,QAAQ,IAAI,OAAO;AAAA,MAChC,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK;AAAA,IACtC;AAAA,EACD;AAAA,EAEA,MAAM,UAAU,MACf,WAAU,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,QAAQ,OAAO;AAAA,EAEvE,MAAM,SAAS,CAAC,OAAe,UAAkB;AAAA,IAChD,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,QAAQ,SAAS,IAAI,OAAQ,KAAK,QAAQ,IAAI,MAAM;AAAA,IACxD,WAAW,QAAQ,CAAC,GAAG,KAAK,GAAG;AAAA,MAC9B,SAAS;AAAA,MACT,MAAM,UAAuB;AAAA,QAC5B,IAAI,GAAG,WAAW;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP,SAAS;AAAA,MACV;AAAA,MACA,SAAS,IAAI,QAAQ,IAAI,OAAO;AAAA,MAChC,QAAQ,IAAI,QAAQ,IAAI,OAAO;AAAA,MAC/B,QAAQ,QAAQ;AAAA,IACjB;AAAA;AAAA,EAGD,MAAM,SAAS,CAAC,OAAe,UAAkB;AAAA,IAChD,MAAM,OAAO,QAAQ;AAAA,IACrB,SAAS,SAAS,EAAG,SAAS,OAAO,UAAU,GAAG;AAAA,MACjD,MAAM,SAAS,KAAK,QAAQ;AAAA,MAC5B,IAAI,WAAW,WAAW;AAAA,QACzB,MAAM,aAAa,KAAK,QAAQ,SAAS,KAAK;AAAA,QAC9C,SAAS,IAAI,OAAO,IAAI,UAAU;AAAA,QAClC,QAAQ,IAAI,OAAO,IAAI,UAAU;AAAA,MAClC;AAAA,IACD;AAAA;AAAA,EAGD,OAAO;AAAA,IACN,MAAM,MAAM,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,IACvD;AAAA,IACA,QAAQ;AAAA,IACR,OAAO,CAAC,UAAU;AAAA,MACjB,WAAW,WAAW,MAAM,UAAU;AAAA,QACrC,MAAM,WAAW,SAAS,IAAI,QAAQ,EAAE;AAAA,QACxC,SAAS,IACR,QAAQ,IACR,aAAa,YACV,UACA;AAAA,aACG;AAAA,UACH,SAAS,SAAS,WAAW,QAAQ;AAAA,QACtC,CACH;AAAA,QACA,QAAQ,KAAK,IAAI,OAAO,QAAQ,KAAK;AAAA,MACtC;AAAA;AAAA,IAKD,SAAS,CAAC,SAAS;AAAA,MAClB,MAAM,UAAU,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,CAAC;AAAA,MAC3D,IAAI,YAAY,MAAM;AAAA,QACrB;AAAA,MACD;AAAA,MACA,IAAI,SAAS;AAAA,MACb,MAAM,YAAY,KAAK,IAAI,QAAQ,QAAQ,KAAK,MAAM;AAAA,MACtD,OAAO,SAAS,aAAa,QAAQ,YAAY,KAAK,SAAS;AAAA,QAC9D,UAAU;AAAA,MACX;AAAA,MACA,IAAI,SAAS;AAAA,MACb,OACC,SAAS,YAAY,UACrB,QAAQ,QAAQ,SAAS,IAAI,YAC5B,KAAK,KAAK,SAAS,IAAI,SACvB;AAAA,QACD,UAAU;AAAA,MACX;AAAA,MACA,MAAM,UAAU,QAAQ,SAAS,SAAS;AAAA,MAC1C,IAAI,UAAU,GAAG;AAAA,QAChB,OAAO,QAAQ,OAAO;AAAA,MACvB;AAAA,MACA,MAAM,WAAW,KAAK,MAAM,QAAQ,KAAK,SAAS,MAAM;AAAA,MACxD,IAAI,SAAS,SAAS,GAAG;AAAA,QACxB,OAAO,QAAQ,QAAQ;AAAA,MACxB;AAAA;AAAA,IAED,OAAO,OAAO,EAAE,UAAU,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE;AAAA,IACjD,WAAW,MAAM;AAAA,MAChB,MAAM,QAAQ,EAAE,UAAU,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE;AAAA,MAChD,QAAQ,MAAM;AAAA,MAEd,OAAO;AAAA;AAAA,EAET;AAAA;AAQM,IAAM,UAAsC;AAAA,EAClD;AAAA,EACA,QAAQ;AAAA,EACR,OAAO,OAAO,EAAE,UAAU,CAAC,EAAE;AAAA,EAC7B,OAAO;AAAA,EACP;AACD;",
+  "debugId": "069846F8A56300A364756E2164756E21",
   "names": []
 }

package/dist/crdt/list.d.ts

@@ -0,0 +1,37 @@
+/**
+ * An ordered list CRDT — the same RGA sequence type as the collaborative text,
+ * but over arbitrary items instead of characters. Concurrent inserts and deletes
+ * at any position merge without conflict and converge. State-based, with delta
+ * support (`takeDelta`) so a client uploads only its new ops.
+ */
+export type ListElement<T> = {
+    id: string;
+    replica: string;
+    clock: number;
+    after: string | null;
+    value: T;
+    deleted: boolean;
+};
+export type ListState<T> = {
+    elements: ListElement<T>[];
+};
+/** The visible items of a list-CRDT state. Pure. */
+export declare const listOf: <T>(state: ListState<T>) => T[];
+/** Merge two list-CRDT states (commutative/idempotent). Pure. */
+export declare const mergeListState: <T>(a: ListState<T>, b: ListState<T>) => ListState<T>;
+export type ListCrdt<T> = {
+    /** The current visible items. */
+    list: () => T[];
+    /** Insert `items` at visible `index`. */
+    insert: (index: number, items: T[]) => void;
+    /** Tombstone `count` visible items from `index`. */
+    delete: (index: number, count: number) => void;
+    /** Merge another replica's state in. */
+    merge: (state: ListState<T>) => void;
+    /** The full serializable state (for hydration). */
+    state: () => ListState<T>;
+    /** The locally-authored ops since the last call, then clears the buffer. */
+    takeDelta: () => ListState<T>;
+};
+/** Create a live ordered-list CRDT for `replica`. */
+export declare const createList: <T>(replica: string, initial?: ListState<T>) => ListCrdt<T>;

package/dist/crdt/lwwMap.d.ts

@@ -0,0 +1,24 @@
+/**
+ * A last-write-wins map (LWW-Map) — a CRDT key→value map. Each key is an
+ * independent LWW register: the write (set or delete) with the highest timestamp
+ * wins, ties broken by replica id. `delete` is a tombstone so it can lose to a
+ * later concurrent `set`. State-based: `merge` is per-key LWW.
+ */
+export type LwwMapEntry<V> = {
+    value?: V;
+    deleted: boolean;
+    timestamp: number;
+    replica: string;
+};
+export type LwwMapState<V> = Record<string, LwwMapEntry<V>>;
+export declare const lwwMap: {
+    create: <V>() => LwwMapState<V>;
+    set: <V>(state: LwwMapState<V>, key: string, value: V, replica: string, timestamp?: number) => LwwMapState<V>;
+    delete: <V>(state: LwwMapState<V>, key: string, replica: string, timestamp?: number) => LwwMapState<V>;
+    get: <V>(state: LwwMapState<V>, key: string) => V | undefined;
+    has: <V>(state: LwwMapState<V>, key: string) => boolean;
+    keys: <V>(state: LwwMapState<V>) => string[];
+    entries: <V>(state: LwwMapState<V>) => [string, V][];
+    /** Per-key last-write-wins (commutative/idempotent). */
+    merge: <V>(a: LwwMapState<V>, b: LwwMapState<V>) => LwwMapState<V>;
+};

package/dist/crdt/orSet.d.ts

@@ -0,0 +1,26 @@
+/**
+ * An observed-remove set (OR-Set) — a CRDT set where concurrent add/remove of an
+ * element resolves **add-wins**: each `add` tags the element with a unique tag,
+ * and `remove` only retracts the tags it has observed, so a concurrent add (a new
+ * tag) survives. State-based: `merge` is union of tags minus removed tags.
+ */
+export type OrSetState<T> = {
+    /** Each add: the value plus the unique tag that observed it. */
+    adds: {
+        value: T;
+        tag: string;
+    }[];
+    /** Tags retracted by `remove`. */
+    removed: string[];
+};
+export declare const orSet: {
+    create: <T>() => OrSetState<T>;
+    add: <T>(state: OrSetState<T>, value: T, tag?: string) => OrSetState<T>;
+    /** Retract every tag currently observed for `value` (add-wins on re-add). */
+    remove: <T>(state: OrSetState<T>, value: T, equals?: (a: T, b: T) => boolean) => OrSetState<T>;
+    has: <T>(state: OrSetState<T>, value: T, equals?: (a: T, b: T) => boolean) => boolean;
+    /** The live, de-duplicated members. */
+    values: <T>(state: OrSetState<T>, equals?: (a: T, b: T) => boolean) => T[];
+    /** Union the observed tags and the removed tags (commutative/idempotent). */
+    merge: <T>(a: OrSetState<T>, b: OrSetState<T>) => OrSetState<T>;
+};