serializable-bptree 8.2.0 → 8.3.0

package/dist/cjs/index.cjs

@@ -2256,6 +2256,33 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       this._insertInParent(before, after.values[0], after);
     }
   }
+  batchInsert(entries) {
+    if (entries.length === 0) return;
+    const sorted = [...entries].sort((a, b) => this.comparator.asc(a[1], b[1]));
+    for (const [key, value] of sorted) {
+      let before = this.insertableNode(value);
+      before = this._insertAtLeaf(before, key, value);
+      if (before.values.length === this.order) {
+        let after = this._createNode(
+          true,
+          [],
+          [],
+          before.parent,
+          null,
+          null
+        );
+        const mid = Math.ceil(this.order / 2) - 1;
+        after = this._cloneNode(after);
+        after.values = before.values.slice(mid + 1);
+        after.keys = before.keys.slice(mid + 1);
+        before.values = before.values.slice(0, mid + 1);
+        before.keys = before.keys.slice(0, mid + 1);
+        this._updateNode(before);
+        this._updateNode(after);
+        this._insertInParent(before, after.values[0], after);
+      }
+    }
+  }
   _deleteEntry(node, key) {
     if (!node.leaf) {
       let keyIndex = -1;
@@ -2611,6 +2638,14 @@ var BPTreeSync = class extends BPTreeSyncTransaction {
       throw new Error(`Transaction failed: ${result.error || "Commit failed due to conflict"}`);
     }
   }
+  batchInsert(entries) {
+    const tx = this.createTransaction();
+    tx.batchInsert(entries);
+    const result = tx.commit();
+    if (!result.success) {
+      throw new Error(`Transaction failed: ${result.error || "Commit failed due to conflict"}`);
+    }
+  }
 };
 
 // node_modules/ryoiki/dist/esm/index.mjs
@@ -3344,6 +3379,35 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       }
     });
   }
+  async batchInsert(entries) {
+    if (entries.length === 0) return;
+    return this.writeLock(0, async () => {
+      const sorted = [...entries].sort((a, b) => this.comparator.asc(a[1], b[1]));
+      for (const [key, value] of sorted) {
+        let before = await this.insertableNode(value);
+        before = await this._insertAtLeaf(before, key, value);
+        if (before.values.length === this.order) {
+          let after = await this._createNode(
+            true,
+            [],
+            [],
+            before.parent,
+            null,
+            null
+          );
+          const mid = Math.ceil(this.order / 2) - 1;
+          after = this._cloneNode(after);
+          after.values = before.values.slice(mid + 1);
+          after.keys = before.keys.slice(mid + 1);
+          before.values = before.values.slice(0, mid + 1);
+          before.keys = before.keys.slice(0, mid + 1);
+          await this._updateNode(before);
+          await this._updateNode(after);
+          await this._insertInParent(before, after.values[0], after);
+        }
+      }
+    });
+  }
   async _deleteEntry(node, key) {
     if (!node.leaf) {
       let keyIndex = -1;
@@ -3705,6 +3769,16 @@ var BPTreeAsync = class extends BPTreeAsyncTransaction {
       }
     });
   }
+  async batchInsert(entries) {
+    return this.writeLock(1, async () => {
+      const tx = await this.createTransaction();
+      await tx.batchInsert(entries);
+      const result = await tx.commit();
+      if (!result.success) {
+        throw new Error(`Transaction failed: ${result.error || "Commit failed due to conflict"}`);
+      }
+    });
+  }
 };
 
 // src/base/SerializeStrategy.ts

package/dist/esm/index.mjs

@@ -2220,6 +2220,33 @@ var BPTreeSyncTransaction = class extends BPTreeTransaction {
       this._insertInParent(before, after.values[0], after);
     }
   }
+  batchInsert(entries) {
+    if (entries.length === 0) return;
+    const sorted = [...entries].sort((a, b) => this.comparator.asc(a[1], b[1]));
+    for (const [key, value] of sorted) {
+      let before = this.insertableNode(value);
+      before = this._insertAtLeaf(before, key, value);
+      if (before.values.length === this.order) {
+        let after = this._createNode(
+          true,
+          [],
+          [],
+          before.parent,
+          null,
+          null
+        );
+        const mid = Math.ceil(this.order / 2) - 1;
+        after = this._cloneNode(after);
+        after.values = before.values.slice(mid + 1);
+        after.keys = before.keys.slice(mid + 1);
+        before.values = before.values.slice(0, mid + 1);
+        before.keys = before.keys.slice(0, mid + 1);
+        this._updateNode(before);
+        this._updateNode(after);
+        this._insertInParent(before, after.values[0], after);
+      }
+    }
+  }
   _deleteEntry(node, key) {
     if (!node.leaf) {
       let keyIndex = -1;
@@ -2575,6 +2602,14 @@ var BPTreeSync = class extends BPTreeSyncTransaction {
       throw new Error(`Transaction failed: ${result.error || "Commit failed due to conflict"}`);
     }
   }
+  batchInsert(entries) {
+    const tx = this.createTransaction();
+    tx.batchInsert(entries);
+    const result = tx.commit();
+    if (!result.success) {
+      throw new Error(`Transaction failed: ${result.error || "Commit failed due to conflict"}`);
+    }
+  }
 };
 
 // node_modules/ryoiki/dist/esm/index.mjs
@@ -3308,6 +3343,35 @@ var BPTreeAsyncTransaction = class extends BPTreeTransaction {
       }
     });
   }
+  async batchInsert(entries) {
+    if (entries.length === 0) return;
+    return this.writeLock(0, async () => {
+      const sorted = [...entries].sort((a, b) => this.comparator.asc(a[1], b[1]));
+      for (const [key, value] of sorted) {
+        let before = await this.insertableNode(value);
+        before = await this._insertAtLeaf(before, key, value);
+        if (before.values.length === this.order) {
+          let after = await this._createNode(
+            true,
+            [],
+            [],
+            before.parent,
+            null,
+            null
+          );
+          const mid = Math.ceil(this.order / 2) - 1;
+          after = this._cloneNode(after);
+          after.values = before.values.slice(mid + 1);
+          after.keys = before.keys.slice(mid + 1);
+          before.values = before.values.slice(0, mid + 1);
+          before.keys = before.keys.slice(0, mid + 1);
+          await this._updateNode(before);
+          await this._updateNode(after);
+          await this._insertInParent(before, after.values[0], after);
+        }
+      }
+    });
+  }
   async _deleteEntry(node, key) {
     if (!node.leaf) {
       let keyIndex = -1;
@@ -3669,6 +3733,16 @@ var BPTreeAsync = class extends BPTreeAsyncTransaction {
       }
     });
   }
+  async batchInsert(entries) {
+    return this.writeLock(1, async () => {
+      const tx = await this.createTransaction();
+      await tx.batchInsert(entries);
+      const result = await tx.commit();
+      if (!result.success) {
+        throw new Error(`Transaction failed: ${result.error || "Commit failed due to conflict"}`);
+      }
+    });
+  }
 };
 
 // src/base/SerializeStrategy.ts

package/dist/types/BPTreeAsync.d.ts

@@ -11,4 +11,5 @@ export declare class BPTreeAsync<K, V> extends BPTreeAsyncTransaction<K, V> {
     createTransaction(): Promise<BPTreeAsyncTransaction<K, V>>;
     insert(key: K, value: V): Promise<void>;
     delete(key: K, value?: V): Promise<void>;
+    batchInsert(entries: [K, V][]): Promise<void>;
 }

package/dist/types/BPTreeSync.d.ts

@@ -11,4 +11,5 @@ export declare class BPTreeSync<K, V> extends BPTreeSyncTransaction<K, V> {
     createTransaction(): BPTreeSyncTransaction<K, V>;
     insert(key: K, value: V): void;
     delete(key: K, value?: V): void;
+    batchInsert(entries: [K, V][]): void;
 }

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

@@ -152,6 +152,13 @@ export declare abstract class BPTreeTransaction<K, V> {
      * @param value The value of the pair.
      */
     abstract insert(key: K, value: V): Deferred<void>;
+    /**
+     * Inserts multiple key-value pairs into the tree in a single batch operation.
+     * Entries are sorted by value before insertion to optimize tree traversal.
+     * This is more efficient than calling insert() multiple times.
+     * @param entries Array of [key, value] pairs to insert.
+     */
+    abstract batchInsert(entries: [K, V][]): Deferred<void>;
     /**
      * Deletes the pair that matches the key and value.
      * @param key The key of the pair. This key must be unique.

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

@@ -42,6 +42,7 @@ export declare class BPTreeAsyncTransaction<K, V> extends BPTreeTransaction<K, V
     keys(condition: BPTreeCondition<V>, options?: BPTreeSearchOption<K>): Promise<Set<K>>;
     where(condition: BPTreeCondition<V>, options?: BPTreeSearchOption<K>): Promise<BPTreePair<K, V>>;
     insert(key: K, value: V): Promise<void>;
+    batchInsert(entries: [K, V][]): Promise<void>;
     protected _deleteEntry(node: BPTreeUnknownNode<K, V>, key: BPTreeNodeKey<K>): Promise<BPTreeUnknownNode<K, V>>;
     delete(key: K, value?: V): Promise<void>;
     getHeadData(): Promise<SerializableData>;

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

@@ -39,6 +39,7 @@ export declare class BPTreeSyncTransaction<K, V> extends BPTreeTransaction<K, V>
     keys(condition: BPTreeCondition<V>, options?: BPTreeSearchOption<K>): Set<K>;
     where(condition: BPTreeCondition<V>, options?: BPTreeSearchOption<K>): BPTreePair<K, V>;
     insert(key: K, value: V): void;
+    batchInsert(entries: [K, V][]): void;
     protected _deleteEntry(node: BPTreeUnknownNode<K, V>, key: BPTreeNodeKey<K>): BPTreeUnknownNode<K, V>;
     delete(key: K, value?: V): void;
     getHeadData(): SerializableData;

package/package.json

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