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/esm-legacy/index.mjs CHANGED
@@ -106,7 +106,7 @@ var _IterableEntryBase = class _IterableEntryBase {
106
106
  every(predicate, thisArg) {
107
107
  let index = 0;
108
108
  for (const item of this) {
109
- if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
109
+ if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
110
110
  return false;
111
111
  }
112
112
  }
@@ -122,7 +122,7 @@ var _IterableEntryBase = class _IterableEntryBase {
122
122
  some(predicate, thisArg) {
123
123
  let index = 0;
124
124
  for (const item of this) {
125
- if (predicate.call(thisArg, item[0], item[1], index++, this)) {
125
+ if (predicate.call(thisArg, item[1], item[0], index++, this)) {
126
126
  return true;
127
127
  }
128
128
  }
@@ -138,7 +138,7 @@ var _IterableEntryBase = class _IterableEntryBase {
138
138
  let index = 0;
139
139
  for (const item of this) {
140
140
  const [key, value] = item;
141
- callbackfn.call(thisArg, key, value, index++, this);
141
+ callbackfn.call(thisArg, value, key, index++, this);
142
142
  }
143
143
  }
144
144
  /**
@@ -152,7 +152,7 @@ var _IterableEntryBase = class _IterableEntryBase {
152
152
  let index = 0;
153
153
  for (const item of this) {
154
154
  const [key, value] = item;
155
- if (callbackfn.call(thisArg, key, value, index++, this)) return item;
155
+ if (callbackfn.call(thisArg, value, key, index++, this)) return item;
156
156
  }
157
157
  return;
158
158
  }
@@ -2113,7 +2113,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
2113
2113
  const filtered = [];
2114
2114
  let index = 0;
2115
2115
  for (const [key, value] of this) {
2116
- if (predicate.call(thisArg, key, value, index, this)) {
2116
+ if (predicate.call(thisArg, value, key, index, this)) {
2117
2117
  filtered.push([key, value]);
2118
2118
  }
2119
2119
  index++;
@@ -2128,7 +2128,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
2128
2128
  const filtered = [];
2129
2129
  let index = 0;
2130
2130
  for (const [key, value] of this) {
2131
- if (predicate.call(thisArg, key, value, index, this)) {
2131
+ if (predicate.call(thisArg, value, key, index, this)) {
2132
2132
  filtered.push([key, value]);
2133
2133
  }
2134
2134
  index++;
@@ -2139,7 +2139,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
2139
2139
  const mapped = [];
2140
2140
  let index = 0;
2141
2141
  for (const [key, value] of this) {
2142
- mapped.push(callback.call(thisArg, key, value, index, this));
2142
+ mapped.push(callback.call(thisArg, value, key, index, this));
2143
2143
  index++;
2144
2144
  }
2145
2145
  return mapped;