@sovereignbase/convergent-replicated-list 1.3.4 → 1.3.5

package/dist/index.cjs

@@ -294,8 +294,17 @@ function trySpliceReplacement(crListReplica, insertedEntries, reparentedEntries,
   } else if (_optionalChain([crListReplica, 'access', _23 => _23.childrenMap, 'access', _24 => _24.get, 'call', _25 => _25(inserted.uuidv7), 'optionalAccess', _26 => _26.length])) {
     return false;
   }
-  if (_optionalChain([predecessor, 'optionalAccess', _27 => _27.next]) !== next) return false;
-  if (!predecessor && crListReplica.cursor !== next) return false;
+  if (predecessor) {
+    if (predecessor.next !== next) return false;
+  } else {
+    let reachable = 0;
+    let current2 = next;
+    while (current2) {
+      reachable++;
+      current2 = current2.next;
+    }
+    if (reachable !== crListReplica.parentMap.size - 1) return false;
+  }
   const expectedIndex = predecessor ? predecessor.index + 1 : 0;
   void linkEntryBetween(predecessor, inserted, next);
   let current = inserted;
@@ -312,6 +321,48 @@ function trySpliceReplacement(crListReplica, insertedEntries, reparentedEntries,
   return true;
 }
 
+// src/.helpers/trySpliceSiblingInsert/index.ts
+function trySpliceSiblingInsert(crListReplica, insertedEntries, reparentedEntries, tombstoneCount) {
+  if (tombstoneCount !== 0 || insertedEntries.length !== 1 || reparentedEntries.length !== 0)
+    return false;
+  const inserted = insertedEntries[0];
+  if (inserted.predecessor === "\0") return false;
+  if (_optionalChain([crListReplica, 'access', _27 => _27.childrenMap, 'access', _28 => _28.get, 'call', _29 => _29(inserted.uuidv7), 'optionalAccess', _30 => _30.length])) return false;
+  const predecessor = crListReplica.parentMap.get(inserted.predecessor);
+  const siblings = crListReplica.childrenMap.get(inserted.predecessor);
+  if (!predecessor || !siblings || siblings.length < 2) return false;
+  void siblings.sort((a, b) => a.uuidv7 > b.uuidv7 ? 1 : -1);
+  const siblingIndex = siblings.indexOf(inserted);
+  if (siblingIndex === -1) return false;
+  const lastSibling = siblings[siblings.length - 1];
+  if (lastSibling !== inserted && lastSibling.next) return false;
+  const previousSibling = siblings[siblingIndex - 1];
+  const nextSibling = siblings[siblingIndex + 1];
+  if (_optionalChain([previousSibling, 'optionalAccess', _31 => _31.uuidv7])) {
+    if (_optionalChain([crListReplica, 'access', _32 => _32.childrenMap, 'access', _33 => _33.get, 'call', _34 => _34(previousSibling.uuidv7), 'optionalAccess', _35 => _35.length]))
+      return false;
+    if (previousSibling.next !== nextSibling) return false;
+  } else if (predecessor.next !== nextSibling) {
+    return false;
+  }
+  const prev = _nullishCoalesce(previousSibling, () => ( predecessor));
+  const next = nextSibling;
+  if (next && next.prev !== prev) return false;
+  void linkEntryBetween(prev, inserted, next);
+  let current = inserted;
+  let index = prev.index + 1;
+  while (current) {
+    current.index = index;
+    index++;
+    current = current.next;
+  }
+  crListReplica.index = /* @__PURE__ */ new Map([[inserted.index, inserted]]);
+  crListReplica.cursor = inserted;
+  crListReplica.cursorIndex = inserted.index;
+  crListReplica.size = crListReplica.parentMap.size;
+  return true;
+}
+
 // src/core/crud/create/index.ts
 
 function __create(snapshot) {
@@ -343,11 +394,11 @@ function __create(snapshot) {
     );
     if (!linkedListEntry) continue;
     void attachEntryToIndexes(crListReplica, linkedListEntry);
-    if (canUseLinearProjection && linkedListEntry.predecessor === (_nullishCoalesce(_optionalChain([previous, 'optionalAccess', _28 => _28.uuidv7]), () => ( "\0")))) {
+    if (canUseLinearProjection && linkedListEntry.predecessor === (_nullishCoalesce(_optionalChain([previous, 'optionalAccess', _36 => _36.uuidv7]), () => ( "\0")))) {
       linkedListEntry.index = crListReplica.parentMap.size - 1;
       void linkEntryBetween(previous, linkedListEntry, void 0);
       previous = linkedListEntry;
-      void _optionalChain([crListReplica, 'access', _29 => _29.index, 'optionalAccess', _30 => _30.set, 'call', _31 => _31(linkedListEntry.index, linkedListEntry)]);
+      void _optionalChain([crListReplica, 'access', _37 => _37.index, 'optionalAccess', _38 => _38.set, 'call', _39 => _39(linkedListEntry.index, linkedListEntry)]);
       continue;
     }
     canUseLinearProjection = false;
@@ -366,7 +417,7 @@ function __create(snapshot) {
 function __read(targetIndex, crListReplica) {
   try {
     void seekCursorToIndex(targetIndex, crListReplica);
-    return _optionalChain([crListReplica, 'access', _32 => _32.cursor, 'optionalAccess', _33 => _33.value]);
+    return _optionalChain([crListReplica, 'access', _40 => _40.cursor, 'optionalAccess', _41 => _41.value]);
   } catch (e) {
     return void 0;
   }
@@ -402,7 +453,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
             crListReplica.cursor = linkedListEntry;
             crListReplica.cursorIndex = linkedListEntry.index;
             void attachEntryToIndexes(crListReplica, linkedListEntry, delta);
-            _optionalChain([crListReplica, 'access', _34 => _34.index, 'optionalAccess', _35 => _35.set, 'call', _36 => _36(linkedListEntry.index, linkedListEntry)]);
+            _optionalChain([crListReplica, 'access', _42 => _42.index, 'optionalAccess', _43 => _43.set, 'call', _44 => _44(linkedListEntry.index, linkedListEntry)]);
             change[linkedListEntry.index] = linkedListEntry.value;
             break;
           }
@@ -418,7 +469,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
           void attachEntryToIndexes(crListReplica, linkedListEntry, delta);
           crListReplica.cursor = linkedListEntry;
           crListReplica.cursorIndex = linkedListEntry.index;
-          void _optionalChain([crListReplica, 'access', _37 => _37.index, 'optionalAccess', _38 => _38.set, 'call', _39 => _39(linkedListEntry.index, linkedListEntry)]);
+          void _optionalChain([crListReplica, 'access', _45 => _45.index, 'optionalAccess', _46 => _46.set, 'call', _47 => _47(linkedListEntry.index, linkedListEntry)]);
           change[linkedListEntry.index] = linkedListEntry.value;
           break;
         }
@@ -445,13 +496,13 @@ function __update(listIndex, listValues, crListReplica, mode) {
         }
         void attachEntryToIndexes(crListReplica, linkedListEntry, delta);
         void crListReplica.tombstones.add(entryToOverwrite.uuidv7);
-        void _optionalChain([delta, 'access', _40 => _40.tombstones, 'optionalAccess', _41 => _41.push, 'call', _42 => _42(entryToOverwrite.uuidv7)]);
+        void _optionalChain([delta, 'access', _48 => _48.tombstones, 'optionalAccess', _49 => _49.push, 'call', _50 => _50(entryToOverwrite.uuidv7)]);
         void detachEntryFromIndexes(crListReplica, entryToOverwrite);
         entryToOverwrite.next = void 0;
         entryToOverwrite.prev = void 0;
         crListReplica.cursor = linkedListEntry;
         crListReplica.cursorIndex = actualIndex;
-        void _optionalChain([crListReplica, 'access', _43 => _43.index, 'optionalAccess', _44 => _44.set, 'call', _45 => _45(linkedListEntry.index, linkedListEntry)]);
+        void _optionalChain([crListReplica, 'access', _51 => _51.index, 'optionalAccess', _52 => _52.set, 'call', _53 => _53(linkedListEntry.index, linkedListEntry)]);
         change[actualIndex] = linkedListEntry.value;
         break;
       }
@@ -460,7 +511,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
           crListReplica.cursor = linkedListEntry;
           crListReplica.cursorIndex = linkedListEntry.index;
           void attachEntryToIndexes(crListReplica, linkedListEntry, delta);
-          void _optionalChain([crListReplica, 'access', _46 => _46.index, 'optionalAccess', _47 => _47.set, 'call', _48 => _48(linkedListEntry.index, linkedListEntry)]);
+          void _optionalChain([crListReplica, 'access', _54 => _54.index, 'optionalAccess', _55 => _55.set, 'call', _56 => _56(linkedListEntry.index, linkedListEntry)]);
           change[linkedListEntry.index] = linkedListEntry.value;
           break;
         }
@@ -489,7 +540,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
         crListReplica.cursor = linkedListEntry;
         crListReplica.cursorIndex = linkedListEntry.index;
         if (next) crListReplica.index = /* @__PURE__ */ new Map();
-        void _optionalChain([crListReplica, 'access', _49 => _49.index, 'optionalAccess', _50 => _50.set, 'call', _51 => _51(linkedListEntry.index, linkedListEntry)]);
+        void _optionalChain([crListReplica, 'access', _57 => _57.index, 'optionalAccess', _58 => _58.set, 'call', _59 => _59(linkedListEntry.index, linkedListEntry)]);
         change[linkedListEntry.index] = linkedListEntry.value;
         break;
       }
@@ -498,7 +549,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
           crListReplica.cursor = linkedListEntry;
           crListReplica.cursorIndex = linkedListEntry.index;
           void attachEntryToIndexes(crListReplica, linkedListEntry, delta);
-          void _optionalChain([crListReplica, 'access', _52 => _52.index, 'optionalAccess', _53 => _53.set, 'call', _54 => _54(linkedListEntry.index, linkedListEntry)]);
+          void _optionalChain([crListReplica, 'access', _60 => _60.index, 'optionalAccess', _61 => _61.set, 'call', _62 => _62(linkedListEntry.index, linkedListEntry)]);
           change[linkedListEntry.index] = linkedListEntry.value;
           mode = "after";
           listIndex = linkedListEntry.index - 1;
@@ -509,7 +560,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
         const actualIndex = _nullishCoalesce(crListReplica.cursorIndex, () => ( listIndex));
         const prev = crListReplica.cursor.prev;
         linkedListEntry.index = actualIndex;
-        linkedListEntry.predecessor = _nullishCoalesce(_optionalChain([prev, 'optionalAccess', _55 => _55.uuidv7]), () => ( "\0"));
+        linkedListEntry.predecessor = _nullishCoalesce(_optionalChain([prev, 'optionalAccess', _63 => _63.uuidv7]), () => ( "\0"));
         void linkEntryBetween(prev, linkedListEntry, crListReplica.cursor);
         if (crListReplica.cursor.predecessor === linkedListEntry.predecessor) {
           void moveEntryToPredecessor(
@@ -523,7 +574,7 @@ function __update(listIndex, listValues, crListReplica, mode) {
         crListReplica.cursor = linkedListEntry;
         crListReplica.cursorIndex = actualIndex;
         crListReplica.index = /* @__PURE__ */ new Map();
-        void _optionalChain([crListReplica, 'access', _56 => _56.index, 'optionalAccess', _57 => _57.set, 'call', _58 => _58(linkedListEntry.index, linkedListEntry)]);
+        void _optionalChain([crListReplica, 'access', _64 => _64.index, 'optionalAccess', _65 => _65.set, 'call', _66 => _66(linkedListEntry.index, linkedListEntry)]);
         change[actualIndex] = linkedListEntry.value;
         mode = "after";
         listIndex = linkedListEntry.index - 1;
@@ -550,7 +601,7 @@ function __delete(crListReplica, startIndex, endIndex) {
   void seekCursorToIndex(listIndex, crListReplica);
   if (!crListReplica.cursor) return false;
   let current = crListReplica.cursor;
-  const predecessor = _nullishCoalesce(_optionalChain([current, 'access', _59 => _59.prev, 'optionalAccess', _60 => _60.uuidv7]), () => ( "\0"));
+  const predecessor = _nullishCoalesce(_optionalChain([current, 'access', _67 => _67.prev, 'optionalAccess', _68 => _68.uuidv7]), () => ( "\0"));
   const deletedIds = /* @__PURE__ */ new Set();
   let deleted = 0;
   let currentIndex = _nullishCoalesce(crListReplica.cursorIndex, () => ( listIndex));
@@ -558,7 +609,7 @@ function __delete(crListReplica, startIndex, endIndex) {
     const next = current.next;
     change[currentIndex] = void 0;
     void deletedIds.add(current.uuidv7);
-    void _optionalChain([crListReplica, 'access', _61 => _61.index, 'optionalAccess', _62 => _62.delete, 'call', _63 => _63(currentIndex)]);
+    void _optionalChain([crListReplica, 'access', _69 => _69.index, 'optionalAccess', _70 => _70.delete, 'call', _71 => _71(currentIndex)]);
     void deleteLiveEntry(crListReplica, current, delta);
     current = next;
     currentIndex++;
@@ -578,7 +629,7 @@ function __delete(crListReplica, startIndex, endIndex) {
     void deleteLiveEntry(crListReplica, current, delta);
     void linkEntryBetween(prev, replacement, next);
     void attachEntryToIndexes(crListReplica, replacement, delta);
-    if (_optionalChain([next, 'optionalAccess', _64 => _64.predecessor]) === current.uuidv7)
+    if (_optionalChain([next, 'optionalAccess', _72 => _72.predecessor]) === current.uuidv7)
       void moveEntryToPredecessor(
         crListReplica,
         next,
@@ -624,7 +675,7 @@ function __merge(crListReplica, crListDelta) {
       crListReplica.cursorIndex = linkedListEntry.index;
       void attachEntryToIndexes(crListReplica, linkedListEntry);
       crListReplica.size = crListReplica.parentMap.size;
-      void _optionalChain([crListReplica, 'access', _65 => _65.index, 'optionalAccess', _66 => _66.set, 'call', _67 => _67(linkedListEntry.index, linkedListEntry)]);
+      void _optionalChain([crListReplica, 'access', _73 => _73.index, 'optionalAccess', _74 => _74.set, 'call', _75 => _75(linkedListEntry.index, linkedListEntry)]);
       return { [linkedListEntry.index]: linkedListEntry.value };
     }
   }
@@ -638,19 +689,19 @@ function __merge(crListReplica, crListDelta) {
         const wasTail = linkedListEntry.next === void 0;
         const wasCursor = crListReplica.cursor === linkedListEntry;
         void newTombsIndices.push(linkedListEntry.index);
-        void _optionalChain([crListReplica, 'access', _68 => _68.index, 'optionalAccess', _69 => _69.delete, 'call', _70 => _70(linkedListEntry.index)]);
+        void _optionalChain([crListReplica, 'access', _76 => _76.index, 'optionalAccess', _77 => _77.delete, 'call', _78 => _78(linkedListEntry.index)]);
         void deleteLiveEntry(crListReplica, linkedListEntry);
         tailTombstoneMovedCursor = wasTail && wasCursor;
         needsRelink = true;
       }
     }
   }
-  if (!Object.hasOwn(crListDelta, "values") || !Array.isArray(crListDelta.values)) {
+  if (!Object.hasOwn(crListDelta, "values") || !Array.isArray(crListDelta.values) || crListDelta.values.length === 0 && tailTombstoneMovedCursor) {
     if (newTombsIndices.length === 0) return false;
     if (newTombsIndices.length === 1 && tailTombstoneMovedCursor) {
       if (crListReplica.cursor) {
         crListReplica.cursorIndex = crListReplica.size - 1;
-        void _optionalChain([crListReplica, 'access', _71 => _71.index, 'optionalAccess', _72 => _72.set, 'call', _73 => _73(
+        void _optionalChain([crListReplica, 'access', _79 => _79.index, 'optionalAccess', _80 => _80.set, 'call', _81 => _81(
           crListReplica.cursorIndex,
           crListReplica.cursor
         )]);
@@ -697,7 +748,7 @@ function __merge(crListReplica, crListDelta) {
         crListReplica.cursor = linkedListEntry;
         crListReplica.cursorIndex = linkedListEntry.index;
         crListReplica.size = crListReplica.parentMap.size;
-        void _optionalChain([crListReplica, 'access', _74 => _74.index, 'optionalAccess', _75 => _75.set, 'call', _76 => _76(linkedListEntry.index, linkedListEntry)]);
+        void _optionalChain([crListReplica, 'access', _82 => _82.index, 'optionalAccess', _83 => _83.set, 'call', _84 => _84(linkedListEntry.index, linkedListEntry)]);
       } else {
         needsRelink = true;
       }
@@ -708,13 +759,18 @@ function __merge(crListReplica, crListDelta) {
       crListReplica.cursor = linkedListEntry;
       crListReplica.cursorIndex = linkedListEntry.index;
       crListReplica.size = crListReplica.parentMap.size;
-      void _optionalChain([crListReplica, 'access', _77 => _77.index, 'optionalAccess', _78 => _78.set, 'call', _79 => _79(linkedListEntry.index, linkedListEntry)]);
+      void _optionalChain([crListReplica, 'access', _85 => _85.index, 'optionalAccess', _86 => _86.set, 'call', _87 => _87(linkedListEntry.index, linkedListEntry)]);
     } else {
       needsRelink = true;
     }
   }
   if (needsRelink) {
-    if (!trySpliceInsertedParent(crListReplica, newVals, reparentedVals) && !trySpliceReplacement(
+    if (!trySpliceSiblingInsert(
+      crListReplica,
+      newVals,
+      reparentedVals,
+      newTombsIndices.length
+    ) && !trySpliceInsertedParent(crListReplica, newVals, reparentedVals) && !trySpliceReplacement(
       crListReplica,
       newVals,
       reparentedVals,
@@ -903,12 +959,13 @@ var CRList = class {
     if (change) void dispatchCRListEvent(this.eventTarget, "change", change);
   }
   /**
-   * Removes the entry at an index.
+   * Removes one or more entries starting at an index.
    *
-   * @param index - The index to remove.
+   * @param index - The first index to remove.
+   * @param count - Number of entries to remove. Defaults to `1`.
    */
-  remove(index) {
-    const result = __delete(this.state, index, index + 1);
+  remove(index, count = 1) {
+    const result = __delete(this.state, index, index + count);
     if (!result) return;
     const { delta, change } = result;
     if (delta) void dispatchCRListEvent(this.eventTarget, "delta", delta);
@@ -924,8 +981,8 @@ var CRList = class {
    * @param thisArg - Optional `this` value for the predicate.
    */
   find(predicate, thisArg) {
-    let linkedListEntry = _nullishCoalesce(_optionalChain([this, 'access', _80 => _80.state, 'access', _81 => _81.index, 'optionalAccess', _82 => _82.get, 'call', _83 => _83(0)]), () => ( this.state.cursor));
-    while (_optionalChain([linkedListEntry, 'optionalAccess', _84 => _84.prev])) linkedListEntry = linkedListEntry.prev;
+    let linkedListEntry = _nullishCoalesce(_optionalChain([this, 'access', _88 => _88.state, 'access', _89 => _89.index, 'optionalAccess', _90 => _90.get, 'call', _91 => _91(0)]), () => ( this.state.cursor));
+    while (_optionalChain([linkedListEntry, 'optionalAccess', _92 => _92.prev])) linkedListEntry = linkedListEntry.prev;
     let index = 0;
     while (linkedListEntry) {
       if (predicate.call(thisArg, linkedListEntry.value, index, this))
@@ -1035,8 +1092,8 @@ var CRList = class {
    * Iterates over current live values in index order.
    */
   *[Symbol.iterator]() {
-    let linkedListEntry = _nullishCoalesce(_optionalChain([this, 'access', _85 => _85.state, 'access', _86 => _86.index, 'optionalAccess', _87 => _87.get, 'call', _88 => _88(0)]), () => ( this.state.cursor));
-    while (_optionalChain([linkedListEntry, 'optionalAccess', _89 => _89.prev])) linkedListEntry = linkedListEntry.prev;
+    let linkedListEntry = _nullishCoalesce(_optionalChain([this, 'access', _93 => _93.state, 'access', _94 => _94.index, 'optionalAccess', _95 => _95.get, 'call', _96 => _96(0)]), () => ( this.state.cursor));
+    while (_optionalChain([linkedListEntry, 'optionalAccess', _97 => _97.prev])) linkedListEntry = linkedListEntry.prev;
     while (linkedListEntry) {
       yield linkedListEntry.value;
       linkedListEntry = linkedListEntry.next;
@@ -1052,8 +1109,8 @@ var CRList = class {
    * @param thisArg - Optional `this` value for the callback.
    */
   forEach(callback, thisArg) {
-    let linkedListEntry = _nullishCoalesce(_optionalChain([this, 'access', _90 => _90.state, 'access', _91 => _91.index, 'optionalAccess', _92 => _92.get, 'call', _93 => _93(0)]), () => ( this.state.cursor));
-    while (_optionalChain([linkedListEntry, 'optionalAccess', _94 => _94.prev])) linkedListEntry = linkedListEntry.prev;
+    let linkedListEntry = _nullishCoalesce(_optionalChain([this, 'access', _98 => _98.state, 'access', _99 => _99.index, 'optionalAccess', _100 => _100.get, 'call', _101 => _101(0)]), () => ( this.state.cursor));
+    while (_optionalChain([linkedListEntry, 'optionalAccess', _102 => _102.prev])) linkedListEntry = linkedListEntry.prev;
     let index = 0;
     while (linkedListEntry) {
       void callback.call(thisArg, linkedListEntry.value, index, this);