red-black-tree-typed 2.2.0 → 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 (31) hide show
  1. package/dist/cjs/index.cjs +8 -8
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +8 -8
  4. package/dist/cjs-legacy/index.cjs.map +1 -1
  5. package/dist/esm/index.mjs +8 -8
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +8 -8
  8. package/dist/esm-legacy/index.mjs.map +1 -1
  9. package/dist/types/data-structures/binary-tree/avl-tree.d.ts +3 -1
  10. package/dist/types/data-structures/binary-tree/binary-tree.d.ts +1 -0
  11. package/dist/types/data-structures/binary-tree/bst.d.ts +1 -0
  12. package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +1 -0
  13. package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +1 -0
  14. package/dist/types/types/data-structures/base/base.d.ts +1 -1
  15. package/dist/umd/red-black-tree-typed.js +8 -8
  16. package/dist/umd/red-black-tree-typed.js.map +1 -1
  17. package/dist/umd/red-black-tree-typed.min.js +2 -2
  18. package/dist/umd/red-black-tree-typed.min.js.map +1 -1
  19. package/package.json +2 -2
  20. package/src/data-structures/base/iterable-entry-base.ts +4 -4
  21. package/src/data-structures/binary-tree/avl-tree-counter.ts +1 -1
  22. package/src/data-structures/binary-tree/avl-tree-multi-map.ts +1 -1
  23. package/src/data-structures/binary-tree/avl-tree.ts +4 -2
  24. package/src/data-structures/binary-tree/binary-tree.ts +3 -2
  25. package/src/data-structures/binary-tree/bst.ts +2 -1
  26. package/src/data-structures/binary-tree/red-black-tree.ts +2 -1
  27. package/src/data-structures/binary-tree/tree-counter.ts +1 -1
  28. package/src/data-structures/binary-tree/tree-multi-map.ts +2 -1
  29. package/src/data-structures/graph/abstract-graph.ts +3 -3
  30. package/src/data-structures/hash/hash-map.ts +4 -4
  31. package/src/types/data-structures/base/base.ts +1 -1
package/dist/cjs/index.cjs CHANGED
@@ -896,7 +896,7 @@ var IterableEntryBase = class {
896
896
  every(predicate, thisArg) {
897
897
  let index = 0;
898
898
  for (const item of this) {
899
- if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
899
+ if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
900
900
  return false;
901
901
  }
902
902
  }
@@ -912,7 +912,7 @@ var IterableEntryBase = class {
912
912
  some(predicate, thisArg) {
913
913
  let index = 0;
914
914
  for (const item of this) {
915
- if (predicate.call(thisArg, item[0], item[1], index++, this)) {
915
+ if (predicate.call(thisArg, item[1], item[0], index++, this)) {
916
916
  return true;
917
917
  }
918
918
  }
@@ -928,7 +928,7 @@ var IterableEntryBase = class {
928
928
  let index = 0;
929
929
  for (const item of this) {
930
930
  const [key, value] = item;
931
- callbackfn.call(thisArg, key, value, index++, this);
931
+ callbackfn.call(thisArg, value, key, index++, this);
932
932
  }
933
933
  }
934
934
  /**
@@ -942,7 +942,7 @@ var IterableEntryBase = class {
942
942
  let index = 0;
943
943
  for (const item of this) {
944
944
  const [key, value] = item;
945
- if (callbackfn.call(thisArg, key, value, index++, this)) return item;
945
+ if (callbackfn.call(thisArg, value, key, index++, this)) return item;
946
946
  }
947
947
  return;
948
948
  }
@@ -2193,7 +2193,7 @@ var BinaryTree = class extends IterableEntryBase {
2193
2193
  filter(predicate, thisArg) {
2194
2194
  const out = this._createInstance();
2195
2195
  let i = 0;
2196
- for (const [k, v] of this) if (predicate.call(thisArg, k, v, i++, this)) out.add([k, v]);
2196
+ for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.add([k, v]);
2197
2197
  return out;
2198
2198
  }
2199
2199
  /**
@@ -2211,7 +2211,7 @@ var BinaryTree = class extends IterableEntryBase {
2211
2211
  map(cb, options, thisArg) {
2212
2212
  const out = this._createLike([], options);
2213
2213
  let i = 0;
2214
- for (const [k, v] of this) out.add(cb.call(thisArg, k, v, i++, this));
2214
+ for (const [k, v] of this) out.add(cb.call(thisArg, v, k, i++, this));
2215
2215
  return out;
2216
2216
  }
2217
2217
  /**
@@ -3317,7 +3317,7 @@ var BST = class extends BinaryTree {
3317
3317
  const out = this._createLike([], options);
3318
3318
  let index = 0;
3319
3319
  for (const [key, value] of this) {
3320
- out.add(callback.call(thisArg, key, value, index++, this));
3320
+ out.add(callback.call(thisArg, value, key, index++, this));
3321
3321
  }
3322
3322
  return out;
3323
3323
  }
@@ -3760,7 +3760,7 @@ var RedBlackTree = class extends BST {
3760
3760
  const out = this._createLike([], options);
3761
3761
  let index = 0;
3762
3762
  for (const [key, value] of this) {
3763
- out.add(callback.call(thisArg, key, value, index++, this));
3763
+ out.add(callback.call(thisArg, value, key, index++, this));
3764
3764
  }
3765
3765
  return out;
3766
3766
  }