data-structure-typed 2.2.0 → 2.2.2

package/dist/cjs/index.cjs

@@ -56,7 +56,7 @@ var IterableEntryBase = class {
   every(predicate, thisArg) {
     let index = 0;
     for (const item of this) {
-      if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
+      if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
         return false;
       }
     }
@@ -72,7 +72,7 @@ var IterableEntryBase = class {
   some(predicate, thisArg) {
     let index = 0;
     for (const item of this) {
-      if (predicate.call(thisArg, item[0], item[1], index++, this)) {
+      if (predicate.call(thisArg, item[1], item[0], index++, this)) {
         return true;
       }
     }
@@ -88,7 +88,7 @@ var IterableEntryBase = class {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
-      callbackfn.call(thisArg, key, value, index++, this);
+      callbackfn.call(thisArg, value, key, index++, this);
     }
   }
   /**
@@ -102,7 +102,7 @@ var IterableEntryBase = class {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
-      if (callbackfn.call(thisArg, key, value, index++, this)) return item;
+      if (callbackfn.call(thisArg, value, key, index++, this)) return item;
     }
     return;
   }
@@ -717,7 +717,7 @@ var HashMap = class extends IterableEntryBase {
   map(callbackfn, thisArg) {
     const out = this._createLike();
     let index = 0;
-    for (const [key, value] of this) out.set(key, callbackfn.call(thisArg, key, value, index++, this));
+    for (const [key, value] of this) out.set(key, callbackfn.call(thisArg, value, key, index++, this));
     return out;
   }
   /**
@@ -730,7 +730,7 @@ var HashMap = class extends IterableEntryBase {
   filter(predicate, thisArg) {
     const out = this._createLike();
     let index = 0;
-    for (const [key, value] of this) if (predicate.call(thisArg, key, value, index++, this)) out.set(key, value);
+    for (const [key, value] of this) if (predicate.call(thisArg, value, key, index++, this)) out.set(key, value);
     return out;
   }
   /**
@@ -1055,7 +1055,7 @@ var LinkedHashMap = class extends IterableEntryBase {
     const out = this._createLike();
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) out.set(key, value);
+      if (predicate.call(thisArg, value, key, index, this)) out.set(key, value);
       index++;
     }
     return out;
@@ -1073,7 +1073,7 @@ var LinkedHashMap = class extends IterableEntryBase {
     const out = this._createLike();
     let index = 0;
     for (const [key, value] of this) {
-      const [newKey, newValue] = callback.call(thisArg, key, value, index, this);
+      const [newKey, newValue] = callback.call(thisArg, value, key, index, this);
       out.set(newKey, newValue);
       index++;
     }
@@ -5692,7 +5692,7 @@ var AbstractGraph = class extends IterableEntryBase {
     const filtered = [];
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) {
+      if (predicate.call(thisArg, value, key, index, this)) {
         filtered.push([key, value]);
       }
       index++;
@@ -5707,7 +5707,7 @@ var AbstractGraph = class extends IterableEntryBase {
     const filtered = [];
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) {
+      if (predicate.call(thisArg, value, key, index, this)) {
         filtered.push([key, value]);
       }
       index++;
@@ -5718,7 +5718,7 @@ var AbstractGraph = class extends IterableEntryBase {
     const mapped = [];
     let index = 0;
     for (const [key, value] of this) {
-      mapped.push(callback.call(thisArg, key, value, index, this));
+      mapped.push(callback.call(thisArg, value, key, index, this));
       index++;
     }
     return mapped;
@@ -7994,7 +7994,7 @@ var BinaryTree = class extends IterableEntryBase {
   filter(predicate, thisArg) {
     const out = this._createInstance();
     let i = 0;
-    for (const [k, v] of this) if (predicate.call(thisArg, k, v, i++, this)) out.add([k, v]);
+    for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.add([k, v]);
     return out;
   }
   /**
@@ -8012,7 +8012,7 @@ var BinaryTree = class extends IterableEntryBase {
   map(cb, options, thisArg) {
     const out = this._createLike([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(cb.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(cb.call(thisArg, v, k, i++, this));
     return out;
   }
   /**
@@ -9118,7 +9118,7 @@ var BST = class extends BinaryTree {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -10095,7 +10095,7 @@ var AVLTree = class extends BST {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -10663,7 +10663,7 @@ var RedBlackTree = class extends BST {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -11175,7 +11175,7 @@ var AVLTreeMultiMap = class extends AVLTree {
   map(callback, options, thisArg) {
     const out = this._createLike([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
     return out;
   }
   /**
@@ -11454,7 +11454,7 @@ var TreeMultiMap = class extends RedBlackTree {
   map(callback, options, thisArg) {
     const out = this._createLike([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
     return out;
   }
   /**
@@ -11835,7 +11835,7 @@ var TreeCounter = class extends RedBlackTree {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -12260,7 +12260,7 @@ var AVLTreeCounter = class extends AVLTree {
     const out = this._createLike([], options);
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }