serializable-bptree 4.0.4 → 4.0.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (3) hide show
  1. package/dist/cjs/index.cjs +8 -6
  2. package/dist/esm/index.mjs +8 -6
  3. package/package.json +4 -4
package/dist/cjs/index.cjs CHANGED
@@ -637,9 +637,10 @@ var BPTreeSync = class extends BPTree {
637
637
  filterValues = new Set(pairs.map((pair) => pair.key));
638
638
  } else {
639
639
  const intersections = /* @__PURE__ */ new Set();
640
- for (const pair of pairs) {
641
- if (filterValues.has(pair.key)) {
642
- intersections.add(pair.key);
640
+ for (const key2 of filterValues) {
641
+ const has = pairs.some((pair) => pair.key === key2);
642
+ if (has) {
643
+ intersections.add(key2);
643
644
  }
644
645
  }
645
646
  filterValues = intersections;
@@ -1191,9 +1192,10 @@ var BPTreeAsync = class extends BPTree {
1191
1192
  filterValues = new Set(pairs.map((pair) => pair.key));
1192
1193
  } else {
1193
1194
  const intersections = /* @__PURE__ */ new Set();
1194
- for (const pair of pairs) {
1195
- if (filterValues.has(pair.key)) {
1196
- intersections.add(pair.key);
1195
+ for (const key2 of filterValues) {
1196
+ const has = pairs.some((pair) => pair.key === key2);
1197
+ if (has) {
1198
+ intersections.add(key2);
1197
1199
  }
1198
1200
  }
1199
1201
  filterValues = intersections;
package/dist/esm/index.mjs CHANGED
@@ -603,9 +603,10 @@ var BPTreeSync = class extends BPTree {
603
603
  filterValues = new Set(pairs.map((pair) => pair.key));
604
604
  } else {
605
605
  const intersections = /* @__PURE__ */ new Set();
606
- for (const pair of pairs) {
607
- if (filterValues.has(pair.key)) {
608
- intersections.add(pair.key);
606
+ for (const key2 of filterValues) {
607
+ const has = pairs.some((pair) => pair.key === key2);
608
+ if (has) {
609
+ intersections.add(key2);
609
610
  }
610
611
  }
611
612
  filterValues = intersections;
@@ -1157,9 +1158,10 @@ var BPTreeAsync = class extends BPTree {
1157
1158
  filterValues = new Set(pairs.map((pair) => pair.key));
1158
1159
  } else {
1159
1160
  const intersections = /* @__PURE__ */ new Set();
1160
- for (const pair of pairs) {
1161
- if (filterValues.has(pair.key)) {
1162
- intersections.add(pair.key);
1161
+ for (const key2 of filterValues) {
1162
+ const has = pairs.some((pair) => pair.key === key2);
1163
+ if (has) {
1164
+ intersections.add(key2);
1163
1165
  }
1164
1166
  }
1165
1167
  filterValues = intersections;
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "serializable-bptree",
3
- "version": "4.0.4",
3
+ "version": "4.0.5",
4
4
  "description": "Store the B+tree flexibly, not only in-memory.",
5
5
  "types": "./dist/types/index.d.ts",
6
6
  "main": "./dist/cjs/index.cjs",
@@ -36,10 +36,10 @@
36
36
  },
37
37
  "license": "MIT",
38
38
  "devDependencies": {
39
- "@types/jest": "^29.5.13",
40
- "esbuild": "^0.23.1",
39
+ "@types/jest": "^29.5.14",
40
+ "esbuild": "^0.24.0",
41
41
  "jest": "^29.7.0",
42
42
  "ts-jest": "^29.2.5",
43
- "typescript": "^5.6.2"
43
+ "typescript": "^5.6.3"
44
44
  }
45
45
  }