serializable-bptree 5.0.2 → 5.0.4

package/README.md

@@ -102,7 +102,7 @@ import {
     ValueComparator,
     NumericComparator,
     StringComparator
-  } from 'https://cdn.jsdelivr.net/npm/serializable-bptree@5.x.x/dist/esm/index.min.js'
+  } from 'https://cdn.jsdelivr.net/npm/serializable-bptree@5/+esm'
 </script>
 ```
 

package/dist/cjs/index.cjs

@@ -73,6 +73,13 @@ var InvertedWeakMap = class {
     return this._map.clear();
   }
   delete(key) {
+    const ref = this._map.get(key);
+    if (ref) {
+      const raw = ref.deref();
+      if (raw !== void 0) {
+        this._registry.unregister(raw);
+      }
+    }
     return this._map.delete(key);
   }
   get(key) {
@@ -190,12 +197,21 @@ var BPTree = class {
     }
   }
   bufferForNodeCreate(node) {
+    if (node.id === this.root.id) {
+      this._strategyDirty = true;
+    }
     this._nodeCreateBuffer.set(node.id, node);
   }
   bufferForNodeUpdate(node) {
+    if (node.id === this.root.id) {
+      this._strategyDirty = true;
+    }
     this._nodeUpdateBuffer.set(node.id, node);
   }
   bufferForNodeDelete(node) {
+    if (node.id === this.root.id) {
+      this._strategyDirty = true;
+    }
     this._nodeDeleteBuffer.set(node.id, node);
   }
   /**
@@ -326,10 +342,10 @@ var BPTreeSync = class extends BPTree {
       this.root = this.getNode(keys[0]);
       this.root.parent = null;
       this.strategy.head.root = this.root.id;
-      this._strategyDirty = true;
       this.bufferForNodeUpdate(this.root);
       return;
     } else if (this.root === node) {
+      this.bufferForNodeUpdate(this.root);
       return;
     } 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) {
@@ -510,7 +526,6 @@ var BPTreeSync = class extends BPTree {
       const root = this._createNode(false, [node.id, pointer.id], [value]);
       this.root = root;
       this.strategy.head.root = root.id;
-      this._strategyDirty = true;
       node.parent = root.id;
       pointer.parent = root.id;
       this.bufferForNodeCreate(root);
@@ -889,10 +904,10 @@ var BPTreeAsync = class extends BPTree {
       this.root = await this.getNode(keys[0]);
       this.root.parent = null;
       this.strategy.head.root = this.root.id;
-      this._strategyDirty = true;
       this.bufferForNodeUpdate(this.root);
       return;
     } else if (this.root === node) {
+      this.bufferForNodeUpdate(this.root);
       return;
     } 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) {
@@ -1073,7 +1088,6 @@ var BPTreeAsync = class extends BPTree {
       const root = await this._createNode(false, [node.id, pointer.id], [value]);
       this.root = root;
       this.strategy.head.root = root.id;
-      this._strategyDirty = true;
       node.parent = root.id;
       pointer.parent = root.id;
       this.bufferForNodeCreate(root);

package/dist/esm/index.mjs

@@ -39,6 +39,13 @@ var InvertedWeakMap = class {
     return this._map.clear();
   }
   delete(key) {
+    const ref = this._map.get(key);
+    if (ref) {
+      const raw = ref.deref();
+      if (raw !== void 0) {
+        this._registry.unregister(raw);
+      }
+    }
     return this._map.delete(key);
   }
   get(key) {
@@ -156,12 +163,21 @@ var BPTree = class {
     }
   }
   bufferForNodeCreate(node) {
+    if (node.id === this.root.id) {
+      this._strategyDirty = true;
+    }
     this._nodeCreateBuffer.set(node.id, node);
   }
   bufferForNodeUpdate(node) {
+    if (node.id === this.root.id) {
+      this._strategyDirty = true;
+    }
     this._nodeUpdateBuffer.set(node.id, node);
   }
   bufferForNodeDelete(node) {
+    if (node.id === this.root.id) {
+      this._strategyDirty = true;
+    }
     this._nodeDeleteBuffer.set(node.id, node);
   }
   /**
@@ -292,10 +308,10 @@ var BPTreeSync = class extends BPTree {
       this.root = this.getNode(keys[0]);
       this.root.parent = null;
       this.strategy.head.root = this.root.id;
-      this._strategyDirty = true;
       this.bufferForNodeUpdate(this.root);
       return;
     } else if (this.root === node) {
+      this.bufferForNodeUpdate(this.root);
       return;
     } 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) {
@@ -476,7 +492,6 @@ var BPTreeSync = class extends BPTree {
       const root = this._createNode(false, [node.id, pointer.id], [value]);
       this.root = root;
       this.strategy.head.root = root.id;
-      this._strategyDirty = true;
       node.parent = root.id;
       pointer.parent = root.id;
       this.bufferForNodeCreate(root);
@@ -855,10 +870,10 @@ var BPTreeAsync = class extends BPTree {
       this.root = await this.getNode(keys[0]);
       this.root.parent = null;
       this.strategy.head.root = this.root.id;
-      this._strategyDirty = true;
       this.bufferForNodeUpdate(this.root);
       return;
     } else if (this.root === node) {
+      this.bufferForNodeUpdate(this.root);
       return;
     } 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) {
@@ -1039,7 +1054,6 @@ var BPTreeAsync = class extends BPTree {
       const root = await this._createNode(false, [node.id, pointer.id], [value]);
       this.root = root;
       this.strategy.head.root = root.id;
-      this._strategyDirty = true;
       node.parent = root.id;
       pointer.parent = root.id;
       this.bufferForNodeCreate(root);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "serializable-bptree",
-  "version": "5.0.2",
+  "version": "5.0.4",
   "description": "Store the B+tree flexibly, not only in-memory.",
   "types": "./dist/types/index.d.ts",
   "main": "./dist/cjs/index.cjs",