directed-graph-typed 2.2.0 → 2.2.2

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