serializable-bptree 5.1.6 → 5.2.1

package/dist/types/BPTreeAsync.d.ts

@@ -4,9 +4,12 @@ import { ValueComparator } from './base/ValueComparator';
 import { SerializableData } from './base/SerializeStrategy';
 export declare class BPTreeAsync<K, V> extends BPTree<K, V> {
     protected readonly strategy: SerializeStrategyAsync<K, V>;
-    protected readonly nodes: ReturnType<BPTreeAsync<K, V>['_createCachedNode']>;
+    protected readonly nodes: ReturnType<typeof this._createCachedNode>;
+    private readonly lock;
     constructor(strategy: SerializeStrategyAsync<K, V>, comparator: ValueComparator<V>, option?: BPTreeConstructorOption);
     private _createCachedNode;
+    private readLock;
+    private writeLock;
     protected getPairsRightToLeft(value: V, startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, comparator: (nodeValue: V, value: V) => boolean): Promise<BPTreePair<K, V>>;
     protected getPairsLeftToRight(value: V, startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, comparator: (nodeValue: V, value: V) => boolean): Promise<BPTreePair<K, V>>;
     protected getPairs(value: V, startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, comparator: (nodeValue: V, value: V) => boolean, direction: 1 | -1): Promise<BPTreePair<K, V>>;

package/dist/types/BPTreeSync.d.ts

@@ -4,7 +4,7 @@ import { ValueComparator } from './base/ValueComparator';
 import { SerializableData } from './base/SerializeStrategy';
 export declare class BPTreeSync<K, V> extends BPTree<K, V> {
     protected readonly strategy: SerializeStrategySync<K, V>;
-    protected readonly nodes: ReturnType<BPTreeSync<K, V>['_createCachedNode']>;
+    protected readonly nodes: ReturnType<typeof this._createCachedNode>;
     constructor(strategy: SerializeStrategySync<K, V>, comparator: ValueComparator<V>, option?: BPTreeConstructorOption);
     private _createCachedNode;
     protected getPairsRightToLeft(value: V, startNode: BPTreeLeafNode<K, V>, endNode: BPTreeLeafNode<K, V> | null, comparator: (nodeValue: V, value: V) => boolean): BPTreePair<K, V>;

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

@@ -1,4 +1,4 @@
-import { CacheEntanglementSync, CacheEntanglementAsync, type StringValue } from 'cache-entanglement';
+import { CacheEntanglementSync, CacheEntanglementAsync } from 'cache-entanglement';
 import { ValueComparator } from './ValueComparator';
 import { SerializableData, SerializeStrategy } from './SerializeStrategy';
 type Sync<T> = T;
@@ -27,14 +27,11 @@ export type BPTreePair<K, V> = Map<K, V>;
 export type BPTreeUnknownNode<K, V> = BPTreeInternalNode<K, V> | BPTreeLeafNode<K, V>;
 export interface BPTreeConstructorOption {
     /**
-     * The lifespan of the cached node.
-     * This value is used to determine how long a cached node should be kept in memory.
-     * If the lifespan is set to a positive number, the cached node will expire after the specified number of milliseconds.
-     * If the lifespan is set to `0` or a negative number, the cache will not prevent garbage collection.
-     * If the lifespan is set to a string, the string will be parsed as a time duration.
-     * For example, '1m' means 1 minute, '1h' means 1 hour, '1d' means 1 day, '1w' means 1 week.
+     * The capacity of the cache.
+     * This value is used to determine how many nodes can be cached.
+     * If not specified, the default value is 1000.
      */
-    lifespan?: StringValue | number;
+    capacity?: number;
 }
 export interface BPTreeNode<K, V> {
     id: string;

package/dist/types/index.d.ts

@@ -1,4 +1,4 @@
-export type { BPTreeNode, BPTreeCondition } from './base/BPTree';
+export type { BPTreeNode, BPTreeInternalNode, BPTreeLeafNode, BPTreeNodeKey, BPTreePair, BPTreeUnknownNode, BPTreeCondition } from './base/BPTree';
 export type { SerializeStrategyHead, SerializableData } from './base/SerializeStrategy';
 export { ValueComparator, NumericComparator, StringComparator } from './base/ValueComparator';
 export { BPTreeSync } from './BPTreeSync';

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "serializable-bptree",
-  "version": "5.1.6",
+  "version": "5.2.1",
   "description": "Store the B+tree flexibly, not only in-memory.",
   "types": "./dist/types/index.d.ts",
   "main": "./dist/cjs/index.cjs",
@@ -16,7 +16,7 @@
     "dist/**/*"
   ],
   "scripts": {
-    "test": "jest -t",
+    "test": "jest",
     "build": "node build/index.js && tsc"
   },
   "author": "izure <admin@izure.org>",
@@ -36,13 +36,14 @@
   },
   "license": "MIT",
   "devDependencies": {
-    "@types/jest": "^29.5.14",
-    "esbuild": "^0.25.5",
-    "jest": "^29.7.0",
-    "ts-jest": "^29.4.0",
-    "typescript": "^5.8.3"
+    "@types/jest": "^30.0.0",
+    "esbuild": "^0.27.2",
+    "jest": "^30.2.0",
+    "ts-jest": "^29.4.6",
+    "typescript": "^5.9.3"
   },
   "dependencies": {
-    "cache-entanglement": "^1.6.0"
+    "cache-entanglement": "^1.7.1",
+    "ryoiki": "^1.2.0"
   }
-}
+}