serializable-bptree 8.4.0 → 8.4.2

package/README.md

@@ -84,6 +84,7 @@ Additionally, this library supports asynchronous operations and rule-based query
 - **Async/Sync Support**: Provides both synchronous and asynchronous APIs.
 - **Query Optimization**: Rule-based optimizer to choose the best index for complex queries.
 - **TypeScript**: Fully typed for a better developer experience.
+- **Auto Rollback**: Automatically cleans up internal memory buffers on commit failures, preventing memory leaks without manual intervention.
 
 ## How to use
 

package/dist/cjs/index.cjs

@@ -413,11 +413,7 @@ var MVCCTransaction = class {
    */
   rollback() {
     const { created, updated, deleted } = this.getResultEntries();
-    this.writeBuffer.clear();
-    this.deleteBuffer.clear();
-    this.createdKeys.clear();
-    this.deletedValues.clear();
-    this.originallyExisted.clear();
+    this._cleanupAll();
     this.committed = true;
     if (this.root !== this) {
       this.root.activeTransactions.delete(this);
@@ -453,6 +449,19 @@ var MVCCTransaction = class {
     }
     return Array.from(conflicts);
   }
+  /**
+   * Cleans up all buffers and history.
+   * This method is called by the commit method.
+   */
+  _cleanupAll() {
+    this.writeBuffer.clear();
+    this.deleteBuffer.clear();
+    this.createdKeys.clear();
+    this.deletedValues.clear();
+    this.originallyExisted.clear();
+    this.keyVersions.clear();
+    this.bufferHistory.clear();
+  }
   /**
    * Cleans up both deletedCache and versionIndex based on minActiveVersion.
    * Root transactions call this after commit to reclaim memory.
@@ -644,6 +653,7 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (this.parent) {
       const failure = this.parent._merge(this);
       if (failure) {
+        this.rollback();
         return {
           label,
           success: false,
@@ -654,11 +664,13 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
           deleted
         };
       }
+      this._cleanupAll();
       this.committed = true;
     } else {
       if (this.writeBuffer.size > 0 || this.deleteBuffer.size > 0) {
         const failure = this._merge(this);
         if (failure) {
+          this.rollback();
           return {
             label,
             success: false,
@@ -669,13 +681,7 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
             deleted: []
           };
         }
-        this.writeBuffer.clear();
-        this.deleteBuffer.clear();
-        this.createdKeys.clear();
-        this.deletedValues.clear();
-        this.originallyExisted.clear();
-        this.keyVersions.clear();
-        this.bufferHistory.clear();
+        this._cleanupAll();
         this.localVersion = 0;
         this.snapshotVersion = this.version;
       }
@@ -1309,6 +1315,7 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (this.parent) {
       const failure = await this.parent._merge(this);
       if (failure) {
+        this.rollback();
         return {
           label,
           success: false,
@@ -1319,11 +1326,13 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
           deleted
         };
       }
+      this._cleanupAll();
       this.committed = true;
     } else {
       if (this.writeBuffer.size > 0 || this.deleteBuffer.size > 0) {
         const failure = await this._merge(this);
         if (failure) {
+          this.rollback();
           return {
             label,
             success: false,
@@ -1334,13 +1343,7 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
             deleted: []
           };
         }
-        this.writeBuffer.clear();
-        this.deleteBuffer.clear();
-        this.createdKeys.clear();
-        this.deletedValues.clear();
-        this.originallyExisted.clear();
-        this.keyVersions.clear();
-        this.bufferHistory.clear();
+        this._cleanupAll();
         this.localVersion = 0;
         this.snapshotVersion = this.version;
       }
@@ -1566,8 +1569,6 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
 // src/base/BPTreeTransaction.ts
 var BPTreeTransaction = class _BPTreeTransaction {
   _cachedRegexp = /* @__PURE__ */ new Map();
-  nodes = /* @__PURE__ */ new Map();
-  deletedNodeBuffer = /* @__PURE__ */ new Map();
   rootTx;
   mvccRoot;
   mvcc;
@@ -2048,6 +2049,12 @@ var BPTreeTransaction = class _BPTreeTransaction {
   _clearCache() {
     this._cachedRegexp.clear();
   }
+  _resetForReload() {
+    this._cachedRegexp.clear();
+    this.isInitialized = false;
+    this.isDestroyed = false;
+    this.mvccRoot.diskCache.clear();
+  }
   /**
    * Clears all cached nodes.
    * This method is useful for freeing up memory when the tree is no longer needed.
@@ -2378,6 +2385,16 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       throw e;
     }
   }
+  reload() {
+    if (this.rootTx !== this) {
+      throw new Error("Cannot call reload on a nested transaction");
+    }
+    this._reloadInternal();
+  }
+  _reloadInternal() {
+    this._resetForReload();
+    this._initInternal();
+  }
   exists(key, value) {
     const node = this.locateLeaf(value);
     const { index, found } = this._binarySearchValues(node.values, value);
@@ -2899,8 +2916,12 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         result = this.rootTx.commit(label);
         if (result.success) {
           this.rootTx.rootId = this.rootId;
+        } else {
+          this.mvcc.rollback();
         }
       }
+    } else {
+      this.mvcc.rollback();
     }
     return result;
   }
@@ -3580,6 +3601,16 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       throw e;
     }
   }
+  async reload() {
+    if (this.rootTx !== this) {
+      throw new Error("Cannot call reload on a nested transaction");
+    }
+    return await this._reloadInternal();
+  }
+  async _reloadInternal() {
+    this._resetForReload();
+    await this._initInternal();
+  }
   async exists(key, value) {
     const node = await this.locateLeaf(value);
     const { index, found } = this._binarySearchValues(node.values, value);
@@ -4109,8 +4140,12 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         result = await this.rootTx.commit(label);
         if (result.success) {
           this.rootTx.rootId = this.rootId;
+        } else {
+          this.mvcc.rollback();
         }
       }
+    } else {
+      this.mvcc.rollback();
     }
     return result;
   }

package/dist/esm/index.mjs

@@ -377,11 +377,7 @@ var MVCCTransaction = class {
    */
   rollback() {
     const { created, updated, deleted } = this.getResultEntries();
-    this.writeBuffer.clear();
-    this.deleteBuffer.clear();
-    this.createdKeys.clear();
-    this.deletedValues.clear();
-    this.originallyExisted.clear();
+    this._cleanupAll();
     this.committed = true;
     if (this.root !== this) {
       this.root.activeTransactions.delete(this);
@@ -417,6 +413,19 @@ var MVCCTransaction = class {
     }
     return Array.from(conflicts);
   }
+  /**
+   * Cleans up all buffers and history.
+   * This method is called by the commit method.
+   */
+  _cleanupAll() {
+    this.writeBuffer.clear();
+    this.deleteBuffer.clear();
+    this.createdKeys.clear();
+    this.deletedValues.clear();
+    this.originallyExisted.clear();
+    this.keyVersions.clear();
+    this.bufferHistory.clear();
+  }
   /**
    * Cleans up both deletedCache and versionIndex based on minActiveVersion.
    * Root transactions call this after commit to reclaim memory.
@@ -608,6 +617,7 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
     if (this.parent) {
       const failure = this.parent._merge(this);
       if (failure) {
+        this.rollback();
         return {
           label,
           success: false,
@@ -618,11 +628,13 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
           deleted
         };
       }
+      this._cleanupAll();
       this.committed = true;
     } else {
       if (this.writeBuffer.size > 0 || this.deleteBuffer.size > 0) {
         const failure = this._merge(this);
         if (failure) {
+          this.rollback();
           return {
             label,
             success: false,
@@ -633,13 +645,7 @@ var SyncMVCCTransaction = class _SyncMVCCTransaction extends MVCCTransaction {
             deleted: []
           };
         }
-        this.writeBuffer.clear();
-        this.deleteBuffer.clear();
-        this.createdKeys.clear();
-        this.deletedValues.clear();
-        this.originallyExisted.clear();
-        this.keyVersions.clear();
-        this.bufferHistory.clear();
+        this._cleanupAll();
         this.localVersion = 0;
         this.snapshotVersion = this.version;
       }
@@ -1273,6 +1279,7 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
     if (this.parent) {
       const failure = await this.parent._merge(this);
       if (failure) {
+        this.rollback();
         return {
           label,
           success: false,
@@ -1283,11 +1290,13 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
           deleted
         };
       }
+      this._cleanupAll();
       this.committed = true;
     } else {
       if (this.writeBuffer.size > 0 || this.deleteBuffer.size > 0) {
         const failure = await this._merge(this);
         if (failure) {
+          this.rollback();
           return {
             label,
             success: false,
@@ -1298,13 +1307,7 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
             deleted: []
           };
         }
-        this.writeBuffer.clear();
-        this.deleteBuffer.clear();
-        this.createdKeys.clear();
-        this.deletedValues.clear();
-        this.originallyExisted.clear();
-        this.keyVersions.clear();
-        this.bufferHistory.clear();
+        this._cleanupAll();
         this.localVersion = 0;
         this.snapshotVersion = this.version;
       }
@@ -1530,8 +1533,6 @@ var AsyncMVCCTransaction = class _AsyncMVCCTransaction extends MVCCTransaction {
 // src/base/BPTreeTransaction.ts
 var BPTreeTransaction = class _BPTreeTransaction {
   _cachedRegexp = /* @__PURE__ */ new Map();
-  nodes = /* @__PURE__ */ new Map();
-  deletedNodeBuffer = /* @__PURE__ */ new Map();
   rootTx;
   mvccRoot;
   mvcc;
@@ -2012,6 +2013,12 @@ var BPTreeTransaction = class _BPTreeTransaction {
   _clearCache() {
     this._cachedRegexp.clear();
   }
+  _resetForReload() {
+    this._cachedRegexp.clear();
+    this.isInitialized = false;
+    this.isDestroyed = false;
+    this.mvccRoot.diskCache.clear();
+  }
   /**
    * Clears all cached nodes.
    * This method is useful for freeing up memory when the tree is no longer needed.
@@ -2342,6 +2349,16 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       throw e;
     }
   }
+  reload() {
+    if (this.rootTx !== this) {
+      throw new Error("Cannot call reload on a nested transaction");
+    }
+    this._reloadInternal();
+  }
+  _reloadInternal() {
+    this._resetForReload();
+    this._initInternal();
+  }
   exists(key, value) {
     const node = this.locateLeaf(value);
     const { index, found } = this._binarySearchValues(node.values, value);
@@ -2863,8 +2880,12 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
         result = this.rootTx.commit(label);
         if (result.success) {
           this.rootTx.rootId = this.rootId;
+        } else {
+          this.mvcc.rollback();
         }
       }
+    } else {
+      this.mvcc.rollback();
     }
     return result;
   }
@@ -3544,6 +3565,16 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       throw e;
     }
   }
+  async reload() {
+    if (this.rootTx !== this) {
+      throw new Error("Cannot call reload on a nested transaction");
+    }
+    return await this._reloadInternal();
+  }
+  async _reloadInternal() {
+    this._resetForReload();
+    await this._initInternal();
+  }
   async exists(key, value) {
     const node = await this.locateLeaf(value);
     const { index, found } = this._binarySearchValues(node.values, value);
@@ -4073,8 +4104,12 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
         result = await this.rootTx.commit(label);
         if (result.success) {
           this.rootTx.rootId = this.rootId;
+        } else {
+          this.mvcc.rollback();
         }
       }
+    } else {
+      this.mvcc.rollback();
     }
     return result;
   }

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

@@ -4,8 +4,6 @@ import { ValueComparator } from './ValueComparator';
 import { SerializeStrategy } from './SerializeStrategy';
 export declare abstract class BPTreeTransaction<K, V> {
     private readonly _cachedRegexp;
-    protected readonly nodes: Map<string, BPTreeUnknownNode<K, V>>;
-    protected readonly deletedNodeBuffer: Map<string, BPTreeUnknownNode<K, V>>;
     protected readonly rootTx: BPTreeTransaction<K, V>;
     protected readonly mvccRoot: BPTreeMVCC<K, V>;
     protected readonly mvcc: BPTreeMVCC<K, V>;
@@ -122,6 +120,12 @@ export declare abstract class BPTreeTransaction<K, V> {
      * If it is not called, the tree will not function.
      */
     abstract init(): Deferred<void>;
+    /**
+     * Clears all in-memory caches and re-initializes the tree from storage.
+     * This is equivalent to calling `clear()` followed by `init()`, but reuses the same instance.
+     * Useful when the underlying storage has been modified externally and the tree needs to reflect current state.
+     */
+    abstract reload(): Deferred<void>;
     /**
      * Retrieves the value associated with the given key.
      * @param key The key to search for.
@@ -233,6 +237,7 @@ export declare abstract class BPTreeTransaction<K, V> {
         deleted: TransactionEntry<string, BPTreeNode<K, V>>[];
     };
     protected _clearCache(): void;
+    protected _resetForReload(): void;
     /**
      * Clears all cached nodes.
      * This method is useful for freeing up memory when the tree is no longer needed.

package/dist/types/transaction/BPTreeAsyncTransaction.d.ts

@@ -34,6 +34,8 @@ export declare class BPTreeAsyncTransaction<K, V> extends BPTreeTransaction<K, V
     protected getPairsGenerator(startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, direction: 1 | -1): AsyncGenerator<[K, V]>;
     init(): Promise<void>;
     protected _initInternal(): Promise<void>;
+    reload(): Promise<void>;
+    protected _reloadInternal(): Promise<void>;
     exists(key: K, value: V): Promise<boolean>;
     get(key: K): Promise<V | undefined>;
     keysStream(condition: BPTreeCondition<V>, options?: BPTreeSearchOption<K>): AsyncGenerator<K>;

package/dist/types/transaction/BPTreeSyncTransaction.d.ts

@@ -31,6 +31,8 @@ export declare class BPTreeSyncTransaction<K, V> extends BPTreeTransaction<K, V>
     protected getPairsGenerator(startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, direction: 1 | -1): Generator<[K, V]>;
     init(): void;
     protected _initInternal(): void;
+    reload(): void;
+    protected _reloadInternal(): void;
     exists(key: K, value: V): boolean;
     get(key: K): V | undefined;
     keysStream(condition: BPTreeCondition<V>, options?: BPTreeSearchOption<K>): Generator<K>;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "serializable-bptree",
-  "version": "8.4.0",
+  "version": "8.4.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 @@
     "typescript": "^5.9.3"
   },
   "dependencies": {
-    "mvcc-api": "^1.3.5",
+    "mvcc-api": "^1.3.6",
     "ryoiki": "^1.2.0"
   }
 }