binary-tree-typed 2.1.2 → 2.2.1

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 (37) hide show
  1. package/dist/cjs/index.cjs +86 -86
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +2680 -0
  4. package/dist/cjs-legacy/index.cjs.map +1 -0
  5. package/dist/esm/index.mjs +86 -86
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +2675 -0
  8. package/dist/esm-legacy/index.mjs.map +1 -0
  9. package/dist/types/data-structures/binary-tree/avl-tree-counter.d.ts +57 -3
  10. package/dist/types/data-structures/binary-tree/avl-tree-multi-map.d.ts +65 -3
  11. package/dist/types/data-structures/binary-tree/avl-tree.d.ts +61 -5
  12. package/dist/types/data-structures/binary-tree/binary-tree.d.ts +1 -0
  13. package/dist/types/data-structures/binary-tree/bst.d.ts +58 -3
  14. package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +59 -4
  15. package/dist/types/data-structures/binary-tree/tree-counter.d.ts +57 -3
  16. package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +66 -3
  17. package/dist/types/types/data-structures/base/base.d.ts +1 -1
  18. package/dist/umd/binary-tree-typed.js +6 -6
  19. package/dist/umd/binary-tree-typed.js.map +1 -1
  20. package/dist/umd/binary-tree-typed.min.js +1 -1
  21. package/dist/umd/binary-tree-typed.min.js.map +1 -1
  22. package/package.json +20 -2
  23. package/src/data-structures/base/iterable-entry-base.ts +4 -4
  24. package/src/data-structures/binary-tree/avl-tree-counter.ts +103 -12
  25. package/src/data-structures/binary-tree/avl-tree-multi-map.ts +116 -12
  26. package/src/data-structures/binary-tree/avl-tree.ts +109 -16
  27. package/src/data-structures/binary-tree/binary-tree.ts +3 -2
  28. package/src/data-structures/binary-tree/bst.ts +104 -12
  29. package/src/data-structures/binary-tree/red-black-tree.ts +110 -19
  30. package/src/data-structures/binary-tree/tree-counter.ts +102 -11
  31. package/src/data-structures/binary-tree/tree-multi-map.ts +124 -12
  32. package/src/data-structures/graph/abstract-graph.ts +8 -8
  33. package/src/data-structures/graph/directed-graph.ts +5 -5
  34. package/src/data-structures/graph/undirected-graph.ts +5 -5
  35. package/src/data-structures/hash/hash-map.ts +4 -4
  36. package/src/types/data-structures/base/base.ts +1 -1
  37. package/tsup.node.config.js +40 -6
package/dist/umd/binary-tree-typed.js CHANGED
@@ -907,7 +907,7 @@ var binaryTreeTyped = (() => {
907
907
  every(predicate, thisArg) {
908
908
  let index = 0;
909
909
  for (const item of this) {
910
- if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
910
+ if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
911
911
  return false;
912
912
  }
913
913
  }
@@ -923,7 +923,7 @@ var binaryTreeTyped = (() => {
923
923
  some(predicate, thisArg) {
924
924
  let index = 0;
925
925
  for (const item of this) {
926
- if (predicate.call(thisArg, item[0], item[1], index++, this)) {
926
+ if (predicate.call(thisArg, item[1], item[0], index++, this)) {
927
927
  return true;
928
928
  }
929
929
  }
@@ -939,7 +939,7 @@ var binaryTreeTyped = (() => {
939
939
  let index = 0;
940
940
  for (const item of this) {
941
941
  const [key, value] = item;
942
- callbackfn.call(thisArg, key, value, index++, this);
942
+ callbackfn.call(thisArg, value, key, index++, this);
943
943
  }
944
944
  }
945
945
  /**
@@ -953,7 +953,7 @@ var binaryTreeTyped = (() => {
953
953
  let index = 0;
954
954
  for (const item of this) {
955
955
  const [key, value] = item;
956
- if (callbackfn.call(thisArg, key, value, index++, this)) return item;
956
+ if (callbackfn.call(thisArg, value, key, index++, this)) return item;
957
957
  }
958
958
  return;
959
959
  }
@@ -2204,7 +2204,7 @@ var binaryTreeTyped = (() => {
2204
2204
  filter(predicate, thisArg) {
2205
2205
  const out = this._createInstance();
2206
2206
  let i = 0;
2207
- for (const [k, v] of this) if (predicate.call(thisArg, k, v, i++, this)) out.add([k, v]);
2207
+ for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.add([k, v]);
2208
2208
  return out;
2209
2209
  }
2210
2210
  /**
@@ -2222,7 +2222,7 @@ var binaryTreeTyped = (() => {
2222
2222
  map(cb, options, thisArg) {
2223
2223
  const out = this._createLike([], options);
2224
2224
  let i = 0;
2225
- for (const [k, v] of this) out.add(cb.call(thisArg, k, v, i++, this));
2225
+ for (const [k, v] of this) out.add(cb.call(thisArg, v, k, i++, this));
2226
2226
  return out;
2227
2227
  }
2228
2228
  /**