serializable-bptree 8.1.2 → 8.1.3

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

@@ -15,6 +15,8 @@ export declare abstract class BPTreeTransaction<K, V> {
     protected readonly option: BPTreeConstructorOption;
     protected order: number;
     protected rootId: string;
+    protected isInitialized: boolean;
+    protected isDestroyed: boolean;
     protected readonly verifierMap: Record<keyof BPTreeCondition<V>, (nodeValue: V, value: V | V[]) => boolean>;
     protected readonly verifierStartNode: Record<keyof BPTreeCondition<V>, (value: V) => Deferred<BPTreeLeafNode<K, V>>>;
     protected readonly verifierEndNode: Record<keyof BPTreeCondition<V>, (value: V) => Deferred<BPTreeLeafNode<K, V> | null>>;
@@ -94,6 +96,11 @@ export declare abstract class BPTreeTransaction<K, V> {
     protected abstract insertableEndNode(value: V, direction: 1 | -1): Deferred<BPTreeLeafNode<K, V> | null>;
     protected abstract leftestNode(): Deferred<BPTreeLeafNode<K, V>>;
     protected abstract rightestNode(): Deferred<BPTreeLeafNode<K, V>>;
+    /**
+     * After creating a tree instance, it must be called.
+     * This method is used to initialize the stored tree and recover data.
+     * If it is not called, the tree will not function.
+     */
     /**
      * After creating a tree instance, it must be called.
      * This method is used to initialize the stored tree and recover data.
@@ -177,11 +184,13 @@ export declare abstract class BPTreeTransaction<K, V> {
         updated: TransactionEntry<string, BPTreeNode<K, V>>[];
         deleted: TransactionEntry<string, BPTreeNode<K, V>>[];
     };
+    protected _clearCache(): void;
     /**
      * Clears all cached nodes.
      * This method is useful for freeing up memory when the tree is no longer needed.
      */
     clear(): void;
+    protected _clearInternal(): void;
     protected _binarySearchValues(values: V[], target: V, usePrimary?: boolean, upperBound?: boolean): {
         index: number;
         found: boolean;

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

@@ -1,5 +1,6 @@
 import type { TransactionResult } from 'mvcc-api';
 import type { AsyncBPTreeMVCC, BPTreeCondition, BPTreeConstructorOption, BPTreeLeafNode, BPTreeNode, BPTreeNodeKey, BPTreeOrder, BPTreePair, BPTreeUnknownNode, SerializableData, SerializeStrategyHead } from '../types';
+import { Ryoiki } from 'ryoiki';
 import { BPTreeTransaction } from '../base/BPTreeTransaction';
 import { SerializeStrategyAsync } from '../SerializeStrategyAsync';
 import { ValueComparator } from '../base/ValueComparator';
@@ -10,7 +11,9 @@ export declare class BPTreeAsyncTransaction<K, V> extends BPTreeTransaction<K, V
     protected readonly strategy: SerializeStrategyAsync<K, V>;
     protected readonly comparator: ValueComparator<V>;
     protected readonly option: BPTreeConstructorOption;
+    protected readonly lock: Ryoiki;
     constructor(rootTx: BPTreeAsyncTransaction<K, V> | null, mvccRoot: AsyncBPTreeMVCC<K, V>, mvcc: AsyncBPTreeMVCC<K, V>, strategy: SerializeStrategyAsync<K, V>, comparator: ValueComparator<V>, option?: BPTreeConstructorOption);
+    protected writeLock<T>(id: number, fn: () => Promise<T>): Promise<T>;
     protected getNode(id: string): Promise<BPTreeUnknownNode<K, V>>;
     /**
      * Create a new node with a unique ID.
@@ -31,6 +34,7 @@ export declare class BPTreeAsyncTransaction<K, V> extends BPTreeTransaction<K, V
     protected rightestNode(): Promise<BPTreeLeafNode<K, V>>;
     protected getPairsGenerator(value: V, startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, comparator: (nodeValue: V, value: V) => boolean, direction: 1 | -1, earlyTerminate: boolean): AsyncGenerator<[K, V]>;
     init(): Promise<void>;
+    protected _initInternal(): Promise<void>;
     exists(key: K, value: V): Promise<boolean>;
     forceUpdate(id?: string): Promise<number>;
     get(key: K): Promise<V | undefined>;

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

@@ -31,6 +31,7 @@ export declare class BPTreeSyncTransaction<K, V> extends BPTreeTransaction<K, V>
     protected rightestNode(): BPTreeLeafNode<K, V>;
     protected getPairsGenerator(value: V, startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, comparator: (nodeValue: V, value: V) => boolean, direction: 1 | -1, earlyTerminate: boolean): Generator<[K, V]>;
     init(): void;
+    protected _initInternal(): void;
     exists(key: K, value: V): boolean;
     forceUpdate(id?: string): number;
     get(key: K): V | undefined;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "serializable-bptree",
-  "version": "8.1.2",
+  "version": "8.1.3",
   "description": "Store the B+tree flexibly, not only in-memory.",
   "types": "./dist/types/index.d.ts",
   "main": "./dist/cjs/index.cjs",
@@ -17,7 +17,8 @@
   ],
   "scripts": {
     "test": "jest --runInBand",
-    "build": "node build/index.js && tsc"
+    "build": "node build/index.js && tsc",
+    "benchmark": "npx tsx benchmark/index.ts"
   },
   "author": "izure <admin@izure.org>",
   "keywords": [
@@ -44,7 +45,7 @@
   },
   "dependencies": {
     "cache-entanglement": "^1.7.1",
-    "mvcc-api": "^1.2.11",
+    "mvcc-api": "^1.3.1",
     "ryoiki": "^1.2.0"
   }
-}
+}