@dereekb/util 13.5.0 → 13.5.1

package/index.cjs.js

@@ -3,34 +3,34 @@
 var extraSet = require('extra-set');
 var makeError = require('make-error');
 
-function _array_like_to_array$C(arr, len) {
+function _array_like_to_array$A(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$r(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$C(arr);
+function _array_without_holes$n(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$A(arr);
 }
-function _iterable_to_array$r(iter) {
+function _iterable_to_array$n(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$r() {
+function _non_iterable_spread$n() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$r(arr) {
-    return _array_without_holes$r(arr) || _iterable_to_array$r(arr) || _unsupported_iterable_to_array$C(arr) || _non_iterable_spread$r();
+function _to_consumable_array$n(arr) {
+    return _array_without_holes$n(arr) || _iterable_to_array$n(arr) || _unsupported_iterable_to_array$A(arr) || _non_iterable_spread$n();
 }
 function _type_of$m(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$C(o, minLen) {
+function _unsupported_iterable_to_array$A(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$C(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$A(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$C(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$A(o, minLen);
 }
 // MARK: Functions
 /**
@@ -65,7 +65,7 @@ function _unsupported_iterable_to_array$C(o, minLen) {
             values
         ];
     } else if (isIterable(values)) {
-        iterable = _to_consumable_array$r(values); // copy the array
+        iterable = _to_consumable_array$n(values); // copy the array
     } else {
         iterable = [
             values
@@ -393,30 +393,30 @@ function _unsupported_iterable_to_array$C(o, minLen) {
     }
 }
 
-function _array_like_to_array$B(arr, len) {
+function _array_like_to_array$z(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$q(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$B(arr);
+function _array_without_holes$m(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$z(arr);
 }
-function _iterable_to_array$q(iter) {
+function _iterable_to_array$m(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$q() {
+function _non_iterable_spread$m() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$q(arr) {
-    return _array_without_holes$q(arr) || _iterable_to_array$q(arr) || _unsupported_iterable_to_array$B(arr) || _non_iterable_spread$q();
+function _to_consumable_array$m(arr) {
+    return _array_without_holes$m(arr) || _iterable_to_array$m(arr) || _unsupported_iterable_to_array$z(arr) || _non_iterable_spread$m();
 }
-function _unsupported_iterable_to_array$B(o, minLen) {
+function _unsupported_iterable_to_array$z(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$B(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$z(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$B(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$z(o, minLen);
 }
 // MARK: Functions
 /**
@@ -550,7 +550,7 @@ function _unsupported_iterable_to_array$B(o, minLen) {
  * @param input - array to copy, or nullish
  * @returns a new array with the same elements, or an empty array if input is nullish
  */ function copyArray(input) {
-    return input != null ? _to_consumable_array$q(input) : [];
+    return input != null ? _to_consumable_array$m(input) : [];
 }
 /**
  * Pushes the same element onto the target array a specified number of times.
@@ -573,7 +573,7 @@ function _unsupported_iterable_to_array$B(o, minLen) {
  */ function mergeArrays(arrays) {
     return mergeArraysIntoArray.apply(void 0, [
         []
-    ].concat(_to_consumable_array$q(arrays)));
+    ].concat(_to_consumable_array$m(arrays)));
 }
 /**
  * Merges the input arrays into the target array by pushing each item from each array. Creates an empty array if the target is nullish.
@@ -659,7 +659,7 @@ function _unsupported_iterable_to_array$B(o, minLen) {
         var length = values.length;
         var secondHalfStartIndex = Math.max(keepFromFront, length - (maxToTake - keepFromFront));
         var secondHalfEndIndex = length;
-        results = _to_consumable_array$q(values.slice(0, keepFromFront)).concat(_to_consumable_array$q(values.slice(secondHalfStartIndex, secondHalfEndIndex)));
+        results = _to_consumable_array$m(values.slice(0, keepFromFront)).concat(_to_consumable_array$m(values.slice(secondHalfStartIndex, secondHalfEndIndex)));
     }
     return results;
 }
@@ -785,30 +785,30 @@ function _unsupported_iterable_to_array$B(o, minLen) {
     return readKeysSetFunction(readKey)(values);
 }
 
-function _array_like_to_array$A(arr, len) {
+function _array_like_to_array$y(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$p(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$A(arr);
+function _array_without_holes$l(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$y(arr);
 }
-function _iterable_to_array$p(iter) {
+function _iterable_to_array$l(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$p() {
+function _non_iterable_spread$l() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$p(arr) {
-    return _array_without_holes$p(arr) || _iterable_to_array$p(arr) || _unsupported_iterable_to_array$A(arr) || _non_iterable_spread$p();
+function _to_consumable_array$l(arr) {
+    return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$y(arr) || _non_iterable_spread$l();
 }
-function _unsupported_iterable_to_array$A(o, minLen) {
+function _unsupported_iterable_to_array$y(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$A(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$y(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$A(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$y(o, minLen);
 }
 /**
  * Converts an {@link IterableOrValue} into a Set. Strings are treated as single values rather than character iterables.
@@ -940,7 +940,7 @@ function _unsupported_iterable_to_array$A(o, minLen) {
  * @param b - Second set.
  * @returns An array of values present in only one of the sets.
  */ function symmetricDifferenceArrayBetweenSets(a, b) {
-    return _to_consumable_array$p(extraSet.symmetricDifference(a, b));
+    return _to_consumable_array$l(extraSet.symmetricDifference(a, b));
 }
 /**
  * Flattens a two-dimensional array into a Set of unique values.
@@ -1311,30 +1311,30 @@ function _unsupported_iterable_to_array$A(o, minLen) {
     return a && b ? a.size === b.size && setContainsAllValues(a, b, true) : a == b;
 }
 
-function _array_like_to_array$z(arr, len) {
+function _array_like_to_array$x(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$o(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$z(arr);
+function _array_without_holes$k(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$x(arr);
 }
-function _iterable_to_array$o(iter) {
+function _iterable_to_array$k(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$o() {
+function _non_iterable_spread$k() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$o(arr) {
-    return _array_without_holes$o(arr) || _iterable_to_array$o(arr) || _unsupported_iterable_to_array$z(arr) || _non_iterable_spread$o();
+function _to_consumable_array$k(arr) {
+    return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$x(arr) || _non_iterable_spread$k();
 }
-function _unsupported_iterable_to_array$z(o, minLen) {
+function _unsupported_iterable_to_array$x(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$z(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$x(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$z(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$x(o, minLen);
 }
 /**
  * Inverts the output of an arbitrary boolean-returning function.
@@ -1352,7 +1352,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
             var _decisionFn;
             var result = (_decisionFn = decisionFn).call.apply(_decisionFn, [
                 undefined
-            ].concat(_to_consumable_array$o(args)));
+            ].concat(_to_consumable_array$k(args)));
             return !result;
         };
     } else {
@@ -1834,30 +1834,30 @@ function chainMapFunction(a, b) {
     }
 }
 
-function _array_like_to_array$y(arr, len) {
+function _array_like_to_array$w(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$n(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$y(arr);
+function _array_without_holes$j(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$w(arr);
 }
-function _iterable_to_array$n(iter) {
+function _iterable_to_array$j(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$n() {
+function _non_iterable_spread$j() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$n(arr) {
-    return _array_without_holes$n(arr) || _iterable_to_array$n(arr) || _unsupported_iterable_to_array$y(arr) || _non_iterable_spread$n();
+function _to_consumable_array$j(arr) {
+    return _array_without_holes$j(arr) || _iterable_to_array$j(arr) || _unsupported_iterable_to_array$w(arr) || _non_iterable_spread$j();
 }
-function _unsupported_iterable_to_array$y(o, minLen) {
+function _unsupported_iterable_to_array$w(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$y(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$w(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$y(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$w(o, minLen);
 }
 /**
  * Concatenates multiple arrays and returns only unique values.
@@ -1868,7 +1868,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
     for(var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++){
         arrays[_key] = arguments[_key];
     }
-    return unique(concatArrays.apply(void 0, _to_consumable_array$n(arrays)));
+    return unique(concatArrays.apply(void 0, _to_consumable_array$j(arrays)));
 }
 /**
  * Flattens a 2D array and returns only unique values.
@@ -1892,7 +1892,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
     if (exclude.length) {
         removeFromSet(unique, exclude);
     }
-    return _to_consumable_array$n(unique);
+    return Array.from(unique);
 }
 /**
  * Reads and resolves keys from a {@link FilterUniqueFunctionAdditionalKeysInput}, handling both raw key arrays and structured input objects.
@@ -1914,7 +1914,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
     if (input.values) {
         addToSet(keys, input.values.map(readKey));
     }
-    return _to_consumable_array$n(keys);
+    return Array.from(keys);
 }
 /**
  * Creates a {@link FilterUniqueFunction} that deduplicates items by their computed key.
@@ -1995,14 +1995,6 @@ function allowValueOnceFilter(inputReadKey) {
     return fn;
 }
 
-function _array_like_to_array$x(arr, len) {
-    if (len == null || len > arr.length) len = arr.length;
-    for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
-    return arr2;
-}
-function _array_without_holes$m(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$x(arr);
-}
 function _class_call_check$b(instance, Constructor) {
     if (!(instance instanceof Constructor)) {
         throw new TypeError("Cannot call a class as a function");
@@ -2021,27 +2013,10 @@ function _define_property$l(obj, key, value) {
     }
     return obj;
 }
-function _iterable_to_array$m(iter) {
-    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
-}
-function _non_iterable_spread$m() {
-    throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-}
-function _to_consumable_array$m(arr) {
-    return _array_without_holes$m(arr) || _iterable_to_array$m(arr) || _unsupported_iterable_to_array$x(arr) || _non_iterable_spread$m();
-}
 function _type_of$k(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$x(o, minLen) {
-    if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$x(o, minLen);
-    var n = Object.prototype.toString.call(o).slice(8, -1);
-    if (n === "Object" && o.constructor) n = o.constructor.name;
-    if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$x(o, minLen);
-}
 var DEFAULT_UNKNOWN_MODEL_TYPE_STRING = 'unknown';
 /**
  * Reads the `id` property from a {@link UniqueModel}.
@@ -2063,7 +2038,7 @@ var DEFAULT_UNKNOWN_MODEL_TYPE_STRING = 'unknown';
  * // result: ['a', 'b', 'c']
  * ```
  */ function uniqueKeys(keys) {
-    return _to_consumable_array$m(new Set(keys));
+    return Array.from(new Set(keys));
 }
 function uniqueModels(models) {
     var readKey = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : readUniqueModelKey;
@@ -2293,30 +2268,30 @@ function readModelKey(input) {
 } 
 ;
 
-function _array_like_to_array$w(arr, len) {
+function _array_like_to_array$v(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$l(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$w(arr);
+function _array_without_holes$i(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$v(arr);
 }
-function _iterable_to_array$l(iter) {
+function _iterable_to_array$i(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$l() {
+function _non_iterable_spread$i() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$l(arr) {
-    return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$w(arr) || _non_iterable_spread$l();
+function _to_consumable_array$i(arr) {
+    return _array_without_holes$i(arr) || _iterable_to_array$i(arr) || _unsupported_iterable_to_array$v(arr) || _non_iterable_spread$i();
 }
-function _unsupported_iterable_to_array$w(o, minLen) {
+function _unsupported_iterable_to_array$v(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$w(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$v(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$w(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$v(o, minLen);
 }
 /**
  * Wraps a key reading function to ensure that empty string keys are not used in boolean key arrays.
@@ -2357,7 +2332,7 @@ function _unsupported_iterable_to_array$w(o, minLen) {
  * @param readKey - Function to extract the key from a value
  * @returns A new boolean key array with the value inserted
  */ function insertIntoBooleanKeyArray(array, value, readKey) {
-    return array ? _to_consumable_array$l(removeModelsWithSameKey(array, value, readBooleanKeySafetyWrap(readKey))).concat([
+    return array ? _to_consumable_array$i(removeModelsWithSameKey(array, value, readBooleanKeySafetyWrap(readKey))).concat([
         value
     ]) : [
         value
@@ -2423,13 +2398,13 @@ function _unsupported_iterable_to_array$w(o, minLen) {
     return x ? x : undefined;
 });
 
-function _array_like_to_array$v(arr, len) {
+function _array_like_to_array$u(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$k(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$v(arr);
+function _array_without_holes$h(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$u(arr);
 }
 function _class_call_check$a(instance, Constructor) {
     if (!(instance instanceof Constructor)) {
@@ -2462,22 +2437,22 @@ function _define_property$k(obj, key, value) {
     }
     return obj;
 }
-function _iterable_to_array$k(iter) {
+function _iterable_to_array$h(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$k() {
+function _non_iterable_spread$h() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$k(arr) {
-    return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$v(arr) || _non_iterable_spread$k();
+function _to_consumable_array$h(arr) {
+    return _array_without_holes$h(arr) || _iterable_to_array$h(arr) || _unsupported_iterable_to_array$u(arr) || _non_iterable_spread$h();
 }
-function _unsupported_iterable_to_array$v(o, minLen) {
+function _unsupported_iterable_to_array$u(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$v(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$u(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$v(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$u(o, minLen);
 }
 /**
  * Set that is implemented internally using a Map, and input values have their keys read.
@@ -2659,7 +2634,7 @@ function _unsupported_iterable_to_array$v(o, minLen) {
      * @returns An array of all stored values.
      */ key: "valuesArray",
             value: function valuesArray() {
-                return _to_consumable_array$k(this._map.values());
+                return _to_consumable_array$h(this._map.values());
             }
         },
         {
@@ -2673,30 +2648,30 @@ function _unsupported_iterable_to_array$v(o, minLen) {
 } 
 ();
 
-function _array_like_to_array$u(arr, len) {
+function _array_like_to_array$t(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$j(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$u(arr);
+function _array_without_holes$g(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$t(arr);
 }
-function _iterable_to_array$j(iter) {
+function _iterable_to_array$g(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$j() {
+function _non_iterable_spread$g() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$j(arr) {
-    return _array_without_holes$j(arr) || _iterable_to_array$j(arr) || _unsupported_iterable_to_array$u(arr) || _non_iterable_spread$j();
+function _to_consumable_array$g(arr) {
+    return _array_without_holes$g(arr) || _iterable_to_array$g(arr) || _unsupported_iterable_to_array$t(arr) || _non_iterable_spread$g();
 }
-function _unsupported_iterable_to_array$u(o, minLen) {
+function _unsupported_iterable_to_array$t(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$u(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$t(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$u(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$t(o, minLen);
 }
 var SORT_VALUE_LESS_THAN = -1;
 var SORT_VALUE_GREATER_THAN = 1;
@@ -2752,7 +2727,7 @@ function reverseCompareFn(compareFn) {
     var doSort = sortWith != null;
     var result = values;
     if (alwaysReturnCopy || sortOnCopy && doSort) {
-        result = _to_consumable_array$j(values);
+        result = _to_consumable_array$g(values);
     }
     if (doSort) {
         result = result.sort(sortWith);
@@ -2832,7 +2807,7 @@ function reverseCompareFn(compareFn) {
     };
 }
 
-function _array_like_to_array$t(arr, len) {
+function _array_like_to_array$s(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
@@ -2840,10 +2815,10 @@ function _array_like_to_array$t(arr, len) {
 function _array_with_holes$k(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$i(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$t(arr);
+function _array_without_holes$f(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$s(arr);
 }
-function _iterable_to_array$i(iter) {
+function _iterable_to_array$f(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$k(arr, i) {
@@ -2873,22 +2848,22 @@ function _iterable_to_array_limit$k(arr, i) {
 function _non_iterable_rest$k() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$i() {
+function _non_iterable_spread$f() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _sliced_to_array$k(arr, i) {
-    return _array_with_holes$k(arr) || _iterable_to_array_limit$k(arr, i) || _unsupported_iterable_to_array$t(arr, i) || _non_iterable_rest$k();
+    return _array_with_holes$k(arr) || _iterable_to_array_limit$k(arr, i) || _unsupported_iterable_to_array$s(arr, i) || _non_iterable_rest$k();
 }
-function _to_consumable_array$i(arr) {
-    return _array_without_holes$i(arr) || _iterable_to_array$i(arr) || _unsupported_iterable_to_array$t(arr) || _non_iterable_spread$i();
+function _to_consumable_array$f(arr) {
+    return _array_without_holes$f(arr) || _iterable_to_array$f(arr) || _unsupported_iterable_to_array$s(arr) || _non_iterable_spread$f();
 }
-function _unsupported_iterable_to_array$t(o, minLen) {
+function _unsupported_iterable_to_array$s(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$t(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$s(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$t(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$s(o, minLen);
 }
 /**
  * Splits the input array into batches of a maximum size. Each batch carries its zero-based index as `.i`.
@@ -2904,7 +2879,7 @@ function _unsupported_iterable_to_array$t(o, minLen) {
  * // result[1] => ['c', 'd'], result[1].i => 1
  * ```
  */ function batch(input, batchSize) {
-    var array = _to_consumable_array$i(input); // Copy array before splicing it.
+    var array = _to_consumable_array$f(input); // Copy array before splicing it.
     var batches = [];
     var i = 0;
     while(array.length > 0){
@@ -3007,7 +2982,7 @@ function _unsupported_iterable_to_array$t(o, minLen) {
             newItems.push(getValue());
         }
     });
-    return _to_consumable_array$i(restoredOrder).concat(_to_consumable_array$i(newItems)).filter(function(x) {
+    return _to_consumable_array$f(restoredOrder).concat(_to_consumable_array$f(newItems)).filter(function(x) {
         return x !== undefined;
     }); // Allow null to be passed.
 }
@@ -3025,7 +3000,7 @@ function _unsupported_iterable_to_array$t(o, minLen) {
     var a = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : [], b = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : [], _ref = arguments.length > 2 ? arguments[2] : void 0, groupKeyFn = _ref.groupKeyFn, isEqual = _ref.isEqual;
     var areDifferent = false;
     if (a.length === b.length) {
-        var pairs = pairGroupValues(_to_consumable_array$i(a).concat(_to_consumable_array$i(b)), groupKeyFn);
+        var pairs = pairGroupValues(_to_consumable_array$f(a).concat(_to_consumable_array$f(b)), groupKeyFn);
         if (pairs.unpaired.length > 0) {
             // Any unpaired items means there is a difference.
             areDifferent = true;
@@ -3134,7 +3109,7 @@ function makeValuesGroupMap(values, groupKeyFn) {
     return map;
 }
 
-function _array_like_to_array$s(arr, len) {
+function _array_like_to_array$r(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
@@ -3142,12 +3117,6 @@ function _array_like_to_array$s(arr, len) {
 function _array_with_holes$j(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$h(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$s(arr);
-}
-function _iterable_to_array$h(iter) {
-    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
-}
 function _iterable_to_array_limit$j(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
@@ -3175,22 +3144,16 @@ function _iterable_to_array_limit$j(arr, i) {
 function _non_iterable_rest$j() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$h() {
-    throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-}
 function _sliced_to_array$j(arr, i) {
-    return _array_with_holes$j(arr) || _iterable_to_array_limit$j(arr, i) || _unsupported_iterable_to_array$s(arr, i) || _non_iterable_rest$j();
+    return _array_with_holes$j(arr) || _iterable_to_array_limit$j(arr, i) || _unsupported_iterable_to_array$r(arr, i) || _non_iterable_rest$j();
 }
-function _to_consumable_array$h(arr) {
-    return _array_without_holes$h(arr) || _iterable_to_array$h(arr) || _unsupported_iterable_to_array$s(arr) || _non_iterable_spread$h();
-}
-function _unsupported_iterable_to_array$s(o, minLen) {
+function _unsupported_iterable_to_array$r(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$s(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$r(o, minLen);
     var n = Object.prototype.toString.call(o).slice(8, -1);
     if (n === "Object" && o.constructor) n = o.constructor.name;
     if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$s(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$r(o, minLen);
 }
 /**
  * Combines multiple Maps into a single Map. Later maps override earlier values for the same key.
@@ -3228,7 +3191,7 @@ function _unsupported_iterable_to_array$s(o, minLen) {
  * @param map - The map to convert
  * @returns An array of [key, value] tuples
  */ function mapToTuples(map) {
-    return _to_consumable_array$h(map.entries());
+    return Array.from(map.entries());
 }
 /**
  * Expands a Map with array values into individual key/value tuples.
@@ -5939,31 +5902,6 @@ function caseInsensitiveString(input) {
     }
 }
 
-function _array_like_to_array$r(arr, len) {
-    if (len == null || len > arr.length) len = arr.length;
-    for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
-    return arr2;
-}
-function _array_without_holes$g(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$r(arr);
-}
-function _iterable_to_array$g(iter) {
-    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
-}
-function _non_iterable_spread$g() {
-    throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-}
-function _to_consumable_array$g(arr) {
-    return _array_without_holes$g(arr) || _iterable_to_array$g(arr) || _unsupported_iterable_to_array$r(arr) || _non_iterable_spread$g();
-}
-function _unsupported_iterable_to_array$r(o, minLen) {
-    if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$r(o, minLen);
-    var n = Object.prototype.toString.call(o).slice(8, -1);
-    if (n === "Object" && o.constructor) n = o.constructor.name;
-    if (n === "Map" || n === "Set") return Array.from(n);
-    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$r(o, minLen);
-}
 /**
  * Compares two string arrays and returns whether they contain different values, ignoring case.
  *
@@ -6019,7 +5957,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  * @param values - iterable of strings to deduplicate
  * @returns an array of unique lowercase strings
  */ function uniqueCaseInsensitiveStrings(values) {
-    return _to_consumable_array$g(uniqueCaseInsensitiveStringsSet(values));
+    return Array.from(uniqueCaseInsensitiveStringsSet(values));
 }
 /**
  * Returns a {@link Set} of unique lowercase strings from the input, compared case-insensitively.
@@ -7916,10 +7854,10 @@ function _array_like_to_array$n(arr, len) {
 function _array_with_holes$f(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$f(arr) {
+function _array_without_holes$e(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$n(arr);
 }
-function _iterable_to_array$f(iter) {
+function _iterable_to_array$e(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$f(arr, i) {
@@ -7949,14 +7887,14 @@ function _iterable_to_array_limit$f(arr, i) {
 function _non_iterable_rest$f() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$f() {
+function _non_iterable_spread$e() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _sliced_to_array$f(arr, i) {
     return _array_with_holes$f(arr) || _iterable_to_array_limit$f(arr, i) || _unsupported_iterable_to_array$n(arr, i) || _non_iterable_rest$f();
 }
-function _to_consumable_array$f(arr) {
-    return _array_without_holes$f(arr) || _iterable_to_array$f(arr) || _unsupported_iterable_to_array$n(arr) || _non_iterable_spread$f();
+function _to_consumable_array$e(arr) {
+    return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$n(arr) || _non_iterable_spread$e();
 }
 function _unsupported_iterable_to_array$n(o, minLen) {
     if (!o) return;
@@ -7982,7 +7920,7 @@ function _unsupported_iterable_to_array$n(o, minLen) {
     }
     var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
     try {
-        for(var _iterator = _to_consumable_array$f(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+        for(var _iterator = _to_consumable_array$e(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
             var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
             if (char === find) {
                 if (first === -1) {
@@ -8115,7 +8053,7 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
     var record = {};
     var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
     try {
-        for(var _iterator = _to_consumable_array$f(chars).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+        for(var _iterator = _to_consumable_array$e(chars).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
             var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
             record[char] = i;
         }
@@ -8144,7 +8082,7 @@ function _array_like_to_array$m(arr, len) {
 function _array_with_holes$e(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$e(arr) {
+function _array_without_holes$d(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$m(arr);
 }
 function _instanceof$3(left, right) {
@@ -8154,7 +8092,7 @@ function _instanceof$3(left, right) {
         return left instanceof right;
     }
 }
-function _iterable_to_array$e(iter) {
+function _iterable_to_array$d(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$e(arr, i) {
@@ -8184,14 +8122,14 @@ function _iterable_to_array_limit$e(arr, i) {
 function _non_iterable_rest$e() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$e() {
+function _non_iterable_spread$d() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _sliced_to_array$e(arr, i) {
     return _array_with_holes$e(arr) || _iterable_to_array_limit$e(arr, i) || _unsupported_iterable_to_array$m(arr, i) || _non_iterable_rest$e();
 }
-function _to_consumable_array$e(arr) {
-    return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$m(arr) || _non_iterable_spread$e();
+function _to_consumable_array$d(arr) {
+    return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$m(arr) || _non_iterable_spread$d();
 }
 function _unsupported_iterable_to_array$m(o, minLen) {
     if (!o) return;
@@ -8316,7 +8254,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
         var occurrences = [];
         var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
         try {
-            for(var _iterator = _to_consumable_array$e(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            for(var _iterator = _to_consumable_array$d(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
                 var _step_value = _sliced_to_array$e(_step.value, 2), i = _step_value[0], char = _step_value[1];
                 if (characterSet.has(char)) {
                     occurrences.push(i);
@@ -9329,10 +9267,10 @@ function _array_like_to_array$k(arr, len) {
 function _array_with_holes$c(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$d(arr) {
+function _array_without_holes$c(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$k(arr);
 }
-function _iterable_to_array$d(iter) {
+function _iterable_to_array$c(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$c(arr, i) {
@@ -9362,14 +9300,14 @@ function _iterable_to_array_limit$c(arr, i) {
 function _non_iterable_rest$c() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$d() {
+function _non_iterable_spread$c() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _sliced_to_array$c(arr, i) {
     return _array_with_holes$c(arr) || _iterable_to_array_limit$c(arr, i) || _unsupported_iterable_to_array$k(arr, i) || _non_iterable_rest$c();
 }
-function _to_consumable_array$d(arr) {
-    return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$k(arr) || _non_iterable_spread$d();
+function _to_consumable_array$c(arr) {
+    return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$k(arr) || _non_iterable_spread$c();
 }
 function _unsupported_iterable_to_array$k(o, minLen) {
     if (!o) return;
@@ -9541,7 +9479,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
     var baseWebUrl = removeWebProtocolPrefix(baseWebsiteUrl(basePath)); // remove prefix to prevent issues with slash paths
     var webUrl = mergeSlashPaths([
         baseWebUrl
-    ].concat(_to_consumable_array$d(asArray(paths))));
+    ].concat(_to_consumable_array$c(asArray(paths))));
     return setWebProtocolPrefix(webUrl, protocol);
 }
 /**
@@ -9819,17 +9757,17 @@ function _array_like_to_array$j(arr, len) {
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$c(arr) {
+function _array_without_holes$b(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$j(arr);
 }
-function _iterable_to_array$c(iter) {
+function _iterable_to_array$b(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$c() {
+function _non_iterable_spread$b() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$c(arr) {
-    return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$j(arr) || _non_iterable_spread$c();
+function _to_consumable_array$b(arr) {
+    return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$j(arr) || _non_iterable_spread$b();
 }
 function _unsupported_iterable_to_array$j(o, minLen) {
     if (!o) return;
@@ -9882,7 +9820,7 @@ function _unsupported_iterable_to_array$j(o, minLen) {
             return x.email;
         });
         var emailsWithoutParticipants = excludeValuesFromArray(emails, participantEmails);
-        return _to_consumable_array$c(participants).concat(_to_consumable_array$c(emailsWithoutParticipants.map(function(email) {
+        return _to_consumable_array$b(participants).concat(_to_consumable_array$b(emailsWithoutParticipants.map(function(email) {
             return {
                 email: email
             };
@@ -10265,17 +10203,17 @@ function _array_like_to_array$i(arr, len) {
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$b(arr) {
+function _array_without_holes$a(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$i(arr);
 }
-function _iterable_to_array$b(iter) {
+function _iterable_to_array$a(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$b() {
+function _non_iterable_spread$a() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$b(arr) {
-    return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$i(arr) || _non_iterable_spread$b();
+function _to_consumable_array$a(arr) {
+    return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$i(arr) || _non_iterable_spread$a();
 }
 function _unsupported_iterable_to_array$i(o, minLen) {
     if (!o) return;
@@ -10300,7 +10238,7 @@ function _unsupported_iterable_to_array$i(o, minLen) {
             args[_key] = arguments[_key];
         }
         var forwardFn = getter();
-        return forwardFn.apply(void 0, _to_consumable_array$b(args));
+        return forwardFn.apply(void 0, _to_consumable_array$a(args));
     };
 }
 /**
@@ -10328,17 +10266,17 @@ function _array_like_to_array$h(arr, len) {
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$a(arr) {
+function _array_without_holes$9(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$h(arr);
 }
-function _iterable_to_array$a(iter) {
+function _iterable_to_array$9(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$a() {
+function _non_iterable_spread$9() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$a(arr) {
-    return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$h(arr) || _non_iterable_spread$a();
+function _to_consumable_array$9(arr) {
+    return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$h(arr) || _non_iterable_spread$9();
 }
 function _unsupported_iterable_to_array$h(o, minLen) {
     if (!o) return;
@@ -10356,7 +10294,7 @@ function _unsupported_iterable_to_array$h(o, minLen) {
  * @param keys - The keys to intersect with the object
  * @returns An array of values from the matching keys
  */ function mapKeysIntersectionObjectToArray(object, keys) {
-    var keysToApply = _to_consumable_array$a(keys);
+    var keysToApply = _to_consumable_array$9(keys);
     var applyArray = [];
     keysToApply.forEach(function(key) {
         var values = object[key];
@@ -10690,7 +10628,7 @@ function _array_like_to_array$g(arr, len) {
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$9(arr) {
+function _array_without_holes$8(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$g(arr);
 }
 function asyncGeneratorStep$8(gen, resolve, reject, _next, _throw, key, arg) {
@@ -10722,14 +10660,14 @@ function _async_to_generator$8(fn) {
         });
     };
 }
-function _iterable_to_array$9(iter) {
+function _iterable_to_array$8(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$9() {
+function _non_iterable_spread$8() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$9(arr) {
-    return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$g(arr) || _non_iterable_spread$9();
+function _to_consumable_array$8(arr) {
+    return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$g(arr) || _non_iterable_spread$8();
 }
 function _unsupported_iterable_to_array$g(o, minLen) {
     if (!o) return;
@@ -10893,7 +10831,7 @@ function _ts_generator$8(thisArg, body) {
                             case 2:
                                 verifiedIds = _state.sent();
                                 // concat identifiers
-                                ids = _to_consumable_array$9(ids).concat(_to_consumable_array$9(verifiedIds));
+                                ids = _to_consumable_array$8(ids).concat(_to_consumable_array$8(verifiedIds));
                                 return [
                                     3,
                                     1
@@ -10958,10 +10896,10 @@ function _array_like_to_array$f(arr, len) {
 function _array_with_holes$b(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$8(arr) {
+function _array_without_holes$7(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$f(arr);
 }
-function _iterable_to_array$8(iter) {
+function _iterable_to_array$7(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$b(arr, i) {
@@ -10991,14 +10929,14 @@ function _iterable_to_array_limit$b(arr, i) {
 function _non_iterable_rest$b() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$8() {
+function _non_iterable_spread$7() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _sliced_to_array$b(arr, i) {
     return _array_with_holes$b(arr) || _iterable_to_array_limit$b(arr, i) || _unsupported_iterable_to_array$f(arr, i) || _non_iterable_rest$b();
 }
-function _to_consumable_array$8(arr) {
-    return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$f(arr) || _non_iterable_spread$8();
+function _to_consumable_array$7(arr) {
+    return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$f(arr) || _non_iterable_spread$7();
 }
 function _unsupported_iterable_to_array$f(o, minLen) {
     if (!o) return;
@@ -11110,7 +11048,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
     var splitEncodedValues = splitter ? function(encodedValues) {
         return encodedValues.split(splitter);
     } : function(encodedValues) {
-        return _to_consumable_array$8(encodedValues);
+        return _to_consumable_array$7(encodedValues);
     };
     return function(input) {
         if (typeof input === 'string') {
@@ -12024,10 +11962,10 @@ function _array_like_to_array$d(arr, len) {
 function _array_with_holes$9(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$7(arr) {
+function _array_without_holes$6(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$d(arr);
 }
-function _iterable_to_array$7(iter) {
+function _iterable_to_array$6(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$9(arr, i) {
@@ -12057,14 +11995,14 @@ function _iterable_to_array_limit$9(arr, i) {
 function _non_iterable_rest$9() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$7() {
+function _non_iterable_spread$6() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _sliced_to_array$9(arr, i) {
     return _array_with_holes$9(arr) || _iterable_to_array_limit$9(arr, i) || _unsupported_iterable_to_array$d(arr, i) || _non_iterable_rest$9();
 }
-function _to_consumable_array$7(arr) {
-    return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$d(arr) || _non_iterable_spread$7();
+function _to_consumable_array$6(arr) {
+    return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$d(arr) || _non_iterable_spread$6();
 }
 function _type_of$8(obj) {
     "@swc/helpers - typeof";
@@ -12317,10 +12255,10 @@ function _unsupported_iterable_to_array$d(o, minLen) {
                 var lngs = points.map(function(x) {
                     return x.lng;
                 });
-                var minLat = (_Math = Math).min.apply(_Math, _to_consumable_array$7(lats));
-                var maxLat = (_Math1 = Math).max.apply(_Math1, _to_consumable_array$7(lats));
-                var minLng = (_Math2 = Math).min.apply(_Math2, _to_consumable_array$7(lngs));
-                var maxLng = (_Math3 = Math).max.apply(_Math3, _to_consumable_array$7(lngs));
+                var minLat = (_Math = Math).min.apply(_Math, _to_consumable_array$6(lats));
+                var maxLat = (_Math1 = Math).max.apply(_Math1, _to_consumable_array$6(lats));
+                var minLng = (_Math2 = Math).min.apply(_Math2, _to_consumable_array$6(lngs));
+                var maxLng = (_Math3 = Math).max.apply(_Math3, _to_consumable_array$6(lngs));
                 bound = {
                     sw: latLngPoint([
                         minLat,
@@ -13762,17 +13700,17 @@ function _array_like_to_array$b(arr, len) {
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$6(arr) {
+function _array_without_holes$5(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$b(arr);
 }
-function _iterable_to_array$6(iter) {
+function _iterable_to_array$5(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$6() {
+function _non_iterable_spread$5() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$6(arr) {
-    return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$b(arr) || _non_iterable_spread$6();
+function _to_consumable_array$5(arr) {
+    return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$b(arr) || _non_iterable_spread$5();
 }
 function _unsupported_iterable_to_array$b(o, minLen) {
     if (!o) return;
@@ -13793,7 +13731,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
  */ function objectDeltaArrayCompressor(config) {
     var _equalityChecker = config.equalityChecker;
     var assignKnownValuesToCopy = assignValuesToPOJOFunction({
-        keysFilter: _to_consumable_array$6(_equalityChecker._fields.keys()),
+        keysFilter: _to_consumable_array$5(_equalityChecker._fields.keys()),
         valueFilter: exports.KeyValueTypleValueFilter.NULL
     });
     function compress(uncompressed) {
@@ -13830,7 +13768,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
         });
         return result;
     }
-    var allKeys = _to_consumable_array$6(_equalityChecker._fields.keys());
+    var allKeys = _to_consumable_array$5(_equalityChecker._fields.keys());
     function expand(compressed) {
         if (compressed.length === 0) {
             return [];
@@ -14159,17 +14097,17 @@ function _array_like_to_array$a(arr, len) {
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
-function _array_without_holes$5(arr) {
+function _array_without_holes$4(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$a(arr);
 }
-function _iterable_to_array$5(iter) {
+function _iterable_to_array$4(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$5() {
+function _non_iterable_spread$4() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _to_consumable_array$5(arr) {
-    return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$a(arr) || _non_iterable_spread$5();
+function _to_consumable_array$4(arr) {
+    return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$a(arr) || _non_iterable_spread$4();
 }
 function _unsupported_iterable_to_array$a(o, minLen) {
     if (!o) return;
@@ -14303,9 +14241,9 @@ function _unsupported_iterable_to_array$a(o, minLen) {
     if (sundayFirst) {
         dayOfWeekNames = [
             sunday
-        ].concat(_to_consumable_array$5(days));
+        ].concat(_to_consumable_array$4(days));
     } else {
-        dayOfWeekNames = _to_consumable_array$5(days).concat([
+        dayOfWeekNames = _to_consumable_array$4(days).concat([
             sunday
         ]);
     }
@@ -14924,7 +14862,7 @@ function _array_like_to_array$9(arr, len) {
 function _array_with_holes$7(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$4(arr) {
+function _array_without_holes$3(arr) {
     if (Array.isArray(arr)) return _array_like_to_array$9(arr);
 }
 function asyncGeneratorStep$4(gen, resolve, reject, _next, _throw, key, arg) {
@@ -14969,7 +14907,7 @@ function _define_property$9(obj, key, value) {
     }
     return obj;
 }
-function _iterable_to_array$4(iter) {
+function _iterable_to_array$3(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$7(arr, i) {
@@ -14999,7 +14937,7 @@ function _iterable_to_array_limit$7(arr, i) {
 function _non_iterable_rest$7() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$4() {
+function _non_iterable_spread$3() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
 function _object_spread$5(target) {
@@ -15039,8 +14977,8 @@ function _object_spread_props$2(target, source) {
 function _sliced_to_array$7(arr, i) {
     return _array_with_holes$7(arr) || _iterable_to_array_limit$7(arr, i) || _unsupported_iterable_to_array$9(arr, i) || _non_iterable_rest$7();
 }
-function _to_consumable_array$4(arr) {
-    return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$9(arr) || _non_iterable_spread$4();
+function _to_consumable_array$3(arr) {
+    return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$9(arr) || _non_iterable_spread$3();
 }
 function _unsupported_iterable_to_array$9(o, minLen) {
     if (!o) return;
@@ -15407,7 +15345,7 @@ function _performAsyncTask(_0, _1) {
                                     2,
                                     [
                                         value
-                                    ].concat(_to_consumable_array$4(result))
+                                    ].concat(_to_consumable_array$3(result))
                                 ];
                             }
                             retriesRemaining = retriesAllowed - tryNumber;
@@ -15686,7 +15624,7 @@ function _performAsyncTask(_0, _1) {
                                         ];
                                     }).reverse(); // reverse to use push/pop
                                     baseI += newTaskEntries.length;
-                                    incompleteTasks = _to_consumable_array$4(newTaskEntries).concat(_to_consumable_array$4(incompleteTasks)); // new tasks go to the front of the stack
+                                    incompleteTasks = _to_consumable_array$3(newTaskEntries).concat(_to_consumable_array$3(incompleteTasks)); // new tasks go to the front of the stack
                                 }
                                 _state.label = 2;
                             case 2:
@@ -16894,9 +16832,6 @@ function _array_like_to_array$7(arr, len) {
 function _array_with_holes$5(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$3(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$7(arr);
-}
 function _instanceof(left, right) {
     if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
         return !!right[Symbol.hasInstance](left);
@@ -16904,9 +16839,6 @@ function _instanceof(left, right) {
         return left instanceof right;
     }
 }
-function _iterable_to_array$3(iter) {
-    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
-}
 function _iterable_to_array_limit$5(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
@@ -16934,15 +16866,9 @@ function _iterable_to_array_limit$5(arr, i) {
 function _non_iterable_rest$5() {
     throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
-function _non_iterable_spread$3() {
-    throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-}
 function _sliced_to_array$5(arr, i) {
     return _array_with_holes$5(arr) || _iterable_to_array_limit$5(arr, i) || _unsupported_iterable_to_array$7(arr, i) || _non_iterable_rest$5();
 }
-function _to_consumable_array$3(arr) {
-    return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$7(arr) || _non_iterable_spread$3();
-}
 function _type_of$3(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
@@ -17027,7 +16953,7 @@ function _compareMaps(a, b, pojoFilter) {
     if (a.size !== b.size) {
         return false;
     }
-    var firstInequalityIndex = _to_consumable_array$3(a.entries()).findIndex(function(param) {
+    var firstInequalityIndex = Array.from(a.entries()).findIndex(function(param) {
         var _param = _sliced_to_array$5(param, 2), key = _param[0], aValue = _param[1];
         var bValue = b.get(key);
         return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);