serializable-bptree 8.1.0 → 8.1.2

package/README.md

@@ -134,7 +134,7 @@ Explore the detailed guides and concepts of `serializable-bptree`:
   - [Best Practices](./docs/BEST_PRACTICES.md): Tips for bulk insertion and performance optimization.
   - [Duplicate Value Handling](./docs/DUPLICATE_VALUES.md): Strategies for managing large amounts of duplicate data.
   - [Concurrency & Synchronization](./docs/CONCURRENCY.md): Multi-instance usage and locking mechanisms.
-  - [Query Optimization Guide](./docs/QUERY.md#performance--optimization): How to use `ChooseDriver`, `get()`, and `verify()` for complex queries.
+  - [Query Optimization Guide](./docs/QUERY.md#performance--optimization): How to use `ChooseDriver` and `keys()` for complex queries.
 
 ## Quick Example: Query Optimization
 
@@ -144,19 +144,20 @@ When you have multiple indexes (e.g., an index for `id` and another for `age`),
 const query = { id: { equal: 100 }, age: { gt: 20 } }
 
 // 1. Select the best index based on condition priority
-const driver = BPTreeSync.ChooseDriver([
+const candidates = [
   { tree: idxId, condition: query.id },
   { tree: idxAge, condition: query.age }
-])
+]
+const driver = BPTreeSync.ChooseDriver(candidates)
+const others = candidates.filter((c) => driver.tree !== c.tree)
 
 // 2. Execute query using the selected driver
-for (const [pk, val] of driver.tree.whereStream(driver.condition)) {
-  // 3. Filter other conditions using get() and verify()
-  const age = idxAge.get(pk)
-  if (age !== undefined && idxAge.verify(age, query.age)) {
-    console.log(`Match found! PK: ${pk}`)
-  }
+let keys = driver.tree.keys(driver.condition)
+for (const { tree, condition } of others) {
+  keys = tree.keys(condition, keys)
 }
+
+console.log('Found: ', keys)
 ```
 
 ## Migration
@@ -165,6 +166,4 @@ Instructions for migrating between major versions (e.g., v8.0.0, v6.0.0) can be
 
 ## LICENSE
 
-## LICENSE
-
 MIT LICENSE

package/dist/cjs/index.cjs

@@ -222,6 +222,45 @@ var MVCCTransaction = class {
     }
     return { success: true, created, updated, deleted };
   }
+  /**
+   * Cleans up both deletedCache and versionIndex based on minActiveVersion.
+   * Root transactions call this after commit to reclaim memory.
+   */
+  _cleanupDeletedCache() {
+    if (this.deletedCache.size === 0 && this.versionIndex.size === 0) return;
+    let minActiveVersion = this.version;
+    if (this.activeTransactions.size > 0) {
+      for (const tx of this.activeTransactions) {
+        if (!tx.committed && tx.snapshotVersion < minActiveVersion) {
+          minActiveVersion = tx.snapshotVersion;
+        }
+      }
+    }
+    if (this.deletedCache.size > 0) {
+      for (const [key, cachedList] of this.deletedCache) {
+        const remaining = cachedList.filter((item) => item.deletedAtVersion > minActiveVersion);
+        if (remaining.length === 0) {
+          this.deletedCache.delete(key);
+        } else {
+          this.deletedCache.set(key, remaining);
+        }
+      }
+    }
+    if (this.versionIndex.size > 0) {
+      for (const [key, versions] of this.versionIndex) {
+        let latestInSnapshotIdx = -1;
+        for (let i = versions.length - 1; i >= 0; i--) {
+          if (versions[i].version <= minActiveVersion) {
+            latestInSnapshotIdx = i;
+            break;
+          }
+        }
+        if (latestInSnapshotIdx > 0) {
+          versions.splice(0, latestInSnapshotIdx);
+        }
+      }
+    }
+  }
 };
 var SyncMVCCStrategy = class extends MVCCStrategy {
 };
@@ -561,25 +600,6 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
     this.versionIndex.get(key).push({ version: snapshotVersion, exists: false });
   }
-  _cleanupDeletedCache() {
-    if (this.deletedCache.size === 0) return;
-    let minActiveVersion = this.version;
-    if (this.activeTransactions.size > 0) {
-      for (const tx of this.activeTransactions) {
-        if (!tx.committed && tx.snapshotVersion < minActiveVersion) {
-          minActiveVersion = tx.snapshotVersion;
-        }
-      }
-    }
-    for (const [key, cachedList] of this.deletedCache) {
-      const remaining = cachedList.filter((item) => item.deletedAtVersion > minActiveVersion);
-      if (remaining.length === 0) {
-        this.deletedCache.delete(key);
-      } else {
-        this.deletedCache.set(key, remaining);
-      }
-    }
-  }
 };
 var AsyncMVCCStrategy = class extends MVCCStrategy {
 };
@@ -1188,25 +1208,6 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
     this.versionIndex.get(key).push({ version: snapshotVersion, exists: false });
   }
-  _cleanupDeletedCache() {
-    if (this.deletedCache.size === 0) return;
-    let minActiveVersion = this.version;
-    if (this.activeTransactions.size > 0) {
-      for (const tx of this.activeTransactions) {
-        if (!tx.committed && tx.snapshotVersion < minActiveVersion) {
-          minActiveVersion = tx.snapshotVersion;
-        }
-      }
-    }
-    for (const [key, cachedList] of this.deletedCache) {
-      const remaining = cachedList.filter((item) => item.deletedAtVersion > minActiveVersion);
-      if (remaining.length === 0) {
-        this.deletedCache.delete(key);
-      } else {
-        this.deletedCache.set(key, remaining);
-      }
-    }
-  }
 };
 
 // node_modules/cache-entanglement/dist/esm/index.mjs
@@ -1817,6 +1818,25 @@ var BPTreeTransaction = class _BPTreeTransaction {
     this._cachedRegexp.clear();
     this.nodes.clear();
   }
+  _binarySearchValues(values, target, usePrimary = false, upperBound = false) {
+    let low = 0;
+    let high = values.length;
+    let found = false;
+    while (low < high) {
+      const mid = low + high >>> 1;
+      const cmp = usePrimary ? this.comparator.primaryAsc(target, values[mid]) : this.comparator.asc(target, values[mid]);
+      if (cmp === 0) {
+        found = true;
+        if (upperBound) low = mid + 1;
+        else high = mid;
+      } else if (cmp < 0) {
+        high = mid;
+      } else {
+        low = mid + 1;
+      }
+    }
+    return { index: low, found };
+  }
 };
 
 // src/transaction/BPTreeSyncTransaction.ts
@@ -1978,58 +1998,24 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
   insertableNode(value) {
     let node = this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isSame(value, nValue)) {
-          node = this.getNode(k[i + 1]);
-          break;
-        } else if (this.comparator.isLower(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, false, true);
+      node = this.getNode(node.keys[index]);
     }
     return node;
   }
   insertableNodeByPrimary(value) {
     let node = this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimarySame(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        } else if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, false);
+      node = this.getNode(node.keys[index]);
     }
     return node;
   }
   insertableRightestNodeByPrimary(value) {
     let node = this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        }
-        if (i + 1 === node.values.length) {
-          node = this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, true);
+      node = this.getNode(node.keys[index]);
     }
     return node;
   }
@@ -2162,12 +2148,11 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
   }
   exists(key, value) {
     const node = this.insertableNode(value);
-    for (let i = 0, len = node.values.length; i < len; i++) {
-      if (this.comparator.isSame(value, node.values[i])) {
-        const keys = node.keys[i];
-        if (keys.includes(key)) {
-          return true;
-        }
+    const { index, found } = this._binarySearchValues(node.values, value);
+    if (found) {
+      const keys = node.keys[index];
+      if (keys.includes(key)) {
+        return true;
       }
     }
     return false;
@@ -2803,58 +2788,24 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
   async insertableNode(value) {
     let node = await this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isSame(value, nValue)) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        } else if (this.comparator.isLower(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, false, true);
+      node = await this.getNode(node.keys[index]);
     }
     return node;
   }
   async insertableNodeByPrimary(value) {
     let node = await this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimarySame(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        } else if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, false);
+      node = await this.getNode(node.keys[index]);
     }
     return node;
   }
   async insertableRightestNodeByPrimary(value) {
     let node = await this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        }
-        if (i + 1 === node.values.length) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, true);
+      node = await this.getNode(node.keys[index]);
     }
     return node;
   }
@@ -2907,11 +2858,21 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
     let node = startNode;
     let done = false;
     let hasMatched = false;
+    let nextNodePromise = null;
     while (!done) {
       if (endNode && node.id === endNode.id) {
         done = true;
         break;
       }
+      if (direction === 1) {
+        if (node.next && !done) {
+          nextNodePromise = this.getNode(node.next);
+        }
+      } else {
+        if (node.prev && !done) {
+          nextNodePromise = this.getNode(node.prev);
+        }
+      }
       const len = node.values.length;
       if (direction === 1) {
         for (let i = 0; i < len; i++) {
@@ -2944,19 +2905,15 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
           }
         }
       }
-      if (done) break;
-      if (direction === 1) {
-        if (!node.next) {
-          done = true;
-          break;
-        }
-        node = await this.getNode(node.next);
+      if (done) {
+        if (nextNodePromise) await nextNodePromise;
+        break;
+      }
+      if (nextNodePromise) {
+        node = await nextNodePromise;
+        nextNodePromise = null;
       } else {
-        if (!node.prev) {
-          done = true;
-          break;
-        }
-        node = await this.getNode(node.prev);
+        done = true;
       }
     }
   }
@@ -2987,12 +2944,11 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
   }
   async exists(key, value) {
     const node = await this.insertableNode(value);
-    for (let i = 0, len = node.values.length; i < len; i++) {
-      if (this.comparator.isSame(value, node.values[i])) {
-        const keys = node.keys[i];
-        if (keys.includes(key)) {
-          return true;
-        }
+    const { index, found } = this._binarySearchValues(node.values, value);
+    if (found) {
+      const keys = node.keys[index];
+      if (keys.includes(key)) {
+        return true;
       }
     }
     return false;

package/dist/esm/index.mjs

@@ -186,6 +186,45 @@ var MVCCTransaction = class {
     }
     return { success: true, created, updated, deleted };
   }
+  /**
+   * Cleans up both deletedCache and versionIndex based on minActiveVersion.
+   * Root transactions call this after commit to reclaim memory.
+   */
+  _cleanupDeletedCache() {
+    if (this.deletedCache.size === 0 && this.versionIndex.size === 0) return;
+    let minActiveVersion = this.version;
+    if (this.activeTransactions.size > 0) {
+      for (const tx of this.activeTransactions) {
+        if (!tx.committed && tx.snapshotVersion < minActiveVersion) {
+          minActiveVersion = tx.snapshotVersion;
+        }
+      }
+    }
+    if (this.deletedCache.size > 0) {
+      for (const [key, cachedList] of this.deletedCache) {
+        const remaining = cachedList.filter((item) => item.deletedAtVersion > minActiveVersion);
+        if (remaining.length === 0) {
+          this.deletedCache.delete(key);
+        } else {
+          this.deletedCache.set(key, remaining);
+        }
+      }
+    }
+    if (this.versionIndex.size > 0) {
+      for (const [key, versions] of this.versionIndex) {
+        let latestInSnapshotIdx = -1;
+        for (let i = versions.length - 1; i >= 0; i--) {
+          if (versions[i].version <= minActiveVersion) {
+            latestInSnapshotIdx = i;
+            break;
+          }
+        }
+        if (latestInSnapshotIdx > 0) {
+          versions.splice(0, latestInSnapshotIdx);
+        }
+      }
+    }
+  }
 };
 var SyncMVCCStrategy = class extends MVCCStrategy {
 };
@@ -525,25 +564,6 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
     this.versionIndex.get(key).push({ version: snapshotVersion, exists: false });
   }
-  _cleanupDeletedCache() {
-    if (this.deletedCache.size === 0) return;
-    let minActiveVersion = this.version;
-    if (this.activeTransactions.size > 0) {
-      for (const tx of this.activeTransactions) {
-        if (!tx.committed && tx.snapshotVersion < minActiveVersion) {
-          minActiveVersion = tx.snapshotVersion;
-        }
-      }
-    }
-    for (const [key, cachedList] of this.deletedCache) {
-      const remaining = cachedList.filter((item) => item.deletedAtVersion > minActiveVersion);
-      if (remaining.length === 0) {
-        this.deletedCache.delete(key);
-      } else {
-        this.deletedCache.set(key, remaining);
-      }
-    }
-  }
 };
 var AsyncMVCCStrategy = class extends MVCCStrategy {
 };
@@ -1152,25 +1172,6 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
     this.versionIndex.get(key).push({ version: snapshotVersion, exists: false });
   }
-  _cleanupDeletedCache() {
-    if (this.deletedCache.size === 0) return;
-    let minActiveVersion = this.version;
-    if (this.activeTransactions.size > 0) {
-      for (const tx of this.activeTransactions) {
-        if (!tx.committed && tx.snapshotVersion < minActiveVersion) {
-          minActiveVersion = tx.snapshotVersion;
-        }
-      }
-    }
-    for (const [key, cachedList] of this.deletedCache) {
-      const remaining = cachedList.filter((item) => item.deletedAtVersion > minActiveVersion);
-      if (remaining.length === 0) {
-        this.deletedCache.delete(key);
-      } else {
-        this.deletedCache.set(key, remaining);
-      }
-    }
-  }
 };
 
 // node_modules/cache-entanglement/dist/esm/index.mjs
@@ -1781,6 +1782,25 @@ var BPTreeTransaction = class _BPTreeTransaction {
     this._cachedRegexp.clear();
     this.nodes.clear();
   }
+  _binarySearchValues(values, target, usePrimary = false, upperBound = false) {
+    let low = 0;
+    let high = values.length;
+    let found = false;
+    while (low < high) {
+      const mid = low + high >>> 1;
+      const cmp = usePrimary ? this.comparator.primaryAsc(target, values[mid]) : this.comparator.asc(target, values[mid]);
+      if (cmp === 0) {
+        found = true;
+        if (upperBound) low = mid + 1;
+        else high = mid;
+      } else if (cmp < 0) {
+        high = mid;
+      } else {
+        low = mid + 1;
+      }
+    }
+    return { index: low, found };
+  }
 };
 
 // src/transaction/BPTreeSyncTransaction.ts
@@ -1942,58 +1962,24 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
   insertableNode(value) {
     let node = this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isSame(value, nValue)) {
-          node = this.getNode(k[i + 1]);
-          break;
-        } else if (this.comparator.isLower(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, false, true);
+      node = this.getNode(node.keys[index]);
     }
     return node;
   }
   insertableNodeByPrimary(value) {
     let node = this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimarySame(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        } else if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, false);
+      node = this.getNode(node.keys[index]);
     }
     return node;
   }
   insertableRightestNodeByPrimary(value) {
     let node = this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = this.getNode(k[i]);
-          break;
-        }
-        if (i + 1 === node.values.length) {
-          node = this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, true);
+      node = this.getNode(node.keys[index]);
     }
     return node;
   }
@@ -2126,12 +2112,11 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
   }
   exists(key, value) {
     const node = this.insertableNode(value);
-    for (let i = 0, len = node.values.length; i < len; i++) {
-      if (this.comparator.isSame(value, node.values[i])) {
-        const keys = node.keys[i];
-        if (keys.includes(key)) {
-          return true;
-        }
+    const { index, found } = this._binarySearchValues(node.values, value);
+    if (found) {
+      const keys = node.keys[index];
+      if (keys.includes(key)) {
+        return true;
       }
     }
     return false;
@@ -2767,58 +2752,24 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
   async insertableNode(value) {
     let node = await this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isSame(value, nValue)) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        } else if (this.comparator.isLower(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, false, true);
+      node = await this.getNode(node.keys[index]);
     }
     return node;
   }
   async insertableNodeByPrimary(value) {
     let node = await this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimarySame(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        } else if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        } else if (i + 1 === node.values.length) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, false);
+      node = await this.getNode(node.keys[index]);
     }
     return node;
   }
   async insertableRightestNodeByPrimary(value) {
     let node = await this.getNode(this.rootId);
     while (!node.leaf) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
-        const k = node.keys;
-        if (this.comparator.isPrimaryLower(value, nValue)) {
-          node = await this.getNode(k[i]);
-          break;
-        }
-        if (i + 1 === node.values.length) {
-          node = await this.getNode(k[i + 1]);
-          break;
-        }
-      }
+      const { index } = this._binarySearchValues(node.values, value, true, true);
+      node = await this.getNode(node.keys[index]);
     }
     return node;
   }
@@ -2871,11 +2822,21 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
     let node = startNode;
     let done = false;
     let hasMatched = false;
+    let nextNodePromise = null;
     while (!done) {
       if (endNode && node.id === endNode.id) {
         done = true;
         break;
       }
+      if (direction === 1) {
+        if (node.next && !done) {
+          nextNodePromise = this.getNode(node.next);
+        }
+      } else {
+        if (node.prev && !done) {
+          nextNodePromise = this.getNode(node.prev);
+        }
+      }
       const len = node.values.length;
       if (direction === 1) {
         for (let i = 0; i < len; i++) {
@@ -2908,19 +2869,15 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
           }
         }
       }
-      if (done) break;
-      if (direction === 1) {
-        if (!node.next) {
-          done = true;
-          break;
-        }
-        node = await this.getNode(node.next);
+      if (done) {
+        if (nextNodePromise) await nextNodePromise;
+        break;
+      }
+      if (nextNodePromise) {
+        node = await nextNodePromise;
+        nextNodePromise = null;
       } else {
-        if (!node.prev) {
-          done = true;
-          break;
-        }
-        node = await this.getNode(node.prev);
+        done = true;
       }
     }
   }
@@ -2951,12 +2908,11 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
   }
   async exists(key, value) {
     const node = await this.insertableNode(value);
-    for (let i = 0, len = node.values.length; i < len; i++) {
-      if (this.comparator.isSame(value, node.values[i])) {
-        const keys = node.keys[i];
-        if (keys.includes(key)) {
-          return true;
-        }
+    const { index, found } = this._binarySearchValues(node.values, value);
+    if (found) {
+      const keys = node.keys[index];
+      if (keys.includes(key)) {
+        return true;
       }
     }
     return false;

package/dist/types/base/BPTreeTransaction.d.ts

@@ -182,4 +182,8 @@ export declare abstract class BPTreeTransaction<K, V> {
      * This method is useful for freeing up memory when the tree is no longer needed.
      */
     clear(): void;
+    protected _binarySearchValues(values: V[], target: V, usePrimary?: boolean, upperBound?: boolean): {
+        index: number;
+        found: boolean;
+    };
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "serializable-bptree",
-  "version": "8.1.0",
+  "version": "8.1.2",
   "description": "Store the B+tree flexibly, not only in-memory.",
   "types": "./dist/types/index.d.ts",
   "main": "./dist/cjs/index.cjs",
@@ -44,7 +44,7 @@
   },
   "dependencies": {
     "cache-entanglement": "^1.7.1",
-    "mvcc-api": "^1.2.9",
+    "mvcc-api": "^1.2.11",
     "ryoiki": "^1.2.0"
   }
 }