serializable-bptree 4.0.2 → 4.0.4

package/dist/cjs/index.cjs

@@ -328,6 +328,9 @@ var BPTreeSync = class extends BPTree {
     } else if (this.root === node) {
       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) {
+        return;
+      }
       let isPredecessor = false;
       let parentNode = this.getNode(node.parent);
       let prevNode = null;
@@ -879,6 +882,9 @@ var BPTreeAsync = class extends BPTree {
     } else if (this.root === node) {
       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) {
+        return;
+      }
       let isPredecessor = false;
       let parentNode = await this.getNode(node.parent);
       let prevNode = null;

package/dist/esm/index.mjs

@@ -294,6 +294,9 @@ var BPTreeSync = class extends BPTree {
     } else if (this.root === node) {
       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) {
+        return;
+      }
       let isPredecessor = false;
       let parentNode = this.getNode(node.parent);
       let prevNode = null;
@@ -845,6 +848,9 @@ var BPTreeAsync = class extends BPTree {
     } else if (this.root === node) {
       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) {
+        return;
+      }
       let isPredecessor = false;
       let parentNode = await this.getNode(node.parent);
       let prevNode = null;

package/dist/{typings → types}/base/BPTree.d.ts

@@ -96,19 +96,19 @@ export declare abstract class BPTree<K, V> {
     /**
      * You enter the key and value as a pair. You can later search for the pair by value.
      * This data is stored in the tree, sorted in ascending order of value.
-     * @param key The key of the pair.
+     * @param key The key of the pair. This key must be unique.
      * @param value The value of the pair.
      */
     abstract insert(key: K, value: V): Deferred<void>;
     /**
      * Deletes the pair that matches the key and value.
-     * @param key The key of the pair.
+     * @param key The key of the pair. This key must be unique.
      * @param value The value of the pair.
      */
     abstract delete(key: K, value: V): Deferred<void>;
     /**
      * It returns whether there is a value in the tree.
-     * @param key The key value to search for.
+     * @param key The key value to search for. This key must be unique.
      * @param value The value to search for.
      */
     abstract exists(key: K, value: V): Deferred<boolean>;

package/package.json

@@ -1,12 +1,13 @@
 {
   "name": "serializable-bptree",
-  "version": "4.0.2",
+  "version": "4.0.4",
   "description": "Store the B+tree flexibly, not only in-memory.",
-  "main": "dist/cjs/index.cjs",
-  "module": "dist/esm/index.mjs",
-  "typings": "dist/typings/index.d.ts",
+  "types": "./dist/types/index.d.ts",
+  "main": "./dist/cjs/index.cjs",
+  "module": "./dist/esm/index.mjs",
   "exports": {
     ".": {
+      "types": "./dist/types/index.d.ts",
       "import": "./dist/esm/index.mjs",
       "require": "./dist/cjs/index.cjs"
     }