@sovereignbase/convergent-replicated-list 1.0.3 → 1.0.5

package/README.md

@@ -7,6 +7,10 @@
 
 Convergent Replicated List (CR-List), a delta CRDT for an ordered sequence of entries.
 
+Read the specification:
+
+- https://sovereignbase.dev/convergent-replicated-list
+
 ## Compatibility
 
 - Runtimes: Node >= 20, modern browsers, Bun, Deno, Cloudflare Workers, Edge Runtime.
@@ -127,8 +131,8 @@ list[0] = 'up'
 list.append('dude!')
 list.prepend('What is')
 
-const serialized = JSON.stringify(list)
-const restored = new CRList<string>(JSON.parse(serialized))
+const snapshotJson = JSON.stringify(list)
+const restored = new CRList<string>(JSON.parse(snapshotJson))
 
 for (const value of list) {
   console.log(value)
@@ -145,6 +149,11 @@ list.forEach((value, index, target) => {
 console.log([...restored]) // ['What is', 'up', 'dude!']
 ```
 
+This example assumes your list values are JSON-compatible. For general
+`structuredClone`-compatible values such as `Date`, `Map`, or `BigInt`, persist
+snapshots with a structured-clone-capable store or an application-level codec
+instead of plain `JSON.stringify` / `JSON.parse`.
+
 Numeric reads, `for...of`, and `forEach()` return detached copies of visible
 values. Mutating those returned values does not mutate the underlying replica
 state.
@@ -200,17 +209,18 @@ import {
   type CRListSnapshot,
 } from '@sovereignbase/convergent-replicated-list'
 
-const replica = __create<string>()
-const local = __update(0, ['hello', 'world'], replica, 'after')
+const source = __create<string>()
+const target = __create<string>()
+const local = __update(0, ['hello', 'world'], source, 'after')
 
 if (local) {
   const outgoing: CRListDelta<string> = local.delta
-  const remoteChange = __merge(replica, outgoing)
+  const remoteChange = __merge(target, outgoing)
 
   console.log(remoteChange)
 }
 
-const snapshot: CRListSnapshot<string> = __snapshot(replica)
+const snapshot: CRListSnapshot<string> = __snapshot(target)
 console.log(snapshot)
 ```
 
@@ -243,10 +253,13 @@ Ingress stays tolerant:
 
 ### Safety and copying semantics
 
-- Snapshots are serializable full-state payloads.
-- Deltas are serializable gossip payloads.
+- Snapshots are detached structured-clone full-state payloads.
+- Deltas are detached structured-clone gossip payloads intended to be forwarded
+  as-is.
 - `change` is a minimal index-keyed local patch.
-- `toJSON()` returns a detached serializable snapshot.
+- `toJSON()` returns a detached structured-clone snapshot.
+- `JSON.stringify()` and `toString()` are only reliable when list values are
+  JSON-compatible.
 - Numeric reads, `for...of`, and `forEach()` expose detached copies of visible values rather than mutable references into replica state.
 - `for...of`, `forEach()`, numeric indexing, `append()`, `prepend()`, `remove()`, `merge()`, `snapshot()`, `acknowledge()`, and `garbageCollect()` all operate on the live list projection.
 

package/dist/index.cjs

@@ -134,9 +134,10 @@ function flattenAndLinkTrustedState(crListReplica) {
   crListReplica.size = crListReplica.parentMap.size;
 }
 
-// src/.helpers/snapshotValueToLinkedListValue/index.ts
+// src/.helpers/transformSnapshotEntryToStateEntry/index.ts
 var _utils = require('@sovereignbase/utils');
-function snapshotValueToLinkedListValue(valueEntry, crListReplica) {
+function transformSnapshotEntryToStateEntry(valueEntry, crListReplica) {
+  if (valueEntry === null || valueEntry === void 0) return void 0;
   if (!_utils.isUuidV7.call(void 0, valueEntry.uuidv7) || crListReplica.tombstones.has(valueEntry.uuidv7) || crListReplica.parentMap.has(valueEntry.uuidv7) || !_utils.isUuidV7.call(void 0, valueEntry.predecessor) && valueEntry.predecessor !== "\0" && !crListReplica.tombstones.has(valueEntry.predecessor))
     return void 0;
   const [cloned, copiedValue] = _utils.safeStructuredClone.call(void 0, valueEntry.value);
@@ -235,7 +236,7 @@ function __create(snapshot) {
   if (!Object.hasOwn(snapshot, "values") || !Array.isArray(snapshot.values))
     return crListReplica;
   for (const valueEntry of snapshot.values) {
-    const linkedListEntry = snapshotValueToLinkedListValue(
+    const linkedListEntry = transformSnapshotEntryToStateEntry(
       valueEntry,
       crListReplica
     );
@@ -300,7 +301,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
           insertBetween(crListReplica.cursor, linkedListEntry, void 0);
           void updateEntryToMaps(crListReplica, linkedListEntry, delta);
           crListReplica.cursor = linkedListEntry;
-          change[linkedListEntry.index] = linkedListEntry.value;
+          change[linkedListEntry.index] = structuredClone(linkedListEntry.value);
           break;
         }
         void walkToIndex(listIndex, crListReplica);
@@ -330,14 +331,14 @@ function __update(listIndex, listValues, crListReplica, mode) {
         entryToOverwrite.next = void 0;
         entryToOverwrite.prev = void 0;
         crListReplica.cursor = linkedListEntry;
-        change[linkedListEntry.index] = linkedListEntry.value;
+        change[linkedListEntry.index] = structuredClone(linkedListEntry.value);
         break;
       }
       case "after": {
         if (crListReplica.size === 0 && listIndex === 0) {
           crListReplica.cursor = linkedListEntry;
           void updateEntryToMaps(crListReplica, linkedListEntry, delta);
-          change[linkedListEntry.index] = linkedListEntry.value;
+          change[linkedListEntry.index] = structuredClone(linkedListEntry.value);
           break;
         }
         if (listIndex === crListReplica.size) {
@@ -363,14 +364,14 @@ function __update(listIndex, listValues, crListReplica, mode) {
         }
         void updateEntryToMaps(crListReplica, linkedListEntry, delta);
         crListReplica.cursor = linkedListEntry;
-        change[linkedListEntry.index] = linkedListEntry.value;
+        change[linkedListEntry.index] = structuredClone(linkedListEntry.value);
         break;
       }
       case "before": {
         if (crListReplica.size === 0 && listIndex === 0) {
           crListReplica.cursor = linkedListEntry;
           void updateEntryToMaps(crListReplica, linkedListEntry, delta);
-          change[linkedListEntry.index] = linkedListEntry.value;
+          change[linkedListEntry.index] = structuredClone(linkedListEntry.value);
           mode = "after";
           listIndex = linkedListEntry.index - 1;
           break;
@@ -392,7 +393,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
         }
         void updateEntryToMaps(crListReplica, linkedListEntry, delta);
         crListReplica.cursor = linkedListEntry;
-        change[linkedListEntry.index] = linkedListEntry.value;
+        change[linkedListEntry.index] = structuredClone(linkedListEntry.value);
         mode = "after";
         listIndex = linkedListEntry.index - 1;
         break;
@@ -468,6 +469,7 @@ function __merge(crListReplica, crListDelta) {
     return change;
   }
   for (const valueEntry of crListDelta.values) {
+    if (valueEntry === null || valueEntry === void 0) continue;
     const existingEntry = crListReplica.parentMap.get(valueEntry.uuidv7);
     if (existingEntry) {
       if (crListReplica.tombstones.has(valueEntry.uuidv7) || !_utils.isUuidV7.call(void 0, valueEntry.predecessor) && valueEntry.predecessor !== "\0")
@@ -482,7 +484,7 @@ function __merge(crListReplica, crListDelta) {
       void newVals.push(existingEntry);
       continue;
     }
-    const linkedListEntry = snapshotValueToLinkedListValue(
+    const linkedListEntry = transformSnapshotEntryToStateEntry(
       valueEntry,
       crListReplica
     );
@@ -516,28 +518,30 @@ function __merge(crListReplica, crListDelta) {
     change[index] = void 0;
   }
   for (const val of newVals) {
-    change[val.index] = val.value;
+    change[val.index] = structuredClone(val.value);
   }
   return change;
 }
 
 // src/core/mags/acknowledge/index.ts
 function __acknowledge(crListReplica) {
-  let frontier = false;
+  let largest = false;
   crListReplica.tombstones.forEach((tombstone) => {
-    if (frontier === false || frontier < tombstone) frontier = tombstone;
+    if (largest === false || largest < tombstone) largest = tombstone;
   });
-  if (typeof frontier === "string") return frontier;
+  if (typeof largest === "string") return largest;
   return false;
 }
 
 // src/core/mags/garbageCollect/index.ts
+
 function __garbageCollect(frontiers, crListReplica) {
   if (!Array.isArray(frontiers)) return;
-  const frontier = frontiers.sort().shift();
-  if (typeof frontier !== "string") return;
+  frontiers.sort();
+  const smallest = frontiers.find((frontier) => _utils.isUuidV7.call(void 0, frontier));
+  if (typeof smallest !== "string") return;
   crListReplica.tombstones.forEach((tombstone, __, tombstones) => {
-    if (tombstone <= frontier) {
+    if (tombstone <= smallest) {
       tombstones.delete(tombstone);
     }
   });
@@ -563,7 +567,7 @@ function __snapshot(crListReplica) {
 // src/CRList/class.ts
 var CRList = class {
   /**
-   * Creates a replicated list from an optional serializable snapshot.
+   * Creates a replicated list from an optional detached structured-clone-compatible snapshot.
    *
    * @param snapshot - A previously emitted CRList snapshot.
    */
@@ -609,7 +613,8 @@ var CRList = class {
               new CustomEvent("change", { detail: change })
             );
           return true;
-        } catch (e2) {
+        } catch (error) {
+          if (error instanceof CRListError) throw error;
           return false;
         }
       },
@@ -631,7 +636,8 @@ var CRList = class {
             );
           }
           return true;
-        } catch (e3) {
+        } catch (error) {
+          if (error instanceof CRListError) throw error;
           return false;
         }
       },
@@ -759,7 +765,7 @@ var CRList = class {
     void __garbageCollect(frontiers, this.state);
   }
   /**
-   * Emits the current serializable list snapshot.
+   * Emits the current detached structured-clone-compatible list snapshot.
    */
   snapshot() {
     const snapshot = __snapshot(this.state);
@@ -797,7 +803,7 @@ var CRList = class {
     );
   }
   /**
-   * Returns a serializable snapshot representation of this list.
+   * Returns a detached structured-clone-compatible snapshot of this list.
    *
    * Called automatically by `JSON.stringify`.
    */
@@ -805,7 +811,9 @@ var CRList = class {
     return __snapshot(this.state);
   }
   /**
-   * Returns this list as a JSON string.
+   * Attempts to return this list snapshot as a JSON string.
+   *
+   * This can fail when list values are not JSON-compatible.
    */
   toString() {
     return JSON.stringify(this);
@@ -856,5 +864,6 @@ var CRList = class {
 
 
 
-exports.CRList = CRList; exports.__acknowledge = __acknowledge; exports.__create = __create; exports.__delete = __delete; exports.__garbageCollect = __garbageCollect; exports.__merge = __merge; exports.__read = __read; exports.__snapshot = __snapshot; exports.__update = __update;
+
+exports.CRList = CRList; exports.CRListError = CRListError; exports.__acknowledge = __acknowledge; exports.__create = __create; exports.__delete = __delete; exports.__garbageCollect = __garbageCollect; exports.__merge = __merge; exports.__read = __read; exports.__snapshot = __snapshot; exports.__update = __update;
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/convergent-replicated-list/convergent-replicated-list/dist/index.cjs","../src/.helpers/assertListIndices/index.ts","../src/.errors/class.ts","../src/.helpers/walkToIndex/index.ts","../src/.helpers/insertBetween/index.ts","../src/.helpers/flattenAndLinkTrustedState/index.ts","../src/.helpers/snapshotValueToLinkedListValue/index.ts","../src/.helpers/updateEntryToMaps/index.ts","../src/.helpers/deleteEntryFromMaps/index.ts","../src/.helpers/deleteLinkedEntry/index.ts","../src/.helpers/moveEntryToPredecessor/index.ts","../src/.helpers/indexFromPropertyKey/index.ts","../src/core/crud/create/index.ts","../src/core/crud/read/index.ts","../src/core/crud/update/index.ts","../src/core/crud/delete/index.ts","../src/core/mags/merge/index.ts","../src/core/mags/acknowledge/index.ts","../src/core/mags/garbageCollect/index.ts","../src/core/mags/snapshot/index.ts","../src/CRList/class.ts"],"names":["isUuidV7"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;ACfO,SAAS,iBAAA,CAAqB,aAAA,EAAqC;AACxE,EAAA,GAAA,CAAI,CAAC,aAAA,CAAc,MAAA,EAAQ,MAAA;AAC3B,EAAA,IAAI,MAAA,EAAQ,aAAA,CAAc,IAAA;AAC1B,EAAA,MAAA,CAAO,aAAA,CAAc,MAAA,CAAO,IAAA;AAC1B,IAAA,aAAA,CAAc,OAAA,EAAS,aAAA,CAAc,MAAA,CAAO,IAAA;AAE9C,EAAA,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG;AACjB,IAAA,KAAA,EAAA;AACA,IAAA,aAAA,CAAc,MAAA,CAAO,MAAA,EAAQ,KAAA;AAC7B,IAAA,GAAA,CAAI,aAAA,CAAc,MAAA,CAAO,KAAA,IAAS,KAAA,CAAA,EAAW,KAAA;AAC7C,IAAA,aAAA,CAAc,OAAA,EAAS,aAAA,CAAc,MAAA,CAAO,IAAA;AAAA,EAC9C;AACF;ADgBA;AACA;AElBO,IAAM,YAAA,EAAN,MAAA,QAA0B,MAAM;AAAA;AAAA;AAAA;AAAA,EAI5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQT,WAAA,CAAY,IAAA,EAAuB,OAAA,EAAkB;AACnD,IAAA,MAAM,OAAA,mBAAS,OAAA,UAAW,MAAA;AAC1B,IAAA,KAAA,CAAM,CAAA,4CAAA,EAA+C,MAAM,CAAA,CAAA;AAC/C,IAAA;AACA,IAAA;AACd,EAAA;AACF;AFmBgE;AACA;AG7CxD;AAC8C,EAAA;AACL,IAAA;AAC5B,EAAA;AACkC,IAAA;AACQ,EAAA;AACC,EAAA;AACP,IAAA;AACvD,EAAA;AACF;AH+CgE;AACA;AIzDxD;AACiB,EAAA;AACA,EAAA;AACD,EAAA;AACA,EAAA;AACxB;AJ2DgE;AACA;AKrEa;AACpD,EAAA;AAC6B,EAAA;AACE,EAAA;AACxC,IAAA;AACC,IAAA;AACA,IAAA;AACf,EAAA;AACmD,EAAA;AACrC,IAAA;AACd,EAAA;AACkB,EAAA;AACE,EAAA;AACJ,IAAA;AAC4B,IAAA;AACiB,MAAA;AACV,MAAA;AAChC,MAAA;AAEO,MAAA;AACkC,QAAA;AAIlD,MAAA;AAKS,MAAA;AAGb,QAAA;AAC2D,MAAA;AACxB,MAAA;AACV,MAAA;AACC,QAAA;AACkB,QAAA;AACrC,QAAA;AAC6C,QAAA;AACtC,UAAA;AACW,UAAA;AAClB,QAAA;AACO,UAAA;AACd,QAAA;AAC6C,QAAA;AACQ,QAAA;AACvC,QAAA;AACd,QAAA;AACF,MAAA;AACmC,MAAA;AACmB,MAAA;AACtB,QAAA;AACC,QAAA;AAEa,QAAA;AACrC,QAAA;AAEG,QAAA;AACI,UAAA;AACA,UAAA;AACgC,QAAA;AAChC,UAAA;AACW,UAAA;AAClB,QAAA;AACO,UAAA;AACd,QAAA;AACF,MAAA;AAC6C,MAAA;AACQ,MAAA;AACvC,MAAA;AAChB,IAAA;AACF,EAAA;AAC6C,EAAA;AAC/C;AL2DgE;AACA;AMnIlB;AAG5C;AAI2B,EAAA;AAMlB,IAAA;AAEoD,EAAA;AAEzC,EAAA;AACb,EAAA;AACc,IAAA;AACZ,IAAA;AACiB,IAAA;AACjB,IAAA;AACD,IAAA;AACA,IAAA;AACR,EAAA;AACF;ANyHgE;AACA;AOjJ9D;AAEoD,EAAA;AACL,EAAA;AACjC,EAAA;AACiB,IAAA;AACxB,EAAA;AACsD,IAAA;AACzD,MAAA;AACD,IAAA;AACH,EAAA;AAC0D,EAAA;AAC5C,EAAA;AACS,IAAA;AACK,MAAA;AACD,MAAA;AACM,MAAA;AAC9B,IAAA;AACL;APkJgE;AACA;AQzKxD;AAC+C,EAAA;AACN,EAAA;AAChC,EAAA;AAC+B,EAAA;AACJ,EAAA;AAC5C;AR2KgE;AACA;AS5K9D;AAE6B,EAAA;AACA,EAAA;AACsB,EAAA;AACW,EAAA;AACb,kBAAA;AAC3B,EAAA;AACZ,EAAA;AACI,IAAA;AACd,EAAA;AAC0D,EAAA;AAC7B,EAAA;AACI,IAAA;AACV,EAAA;AACA,EAAA;AACsB,EAAA;AAC/C;AT6KgE;AACA;AU9L9D;AAG0D,EAAA;AAC5B,EAAA;AAC4B,EAAA;AAC5D;AV8LgE;AACA;AW9M1C;AACyC,EAAA;AACpD,IAAA;AACqB,EAAA;AACuB,EAAA;AACvD;AXgNgE;AACA;AYxN5B;AA8BsC;AAClC,EAAA;AAC9B,IAAA;AACE,IAAA;AACoB,IAAA;AACiC,IAAA;AACS,IAAA;AACxE,EAAA;AAC0D,EAAA;AAK1C,EAAA;AAE+B,IAAA;AACc,MAAA;AACvD,QAAA;AACoC,MAAA;AACxC,IAAA;AACF,EAAA;AAGyD,EAAA;AAChD,IAAA;AAEiC,EAAA;AAChB,IAAA;AACtB,MAAA;AACA,MAAA;AACF,IAAA;AACsB,IAAA;AACkC,IAAA;AAC1D,EAAA;AAEgD,EAAA;AAET,EAAA;AAEhC,EAAA;AACT;AZkLgE;AACA;AahO/C;AACX,EAAA;AAC4C,IAAA;AACK,IAAA;AAC7C,EAAA;AACC,IAAA;AACT,EAAA;AACF;AbkOgE;AACA;AclQ5B;AAQP;AAkCiC;AACb,EAAA;AACF,IAAA;AAChB,EAAA;AACjB,IAAA;AACR,MAAA;AACA,MAAA;AACF,IAAA;AACkC,EAAA;AACH,EAAA;AAC0B,EAAA;AACvD,EAAA;AACgC,EAAA;AACyB,IAAA;AAEH,IAAA;AAEtC,IAAA;AAEwC,IAAA;AAChD,MAAA;AACD,MAAA;AACM,MAAA;AACN,MAAA;AACD,MAAA;AACA,MAAA;AACR,IAAA;AAEc,IAAA;AACM,MAAA;AACsB,QAAA;AACN,UAAA;AACL,YAAA;AACkB,YAAA;AACO,YAAA;AAChD,YAAA;AACF,UAAA;AACyD,UAAA;AACvB,UAAA;AACmB,UAAA;AACF,UAAA;AACK,UAAA;AACf,UAAA;AAClB,UAAA;AACyB,UAAA;AAChD,UAAA;AACF,QAAA;AAC4C,QAAA;AACV,QAAA;AACK,QAAA;AAEQ,QAAA;AACN,QAAA;AACzC,QAAA;AACmB,UAAA;AACjB,UAAA;AACiB,UAAA;AACnB,QAAA;AAC2B,QAAA;AACiB,UAAA;AACnC,YAAA;AACH,cAAA;AACiB,cAAA;AACD,cAAA;AAChB,cAAA;AACF,YAAA;AACF,UAAA;AACF,QAAA;AAC0D,QAAA;AACN,QAAA;AACN,wBAAA;AACa,QAAA;AACnC,QAAA;AACA,QAAA;AACD,QAAA;AACyB,QAAA;AAChD,QAAA;AACF,MAAA;AACc,MAAA;AACqC,QAAA;AACxB,UAAA;AACkB,UAAA;AACO,UAAA;AAChD,UAAA;AACF,QAAA;AACsC,QAAA;AACqB,UAAA;AACpD,QAAA;AACuC,UAAA;AAC9C,QAAA;AACkC,QAAA;AAG5B,QAAA;AAEQ,QAAA;AACuC,QAAA;AACF,QAAA;AACK,QAAA;AAC9C,QAAA;AAC8C,UAAA;AAC/C,YAAA;AACH,cAAA;AACA,cAAA;AACgB,cAAA;AAChB,cAAA;AACF,YAAA;AACF,UAAA;AACF,QAAA;AAC0D,QAAA;AACnC,QAAA;AACyB,QAAA;AAChD,QAAA;AACF,MAAA;AACe,MAAA;AACoC,QAAA;AACxB,UAAA;AACkB,UAAA;AACO,UAAA;AACzC,UAAA;AAC6B,UAAA;AACpC,UAAA;AACF,QAAA;AAC4C,QAAA;AACV,QAAA;AACA,QAAA;AACN,QAAA;AACiB,QAAA;AACC,QAAA;AACQ,QAAA;AACb,QAAA;AAClC,UAAA;AACH,YAAA;AACc,YAAA;AACE,YAAA;AAChB,YAAA;AACF,UAAA;AACF,QAAA;AAC0D,QAAA;AACnC,QAAA;AACyB,QAAA;AACzC,QAAA;AAC6B,QAAA;AAEpC,QAAA;AACF,MAAA;AACF,IAAA;AAC6C,IAAA;AAC7C,IAAA;AACF,EAAA;AACa,EAAA;AACS,IAAA;AACc,MAAA;AACN,MAAA;AAC5B,IAAA;AACqB,EAAA;AACzB;AdmNgE;AACA;Ae1XF;AAC3B,EAAA;AAC0B,EAAA;AAC3B,EAAA;AACiB,EAAA;AAI/C,EAAA;AAE2C,IAAA;AACc,EAAA;AAC9B,EAAA;AAEe,EAAA;AACV,EAAA;AAEe,EAAA;AACnC,EAAA;AAE2B,EAAA;AACG,IAAA;AAClB,IAAA;AAC+B,IAAA;AAC7C,IAAA;AACV,IAAA;AACF,EAAA;AAE6C,EAAA;AAE7B,EAAA;AACG,IAAA;AACC,IAAA;AACpB,EAAA;AAEuB,EAAA;AACzB;AfkXgE;AACA;AgB1a5B;AA4BT;AACgC,EAAA;AACC,EAAA;AAClB,EAAA;AACP,EAAA;AACf,EAAA;AAKF,EAAA;AAEkC,IAAA;AACW,MAAA;AACvD,QAAA;AACoC,MAAA;AACc,MAAA;AAC/B,MAAA;AAC4B,QAAA;AACS,QAAA;AAC1C,QAAA;AAChB,MAAA;AACF,IAAA;AACF,EAAA;AAKiB,EAAA;AAE0B,IAAA;AACF,IAAA;AACF,IAAA;AACnB,MAAA;AAClB,IAAA;AACO,IAAA;AACT,EAAA;AAE6C,EAAA;AACO,IAAA;AAC/B,IAAA;AAGbA,MAAAA;AAEF,QAAA;AACuD,MAAA;AACpD,MAAA;AACH,QAAA;AACA,QAAA;AACW,QAAA;AACb,MAAA;AACc,MAAA;AACiB,MAAA;AAC/B,MAAA;AACF,IAAA;AACwB,IAAA;AACtB,MAAA;AACA,MAAA;AACF,IAAA;AACsB,IAAA;AAGhB,IAAA;AAEkD,IAAA;AACvB,IAAA;AACyB,IAAA;AAC1B,MAAA;AACL,QAAA;AACsB,QAAA;AACxC,MAAA;AACS,QAAA;AAChB,MAAA;AACqD,IAAA;AAC9B,MAAA;AACqB,MAAA;AACzB,MAAA;AACI,MAAA;AACsB,MAAA;AACxC,IAAA;AACS,MAAA;AAChB,IAAA;AACF,EAAA;AACiB,EAAA;AAEiC,IAAA;AAET,IAAA;AACzC,EAAA;AAE0D,EAAA;AAErB,EAAA;AACnB,IAAA;AAClB,EAAA;AAC2B,EAAA;AACD,IAAA;AAC1B,EAAA;AAEO,EAAA;AACT;AhB2XgE;AACA;AiBzf3C;AACe,EAAA;AACc,EAAA;AACa,IAAA;AAC5D,EAAA;AACwC,EAAA;AAClC,EAAA;AACT;AjB2fgE;AACA;AkBjgBxD;AACyB,EAAA;AACS,EAAA;AACN,EAAA;AACe,EAAA;AACpB,IAAA;AACE,MAAA;AAC7B,IAAA;AACD,EAAA;AACH;AlBmgBgE;AACA;AmB5gB3C;AACZ,EAAA;AACgD,IAAA;AAC9B,MAAA;AACyB,QAAA;AACrC,QAAA;AACmB,UAAA;AACoB,UAAA;AACf,UAAA;AAC/B,QAAA;AACF,MAAA;AACF,IAAA;AAC+C,IAAA;AACjD,EAAA;AACF;AnB8gBgE;AACA;AoBrhBzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAeqB,EAAA;AACV,IAAA;AACrB,MAAA;AACsB,QAAA;AACf,QAAA;AACE,QAAA;AACJ,QAAA;AACZ,MAAA;AACa,MAAA;AACY,QAAA;AACX,QAAA;AACE,QAAA;AACJ,QAAA;AACZ,MAAA;AACD,IAAA;AAEsB,IAAA;AACQ,MAAA;AACiB,QAAA;AAEY,QAAA;AACnB,QAAA;AACvC,MAAA;AACmB,MAAA;AAC2B,QAAA;AAEY,QAAA;AACN,QAAA;AACpD,MAAA;AAC0B,MAAA;AACoB,QAAA;AACR,QAAA;AAChC,QAAA;AACiD,UAAA;AAC/B,UAAA;AACM,UAAA;AACtB,UAAA;AACsB,YAAA;AACoB,cAAA;AAC5C,YAAA;AACE,UAAA;AACsB,YAAA;AACsB,cAAA;AAC9C,YAAA;AACK,UAAA;AACD,QAAA;AACC,UAAA;AACT,QAAA;AACF,MAAA;AAC8B,MAAA;AACgB,QAAA;AACR,QAAA;AAChC,QAAA;AAC+C,UAAA;AAC7B,UAAA;AACM,UAAA;AACf,UAAA;AACe,YAAA;AACoB,cAAA;AAC5C,YAAA;AACF,UAAA;AACY,UAAA;AACc,YAAA;AACsB,cAAA;AAC9C,YAAA;AACF,UAAA;AACO,UAAA;AACD,QAAA;AACC,UAAA;AACT,QAAA;AACF,MAAA;AACgB,MAAA;AACP,QAAA;AACoB,UAAA;AAC4B,UAAA;AACvD,QAAA;AACF,MAAA;AAEwC,MAAA;AACM,QAAA;AAEY,QAAA;AAC/C,UAAA;AACgC,YAAA;AAC3B,YAAA;AACE,YAAA;AACE,YAAA;AAChB,UAAA;AACF,QAAA;AAEqD,QAAA;AACvD,MAAA;AACD,IAAA;AACH,EAAA;AAAA;AAAA;AAAA;AAImB,EAAA;AACC,IAAA;AACpB,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAS8C,EAAA;AACe,IAAA;AAC9C,IAAA;AACa,IAAA;AACtB,IAAA;AACoB,MAAA;AACsB,QAAA;AAC5C,MAAA;AACE,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAS4C,EAAA;AAC3B,IAAA;AACY,uBAAA;AACnB,MAAA;AACD,MAAA;AACL,MAAA;AACF,IAAA;AACa,IAAA;AACa,IAAA;AACtB,IAAA;AACoB,MAAA;AACsB,QAAA;AAC5C,MAAA;AACE,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAM4B,EAAA;AAC0B,IAAA;AACvC,IAAA;AACa,IAAA;AACtB,IAAA;AACoB,MAAA;AACsB,QAAA;AAC5C,MAAA;AACE,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQmC,EAAA;AACO,IAAA;AACpC,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAIoB,EAAA;AACkB,IAAA;AAChC,IAAA;AACoB,MAAA;AACkB,QAAA;AACxC,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMkD,EAAA;AACL,IAAA;AAC7C,EAAA;AAAA;AAAA;AAAA;AAIiB,EAAA;AAC0B,IAAA;AACrC,IAAA;AACoB,MAAA;AAC4B,QAAA;AAClD,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYQ,EAAA;AACW,IAAA;AACf,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaQ,EAAA;AACW,IAAA;AACf,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAM4B,EAAA;AACK,IAAA;AACjC,EAAA;AAAA;AAAA;AAAA;AAImB,EAAA;AACS,IAAA;AAC5B,EAAA;AAAA;AAAA;AAAA;AAIgE,EAAA;AAC3C,IAAA;AACrB,EAAA;AAAA;AAAA;AAAA;AAIwD,EAAA;AACnC,IAAA;AACrB,EAAA;AAAA;AAAA;AAAA;AAI0C,EAAA;AACQ,IAAA;AACtB,MAAA;AAClB,MAAA;AACR,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaQ,EAAA;AAC0C,IAAA;AACC,MAAA;AACjD,IAAA;AACF,EAAA;AACF;ApB4fgE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/home/runner/work/convergent-replicated-list/convergent-replicated-list/dist/index.cjs","sourcesContent":[null,"import type { CRListState } from '../../.types/index.js'\n\nexport function assertListIndices<T>(crListReplica: CRListState<T>): void {\n  if (!crListReplica.cursor) return\n  let index = crListReplica.size\n  while (crListReplica.cursor.next)\n    crListReplica.cursor = crListReplica.cursor.next\n\n  while (index >= 1) {\n    index--\n    crListReplica.cursor.index = index\n    if (crListReplica.cursor.prev === undefined) break\n    crListReplica.cursor = crListReplica.cursor.prev\n  }\n}\n","/**\n * Error codes thrown by {@link CRList}.\n */\nexport type CRListErrorCode =\n  | 'VALUE_NOT_CLONEABLE'\n  | 'INDEX_OUT_OF_BOUNDS'\n  | 'LIST_EMPTY'\n  | 'LIST_INTEGRITY_VIOLATION'\n  | 'UPDATE_EXPECTED_AN_ARRAY'\n\n/**\n * Represents a typed CRList runtime error.\n */\nexport class CRListError extends Error {\n  /**\n   * The semantic error code for the failure.\n   */\n  readonly code: CRListErrorCode\n\n  /**\n   * Creates a typed CRList error.\n   *\n   * @param code - The semantic error code.\n   * @param message - An optional human-readable detail message.\n   */\n  constructor(code: CRListErrorCode, message?: string) {\n    const detail = message ?? code\n    super(`{@sovereignbase/convergent-replicated-list} ${detail}`)\n    this.code = code\n    this.name = 'CRListError'\n  }\n}\n","import type { CRListState } from '../../.types/index.js'\nimport { CRListError } from '../../.errors/class.js'\n\nexport function walkToIndex<T>(\n  targetIndex: number,\n  crListReplica: CRListState<T>\n): void {\n  if (targetIndex < 0 || targetIndex >= crListReplica.size)\n    throw new CRListError('INDEX_OUT_OF_BOUNDS', 'Index out of bounds')\n  if (!crListReplica.cursor)\n    throw new CRListError('LIST_EMPTY', 'List is empty')\n  const direction = crListReplica.cursor.index > targetIndex ? 'prev' : 'next'\n  while (crListReplica.cursor && crListReplica.cursor.index !== targetIndex) {\n    crListReplica.cursor = crListReplica.cursor[direction]\n  }\n}\n","import type { CRListStateEntry } from '../../.types/index.js'\n\nexport function insertBetween<T>(\n  prev: CRListStateEntry<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  next: CRListStateEntry<T>\n): void {\n  linkedListEntry.prev = prev\n  linkedListEntry.next = next\n  if (prev) prev.next = linkedListEntry\n  if (next) next.prev = linkedListEntry\n}\n","import type { CRListState, CRListStateEntry } from '../../.types/index.js'\nimport { insertBetween } from '../insertBetween/index.js'\nexport function flattenAndLinkTrustedState<T>(crListReplica: CRListState<T>) {\n  crListReplica.cursor = undefined\n  const resolvedSiblingPredecessors = new Set<string>()\n  for (const entry of crListReplica.parentMap.values()) {\n    if (!entry) continue\n    entry.prev = undefined\n    entry.next = undefined\n  }\n  const keys = [...crListReplica.childrenMap.keys()].sort((a, b) =>\n    a > b ? 1 : -1\n  )\n  let hasProgress = true\n  while (hasProgress) {\n    hasProgress = false\n    for (const predecessorIdentifier of keys) {\n      if (resolvedSiblingPredecessors.has(predecessorIdentifier)) continue\n      const siblings = crListReplica.childrenMap.get(predecessorIdentifier)\n      if (!siblings) continue\n\n      if (siblings.length > 1)\n        siblings.sort((a, b) => (a.uuidv7 > b.uuidv7 ? 1 : -1))\n\n      const predecessor =\n        predecessorIdentifier === '\\0'\n          ? undefined\n          : crListReplica.parentMap.get(predecessorIdentifier)\n      if (\n        predecessor &&\n        !predecessor.prev &&\n        !predecessor.next &&\n        crListReplica.cursor !== predecessor\n      )\n        continue\n      let prev: CRListStateEntry<T> = predecessor ?? crListReplica.cursor\n      const predecessorNext = predecessor?.next\n      if (siblings.length === 1) {\n        const sibling = siblings[0]\n        insertBetween<T>(prev, sibling, sibling.next)\n        prev = sibling\n        if (predecessorNext && predecessorNext !== sibling) {\n          prev.next = predecessorNext\n          predecessorNext.prev = prev\n        } else {\n          prev.next = undefined\n        }\n        if (!predecessorNext) crListReplica.cursor = prev\n        resolvedSiblingPredecessors.add(predecessorIdentifier)\n        hasProgress = true\n        continue\n      }\n      const siblingSet = new Set(siblings)\n      for (let index = 0; index < siblings.length; index++) {\n        const sibling = siblings[index]\n        const next = siblings[index + 1]\n\n        insertBetween<T>(prev, sibling, sibling.next)\n        prev = sibling\n\n        if (next) {\n          prev.next = next\n          next.prev = prev\n        } else if (predecessorNext && !siblingSet.has(predecessorNext)) {\n          prev.next = predecessorNext\n          predecessorNext.prev = prev\n        } else {\n          prev.next = undefined\n        }\n      }\n      if (!predecessorNext) crListReplica.cursor = prev\n      resolvedSiblingPredecessors.add(predecessorIdentifier)\n      hasProgress = true\n    }\n  }\n  crListReplica.size = crListReplica.parentMap.size\n}\n","import type {\n  CRListState,\n  CRListSnapshotEntry,\n  CRListStateEntry,\n} from '../../.types/index.js'\nimport { isUuidV7, safeStructuredClone } from '@sovereignbase/utils'\nexport function snapshotValueToLinkedListValue<T>(\n  valueEntry: CRListSnapshotEntry<T>,\n  crListReplica: CRListState<T>\n): CRListStateEntry<T> {\n  if (\n    !isUuidV7(valueEntry.uuidv7) ||\n    crListReplica.tombstones.has(valueEntry.uuidv7) ||\n    crListReplica.parentMap.has(valueEntry.uuidv7) ||\n    (!isUuidV7(valueEntry.predecessor) &&\n      valueEntry.predecessor !== '\\0' &&\n      !crListReplica.tombstones.has(valueEntry.predecessor))\n  )\n    return undefined\n\n  const [cloned, copiedValue] = safeStructuredClone(valueEntry.value)\n\n  if (!cloned) return undefined\n  return {\n    uuidv7: valueEntry.uuidv7,\n    value: copiedValue,\n    predecessor: valueEntry.predecessor,\n    index: 0,\n    next: undefined,\n    prev: undefined,\n  }\n}\n","import type {\n  CRListState,\n  CRListStateEntry,\n  CRListDelta,\n} from '../../.types/index.js'\nexport function updateEntryToMaps<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  deltaBuf?: CRListDelta<T>\n): void {\n  crListReplica.parentMap.set(linkedListEntry.uuidv7, linkedListEntry)\n  const siblings = crListReplica.childrenMap.get(linkedListEntry.predecessor)\n  if (siblings) {\n    siblings.push(linkedListEntry)\n  } else {\n    crListReplica.childrenMap.set(linkedListEntry.predecessor, [\n      linkedListEntry,\n    ])\n  }\n  if (deltaBuf && !Array.isArray(deltaBuf.values)) deltaBuf.values = []\n  if (deltaBuf?.values)\n    deltaBuf.values.push({\n      uuidv7: linkedListEntry.uuidv7,\n      value: linkedListEntry.value,\n      predecessor: linkedListEntry.predecessor,\n    })\n}\n","import type { CRListState, CRListStateEntry } from '../../.types/index.js'\nexport function deleteEntryFromMaps<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>\n): void {\n  crListReplica.parentMap.delete(linkedListEntry.uuidv7)\n  const siblings = crListReplica.childrenMap.get(linkedListEntry.predecessor)\n  if (!siblings) return\n  const index = siblings.indexOf(linkedListEntry)\n  if (index !== -1) siblings.splice(index, 1)\n}\n","import type {\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../.types/index.js'\nimport { deleteEntryFromMaps } from '../deleteEntryFromMaps/index.js'\n\nexport function deleteLinkedEntry<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  deltaBuf?: CRListDelta<T>\n): void {\n  const prev = linkedListEntry.prev\n  const next = linkedListEntry.next\n  crListReplica.tombstones.add(linkedListEntry.uuidv7)\n  if (deltaBuf && !Array.isArray(deltaBuf.tombstones)) deltaBuf.tombstones = []\n  deltaBuf?.tombstones?.push(linkedListEntry.uuidv7)\n  if (prev) prev.next = next\n  if (next) {\n    next.prev = prev\n  }\n  void deleteEntryFromMaps<T>(crListReplica, linkedListEntry)\n  if (crListReplica.cursor === linkedListEntry)\n    crListReplica.cursor = next ?? prev\n  linkedListEntry.prev = undefined\n  linkedListEntry.next = undefined\n  crListReplica.size = crListReplica.parentMap.size\n}\n","import type {\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../.types/index.js'\nimport { deleteEntryFromMaps } from '../deleteEntryFromMaps/index.js'\nimport { updateEntryToMaps } from '../updateEntryToMaps/index.js'\n\nexport function moveEntryToPredecessor<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  predecessor: string,\n  deltaBuf?: CRListDelta<T>\n): void {\n  void deleteEntryFromMaps<T>(crListReplica, linkedListEntry)\n  linkedListEntry.predecessor = predecessor\n  void updateEntryToMaps<T>(crListReplica, linkedListEntry, deltaBuf)\n}\n","export function indexFromPropertyKey(\n  index: string | symbol\n): number | undefined {\n  if (typeof index !== 'string' || !/^(0|[1-9]\\d*)$/.test(index))\n    return undefined\n  const listIndex = Number(index)\n  return Number.isSafeInteger(listIndex) ? listIndex : undefined\n}\n","import { isUuidV7, prototype } from '@sovereignbase/utils'\nimport {\n  CRListSnapshot,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\nimport {\n  flattenAndLinkTrustedState,\n  assertListIndices,\n  snapshotValueToLinkedListValue,\n  updateEntryToMaps,\n} from '../../../.helpers/index.js'\n\n/**\n * Creates a local CRList replica from an optional snapshot.\n *\n * Invalid snapshot records are ignored. Accepted values are cloned, indexed by\n * UUIDv7, linked through their predecessor buckets, and exposed as a live\n * doubly-linked list.\n *\n * @param snapshot Optional serializable CRList state.\n * @returns A hydrated CRList replica.\n *\n * Time complexity: O(n log n + t + c), worst case O(n^2 + t + c)\n * - n = snapshot value entry count\n * - t = snapshot tombstone count\n * - c = cloned value payload\n *\n * Space complexity: O(n + t + c)\n */\nexport function __create<T>(snapshot?: CRListSnapshot<T>): CRListState<T> {\n  const crListReplica: CRListState<T> = {\n    size: 0,\n    cursor: undefined,\n    tombstones: new Set<string>(),\n    parentMap: new Map<string, NonNullable<CRListStateEntry<T>>>(),\n    childrenMap: new Map<string, Array<NonNullable<CRListStateEntry<T>>>>(),\n  }\n  if (!snapshot || prototype(snapshot) !== 'record') return crListReplica\n\n  /** Hydrate tombstone entries. */\n  if (\n    Object.hasOwn(snapshot, 'tombstones') &&\n    Array.isArray(snapshot.tombstones)\n  ) {\n    for (const tombstone of snapshot.tombstones) {\n      if (crListReplica.tombstones.has(tombstone) || !isUuidV7(tombstone))\n        continue\n      crListReplica.tombstones.add(tombstone)\n    }\n  }\n\n  /** Hydrate value entries. */\n  if (!Object.hasOwn(snapshot, 'values') || !Array.isArray(snapshot.values))\n    return crListReplica\n  // Build predecessor tree.\n  for (const valueEntry of snapshot.values) {\n    const linkedListEntry = snapshotValueToLinkedListValue<T>(\n      valueEntry,\n      crListReplica\n    )\n    if (!linkedListEntry) continue\n    void updateEntryToMaps<T>(crListReplica, linkedListEntry)\n  }\n  // Flatten tree into a doubly linked list.\n  void flattenAndLinkTrustedState<T>(crListReplica)\n  // Write live-view indexes.\n  void assertListIndices<T>(crListReplica)\n\n  return crListReplica\n}\n","import { walkToIndex } from '../../../.helpers/index.js'\nimport { CRListState } from '../../../.types/index.js'\n\n/**\n * Reads the value at an index in the replica live view.\n *\n * The replica cursor is moved as part of the lookup. Successful reads return a\n * detached structured clone of the visible value, so mutating the returned\n * value does not mutate the replica itself. Out-of-bounds and empty list reads\n * resolve to `undefined` instead of throwing.\n *\n * @param targetIndex Index in the live list.\n * @param crListReplica Replica to read from.\n * @returns A detached copy of the value at `targetIndex`, or `undefined` when\n * no value is present.\n *\n * Time complexity: O(d), worst case O(n)\n * - d = distance from cursor to target index\n * - n = list size\n *\n * Space complexity: O(1)\n */\nexport function __read<T>(\n  targetIndex: number,\n  crListReplica: CRListState<T>\n): T | undefined {\n  try {\n    void walkToIndex<T>(targetIndex, crListReplica)\n    return structuredClone(crListReplica?.cursor?.value)\n  } catch {\n    return undefined\n  }\n}\n","import { CRListError } from '../../../.errors/class.js'\nimport { safeStructuredClone } from '@sovereignbase/utils'\nimport {\n  updateEntryToMaps,\n  deleteEntryFromMaps,\n  walkToIndex,\n  moveEntryToPredecessor,\n  insertBetween,\n} from '../../../.helpers/index.js'\nimport { v7 as uuidv7 } from 'uuid'\nimport {\n  CRListChange,\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\n/**\n * Applies a local value mutation to the replica live view.\n *\n * The update can replace a range starting at the target entry, insert values\n * before it, or insert values after it. The returned delta is suitable for\n * gossip and the returned change describes the local live-view patch.\n *\n * @param listIndex Target index in the live list.\n * @param listValues Values to insert or overwrite.\n * @param crListReplica Replica to mutate.\n * @param mode Mutation mode relative to `listIndex`.\n * @returns A local change and gossip delta, or `false` if no mutation occurred.\n *\n * Time complexity: O(d + v + r + vk + c), worst case O(vn + c)\n * - d = distance from cursor to target index\n * - v = amount of input values\n * - r = amount of nodes after inserted values whose indexes must be shifted\n * - k = sibling bucket size when predecessor bucket is updated\n * - c = cloned value payload size across all input values\n *\n * Space complexity: O(v + c)\n */\nexport function __update<T>(\n  listIndex: number,\n  listValues: Array<T>,\n  crListReplica: CRListState<T>,\n  mode: 'overwrite' | 'before' | 'after'\n): { change: CRListChange<T>; delta: CRListDelta<T> } | false {\n  if (listIndex < 0 || listIndex > crListReplica.size)\n    throw new CRListError('INDEX_OUT_OF_BOUNDS')\n  if (!Array.isArray(listValues))\n    throw new CRListError(\n      'UPDATE_EXPECTED_AN_ARRAY',\n      '`listValues` must be an Array'\n    )\n  if (listValues.length === 0) return false\n  const change: CRListChange<T> = {}\n  const delta: CRListDelta<T> = { values: [], tombstones: [] }\n  let shiftCursor: CRListStateEntry<T>\n  for (const listValue of listValues) {\n    const [cloned, copiedValue] = safeStructuredClone(listValue)\n\n    if (!cloned) throw new CRListError('VALUE_NOT_CLONEABLE')\n\n    const v7 = uuidv7()\n\n    const linkedListEntry: NonNullable<CRListStateEntry<T>> = {\n      uuidv7: v7,\n      value: copiedValue,\n      predecessor: '\\0',\n      index: 0,\n      next: undefined,\n      prev: undefined,\n    }\n\n    switch (mode) {\n      case 'overwrite': {\n        if (listIndex === crListReplica.size) {\n          if (crListReplica.size === 0) {\n            crListReplica.cursor = linkedListEntry\n            void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n            change[linkedListEntry.index] = linkedListEntry.value\n            break\n          }\n          void walkToIndex<T>(crListReplica.size - 1, crListReplica)\n          if (!crListReplica.cursor) return false\n          linkedListEntry.index = crListReplica.cursor.index + 1\n          linkedListEntry.predecessor = crListReplica.cursor.uuidv7\n          insertBetween<T>(crListReplica.cursor, linkedListEntry, undefined)\n          void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n          crListReplica.cursor = linkedListEntry\n          change[linkedListEntry.index] = linkedListEntry.value\n          break\n        }\n        void walkToIndex<T>(listIndex, crListReplica)\n        if (!crListReplica.cursor) return false\n        const entryToOverwrite = crListReplica.cursor\n\n        linkedListEntry.predecessor = entryToOverwrite.predecessor\n        linkedListEntry.index = entryToOverwrite.index\n        insertBetween<T>(\n          entryToOverwrite.prev,\n          linkedListEntry,\n          entryToOverwrite.next\n        )\n        if (entryToOverwrite.next) {\n          if (entryToOverwrite.next.predecessor === entryToOverwrite.uuidv7) {\n            void moveEntryToPredecessor<T>(\n              crListReplica,\n              entryToOverwrite.next,\n              linkedListEntry.uuidv7,\n              delta\n            )\n          }\n        }\n        void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n        crListReplica.tombstones.add(entryToOverwrite.uuidv7)\n        delta.tombstones?.push(entryToOverwrite.uuidv7)\n        void deleteEntryFromMaps<T>(crListReplica, entryToOverwrite)\n        entryToOverwrite.next = undefined\n        entryToOverwrite.prev = undefined\n        crListReplica.cursor = linkedListEntry\n        change[linkedListEntry.index] = linkedListEntry.value\n        break\n      }\n      case 'after': {\n        if (crListReplica.size === 0 && listIndex === 0) {\n          crListReplica.cursor = linkedListEntry\n          void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n          change[linkedListEntry.index] = linkedListEntry.value\n          break\n        }\n        if (listIndex === crListReplica.size) {\n          void walkToIndex<T>(crListReplica.size - 1, crListReplica)\n        } else {\n          void walkToIndex<T>(listIndex, crListReplica)\n        }\n        if (!crListReplica.cursor) return false\n        const next =\n          listIndex === crListReplica.size\n            ? undefined\n            : crListReplica.cursor.next\n        shiftCursor = next\n        linkedListEntry.index = crListReplica.cursor.index + 1\n        linkedListEntry.predecessor = crListReplica.cursor.uuidv7\n        insertBetween<T>(crListReplica.cursor, linkedListEntry, next)\n        if (next) {\n          if (next.predecessor === crListReplica.cursor.uuidv7) {\n            void moveEntryToPredecessor<T>(\n              crListReplica,\n              next,\n              linkedListEntry.uuidv7,\n              delta\n            )\n          }\n        }\n        void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n        crListReplica.cursor = linkedListEntry\n        change[linkedListEntry.index] = linkedListEntry.value\n        break\n      }\n      case 'before': {\n        if (crListReplica.size === 0 && listIndex === 0) {\n          crListReplica.cursor = linkedListEntry\n          void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n          change[linkedListEntry.index] = linkedListEntry.value\n          mode = 'after'\n          listIndex = linkedListEntry.index - 1\n          break\n        }\n        void walkToIndex<T>(listIndex, crListReplica)\n        if (!crListReplica.cursor) return false\n        const prev = crListReplica.cursor.prev\n        shiftCursor = crListReplica.cursor\n        linkedListEntry.index = crListReplica.cursor.index\n        linkedListEntry.predecessor = prev?.uuidv7 ?? '\\0'\n        insertBetween<T>(prev, linkedListEntry, crListReplica.cursor)\n        if (crListReplica.cursor.predecessor === linkedListEntry.predecessor) {\n          void moveEntryToPredecessor<T>(\n            crListReplica,\n            crListReplica.cursor,\n            linkedListEntry.uuidv7,\n            delta\n          )\n        }\n        void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n        crListReplica.cursor = linkedListEntry\n        change[linkedListEntry.index] = linkedListEntry.value\n        mode = 'after'\n        listIndex = linkedListEntry.index - 1\n\n        break\n      }\n    }\n    crListReplica.size = crListReplica.parentMap.size\n    listIndex++\n  }\n  if (mode !== 'overwrite')\n    while (shiftCursor) {\n      shiftCursor.index += listValues.length\n      shiftCursor = shiftCursor.next\n    }\n  return { change, delta }\n}\n","import { deleteLinkedEntry, walkToIndex } from '../../../.helpers/index.js'\nimport { CRListError } from '../../../.errors/class.js'\nimport type {\n  CRListChange,\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\n\n/**\n * Deletes a range from the replica live view.\n *\n * With no indexes, the full list is deleted. With only `startIndex`, all entries\n * from `startIndex` onward are deleted. With both indexes, the deleted range is\n * `[startIndex, endIndex)`.\n *\n * @param crListReplica Replica to mutate.\n * @param startIndex Inclusive start index. Defaults to `0`.\n * @param endIndex Exclusive end index. Defaults to the current list size.\n * @returns A local change and gossip delta, or `false` if nothing was deleted.\n *\n * Time complexity: O(d + qk + r), worst case O(n^2)\n * - d = distance from cursor to target index\n * - q = amount of deleted nodes\n * - r = amount of nodes after the deleted range whose indexes must be shifted\n * - k = sibling bucket size when deleted entries are removed from buckets\n *\n * Space complexity: O(q)\n */\nexport function __delete<T>(\n  crListReplica: CRListState<T>,\n  startIndex?: number,\n  endIndex?: number\n): { change: CRListChange<T>; delta: CRListDelta<T> } | false {\n  const change: CRListChange<T> = {}\n  const delta: CRListDelta<T> = { values: [], tombstones: [] }\n  const listIndex = startIndex ?? 0\n  const targetEndIndex = endIndex ?? crListReplica.size\n  if (\n    listIndex < 0 ||\n    targetEndIndex < listIndex ||\n    listIndex > crListReplica.size\n  )\n    throw new CRListError('INDEX_OUT_OF_BOUNDS')\n  const deleteCount = Math.min(targetEndIndex, crListReplica.size) - listIndex\n  if (deleteCount <= 0) return false\n\n  void walkToIndex<T>(listIndex, crListReplica)\n  if (!crListReplica.cursor) return false\n\n  let current: CRListStateEntry<T> = crListReplica.cursor\n  let deleted = 0\n\n  while (current && deleted < deleteCount) {\n    const next: CRListStateEntry<T> = current.next\n    change[current.index] = undefined\n    void deleteLinkedEntry<T>(crListReplica, current, delta)\n    current = next\n    deleted++\n  }\n\n  crListReplica.size = crListReplica.parentMap.size\n\n  while (current) {\n    current.index -= deleted\n    current = current.next\n  }\n\n  return { change, delta }\n}\n","import type {\n  CRListChange,\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\nimport {\n  snapshotValueToLinkedListValue,\n  updateEntryToMaps,\n  flattenAndLinkTrustedState,\n  assertListIndices,\n  deleteLinkedEntry,\n  moveEntryToPredecessor,\n} from '../../../.helpers/index.js'\nimport { prototype, isUuidV7 } from '@sovereignbase/utils'\n\n/**\n * Merges a remote CRList delta into the local replica.\n *\n * Accepted tombstones update the local live view and accepted values are attached\n * to the predecessor tree. Tail-append deltas are linked incrementally; deltas\n * that can affect ordering fall back to deterministic relinking.\n *\n * @param crListReplica Replica to mutate.\n * @param crListDelta Remote gossip delta.\n * @returns A minimal local change patch, or `false` when the delta is ignored.\n *\n * Time complexity: O(v + t + c) for tail-append deltas; O(n + t + qk) for tombstone-only deletes; otherwise O(n log n + v + t + m*k + c)\n * Worst case: O(n^2 + (v + t)n + c)\n * - n = replica value entry count after merge\n * - v = delta value entry count\n * - t = delta tombstone count\n * - q = amount of live entries deleted by tombstones\n * - m = entries moved between predecessor buckets\n * - k = sibling bucket size when entries are removed from buckets\n * - c = cloned delta value payload size\n *\n * Space complexity: O(n + v + t + c)\n */\nexport function __merge<T>(\n  crListReplica: CRListState<T>,\n  crListDelta: CRListDelta<T>\n): CRListChange<T> | false {\n  if (!crListDelta || prototype(crListDelta) !== 'record') return false\n  const newVals: Array<NonNullable<CRListStateEntry<T>>> = []\n  const newTombsIndices: Array<number> = []\n  const change: CRListChange<T> = {}\n  let needsRelink = false\n\n  /** Apply tombstone entries. */\n  if (\n    Object.hasOwn(crListDelta, 'tombstones') &&\n    Array.isArray(crListDelta.tombstones)\n  ) {\n    for (const tombstone of crListDelta.tombstones) {\n      if (crListReplica.tombstones.has(tombstone) || !isUuidV7(tombstone))\n        continue\n      crListReplica.tombstones.add(tombstone)\n      const linkedListEntry = crListReplica.parentMap.get(tombstone)\n      if (linkedListEntry) {\n        void newTombsIndices.push(linkedListEntry.index)\n        void deleteLinkedEntry<T>(crListReplica, linkedListEntry)\n        needsRelink = true\n      }\n    }\n  }\n\n  /** Apply value entries. */\n  if (\n    !Object.hasOwn(crListDelta, 'values') ||\n    !Array.isArray(crListDelta.values)\n  ) {\n    if (newTombsIndices.length === 0) return false\n    void assertListIndices<T>(crListReplica)\n    for (const index of newTombsIndices) {\n      change[index] = undefined\n    }\n    return change\n  }\n  // Attach accepted values to the predecessor tree.\n  for (const valueEntry of crListDelta.values) {\n    const existingEntry = crListReplica.parentMap.get(valueEntry.uuidv7)\n    if (existingEntry) {\n      if (\n        crListReplica.tombstones.has(valueEntry.uuidv7) ||\n        (!isUuidV7(valueEntry.predecessor) && valueEntry.predecessor !== '\\0')\n      )\n        continue\n      if (existingEntry.predecessor >= valueEntry.predecessor) continue\n      void moveEntryToPredecessor<T>(\n        crListReplica,\n        existingEntry,\n        valueEntry.predecessor\n      )\n      needsRelink = true\n      void newVals.push(existingEntry)\n      continue\n    }\n    const linkedListEntry = snapshotValueToLinkedListValue<T>(\n      valueEntry,\n      crListReplica\n    )\n    if (!linkedListEntry) continue\n    const predecessor =\n      linkedListEntry.predecessor === '\\0'\n        ? undefined\n        : crListReplica.parentMap.get(linkedListEntry.predecessor)\n    void updateEntryToMaps<T>(crListReplica, linkedListEntry)\n    void newVals.push(linkedListEntry)\n    if (!needsRelink && linkedListEntry.predecessor === '\\0') {\n      if (crListReplica.size === 0) {\n        crListReplica.cursor = linkedListEntry\n        crListReplica.size = crListReplica.parentMap.size\n      } else {\n        needsRelink = true\n      }\n    } else if (!needsRelink && predecessor && !predecessor.next) {\n      linkedListEntry.prev = predecessor\n      linkedListEntry.index = predecessor.index + 1\n      predecessor.next = linkedListEntry\n      crListReplica.cursor = linkedListEntry\n      crListReplica.size = crListReplica.parentMap.size\n    } else {\n      needsRelink = true\n    }\n  }\n  if (needsRelink) {\n    // Flatten tree into a doubly linked list.\n    void flattenAndLinkTrustedState<T>(crListReplica)\n    // Write live-view indexes.\n    void assertListIndices<T>(crListReplica)\n  }\n\n  if (newTombsIndices.length === 0 && newVals.length === 0) return false\n\n  for (const index of newTombsIndices) {\n    change[index] = undefined\n  }\n  for (const val of newVals) {\n    change[val.index] = val.value\n  }\n\n  return change\n}\n","import type { CRListAck, CRListState } from '../../../.types/index.js'\n\n/**\n * Returns the replica tombstone acknowledgement frontier.\n *\n * The frontier is the greatest tombstone identifier currently retained by the\n * replica. Peers can use it as input for tombstone garbage collection.\n *\n * @param crListReplica Replica to acknowledge.\n * @returns The acknowledgement frontier, or `false` when there are no tombstones.\n *\n * Time complexity: O(t)\n * - t = replica tombstone count\n *\n * Space complexity: O(1)\n */\nexport function __acknowledge<T>(\n  crListReplica: CRListState<T>\n): CRListAck | false {\n  let frontier: CRListAck | false = false\n  crListReplica.tombstones.forEach((tombstone) => {\n    if (frontier === false || frontier < tombstone) frontier = tombstone\n  })\n  if (typeof frontier === 'string') return frontier\n  return false\n}\n","import { CRListAck, CRListState } from '../../../.types/index.js'\n\n/**\n * Removes tombstones acknowledged by all supplied frontiers.\n *\n * The minimum frontier is used as the safe collection boundary. Tombstones less\n * than or equal to that boundary are removed from the local replica.\n *\n * @param frontiers Acknowledgement frontiers received from peers.\n * @param crListReplica Replica whose tombstones will be collected.\n *\n * Time complexity: O(f log f + t)\n * - f = frontier count\n * - t = replica tombstone count\n *\n * Space complexity: O(1)\n */\nexport function __garbageCollect<T>(\n  frontiers: Array<CRListAck>,\n  crListReplica: CRListState<T>\n): void {\n  if (!Array.isArray(frontiers)) return\n  const frontier = frontiers.sort().shift()\n  if (typeof frontier !== 'string') return\n  crListReplica.tombstones.forEach((tombstone, __, tombstones) => {\n    if (tombstone <= frontier) {\n      tombstones.delete(tombstone)\n    }\n  })\n}\n","import { CRListError } from '../../../.errors/class.js'\nimport { CRListState, CRListSnapshot } from '../../../.types/index.js'\n\n/**\n * Creates a full serializable CRList snapshot from the current replica state.\n *\n * The snapshot contains every live value entry and all retained tombstones. Value\n * payloads are cloned so callers cannot mutate the replica through the snapshot.\n *\n * @param crListReplica Replica to snapshot.\n * @returns A full snapshot suitable for hydration or transport.\n *\n * Time complexity: O(n + t + c)\n * - n = replica value entry count\n * - t = replica tombstone count\n * - c = cloned value payload size\n *\n * Space complexity: O(n + t + c)\n */\nexport function __snapshot<T>(\n  crListReplica: CRListState<T>\n): CRListSnapshot<T> {\n  return {\n    values: Array.from(crListReplica.parentMap.values()).map(\n      (linkedListEntry) => {\n        if (!linkedListEntry) throw new CRListError('LIST_INTEGRITY_VIOLATION')\n        return {\n          uuidv7: linkedListEntry.uuidv7,\n          value: structuredClone(linkedListEntry.value),\n          predecessor: linkedListEntry.predecessor,\n        }\n      }\n    ),\n    tombstones: Array.from(crListReplica.tombstones),\n  }\n}\n","import { indexFromPropertyKey } from '../.helpers/index.js'\nimport type {\n  CRListState,\n  CRListSnapshot,\n  CRListEventListenerFor,\n  CRListEventMap,\n  CRListDelta,\n  CRListAck,\n} from '../.types/index.js'\nimport { __create, __read, __update, __delete } from '../core/crud/index.js'\nimport {\n  __merge,\n  __acknowledge,\n  __garbageCollect,\n  __snapshot,\n} from '../core/mags/index.js'\n\n/**\n * A convergent replicated list.\n *\n * Numeric property access reads and mutates the live list projection:\n * `list[0]` reads a detached copy of an entry, `list[0] = value` writes an\n * entry, and `delete list[0]` removes one entry. Iteration and `forEach()`\n * likewise expose detached copies rather than mutable references into the\n * replica state. Local mutations emit `delta` and `change` events; remote\n * merges emit `change` events.\n *\n * @typeParam T - The value type stored in the list.\n */\nexport class CRList<T> {\n  /**\n   * Reads or overwrites an entry in the live list projection by index.\n   *\n   * Reads return detached copies.\n   */\n  [index: number]: T\n  declare private readonly state: CRListState<T>\n  declare private readonly eventTarget: EventTarget\n\n  /**\n   * Creates a replicated list from an optional serializable snapshot.\n   *\n   * @param snapshot - A previously emitted CRList snapshot.\n   */\n  constructor(snapshot?: CRListSnapshot<T>) {\n    Object.defineProperties(this, {\n      state: {\n        value: __create<T>(snapshot),\n        enumerable: false,\n        configurable: false,\n        writable: false,\n      },\n      eventTarget: {\n        value: new EventTarget(),\n        enumerable: false,\n        configurable: false,\n        writable: false,\n      },\n    })\n\n    return new Proxy(this, {\n      get(target, index, receiver) {\n        const listIndex = indexFromPropertyKey(index)\n        // Preserve normal property access for non-index keys.\n        if (listIndex === undefined) return Reflect.get(target, index, receiver)\n        return __read(listIndex, target.state)\n      },\n      has(target, index) {\n        const listIndex = indexFromPropertyKey(index)\n        // Preserve normal property checks for non-index keys.\n        if (listIndex === undefined) return Reflect.has(target, index)\n        return listIndex >= 0 && listIndex < target.state.size\n      },\n      set(target, index, value) {\n        const listIndex = indexFromPropertyKey(index)\n        if (listIndex === undefined) return false\n        try {\n          const result = __update(listIndex, [value], target.state, 'overwrite')\n          if (!result) return false\n          const { delta, change } = result\n          if (delta)\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('delta', { detail: delta })\n            )\n          if (change)\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('change', { detail: change })\n            )\n          return true\n        } catch {\n          return false\n        }\n      },\n      deleteProperty(target, index) {\n        const listIndex = indexFromPropertyKey(index)\n        if (listIndex === undefined) return false\n        try {\n          const result = __delete(target.state, listIndex, listIndex + 1)\n          if (!result) return false\n          const { delta, change } = result\n          if (delta) {\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('delta', { detail: delta })\n            )\n          }\n          if (change) {\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('change', { detail: change })\n            )\n          }\n          return true\n        } catch {\n          return false\n        }\n      },\n      ownKeys(target) {\n        return [\n          ...Reflect.ownKeys(target),\n          ...Array.from({ length: target.size }, (_, index) => String(index)),\n        ]\n      },\n\n      getOwnPropertyDescriptor(target, index) {\n        const listIndex = indexFromPropertyKey(index)\n\n        if (listIndex !== undefined && listIndex < target.size) {\n          return {\n            value: __read(listIndex, target.state),\n            writable: true,\n            enumerable: true,\n            configurable: true,\n          }\n        }\n        // Preserve normal property checks for non-index keys.\n        return Reflect.getOwnPropertyDescriptor(target, index)\n      },\n    })\n  }\n  /**\n   * The current number of live entries.\n   */\n  get size(): number {\n    return this.state.size\n  }\n  /**\n   * Inserts a value before an index.\n   *\n   * If `beforeIndex` is omitted, the value is inserted at the start of the list.\n   *\n   * @param value - The value to insert.\n   * @param beforeIndex - The index to insert before.\n   */\n  prepend(value: T, beforeIndex?: number): void {\n    const result = __update<T>(beforeIndex ?? 0, [value], this.state, 'before')\n    if (!result) return\n    const { delta, change } = result\n    if (delta)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('delta', { detail: delta })\n      )\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Inserts a value after an index.\n   *\n   * If `afterIndex` is omitted, the value is appended at the end of the list.\n   *\n   * @param value - The value to insert.\n   * @param afterIndex - The index to insert after.\n   */\n  append(value: T, afterIndex?: number): void {\n    const result = __update<T>(\n      afterIndex ?? this.state.size,\n      [value],\n      this.state,\n      'after'\n    )\n    if (!result) return\n    const { delta, change } = result\n    if (delta)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('delta', { detail: delta })\n      )\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Removes the entry at an index.\n   *\n   * @param index - The index to remove.\n   */\n  remove(index: number): void {\n    const result = __delete(this.state, index, index + 1)\n    if (!result) return\n    const { delta, change } = result\n    if (delta)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('delta', { detail: delta })\n      )\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Applies a remote gossip delta to this list.\n   *\n   * Emits a `change` event when the merge changes the live projection.\n   *\n   * @param delta - The remote CRList delta to merge.\n   */\n  merge(delta: CRListDelta<T>): void {\n    const change = __merge(this.state, delta)\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Emits an acknowledgement frontier for currently retained tombstones.\n   */\n  acknowledge(): void {\n    const ack = __acknowledge(this.state)\n    if (ack)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('ack', { detail: ack })\n      )\n  }\n  /**\n   * Garbage-collects tombstones that are covered by acknowledgement frontiers.\n   *\n   * @param frontiers - Replica acknowledgement frontiers.\n   */\n  garbageCollect(frontiers: Array<CRListAck>): void {\n    void __garbageCollect(frontiers, this.state)\n  }\n  /**\n   * Emits the current serializable list snapshot.\n   */\n  snapshot(): void {\n    const snapshot = __snapshot<T>(this.state)\n    if (snapshot)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('snapshot', { detail: snapshot })\n      )\n  }\n  /**\n   * Registers an event listener.\n   *\n   * @param type - The event type to listen for.\n   * @param listener - The listener to register.\n   * @param options - Listener registration options.\n   */\n  addEventListener<K extends keyof CRListEventMap<T>>(\n    type: K,\n    listener: CRListEventListenerFor<T, K> | null,\n    options?: boolean | AddEventListenerOptions\n  ): void {\n    this.eventTarget.addEventListener(\n      type,\n      listener as EventListenerOrEventListenerObject | null,\n      options\n    )\n  }\n\n  /**\n   * Removes an event listener.\n   *\n   * @param type - The event type to stop listening for.\n   * @param listener - The listener to remove.\n   * @param options - Listener removal options.\n   */\n  removeEventListener<K extends keyof CRListEventMap<T>>(\n    type: K,\n    listener: CRListEventListenerFor<T, K> | null,\n    options?: boolean | EventListenerOptions\n  ): void {\n    this.eventTarget.removeEventListener(\n      type,\n      listener as EventListenerOrEventListenerObject | null,\n      options\n    )\n  }\n  /**\n   * Returns a serializable snapshot representation of this list.\n   *\n   * Called automatically by `JSON.stringify`.\n   */\n  toJSON(): CRListSnapshot<T> {\n    return __snapshot<T>(this.state)\n  }\n  /**\n   * Returns this list as a JSON string.\n   */\n  toString(): string {\n    return JSON.stringify(this)\n  }\n  /**\n   * Returns the Node.js console inspection representation.\n   */\n  [Symbol.for('nodejs.util.inspect.custom')](): CRListSnapshot<T> {\n    return this.toJSON()\n  }\n  /**\n   * Returns the Deno console inspection representation.\n   */\n  [Symbol.for('Deno.customInspect')](): CRListSnapshot<T> {\n    return this.toJSON()\n  }\n  /**\n   * Iterates over detached copies of the current live values in index order.\n   */\n  *[Symbol.iterator](): IterableIterator<T> {\n    for (let index = 0; index < this.size; index++) {\n      const value = this[index]\n      yield value\n    }\n  }\n  /**\n   * Calls a function once for each live value copy in index order.\n   *\n   * Callback values are detached copies, so mutating them does not mutate the\n   * list.\n   *\n   * @param callback - Function to call for each value copy.\n   * @param thisArg - Optional `this` value for the callback.\n   */\n  forEach(\n    callback: (value: T, index: number, list: this) => void,\n    thisArg?: unknown\n  ): void {\n    for (let index = 0; index < this.size; index++) {\n      callback.call(thisArg, this[index], index, this)\n    }\n  }\n}\n"]}
+{"version":3,"sources":["/home/runner/work/convergent-replicated-list/convergent-replicated-list/dist/index.cjs","../src/.helpers/assertListIndices/index.ts","../src/.errors/class.ts","../src/.helpers/walkToIndex/index.ts","../src/.helpers/insertBetween/index.ts","../src/.helpers/flattenAndLinkTrustedState/index.ts","../src/.helpers/transformSnapshotEntryToStateEntry/index.ts","../src/.helpers/updateEntryToMaps/index.ts","../src/.helpers/deleteEntryFromMaps/index.ts","../src/.helpers/deleteLinkedEntry/index.ts","../src/.helpers/moveEntryToPredecessor/index.ts","../src/.helpers/indexFromPropertyKey/index.ts","../src/core/crud/create/index.ts","../src/core/crud/read/index.ts","../src/core/crud/update/index.ts","../src/core/crud/delete/index.ts","../src/core/mags/merge/index.ts","../src/core/mags/acknowledge/index.ts","../src/core/mags/garbageCollect/index.ts","../src/core/mags/snapshot/index.ts","../src/CRList/class.ts"],"names":["isUuidV7"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;ACfO,SAAS,iBAAA,CAAqB,aAAA,EAAqC;AACxE,EAAA,GAAA,CAAI,CAAC,aAAA,CAAc,MAAA,EAAQ,MAAA;AAC3B,EAAA,IAAI,MAAA,EAAQ,aAAA,CAAc,IAAA;AAC1B,EAAA,MAAA,CAAO,aAAA,CAAc,MAAA,CAAO,IAAA;AAC1B,IAAA,aAAA,CAAc,OAAA,EAAS,aAAA,CAAc,MAAA,CAAO,IAAA;AAE9C,EAAA,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG;AACjB,IAAA,KAAA,EAAA;AACA,IAAA,aAAA,CAAc,MAAA,CAAO,MAAA,EAAQ,KAAA;AAC7B,IAAA,GAAA,CAAI,aAAA,CAAc,MAAA,CAAO,KAAA,IAAS,KAAA,CAAA,EAAW,KAAA;AAC7C,IAAA,aAAA,CAAc,OAAA,EAAS,aAAA,CAAc,MAAA,CAAO,IAAA;AAAA,EAC9C;AACF;ADgBA;AACA;AElBO,IAAM,YAAA,EAAN,MAAA,QAA0B,MAAM;AAAA;AAAA;AAAA;AAAA,EAI5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQT,WAAA,CAAY,IAAA,EAAuB,OAAA,EAAkB;AACnD,IAAA,MAAM,OAAA,mBAAS,OAAA,UAAW,MAAA;AAC1B,IAAA,KAAA,CAAM,CAAA,4CAAA,EAA+C,MAAM,CAAA,CAAA;AAC/C,IAAA;AACA,IAAA;AACd,EAAA;AACF;AFmBgE;AACA;AG7CxD;AAC8C,EAAA;AACL,IAAA;AAC5B,EAAA;AACkC,IAAA;AACQ,EAAA;AACC,EAAA;AACP,IAAA;AACvD,EAAA;AACF;AH+CgE;AACA;AIzDxD;AACiB,EAAA;AACA,EAAA;AACD,EAAA;AACA,EAAA;AACxB;AJ2DgE;AACA;AKrEa;AACpD,EAAA;AAC6B,EAAA;AACE,EAAA;AACxC,IAAA;AACC,IAAA;AACA,IAAA;AACf,EAAA;AACmD,EAAA;AACrC,IAAA;AACd,EAAA;AACkB,EAAA;AACE,EAAA;AACJ,IAAA;AAC4B,IAAA;AACiB,MAAA;AACV,MAAA;AAChC,MAAA;AAEO,MAAA;AACkC,QAAA;AAIlD,MAAA;AAKS,MAAA;AAGb,QAAA;AAC2D,MAAA;AACxB,MAAA;AACV,MAAA;AACC,QAAA;AACkB,QAAA;AACrC,QAAA;AAC6C,QAAA;AACtC,UAAA;AACW,UAAA;AAClB,QAAA;AACO,UAAA;AACd,QAAA;AAC6C,QAAA;AACQ,QAAA;AACvC,QAAA;AACd,QAAA;AACF,MAAA;AACmC,MAAA;AACmB,MAAA;AACtB,QAAA;AACC,QAAA;AAEa,QAAA;AACrC,QAAA;AAEG,QAAA;AACI,UAAA;AACA,UAAA;AACgC,QAAA;AAChC,UAAA;AACW,UAAA;AAClB,QAAA;AACO,UAAA;AACd,QAAA;AACF,MAAA;AAC6C,MAAA;AACQ,MAAA;AACvC,MAAA;AAChB,IAAA;AACF,EAAA;AAC6C,EAAA;AAC/C;AL2DgE;AACA;AMnIlB;AAG5C;AAE4D,EAAA;AAGjC,EAAA;AAMlB,IAAA;AAEoD,EAAA;AAEzC,EAAA;AACb,EAAA;AACc,IAAA;AACZ,IAAA;AACiB,IAAA;AACjB,IAAA;AACD,IAAA;AACA,IAAA;AACR,EAAA;AACF;ANyHgE;AACA;AOlJ9D;AAEoD,EAAA;AACL,EAAA;AACjC,EAAA;AACiB,IAAA;AACxB,EAAA;AACsD,IAAA;AACzD,MAAA;AACD,IAAA;AACH,EAAA;AAC0D,EAAA;AAC5C,EAAA;AACS,IAAA;AACK,MAAA;AACD,MAAA;AACM,MAAA;AAC9B,IAAA;AACL;APmJgE;AACA;AQ1KxD;AAC+C,EAAA;AACN,EAAA;AAChC,EAAA;AAC+B,EAAA;AACJ,EAAA;AAC5C;AR4KgE;AACA;AS7K9D;AAE6B,EAAA;AACA,EAAA;AACsB,EAAA;AACW,EAAA;AACb,kBAAA;AAC3B,EAAA;AACZ,EAAA;AACI,IAAA;AACd,EAAA;AAC0D,EAAA;AAC7B,EAAA;AACI,IAAA;AACV,EAAA;AACA,EAAA;AACsB,EAAA;AAC/C;AT8KgE;AACA;AU/L9D;AAG0D,EAAA;AAC5B,EAAA;AAC4B,EAAA;AAC5D;AV+LgE;AACA;AW/M1C;AACyC,EAAA;AACpD,IAAA;AACqB,EAAA;AACuB,EAAA;AACvD;AXiNgE;AACA;AYzN5B;AA8BsC;AAClC,EAAA;AAC9B,IAAA;AACE,IAAA;AACoB,IAAA;AACiC,IAAA;AACS,IAAA;AACxE,EAAA;AAC0D,EAAA;AAK1C,EAAA;AAE+B,IAAA;AACc,MAAA;AACvD,QAAA;AACoC,MAAA;AACxC,IAAA;AACF,EAAA;AAGyD,EAAA;AAChD,IAAA;AAEiC,EAAA;AAChB,IAAA;AACtB,MAAA;AACA,MAAA;AACF,IAAA;AACsB,IAAA;AACkC,IAAA;AAC1D,EAAA;AAEgD,EAAA;AAET,EAAA;AAEhC,EAAA;AACT;AZmLgE;AACA;AajO/C;AACX,EAAA;AAC4C,IAAA;AACK,IAAA;AAC7C,EAAA;AACC,IAAA;AACT,EAAA;AACF;AbmOgE;AACA;AcnQ5B;AAQP;AAkCiC;AACb,EAAA;AACF,IAAA;AAChB,EAAA;AACjB,IAAA;AACR,MAAA;AACA,MAAA;AACF,IAAA;AACkC,EAAA;AACH,EAAA;AAC0B,EAAA;AACvD,EAAA;AACgC,EAAA;AACyB,IAAA;AAEH,IAAA;AAEtC,IAAA;AAEwC,IAAA;AAChD,MAAA;AACD,MAAA;AACM,MAAA;AACN,MAAA;AACD,MAAA;AACA,MAAA;AACR,IAAA;AAEc,IAAA;AACM,MAAA;AACsB,QAAA;AACN,UAAA;AACL,YAAA;AACkB,YAAA;AACO,YAAA;AAChD,YAAA;AACF,UAAA;AACyD,UAAA;AACvB,UAAA;AACmB,UAAA;AACF,UAAA;AACK,UAAA;AACf,UAAA;AAClB,UAAA;AACyB,UAAA;AAChD,UAAA;AACF,QAAA;AAC4C,QAAA;AACV,QAAA;AACK,QAAA;AAEQ,QAAA;AACN,QAAA;AACzC,QAAA;AACmB,UAAA;AACjB,UAAA;AACiB,UAAA;AACnB,QAAA;AAC2B,QAAA;AACiB,UAAA;AACnC,YAAA;AACH,cAAA;AACiB,cAAA;AACD,cAAA;AAChB,cAAA;AACF,YAAA;AACF,UAAA;AACF,QAAA;AAC0D,QAAA;AACN,QAAA;AACN,wBAAA;AACa,QAAA;AACnC,QAAA;AACA,QAAA;AACD,QAAA;AACyB,QAAA;AAChD,QAAA;AACF,MAAA;AACc,MAAA;AACqC,QAAA;AACxB,UAAA;AACkB,UAAA;AACO,UAAA;AAChD,UAAA;AACF,QAAA;AACsC,QAAA;AACqB,UAAA;AACpD,QAAA;AACuC,UAAA;AAC9C,QAAA;AACkC,QAAA;AAG5B,QAAA;AAEQ,QAAA;AACuC,QAAA;AACF,QAAA;AACK,QAAA;AAC9C,QAAA;AAC8C,UAAA;AAC/C,YAAA;AACH,cAAA;AACA,cAAA;AACgB,cAAA;AAChB,cAAA;AACF,YAAA;AACF,UAAA;AACF,QAAA;AAC0D,QAAA;AACnC,QAAA;AACyB,QAAA;AAChD,QAAA;AACF,MAAA;AACe,MAAA;AACoC,QAAA;AACxB,UAAA;AACkB,UAAA;AACO,UAAA;AACzC,UAAA;AAC6B,UAAA;AACpC,UAAA;AACF,QAAA;AAC4C,QAAA;AACV,QAAA;AACA,QAAA;AACN,QAAA;AACiB,QAAA;AACC,QAAA;AACQ,QAAA;AACb,QAAA;AAClC,UAAA;AACH,YAAA;AACc,YAAA;AACE,YAAA;AAChB,YAAA;AACF,UAAA;AACF,QAAA;AAC0D,QAAA;AACnC,QAAA;AACyB,QAAA;AACzC,QAAA;AAC6B,QAAA;AAEpC,QAAA;AACF,MAAA;AACF,IAAA;AAC6C,IAAA;AAC7C,IAAA;AACF,EAAA;AACa,EAAA;AACS,IAAA;AACc,MAAA;AACN,MAAA;AAC5B,IAAA;AACqB,EAAA;AACzB;AdoNgE;AACA;Ae3XF;AAC3B,EAAA;AAC0B,EAAA;AAC3B,EAAA;AACiB,EAAA;AAI/C,EAAA;AAE2C,IAAA;AACc,EAAA;AAC9B,EAAA;AAEe,EAAA;AACV,EAAA;AAEe,EAAA;AACnC,EAAA;AAE2B,EAAA;AACG,IAAA;AAClB,IAAA;AAC+B,IAAA;AAC7C,IAAA;AACV,IAAA;AACF,EAAA;AAE6C,EAAA;AAE7B,EAAA;AACG,IAAA;AACC,IAAA;AACpB,EAAA;AAEuB,EAAA;AACzB;AfmXgE;AACA;AgB3a5B;AA4BT;AACgC,EAAA;AACC,EAAA;AAClB,EAAA;AACP,EAAA;AACf,EAAA;AAKF,EAAA;AAEkC,IAAA;AACW,MAAA;AACvD,QAAA;AACoC,MAAA;AACc,MAAA;AAC/B,MAAA;AAC4B,QAAA;AACS,QAAA;AAC1C,QAAA;AAChB,MAAA;AACF,IAAA;AACF,EAAA;AAKiB,EAAA;AAE0B,IAAA;AACF,IAAA;AACF,IAAA;AACnB,MAAA;AAClB,IAAA;AACO,IAAA;AACT,EAAA;AAE6C,EAAA;AACU,IAAA;AACH,IAAA;AAC/B,IAAA;AAGbA,MAAAA;AAEF,QAAA;AACuD,MAAA;AACpD,MAAA;AACH,QAAA;AACA,QAAA;AACW,QAAA;AACb,MAAA;AACc,MAAA;AACiB,MAAA;AAC/B,MAAA;AACF,IAAA;AACwB,IAAA;AACtB,MAAA;AACA,MAAA;AACF,IAAA;AACsB,IAAA;AAGhB,IAAA;AAEkD,IAAA;AACvB,IAAA;AACyB,IAAA;AAC1B,MAAA;AACL,QAAA;AACsB,QAAA;AACxC,MAAA;AACS,QAAA;AAChB,MAAA;AACqD,IAAA;AAC9B,MAAA;AACqB,MAAA;AACzB,MAAA;AACI,MAAA;AACsB,MAAA;AACxC,IAAA;AACS,MAAA;AAChB,IAAA;AACF,EAAA;AACiB,EAAA;AAEiC,IAAA;AAET,IAAA;AACzC,EAAA;AAE0D,EAAA;AAErB,EAAA;AACnB,IAAA;AAClB,EAAA;AAC2B,EAAA;AACoB,IAAA;AAC/C,EAAA;AAEO,EAAA;AACT;AhB4XgE;AACA;AiB3f3C;AACc,EAAA;AACe,EAAA;AACU,IAAA;AACzD,EAAA;AACuC,EAAA;AACjC,EAAA;AACT;AjB6fgE;AACA;AkBvhBvC;AAqBjB;AACyB,EAAA;AAChB,EAAA;AACwC,EAAA;AACrB,EAAA;AACe,EAAA;AACpB,IAAA;AACE,MAAA;AAC7B,IAAA;AACD,EAAA;AACH;AlBqgBgE;AACA;AmBhhB3C;AACZ,EAAA;AACgD,IAAA;AAC9B,MAAA;AACyB,QAAA;AACrC,QAAA;AACmB,UAAA;AACoB,UAAA;AACf,UAAA;AAC/B,QAAA;AACF,MAAA;AACF,IAAA;AAC+C,IAAA;AACjD,EAAA;AACF;AnBkhBgE;AACA;AoBxhBzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAeqB,EAAA;AACV,IAAA;AACrB,MAAA;AACsB,QAAA;AACf,QAAA;AACE,QAAA;AACJ,QAAA;AACZ,MAAA;AACa,MAAA;AACY,QAAA;AACX,QAAA;AACE,QAAA;AACJ,QAAA;AACZ,MAAA;AACD,IAAA;AAEsB,IAAA;AACQ,MAAA;AACiB,QAAA;AAEY,QAAA;AACnB,QAAA;AACvC,MAAA;AACmB,MAAA;AAC2B,QAAA;AAEY,QAAA;AACN,QAAA;AACpD,MAAA;AAC0B,MAAA;AACoB,QAAA;AACR,QAAA;AAChC,QAAA;AACiD,UAAA;AAC/B,UAAA;AACM,UAAA;AACtB,UAAA;AACsB,YAAA;AACoB,cAAA;AAC5C,YAAA;AACE,UAAA;AACsB,YAAA;AACsB,cAAA;AAC9C,YAAA;AACK,UAAA;AACO,QAAA;AAC0B,UAAA;AACjC,UAAA;AACT,QAAA;AACF,MAAA;AAC8B,MAAA;AACgB,QAAA;AACR,QAAA;AAChC,QAAA;AAC+C,UAAA;AAC7B,UAAA;AACM,UAAA;AACf,UAAA;AACe,YAAA;AACoB,cAAA;AAC5C,YAAA;AACF,UAAA;AACY,UAAA;AACc,YAAA;AACsB,cAAA;AAC9C,YAAA;AACF,UAAA;AACO,UAAA;AACO,QAAA;AAC0B,UAAA;AACjC,UAAA;AACT,QAAA;AACF,MAAA;AACgB,MAAA;AACP,QAAA;AACoB,UAAA;AAC4B,UAAA;AACvD,QAAA;AACF,MAAA;AAEwC,MAAA;AACM,QAAA;AAEY,QAAA;AAC/C,UAAA;AACgC,YAAA;AAC3B,YAAA;AACE,YAAA;AACE,YAAA;AAChB,UAAA;AACF,QAAA;AAEqD,QAAA;AACvD,MAAA;AACD,IAAA;AACH,EAAA;AAAA;AAAA;AAAA;AAImB,EAAA;AACC,IAAA;AACpB,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAS8C,EAAA;AACe,IAAA;AAC9C,IAAA;AACa,IAAA;AACtB,IAAA;AACoB,MAAA;AACsB,QAAA;AAC5C,MAAA;AACE,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAS4C,EAAA;AAC3B,IAAA;AACY,uBAAA;AACnB,MAAA;AACD,MAAA;AACL,MAAA;AACF,IAAA;AACa,IAAA;AACa,IAAA;AACtB,IAAA;AACoB,MAAA;AACsB,QAAA;AAC5C,MAAA;AACE,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAM4B,EAAA;AAC0B,IAAA;AACvC,IAAA;AACa,IAAA;AACtB,IAAA;AACoB,MAAA;AACsB,QAAA;AAC5C,MAAA;AACE,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQmC,EAAA;AACO,IAAA;AACpC,IAAA;AACoB,MAAA;AACwB,QAAA;AAC9C,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAIoB,EAAA;AACkB,IAAA;AAChC,IAAA;AACoB,MAAA;AACkB,QAAA;AACxC,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMkD,EAAA;AACL,IAAA;AAC7C,EAAA;AAAA;AAAA;AAAA;AAIiB,EAAA;AAC0B,IAAA;AACrC,IAAA;AACoB,MAAA;AAC4B,QAAA;AAClD,MAAA;AACJ,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYQ,EAAA;AACW,IAAA;AACf,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaQ,EAAA;AACW,IAAA;AACf,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAM4B,EAAA;AACK,IAAA;AACjC,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMmB,EAAA;AACS,IAAA;AAC5B,EAAA;AAAA;AAAA;AAAA;AAIgE,EAAA;AAC3C,IAAA;AACrB,EAAA;AAAA;AAAA;AAAA;AAIwD,EAAA;AACnC,IAAA;AACrB,EAAA;AAAA;AAAA;AAAA;AAI0C,EAAA;AACQ,IAAA;AACtB,MAAA;AAClB,MAAA;AACR,IAAA;AACF,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaQ,EAAA;AAC0C,IAAA;AACC,MAAA;AACjD,IAAA;AACF,EAAA;AACF;ApB+fgE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"/home/runner/work/convergent-replicated-list/convergent-replicated-list/dist/index.cjs","sourcesContent":[null,"import type { CRListState } from '../../.types/index.js'\n\nexport function assertListIndices<T>(crListReplica: CRListState<T>): void {\n  if (!crListReplica.cursor) return\n  let index = crListReplica.size\n  while (crListReplica.cursor.next)\n    crListReplica.cursor = crListReplica.cursor.next\n\n  while (index >= 1) {\n    index--\n    crListReplica.cursor.index = index\n    if (crListReplica.cursor.prev === undefined) break\n    crListReplica.cursor = crListReplica.cursor.prev\n  }\n}\n","/**\n * Error codes thrown by {@link CRList}.\n */\nexport type CRListErrorCode =\n  | 'VALUE_NOT_CLONEABLE'\n  | 'INDEX_OUT_OF_BOUNDS'\n  | 'LIST_EMPTY'\n  | 'LIST_INTEGRITY_VIOLATION'\n  | 'UPDATE_EXPECTED_AN_ARRAY'\n\n/**\n * Represents a typed CRList runtime error.\n */\nexport class CRListError extends Error {\n  /**\n   * The semantic error code for the failure.\n   */\n  readonly code: CRListErrorCode\n\n  /**\n   * Creates a typed CRList error.\n   *\n   * @param code - The semantic error code.\n   * @param message - An optional human-readable detail message.\n   */\n  constructor(code: CRListErrorCode, message?: string) {\n    const detail = message ?? code\n    super(`{@sovereignbase/convergent-replicated-list} ${detail}`)\n    this.code = code\n    this.name = 'CRListError'\n  }\n}\n","import type { CRListState } from '../../.types/index.js'\nimport { CRListError } from '../../.errors/class.js'\n\nexport function walkToIndex<T>(\n  targetIndex: number,\n  crListReplica: CRListState<T>\n): void {\n  if (targetIndex < 0 || targetIndex >= crListReplica.size)\n    throw new CRListError('INDEX_OUT_OF_BOUNDS', 'Index out of bounds')\n  if (!crListReplica.cursor)\n    throw new CRListError('LIST_EMPTY', 'List is empty')\n  const direction = crListReplica.cursor.index > targetIndex ? 'prev' : 'next'\n  while (crListReplica.cursor && crListReplica.cursor.index !== targetIndex) {\n    crListReplica.cursor = crListReplica.cursor[direction]\n  }\n}\n","import type { CRListStateEntry } from '../../.types/index.js'\n\nexport function insertBetween<T>(\n  prev: CRListStateEntry<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  next: CRListStateEntry<T>\n): void {\n  linkedListEntry.prev = prev\n  linkedListEntry.next = next\n  if (prev) prev.next = linkedListEntry\n  if (next) next.prev = linkedListEntry\n}\n","import type { CRListState, CRListStateEntry } from '../../.types/index.js'\nimport { insertBetween } from '../insertBetween/index.js'\nexport function flattenAndLinkTrustedState<T>(crListReplica: CRListState<T>) {\n  crListReplica.cursor = undefined\n  const resolvedSiblingPredecessors = new Set<string>()\n  for (const entry of crListReplica.parentMap.values()) {\n    if (!entry) continue\n    entry.prev = undefined\n    entry.next = undefined\n  }\n  const keys = [...crListReplica.childrenMap.keys()].sort((a, b) =>\n    a > b ? 1 : -1\n  )\n  let hasProgress = true\n  while (hasProgress) {\n    hasProgress = false\n    for (const predecessorIdentifier of keys) {\n      if (resolvedSiblingPredecessors.has(predecessorIdentifier)) continue\n      const siblings = crListReplica.childrenMap.get(predecessorIdentifier)\n      if (!siblings) continue\n\n      if (siblings.length > 1)\n        siblings.sort((a, b) => (a.uuidv7 > b.uuidv7 ? 1 : -1))\n\n      const predecessor =\n        predecessorIdentifier === '\\0'\n          ? undefined\n          : crListReplica.parentMap.get(predecessorIdentifier)\n      if (\n        predecessor &&\n        !predecessor.prev &&\n        !predecessor.next &&\n        crListReplica.cursor !== predecessor\n      )\n        continue\n      let prev: CRListStateEntry<T> = predecessor ?? crListReplica.cursor\n      const predecessorNext = predecessor?.next\n      if (siblings.length === 1) {\n        const sibling = siblings[0]\n        insertBetween<T>(prev, sibling, sibling.next)\n        prev = sibling\n        if (predecessorNext && predecessorNext !== sibling) {\n          prev.next = predecessorNext\n          predecessorNext.prev = prev\n        } else {\n          prev.next = undefined\n        }\n        if (!predecessorNext) crListReplica.cursor = prev\n        resolvedSiblingPredecessors.add(predecessorIdentifier)\n        hasProgress = true\n        continue\n      }\n      const siblingSet = new Set(siblings)\n      for (let index = 0; index < siblings.length; index++) {\n        const sibling = siblings[index]\n        const next = siblings[index + 1]\n\n        insertBetween<T>(prev, sibling, sibling.next)\n        prev = sibling\n\n        if (next) {\n          prev.next = next\n          next.prev = prev\n        } else if (predecessorNext && !siblingSet.has(predecessorNext)) {\n          prev.next = predecessorNext\n          predecessorNext.prev = prev\n        } else {\n          prev.next = undefined\n        }\n      }\n      if (!predecessorNext) crListReplica.cursor = prev\n      resolvedSiblingPredecessors.add(predecessorIdentifier)\n      hasProgress = true\n    }\n  }\n  crListReplica.size = crListReplica.parentMap.size\n}\n","import type {\n  CRListState,\n  CRListSnapshotEntry,\n  CRListStateEntry,\n} from '../../.types/index.js'\nimport { isUuidV7, safeStructuredClone } from '@sovereignbase/utils'\nexport function transformSnapshotEntryToStateEntry<T>(\n  valueEntry: CRListSnapshotEntry<T>,\n  crListReplica: CRListState<T>\n): CRListStateEntry<T> {\n  if (valueEntry === null || valueEntry === undefined) return undefined\n  if (\n    !isUuidV7(valueEntry.uuidv7) ||\n    crListReplica.tombstones.has(valueEntry.uuidv7) ||\n    crListReplica.parentMap.has(valueEntry.uuidv7) ||\n    (!isUuidV7(valueEntry.predecessor) &&\n      valueEntry.predecessor !== '\\0' &&\n      !crListReplica.tombstones.has(valueEntry.predecessor))\n  )\n    return undefined\n\n  const [cloned, copiedValue] = safeStructuredClone(valueEntry.value)\n\n  if (!cloned) return undefined\n  return {\n    uuidv7: valueEntry.uuidv7,\n    value: copiedValue,\n    predecessor: valueEntry.predecessor,\n    index: 0,\n    next: undefined,\n    prev: undefined,\n  }\n}\n","import type {\n  CRListState,\n  CRListStateEntry,\n  CRListDelta,\n} from '../../.types/index.js'\nexport function updateEntryToMaps<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  deltaBuf?: CRListDelta<T>\n): void {\n  crListReplica.parentMap.set(linkedListEntry.uuidv7, linkedListEntry)\n  const siblings = crListReplica.childrenMap.get(linkedListEntry.predecessor)\n  if (siblings) {\n    siblings.push(linkedListEntry)\n  } else {\n    crListReplica.childrenMap.set(linkedListEntry.predecessor, [\n      linkedListEntry,\n    ])\n  }\n  if (deltaBuf && !Array.isArray(deltaBuf.values)) deltaBuf.values = []\n  if (deltaBuf?.values)\n    deltaBuf.values.push({\n      uuidv7: linkedListEntry.uuidv7,\n      value: linkedListEntry.value,\n      predecessor: linkedListEntry.predecessor,\n    })\n}\n","import type { CRListState, CRListStateEntry } from '../../.types/index.js'\nexport function deleteEntryFromMaps<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>\n): void {\n  crListReplica.parentMap.delete(linkedListEntry.uuidv7)\n  const siblings = crListReplica.childrenMap.get(linkedListEntry.predecessor)\n  if (!siblings) return\n  const index = siblings.indexOf(linkedListEntry)\n  if (index !== -1) siblings.splice(index, 1)\n}\n","import type {\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../.types/index.js'\nimport { deleteEntryFromMaps } from '../deleteEntryFromMaps/index.js'\n\nexport function deleteLinkedEntry<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  deltaBuf?: CRListDelta<T>\n): void {\n  const prev = linkedListEntry.prev\n  const next = linkedListEntry.next\n  crListReplica.tombstones.add(linkedListEntry.uuidv7)\n  if (deltaBuf && !Array.isArray(deltaBuf.tombstones)) deltaBuf.tombstones = []\n  deltaBuf?.tombstones?.push(linkedListEntry.uuidv7)\n  if (prev) prev.next = next\n  if (next) {\n    next.prev = prev\n  }\n  void deleteEntryFromMaps<T>(crListReplica, linkedListEntry)\n  if (crListReplica.cursor === linkedListEntry)\n    crListReplica.cursor = next ?? prev\n  linkedListEntry.prev = undefined\n  linkedListEntry.next = undefined\n  crListReplica.size = crListReplica.parentMap.size\n}\n","import type {\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../.types/index.js'\nimport { deleteEntryFromMaps } from '../deleteEntryFromMaps/index.js'\nimport { updateEntryToMaps } from '../updateEntryToMaps/index.js'\n\nexport function moveEntryToPredecessor<T>(\n  crListReplica: CRListState<T>,\n  linkedListEntry: NonNullable<CRListStateEntry<T>>,\n  predecessor: string,\n  deltaBuf?: CRListDelta<T>\n): void {\n  void deleteEntryFromMaps<T>(crListReplica, linkedListEntry)\n  linkedListEntry.predecessor = predecessor\n  void updateEntryToMaps<T>(crListReplica, linkedListEntry, deltaBuf)\n}\n","export function indexFromPropertyKey(\n  index: string | symbol\n): number | undefined {\n  if (typeof index !== 'string' || !/^(0|[1-9]\\d*)$/.test(index))\n    return undefined\n  const listIndex = Number(index)\n  return Number.isSafeInteger(listIndex) ? listIndex : undefined\n}\n","import { isUuidV7, prototype } from '@sovereignbase/utils'\nimport {\n  CRListSnapshot,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\nimport {\n  flattenAndLinkTrustedState,\n  assertListIndices,\n  transformSnapshotEntryToStateEntry,\n  updateEntryToMaps,\n} from '../../../.helpers/index.js'\n\n/**\n * Creates a local CRList replica from an optional snapshot.\n *\n * Invalid snapshot records are ignored. Accepted values are cloned, indexed by\n * UUIDv7, linked through their predecessor buckets, and exposed as a live\n * doubly-linked list.\n *\n * @param snapshot - Optional detached structured-clone-compatible CRList snapshot.\n * @returns - A hydrated CRList replica.\n *\n * Time complexity: O(n log n + t + c), worst case O(n^2 + t + c)\n * - n = snapshot value entry count\n * - t = snapshot tombstone count\n * - c = cloned value payload\n *\n * Space complexity: O(n + t + c)\n */\nexport function __create<T>(snapshot?: CRListSnapshot<T>): CRListState<T> {\n  const crListReplica: CRListState<T> = {\n    size: 0,\n    cursor: undefined,\n    tombstones: new Set<string>(),\n    parentMap: new Map<string, NonNullable<CRListStateEntry<T>>>(),\n    childrenMap: new Map<string, Array<NonNullable<CRListStateEntry<T>>>>(),\n  }\n  if (!snapshot || prototype(snapshot) !== 'record') return crListReplica\n\n  /** Hydrate tombstone entries. */\n  if (\n    Object.hasOwn(snapshot, 'tombstones') &&\n    Array.isArray(snapshot.tombstones)\n  ) {\n    for (const tombstone of snapshot.tombstones) {\n      if (crListReplica.tombstones.has(tombstone) || !isUuidV7(tombstone))\n        continue\n      crListReplica.tombstones.add(tombstone)\n    }\n  }\n\n  /** Hydrate value entries. */\n  if (!Object.hasOwn(snapshot, 'values') || !Array.isArray(snapshot.values))\n    return crListReplica\n  // Build predecessor tree.\n  for (const valueEntry of snapshot.values) {\n    const linkedListEntry = transformSnapshotEntryToStateEntry<T>(\n      valueEntry,\n      crListReplica\n    )\n    if (!linkedListEntry) continue\n    void updateEntryToMaps<T>(crListReplica, linkedListEntry)\n  }\n  // Flatten tree into a doubly linked list.\n  void flattenAndLinkTrustedState<T>(crListReplica)\n  // Write live-view indexes.\n  void assertListIndices<T>(crListReplica)\n\n  return crListReplica\n}\n","import { walkToIndex } from '../../../.helpers/index.js'\nimport { CRListState } from '../../../.types/index.js'\n\n/**\n * Reads the value at an index in the replica live view.\n *\n * The replica cursor is moved as part of the lookup. Successful reads return a\n * detached structured clone of the visible value, so mutating the returned\n * value does not mutate the replica itself. Out-of-bounds and empty list reads\n * resolve to `undefined` instead of throwing.\n *\n * @param targetIndex - Index in the live list.\n * @param crListReplica - Replica to read from.\n * @returns - A detached copy of the value at `targetIndex`, or `undefined` when\n * no value is present.\n *\n * Time complexity: O(d), worst case O(n)\n * - d = distance from cursor to target index\n * - n = list size\n *\n * Space complexity: O(1)\n */\nexport function __read<T>(\n  targetIndex: number,\n  crListReplica: CRListState<T>\n): T | undefined {\n  try {\n    void walkToIndex<T>(targetIndex, crListReplica)\n    return structuredClone(crListReplica?.cursor?.value)\n  } catch {\n    return undefined\n  }\n}\n","import { CRListError } from '../../../.errors/class.js'\nimport { safeStructuredClone } from '@sovereignbase/utils'\nimport {\n  updateEntryToMaps,\n  deleteEntryFromMaps,\n  walkToIndex,\n  moveEntryToPredecessor,\n  insertBetween,\n} from '../../../.helpers/index.js'\nimport { v7 as uuidv7 } from 'uuid'\nimport {\n  CRListChange,\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\n/**\n * Applies a local value mutation to the replica live view.\n *\n * The update can replace a range starting at the target entry, insert values\n * before it, or insert values after it. The returned delta is suitable for\n * gossip and the returned change describes the local live-view patch.\n *\n * @param listIndex - Target index in the live list.\n * @param listValues - Values to insert or overwrite.\n * @param crListReplica - Replica to mutate.\n * @param mode - Mutation mode relative to `listIndex`.\n * @returns - A local change and gossip delta, or `false` if no mutation occurred.\n *\n * Time complexity: O(d + v + r + vk + c), worst case O(vn + c)\n * - d = distance from cursor to target index\n * - v = amount of input values\n * - r = amount of nodes after inserted values whose indexes must be shifted\n * - k = sibling bucket size when predecessor bucket is updated\n * - c = cloned value payload size across all input values\n *\n * Space complexity: O(v + c)\n */\nexport function __update<T>(\n  listIndex: number,\n  listValues: Array<T>,\n  crListReplica: CRListState<T>,\n  mode: 'overwrite' | 'before' | 'after'\n): { change: CRListChange<T>; delta: CRListDelta<T> } | false {\n  if (listIndex < 0 || listIndex > crListReplica.size)\n    throw new CRListError('INDEX_OUT_OF_BOUNDS')\n  if (!Array.isArray(listValues))\n    throw new CRListError(\n      'UPDATE_EXPECTED_AN_ARRAY',\n      '`listValues` must be an Array'\n    )\n  if (listValues.length === 0) return false\n  const change: CRListChange<T> = {}\n  const delta: CRListDelta<T> = { values: [], tombstones: [] }\n  let shiftCursor: CRListStateEntry<T>\n  for (const listValue of listValues) {\n    const [cloned, copiedValue] = safeStructuredClone(listValue)\n\n    if (!cloned) throw new CRListError('VALUE_NOT_CLONEABLE')\n\n    const v7 = uuidv7()\n\n    const linkedListEntry: NonNullable<CRListStateEntry<T>> = {\n      uuidv7: v7,\n      value: copiedValue,\n      predecessor: '\\0',\n      index: 0,\n      next: undefined,\n      prev: undefined,\n    }\n\n    switch (mode) {\n      case 'overwrite': {\n        if (listIndex === crListReplica.size) {\n          if (crListReplica.size === 0) {\n            crListReplica.cursor = linkedListEntry\n            void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n            change[linkedListEntry.index] = linkedListEntry.value\n            break\n          }\n          void walkToIndex<T>(crListReplica.size - 1, crListReplica)\n          if (!crListReplica.cursor) return false\n          linkedListEntry.index = crListReplica.cursor.index + 1\n          linkedListEntry.predecessor = crListReplica.cursor.uuidv7\n          insertBetween<T>(crListReplica.cursor, linkedListEntry, undefined)\n          void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n          crListReplica.cursor = linkedListEntry\n          change[linkedListEntry.index] = structuredClone(linkedListEntry.value)\n          break\n        }\n        void walkToIndex<T>(listIndex, crListReplica)\n        if (!crListReplica.cursor) return false\n        const entryToOverwrite = crListReplica.cursor\n\n        linkedListEntry.predecessor = entryToOverwrite.predecessor\n        linkedListEntry.index = entryToOverwrite.index\n        insertBetween<T>(\n          entryToOverwrite.prev,\n          linkedListEntry,\n          entryToOverwrite.next\n        )\n        if (entryToOverwrite.next) {\n          if (entryToOverwrite.next.predecessor === entryToOverwrite.uuidv7) {\n            void moveEntryToPredecessor<T>(\n              crListReplica,\n              entryToOverwrite.next,\n              linkedListEntry.uuidv7,\n              delta\n            )\n          }\n        }\n        void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n        crListReplica.tombstones.add(entryToOverwrite.uuidv7)\n        delta.tombstones?.push(entryToOverwrite.uuidv7)\n        void deleteEntryFromMaps<T>(crListReplica, entryToOverwrite)\n        entryToOverwrite.next = undefined\n        entryToOverwrite.prev = undefined\n        crListReplica.cursor = linkedListEntry\n        change[linkedListEntry.index] = structuredClone(linkedListEntry.value)\n        break\n      }\n      case 'after': {\n        if (crListReplica.size === 0 && listIndex === 0) {\n          crListReplica.cursor = linkedListEntry\n          void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n          change[linkedListEntry.index] = structuredClone(linkedListEntry.value)\n          break\n        }\n        if (listIndex === crListReplica.size) {\n          void walkToIndex<T>(crListReplica.size - 1, crListReplica)\n        } else {\n          void walkToIndex<T>(listIndex, crListReplica)\n        }\n        if (!crListReplica.cursor) return false\n        const next =\n          listIndex === crListReplica.size\n            ? undefined\n            : crListReplica.cursor.next\n        shiftCursor = next\n        linkedListEntry.index = crListReplica.cursor.index + 1\n        linkedListEntry.predecessor = crListReplica.cursor.uuidv7\n        insertBetween<T>(crListReplica.cursor, linkedListEntry, next)\n        if (next) {\n          if (next.predecessor === crListReplica.cursor.uuidv7) {\n            void moveEntryToPredecessor<T>(\n              crListReplica,\n              next,\n              linkedListEntry.uuidv7,\n              delta\n            )\n          }\n        }\n        void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n        crListReplica.cursor = linkedListEntry\n        change[linkedListEntry.index] = structuredClone(linkedListEntry.value)\n        break\n      }\n      case 'before': {\n        if (crListReplica.size === 0 && listIndex === 0) {\n          crListReplica.cursor = linkedListEntry\n          void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n          change[linkedListEntry.index] = structuredClone(linkedListEntry.value)\n          mode = 'after'\n          listIndex = linkedListEntry.index - 1\n          break\n        }\n        void walkToIndex<T>(listIndex, crListReplica)\n        if (!crListReplica.cursor) return false\n        const prev = crListReplica.cursor.prev\n        shiftCursor = crListReplica.cursor\n        linkedListEntry.index = crListReplica.cursor.index\n        linkedListEntry.predecessor = prev?.uuidv7 ?? '\\0'\n        insertBetween<T>(prev, linkedListEntry, crListReplica.cursor)\n        if (crListReplica.cursor.predecessor === linkedListEntry.predecessor) {\n          void moveEntryToPredecessor<T>(\n            crListReplica,\n            crListReplica.cursor,\n            linkedListEntry.uuidv7,\n            delta\n          )\n        }\n        void updateEntryToMaps<T>(crListReplica, linkedListEntry, delta)\n        crListReplica.cursor = linkedListEntry\n        change[linkedListEntry.index] = structuredClone(linkedListEntry.value)\n        mode = 'after'\n        listIndex = linkedListEntry.index - 1\n\n        break\n      }\n    }\n    crListReplica.size = crListReplica.parentMap.size\n    listIndex++\n  }\n  if (mode !== 'overwrite')\n    while (shiftCursor) {\n      shiftCursor.index += listValues.length\n      shiftCursor = shiftCursor.next\n    }\n  return { change, delta }\n}\n","import { deleteLinkedEntry, walkToIndex } from '../../../.helpers/index.js'\nimport { CRListError } from '../../../.errors/class.js'\nimport type {\n  CRListChange,\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\n\n/**\n * Deletes a range from the replica live view.\n *\n * With no indexes, the full list is deleted. With only `startIndex`, all entries\n * from `startIndex` onward are deleted. With both indexes, the deleted range is\n * `[startIndex, endIndex)`.\n *\n * @param crListReplica - Replica to mutate.\n * @param startIndex - Inclusive start index. Defaults to `0`.\n * @param endIndex - Exclusive end index. Defaults to the current list size.\n * @returns - A local change and gossip delta, or `false` if nothing was deleted.\n *\n * Time complexity: O(d + qk + r), worst case O(n^2)\n * - d = distance from cursor to target index\n * - q = amount of deleted nodes\n * - r = amount of nodes after the deleted range whose indexes must be shifted\n * - k = sibling bucket size when deleted entries are removed from buckets\n *\n * Space complexity: O(q)\n */\nexport function __delete<T>(\n  crListReplica: CRListState<T>,\n  startIndex?: number,\n  endIndex?: number\n): { change: CRListChange<T>; delta: CRListDelta<T> } | false {\n  const change: CRListChange<T> = {}\n  const delta: CRListDelta<T> = { values: [], tombstones: [] }\n  const listIndex = startIndex ?? 0\n  const targetEndIndex = endIndex ?? crListReplica.size\n  if (\n    listIndex < 0 ||\n    targetEndIndex < listIndex ||\n    listIndex > crListReplica.size\n  )\n    throw new CRListError('INDEX_OUT_OF_BOUNDS')\n  const deleteCount = Math.min(targetEndIndex, crListReplica.size) - listIndex\n  if (deleteCount <= 0) return false\n\n  void walkToIndex<T>(listIndex, crListReplica)\n  if (!crListReplica.cursor) return false\n\n  let current: CRListStateEntry<T> = crListReplica.cursor\n  let deleted = 0\n\n  while (current && deleted < deleteCount) {\n    const next: CRListStateEntry<T> = current.next\n    change[current.index] = undefined\n    void deleteLinkedEntry<T>(crListReplica, current, delta)\n    current = next\n    deleted++\n  }\n\n  crListReplica.size = crListReplica.parentMap.size\n\n  while (current) {\n    current.index -= deleted\n    current = current.next\n  }\n\n  return { change, delta }\n}\n","import type {\n  CRListChange,\n  CRListDelta,\n  CRListState,\n  CRListStateEntry,\n} from '../../../.types/index.js'\nimport {\n  transformSnapshotEntryToStateEntry,\n  updateEntryToMaps,\n  flattenAndLinkTrustedState,\n  assertListIndices,\n  deleteLinkedEntry,\n  moveEntryToPredecessor,\n} from '../../../.helpers/index.js'\nimport { prototype, isUuidV7 } from '@sovereignbase/utils'\n\n/**\n * Merges a remote CRList delta into the local replica.\n *\n * Accepted tombstones update the local live view and accepted values are attached\n * to the predecessor tree. Tail-append deltas are linked incrementally; deltas\n * that can affect ordering fall back to deterministic relinking.\n *\n * @param crListReplica - Replica to mutate.\n * @param crListDelta - Remote gossip delta.\n * @returns - A minimal local change patch, or `false` when the delta is ignored.\n *\n * Time complexity: O(v + t + c) for tail-append deltas; O(n + t + qk) for tombstone-only deletes; otherwise O(n log n + v + t + m*k + c)\n * Worst case: O(n^2 + (v + t)n + c)\n * - n = replica value entry count after merge\n * - v = delta value entry count\n * - t = delta tombstone count\n * - q = amount of live entries deleted by tombstones\n * - m = entries moved between predecessor buckets\n * - k = sibling bucket size when entries are removed from buckets\n * - c = cloned delta value payload size\n *\n * Space complexity: O(n + v + t + c)\n */\nexport function __merge<T>(\n  crListReplica: CRListState<T>,\n  crListDelta: CRListDelta<T>\n): CRListChange<T> | false {\n  if (!crListDelta || prototype(crListDelta) !== 'record') return false\n  const newVals: Array<NonNullable<CRListStateEntry<T>>> = []\n  const newTombsIndices: Array<number> = []\n  const change: CRListChange<T> = {}\n  let needsRelink = false\n\n  /** Apply tombstone entries. */\n  if (\n    Object.hasOwn(crListDelta, 'tombstones') &&\n    Array.isArray(crListDelta.tombstones)\n  ) {\n    for (const tombstone of crListDelta.tombstones) {\n      if (crListReplica.tombstones.has(tombstone) || !isUuidV7(tombstone))\n        continue\n      crListReplica.tombstones.add(tombstone)\n      const linkedListEntry = crListReplica.parentMap.get(tombstone)\n      if (linkedListEntry) {\n        void newTombsIndices.push(linkedListEntry.index)\n        void deleteLinkedEntry<T>(crListReplica, linkedListEntry)\n        needsRelink = true\n      }\n    }\n  }\n\n  /** Apply value entries. */\n  if (\n    !Object.hasOwn(crListDelta, 'values') ||\n    !Array.isArray(crListDelta.values)\n  ) {\n    if (newTombsIndices.length === 0) return false\n    void assertListIndices<T>(crListReplica)\n    for (const index of newTombsIndices) {\n      change[index] = undefined\n    }\n    return change\n  }\n  // Attach accepted values to the predecessor tree.\n  for (const valueEntry of crListDelta.values) {\n    if (valueEntry === null || valueEntry === undefined) continue\n    const existingEntry = crListReplica.parentMap.get(valueEntry.uuidv7)\n    if (existingEntry) {\n      if (\n        crListReplica.tombstones.has(valueEntry.uuidv7) ||\n        (!isUuidV7(valueEntry.predecessor) && valueEntry.predecessor !== '\\0')\n      )\n        continue\n      if (existingEntry.predecessor >= valueEntry.predecessor) continue\n      void moveEntryToPredecessor<T>(\n        crListReplica,\n        existingEntry,\n        valueEntry.predecessor\n      )\n      needsRelink = true\n      void newVals.push(existingEntry)\n      continue\n    }\n    const linkedListEntry = transformSnapshotEntryToStateEntry<T>(\n      valueEntry,\n      crListReplica\n    )\n    if (!linkedListEntry) continue\n    const predecessor =\n      linkedListEntry.predecessor === '\\0'\n        ? undefined\n        : crListReplica.parentMap.get(linkedListEntry.predecessor)\n    void updateEntryToMaps<T>(crListReplica, linkedListEntry)\n    void newVals.push(linkedListEntry)\n    if (!needsRelink && linkedListEntry.predecessor === '\\0') {\n      if (crListReplica.size === 0) {\n        crListReplica.cursor = linkedListEntry\n        crListReplica.size = crListReplica.parentMap.size\n      } else {\n        needsRelink = true\n      }\n    } else if (!needsRelink && predecessor && !predecessor.next) {\n      linkedListEntry.prev = predecessor\n      linkedListEntry.index = predecessor.index + 1\n      predecessor.next = linkedListEntry\n      crListReplica.cursor = linkedListEntry\n      crListReplica.size = crListReplica.parentMap.size\n    } else {\n      needsRelink = true\n    }\n  }\n  if (needsRelink) {\n    // Flatten tree into a doubly linked list.\n    void flattenAndLinkTrustedState<T>(crListReplica)\n    // Write live-view indexes.\n    void assertListIndices<T>(crListReplica)\n  }\n\n  if (newTombsIndices.length === 0 && newVals.length === 0) return false\n\n  for (const index of newTombsIndices) {\n    change[index] = undefined\n  }\n  for (const val of newVals) {\n    change[val.index] = structuredClone(val.value)\n  }\n\n  return change\n}\n","import type { CRListAck, CRListState } from '../../../.types/index.js'\n\n/**\n * Returns the replica tombstone acknowledgement frontier.\n *\n * The frontier is the greatest tombstone identifier currently retained by the\n * replica. Peers can use it as input for tombstone garbage collection.\n *\n * @param crListReplica - Replica to acknowledge.\n * @returns - The acknowledgement frontier, or `false` when there are no tombstones.\n *\n * Time complexity: O(t)\n * - t = replica tombstone count\n *\n * Space complexity: O(1)\n */\nexport function __acknowledge<T>(\n  crListReplica: CRListState<T>\n): CRListAck | false {\n  let largest: CRListAck | false = false\n  crListReplica.tombstones.forEach((tombstone) => {\n    if (largest === false || largest < tombstone) largest = tombstone\n  })\n  if (typeof largest === 'string') return largest\n  return false\n}\n","import { isUuidV7 } from '@sovereignbase/utils'\nimport { CRListAck, CRListState } from '../../../.types/index.js'\n\n/**\n * Removes tombstones acknowledged by all supplied frontiers.\n *\n * The minimum frontier is used as the safe collection boundary. Tombstones less\n * than or equal to that boundary are removed from the local replica.\n *\n * @param frontiers - Acknowledgement frontiers received from peers.\n * @param crListReplica - Replica whose tombstones will be collected.\n *\n * Time complexity: O(f log f + t)\n * - f = frontier count\n * - t = replica tombstone count\n *\n * Space complexity: O(1)\n */\nexport function __garbageCollect<T>(\n  frontiers: Array<CRListAck>,\n  crListReplica: CRListState<T>\n): void {\n  if (!Array.isArray(frontiers)) return\n  frontiers.sort()\n  const smallest = frontiers.find((frontier) => isUuidV7(frontier))\n  if (typeof smallest !== 'string') return\n  crListReplica.tombstones.forEach((tombstone, __, tombstones) => {\n    if (tombstone <= smallest) {\n      tombstones.delete(tombstone)\n    }\n  })\n}\n","import { CRListError } from '../../../.errors/class.js'\nimport { CRListState, CRListSnapshot } from '../../../.types/index.js'\n\n/**\n * Creates a full detached structured-clone-compatible CRList snapshot from the current replica state.\n *\n * The snapshot contains every live value entry and all retained tombstones. Value\n * payloads are cloned so callers cannot mutate the replica through the snapshot.\n *\n * @param crListReplica - Replica to snapshot.\n * @returns - A full snapshot suitable for hydration or transport.\n *\n * Time complexity: O(n + t + c)\n * - n = replica value entry count\n * - t = replica tombstone count\n * - c = cloned value payload size\n *\n * Space complexity: O(n + t + c)\n */\nexport function __snapshot<T>(\n  crListReplica: CRListState<T>\n): CRListSnapshot<T> {\n  return {\n    values: Array.from(crListReplica.parentMap.values()).map(\n      (linkedListEntry) => {\n        if (!linkedListEntry) throw new CRListError('LIST_INTEGRITY_VIOLATION')\n        return {\n          uuidv7: linkedListEntry.uuidv7,\n          value: structuredClone(linkedListEntry.value),\n          predecessor: linkedListEntry.predecessor,\n        }\n      }\n    ),\n    tombstones: Array.from(crListReplica.tombstones),\n  }\n}\n","import { indexFromPropertyKey } from '../.helpers/index.js'\nimport { CRListError } from '../.errors/class.js'\nimport type {\n  CRListState,\n  CRListSnapshot,\n  CRListEventListenerFor,\n  CRListEventMap,\n  CRListDelta,\n  CRListAck,\n} from '../.types/index.js'\nimport { __create, __read, __update, __delete } from '../core/crud/index.js'\nimport {\n  __merge,\n  __acknowledge,\n  __garbageCollect,\n  __snapshot,\n} from '../core/mags/index.js'\n\n/**\n * A convergent replicated list.\n *\n * Numeric property access reads and mutates the live list projection:\n * `list[0]` reads a detached copy of an entry, `list[0] = value` writes an\n * entry, and `delete list[0]` removes one entry. Iteration and `forEach()`\n * likewise expose detached copies rather than mutable references into the\n * replica state. Local mutations emit `delta` and `change` events; remote\n * merges emit `change` events.\n *\n * @typeParam T - The value type stored in the list.\n */\nexport class CRList<T> {\n  /**\n   * Reads or overwrites an entry in the live list projection by index.\n   *\n   * Reads return detached copies.\n   */\n  [index: number]: T\n  declare private readonly state: CRListState<T>\n  declare private readonly eventTarget: EventTarget\n\n  /**\n   * Creates a replicated list from an optional detached structured-clone-compatible snapshot.\n   *\n   * @param snapshot - A previously emitted CRList snapshot.\n   */\n  constructor(snapshot?: CRListSnapshot<T>) {\n    Object.defineProperties(this, {\n      state: {\n        value: __create<T>(snapshot),\n        enumerable: false,\n        configurable: false,\n        writable: false,\n      },\n      eventTarget: {\n        value: new EventTarget(),\n        enumerable: false,\n        configurable: false,\n        writable: false,\n      },\n    })\n\n    return new Proxy(this, {\n      get(target, index, receiver) {\n        const listIndex = indexFromPropertyKey(index)\n        // Preserve normal property access for non-index keys.\n        if (listIndex === undefined) return Reflect.get(target, index, receiver)\n        return __read(listIndex, target.state)\n      },\n      has(target, index) {\n        const listIndex = indexFromPropertyKey(index)\n        // Preserve normal property checks for non-index keys.\n        if (listIndex === undefined) return Reflect.has(target, index)\n        return listIndex >= 0 && listIndex < target.state.size\n      },\n      set(target, index, value) {\n        const listIndex = indexFromPropertyKey(index)\n        if (listIndex === undefined) return false\n        try {\n          const result = __update(listIndex, [value], target.state, 'overwrite')\n          if (!result) return false\n          const { delta, change } = result\n          if (delta)\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('delta', { detail: delta })\n            )\n          if (change)\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('change', { detail: change })\n            )\n          return true\n        } catch (error) {\n          if (error instanceof CRListError) throw error\n          return false\n        }\n      },\n      deleteProperty(target, index) {\n        const listIndex = indexFromPropertyKey(index)\n        if (listIndex === undefined) return false\n        try {\n          const result = __delete(target.state, listIndex, listIndex + 1)\n          if (!result) return false\n          const { delta, change } = result\n          if (delta) {\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('delta', { detail: delta })\n            )\n          }\n          if (change) {\n            void target.eventTarget.dispatchEvent(\n              new CustomEvent('change', { detail: change })\n            )\n          }\n          return true\n        } catch (error) {\n          if (error instanceof CRListError) throw error\n          return false\n        }\n      },\n      ownKeys(target) {\n        return [\n          ...Reflect.ownKeys(target),\n          ...Array.from({ length: target.size }, (_, index) => String(index)),\n        ]\n      },\n\n      getOwnPropertyDescriptor(target, index) {\n        const listIndex = indexFromPropertyKey(index)\n\n        if (listIndex !== undefined && listIndex < target.size) {\n          return {\n            value: __read(listIndex, target.state),\n            writable: true,\n            enumerable: true,\n            configurable: true,\n          }\n        }\n        // Preserve normal property checks for non-index keys.\n        return Reflect.getOwnPropertyDescriptor(target, index)\n      },\n    })\n  }\n  /**\n   * The current number of live entries.\n   */\n  get size(): number {\n    return this.state.size\n  }\n  /**\n   * Inserts a value before an index.\n   *\n   * If `beforeIndex` is omitted, the value is inserted at the start of the list.\n   *\n   * @param value - The value to insert.\n   * @param beforeIndex - The index to insert before.\n   */\n  prepend(value: T, beforeIndex?: number): void {\n    const result = __update<T>(beforeIndex ?? 0, [value], this.state, 'before')\n    if (!result) return\n    const { delta, change } = result\n    if (delta)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('delta', { detail: delta })\n      )\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Inserts a value after an index.\n   *\n   * If `afterIndex` is omitted, the value is appended at the end of the list.\n   *\n   * @param value - The value to insert.\n   * @param afterIndex - The index to insert after.\n   */\n  append(value: T, afterIndex?: number): void {\n    const result = __update<T>(\n      afterIndex ?? this.state.size,\n      [value],\n      this.state,\n      'after'\n    )\n    if (!result) return\n    const { delta, change } = result\n    if (delta)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('delta', { detail: delta })\n      )\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Removes the entry at an index.\n   *\n   * @param index - The index to remove.\n   */\n  remove(index: number): void {\n    const result = __delete(this.state, index, index + 1)\n    if (!result) return\n    const { delta, change } = result\n    if (delta)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('delta', { detail: delta })\n      )\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Applies a remote gossip delta to this list.\n   *\n   * Emits a `change` event when the merge changes the live projection.\n   *\n   * @param delta - The remote CRList delta to merge.\n   */\n  merge(delta: CRListDelta<T>): void {\n    const change = __merge(this.state, delta)\n    if (change)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('change', { detail: change })\n      )\n  }\n  /**\n   * Emits an acknowledgement frontier for currently retained tombstones.\n   */\n  acknowledge(): void {\n    const ack = __acknowledge(this.state)\n    if (ack)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('ack', { detail: ack })\n      )\n  }\n  /**\n   * Garbage-collects tombstones that are covered by acknowledgement frontiers.\n   *\n   * @param frontiers - Replica acknowledgement frontiers.\n   */\n  garbageCollect(frontiers: Array<CRListAck>): void {\n    void __garbageCollect(frontiers, this.state)\n  }\n  /**\n   * Emits the current detached structured-clone-compatible list snapshot.\n   */\n  snapshot(): void {\n    const snapshot = __snapshot<T>(this.state)\n    if (snapshot)\n      void this.eventTarget.dispatchEvent(\n        new CustomEvent('snapshot', { detail: snapshot })\n      )\n  }\n  /**\n   * Registers an event listener.\n   *\n   * @param type - The event type to listen for.\n   * @param listener - The listener to register.\n   * @param options - Listener registration options.\n   */\n  addEventListener<K extends keyof CRListEventMap<T>>(\n    type: K,\n    listener: CRListEventListenerFor<T, K> | null,\n    options?: boolean | AddEventListenerOptions\n  ): void {\n    this.eventTarget.addEventListener(\n      type,\n      listener as EventListenerOrEventListenerObject | null,\n      options\n    )\n  }\n\n  /**\n   * Removes an event listener.\n   *\n   * @param type - The event type to stop listening for.\n   * @param listener - The listener to remove.\n   * @param options - Listener removal options.\n   */\n  removeEventListener<K extends keyof CRListEventMap<T>>(\n    type: K,\n    listener: CRListEventListenerFor<T, K> | null,\n    options?: boolean | EventListenerOptions\n  ): void {\n    this.eventTarget.removeEventListener(\n      type,\n      listener as EventListenerOrEventListenerObject | null,\n      options\n    )\n  }\n  /**\n   * Returns a detached structured-clone-compatible snapshot of this list.\n   *\n   * Called automatically by `JSON.stringify`.\n   */\n  toJSON(): CRListSnapshot<T> {\n    return __snapshot<T>(this.state)\n  }\n  /**\n   * Attempts to return this list snapshot as a JSON string.\n   *\n   * This can fail when list values are not JSON-compatible.\n   */\n  toString(): string {\n    return JSON.stringify(this)\n  }\n  /**\n   * Returns the Node.js console inspection representation.\n   */\n  [Symbol.for('nodejs.util.inspect.custom')](): CRListSnapshot<T> {\n    return this.toJSON()\n  }\n  /**\n   * Returns the Deno console inspection representation.\n   */\n  [Symbol.for('Deno.customInspect')](): CRListSnapshot<T> {\n    return this.toJSON()\n  }\n  /**\n   * Iterates over detached copies of the current live values in index order.\n   */\n  *[Symbol.iterator](): IterableIterator<T> {\n    for (let index = 0; index < this.size; index++) {\n      const value = this[index]\n      yield value\n    }\n  }\n  /**\n   * Calls a function once for each live value copy in index order.\n   *\n   * Callback values are detached copies, so mutating them does not mutate the\n   * list.\n   *\n   * @param callback - Function to call for each value copy.\n   * @param thisArg - Optional `this` value for the callback.\n   */\n  forEach(\n    callback: (value: T, index: number, list: this) => void,\n    thisArg?: unknown\n  ): void {\n    for (let index = 0; index < this.size; index++) {\n      callback.call(thisArg, this[index], index, this)\n    }\n  }\n}\n"]}