directed-graph-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 +7 -7
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +7 -7
  4. package/dist/cjs-legacy/index.cjs.map +1 -1
  5. package/dist/esm/index.mjs +7 -7
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +7 -7
  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/directed-graph-typed.js +7 -7
  16. package/dist/umd/directed-graph-typed.js.map +1 -1
  17. package/dist/umd/directed-graph-typed.min.js +1 -1
  18. package/dist/umd/directed-graph-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-legacy/index.cjs CHANGED
@@ -108,7 +108,7 @@ var _IterableEntryBase = class _IterableEntryBase {
108
108
  every(predicate, thisArg) {
109
109
  let index = 0;
110
110
  for (const item of this) {
111
- if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
111
+ if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
112
112
  return false;
113
113
  }
114
114
  }
@@ -124,7 +124,7 @@ var _IterableEntryBase = class _IterableEntryBase {
124
124
  some(predicate, thisArg) {
125
125
  let index = 0;
126
126
  for (const item of this) {
127
- if (predicate.call(thisArg, item[0], item[1], index++, this)) {
127
+ if (predicate.call(thisArg, item[1], item[0], index++, this)) {
128
128
  return true;
129
129
  }
130
130
  }
@@ -140,7 +140,7 @@ var _IterableEntryBase = class _IterableEntryBase {
140
140
  let index = 0;
141
141
  for (const item of this) {
142
142
  const [key, value] = item;
143
- callbackfn.call(thisArg, key, value, index++, this);
143
+ callbackfn.call(thisArg, value, key, index++, this);
144
144
  }
145
145
  }
146
146
  /**
@@ -154,7 +154,7 @@ var _IterableEntryBase = class _IterableEntryBase {
154
154
  let index = 0;
155
155
  for (const item of this) {
156
156
  const [key, value] = item;
157
- if (callbackfn.call(thisArg, key, value, index++, this)) return item;
157
+ if (callbackfn.call(thisArg, value, key, index++, this)) return item;
158
158
  }
159
159
  return;
160
160
  }
@@ -2115,7 +2115,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
2115
2115
  const filtered = [];
2116
2116
  let index = 0;
2117
2117
  for (const [key, value] of this) {
2118
- if (predicate.call(thisArg, key, value, index, this)) {
2118
+ if (predicate.call(thisArg, value, key, index, this)) {
2119
2119
  filtered.push([key, value]);
2120
2120
  }
2121
2121
  index++;
@@ -2130,7 +2130,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
2130
2130
  const filtered = [];
2131
2131
  let index = 0;
2132
2132
  for (const [key, value] of this) {
2133
- if (predicate.call(thisArg, key, value, index, this)) {
2133
+ if (predicate.call(thisArg, value, key, index, this)) {
2134
2134
  filtered.push([key, value]);
2135
2135
  }
2136
2136
  index++;
@@ -2141,7 +2141,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
2141
2141
  const mapped = [];
2142
2142
  let index = 0;
2143
2143
  for (const [key, value] of this) {
2144
- mapped.push(callback.call(thisArg, key, value, index, this));
2144
+ mapped.push(callback.call(thisArg, value, key, index, this));
2145
2145
  index++;
2146
2146
  }
2147
2147
  return mapped;