serializable-bptree 6.2.0 → 6.2.2

package/README.md

@@ -64,6 +64,7 @@ tree.where({ gt: 1 }) // Map([{ key: 'c', value: 3 }])
 tree.where({ lt: 2 }) // Map([{ key: 'a', value: 1 }])
 tree.where({ gt: 0, lt: 4 }) // Map([{ key: 'a', value: 1 }, { key: 'c', value: 3 }])
 tree.where({ or: [3, 1] }) // Map([{ key: 'a', value: 1 }, { key: 'c', value: 3 }])
+tree.where({ like: 'user_%' }) // Matches values matching the pattern
 
 tree.clear()
 ```

package/dist/cjs/index.cjs

@@ -494,20 +494,20 @@ var BPTree = class _BPTree {
     primaryOr: (nv, v) => this.ensureValues(v).some((v2) => this.comparator.isPrimarySame(nv, v2)),
     like: (nv, v) => {
       const nodeValue = this.comparator.match(nv);
-      const value = this.comparator.match(v);
+      const value = v;
       const cache = this._cachedRegexp.cache(value);
       const regexp = cache.raw;
       return regexp.test(nodeValue);
     }
   };
   verifierStartNode = {
-    gt: (v) => this.insertableNode(v),
-    gte: (v) => this.insertableNode(v),
-    lt: (v) => this.insertableNode(v),
-    lte: (v) => this.insertableNode(v),
-    equal: (v) => this.insertableNode(v),
+    gt: (v) => this.insertableNodeByPrimary(v),
+    gte: (v) => this.insertableNodeByPrimary(v),
+    lt: (v) => this.insertableNodeByPrimary(v),
+    lte: (v) => this.insertableRightestNodeByPrimary(v),
+    equal: (v) => this.insertableNodeByPrimary(v),
     notEqual: (v) => this.leftestNode(),
-    or: (v) => this.insertableNode(this.lowestValue(this.ensureValues(v))),
+    or: (v) => this.insertableNodeByPrimary(this.lowestPrimaryValue(this.ensureValues(v))),
     primaryGt: (v) => this.insertableNodeByPrimary(v),
     primaryGte: (v) => this.insertableNodeByPrimary(v),
     primaryLt: (v) => this.insertableNodeByPrimary(v),
@@ -532,7 +532,7 @@ var BPTree = class _BPTree {
     primaryGte: (v) => null,
     primaryLt: (v) => null,
     primaryLte: (v) => null,
-    primaryEqual: (v) => null,
+    primaryEqual: (v) => this.insertableRightestEndNodeByPrimary(v),
     primaryNotEqual: (v) => null,
     primaryOr: (v) => this.insertableRightestEndNodeByPrimary(
       this.highestPrimaryValue(this.ensureValues(v))

package/dist/esm/index.mjs

@@ -460,20 +460,20 @@ var BPTree = class _BPTree {
     primaryOr: (nv, v) => this.ensureValues(v).some((v2) => this.comparator.isPrimarySame(nv, v2)),
     like: (nv, v) => {
       const nodeValue = this.comparator.match(nv);
-      const value = this.comparator.match(v);
+      const value = v;
       const cache = this._cachedRegexp.cache(value);
       const regexp = cache.raw;
       return regexp.test(nodeValue);
     }
   };
   verifierStartNode = {
-    gt: (v) => this.insertableNode(v),
-    gte: (v) => this.insertableNode(v),
-    lt: (v) => this.insertableNode(v),
-    lte: (v) => this.insertableNode(v),
-    equal: (v) => this.insertableNode(v),
+    gt: (v) => this.insertableNodeByPrimary(v),
+    gte: (v) => this.insertableNodeByPrimary(v),
+    lt: (v) => this.insertableNodeByPrimary(v),
+    lte: (v) => this.insertableRightestNodeByPrimary(v),
+    equal: (v) => this.insertableNodeByPrimary(v),
     notEqual: (v) => this.leftestNode(),
-    or: (v) => this.insertableNode(this.lowestValue(this.ensureValues(v))),
+    or: (v) => this.insertableNodeByPrimary(this.lowestPrimaryValue(this.ensureValues(v))),
     primaryGt: (v) => this.insertableNodeByPrimary(v),
     primaryGte: (v) => this.insertableNodeByPrimary(v),
     primaryLt: (v) => this.insertableNodeByPrimary(v),
@@ -498,7 +498,7 @@ var BPTree = class _BPTree {
     primaryGte: (v) => null,
     primaryLt: (v) => null,
     primaryLte: (v) => null,
-    primaryEqual: (v) => null,
+    primaryEqual: (v) => this.insertableRightestEndNodeByPrimary(v),
     primaryNotEqual: (v) => null,
     primaryOr: (v) => this.insertableRightestEndNodeByPrimary(
       this.highestPrimaryValue(this.ensureValues(v))

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

@@ -21,7 +21,6 @@ export type BPTreeCondition<V> = Partial<{
     /** Searches for pairs that satisfy at least one of the conditions. */
     or: Partial<V>[];
     /** Searches for values matching the given pattern. '%' matches zero or more characters, and '_' matches exactly one character. */
-    like: Partial<V>;
     /**
      * Searches for pairs where the primary field equals the given value.
      * Uses `primaryAsc` method for comparison, which compares only the primary sorting field.
@@ -40,6 +39,12 @@ export type BPTreeCondition<V> = Partial<{
     primaryNotEqual: Partial<V>;
     /** Searches for pairs where the primary field matches at least one of the given values. */
     primaryOr: Partial<V>[];
+    /**
+     * Searches for values matching the given pattern on the primary field.
+     * Uses `match` method for getting string representation.
+     * '%' matches zero or more characters, and '_' matches exactly one character.
+     */
+    like: string;
 }>;
 export type BPTreePair<K, V> = Map<K, V>;
 export type BPTreeUnknownNode<K, V> = BPTreeInternalNode<K, V> | BPTreeLeafNode<K, V>;

package/package.json

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