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/index.cjs CHANGED
@@ -109,7 +109,7 @@ var IterableEntryBase = class {
109
109
  every(predicate, thisArg) {
110
110
  let index = 0;
111
111
  for (const item of this) {
112
- if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
112
+ if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
113
113
  return false;
114
114
  }
115
115
  }
@@ -125,7 +125,7 @@ var IterableEntryBase = class {
125
125
  some(predicate, thisArg) {
126
126
  let index = 0;
127
127
  for (const item of this) {
128
- if (predicate.call(thisArg, item[0], item[1], index++, this)) {
128
+ if (predicate.call(thisArg, item[1], item[0], index++, this)) {
129
129
  return true;
130
130
  }
131
131
  }
@@ -141,7 +141,7 @@ var IterableEntryBase = class {
141
141
  let index = 0;
142
142
  for (const item of this) {
143
143
  const [key, value] = item;
144
- callbackfn.call(thisArg, key, value, index++, this);
144
+ callbackfn.call(thisArg, value, key, index++, this);
145
145
  }
146
146
  }
147
147
  /**
@@ -155,7 +155,7 @@ var IterableEntryBase = class {
155
155
  let index = 0;
156
156
  for (const item of this) {
157
157
  const [key, value] = item;
158
- if (callbackfn.call(thisArg, key, value, index++, this)) return item;
158
+ if (callbackfn.call(thisArg, value, key, index++, this)) return item;
159
159
  }
160
160
  return;
161
161
  }
@@ -2116,7 +2116,7 @@ var AbstractGraph = class extends IterableEntryBase {
2116
2116
  const filtered = [];
2117
2117
  let index = 0;
2118
2118
  for (const [key, value] of this) {
2119
- if (predicate.call(thisArg, key, value, index, this)) {
2119
+ if (predicate.call(thisArg, value, key, index, this)) {
2120
2120
  filtered.push([key, value]);
2121
2121
  }
2122
2122
  index++;
@@ -2131,7 +2131,7 @@ var AbstractGraph = class extends IterableEntryBase {
2131
2131
  const filtered = [];
2132
2132
  let index = 0;
2133
2133
  for (const [key, value] of this) {
2134
- if (predicate.call(thisArg, key, value, index, this)) {
2134
+ if (predicate.call(thisArg, value, key, index, this)) {
2135
2135
  filtered.push([key, value]);
2136
2136
  }
2137
2137
  index++;
@@ -2142,7 +2142,7 @@ var AbstractGraph = class extends IterableEntryBase {
2142
2142
  const mapped = [];
2143
2143
  let index = 0;
2144
2144
  for (const [key, value] of this) {
2145
- mapped.push(callback.call(thisArg, key, value, index, this));
2145
+ mapped.push(callback.call(thisArg, value, key, index, this));
2146
2146
  index++;
2147
2147
  }
2148
2148
  return mapped;