serializable-bptree 4.0.0 → 4.0.1

package/dist/cjs/index.cjs

@@ -426,6 +426,39 @@ var CacheBranchSync = class _CacheBranchSync extends CacheBranch {
   }
 };
 
+// src/utils/InvertedWeakMap.ts
+var InvertedWeakMap = class {
+  _map;
+  _registry;
+  constructor() {
+    this._map = /* @__PURE__ */ new Map();
+    this._registry = new FinalizationRegistry((key) => this._map.delete(key));
+  }
+  clear() {
+    return this._map.clear();
+  }
+  delete(key) {
+    return this._map.delete(key);
+  }
+  get(key) {
+    return this._map.get(key)?.deref();
+  }
+  has(key) {
+    return this._map.has(key) && this.get(key) !== void 0;
+  }
+  set(key, value) {
+    this._map.set(key, new WeakRef(value));
+    this._registry.register(value, key);
+    return this;
+  }
+  get size() {
+    return this._map.size;
+  }
+  keys() {
+    return this._map.keys();
+  }
+};
+
 // src/base/BPTree.ts
 var BPTree = class {
   _cachedRegexp;
@@ -486,7 +519,7 @@ var BPTree = class {
     this._nodeCreateBuffer = /* @__PURE__ */ new Map();
     this._nodeUpdateBuffer = /* @__PURE__ */ new Map();
     this._nodeDeleteBuffer = /* @__PURE__ */ new Map();
-    this.nodes = /* @__PURE__ */ new Map();
+    this.nodes = new InvertedWeakMap();
     this.strategy = strategy;
     this.comparator = comparator;
   }

package/dist/esm/index.mjs

@@ -392,6 +392,39 @@ var CacheBranchSync = class _CacheBranchSync extends CacheBranch {
   }
 };
 
+// src/utils/InvertedWeakMap.ts
+var InvertedWeakMap = class {
+  _map;
+  _registry;
+  constructor() {
+    this._map = /* @__PURE__ */ new Map();
+    this._registry = new FinalizationRegistry((key) => this._map.delete(key));
+  }
+  clear() {
+    return this._map.clear();
+  }
+  delete(key) {
+    return this._map.delete(key);
+  }
+  get(key) {
+    return this._map.get(key)?.deref();
+  }
+  has(key) {
+    return this._map.has(key) && this.get(key) !== void 0;
+  }
+  set(key, value) {
+    this._map.set(key, new WeakRef(value));
+    this._registry.register(value, key);
+    return this;
+  }
+  get size() {
+    return this._map.size;
+  }
+  keys() {
+    return this._map.keys();
+  }
+};
+
 // src/base/BPTree.ts
 var BPTree = class {
   _cachedRegexp;
@@ -452,7 +485,7 @@ var BPTree = class {
     this._nodeCreateBuffer = /* @__PURE__ */ new Map();
     this._nodeUpdateBuffer = /* @__PURE__ */ new Map();
     this._nodeDeleteBuffer = /* @__PURE__ */ new Map();
-    this.nodes = /* @__PURE__ */ new Map();
+    this.nodes = new InvertedWeakMap();
     this.strategy = strategy;
     this.comparator = comparator;
   }

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

@@ -1,5 +1,6 @@
 import { ValueComparator } from './ValueComparator';
 import { SerializableData, SerializeStrategy } from './SerializeStrategy';
+import { InvertedWeakMap } from '../utils/InvertedWeakMap';
 type Sync<T> = T;
 type Async<T> = Promise<T>;
 type Deferred<T> = Sync<T> | Async<T>;
@@ -46,7 +47,7 @@ export declare abstract class BPTree<K, V> {
     private readonly _cachedRegexp;
     protected readonly strategy: SerializeStrategy<K, V>;
     protected readonly comparator: ValueComparator<V>;
-    protected readonly nodes: Map<string, BPTreeUnknownNode<K, V>>;
+    protected readonly nodes: InvertedWeakMap<string, BPTreeUnknownNode<K, V>>;
     protected order: number;
     protected root: BPTreeUnknownNode<K, V>;
     protected readonly _nodeCreateBuffer: Map<string, BPTreeUnknownNode<K, V>>;

package/dist/typings/base/SerializeStrategy.d.ts

@@ -14,7 +14,6 @@ export declare abstract class SerializeStrategy<K, V> {
      * The rule for generating node IDs is set.
      * When a new node is created within the tree, the value returned by this method becomes the node's ID.
      *
-     * **WARNING!** The return value should never be `null`.
      * @param isLeaf This is a flag that indicates whether the node is a leaf node or not.
      */
     abstract id(isLeaf: boolean): string | Promise<string>;

package/dist/typings/utils/InvertedWeakMap.d.ts

@@ -0,0 +1,12 @@
+export declare class InvertedWeakMap<K extends string | number | symbol, V extends WeakKey> {
+    private readonly _map;
+    private readonly _registry;
+    constructor();
+    clear(): void;
+    delete(key: K): boolean;
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    set(key: K, value: V): this;
+    get size(): number;
+    keys(): IterableIterator<K>;
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "serializable-bptree",
-  "version": "4.0.0",
+  "version": "4.0.1",
   "description": "Store the B+tree flexibly, not only in-memory.",
   "main": "dist/cjs/index.cjs",
   "module": "dist/esm/index.mjs",