serializable-bptree 8.1.3 → 8.1.4

package/dist/cjs/index.cjs

@@ -93,6 +93,42 @@ var StringComparator = class extends ValueComparator {
 // node_modules/mvcc-api/dist/esm/index.mjs
 var MVCCStrategy = class {
 };
+var LRUMap = class {
+  cache = /* @__PURE__ */ new Map();
+  capacity;
+  constructor(capacity) {
+    this.capacity = capacity;
+  }
+  get(key) {
+    if (!this.cache.has(key)) return void 0;
+    const value = this.cache.get(key);
+    this.cache.delete(key);
+    this.cache.set(key, value);
+    return value;
+  }
+  set(key, value) {
+    if (this.cache.has(key)) {
+      this.cache.delete(key);
+    } else if (this.cache.size >= this.capacity) {
+      const oldestKey = this.cache.keys().next().value;
+      if (oldestKey !== void 0) this.cache.delete(oldestKey);
+    }
+    this.cache.set(key, value);
+    return this;
+  }
+  has(key) {
+    return this.cache.has(key);
+  }
+  delete(key) {
+    return this.cache.delete(key);
+  }
+  clear() {
+    this.cache.clear();
+  }
+  get size() {
+    return this.cache.size;
+  }
+};
 var MVCCTransaction = class {
   committed;
   snapshotVersion;
@@ -100,7 +136,6 @@ var MVCCTransaction = class {
   writeBuffer;
   deleteBuffer;
   createdKeys;
-  // create()로 생성된 키 추적
   deletedValues;
   // delete 시 삭제 전 값 저장
   originallyExisted;
@@ -119,7 +154,8 @@ var MVCCTransaction = class {
   versionIndex = /* @__PURE__ */ new Map();
   deletedCache = /* @__PURE__ */ new Map();
   activeTransactions = /* @__PURE__ */ new Set();
-  constructor(strategy, parent, snapshotVersion) {
+  diskCache;
+  constructor(strategy, options, parent, snapshotVersion) {
     this.snapshotVersion = snapshotVersion ?? 0;
     this.writeBuffer = /* @__PURE__ */ new Map();
     this.deleteBuffer = /* @__PURE__ */ new Set();
@@ -134,6 +170,7 @@ var MVCCTransaction = class {
       this.snapshotLocalVersion = parent.localVersion;
       this.strategy = void 0;
       this.root = parent.root;
+      this.diskCache = parent.diskCache;
     } else {
       if (!strategy) throw new Error("Root Transaction must get Strategy");
       this.strategy = strategy;
@@ -141,8 +178,13 @@ var MVCCTransaction = class {
       this.localVersion = 0;
       this.snapshotLocalVersion = 0;
       this.root = this;
+      this.diskCache = new LRUMap(options?.cacheCapacity ?? 1e3);
     }
   }
+  /**
+   * Checks if the transaction is a root transaction.
+   * @returns True if the transaction is a root transaction, false otherwise.
+   */
   isRoot() {
     return !this.parent;
   }
@@ -159,7 +201,22 @@ var MVCCTransaction = class {
     }
     return false;
   }
-  // --- Internal buffer manipulation helpers ---
+  /**
+   * Checks if a key was written in this transaction.
+   * @param key The key to check.
+   * @returns True if the key was written in this transaction, false otherwise.
+   */
+  isWrote(key) {
+    return this.writeBuffer.has(key);
+  }
+  /**
+   * Checks if a key was deleted in this transaction.
+   * @param key The key to check.
+   * @returns True if the key was deleted in this transaction, false otherwise.
+   */
+  isDeleted(key) {
+    return this.deleteBuffer.has(key);
+  }
   _recordHistory(key) {
     const existsInWriteBuffer = this.writeBuffer.has(key);
     const existsInDeleteBuffer = this.deleteBuffer.has(key);
@@ -222,7 +279,11 @@ var MVCCTransaction = class {
         deleted.push({ key, data });
       }
     }
-    return { created, updated, deleted };
+    return {
+      created,
+      updated,
+      deleted
+    };
   }
   /**
    * Rolls back the transaction.
@@ -240,7 +301,12 @@ var MVCCTransaction = class {
     if (this.root !== this) {
       this.root.activeTransactions.delete(this);
     }
-    return { success: true, created, updated, deleted };
+    return {
+      success: true,
+      created,
+      updated,
+      deleted
+    };
   }
   /**
    * Cleans up both deletedCache and versionIndex based on minActiveVersion.
@@ -326,7 +392,7 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
   createNested() {
     if (this.committed) throw new Error("Transaction already committed");
     const childVersion = this.isRoot() ? this.version : this.snapshotVersion;
-    const child = new _SyncMVCCTransaction(void 0, this, childVersion);
+    const child = new _SyncMVCCTransaction(void 0, void 0, this, childVersion);
     this.root.activeTransactions.add(child);
     return child;
   }
@@ -405,22 +471,54 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
   commit(label) {
     const { created, updated, deleted } = this.getResultEntries();
     if (this.committed) {
-      return { label, success: false, error: "Transaction already committed", conflict: void 0, created, updated, deleted };
+      return {
+        label,
+        success: false,
+        error: "Transaction already committed",
+        conflict: void 0,
+        created,
+        updated,
+        deleted
+      };
     }
     if (this.hasCommittedAncestor()) {
-      return { label, success: false, error: "Ancestor transaction already committed", conflict: void 0, created, updated, deleted };
+      return {
+        label,
+        success: false,
+        error: "Ancestor transaction already committed",
+        conflict: void 0,
+        created,
+        updated,
+        deleted
+      };
     }
     if (this.parent) {
       const failure = this.parent._merge(this);
       if (failure) {
-        return { label, success: false, error: failure.error, conflict: failure.conflict, created, updated, deleted };
+        return {
+          label,
+          success: false,
+          error: failure.error,
+          conflict: failure.conflict,
+          created,
+          updated,
+          deleted
+        };
       }
       this.committed = true;
     } else {
       if (this.writeBuffer.size > 0 || this.deleteBuffer.size > 0) {
         const failure = this._merge(this);
         if (failure) {
-          return { label, success: false, error: failure.error, conflict: failure.conflict, created: [], updated: [], deleted: [] };
+          return {
+            label,
+            success: false,
+            error: failure.error,
+            conflict: failure.conflict,
+            created: [],
+            updated: [],
+            deleted: []
+          };
         }
         this.writeBuffer.clear();
         this.deleteBuffer.clear();
@@ -433,7 +531,13 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
         this.snapshotVersion = this.version;
       }
     }
-    return { label, success: true, created, updated, deleted };
+    return {
+      label,
+      success: true,
+      created,
+      updated,
+      deleted
+    };
   }
   _merge(child) {
     if (this.parent) {
@@ -442,7 +546,11 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
         if (lastModLocalVer !== void 0 && lastModLocalVer > child.snapshotLocalVersion) {
           return {
             error: `Commit conflict: Key '${key}' was modified by a newer transaction (Local v${lastModLocalVer})`,
-            conflict: { key, parent: this.read(key), child: child.read(key) }
+            conflict: {
+              key,
+              parent: this.read(key),
+              child: child.read(key)
+            }
           };
         }
       }
@@ -451,7 +559,11 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
         if (lastModLocalVer !== void 0 && lastModLocalVer > child.snapshotLocalVersion) {
           return {
             error: `Commit conflict: Key '${key}' was modified by a newer transaction (Local v${lastModLocalVer})`,
-            conflict: { key, parent: this.read(key), child: child.read(key) }
+            conflict: {
+              key,
+              parent: this.read(key),
+              child: child.read(key)
+            }
           };
         }
       }
@@ -480,7 +592,11 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
             if (lastVer > child.snapshotVersion) {
               return {
                 error: `Commit conflict: Key '${key}' was modified by a newer transaction (v${lastVer})`,
-                conflict: { key, parent: this.read(key), child: child.read(key) }
+                conflict: {
+                  key,
+                  parent: this.read(key),
+                  child: child.read(key)
+                }
               };
             }
           }
@@ -488,7 +604,11 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
           if (lastModLocalVer !== void 0 && lastModLocalVer > child.snapshotLocalVersion) {
             return {
               error: `Commit conflict: Key '${key}' was modified by a newer transaction in the same session (Local v${lastModLocalVer})`,
-              conflict: { key, parent: this.read(key), child: child.read(key) }
+              conflict: {
+                key,
+                parent: this.read(key),
+                child: child.read(key)
+              }
             };
           }
         }
@@ -523,10 +643,14 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
   _diskWrite(key, value, version) {
     const strategy = this.strategy;
     if (!strategy) throw new Error("Root Transaction missing strategy");
-    if (strategy.exists(key)) {
-      const currentVal = strategy.read(key);
+    const rootAsAny = this.root;
+    if (this._diskExists(key, version)) {
+      const currentVal = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : strategy.read(key);
       if (!this.deletedCache.has(key)) this.deletedCache.set(key, []);
       this.deletedCache.get(key).push({ value: currentVal, deletedAtVersion: version });
+      rootAsAny.diskCache.set(key, value);
+    } else {
+      rootAsAny.diskCache.set(key, value);
     }
     strategy.write(key, value);
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
@@ -537,7 +661,13 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (!strategy) throw new Error("Root Transaction missing strategy");
     const versions = this.versionIndex.get(key);
     if (!versions) {
-      return strategy.exists(key) ? strategy.read(key) : null;
+      const rootAsAny = this.root;
+      if (this._diskExists(key, snapshotVersion)) {
+        const val = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : strategy.read(key);
+        rootAsAny.diskCache.set(key, val);
+        return val;
+      }
+      return null;
     }
     let targetVerObj = null;
     let nextVerObj = null;
@@ -561,7 +691,13 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (!targetVerObj.exists) return null;
     if (!nextVerObj) {
       if (this.writeBuffer.has(key)) return this.writeBuffer.get(key);
-      return strategy.read(key);
+      if (this._diskExists(key, snapshotVersion)) {
+        const rootAsAny = this.root;
+        const val = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : strategy.read(key);
+        rootAsAny.diskCache.set(key, val);
+        return val;
+      }
+      return null;
     }
     const cached = this.deletedCache.get(key);
     if (cached) {
@@ -575,7 +711,11 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (!strategy) throw new Error("Root Transaction missing strategy");
     const versions = this.versionIndex.get(key);
     if (!versions) {
-      return strategy.exists(key);
+      const rootAsAny = this.root;
+      if (rootAsAny.diskCache.has(key)) return rootAsAny.diskCache.get(key) !== null;
+      const exists = strategy.exists(key);
+      if (!exists) rootAsAny.diskCache.set(key, null);
+      return exists;
     }
     let targetVerObj = null;
     let nextVerObj = null;
@@ -601,11 +741,13 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
   _diskDelete(key, snapshotVersion) {
     const strategy = this.strategy;
     if (!strategy) throw new Error("Root Transaction missing strategy");
-    if (strategy.exists(key)) {
-      const currentVal = strategy.read(key);
+    const rootAsAny = this.root;
+    if (this._diskExists(key, snapshotVersion)) {
+      const currentVal = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : strategy.read(key);
       if (!this.deletedCache.has(key)) this.deletedCache.set(key, []);
       this.deletedCache.get(key).push({ value: currentVal, deletedAtVersion: snapshotVersion });
       strategy.delete(key);
+      rootAsAny.diskCache.delete(key);
     }
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
     this.versionIndex.get(key).push({ version: snapshotVersion, exists: false });
@@ -919,7 +1061,7 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
   createNested() {
     if (this.committed) throw new Error("Transaction already committed");
     const childVersion = this.isRoot() ? this.version : this.snapshotVersion;
-    const child = new _AsyncMVCCTransaction(void 0, this, childVersion);
+    const child = new _AsyncMVCCTransaction(void 0, void 0, this, childVersion);
     this.root.activeTransactions.add(child);
     return child;
   }
@@ -998,22 +1140,54 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
   async commit(label) {
     const { created, updated, deleted } = this.getResultEntries();
     if (this.committed) {
-      return { label, success: false, error: "Transaction already committed", conflict: void 0, created, updated, deleted };
+      return {
+        label,
+        success: false,
+        error: "Transaction already committed",
+        conflict: void 0,
+        created,
+        updated,
+        deleted
+      };
     }
     if (this.hasCommittedAncestor()) {
-      return { label, success: false, error: "Ancestor transaction already committed", conflict: void 0, created, updated, deleted };
+      return {
+        label,
+        success: false,
+        error: "Ancestor transaction already committed",
+        conflict: void 0,
+        created,
+        updated,
+        deleted
+      };
     }
     if (this.parent) {
       const failure = await this.parent._merge(this);
       if (failure) {
-        return { label, success: false, error: failure.error, conflict: failure.conflict, created, updated, deleted };
+        return {
+          label,
+          success: false,
+          error: failure.error,
+          conflict: failure.conflict,
+          created,
+          updated,
+          deleted
+        };
       }
       this.committed = true;
     } else {
       if (this.writeBuffer.size > 0 || this.deleteBuffer.size > 0) {
         const failure = await this._merge(this);
         if (failure) {
-          return { label, success: false, error: failure.error, conflict: failure.conflict, created: [], updated: [], deleted: [] };
+          return {
+            label,
+            success: false,
+            error: failure.error,
+            conflict: failure.conflict,
+            created: [],
+            updated: [],
+            deleted: []
+          };
         }
         this.writeBuffer.clear();
         this.deleteBuffer.clear();
@@ -1026,7 +1200,13 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
         this.snapshotVersion = this.version;
       }
     }
-    return { label, success: true, created, updated, deleted };
+    return {
+      label,
+      success: true,
+      created,
+      updated,
+      deleted
+    };
   }
   async _merge(child) {
     return this.writeLock(async () => {
@@ -1036,7 +1216,11 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
           if (lastModLocalVer !== void 0 && lastModLocalVer > child.snapshotLocalVersion) {
             return {
               error: `Commit conflict: Key '${key}' was modified by a newer transaction (Local v${lastModLocalVer})`,
-              conflict: { key, parent: await this.read(key), child: await child.read(key) }
+              conflict: {
+                key,
+                parent: await this.read(key),
+                child: await child.read(key)
+              }
             };
           }
         }
@@ -1045,7 +1229,11 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
           if (lastModLocalVer !== void 0 && lastModLocalVer > child.snapshotLocalVersion) {
             return {
               error: `Commit conflict: Key '${key}' was modified by a newer transaction (Local v${lastModLocalVer})`,
-              conflict: { key, parent: await this.read(key), child: await child.read(key) }
+              conflict: {
+                key,
+                parent: await this.read(key),
+                child: await child.read(key)
+              }
             };
           }
         }
@@ -1075,7 +1263,11 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
               if (lastVer > child.snapshotVersion) {
                 return {
                   error: `Commit conflict: Key '${key}' was modified by a newer transaction (v${lastVer})`,
-                  conflict: { key, parent: await this.read(key), child: await child.read(key) }
+                  conflict: {
+                    key,
+                    parent: await this.read(key),
+                    child: await child.read(key)
+                  }
                 };
               }
             }
@@ -1083,7 +1275,11 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
             if (lastModLocalVer !== void 0 && lastModLocalVer > child.snapshotLocalVersion) {
               return {
                 error: `Commit conflict: Key '${key}' was modified by a newer transaction in the same session (Local v${lastModLocalVer})`,
-                conflict: { key, parent: await this.read(key), child: await child.read(key) }
+                conflict: {
+                  key,
+                  parent: await this.read(key),
+                  child: await child.read(key)
+                }
               };
             }
           }
@@ -1119,10 +1315,14 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
   async _diskWrite(key, value, version) {
     const strategy = this.strategy;
     if (!strategy) throw new Error("Root Transaction missing strategy");
-    if (await strategy.exists(key)) {
-      const currentVal = await strategy.read(key);
+    const rootAsAny = this.root;
+    if (await this._diskExists(key, version)) {
+      const currentVal = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : await strategy.read(key);
       if (!this.deletedCache.has(key)) this.deletedCache.set(key, []);
       this.deletedCache.get(key).push({ value: currentVal, deletedAtVersion: version });
+      rootAsAny.diskCache.set(key, value);
+    } else {
+      rootAsAny.diskCache.set(key, value);
     }
     await strategy.write(key, value);
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
@@ -1133,7 +1333,13 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (!strategy) throw new Error("Root Transaction missing strategy");
     const versions = this.versionIndex.get(key);
     if (!versions) {
-      return await strategy.exists(key) ? await strategy.read(key) : null;
+      const rootAsAny = this.root;
+      if (await this._diskExists(key, snapshotVersion)) {
+        const val = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : await strategy.read(key);
+        rootAsAny.diskCache.set(key, val);
+        return val;
+      }
+      return null;
     }
     let targetVerObj = null;
     let nextVerObj = null;
@@ -1157,7 +1363,13 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (!targetVerObj.exists) return null;
     if (!nextVerObj) {
       if (this.writeBuffer.has(key)) return this.writeBuffer.get(key);
-      return strategy.read(key);
+      if (await this._diskExists(key, snapshotVersion)) {
+        const rootAsAny = this.root;
+        const val = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : await strategy.read(key);
+        rootAsAny.diskCache.set(key, val);
+        return val;
+      }
+      return null;
     }
     const cached = this.deletedCache.get(key);
     if (cached) {
@@ -1171,7 +1383,11 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (!strategy) throw new Error("Root Transaction missing strategy");
     const versions = this.versionIndex.get(key);
     if (!versions) {
-      return await strategy.exists(key);
+      const rootAsAny = this.root;
+      if (rootAsAny.diskCache.has(key)) return rootAsAny.diskCache.get(key) !== null;
+      const exists = await strategy.exists(key);
+      if (!exists) rootAsAny.diskCache.set(key, null);
+      return exists;
     }
     let targetVerObj = null;
     let nextVerObj = null;
@@ -1197,344 +1413,23 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
   async _diskDelete(key, snapshotVersion) {
     const strategy = this.strategy;
     if (!strategy) throw new Error("Root Transaction missing strategy");
-    if (await strategy.exists(key)) {
-      const currentVal = await strategy.read(key);
+    const rootAsAny = this.root;
+    if (await this._diskExists(key, snapshotVersion)) {
+      const currentVal = rootAsAny.diskCache.has(key) ? rootAsAny.diskCache.get(key) : await strategy.read(key);
       if (!this.deletedCache.has(key)) this.deletedCache.set(key, []);
       this.deletedCache.get(key).push({ value: currentVal, deletedAtVersion: snapshotVersion });
       await strategy.delete(key);
+      rootAsAny.diskCache.delete(key);
     }
     if (!this.versionIndex.has(key)) this.versionIndex.set(key, []);
     this.versionIndex.get(key).push({ version: snapshotVersion, exists: false });
   }
 };
 
-// node_modules/cache-entanglement/dist/esm/index.mjs
-var LRUMap = class {
-  capacity;
-  map;
-  head = null;
-  tail = null;
-  /**
-   * Creates an instance of LRUMap.
-   * @param capacity The maximum number of items the cache can hold.
-   */
-  constructor(capacity) {
-    this.capacity = capacity;
-    this.map = /* @__PURE__ */ new Map();
-  }
-  /**
-   * Promotes a node to the head of the linked list (marks as most recently used).
-   * @param node The node to promote.
-   */
-  promote(node) {
-    this.extract(node);
-    this.prepend(node);
-  }
-  /**
-   * Disconnects a node from the doubly linked list.
-   * @param node The node to extract.
-   */
-  extract(node) {
-    if (node.prev) node.prev.next = node.next;
-    else this.head = node.next;
-    if (node.next) node.next.prev = node.prev;
-    else this.tail = node.prev;
-    node.prev = null;
-    node.next = null;
-  }
-  /**
-   * Inserts a node at the head of the doubly linked list.
-   * @param node The node to prepend.
-   */
-  prepend(node) {
-    node.next = this.head;
-    if (this.head) this.head.prev = node;
-    this.head = node;
-    if (!this.tail) this.tail = node;
-  }
-  /**
-   * Stores or updates a value by key.
-   * If the capacity is exceeded, the least recently used item (tail) is removed.
-   * @param key The key to store.
-   * @param value The value to store.
-   */
-  set(key, value) {
-    const existing = this.map.get(key);
-    if (existing) {
-      existing.value = value;
-      this.promote(existing);
-      return;
-    }
-    const newNode = { key, value, prev: null, next: null };
-    this.map.set(key, newNode);
-    this.prepend(newNode);
-    if (this.map.size > this.capacity && this.tail) {
-      this.map.delete(this.tail.key);
-      this.extract(this.tail);
-    }
-  }
-  /**
-   * Retrieves a value by key.
-   * Accessing the item moves it to the "most recently used" position.
-   * @param key The key to look for.
-   * @returns The value associated with the key, or undefined if not found.
-   */
-  get(key) {
-    const node = this.map.get(key);
-    if (!node) return void 0;
-    this.promote(node);
-    return node.value;
-  }
-  /**
-   * Checks if a key exists in the cache without changing its access order.
-   * @param key The key to check.
-   * @returns True if the key exists, false otherwise.
-   */
-  has(key) {
-    return this.map.has(key);
-  }
-  /**
-   * Removes a key and its associated value from the cache.
-   * @param key The key to remove.
-   * @returns True if the key was found and removed, false otherwise.
-   */
-  delete(key) {
-    const node = this.map.get(key);
-    if (!node) return false;
-    this.extract(node);
-    this.map.delete(key);
-    return true;
-  }
-  /**
-   * Returns an iterator of keys in the order of most recently used to least recently used.
-   * @returns An iterable iterator of keys.
-   */
-  *keys() {
-    let current = this.head;
-    while (current) {
-      yield current.key;
-      current = current.next;
-    }
-  }
-  /**
-   * Returns the current number of items in the cache.
-   */
-  get size() {
-    return this.map.size;
-  }
-  /**
-   * Clears all items from the cache.
-   */
-  clear() {
-    this.map.clear();
-    this.head = null;
-    this.tail = null;
-  }
-};
-var CacheEntanglement = class {
-  creation;
-  beforeUpdateHook;
-  capacity;
-  dependencies;
-  caches;
-  parameters;
-  assignments;
-  dependencyProperties;
-  updateRequirements;
-  constructor(creation, option) {
-    option = option ?? {};
-    const {
-      dependencies,
-      capacity,
-      beforeUpdateHook
-    } = option;
-    this.creation = creation;
-    this.beforeUpdateHook = beforeUpdateHook ?? (() => {
-    });
-    this.capacity = capacity ?? 100;
-    this.assignments = [];
-    this.caches = new LRUMap(this.capacity);
-    this.parameters = /* @__PURE__ */ new Map();
-    this.dependencies = dependencies ?? {};
-    this.dependencyProperties = Object.keys(this.dependencies);
-    this.updateRequirements = /* @__PURE__ */ new Set();
-    for (const name in this.dependencies) {
-      const dependency = this.dependencies[name];
-      if (!dependency.assignments.includes(this)) {
-        dependency.assignments.push(this);
-      }
-    }
-  }
-  bubbleUpdateSignal(key) {
-    this.updateRequirements.add(key);
-    for (let i = 0, len = this.assignments.length; i < len; i++) {
-      const t = this.assignments[i];
-      const instance = t;
-      for (const cacheKey of instance.caches.keys()) {
-        if (cacheKey === key || cacheKey.startsWith(`${key}/`)) {
-          instance.bubbleUpdateSignal(cacheKey);
-        }
-      }
-    }
-  }
-  dependencyKey(key) {
-    const i = key.lastIndexOf("/");
-    if (i === -1) {
-      return key;
-    }
-    return key.substring(0, i);
-  }
-  /**
-   * Returns all keys stored in the instance.
-   */
-  keys() {
-    return this.parameters.keys();
-  }
-  /**
-   * Deletes all cache values stored in the instance.
-   */
-  clear() {
-    for (const key of this.keys()) {
-      this.delete(key);
-    }
-  }
-  /**
-   * Checks if there is a cache value stored in the key within the instance.
-   * @param key The key to search.
-   */
-  exists(key) {
-    return this.parameters.has(key);
-  }
-  /**
-   * Checks if there is a cache value stored in the key within the instance.
-   * This method is an alias for `exists`.
-   * @param key The key to search.
-   */
-  has(key) {
-    return this.exists(key);
-  }
-  /**
-   * Deletes the cache value stored in the key within the instance.
-   * @param key The key to delete.
-   */
-  delete(key) {
-    this.caches.delete(key);
-    this.parameters.delete(key);
-    this.updateRequirements.delete(key);
-    for (let i = 0, len = this.assignments.length; i < len; i++) {
-      const t = this.assignments[i];
-      const instance = t;
-      for (const cacheKey of instance.keys()) {
-        if (cacheKey === key || cacheKey.startsWith(`${key}/`)) {
-          instance.delete(cacheKey);
-        }
-      }
-    }
-  }
-};
-var CacheData = class _CacheData {
-  static StructuredClone = globalThis.structuredClone.bind(globalThis);
-  _value;
-  constructor(value) {
-    this._value = value;
-  }
-  /**
-   * This is cached data.
-   * It was generated at the time of caching, so there is a risk of modification if it's an object due to shallow copying.
-   * Therefore, if it's not a primitive type, please avoid using this value directly and use the `clone` method to use a copied version of the data.
-   */
-  get raw() {
-    return this._value;
-  }
-  /**
-   * The method returns a copied value of the cached data.
-   * You can pass a function as a parameter to copy the value. This parameter function should return the copied value.
-   * 
-   * If no parameter is passed, it defaults to using `structuredClone` function to copy the value.
-   * If you prefer shallow copying instead of deep copying,
-   * you can use the default options `array-shallow-copy`, `object-shallow-copy` and `deep-copy`,
-   * which are replaced with functions to shallow copy arrays and objects, respectively. This is a syntactic sugar.
-   * @param strategy The function that returns the copied value.
-   * If you want to perform a shallow copy, simply pass the strings `array-shallow-copy` or `object-shallow-copy` for easy use.  
-   * The `array-shallow-copy` strategy performs a shallow copy of an array.  
-   * The `object-shallow-copy` strategy performs a shallow copy of an object.  
-   * The `deep-copy` strategy performs a deep copy of the value using `structuredClone`.  
-   * The default is `deep-copy`.
-   */
-  clone(strategy = "deep-copy") {
-    if (strategy && typeof strategy !== "string") {
-      return strategy(this.raw);
-    }
-    switch (strategy) {
-      case "array-shallow-copy":
-        return [].concat(this.raw);
-      case "object-shallow-copy":
-        return Object.assign({}, this.raw);
-      case "deep-copy":
-      default:
-        return _CacheData.StructuredClone(this.raw);
-    }
-  }
-};
-var CacheEntanglementSync = class extends CacheEntanglement {
-  constructor(creation, option) {
-    super(creation, option);
-  }
-  recache(key) {
-    if (!this.parameters.has(key)) {
-      return;
-    }
-    if (!this.caches.has(key) || this.updateRequirements.has(key)) {
-      this.resolve(key, ...this.parameters.get(key));
-    }
-    return this.caches.get(key);
-  }
-  resolve(key, ...parameter) {
-    const resolved = {};
-    const dependencyKey = this.dependencyKey(key);
-    this.beforeUpdateHook(key, dependencyKey, ...parameter);
-    for (let i = 0, len = this.dependencyProperties.length; i < len; i++) {
-      const name = this.dependencyProperties[i];
-      const dependency = this.dependencies[name];
-      if (!dependency.exists(key) && !dependency.exists(dependencyKey)) {
-        throw new Error(`The key '${key}' or '${dependencyKey}' has not been assigned yet in dependency '${name.toString()}'.`, {
-          cause: {
-            from: this
-          }
-        });
-      }
-      const dependencyValue = dependency.recache(key) ?? dependency.recache(dependencyKey);
-      resolved[name] = dependencyValue;
-    }
-    const value = new CacheData(this.creation(key, resolved, ...parameter));
-    this.updateRequirements.delete(key);
-    this.parameters.set(key, parameter);
-    this.caches.set(key, value);
-    return value;
-  }
-  get(key) {
-    if (!this.parameters.has(key)) {
-      throw new Error(`Cache value not found: ${key}`);
-    }
-    return this.cache(key, ...this.parameters.get(key));
-  }
-  cache(key, ...parameter) {
-    if (!this.caches.has(key) || this.updateRequirements.has(key)) {
-      this.resolve(key, ...parameter);
-    }
-    return this.caches.get(key);
-  }
-  update(key, ...parameter) {
-    this.bubbleUpdateSignal(key);
-    this.resolve(key, ...parameter);
-    return this.caches.get(key);
-  }
-};
-
 // src/base/BPTreeTransaction.ts
 var BPTreeTransaction = class _BPTreeTransaction {
-  _cachedRegexp;
-  nodes;
+  _cachedRegexp = /* @__PURE__ */ new Map();
+  nodes = /* @__PURE__ */ new Map();
   deletedNodeBuffer = /* @__PURE__ */ new Map();
   rootTx;
   mvccRoot;
@@ -1564,8 +1459,12 @@ var BPTreeTransaction = class _BPTreeTransaction {
     like: (nv, v) => {
       const nodeValue = this.comparator.match(nv);
       const value = v;
-      const cache = this._cachedRegexp.cache(value);
-      const regexp = cache.raw;
+      if (!this._cachedRegexp.has(value)) {
+        const pattern = value.replace(/%/g, ".*").replace(/_/g, ".");
+        const regexp2 = new RegExp(`^${pattern}$`, "i");
+        this._cachedRegexp.set(value, regexp2);
+      }
+      const regexp = this._cachedRegexp.get(value);
       return regexp.test(nodeValue);
     }
   };
@@ -1737,6 +1636,9 @@ var BPTreeTransaction = class _BPTreeTransaction {
     }
     return true;
   }
+  _cloneNode(node) {
+    return JSON.parse(JSON.stringify(node));
+  }
   /**
    * Selects the best driver key from a condition object.
    * The driver key determines the starting point and traversal direction for queries.
@@ -1769,17 +1671,6 @@ var BPTreeTransaction = class _BPTreeTransaction {
     this.strategy = strategy;
     this.comparator = comparator;
     this.option = option ?? {};
-    this.nodes = new LRUMap(this.option.capacity ?? 1e3);
-    this._cachedRegexp = this._createCachedRegexp();
-  }
-  _createCachedRegexp() {
-    return new CacheEntanglementSync((key) => {
-      const pattern = key.replace(/%/g, ".*").replace(/_/g, ".");
-      const regexp = new RegExp(`^${pattern}$`, "i");
-      return regexp;
-    }, {
-      capacity: this.option.capacity ?? 1e3
-    });
   }
   ensureValues(v) {
     if (!Array.isArray(v)) {
@@ -1812,7 +1703,6 @@ var BPTreeTransaction = class _BPTreeTransaction {
   }
   _clearCache() {
     this._cachedRegexp.clear();
-    this.nodes.clear();
   }
   /**
    * Clears all cached nodes.
@@ -1865,9 +1755,6 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
     );
   }
   getNode(id) {
-    if (this.nodes.has(id)) {
-      return this.nodes.get(id);
-    }
     return this.mvcc.read(id);
   }
   /**
@@ -1885,23 +1772,22 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       prev
     };
     this.mvcc.create(id, node);
-    this.nodes.set(id, node);
     return node;
   }
   _updateNode(node) {
+    if (this.mvcc.isDeleted(node.id)) {
+      return;
+    }
     this.mvcc.write(node.id, node);
-    this.nodes.set(node.id, node);
   }
   _deleteNode(node) {
+    if (this.mvcc.isDeleted(node.id)) {
+      return;
+    }
     this.mvcc.delete(node.id);
-    this.nodes.delete(node.id);
   }
   _readHead() {
-    if (this.nodes.has("__HEAD__")) {
-      return this.nodes.get("__HEAD__") ?? null;
-    }
-    const head = this.mvcc.read("__HEAD__");
-    return head ?? null;
+    return this.mvcc.read("__HEAD__");
   }
   _writeHead(head) {
     if (!this.mvcc.exists("__HEAD__")) {
@@ -1909,41 +1795,45 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
     } else {
       this.mvcc.write("__HEAD__", head);
     }
-    this.nodes.set("__HEAD__", head);
     this.rootId = head.root;
   }
   _insertAtLeaf(node, key, value) {
-    if (node.values.length) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
+    let leaf = node;
+    leaf = this._cloneNode(leaf);
+    if (leaf.values.length) {
+      for (let i = 0, len = leaf.values.length; i < len; i++) {
+        const nValue = leaf.values[i];
         if (this.comparator.isSame(value, nValue)) {
-          const keys = node.keys[i];
+          const keys = leaf.keys[i];
           if (keys.includes(key)) {
             break;
           }
           keys.push(key);
-          this._updateNode(node);
-          return;
+          this._updateNode(leaf);
+          return leaf;
         } else if (this.comparator.isLower(value, nValue)) {
-          node.values.splice(i, 0, value);
-          node.keys.splice(i, 0, [key]);
-          this._updateNode(node);
-          return;
-        } else if (i + 1 === node.values.length) {
-          node.values.push(value);
-          node.keys.push([key]);
-          this._updateNode(node);
-          return;
+          leaf.values.splice(i, 0, value);
+          leaf.keys.splice(i, 0, [key]);
+          this._updateNode(leaf);
+          return leaf;
+        } else if (i + 1 === leaf.values.length) {
+          leaf.values.push(value);
+          leaf.keys.push([key]);
+          this._updateNode(leaf);
+          return leaf;
         }
       }
     } else {
-      node.values = [value];
-      node.keys = [[key]];
-      this._updateNode(node);
-      return;
+      leaf.values = [value];
+      leaf.keys = [[key]];
+      this._updateNode(leaf);
+      return leaf;
     }
+    return leaf;
   }
   _insertInParent(node, value, pointer) {
+    node = this._cloneNode(node);
+    pointer = this._cloneNode(pointer);
     if (this.rootId === node.id) {
       const root = this._createNode(false, [node.id, pointer.id], [value]);
       this.rootId = root.id;
@@ -1962,7 +1852,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       this._updateNode(pointer);
       return;
     }
-    const parentNode = this.getNode(node.parent);
+    const parentNode = this._cloneNode(this.getNode(node.parent));
     const nodeIndex = parentNode.keys.indexOf(node.id);
     if (nodeIndex === -1) {
       throw new Error(`Node ${node.id} not found in parent ${parentNode.id}`);
@@ -1978,7 +1868,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       leftSibling.next = pointer.id;
       this._updateNode(leftSibling);
       if (oldNextId) {
-        const oldNext = this.getNode(oldNextId);
+        const oldNext = this._cloneNode(this.getNode(oldNextId));
         oldNext.prev = pointer.id;
         this._updateNode(oldNext);
       }
@@ -1995,12 +1885,12 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       parentNode.values = parentNode.values.slice(0, mid);
       parentNode.keys = parentNode.keys.slice(0, mid + 1);
       for (const k of parentNode.keys) {
-        const n = this.getNode(k);
+        const n = this._cloneNode(this.getNode(k));
         n.parent = parentNode.id;
         this._updateNode(n);
       }
       for (const k of parentPointer.keys) {
-        const n = this.getNode(k);
+        const n = this._cloneNode(this.getNode(k));
         n.parent = parentPointer.id;
         this._updateNode(n);
       }
@@ -2188,21 +2078,6 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
     }
     return false;
   }
-  forceUpdate(id) {
-    if (id) {
-      this.nodes.delete(id);
-      this.getNode(id);
-      return 1;
-    }
-    const keys = Array.from(this.nodes.keys());
-    for (const key of keys) {
-      this.nodes.delete(key);
-    }
-    for (const key of keys) {
-      this.getNode(key);
-    }
-    return keys.length;
-  }
   get(key) {
     let node = this.leftestNode();
     while (true) {
@@ -2288,10 +2163,10 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
     return map;
   }
   insert(key, value) {
-    const before = this.insertableNode(value);
-    this._insertAtLeaf(before, key, value);
+    let before = this.insertableNode(value);
+    before = this._insertAtLeaf(before, key, value);
     if (before.values.length === this.order) {
-      const after = this._createNode(
+      let after = this._createNode(
         true,
         [],
         [],
@@ -2300,14 +2175,18 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         null
       );
       const mid = Math.ceil(this.order / 2) - 1;
+      after = this._cloneNode(after);
       after.values = before.values.slice(mid + 1);
       after.keys = before.keys.slice(mid + 1);
       before.values = before.values.slice(0, mid + 1);
       before.keys = before.keys.slice(0, mid + 1);
+      this._updateNode(before);
+      this._updateNode(after);
       this._insertInParent(before, after.values[0], after);
     }
   }
   _deleteEntry(node, key) {
+    node = this._cloneNode(node);
     if (!node.leaf) {
       let keyIndex = -1;
       for (let i = 0, len = node.keys.length; i < len; i++) {
@@ -2326,7 +2205,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
     if (this.rootId === node.id && node.keys.length === 1 && !node.leaf) {
       const keys = node.keys;
       this._deleteNode(node);
-      const newRoot = this.getNode(keys[0]);
+      const newRoot = this._cloneNode(this.getNode(keys[0]));
       newRoot.parent = null;
       this._updateNode(newRoot);
       this._writeHead({
@@ -2334,17 +2213,17 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         order: this.order,
         data: this.strategy.head.data
       });
-      return;
+      return node;
     } else if (this.rootId === node.id) {
       this._writeHead({
         root: node.id,
         order: this.order,
         data: this.strategy.head.data
       });
-      return;
+      return node;
     } else if (node.keys.length < Math.ceil(this.order / 2) && !node.leaf || node.values.length < Math.ceil((this.order - 1) / 2) && node.leaf) {
       if (node.parent === null) {
-        return;
+        return node;
       }
       let isPredecessor = false;
       let parentNode = this.getNode(node.parent);
@@ -2356,11 +2235,11 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         const nKey = parentNode.keys[i];
         if (nKey === node.id) {
           if (i > 0) {
-            prevNode = this.getNode(parentNode.keys[i - 1]);
+            prevNode = this._cloneNode(this.getNode(parentNode.keys[i - 1]));
             prevValue = parentNode.values[i - 1];
           }
           if (i < parentNode.keys.length - 1) {
-            nextNode = this.getNode(parentNode.keys[i + 1]);
+            nextNode = this._cloneNode(this.getNode(parentNode.keys[i + 1]));
             postValue = parentNode.values[i];
           }
         }
@@ -2385,7 +2264,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         }
       }
       if (!pointer) {
-        return;
+        return node;
       }
       if (node.values.length + pointer.values.length < this.order) {
         if (!isPredecessor) {
@@ -2399,7 +2278,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         } else {
           pointer.next = node.next;
           if (pointer.next) {
-            const n = this.getNode(pointer.next);
+            const n = this._cloneNode(this.getNode(pointer.next));
             n.prev = pointer.id;
             this._updateNode(n);
           }
@@ -2408,14 +2287,14 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         if (!pointer.leaf) {
           const keys = pointer.keys;
           for (const key2 of keys) {
-            const node2 = this.getNode(key2);
+            const node2 = this._cloneNode(this.getNode(key2));
             node2.parent = pointer.id;
             this._updateNode(node2);
           }
         }
         this._deleteNode(node);
         this._updateNode(pointer);
-        this._deleteEntry(this.getNode(node.parent), node.id);
+        this._deleteEntry(this._cloneNode(this.getNode(node.parent)), node.id);
       } else {
         if (isPredecessor) {
           let pointerPm;
@@ -2425,7 +2304,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
             pointerKm = pointer.values.splice(-1)[0];
             node.keys = [pointerPm, ...node.keys];
             node.values = [guess, ...node.values];
-            parentNode = this.getNode(node.parent);
+            parentNode = this._cloneNode(this.getNode(node.parent));
             const nodeIndex = parentNode.keys.indexOf(node.id);
             if (nodeIndex > 0) {
               parentNode.values[nodeIndex - 1] = pointerKm;
@@ -2436,7 +2315,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
             pointerKm = pointer.values.splice(-1)[0];
             node.keys = [pointerPm, ...node.keys];
             node.values = [pointerKm, ...node.values];
-            parentNode = this.getNode(node.parent);
+            parentNode = this._cloneNode(this.getNode(node.parent));
             const nodeIndex = parentNode.keys.indexOf(node.id);
             if (nodeIndex > 0) {
               parentNode.values[nodeIndex - 1] = pointerKm;
@@ -2453,7 +2332,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
             pointerK0 = pointer.values.splice(0, 1)[0];
             node.keys = [...node.keys, pointerP0];
             node.values = [...node.values, guess];
-            parentNode = this.getNode(node.parent);
+            parentNode = this._cloneNode(this.getNode(node.parent));
             const pointerIndex = parentNode.keys.indexOf(pointer.id);
             if (pointerIndex > 0) {
               parentNode.values[pointerIndex - 1] = pointerK0;
@@ -2464,7 +2343,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
             pointerK0 = pointer.values.splice(0, 1)[0];
             node.keys = [...node.keys, pointerP0];
             node.values = [...node.values, pointerK0];
-            parentNode = this.getNode(node.parent);
+            parentNode = this._cloneNode(this.getNode(node.parent));
             const pointerIndex = parentNode.keys.indexOf(pointer.id);
             if (pointerIndex > 0) {
               parentNode.values[pointerIndex - 1] = pointer.values[0];
@@ -2476,21 +2355,21 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         }
         if (!pointer.leaf) {
           for (const key2 of pointer.keys) {
-            const n = this.getNode(key2);
+            const n = this._cloneNode(this.getNode(key2));
             n.parent = pointer.id;
             this._updateNode(n);
           }
         }
         if (!node.leaf) {
           for (const key2 of node.keys) {
-            const n = this.getNode(key2);
+            const n = this._cloneNode(this.getNode(key2));
             n.parent = node.id;
             this._updateNode(n);
           }
         }
         if (!parentNode.leaf) {
           for (const key2 of parentNode.keys) {
-            const n = this.getNode(key2);
+            const n = this._cloneNode(this.getNode(key2));
             n.parent = parentNode.id;
             this._updateNode(n);
           }
@@ -2499,10 +2378,12 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
     } else {
       this._updateNode(node);
     }
+    return node;
   }
   delete(key, value) {
     let node = this.insertableNodeByPrimary(value);
     let found = false;
+    node = this._cloneNode(node);
     while (true) {
       let i = node.values.length;
       while (i--) {
@@ -2517,7 +2398,7 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
               node.values.splice(i, 1);
             }
             this._updateNode(node);
-            this._deleteEntry(node, key);
+            node = this._deleteEntry(node, key);
             found = true;
             break;
           }
@@ -2560,15 +2441,6 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         }
       }
       if (result.success) {
-        for (const r of result.created) {
-          this.nodes.set(r.key, r.data);
-        }
-        for (const r of result.updated) {
-          this.nodes.set(r.key, r.data);
-        }
-        for (const r of result.deleted) {
-          this.nodes.delete(r.key);
-        }
       }
     }
     return result;
@@ -2616,7 +2488,9 @@ var BPTreeMVCCStrategySync = class extends SyncMVCCStrategy {
 // src/BPTreeSync.ts
 var BPTreeSync = class extends BPTreeSyncTransaction {
   constructor(strategy, comparator, option) {
-    const mvccRoot = new SyncMVCCTransaction(new BPTreeMVCCStrategySync(strategy));
+    const mvccRoot = new SyncMVCCTransaction(new BPTreeMVCCStrategySync(strategy), {
+      cacheCapacity: option?.capacity ?? void 0
+    });
     super(
       null,
       mvccRoot,
@@ -2943,9 +2817,6 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
     });
   }
   async getNode(id) {
-    if (this.nodes.has(id)) {
-      return this.nodes.get(id);
-    }
     return await this.mvcc.read(id);
   }
   /**
@@ -2962,66 +2833,77 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       next,
       prev
     };
+    const head = await this._readHead();
+    if (head) {
+      await this._writeHead({
+        root: head.root,
+        order: head.order,
+        data: this.strategy.head.data
+      });
+    }
     await this.mvcc.create(id, node);
-    this.nodes.set(id, node);
     return node;
   }
   async _updateNode(node) {
-    await this.mvcc.write(node.id, node);
-    this.nodes.set(node.id, node);
+    if (this.mvcc.isDeleted(node.id)) {
+      return;
+    }
+    await this.mvcc.write(node.id, this._cloneNode(node));
   }
   async _deleteNode(node) {
+    if (this.mvcc.isDeleted(node.id)) {
+      return;
+    }
     await this.mvcc.delete(node.id);
-    this.nodes.delete(node.id);
   }
   async _readHead() {
-    if (this.nodes.has("__HEAD__")) {
-      return this.nodes.get("__HEAD__") ?? null;
-    }
-    const head = await this.mvcc.read("__HEAD__");
-    return head ?? null;
+    return await this.mvcc.read("__HEAD__");
   }
   async _writeHead(head) {
     if (!await this.mvcc.exists("__HEAD__")) {
-      await this.mvcc.create("__HEAD__", head);
+      await this.mvcc.create("__HEAD__", this._cloneNode(head));
     } else {
-      await this.mvcc.write("__HEAD__", head);
+      await this.mvcc.write("__HEAD__", this._cloneNode(head));
     }
-    this.nodes.set("__HEAD__", head);
     this.rootId = head.root;
   }
   async _insertAtLeaf(node, key, value) {
-    if (node.values.length) {
-      for (let i = 0, len = node.values.length; i < len; i++) {
-        const nValue = node.values[i];
+    let leaf = node;
+    leaf = this._cloneNode(leaf);
+    if (leaf.values.length) {
+      for (let i = 0, len = leaf.values.length; i < len; i++) {
+        const nValue = leaf.values[i];
         if (this.comparator.isSame(value, nValue)) {
-          const keys = node.keys[i];
+          const keys = leaf.keys[i];
           if (keys.includes(key)) {
             break;
           }
           keys.push(key);
-          await this._updateNode(node);
-          return;
+          await this._updateNode(leaf);
+          return leaf;
         } else if (this.comparator.isLower(value, nValue)) {
-          node.values.splice(i, 0, value);
-          node.keys.splice(i, 0, [key]);
-          await this._updateNode(node);
-          return;
-        } else if (i + 1 === node.values.length) {
-          node.values.push(value);
-          node.keys.push([key]);
-          await this._updateNode(node);
-          return;
+          leaf.values.splice(i, 0, value);
+          leaf.keys.splice(i, 0, [key]);
+          await this._updateNode(leaf);
+          return leaf;
+        } else if (i + 1 === leaf.values.length) {
+          leaf.values.push(value);
+          leaf.keys.push([key]);
+          await this._updateNode(leaf);
+          return leaf;
         }
       }
     } else {
-      node.values = [value];
-      node.keys = [[key]];
-      await this._updateNode(node);
-      return;
+      leaf.values = [value];
+      leaf.keys = [[key]];
+      await this._updateNode(leaf);
+      return leaf;
     }
+    return leaf;
   }
   async _insertInParent(node, value, pointer) {
+    node = this._cloneNode(node);
+    pointer = this._cloneNode(pointer);
     if (this.rootId === node.id) {
       const root = await this._createNode(false, [node.id, pointer.id], [value]);
       this.rootId = root.id;
@@ -3040,7 +2922,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       await this._updateNode(pointer);
       return;
     }
-    const parentNode = await this.getNode(node.parent);
+    const parentNode = this._cloneNode(await this.getNode(node.parent));
     const nodeIndex = parentNode.keys.indexOf(node.id);
     if (nodeIndex === -1) {
       throw new Error(`Node ${node.id} not found in parent ${parentNode.id}`);
@@ -3056,7 +2938,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       leftSibling.next = pointer.id;
       await this._updateNode(leftSibling);
       if (oldNextId) {
-        const oldNext = await this.getNode(oldNextId);
+        const oldNext = this._cloneNode(await this.getNode(oldNextId));
         oldNext.prev = pointer.id;
         await this._updateNode(oldNext);
       }
@@ -3073,12 +2955,12 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       parentNode.values = parentNode.values.slice(0, mid);
       parentNode.keys = parentNode.keys.slice(0, mid + 1);
       for (const k of parentNode.keys) {
-        const n = await this.getNode(k);
+        const n = this._cloneNode(await this.getNode(k));
         n.parent = parentNode.id;
         await this._updateNode(n);
       }
       for (const k of parentPointer.keys) {
-        const n = await this.getNode(k);
+        const n = this._cloneNode(await this.getNode(k));
         n.parent = parentPointer.id;
         await this._updateNode(n);
       }
@@ -3272,21 +3154,6 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
     }
     return false;
   }
-  async forceUpdate(id) {
-    if (id) {
-      this.nodes.delete(id);
-      await this.getNode(id);
-      return 1;
-    }
-    const keys = Array.from(this.nodes.keys());
-    for (const key of keys) {
-      this.nodes.delete(key);
-    }
-    for (const key of keys) {
-      await this.getNode(key);
-    }
-    return keys.length;
-  }
   async get(key) {
     let node = await this.leftestNode();
     while (true) {
@@ -3373,10 +3240,10 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
   }
   async insert(key, value) {
     return this.writeLock(0, async () => {
-      const before = await this.insertableNode(value);
-      await this._insertAtLeaf(before, key, value);
+      let before = await this.insertableNode(value);
+      before = await this._insertAtLeaf(before, key, value);
       if (before.values.length === this.order) {
-        const after = await this._createNode(
+        let after = await this._createNode(
           true,
           [],
           [],
@@ -3385,15 +3252,19 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
           null
         );
         const mid = Math.ceil(this.order / 2) - 1;
+        after = this._cloneNode(after);
         after.values = before.values.slice(mid + 1);
         after.keys = before.keys.slice(mid + 1);
         before.values = before.values.slice(0, mid + 1);
         before.keys = before.keys.slice(0, mid + 1);
+        await this._updateNode(before);
+        await this._updateNode(after);
         await this._insertInParent(before, after.values[0], after);
       }
     });
   }
   async _deleteEntry(node, key) {
+    node = this._cloneNode(node);
     if (!node.leaf) {
       let keyIndex = -1;
       for (let i = 0, len = node.keys.length; i < len; i++) {
@@ -3412,7 +3283,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
     if (this.rootId === node.id && node.keys.length === 1 && !node.leaf) {
       const keys = node.keys;
       this._deleteNode(node);
-      const newRoot = await this.getNode(keys[0]);
+      const newRoot = this._cloneNode(await this.getNode(keys[0]));
       newRoot.parent = null;
       await this._updateNode(newRoot);
       await this._writeHead({
@@ -3420,14 +3291,17 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         order: this.order,
         data: this.strategy.head.data
       });
-      return;
+      return node;
     } else if (this.rootId === node.id) {
-      const root = await this.getNode(this.rootId);
-      await this._updateNode(root);
-      return;
+      await this._writeHead({
+        root: node.id,
+        order: this.order,
+        data: this.strategy.head.data
+      });
+      return node;
     } else if (node.keys.length < Math.ceil(this.order / 2) && !node.leaf || node.values.length < Math.ceil((this.order - 1) / 2) && node.leaf) {
       if (node.parent === null) {
-        return;
+        return node;
       }
       let isPredecessor = false;
       let parentNode = await this.getNode(node.parent);
@@ -3439,11 +3313,11 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         const nKey = parentNode.keys[i];
         if (nKey === node.id) {
           if (i > 0) {
-            prevNode = await this.getNode(parentNode.keys[i - 1]);
+            prevNode = this._cloneNode(await this.getNode(parentNode.keys[i - 1]));
             prevValue = parentNode.values[i - 1];
           }
           if (i < parentNode.keys.length - 1) {
-            nextNode = await this.getNode(parentNode.keys[i + 1]);
+            nextNode = this._cloneNode(await this.getNode(parentNode.keys[i + 1]));
             postValue = parentNode.values[i];
           }
         }
@@ -3468,7 +3342,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         }
       }
       if (!pointer) {
-        return;
+        return node;
       }
       if (node.values.length + pointer.values.length < this.order) {
         if (!isPredecessor) {
@@ -3482,7 +3356,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         } else {
           pointer.next = node.next;
           if (pointer.next) {
-            const n = await this.getNode(pointer.next);
+            const n = this._cloneNode(await this.getNode(pointer.next));
             n.prev = pointer.id;
             await this._updateNode(n);
           }
@@ -3491,14 +3365,14 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         if (!pointer.leaf) {
           const keys = pointer.keys;
           for (const key2 of keys) {
-            const node2 = await this.getNode(key2);
+            const node2 = this._cloneNode(await this.getNode(key2));
             node2.parent = pointer.id;
             await this._updateNode(node2);
           }
         }
         this._deleteNode(node);
         await this._updateNode(pointer);
-        await this._deleteEntry(await this.getNode(node.parent), node.id);
+        await this._deleteEntry(this._cloneNode(await this.getNode(node.parent)), node.id);
       } else {
         if (isPredecessor) {
           let pointerPm;
@@ -3508,7 +3382,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
             pointerKm = pointer.values.splice(-1)[0];
             node.keys = [pointerPm, ...node.keys];
             node.values = [guess, ...node.values];
-            parentNode = await this.getNode(node.parent);
+            parentNode = this._cloneNode(await this.getNode(node.parent));
             const nodeIndex = parentNode.keys.indexOf(node.id);
             if (nodeIndex > 0) {
               parentNode.values[nodeIndex - 1] = pointerKm;
@@ -3519,7 +3393,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
             pointerKm = pointer.values.splice(-1)[0];
             node.keys = [pointerPm, ...node.keys];
             node.values = [pointerKm, ...node.values];
-            parentNode = await this.getNode(node.parent);
+            parentNode = this._cloneNode(await this.getNode(node.parent));
             const nodeIndex = parentNode.keys.indexOf(node.id);
             if (nodeIndex > 0) {
               parentNode.values[nodeIndex - 1] = pointerKm;
@@ -3536,7 +3410,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
             pointerK0 = pointer.values.splice(0, 1)[0];
             node.keys = [...node.keys, pointerP0];
             node.values = [...node.values, guess];
-            parentNode = await this.getNode(node.parent);
+            parentNode = this._cloneNode(await this.getNode(node.parent));
             const pointerIndex = parentNode.keys.indexOf(pointer.id);
             if (pointerIndex > 0) {
               parentNode.values[pointerIndex - 1] = pointerK0;
@@ -3547,7 +3421,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
             pointerK0 = pointer.values.splice(0, 1)[0];
             node.keys = [...node.keys, pointerP0];
             node.values = [...node.values, pointerK0];
-            parentNode = await this.getNode(node.parent);
+            parentNode = this._cloneNode(await this.getNode(node.parent));
             const pointerIndex = parentNode.keys.indexOf(pointer.id);
             if (pointerIndex > 0) {
               parentNode.values[pointerIndex - 1] = pointer.values[0];
@@ -3559,21 +3433,21 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         }
         if (!pointer.leaf) {
           for (const key2 of pointer.keys) {
-            const n = await this.getNode(key2);
+            const n = this._cloneNode(await this.getNode(key2));
             n.parent = pointer.id;
             await this._updateNode(n);
           }
         }
         if (!node.leaf) {
           for (const key2 of node.keys) {
-            const n = await this.getNode(key2);
+            const n = this._cloneNode(await this.getNode(key2));
             n.parent = node.id;
             await this._updateNode(n);
           }
         }
         if (!parentNode.leaf) {
           for (const key2 of parentNode.keys) {
-            const n = await this.getNode(key2);
+            const n = this._cloneNode(await this.getNode(key2));
             n.parent = parentNode.id;
             await this._updateNode(n);
           }
@@ -3582,11 +3456,14 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
     } else {
       await this._updateNode(node);
     }
+    await this._updateNode(node);
+    return node;
   }
   async delete(key, value) {
     return this.writeLock(0, async () => {
       let node = await this.insertableNodeByPrimary(value);
       let found = false;
+      node = this._cloneNode(node);
       while (true) {
         let i = node.values.length;
         while (i--) {
@@ -3601,7 +3478,7 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
                 node.values.splice(i, 1);
               }
               await this._updateNode(node);
-              await this._deleteEntry(node, key);
+              node = await this._deleteEntry(node, key);
               found = true;
               break;
             }
@@ -3644,21 +3521,10 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
           this.rootTx.rootId = this.rootId;
         }
       }
-      if (result.success) {
-        for (const r of result.created) {
-          this.nodes.set(r.key, r.data);
-        }
-        for (const r of result.updated) {
-          this.nodes.set(r.key, r.data);
-        }
-        for (const r of result.deleted) {
-          this.nodes.delete(r.key);
-        }
-      }
     }
     return result;
   }
-  rollback() {
+  async rollback() {
     return this.mvcc.rollback();
   }
 };
@@ -3701,7 +3567,9 @@ var BPTreeMVCCStrategyAsync = class extends AsyncMVCCStrategy {
 // src/BPTreeAsync.ts
 var BPTreeAsync = class extends BPTreeAsyncTransaction {
   constructor(strategy, comparator, option) {
-    const mvccRoot = new AsyncMVCCTransaction(new BPTreeMVCCStrategyAsync(strategy));
+    const mvccRoot = new AsyncMVCCTransaction(new BPTreeMVCCStrategyAsync(strategy), {
+      cacheCapacity: option?.capacity ?? void 0
+    });
     super(
       null,
       mvccRoot,