@dereekb/util 13.4.0 → 13.4.2

package/index.cjs.js

@@ -3,6 +3,35 @@
 var extraSet = require('extra-set');
 var makeError = require('make-error');
 
+function _array_like_to_array$C(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 _iterable_to_array$r(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+function _non_iterable_spread$r() {
+    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 _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) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$C(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);
+}
 // MARK: Functions
 /**
  * Converts an IterableOrValue to an Iterable. Non-iterable values are wrapped in an array.
@@ -36,7 +65,7 @@ var makeError = require('make-error');
             values
         ];
     } else if (isIterable(values)) {
-        iterable = Array.from(values); // copy the array
+        iterable = _to_consumable_array$r(values); // copy the array
     } else {
         iterable = [
             values
@@ -63,13 +92,12 @@ var makeError = require('make-error');
  * @param readKey - Function to extract the key from each value
  * @returns A Map with the extracted keys and their corresponding values
  */ function iterableToMap(values, readKey) {
-    var map = new Map(iterableToArray(values).map(function(value) {
+    return new Map(iterableToArray(values).map(function(value) {
         return [
             readKey(value),
             value
         ];
     }));
-    return map;
 }
 /**
  * Type guard that returns true if the input is an Iterable.
@@ -80,11 +108,13 @@ var makeError = require('make-error');
  * @returns True if the value is iterable
  */ function isIterable(values) {
     var treatStringAsIterable = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false;
-    if (values && values[Symbol.iterator] && (treatStringAsIterable || typeof values !== 'string')) {
+    if (typeof values === 'string') {
+        return treatStringAsIterable;
+    }
+    if (values != null && (typeof values === "undefined" ? "undefined" : _type_of$m(values)) === 'object' && Symbol.iterator in values) {
         return true;
-    } else {
-        return false;
     }
+    return false;
 }
 /**
  * Returns true if the iterable has no values.
@@ -363,30 +393,30 @@ var makeError = require('make-error');
     }
 }
 
-function _array_like_to_array$r(arr, len) {
+function _array_like_to_array$B(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$c(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$r(arr);
+function _array_without_holes$q(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$B(arr);
 }
-function _iterable_to_array$c(iter) {
+function _iterable_to_array$q(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$q() {
     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$r(arr) || _non_iterable_spread$c();
+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 _unsupported_iterable_to_array$r(o, minLen) {
+function _unsupported_iterable_to_array$B(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$r(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$B(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);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$B(o, minLen);
 }
 // MARK: Functions
 /**
@@ -499,12 +529,10 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  * @param array - two-dimensional array to flatten, may contain nullish entries
  * @returns a single-dimensional array with all elements from the non-nullish inner arrays
  */ function flattenArray(array) {
-    var _instance;
     var filteredValues = array.filter(function(x) {
         return Boolean(x);
     });
-    // concat with spread is faster than a depth-one flat
-    return (_instance = []).concat.apply(_instance, _to_consumable_array$c(filteredValues));
+    return filteredValues.flat();
 }
 /**
  * Flattens an array of {@link ArrayOrValue} entries into a single array. Nullish entries are filtered out.
@@ -522,7 +550,7 @@ function _unsupported_iterable_to_array$r(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 ? Array.from(input) : [];
+    return input != null ? _to_consumable_array$q(input) : [];
 }
 /**
  * Pushes the same element onto the target array a specified number of times.
@@ -545,7 +573,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  */ function mergeArrays(arrays) {
     return mergeArraysIntoArray.apply(void 0, [
         []
-    ].concat(_to_consumable_array$c(arrays)));
+    ].concat(_to_consumable_array$q(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.
@@ -557,9 +585,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
     for(var _len = arguments.length, arrays = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++){
         arrays[_key - 1] = arguments[_key];
     }
-    if (target == null) {
-        target = [];
-    }
+    target !== null && target !== void 0 ? target : target = [];
     arrays.forEach(function(array) {
         if (array != null) {
             pushArrayItemsIntoArray(target, array);
@@ -633,7 +659,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
         var length = values.length;
         var secondHalfStartIndex = Math.max(keepFromFront, length - (maxToTake - keepFromFront));
         var secondHalfEndIndex = length;
-        results = _to_consumable_array$c(values.slice(0, keepFromFront)).concat(_to_consumable_array$c(values.slice(secondHalfStartIndex, secondHalfEndIndex)));
+        results = _to_consumable_array$q(values.slice(0, keepFromFront)).concat(_to_consumable_array$q(values.slice(secondHalfStartIndex, secondHalfEndIndex)));
     }
     return results;
 }
@@ -759,6 +785,31 @@ function _unsupported_iterable_to_array$r(o, minLen) {
     return readKeysSetFunction(readKey)(values);
 }
 
+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$p(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$A(arr);
+}
+function _iterable_to_array$p(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+function _non_iterable_spread$p() {
+    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 _unsupported_iterable_to_array$A(o, minLen) {
+    if (!o) return;
+    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$A(o, minLen);
+}
 /**
  * Converts an {@link IterableOrValue} into a Set. Strings are treated as single values rather than character iterables.
  *
@@ -889,7 +940,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  * @param b - Second set.
  * @returns An array of values present in only one of the sets.
  */ function symmetricDifferenceArrayBetweenSets(a, b) {
-    return Array.from(extraSet.symmetricDifference(a, b));
+    return _to_consumable_array$p(extraSet.symmetricDifference(a, b));
 }
 /**
  * Flattens a two-dimensional array into a Set of unique values.
@@ -1133,6 +1184,11 @@ function _unsupported_iterable_to_array$r(o, minLen) {
 }
 /**
  * Returns false if the input array contains any value from the second array.
+ *
+ * @param values - the values to check against
+ * @param valuesToFind - the values to look for
+ * @param emptyValuesToFindArrayResult - result when valuesToFind is empty
+ * @returns `true` if none of the valuesToFind are present in values
  */ function containsNoneOfValue(values, valuesToFind, emptyValuesToFindArrayResult) {
     var set = new Set(asIterable(valuesToFind, false));
     return containsNoValueFromSet(values, set, emptyValuesToFindArrayResult);
@@ -1162,6 +1218,11 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  * Returns true if the input array contains any value from the second array.
  *
  * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to false.
+ *
+ * @param values - the values to build a set from and check against
+ * @param valuesToFind - the values to search for within the set
+ * @param emptyValuesToFindArrayResult - result when valuesToFind is empty; defaults to false
+ * @returns `true` if any of the valuesToFind exist in values
  */ function containsAnyValue(values, valuesToFind, emptyValuesToFindArrayResult) {
     var set = new Set(asIterable(values, false));
     return setContainsAnyValue(set, valuesToFind, emptyValuesToFindArrayResult);
@@ -1171,9 +1232,10 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  *
  * If values is empty, returns the emptyValuesToFindArrayResult value. Defaults to false.
  *
- * @param values
- * @param valuesToFind
- * @returns
+ * @param values - the values to check for membership in the set
+ * @param valuesToFind - the set to check against
+ * @param emptyValuesArrayResult - result when values is empty; defaults to false
+ * @returns `true` if any of the values are present in the set
  */ function containsAnyValueFromSet(values, valuesToFind, emptyValuesArrayResult) {
     return setContainsAnyValue(valuesToFind, values, emptyValuesArrayResult);
 }
@@ -1182,35 +1244,30 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  *
  * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to false.
  *
- * @param valuesSet
- * @param valuesToFind
- * @param emptyValuesToFindArrayResult
- * @returns
+ * @param valuesSet - the set to check for membership
+ * @param valuesToFind - the values to search for in the set
+ * @param emptyValuesToFindArrayResult - result when valuesToFind is empty; defaults to false
+ * @returns `true` if any of the valuesToFind are present in the set
  */ function setContainsAnyValue(valuesSet, valuesToFind) {
     var emptyValuesToFindArrayResult = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : false;
-    var result;
-    if (valuesSet) {
-        var valuesToFindArray = iterableToArray(valuesToFind);
-        if (valuesToFindArray.length > 0) {
-            result = valuesToFindArray.findIndex(function(x) {
-                return valuesSet.has(x);
-            }) !== -1;
-        } else {
-            result = emptyValuesToFindArrayResult;
-        }
+    var valuesToFindArray = iterableToArray(valuesToFind);
+    if (valuesToFindArray.length > 0) {
+        return valuesToFindArray.some(function(x) {
+            return valuesSet.has(x);
+        });
     } else {
-        result = false;
+        return emptyValuesToFindArrayResult;
     }
-    return result;
 }
 /**
  * Returns true if values contains all values in valuesToFind.
  *
  * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to true.
  *
- * @param values
- * @param valuesToFind
- * @returns
+ * @param values - the iterable of values to build a set from
+ * @param valuesToFind - the values that must all be present
+ * @param emptyValuesArrayResult - result when valuesToFind is empty; defaults to true
+ * @returns `true` if all valuesToFind are present in the values set
  */ function containsAllValues(values, valuesToFind, emptyValuesArrayResult) {
     var set = new Set(values);
     return setContainsAllValues(set, valuesToFind, emptyValuesArrayResult);
@@ -1220,69 +1277,64 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  *
  * If valuesToFind is empty, returns the emptyValuesToFindArrayResult value. Defaults to true.
  *
- * @param valuesSet
- * @param valuesToFind
- * @param emptyValuesToFindArrayResult
- * @returns
+ * @param valuesSet - the set to check for full containment
+ * @param valuesToFind - the values that must all be present in the set
+ * @param emptyValuesToFindArrayResult - result when valuesToFind is empty; defaults to true
+ * @returns `true` if every value in valuesToFind is present in the set
  */ function setContainsAllValues(valuesSet, valuesToFind) {
     var emptyValuesToFindArrayResult = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : true;
-    var result;
-    if (valuesSet) {
-        var valuesToFindArray = iterableToArray(valuesToFind);
-        if (valuesToFindArray.length > 0) {
-            result = valuesToFindArray.findIndex(function(x) {
-                return !valuesSet.has(x);
-            }) == -1;
-        } else {
-            result = emptyValuesToFindArrayResult;
-        }
+    var valuesToFindArray = iterableToArray(valuesToFind);
+    if (valuesToFindArray.length > 0) {
+        return !valuesToFindArray.some(function(x) {
+            return !valuesSet.has(x);
+        });
     } else {
-        result = false;
+        return emptyValuesToFindArrayResult;
     }
-    return result;
 }
 /**
  * Returns true if both iterables are defined (or are both null/undefined) and have the same values exactly.
  *
- * @param a
- * @param b
- * @returns
+ * @param a - first iterable to compare
+ * @param b - second iterable to compare
+ * @returns `true` if both iterables contain the same unique values, or both are nullish
  */ function iterablesAreSetEquivalent(a, b) {
     return a && b ? setsAreEquivalent(new Set(a), new Set(b)) : a == b;
 }
 /**
  * Returns true if both sets are defined (or are both null/undefined) and have the same values exactly.
  *
- * @param a
- * @param b
+ * @param a - first set to compare
+ * @param b - second set to compare
+ * @returns `true` if both sets contain the same values, or both are nullish
  */ function setsAreEquivalent(a, b) {
     return a && b ? a.size === b.size && setContainsAllValues(a, b, true) : a == b;
 }
 
-function _array_like_to_array$q(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$b(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$q(arr);
+function _array_without_holes$o(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$z(arr);
 }
-function _iterable_to_array$b(iter) {
+function _iterable_to_array$o(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$o() {
     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$q(arr) || _non_iterable_spread$b();
+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 _unsupported_iterable_to_array$q(o, minLen) {
+function _unsupported_iterable_to_array$z(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$q(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$q(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$z(o, minLen);
 }
 /**
  * Inverts the output of an arbitrary boolean-returning function.
@@ -1300,7 +1352,7 @@ function _unsupported_iterable_to_array$q(o, minLen) {
             var _decisionFn;
             var result = (_decisionFn = decisionFn).call.apply(_decisionFn, [
                 undefined
-            ].concat(_to_consumable_array$b(args)));
+            ].concat(_to_consumable_array$o(args)));
             return !result;
         };
     } else {
@@ -1320,7 +1372,7 @@ function _unsupported_iterable_to_array$q(o, minLen) {
  */ function arrayDecisionFunction(decision, mode) {
     var findFn = mode === 'all' ? invertBooleanReturnFunction(decision) : decision;
     return invertBooleanReturnFunction(function(values) {
-        return values.findIndex(findFn) !== -1;
+        return values.some(findFn);
     }, mode === 'all');
 }
 /**
@@ -1420,6 +1472,7 @@ function _type_of$l(obj) {
  * Type guard that returns `true` if the value is not `null` or `undefined`.
  *
  * @param value - the value to check
+ * @returns `true` if the value is not `null` or `undefined`
  */ function hasNonNullValue(value) {
     return value != null;
 }
@@ -1433,6 +1486,7 @@ function _type_of$l(obj) {
  * NaN has undefined behavior.
  *
  * @param value - the value to check
+ * @returns `true` if the value is non-nullish and not empty
  */ function hasValueOrNotEmpty(value) {
     if (isIterable(value, false)) {
         return !isEmptyIterable(value);
@@ -1449,6 +1503,7 @@ function _type_of$l(obj) {
  * NaN has undefined behavior.
  *
  * @param value - the value to check
+ * @returns `true` if the value is non-nullish, non-empty, and not an empty object
  */ function hasValueOrNotEmptyObject(value) {
     if (isIterable(value, true)) {
         return !isEmptyIterable(value);
@@ -1462,6 +1517,7 @@ function _type_of$l(obj) {
  * Returns `true` if the input value is a non-empty string or is `true`.
  *
  * @param value - the value to check
+ * @returns `true` if the value is a non-empty string or is `true`
  */ function isStringOrTrue(value) {
     return Boolean(value || value !== '');
 }
@@ -1471,6 +1527,7 @@ function _type_of$l(obj) {
  * Useful for filtering out both nullish values and empty strings in a single check.
  *
  * @param value - the value to check
+ * @returns `true` if the value is not nullish and not an empty string
  */ function isNotNullOrEmptyString(value) {
     return value != null && value !== '';
 }
@@ -1478,6 +1535,7 @@ function _type_of$l(obj) {
  * Type guard that returns `true` if the input is `null` or `undefined`.
  *
  * @param value - the value to check
+ * @returns `true` if the value is `null` or `undefined`
  */ function isMaybeNot(value) {
     return value == null;
 }
@@ -1487,6 +1545,7 @@ function _type_of$l(obj) {
  * Equivalent to {@link hasNonNullValue} but with the `MaybeSo` narrowing type.
  *
  * @param value - the value to check
+ * @returns `true` if the value is neither `null` nor `undefined`
  */ function isMaybeSo(value) {
     return value != null;
 }
@@ -1496,6 +1555,7 @@ function _type_of$l(obj) {
  * Useful for optional boolean flags where both absence and `true` indicate the same behavior.
  *
  * @param value - the value to check
+ * @returns `true` if the value is nullish or strictly `true`
  */ function isMaybeNotOrTrue(value) {
     return value == null || value === true;
 }
@@ -1503,6 +1563,7 @@ function _type_of$l(obj) {
  * Returns `true` if the input is not `null`, `undefined`, or `false`.
  *
  * @param value - the value to check
+ * @returns `true` if the value is not `null`, `undefined`, or `false`
  */ function isDefinedAndNotFalse(value) {
     return value != null && value !== false;
 }
@@ -1510,6 +1571,7 @@ function _type_of$l(obj) {
  * Returns `true` if the input is not strictly `false`. Nullish values return `true`.
  *
  * @param value - the value to check
+ * @returns `true` if the value is not strictly `false`
  */ function isNotFalse(value) {
     return value !== false;
 }
@@ -1518,6 +1580,7 @@ function _type_of$l(obj) {
  *
  * @param a - first value
  * @param b - second value
+ * @returns `true` if both values are non-nullish and strictly equal
  */ function isSameNonNullValue(a, b) {
     return a === b && a != null;
 }
@@ -1528,6 +1591,7 @@ function _type_of$l(obj) {
  *
  * @param a - first value
  * @param b - second value
+ * @returns `true` if both are nullish or both are the same value
  */ function valuesAreBothNullishOrEquivalent(a, b) {
     return a != null && b != null ? a === b : a == b;
 }
@@ -1540,6 +1604,7 @@ function _type_of$l(obj) {
  *
  * @param a - the current value
  * @param b - the update value
+ * @returns `a` if `b` is undefined, otherwise `b`
  */ function updateMaybeValue(a, b) {
     return b === undefined ? a : b;
 }
@@ -1551,11 +1616,13 @@ function _type_of$l(obj) {
  * @returns A function that filters maybe values from an optional input array.
  */ function filterMaybeArrayFunction(filterFn) {
     return function(values) {
+        var result;
         if (values != null) {
-            return values.filter(filterFn);
+            result = values.filter(filterFn);
         } else {
-            return [];
+            result = [];
         }
+        return result;
     };
 }
 /**
@@ -1576,9 +1643,9 @@ function _type_of$l(obj) {
  * @param values - Array of optional values to check.
  * @returns `true` if every value in the array is null or undefined.
  */ function allValuesAreMaybeNot(values) {
-    return values.findIndex(function(x) {
+    return !values.some(function(x) {
         return x != null;
-    }) === -1;
+    });
 }
 /**
  * Checks whether or not all values in the array are defined (non-null and non-undefined).
@@ -1586,9 +1653,9 @@ function _type_of$l(obj) {
  * @param values - Array of optional values to check.
  * @returns `true` if every value in the array is non-null and non-undefined.
  */ function allValuesAreNotMaybe(values) {
-    return values.findIndex(function(x) {
+    return !values.some(function(x) {
         return x == null;
-    }) === -1;
+    });
 }
 
 /**
@@ -1597,6 +1664,9 @@ function _type_of$l(obj) {
  * This is useful when building objects whose type is normally read-only, allowing incremental property assignment during construction.
  *
  * @param config - the build configuration containing the base object and build function
+ * @param config.base - optional pre-existing partial object to build upon; defaults to an empty object
+ * @param config.build - function that mutates the base object to populate it with desired values
+ * @returns the fully constructed object of type T
  *
  * @example
  * ```ts
@@ -1652,16 +1722,24 @@ function _type_of$l(obj) {
  *
  * Used as a sentinel value so that {@link chainMapSameFunctions} and other combinators can detect
  * and skip no-op mappings for efficiency.
+ *
+ * @param input - the value to pass through unchanged
+ * @returns the same input value, unmodified
  */ var MAP_IDENTITY = function MAP_IDENTITY(input) {
     return input;
 };
 /**
  * Returns the shared {@link MAP_IDENTITY} function cast to the requested type, useful for providing a typed no-op transformation.
+ *
+ * @returns the singleton identity function typed as `MapFunction<T, T>`
  */ function mapIdentityFunction() {
     return MAP_IDENTITY;
 }
 /**
  * Checks whether the given function is the singleton {@link MAP_IDENTITY} reference.
+ *
+ * @param fn - the function to check
+ * @returns `true` if the function is the identity singleton
  */ function isMapIdentityFunction(fn) {
     return fn === MAP_IDENTITY;
 }
@@ -1756,30 +1834,30 @@ function chainMapFunction(a, b) {
     }
 }
 
-function _array_like_to_array$p(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$a(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$p(arr);
+function _array_without_holes$n(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$y(arr);
 }
-function _iterable_to_array$a(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$a() {
+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$a(arr) {
-    return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$p(arr) || _non_iterable_spread$a();
+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 _unsupported_iterable_to_array$p(o, minLen) {
+function _unsupported_iterable_to_array$y(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$p(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$p(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$y(o, minLen);
 }
 /**
  * Concatenates multiple arrays and returns only unique values.
@@ -1790,7 +1868,7 @@ function _unsupported_iterable_to_array$p(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$a(arrays)));
+    return unique(concatArrays.apply(void 0, _to_consumable_array$n(arrays)));
 }
 /**
  * Flattens a 2D array and returns only unique values.
@@ -1811,10 +1889,10 @@ function _unsupported_iterable_to_array$p(o, minLen) {
     var exclude = readKeysFromFilterUniqueFunctionAdditionalKeysInput(excludeInput, function(x) {
         return x;
     });
-    if (exclude != null && exclude.length) {
+    if (exclude.length) {
         removeFromSet(unique, exclude);
     }
-    return Array.from(unique);
+    return _to_consumable_array$n(unique);
 }
 /**
  * Reads and resolves keys from a {@link FilterUniqueFunctionAdditionalKeysInput}, handling both raw key arrays and structured input objects.
@@ -1836,7 +1914,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
     if (input.values) {
         addToSet(keys, input.values.map(readKey));
     }
-    return Array.from(keys);
+    return _to_consumable_array$n(keys);
 }
 /**
  * Creates a {@link FilterUniqueFunction} that deduplicates items by their computed key.
@@ -1848,7 +1926,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
     var baseKeys = readKeysFromFilterUniqueFunctionAdditionalKeysInput(additionalKeysInput, readKey);
     function calculateExclude(excludeInput) {
         var newExcludeKeys = excludeInput ? Array.isArray(excludeInput) ? excludeInput.map(readKey) : readKeysFromFilterUniqueFunctionAdditionalKeys(excludeInput, readKey) : [];
-        return (newExcludeKeys === null || newExcludeKeys === void 0 ? void 0 : newExcludeKeys.length) ? mergeArrays([
+        return newExcludeKeys.length ? mergeArrays([
             filterMaybeArrayValues(newExcludeKeys),
             baseKeys
         ]) : baseKeys;
@@ -1903,7 +1981,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
 }
 function allowValueOnceFilter(inputReadKey) {
     var visitedKeys = new Set();
-    var readKey = inputReadKey || MAP_IDENTITY;
+    var readKey = inputReadKey !== null && inputReadKey !== void 0 ? inputReadKey : MAP_IDENTITY;
     var fn = function fn(x) {
         var key = readKey(x);
         if (!visitedKeys.has(key)) {
@@ -1917,6 +1995,14 @@ 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");
@@ -1935,10 +2021,27 @@ 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}.
@@ -1948,17 +2051,6 @@ var DEFAULT_UNKNOWN_MODEL_TYPE_STRING = 'unknown';
  */ var readUniqueModelKey = function readUniqueModelKey(model) {
     return model.id;
 };
-/**
- * Abstract base class for models identified by a unique {@link ModelKey}.
- *
- * Copies the `id` from the provided template during construction.
- */ var AbstractUniqueModel = function AbstractUniqueModel(template) {
-    _class_call_check$b(this, AbstractUniqueModel);
-    _define_property$l(this, "id", void 0);
-    if (template) {
-        this.id = template.id;
-    }
-};
 /**
  * Deduplicates an array of model keys using a Set.
  *
@@ -1971,7 +2063,7 @@ var DEFAULT_UNKNOWN_MODEL_TYPE_STRING = 'unknown';
  * // result: ['a', 'b', 'c']
  * ```
  */ function uniqueKeys(keys) {
-    return Array.from(new Set(keys));
+    return _to_consumable_array$m(new Set(keys));
 }
 function uniqueModels(models) {
     var readKey = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : readUniqueModelKey;
@@ -1990,7 +2082,8 @@ function readModelKeysFromObjects(input, required, read) {
  * @param required - Whether keys are required
  * @param read - Function to extract keys from models
  * @returns Keys that appear in one array but not the other
- */ function symmetricDifferenceWithModels(a, b, required, read) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function symmetricDifferenceWithModels(a, b, required, read) {
     return symmetricDifferenceArray(readModelKeys(a, required, read), readModelKeys(b, required, read));
 }
 function removeModelsWithSameKey(input, model, read) {
@@ -2005,14 +2098,12 @@ function removeModelsWithKey(input, key) {
 }
 function makeModelMap(input, read) {
     var map = new Map();
-    if (input) {
-        input.forEach(function(x) {
-            return map.set(readModelKey(x, {
-                required: false,
-                read: read
-            }), x);
-        });
-    }
+    input.forEach(function(x) {
+        return map.set(readModelKey(x, {
+            required: false,
+            read: read
+        }), x);
+    });
     return map;
 }
 /**
@@ -2041,6 +2132,9 @@ function makeModelMap(input, read) {
  *
  * @param input - A model object or a model key string
  * @param config - Handlers for model and key cases, plus whether input is required
+ * @param config.useModel - handler invoked when the input is a model object; if omitted, the model's key is passed to `useKey` instead
+ * @param config.useKey - handler invoked when the input is a model key string
+ * @param config.required - when true, throws an error if the input is nullish; defaults to false
  * @returns The result of the matched handler, or undefined if input is nullish and not required
  * @throws Error if `required` is true and input is nullish
  */ function useModelOrKey(input, param) {
@@ -2053,7 +2147,7 @@ function makeModelMap(input, read) {
             result = useModel ? useModel(input) : useKey(readModelKey(input));
         }
     } else if (required) {
-        throwKeyIsRequired();
+        throw new Error('input is required');
     }
     return result;
 }
@@ -2185,34 +2279,48 @@ function readModelKey(input) {
         };
     };
 }
+// MARK: COMPAT
+/**
+ * Abstract base class for models identified by a unique {@link ModelKey}.
+ *
+ * Copies the `id` from the provided template during construction.
+ *
+ * @deprecated Use {@link UniqueModel} instead.
+ */ var AbstractUniqueModel = function AbstractUniqueModel(template) {
+    _class_call_check$b(this, AbstractUniqueModel);
+    _define_property$l(this, "id", void 0);
+    this.id = template.id;
+} 
+;
 
-function _array_like_to_array$o(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$9(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$o(arr);
+function _array_without_holes$l(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$w(arr);
 }
-function _iterable_to_array$9(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$9() {
+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$9(arr) {
-    return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$o(arr) || _non_iterable_spread$9();
+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 _unsupported_iterable_to_array$o(o, minLen) {
+function _unsupported_iterable_to_array$w(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$o(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$o(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$w(o, minLen);
 }
 /**
  * Wraps a key reading function to ensure that empty string keys are not used in boolean key arrays.
+ *
  * @param readKey - The key reading function to wrap
  * @returns A wrapped key reading function that throws an error if an empty string is used as a key
  */ function readBooleanKeySafetyWrap(readKey) {
@@ -2227,6 +2335,7 @@ function _unsupported_iterable_to_array$o(o, minLen) {
 }
 /**
  * Checks if a boolean key array evaluates to false (empty or undefined).
+ *
  * @param value - The boolean key array to check
  * @returns True if the array is empty or undefined, false otherwise
  */ function isFalseBooleanKeyArray(value) {
@@ -2234,6 +2343,7 @@ function _unsupported_iterable_to_array$o(o, minLen) {
 }
 /**
  * Checks if a boolean key array evaluates to true (has at least one value).
+ *
  * @param value - The boolean key array to check
  * @returns True if the array has at least one value, false otherwise
  */ function isTrueBooleanKeyArray(value) {
@@ -2241,12 +2351,13 @@ function _unsupported_iterable_to_array$o(o, minLen) {
 }
 /**
  * Inserts a value into a boolean key array, removing any existing values with the same key.
+ *
  * @param array - The boolean key array to insert into
  * @param value - The value to insert
  * @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$9(removeModelsWithSameKey(array, value, readBooleanKeySafetyWrap(readKey))).concat([
+    return array ? _to_consumable_array$l(removeModelsWithSameKey(array, value, readBooleanKeySafetyWrap(readKey))).concat([
         value
     ]) : [
         value
@@ -2254,6 +2365,7 @@ function _unsupported_iterable_to_array$o(o, minLen) {
 }
 /**
  * Removes a value from a boolean key array based on its key.
+ *
  * @param array - The boolean key array to remove from
  * @param value - The value to remove
  * @param readKey - Function to extract the key from a value
@@ -2263,6 +2375,7 @@ function _unsupported_iterable_to_array$o(o, minLen) {
 }
 /**
  * Removes values from a boolean key array that match the specified key.
+ *
  * @param array - The boolean key array to remove from
  * @param key - The key to match for removal
  * @param readKey - Function to extract the key from a value
@@ -2272,6 +2385,7 @@ function _unsupported_iterable_to_array$o(o, minLen) {
 }
 /**
  * Creates a utility object with functions for working with boolean key arrays.
+ *
  * @param readKey - Function to extract the key from a value
  * @returns An object with utility functions for boolean key arrays
  */ function booleanKeyArrayUtility(readKey) {
@@ -2309,6 +2423,14 @@ function _unsupported_iterable_to_array$o(o, minLen) {
     return x ? x : undefined;
 });
 
+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$k(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$v(arr);
+}
 function _class_call_check$a(instance, Constructor) {
     if (!(instance instanceof Constructor)) {
         throw new TypeError("Cannot call a class as a function");
@@ -2340,6 +2462,23 @@ function _define_property$k(obj, key, value) {
     }
     return obj;
 }
+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$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$k(arr) {
+    return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$v(arr) || _non_iterable_spread$k();
+}
+function _unsupported_iterable_to_array$v(o, minLen) {
+    if (!o) return;
+    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$v(o, minLen);
+}
 /**
  * Set that is implemented internally using a Map, and input values have their keys read.
  *
@@ -2520,7 +2659,7 @@ function _define_property$k(obj, key, value) {
      * @returns An array of all stored values.
      */ key: "valuesArray",
             value: function valuesArray() {
-                return Array.from(this._map.values());
+                return _to_consumable_array$k(this._map.values());
             }
         },
         {
@@ -2534,30 +2673,30 @@ function _define_property$k(obj, key, value) {
 } 
 ();
 
-function _array_like_to_array$n(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$8(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$n(arr);
+function _array_without_holes$j(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$u(arr);
 }
-function _iterable_to_array$8(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$8() {
+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$8(arr) {
-    return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$n(arr) || _non_iterable_spread$8();
+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 _unsupported_iterable_to_array$n(o, minLen) {
+function _unsupported_iterable_to_array$u(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$n(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$n(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$u(o, minLen);
 }
 var SORT_VALUE_LESS_THAN = -1;
 var SORT_VALUE_GREATER_THAN = 1;
@@ -2571,6 +2710,10 @@ function reverseCompareFn(compareFn) {
  * Convenience function that reverses the order of the sorted values if the order is specified descending.
  *
  * The input comparison function must be in ascending order.
+ *
+ * @param ascendingCompareFn - a comparison function that sorts in ascending order
+ * @param order - the desired sort direction; defaults to 'asc'
+ * @returns the original function if ascending, or a reversed version if descending
  */ function compareFnOrder(ascendingCompareFn) {
     var order = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : 'asc';
     return order === 'asc' ? ascendingCompareFn : reverseCompareFn(ascendingCompareFn);
@@ -2609,7 +2752,7 @@ function reverseCompareFn(compareFn) {
     var doSort = sortWith != null;
     var result = values;
     if (alwaysReturnCopy || sortOnCopy && doSort) {
-        result = _to_consumable_array$8(values);
+        result = _to_consumable_array$j(values);
     }
     if (doSort) {
         result = result.sort(sortWith);
@@ -2636,6 +2779,10 @@ function reverseCompareFn(compareFn) {
 }
 /**
  * Creates a SortValuesFunction using the input. If the input is not defined, or it's sort function is not defined, then returns mapIdentityFunction().
+ *
+ * @param sortRef - optional reference containing the sort comparison function
+ * @param sortOnCopyDefault - whether to sort on a copy by default
+ * @returns a sort function that sorts arrays, or the identity function if no sort comparison is configured
  */ function sortValuesFunctionOrMapIdentityWithSortRef(sortRef, sortOnCopyDefault) {
     var sortWith = sortRef === null || sortRef === void 0 ? void 0 : sortRef.sortWith;
     return sortWith ? sortValuesFunctionWithSortRef(sortRef, sortOnCopyDefault) : mapIdentityFunction();
@@ -2685,21 +2832,21 @@ function reverseCompareFn(compareFn) {
     };
 }
 
-function _array_like_to_array$m(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_with_holes$j(arr) {
+function _array_with_holes$k(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$7(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$m(arr);
+function _array_without_holes$i(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$t(arr);
 }
-function _iterable_to_array$7(iter) {
+function _iterable_to_array$i(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _iterable_to_array_limit$j(arr, i) {
+function _iterable_to_array_limit$k(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
     var _arr = [];
@@ -2723,25 +2870,25 @@ function _iterable_to_array_limit$j(arr, i) {
     }
     return _arr;
 }
-function _non_iterable_rest$j() {
+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$7() {
+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 _sliced_to_array$j(arr, i) {
-    return _array_with_holes$j(arr) || _iterable_to_array_limit$j(arr, i) || _unsupported_iterable_to_array$m(arr, i) || _non_iterable_rest$j();
+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();
 }
-function _to_consumable_array$7(arr) {
-    return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$m(arr) || _non_iterable_spread$7();
+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 _unsupported_iterable_to_array$m(o, minLen) {
+function _unsupported_iterable_to_array$t(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$m(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$m(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$t(o, minLen);
 }
 /**
  * Splits the input array into batches of a maximum size. Each batch carries its zero-based index as `.i`.
@@ -2757,7 +2904,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
  * // result[1] => ['c', 'd'], result[1].i => 1
  * ```
  */ function batch(input, batchSize) {
-    var array = _to_consumable_array$7(input); // Copy array before splicing it.
+    var array = _to_consumable_array$i(input); // Copy array before splicing it.
     var batches = [];
     var i = 0;
     while(array.length > 0){
@@ -2824,6 +2971,9 @@ function _unsupported_iterable_to_array$m(o, minLen) {
  * @param orderKeys - Keys defining the desired order.
  * @param values - Values to reorder.
  * @param params - Configuration including key reader, duplicate handling, and new-item behavior.
+ * @param params.readKey - function that extracts the grouping key from each value
+ * @param params.chooseRetainedValue - function that selects which value to keep when duplicates share the same key; defaults to keeping the first
+ * @param params.excludeNewItems - when true, values whose keys are not in `orderKeys` are omitted from the result; defaults to false
  * @returns The reordered values array.
  *
  * @example
@@ -2857,10 +3007,9 @@ function _unsupported_iterable_to_array$m(o, minLen) {
             newItems.push(getValue());
         }
     });
-    var result = _to_consumable_array$7(restoredOrder).concat(_to_consumable_array$7(newItems)).filter(function(x) {
+    return _to_consumable_array$i(restoredOrder).concat(_to_consumable_array$i(newItems)).filter(function(x) {
         return x !== undefined;
     }); // Allow null to be passed.
-    return result;
 }
 /**
  * Compares two arrays by pairing items with matching keys and checking equality.
@@ -2869,20 +3018,22 @@ function _unsupported_iterable_to_array$m(o, minLen) {
  * @param a - First array to compare.
  * @param b - Second array to compare.
  * @param params - Key extraction and equality functions.
+ * @param params.groupKeyFn - function that extracts a grouping key from each element for pairing
+ * @param params.isEqual - predicate that returns true when two paired elements are considered equal
  * @returns `true` if the array contents differ.
  */ function arrayContentsDiffer() {
     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$7(a).concat(_to_consumable_array$7(b)), groupKeyFn);
-        if (pairs.unpaired) {
+        var pairs = pairGroupValues(_to_consumable_array$i(a).concat(_to_consumable_array$i(b)), groupKeyFn);
+        if (pairs.unpaired.length > 0) {
             // Any unpaired items means there is a difference.
             areDifferent = true;
         } else {
             var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
             try {
                 for(var _iterator = pairs.pairs[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
-                    var _step_value = _sliced_to_array$j(_step.value, 2), aa = _step_value[0], bb = _step_value[1];
+                    var _step_value = _sliced_to_array$k(_step.value, 2), aa = _step_value[0], bb = _step_value[1];
                     // If any item is not the same, break.
                     if (!isEqual(aa, bb)) {
                         areDifferent = true;
@@ -2952,12 +3103,13 @@ function _unsupported_iterable_to_array$m(o, minLen) {
  * @param checkInclusion - Returns `true` for values that should be included.
  * @returns A {@link SeparateResult} with included and excluded arrays.
  */ function separateValues(values, checkInclusion) {
+    var _result_in, _result_out;
     var result = groupValues(values, function(x) {
         return checkInclusion(x) ? 'in' : 'out';
     });
     return {
-        included: result.in || [],
-        excluded: result.out || []
+        included: (_result_in = result.in) !== null && _result_in !== void 0 ? _result_in : [],
+        excluded: (_result_out = result.out) !== null && _result_out !== void 0 ? _result_out : []
     };
 }
 function groupValues(values, groupKeyFn) {
@@ -2982,15 +3134,21 @@ function makeValuesGroupMap(values, groupKeyFn) {
     return map;
 }
 
-function _array_like_to_array$l(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;
 }
-function _array_with_holes$i(arr) {
+function _array_with_holes$j(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _iterable_to_array_limit$i(arr, i) {
+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;
     var _arr = [];
@@ -3014,19 +3172,25 @@ function _iterable_to_array_limit$i(arr, i) {
     }
     return _arr;
 }
-function _non_iterable_rest$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 _sliced_to_array$i(arr, i) {
-    return _array_with_holes$i(arr) || _iterable_to_array_limit$i(arr, i) || _unsupported_iterable_to_array$l(arr, i) || _non_iterable_rest$i();
+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 _unsupported_iterable_to_array$l(o, minLen) {
+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();
+}
+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) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$l(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$l(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$s(o, minLen);
 }
 /**
  * Combines multiple Maps into a single Map. Later maps override earlier values for the same key.
@@ -3064,7 +3228,7 @@ function _unsupported_iterable_to_array$l(o, minLen) {
  * @param map - The map to convert
  * @returns An array of [key, value] tuples
  */ function mapToTuples(map) {
-    return Array.from(map.entries());
+    return _to_consumable_array$h(map.entries());
 }
 /**
  * Expands a Map with array values into individual key/value tuples.
@@ -3082,7 +3246,7 @@ function _unsupported_iterable_to_array$l(o, minLen) {
  */ function expandArrayValueTuples(values) {
     var tuples = [];
     values.forEach(function(param) {
-        var _param = _sliced_to_array$i(param, 2), key = _param[0], _$values = _param[1];
+        var _param = _sliced_to_array$j(param, 2), key = _param[0], _$values = _param[1];
         useIterableOrValue(_$values, function(value) {
             tuples.push([
                 key,
@@ -3302,10 +3466,8 @@ function _unsupported_iterable_to_array$l(o, minLen) {
     return function(input) {
         if (typeof input === 'number') {
             return decoder(input);
-        } else if (input != null) {
-            return encodeBitwiseSet(input);
         } else {
-            return 0;
+            return encodeBitwiseSet(input);
         }
     };
 }
@@ -3348,10 +3510,8 @@ function _unsupported_iterable_to_array$l(o, minLen) {
     return function(input) {
         if (typeof input === 'number') {
             return decoder(input);
-        } else if (input != null) {
-            return encoder(input);
         } else {
-            return 0;
+            return encoder(input);
         }
     };
 }
@@ -3451,7 +3611,6 @@ function getValueFromGetter(input, args) {
  * @returns An ObjectCopyFactory for the input
  */ function asObjectCopyFactory(input, copyFunction) {
     if ((typeof input === "undefined" ? "undefined" : _type_of$j(input)) === 'object') {
-        // eslint-disable-next-line @typescript-eslint/no-explicit-any
         return objectCopyFactory(input, copyFunction);
     } else {
         return asGetter(input);
@@ -3563,8 +3722,7 @@ function makeWithFactoryInput(factory, input) {
         } else {
             // when fencePosts is true, we're wrapping to the nearest fence post, meaning wraps are one value longer increased on that side.
             var fencePostOffset = fencePosts ? input < min ? 1 : -1 : 0;
-            var wrappedValue = ((input - min) % distance + distance) % distance + min + fencePostOffset;
-            return wrappedValue;
+            return ((input - min) % distance + distance) % distance + min + fencePostOffset;
         }
     };
     fn._wrap = wrapNumberFunctionConfig;
@@ -3702,11 +3860,14 @@ function _type_of$i(obj) {
     var y = Math.ceil(to);
     var totalNumbers = y - x + 1;
     var sum = x + y;
-    var sumOfIntegers = sum / 2 * totalNumbers;
-    return sumOfIntegers;
+    return sum / 2 * totalNumbers;
 }
 /**
  * A {@link SortCompareFunction} for numbers that sorts in ascending order.
+ *
+ * @param a - the first number to compare
+ * @param b - the second number to compare
+ * @returns a negative value if `a` is less than `b`, zero if equal, or a positive value if `a` is greater
  */ var sortCompareNumberFunction = function sortCompareNumberFunction(a, b) {
     return a - b;
 };
@@ -4588,7 +4749,7 @@ function indexRangeCheckFunctionConfigToIndexRange(param) {
     var indexRange = param.indexRange, inclusiveMaxIndex = param.inclusiveMaxIndex;
     if (inclusiveMaxIndex) {
         var minIndex = indexRange.minIndex, maxIndexInput = indexRange.maxIndex;
-        var maxIndex = inclusiveMaxIndex ? maxIndexInput + 1 : maxIndexInput;
+        var maxIndex = maxIndexInput + 1;
         return {
             minIndex: minIndex,
             maxIndex: maxIndex
@@ -4749,7 +4910,8 @@ function indexRangeCheckFunctionConfigToIndexRange(param) {
  * @param step - number of steps to take (positive or negative); defaults to 1
  * @param wrapAround - whether to wrap out-of-bound results; defaults to false
  * @returns the resulting index, or undefined if out of bounds without wrapping
- */ function stepsFromIndex(range, startIndex) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function stepsFromIndex(range, startIndex) {
     var step = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 1, wrapAround = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : false;
     return stepsFromIndexFunction({
         range: range
@@ -4853,11 +5015,11 @@ function indexRangeCheckFunctionConfigToIndexRange(param) {
  *
  * If order is irrelevant, use filterValuesByDistanceNoOrder() instead.
  *
- * @param input - The array of values to filter
- * @param minDistance - The minimum distance required between values
- * @param getValue - Function that extracts a numeric value from each item for distance comparison
+ * @param _input - The array of values to filter
+ * @param _minDistance - The minimum distance required between values
+ * @param _getValue - Function that extracts a numeric value from each item for distance comparison
  * @returns A filtered array with only values that are at least minDistance apart
- */ function filterValuesByDistance(input, minDistance, getValue) {
+ */ function filterValuesByDistance(_input, _minDistance, _getValue) {
     // TODO(FUTURE): Implement if needed.
     throw new Error('Incomplete implementation!');
 }
@@ -4928,7 +5090,8 @@ function indexRangeCheckFunctionConfigToIndexRange(param) {
  * @param compare - AscendingSortCompareFunction to compare two values to determine which is the best fit
  * @param updateNonBestFit - Function that transforms non-best-fit items
  * @returns A new array with only the best fit item and transformed non-best-fit items
- */ function makeBestFit(input, filter, compare, updateNonBestFit) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function makeBestFit(input, filter, compare, updateNonBestFit) {
     return applyBestFit(copyArray(input), filter, compare, updateNonBestFit);
 }
 /**
@@ -4942,7 +5105,8 @@ function indexRangeCheckFunctionConfigToIndexRange(param) {
  * @param compare - AscendingSortCompareFunction to compare two values to determine which is the best fit
  * @param updateNonBestFit - Function that transforms non-best-fit items
  * @returns The modified input array with only the best fit item and transformed non-best-fit items
- */ function applyBestFit(input, filter, compare, updateNonBestFit) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function applyBestFit(input, filter, compare, updateNonBestFit) {
     var matchIndexSet = findToIndexSet(input, filter);
     if (matchIndexSet.length > 1) {
         var expansion = expandIndexSet(input, matchIndexSet);
@@ -5031,7 +5195,8 @@ function terminatingFactoryFromArray(array, terminatingValue) {
  * @param wrapAround - Whether to wrap around to the beginning of the array if the found value is at or near the last index.
  * @param steps - Number of steps forward from the found index. Defaults to 1.
  * @returns The value at the next index, or undefined if no match is found or no next value exists.
- */ function findNext(array, find) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function findNext(array, find) {
     var wrapAround = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : false, steps = arguments.length > 3 ? arguments[3] : void 0;
     var result;
     if (array) {
@@ -5056,7 +5221,8 @@ function terminatingFactoryFromArray(array, terminatingValue) {
  * @param wrapAround - Whether to wrap around when stepping past the end of the array.
  * @param steps - Number of steps forward from the current index.
  * @returns The computed next index, or undefined if the input index is out of bounds.
- */ function getArrayNextIndex(array, index) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function getArrayNextIndex(array, index) {
     var wrapAround = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : false, steps = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : 1;
     var nextIndex;
     var arrayLength = array.length;
@@ -5236,12 +5402,12 @@ function arrayToObject(values, keyFn) {
  * @param readKey - function to extract a key from an existing item
  * @param generateFn - function to create a new item for a key not found in existing items
  * @returns an array of items corresponding to each input key, in the same order
- */ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
     var map = arrayToMap(existing, readKey);
     return keys.map(function(x) {
         var _map_get;
-        var value = (_map_get = map.get(x)) !== null && _map_get !== void 0 ? _map_get : generateFn(x);
-        return value;
+        return (_map_get = map.get(x)) !== null && _map_get !== void 0 ? _map_get : generateFn(x);
     });
 }
 
@@ -5272,8 +5438,7 @@ function arrayToObject(values, keyFn) {
         return 0;
     } else {
         var random = Math.random();
-        var index = Math.round(random * (values.length - 1));
-        return index;
+        return Math.round(random * (values.length - 1));
     }
 }
 /**
@@ -5609,6 +5774,7 @@ function caseInsensitiveString(input) {
 
 /**
  * Trims leading and trailing whitespace from a string.
+ *
  * @param input The string to trim.
  * @returns The trimmed string.
  */ function stringTrimFunction(input) {
@@ -5616,6 +5782,7 @@ function caseInsensitiveString(input) {
 }
 /**
  * Converts a string to uppercase.
+ *
  * @param input The string to convert.
  * @returns The uppercase string.
  */ function stringToUppercaseFunction(input) {
@@ -5623,6 +5790,7 @@ function caseInsensitiveString(input) {
 }
 /**
  * Converts a string to lowercase.
+ *
  * @param input The string to convert.
  * @returns The lowercase string.
  */ function stringToLowercaseFunction(input) {
@@ -5684,9 +5852,7 @@ function caseInsensitiveString(input) {
             transform = stringTrimFunction;
         }
     }
-    if (transform == null) {
-        transform = MAP_IDENTITY;
-    }
+    transform !== null && transform !== void 0 ? transform : transform = MAP_IDENTITY;
     return transform;
 }
 /**
@@ -5700,6 +5866,7 @@ function caseInsensitiveString(input) {
 }
 /**
  * Creates a function that adds a configured prefix to the input string if it does not exist on that string.
+ *
  * @param prefix The prefix to add.
  * @returns A function that adds the prefix to a string.
  */ function addPrefixFunction(prefix) {
@@ -5709,6 +5876,7 @@ function caseInsensitiveString(input) {
 }
 /**
  * Adds a suffix to a string if it does not already end with that suffix.
+ *
  * @param suffix The suffix to add.
  * @param input The string to modify.
  * @returns The modified string.
@@ -5717,6 +5885,7 @@ function caseInsensitiveString(input) {
 }
 /**
  * Creates a function that adds a configured suffix to the input string if it does not exist on that string.
+ *
  * @param suffix The suffix to add.
  * @returns A function that adds the suffix to a string.
  */ function addSuffixFunction(suffix) {
@@ -5726,6 +5895,7 @@ function caseInsensitiveString(input) {
 }
 /**
  * Pads the start of a string to a minimum length.
+ *
  * @param minLength The minimum length of the string.
  * @param padCharacter The character to use for padding.
  * @returns A function that pads the start of a string.
@@ -5769,6 +5939,31 @@ 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.
  *
@@ -5824,7 +6019,7 @@ function caseInsensitiveString(input) {
  * @param values - iterable of strings to deduplicate
  * @returns an array of unique lowercase strings
  */ function uniqueCaseInsensitiveStrings(values) {
-    return Array.from(uniqueCaseInsensitiveStringsSet(values));
+    return _to_consumable_array$g(uniqueCaseInsensitiveStringsSet(values));
 }
 /**
  * Returns a {@link Set} of unique lowercase strings from the input, compared case-insensitively.
@@ -6028,6 +6223,7 @@ function _is_native_reflect_construct$4() {
             key: "target",
             get: /**
      * Gets the target object that failed the assertion.
+     *
      * @returns The target object
      */ function get() {
                 return this._target;
@@ -6037,6 +6233,7 @@ function _is_native_reflect_construct$4() {
             key: "propertyKey",
             get: /**
      * Gets the property key that failed the assertion.
+     *
      * @returns The property key as a string
      */ function get() {
                 return this._property;
@@ -6055,6 +6252,7 @@ function _is_native_reflect_construct$4() {
         {
             /**
      * Handles an assertion issue by throwing an appropriate exception.
+     *
      * @param error - The assertion issue to handle
      * @throws AssertionError
      */ key: "handle",
@@ -6065,6 +6263,7 @@ function _is_native_reflect_construct$4() {
         {
             /**
      * Builds an AssertionError from an AssertionIssue.
+     *
      * @param error - The assertion issue to build an exception from
      * @returns A new AssertionError instance
      */ key: "buildException",
@@ -6077,12 +6276,14 @@ function _is_native_reflect_construct$4() {
             /**
      * Builds an error message string from an AssertionIssue.
      * Uses the custom message if provided, otherwise creates a default message.
+     *
      * @param error - The assertion issue to build a message for
      * @returns The error message string
      */ key: "buildExceptionString",
             value: function buildExceptionString(error) {
+                var _error_options;
                 var message;
-                if (error.options && error.options.message) {
+                if ((_error_options = error.options) === null || _error_options === void 0 ? void 0 : _error_options.message) {
                     message = error.options.message;
                 } else {
                     message = "Assertion failed for property '" + error.propertyKey + '".';
@@ -6169,7 +6370,8 @@ function _object_spread$e(target) {
                 options = _object_spread$e({}, defaultOptions, options);
                 return this.makeSetPropertyDescriptorInterceptor(function(param) {
                     var target = param.target, propertyKey = param.propertyKey, setValue = param.setValue;
-                    var map = (options === null || options === void 0 ? void 0 : options.map) || function(x) {
+                    var _options_map;
+                    var map = (_options_map = options.map) !== null && _options_map !== void 0 ? _options_map : function(x) {
                         return x;
                     };
                     return function(value) {
@@ -6307,9 +6509,9 @@ function _object_spread$e(target) {
             break;
         default:
             filter = function filter(value, i) {
-                return filters.findIndex(function(filter) {
+                return !filters.some(function(filter) {
                     return !filter(value, i);
-                }) === -1;
+                });
             };
             break;
     }
@@ -6323,15 +6525,15 @@ function _object_spread$e(target) {
  * @returns The inverted filter function, or the original if invert is false
  */ var invertFilter = invertBooleanReturnFunction;
 
-function _array_like_to_array$k(arr, len) {
+function _array_like_to_array$q(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_with_holes$h(arr) {
+function _array_with_holes$i(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _iterable_to_array_limit$h(arr, i) {
+function _iterable_to_array_limit$i(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
     var _arr = [];
@@ -6355,29 +6557,31 @@ function _iterable_to_array_limit$h(arr, i) {
     }
     return _arr;
 }
-function _non_iterable_rest$h() {
+function _non_iterable_rest$i() {
     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 _sliced_to_array$h(arr, i) {
-    return _array_with_holes$h(arr) || _iterable_to_array_limit$h(arr, i) || _unsupported_iterable_to_array$k(arr, i) || _non_iterable_rest$h();
+function _sliced_to_array$i(arr, i) {
+    return _array_with_holes$i(arr) || _iterable_to_array_limit$i(arr, i) || _unsupported_iterable_to_array$q(arr, i) || _non_iterable_rest$i();
 }
 function _type_of$f(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$k(o, minLen) {
+function _unsupported_iterable_to_array$q(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$k(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$q(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$k(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$q(o, minLen);
 }
 /**
  * Iterates over filtered key/value tuples of an object and invokes a callback for each.
  *
  * @param obj - Object to iterate
  * @param config - Configuration with a forEach callback and optional filter
+ * @param config.forEach - callback invoked for each key/value tuple that passes the filter
+ * @param config.filter - optional filter controlling which key/value tuples are iterated; when omitted, all tuples are visited
  *
  * @example
  * ```ts
@@ -6513,43 +6717,43 @@ function _unsupported_iterable_to_array$k(o, minLen) {
     switch(type){
         case exports.KeyValueTypleValueFilter.UNDEFINED:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return x !== undefined;
             };
             break;
         case exports.KeyValueTypleValueFilter.NULL:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return x != null;
             };
             break;
         case exports.KeyValueTypleValueFilter.FALSY:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return Boolean(x);
             };
             break;
         case exports.KeyValueTypleValueFilter.EMPTY:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return hasValueOrNotEmpty(x);
             };
             break;
         case exports.KeyValueTypleValueFilter.EMPTY_STRICT:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return hasValueOrNotEmptyObject(x);
             };
             break;
         case exports.KeyValueTypleValueFilter.FALSY_AND_EMPTY:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return Boolean(x) && hasValueOrNotEmpty(x);
             };
             break;
         case exports.KeyValueTypleValueFilter.FALSY_AND_EMPTY_STRICT:
             filterFn = function filterFn(param) {
-                var _param = _sliced_to_array$h(param, 2), x = _param[1];
+                var _param = _sliced_to_array$i(param, 2), x = _param[1];
                 return Boolean(x) && hasValueOrNotEmptyObject(x);
             };
             break;
@@ -6636,12 +6840,12 @@ function cachedGetter(factory) {
     };
 }
 
-function _array_like_to_array$j(arr, len) {
+function _array_like_to_array$p(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_with_holes$g(arr) {
+function _array_with_holes$h(arr) {
     if (Array.isArray(arr)) return arr;
 }
 function _define_property$h(obj, key, value) {
@@ -6657,7 +6861,7 @@ function _define_property$h(obj, key, value) {
     }
     return obj;
 }
-function _iterable_to_array_limit$g(arr, i) {
+function _iterable_to_array_limit$h(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
     var _arr = [];
@@ -6681,7 +6885,7 @@ function _iterable_to_array_limit$g(arr, i) {
     }
     return _arr;
 }
-function _non_iterable_rest$g() {
+function _non_iterable_rest$h() {
     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 _object_spread$d(target) {
@@ -6699,20 +6903,20 @@ function _object_spread$d(target) {
     }
     return target;
 }
-function _sliced_to_array$g(arr, i) {
-    return _array_with_holes$g(arr) || _iterable_to_array_limit$g(arr, i) || _unsupported_iterable_to_array$j(arr, i) || _non_iterable_rest$g();
+function _sliced_to_array$h(arr, i) {
+    return _array_with_holes$h(arr) || _iterable_to_array_limit$h(arr, i) || _unsupported_iterable_to_array$p(arr, i) || _non_iterable_rest$h();
 }
 function _type_of$e(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$j(o, minLen) {
+function _unsupported_iterable_to_array$p(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$j(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$p(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$j(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$p(o, minLen);
 }
 // MARK: Object Merging/Overriding
 /**
@@ -6757,6 +6961,9 @@ function _unsupported_iterable_to_array$j(o, minLen) {
  * By default, `undefined` values in sources are excluded from the template.
  *
  * @param config - Configuration controlling filtering, copying, and caching behavior.
+ * @param config.filter - filter applied to source object values when building the template; by default, `undefined` values are excluded
+ * @param config.copy - when true, the target object is shallow-copied before applying overrides instead of being mutated in place
+ * @param config.dynamic - when true, the template is recalculated on each call instead of being cached; useful when source objects may change over time
  * @returns A factory function that accepts source objects and returns an override function.
  *
  * @example
@@ -7002,8 +7209,9 @@ function _unsupported_iterable_to_array$j(o, minLen) {
  */ function findPOJOKeysFunction(filter) {
     var findEachMatchingKeyOnTarget = forEachKeyValueOnPOJOFunction({
         filter: filter,
+        // eslint-disable-next-line @typescript-eslint/max-params
         forEach: function forEach(param, i, obj, context) {
-            var _param = _sliced_to_array$g(param, 1), key = _param[0];
+            var _param = _sliced_to_array$h(param, 1), key = _param[0];
             context.keys.push(key);
         }
     });
@@ -7055,6 +7263,7 @@ function _unsupported_iterable_to_array$j(o, minLen) {
     var filter = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : exports.KeyValueTypleValueFilter.UNDEFINED;
     var countEachMatchingKeyOnTarget = forEachKeyValueOnPOJOFunction({
         filter: filter,
+        // eslint-disable-next-line @typescript-eslint/max-params
         forEach: function forEach(x, i, obj, context) {
             context.count += 1;
         }
@@ -7100,6 +7309,8 @@ function _unsupported_iterable_to_array$j(o, minLen) {
  * By default, removes `undefined` values (`KeyValueTypleValueFilter.UNDEFINED`) and does not copy (`copy: false`).
  *
  * @param config - Configuration for filtering and copying. Defaults to `{ copy: false, filter: { valueFilter: KeyValueTypleValueFilter.UNDEFINED } }`.
+ * @param config.copy - when true, returns a shallow copy with filtered keys removed instead of mutating the input; defaults to false
+ * @param config.filter - the filter criteria determining which key/value pairs to remove; defaults to removing `undefined` values
  * @returns A reusable filter function. The returned function also accepts a `copyOverride` argument to override the copy behavior per-call.
  *
  * @example
@@ -7123,7 +7334,7 @@ function _unsupported_iterable_to_array$j(o, minLen) {
     var forEachFn = forEachKeyValueOnPOJOFunction({
         filter: filter,
         forEach: function forEach(param, i, object) {
-            var _param = _sliced_to_array$g(param, 1), key = _param[0];
+            var _param = _sliced_to_array$h(param, 1), key = _param[0];
             delete object[key];
         }
     });
@@ -7198,8 +7409,9 @@ function _unsupported_iterable_to_array$j(o, minLen) {
     var copy = (_ref = (typeof input === "undefined" ? "undefined" : _type_of$e(input)) === 'object' ? input.copy : true) !== null && _ref !== void 0 ? _ref : true;
     var assignEachValueToTarget = forEachKeyValueOnPOJOFunction({
         filter: filter,
+        // eslint-disable-next-line @typescript-eslint/max-params
         forEach: function forEach(param, i, object, target) {
-            var _param = _sliced_to_array$g(param, 2), key = _param[0], value = _param[1];
+            var _param = _sliced_to_array$h(param, 2), key = _param[0], value = _param[1];
             target[key] = value;
         }
     });
@@ -7259,8 +7471,9 @@ function _unsupported_iterable_to_array$j(o, minLen) {
     var filter = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : exports.KeyValueTypleValueFilter.UNDEFINED;
     var addValuesFromObjectToContext = forEachKeyValueOnPOJOFunction({
         filter: filter,
+        // eslint-disable-next-line @typescript-eslint/max-params
         forEach: function forEach(param, i, obj, context) {
-            var _param = _sliced_to_array$g(param, 2), value = _param[1];
+            var _param = _sliced_to_array$h(param, 2), value = _param[1];
             context.values.push(value);
         }
     });
@@ -7297,7 +7510,7 @@ function _unsupported_iterable_to_array$j(o, minLen) {
     var invertFilter = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false;
     var keysSet = new Set(keysToFilter);
     var filterFn = invertBooleanReturnFunction(function(param) {
-        var _param = _sliced_to_array$g(param, 1), key = _param[0];
+        var _param = _sliced_to_array$h(param, 1), key = _param[0];
         return keysSet.has(key);
     }, invertFilter);
     return filterTuplesOnPOJOFunction(filterFn);
@@ -7336,6 +7549,8 @@ function _unsupported_iterable_to_array$j(o, minLen) {
  * When no filter is provided, all key/value pairs are iterated.
  *
  * @param config - The filter and forEach callback configuration.
+ * @param config.forEach - callback invoked for each key/value pair that passes the filter
+ * @param config.filter - optional filter controlling which key/value pairs are iterated; when omitted, all pairs are visited
  * @returns A function that iterates matching key/value pairs on any input object.
  *
  * @example
@@ -7500,15 +7715,15 @@ function isInSetDecisionFunction(set, inputReadValue) {
     }
 }
 
-function _array_like_to_array$i(arr, len) {
+function _array_like_to_array$o(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_with_holes$f(arr) {
+function _array_with_holes$g(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _iterable_to_array_limit$f(arr, i) {
+function _iterable_to_array_limit$g(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
     var _arr = [];
@@ -7532,23 +7747,23 @@ function _iterable_to_array_limit$f(arr, i) {
     }
     return _arr;
 }
-function _non_iterable_rest$f() {
+function _non_iterable_rest$g() {
     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 _sliced_to_array$f(arr, i) {
-    return _array_with_holes$f(arr) || _iterable_to_array_limit$f(arr, i) || _unsupported_iterable_to_array$i(arr, i) || _non_iterable_rest$f();
+function _sliced_to_array$g(arr, i) {
+    return _array_with_holes$g(arr) || _iterable_to_array_limit$g(arr, i) || _unsupported_iterable_to_array$o(arr, i) || _non_iterable_rest$g();
 }
 function _type_of$d(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$i(o, minLen) {
+function _unsupported_iterable_to_array$o(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$i(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$o(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$i(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$o(o, minLen);
 }
 var AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE = 1;
 var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
@@ -7564,16 +7779,13 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
  */ function authRoleClaimsService(config) {
     var defaults = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
     var _ref, _ref1;
-    var defaultClaimValue = (_ref = objectHasKey(defaults, 'claimValue') ? defaults === null || defaults === void 0 ? void 0 : defaults.claimValue : AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE) !== null && _ref !== void 0 ? _ref : AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE;
-    var defaultEmptyValue = (_ref1 = objectHasKey(defaults, 'emptyValue') ? defaults === null || defaults === void 0 ? void 0 : defaults.emptyValue : AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE) !== null && _ref1 !== void 0 ? _ref1 : null;
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    var defaultClaimValue = (_ref = objectHasKey(defaults, 'claimValue') ? defaults.claimValue : AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE) !== null && _ref !== void 0 ? _ref : AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE;
+    var defaultEmptyValue = (_ref1 = objectHasKey(defaults, 'emptyValue') ? defaults.emptyValue : AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE) !== null && _ref1 !== void 0 ? _ref1 : null;
     function isSimpleOptions(entry) {
-        return entry.roles != null;
+        return 'roles' in entry;
     }
-    // eslint-disable-next-line @typescript-eslint/no-explicit-any
-    var tuples = Object.entries(config).filter(function(param) {
-        var _param = _sliced_to_array$f(param, 2), entry = _param[1];
-        return entry != null;
+    var tuples = Object.entries(config).filter(function(x) {
+        return x[1] != null;
     }) // skip any ignored/null values
     .map(function(x) {
         var inputEntry = x[1];
@@ -7650,7 +7862,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
         var claims = {};
         // iterate by each claim value to build the claims.
         tuples.forEach(function(param) {
-            var _param = _sliced_to_array$f(param, 2), claimsKey = _param[0], entry = _param[1];
+            var _param = _sliced_to_array$g(param, 2), claimsKey = _param[0], entry = _param[1];
             var _entry_encodeValueFromRoles;
             var claimsValue = (_entry_encodeValueFromRoles = entry.encodeValueFromRoles(roles)) !== null && _entry_encodeValueFromRoles !== void 0 ? _entry_encodeValueFromRoles : defaultEmptyValue;
             claims[claimsKey] = claimsValue;
@@ -7658,8 +7870,9 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
         return claims;
     };
     var forEachKeyValueAddToSet = forEachKeyValueOnPOJOFunction({
+        // eslint-disable-next-line @typescript-eslint/max-params
         forEach: function forEach(param, i, claims, roles) {
-            var _param = _sliced_to_array$f(param, 2), claimsKey = _param[0], value = _param[1];
+            var _param = _sliced_to_array$g(param, 2), claimsKey = _param[0], value = _param[1];
             var entry = authRoleMap.get(claimsKey);
             if (entry != null) {
                 var decodedRoles = entry.decodeRolesFromValue(value);
@@ -7695,15 +7908,21 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
     });
 }
 
-function _array_like_to_array$h(arr, len) {
+function _array_like_to_array$n(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_with_holes$e(arr) {
+function _array_with_holes$f(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _iterable_to_array_limit$e(arr, i) {
+function _array_without_holes$f(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$n(arr);
+}
+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$f(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
     var _arr = [];
@@ -7727,19 +7946,25 @@ function _iterable_to_array_limit$e(arr, i) {
     }
     return _arr;
 }
-function _non_iterable_rest$e() {
+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 _sliced_to_array$e(arr, i) {
-    return _array_with_holes$e(arr) || _iterable_to_array_limit$e(arr, i) || _unsupported_iterable_to_array$h(arr, i) || _non_iterable_rest$e();
+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 _unsupported_iterable_to_array$h(o, minLen) {
+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 _unsupported_iterable_to_array$n(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$h(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$n(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$h(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$n(o, minLen);
 }
 /**
  * Finds the first and last occurrence of a single character within the input string.
@@ -7755,14 +7980,31 @@ function _unsupported_iterable_to_array$h(o, minLen) {
     if (find.length !== 1) {
         throw new Error('firstAndLastCharacterOccurrence() expects a single character as find input.');
     }
-    for(var i = 0; i < input.length; i += 1){
-        if (input[i] === find) {
-            if (first === -1) {
-                first = i;
-            } else {
-                last = i;
+    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){
+            var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
+            if (char === find) {
+                if (first === -1) {
+                    first = i;
+                } else {
+                    last = i;
+                }
+                occurences += 1;
+            }
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
             }
-            occurences += 1;
         }
     }
     if (first !== -1 && last === -1) {
@@ -7781,7 +8023,7 @@ function _unsupported_iterable_to_array$h(o, minLen) {
  * @param find - substring to search for
  * @returns true if the substring is found within the input
  */ function stringContains(input, find) {
-    return input.indexOf(find) !== -1;
+    return input.includes(find);
 }
 /**
  * Creates a function that replaces the last character of a string with the replacement string
@@ -7816,7 +8058,8 @@ function _unsupported_iterable_to_array$h(o, minLen) {
  * @param replacement - string to substitute at the index
  * @param decision - function that determines whether the character should be replaced
  * @returns the modified string, or the original if the decision is false
- */ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
+ */ // eslint-disable-next-line @typescript-eslint/max-params
+function replaceCharacterAtIndexIf(input, index, replacement, decision) {
     if (decision(input[index])) {
         return replaceCharacterAtIndexWith(input, index, replacement);
     } else {
@@ -7831,7 +8074,7 @@ function _unsupported_iterable_to_array$h(o, minLen) {
  * @param replacement - string to substitute at the index
  * @returns the string with the character at the index replaced
  */ function replaceCharacterAtIndexWith(input, index, replacement) {
-    var _splitStringAtIndex = _sliced_to_array$e(splitStringAtIndex(input, index, false), 2), head = _splitStringAtIndex[0], tail = _splitStringAtIndex[1];
+    var _splitStringAtIndex = _sliced_to_array$f(splitStringAtIndex(input, index, false), 2), head = _splitStringAtIndex[0], tail = _splitStringAtIndex[1];
     return head + replacement + tail;
 }
 /**
@@ -7870,13 +8113,40 @@ function _unsupported_iterable_to_array$h(o, minLen) {
  * @returns a record mapping each character to its index in the input string
  */ function stringCharactersToIndexRecord(chars) {
     var record = {};
-    for(var i = 0; i < chars.length; i += 1){
-        var char = chars[i];
-        record[char] = i;
+    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){
+            var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
+            record[char] = i;
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
     }
     return record;
 }
 
+function _array_like_to_array$m(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_with_holes$e(arr) {
+    if (Array.isArray(arr)) return arr;
+}
+function _array_without_holes$e(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$m(arr);
+}
 function _instanceof$3(left, right) {
     if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
         return !!right[Symbol.hasInstance](left);
@@ -7884,6 +8154,53 @@ function _instanceof$3(left, right) {
         return left instanceof right;
     }
 }
+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$e(arr, i) {
+    var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+    if (_i == null) return;
+    var _arr = [];
+    var _n = true;
+    var _d = false;
+    var _s, _e;
+    try {
+        for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
+            _arr.push(_s.value);
+            if (i && _arr.length === i) break;
+        }
+    } catch (err) {
+        _d = true;
+        _e = err;
+    } finally{
+        try {
+            if (!_n && _i["return"] != null) _i["return"]();
+        } finally{
+            if (_d) throw _e;
+        }
+    }
+    return _arr;
+}
+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() {
+    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 _unsupported_iterable_to_array$m(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$m(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$m(o, minLen);
+}
 /**
  * Creates a function that replaces all occurrences of the configured target strings with a replacement value.
  *
@@ -7997,13 +8314,29 @@ function _instanceof$3(left, right) {
     return function(input, maxToReturn) {
         var max = maxToReturn !== null && maxToReturn !== void 0 ? maxToReturn : Number.MAX_SAFE_INTEGER;
         var occurrences = [];
-        for(var i = 0; i < input.length; i += 1){
-            var char = input[i];
-            if (characterSet.has(char)) {
-                occurrences.push(i);
-                // return if at the max number of occurences
-                if (occurrences.length >= max) {
-                    break;
+        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){
+                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);
+                    // return if at the max number of occurences
+                    if (occurrences.length >= max) {
+                        break;
+                    }
+                }
+            }
+        } catch (err) {
+            _didIteratorError = true;
+            _iteratorError = err;
+        } finally{
+            try {
+                if (!_iteratorNormalCompletion && _iterator.return != null) {
+                    _iterator.return();
+                }
+            } finally{
+                if (_didIteratorError) {
+                    throw _iteratorError;
                 }
             }
         }
@@ -8196,6 +8529,7 @@ function _instanceof$3(left, right) {
  * Useful for providing a constant decision where a function is expected.
  *
  * @param decision - the constant boolean value to return
+ * @returns a decision function that always returns the given boolean
  *
  * @example
  * ```ts
@@ -8229,6 +8563,7 @@ function _instanceof$3(left, right) {
  *
  * @param valueOrFunction - a boolean, decision function, or undefined
  * @param defaultIfUndefined - fallback boolean when the input is nullish (defaults to true)
+ * @returns a {@link DecisionFunction} derived from the input
  *
  * @example
  * ```ts
@@ -8259,7 +8594,7 @@ function isEqualToValueDecisionFunction(equalityValue) {
     return equalityValueCheckFunction;
 }
 
-function _array_like_to_array$g(arr, len) {
+function _array_like_to_array$l(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;
@@ -8323,19 +8658,19 @@ function _object_spread$c(target) {
     return target;
 }
 function _sliced_to_array$d(arr, i) {
-    return _array_with_holes$d(arr) || _iterable_to_array_limit$d(arr, i) || _unsupported_iterable_to_array$g(arr, i) || _non_iterable_rest$d();
+    return _array_with_holes$d(arr) || _iterable_to_array_limit$d(arr, i) || _unsupported_iterable_to_array$l(arr, i) || _non_iterable_rest$d();
 }
 function _type_of$c(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$g(o, minLen) {
+function _unsupported_iterable_to_array$l(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$g(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$l(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$g(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$l(o, minLen);
 }
 var SLASH_PATH_SEPARATOR = '/';
 var SLASH_PATH_FILE_TYPE_SEPARATOR = '.';
@@ -8525,7 +8860,9 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
  *
  * If the input is a file, the folder of the file is returned instead.
  *
- * @param input
+ * @param input - the string path to convert to a folder path
+ * @param config - optional configuration controlling path type inference and invalid-path handling
+ * @returns a valid slash path folder string with a trailing slash, or an empty string for relative root
  */ function slashPathFolder(input, config) {
     return slashPathFolderFactory(_object_spread$c({}, config))(input);
 }
@@ -8636,16 +8973,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
     var _ref = config !== null && config !== void 0 ? config : {}, _ref_illegalStrings = _ref.illegalStrings, illegalStrings = _ref_illegalStrings === void 0 ? DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS : _ref_illegalStrings, tmp = _ref.replaceIllegalCharacters, inputReplaceIllegalCharacters = tmp === void 0 ? true : tmp, tmp1 = _ref.replaceIllegalDots, inputReplaceIllegalDots = tmp1 === void 0 ? true : tmp1, throwError = _ref.throwError;
     var fns = [];
     var replaceIllegalCharacters = typeof inputReplaceIllegalCharacters === 'string' ? inputReplaceIllegalCharacters : DEFAULT_SLASH_PATH_ILLEGAL_CHARACTER_REPLACEMENT;
-    if (inputReplaceIllegalCharacters != null) {
-        fns.push(replaceStringsFunction({
-            replace: illegalStrings,
-            replaceWith: replaceIllegalCharacters
-        }));
-    }
-    if (inputReplaceIllegalDots != null) {
-        var replaceIllegalDotsWith = typeof inputReplaceIllegalDots === 'string' ? inputReplaceIllegalDots : replaceIllegalCharacters;
-        fns.push(replaceInvalidFilePathTypeSeparatorsInSlashPathFunction(replaceIllegalDotsWith));
-    }
+    fns.push(replaceStringsFunction({
+        replace: illegalStrings,
+        replaceWith: replaceIllegalCharacters
+    }));
+    var replaceIllegalDotsWith = typeof inputReplaceIllegalDots === 'string' ? inputReplaceIllegalDots : replaceIllegalCharacters;
+    fns.push(replaceInvalidFilePathTypeSeparatorsInSlashPathFunction(replaceIllegalDotsWith));
     if (throwError === true || !(inputReplaceIllegalCharacters || inputReplaceIllegalDots)) {
         fns.push(function(x) {
             if (!isValidSlashPath(x)) {
@@ -8805,31 +9138,27 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
  */ function expandSlashPathPathMatcherPartToDecisionFunctions(path) {
     var targetPathPartsInput = asArray(path);
     var indexMatchingDecisionFunctions = [];
-    targetPathPartsInput.forEach(function(part, index) {
+    targetPathPartsInput.forEach(function(part, _index) {
         switch(typeof part === "undefined" ? "undefined" : _type_of$c(part)){
             case 'number':
-                var matchPartFunction;
-                switch(part){
-                    case exports.SlashPathPathMatcherPartCode.WILDCARD:
-                        matchPartFunction = decisionFunction(true);
-                        break;
-                    default:
-                        // all other unknown numbers are treated as invalid and should never match
-                        matchPartFunction = decisionFunction(false);
-                        break;
+                {
+                    // Currently only SlashPathPathMatcherPartCode.WILDCARD (0) exists; treat as wildcard
+                    var matchPartFunction = decisionFunction(true);
+                    indexMatchingDecisionFunctions.push(matchPartFunction);
+                    break;
                 }
-                indexMatchingDecisionFunctions.push(matchPartFunction);
-                break;
             case 'string':
-                // break parts of the path into parts
-                var parts = slashPathParts(part);
-                parts.forEach(function(part, partIndex) {
-                    var matchPartFunction = function matchPartFunction(inputPart) {
-                        return inputPart === part;
-                    };
-                    indexMatchingDecisionFunctions.push(matchPartFunction);
-                });
-                break;
+                {
+                    // break parts of the path into parts
+                    var parts = slashPathParts(part);
+                    parts.forEach(function(part, _partIndex) {
+                        var matchPartFunction = function matchPartFunction(inputPart) {
+                            return inputPart === part;
+                        };
+                        indexMatchingDecisionFunctions.push(matchPartFunction);
+                    });
+                    break;
+                }
             case 'function':
                 indexMatchingDecisionFunctions.push(part);
                 break;
@@ -8875,7 +9204,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a SlashPathPathMatcher.
  *
- * @param config The configuration for the matcher.
+ * @param input - the matcher configuration, which may be a target path string, an array of path parts, or a full config object
  * @returns The matcher.
  */ function slashPathPathMatcher(input) {
     var _config_matchRemaining, _config_nonMatchingFillValue;
@@ -8956,7 +9285,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
     };
 }
 
-function _array_like_to_array$f(arr, len) {
+function _array_like_to_array$k(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;
@@ -8964,10 +9293,10 @@ function _array_like_to_array$f(arr, len) {
 function _array_with_holes$c(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$6(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$f(arr);
+function _array_without_holes$d(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$k(arr);
 }
-function _iterable_to_array$6(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$c(arr, i) {
@@ -8997,22 +9326,22 @@ 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$6() {
+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$c(arr, i) {
-    return _array_with_holes$c(arr) || _iterable_to_array_limit$c(arr, i) || _unsupported_iterable_to_array$f(arr, i) || _non_iterable_rest$c();
+    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$6(arr) {
-    return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$f(arr) || _non_iterable_spread$6();
+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 _unsupported_iterable_to_array$f(o, minLen) {
+function _unsupported_iterable_to_array$k(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$f(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$k(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$f(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$k(o, minLen);
 }
 /**
  * Returns true if the input string is a known HTTP protocol (`"http"` or `"https"`).
@@ -9043,7 +9372,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
 /**
  * This Regex is really only reliable for detecting that the TLD exists, but due to the nature of tld's
  * it cannot always be determined whether or not the part of the url is part of the tld or a subdomain.
- */ var WEBSITE_TLD_DETECTION_REGEX = /[^\/.\s]([^.\s]+)\.([^.\s]+)$/;
+ */ var WEBSITE_TLD_DETECTION_REGEX = /[^/.\s]([^.\s]+)\.([^.\s]+)$/;
 /**
  * Returns true if the input url has a website top level domain.
  *
@@ -9056,7 +9385,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
 }
 /**
  * Regex that matches a colon followed by digits, used to detect port numbers in URLs.
- */ var HAS_PORT_NUMBER_REGEX = /\:(\d+)/;
+ */ var HAS_PORT_NUMBER_REGEX = /:(\d+)/;
 /**
  * Returns true if the input string contains a port number (e.g., `:8080`).
  *
@@ -9176,7 +9505,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
     var baseWebUrl = removeWebProtocolPrefix(baseWebsiteUrl(basePath)); // remove prefix to prevent issues with slash paths
     var webUrl = mergeSlashPaths([
         baseWebUrl
-    ].concat(_to_consumable_array$6(asArray(paths))));
+    ].concat(_to_consumable_array$d(asArray(paths))));
     return setWebProtocolPrefix(webUrl, protocol);
 }
 /**
@@ -9221,8 +9550,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
         } : undefined
     ]);
     return function(input) {
-        var path = pathTransform(websitePathFromWebsiteUrl(input));
-        return path;
+        return pathTransform(websitePathFromWebsiteUrl(input));
     };
 }
 /**
@@ -9296,7 +9624,9 @@ function _unsupported_iterable_to_array$f(o, minLen) {
  * @param input - The domain-and-path string to split.
  * @returns A pair containing the domain and path.
  */ function websiteDomainAndPathPair(input) {
-    var _splitJoinRemainder = _sliced_to_array$c(splitJoinRemainder(input, '/', 2), 2), domain = _splitJoinRemainder[0], path = _splitJoinRemainder[1];
+    var result = splitJoinRemainder(input, '/', 2);
+    var domain = result[0];
+    var path = result[1]; // may be undefined if input has no path separator
     return {
         domain: domain,
         path: toAbsoluteSlashPathStartType(path !== null && path !== void 0 ? path : '/')
@@ -9448,6 +9778,31 @@ function _unsupported_iterable_to_array$f(o, minLen) {
     return domain;
 }
 
+function _array_like_to_array$j(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$c(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$j(arr);
+}
+function _iterable_to_array$c(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+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 _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 _unsupported_iterable_to_array$j(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$j(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$j(o, minLen);
+}
 /**
  * Converts an EmailParticipant object to a formatted string representation.
  * The format is: "name<email>" or "<email>" if no name is provided.
@@ -9484,19 +9839,18 @@ function _unsupported_iterable_to_array$f(o, minLen) {
  * @returns A combined array of EmailParticipant objects
  */ function coerceToEmailParticipants(param) {
     var _param_participants = param.participants, participants = _param_participants === void 0 ? [] : _param_participants, _param_emails = param.emails, emails = _param_emails === void 0 ? [] : _param_emails;
-    if (!(emails === null || emails === void 0 ? void 0 : emails.length)) {
+    if (!emails.length) {
         return participants;
     } else {
-        var _ref;
-        var participantEmails = (_ref = participants === null || participants === void 0 ? void 0 : participants.map(function(x) {
+        var participantEmails = participants.map(function(x) {
             return x.email;
-        })) !== null && _ref !== void 0 ? _ref : [];
+        });
         var emailsWithoutParticipants = excludeValuesFromArray(emails, participantEmails);
-        return participants.concat(emailsWithoutParticipants.map(function(email) {
+        return _to_consumable_array$c(participants).concat(_to_consumable_array$c(emailsWithoutParticipants.map(function(email) {
             return {
                 email: email
             };
-        }));
+        })));
     }
 }
 
@@ -9676,7 +10030,7 @@ function _is_native_reflect_construct$3() {
  * @param input - The value to check
  * @returns True if the input is a ServerError
  */ function isServerError(input) {
-    return input != null && (typeof input === "undefined" ? "undefined" : _type_of$b(input)) === 'object' && input.status != null && input.code != null;
+    return input != null && (typeof input === "undefined" ? "undefined" : _type_of$b(input)) === 'object' && 'status' in input && 'code' in input;
 }
 function partialServerError(messageOrError) {
     var serverError;
@@ -9799,9 +10153,9 @@ function _type_of$a(obj) {
 function toReadableError(inputError) {
     var error;
     if (inputError) {
-        if (inputError.code) {
+        if ('code' in inputError && inputError.code) {
             error = inputError;
-        } else if (inputError.data) {
+        } else if ('data' in inputError) {
             error = _object_spread$a({
                 code: DEFAULT_READABLE_ERROR_CODE
             }, inputError.data);
@@ -9812,9 +10166,10 @@ function toReadableError(inputError) {
                 _error: inputError
             };
         } else {
+            var _inputError_message;
             error = {
                 code: DEFAULT_READABLE_ERROR_CODE,
-                message: inputError.message || '',
+                message: (_inputError_message = inputError.message) !== null && _inputError_message !== void 0 ? _inputError_message : '',
                 _error: inputError
             };
         }
@@ -9848,7 +10203,8 @@ function toReadableError(inputError) {
  * @param input - The error or string to extract a message from
  * @returns The error message string, or null/undefined if not available
  */ function messageFromError(input) {
-    return ((typeof input === "undefined" ? "undefined" : _type_of$a(input)) === 'object' ? input.message : input) || input;
+    var _ref;
+    return (_ref = (typeof input === "undefined" ? "undefined" : _type_of$a(input)) === 'object' ? input.message : input) !== null && _ref !== void 0 ? _ref : input;
 }
 
 /**
@@ -9865,33 +10221,33 @@ function toReadableError(inputError) {
  * @param buffer - Buffer-like object to check. Only requires the `lastIndexOf` method.
  * @returns true if both PDF markers are found in the expected positions.
  */ function bufferHasValidPdfMarkings(buffer) {
-    return buffer.lastIndexOf('%PDF-') === 0 && buffer.lastIndexOf('%%EOF') > -1;
+    return buffer.lastIndexOf('%PDF-') === 0 && buffer.includes('%%EOF');
 }
 
-function _array_like_to_array$e(arr, len) {
+function _array_like_to_array$i(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$5(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$e(arr);
+function _array_without_holes$b(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$i(arr);
 }
-function _iterable_to_array$5(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$5() {
+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$5(arr) {
-    return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$e(arr) || _non_iterable_spread$5();
+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 _unsupported_iterable_to_array$e(o, minLen) {
+function _unsupported_iterable_to_array$i(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$e(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$i(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$e(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$i(o, minLen);
 }
 /*eslint @typescript-eslint/no-explicit-any:"off"*/ // any is used with intent here. using unknown can have strange effects in usage of forwardFunction and type capture.
 /**
@@ -9903,14 +10259,13 @@ function _unsupported_iterable_to_array$e(o, minLen) {
  * @param getter - A Getter that provides the target function
  * @returns A forwarding function with the same signature as the target
  */ function forwardFunction(getter) {
-    var fn = function fn() {
+    return function() {
         for(var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++){
             args[_key] = arguments[_key];
         }
         var forwardFn = getter();
-        return forwardFn.apply(void 0, _to_consumable_array$5(args));
+        return forwardFn.apply(void 0, _to_consumable_array$b(args));
     };
-    return fn;
 }
 /**
  * Creates a factory that produces forwarding functions which use the provided function
@@ -9932,6 +10287,31 @@ function _unsupported_iterable_to_array$e(o, minLen) {
  * Alias of MAP_IDENTITY, so `isMapIdentityFunction()` will return true for this function.
  */ var passThrough = MAP_IDENTITY;
 
+function _array_like_to_array$h(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$a(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$h(arr);
+}
+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$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$a(arr) {
+    return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$h(arr) || _non_iterable_spread$a();
+}
+function _unsupported_iterable_to_array$h(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$h(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$h(o, minLen);
+}
 /**
  * Builds an array from the intersection of an object's keys with the provided keys.
  * For each matching key, the associated value (or values) are added to the result array.
@@ -9940,7 +10320,7 @@ function _unsupported_iterable_to_array$e(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 = Array.from(keys);
+    var keysToApply = _to_consumable_array$a(keys);
     var applyArray = [];
     keysToApply.forEach(function(key) {
         var values = object[key];
@@ -10269,6 +10649,14 @@ function performTaskCountLoop(config) {
     });
 }
 
+function _array_like_to_array$g(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$9(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$g(arr);
+}
 function asyncGeneratorStep$8(gen, resolve, reject, _next, _throw, key, arg) {
     try {
         var info = gen[key](arg);
@@ -10298,6 +10686,23 @@ function _async_to_generator$8(fn) {
         });
     };
 }
+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$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$9(arr) {
+    return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$g(arr) || _non_iterable_spread$9();
+}
+function _unsupported_iterable_to_array$g(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$g(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$g(o, minLen);
+}
 function _ts_generator$8(thisArg, body) {
     var f, y, t, _ = {
         label: 0,
@@ -10452,7 +10857,7 @@ function _ts_generator$8(thisArg, body) {
                             case 2:
                                 verifiedIds = _state.sent();
                                 // concat identifiers
-                                ids = ids.concat(verifiedIds);
+                                ids = _to_consumable_array$9(ids).concat(_to_consumable_array$9(verifiedIds));
                                 return [
                                     3,
                                     1
@@ -10509,7 +10914,7 @@ function _ts_generator$8(thisArg, body) {
     };
 }
 
-function _array_like_to_array$d(arr, len) {
+function _array_like_to_array$f(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;
@@ -10517,6 +10922,12 @@ function _array_like_to_array$d(arr, len) {
 function _array_with_holes$b(arr) {
     if (Array.isArray(arr)) return arr;
 }
+function _array_without_holes$8(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$f(arr);
+}
+function _iterable_to_array$8(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
 function _iterable_to_array_limit$b(arr, i) {
     var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
     if (_i == null) return;
@@ -10544,16 +10955,22 @@ 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() {
+    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$d(arr, i) || _non_iterable_rest$b();
+    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 _unsupported_iterable_to_array$d(o, minLen) {
+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 _unsupported_iterable_to_array$f(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$d(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$f(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$d(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$f(o, minLen);
 }
 /**
  * Creates a bidirectional {@link PrimativeKeyDencoderMap} from the given values,
@@ -10590,7 +11007,10 @@ function _unsupported_iterable_to_array$d(o, minLen) {
 /**
  * Default fallback factory for {@link PrimativeKeyDencoderFunction} that always returns null,
  * causing an error to be thrown for unknown values.
- */ var PRIMATIVE_KEY_DENCODER_VALUE = function PRIMATIVE_KEY_DENCODER_VALUE(input) {
+ *
+ * @param _input - the unknown value to look up (ignored; always returns null)
+ * @returns always returns null to signal an unknown value
+ */ var PRIMATIVE_KEY_DENCODER_VALUE = function PRIMATIVE_KEY_DENCODER_VALUE(_input) {
     return null;
 };
 /**
@@ -10605,10 +11025,9 @@ function _unsupported_iterable_to_array$d(o, minLen) {
     var map = primativeKeyDencoderMap(config.values);
     var fn = function fn(input) {
         if (Array.isArray(input)) {
-            var values = filterMaybeArrayValues(input.map(function(x) {
+            return filterMaybeArrayValues(input.map(function(x) {
                 return map.get(x);
             }));
-            return values;
         } else {
             var value = map.get(input);
             if (value == null) {
@@ -10639,7 +11058,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
     var dencoderMap = dencoder._map;
     if (splitter) {
         dencoderMap._tuples.forEach(function(x) {
-            if (x[0].toString().indexOf(splitter) !== -1) {
+            if (x[0].toString().includes(splitter)) {
                 throw new Error("primativeKeyStringDencoder() encountered a value (".concat(x[0], ") that contains the splitter (").concat(splitter, ")."));
             }
         });
@@ -10651,11 +11070,11 @@ function _unsupported_iterable_to_array$d(o, minLen) {
             }
         });
     }
-    var joiner = splitter || '';
+    var joiner = splitter !== null && splitter !== void 0 ? splitter : '';
     var splitEncodedValues = splitter ? function(encodedValues) {
         return encodedValues.split(splitter);
     } : function(encodedValues) {
-        return Array.from(encodedValues);
+        return _to_consumable_array$8(encodedValues);
     };
     return function(input) {
         if (typeof input === 'string') {
@@ -10778,6 +11197,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  *
  * @param input - the address to format
  * @param addLinebreaks - whether to join parts with newlines (default `true`) or concatenate them directly
+ * @returns the formatted address string, or `undefined` if no meaningful parts are present
  */ function unitedStatesAddressString(input) {
     var addLinebreaks = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : true;
     var _ref = input !== null && input !== void 0 ? input : {}, name = _ref.name, phone = _ref.phone, line1 = _ref.line1, line2 = _ref.line2, zip = _ref.zip, state = _ref.state, city = _ref.city;
@@ -10811,6 +11231,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  * Useful for validating an address before submission or display.
  *
  * @param input - the address to validate
+ * @returns `true` if all required fields (line1, city, state, zip) are populated
  *
  * @example
  * ```ts
@@ -10838,6 +11259,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  * Only matches uppercase codes; lowercase input returns `false`.
  *
  * @param input - the string to test
+ * @returns `true` if the input matches a valid US state or territory code
  *
  * @example
  * ```ts
@@ -10866,6 +11288,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  *
  * @param a - first vector
  * @param b - second vector
+ * @returns `true` if both vectors are equal or both are nullish
  */ function isSameVector(a, b) {
     return a && b ? vectorsAreEqual(a, b) : a === b;
 }
@@ -10874,6 +11297,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  *
  * @param a - first vector
  * @param b - second vector
+ * @returns `true` if both vectors have identical `x` and `y` values
  */ function vectorsAreEqual(a, b) {
     return a.x === b.x && a.y === b.y;
 }
@@ -10884,6 +11308,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  * If a minimum is not specified for an axis, the input value is passed through unchanged.
  *
  * @param minSize - the minimum dimensions to enforce
+ * @returns a resize function that clamps each axis to the specified minimum
  *
  * @example
  * ```ts
@@ -10906,6 +11331,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  *
  * @param a - first rectangle
  * @param b - second rectangle
+ * @returns `true` if the rectangles share any interior area
  *
  * @example
  * ```ts
@@ -10937,6 +11363,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  *
  * @param a - first rectangle
  * @param b - second rectangle
+ * @returns the overlapping {@link Rectangle}, or `undefined` if the rectangles do not intersect
  */ function getOverlappingRectangle(a, b) {
     var xl = Math.max(a.bl.x, b.bl.x);
     var yl = Math.max(a.bl.y, b.bl.y);
@@ -10960,7 +11387,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
     };
 }
 
-function _array_like_to_array$c(arr, len) {
+function _array_like_to_array$e(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;
@@ -11043,19 +11470,19 @@ function _object_spread_props$4(target, source) {
     return target;
 }
 function _sliced_to_array$a(arr, i) {
-    return _array_with_holes$a(arr) || _iterable_to_array_limit$a(arr, i) || _unsupported_iterable_to_array$c(arr, i) || _non_iterable_rest$a();
+    return _array_with_holes$a(arr) || _iterable_to_array_limit$a(arr, i) || _unsupported_iterable_to_array$e(arr, i) || _non_iterable_rest$a();
 }
 function _type_of$9(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$e(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$e(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$e(o, minLen);
 }
 /**
  * Minimum valid latitude value (-90 degrees).
@@ -11077,8 +11504,11 @@ function _unsupported_iterable_to_array$c(o, minLen) {
  */ var TOTAL_LONGITUDE_RANGE = MAX_LONGITUDE_VALUE - MIN_LONGITUDE_VALUE;
 /**
  * Type guard that checks whether the input is a {@link LatLngPoint} by testing for `lat` and `lng` properties.
+ *
+ * @param input - the value to test
+ * @returns `true` if the input has both `lat` and `lng` properties
  */ function isLatLngPoint(input) {
-    return (typeof input === "undefined" ? "undefined" : _type_of$9(input)) === 'object' && input.lat != null && input.lng != null;
+    return (typeof input === "undefined" ? "undefined" : _type_of$9(input)) === 'object' && input != null && 'lat' in input && 'lng' in input;
 }
 /**
  * Creates a shallow copy of the point so that mutations to the copy do not affect the original.
@@ -11550,7 +11980,7 @@ function latLngString(lat, lng) {
     });
 }
 
-function _array_like_to_array$b(arr, len) {
+function _array_like_to_array$d(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;
@@ -11558,10 +11988,10 @@ function _array_like_to_array$b(arr, len) {
 function _array_with_holes$9(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$4(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$b(arr);
+function _array_without_holes$7(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$d(arr);
 }
-function _iterable_to_array$4(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$9(arr, i) {
@@ -11591,31 +12021,34 @@ 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$4() {
+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$9(arr, i) {
-    return _array_with_holes$9(arr) || _iterable_to_array_limit$9(arr, i) || _unsupported_iterable_to_array$b(arr, i) || _non_iterable_rest$9();
+    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$4(arr) {
-    return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$b(arr) || _non_iterable_spread$4();
+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 _type_of$8(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$b(o, minLen) {
+function _unsupported_iterable_to_array$d(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$d(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$d(o, minLen);
 }
 /**
  * Type guard that checks whether the input is a {@link LatLngBound} by testing for the presence of `sw` and `ne` properties.
+ *
+ * @param input - value to test
+ * @returns `true` if the input has `sw` and `ne` properties, indicating a bound
  */ function isLatLngBound(input) {
-    return (typeof input === "undefined" ? "undefined" : _type_of$8(input)) === 'object' && input.sw != null && input.ne != null;
+    return (typeof input === "undefined" ? "undefined" : _type_of$8(input)) === 'object' && input != null && 'sw' in input && 'ne' in input;
 }
 /**
  * Creates a deep copy of the bound so that mutations to the copy do not affect the original.
@@ -11839,7 +12272,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
                     sw: latLngPoint(sw),
                     ne: latLngPoint(ne)
                 };
-            } else if (input.length === 4) {
+            } else {
                 var _Math, _Math1, _Math2, _Math3;
                 var points = input.map(latLngPoint);
                 var lats = points.map(function(x) {
@@ -11848,10 +12281,10 @@ function _unsupported_iterable_to_array$b(o, minLen) {
                 var lngs = points.map(function(x) {
                     return x.lng;
                 });
-                var minLat = (_Math = Math).min.apply(_Math, _to_consumable_array$4(lats));
-                var maxLat = (_Math1 = Math).max.apply(_Math1, _to_consumable_array$4(lats));
-                var minLng = (_Math2 = Math).min.apply(_Math2, _to_consumable_array$4(lngs));
-                var maxLng = (_Math3 = Math).max.apply(_Math3, _to_consumable_array$4(lngs));
+                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));
                 bound = {
                     sw: latLngPoint([
                         minLat,
@@ -11863,12 +12296,12 @@ function _unsupported_iterable_to_array$b(o, minLen) {
                     ])
                 };
             }
-        } else if (input && inputNe) {
+        } else if (inputNe) {
             bound = {
                 sw: input,
                 ne: inputNe
             };
-        } else if (input.sw && input.ne) {
+        } else if (isLatLngBound(input)) {
             bound = input;
         }
         if (!bound) {
@@ -12072,6 +12505,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
  * but `null === undefined` is `false`.
  *
  * @param compare - the comparator to wrap
+ * @returns a new comparator that handles nullish values safely before delegating to the wrapped comparator
  *
  * @example
  * ```ts
@@ -12094,6 +12528,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
  * @param a - first value to compare
  * @param b - second value to compare
  * @param compare - the equality comparator for non-nullish values
+ * @returns `true` if the values are considered equal
  *
  * @example
  * ```ts
@@ -12114,6 +12549,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
  *
  * @param readValues - extracts the comparable value from each item
  * @param equalityComparator - compares the extracted values for equality
+ * @returns a function that compares two items by their extracted values
  */ function compareEqualityWithValueFromItemsFunction(readValues, equalityComparator) {
     return compareEqualityWithValueFromItemsFunctionFactory(readValues)(equalityComparator);
 }
@@ -12124,6 +12560,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
  * with varying comparison strategies.
  *
  * @param readValues - extracts the comparable value from each item
+ * @returns a factory function that accepts an equality comparator and produces a comparison function
  *
  * @example
  * ```ts
@@ -12150,7 +12587,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
     return fn;
 }
 
-function _array_like_to_array$a(arr, len) {
+function _array_like_to_array$c(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;
@@ -12193,25 +12630,25 @@ function _non_iterable_rest$8() {
     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 _sliced_to_array$8(arr, i) {
-    return _array_with_holes$8(arr) || _iterable_to_array_limit$8(arr, i) || _unsupported_iterable_to_array$a(arr, i) || _non_iterable_rest$8();
+    return _array_with_holes$8(arr) || _iterable_to_array_limit$8(arr, i) || _unsupported_iterable_to_array$c(arr, i) || _non_iterable_rest$8();
 }
 function _type_of$7(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
-function _unsupported_iterable_to_array$a(o, minLen) {
+function _unsupported_iterable_to_array$c(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$c(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$c(o, minLen);
 }
 /**
  * Regular expression for validating ISO8601 date strings.
  *
  * TODO(FUTURE): Need to improve to support negative years.
- */ var ISO_8601_DATE_STRING_REGEX = /(\d{4,})-(\d{2})-(\d{2})T(\d{2})\:(\d{2})\:(\d{2})(Z|[+-](\d{2})\:(\d{2}))?/;
+ */ var ISO_8601_DATE_STRING_REGEX = /(\d{4,})-(\d{2})-(\d{2})T(\d{2}):(\d{2}):(\d{2})(Z|[+-](\d{2}):(\d{2}))?/;
 /**
  * Determines if a string is a valid ISO8601 date string.
  *
@@ -12332,8 +12769,7 @@ function isConsideredUtcTimezoneString(timezone) {
     if (year.length === 2) {
         year = "20".concat(year);
     }
-    var result = "".concat(year, "-").concat(month, "-").concat(day);
-    return result;
+    return "".concat(year, "-").concat(month, "-").concat(day);
 }
 function dateFromDateOrTimeMillisecondsNumber(input) {
     if (input == null) {
@@ -12559,7 +12995,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * @param day - Optional base date to use (defaults to the current date)
  * @returns A Date with the time set to the specified minute of day
  */ function dateFromMinuteOfDay(minuteOfDay, day) {
-    var date = day || new Date();
+    var date = day !== null && day !== void 0 ? day : new Date();
     var _minutesToHoursAndMinutes = minutesToHoursAndMinutes(asMinuteOfDay(minuteOfDay)), hour = _minutesToHoursAndMinutes.hour, minute = _minutesToHoursAndMinutes.minute;
     date.setHours(hour, minute, 0, 0);
     return date;
@@ -12613,6 +13049,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * every 1 hour at minute 30), which means intervals won't be exactly N minutes apart.
  *
  * @param inputMinutes - interval in minutes between executions
+ * @returns a cron expression string that approximates the requested interval
  *
  * @example
  * ```ts
@@ -12639,6 +13076,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  *
  * @param contextValue - the reference value to compare against
  * @param fn - the equality comparator
+ * @returns a function that checks whether a given value equals the captured reference
  *
  * @example
  * ```ts
@@ -12661,6 +13099,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  *
  * @param contextValue - the reference value to compare against
  * @param fn - the equality comparator
+ * @returns a function that checks whether all input values equal the captured reference
  *
  * @example
  * ```ts
@@ -12692,6 +13131,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  *
  * @param values - the values to compare
  * @param fn - the equality comparator
+ * @returns `true` if all values are equal to each other, or if fewer than two values are provided
  *
  * @example
  * ```ts
@@ -12717,6 +13157,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * Enables fast lookup of labeled items by their value key.
  *
  * @param values - array of labeled values to index
+ * @returns a Map keyed by each item's value for fast lookup
  *
  * @example
  * ```ts
@@ -12741,6 +13182,7 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  *
  * @param key - unique identifier for the modifier
  * @param modify - function that mutates the target value
+ * @returns a new {@link Modifier} pairing the key with the modify function
  *
  * @example
  * ```ts
@@ -12757,8 +13199,9 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
 }
 /**
  * A no-operation modifier that does nothing to the input. Useful as a default/fallback.
- */ // eslint-disable-next-line @typescript-eslint/no-explicit-any
-var NOOP_MODIFIER = function NOOP_MODIFIER() {
+ *
+ * @returns undefined (no mutation is performed)
+ */ var NOOP_MODIFIER = function NOOP_MODIFIER() {
     return undefined;
 };
 /**
@@ -12768,6 +13211,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  *
  * @param modifiers - modifier(s) to add
  * @param map - existing map to add to, or undefined to create a new one
+ * @returns the modifier map with the new modifiers added
  *
  * @example
  * ```ts
@@ -12776,9 +13220,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  * map.has('double'); // true
  * ```
  */ function addModifiers(modifiers, map) {
-    if (!map) {
-        map = new Map();
-    }
+    map !== null && map !== void 0 ? map : map = new Map();
     forEachWithArray(modifiers, function(modifier) {
         return map.set(modifier.key, modifier);
     });
@@ -12789,6 +13231,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  *
  * @param modifiers - modifier(s) whose keys should be removed
  * @param map - the map to remove from
+ * @returns the modifier map with the specified modifiers removed
  *
  * @example
  * ```ts
@@ -12813,6 +13256,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  * Returns {@link NOOP_MODIFIER} if the map is nullish or empty.
  *
  * @param map - the modifier map to convert
+ * @returns a single modifier function that applies all mapped modifiers, or {@link NOOP_MODIFIER} if empty
  *
  * @example
  * ```ts
@@ -12833,6 +13277,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  * Returns undefined if no map is provided, allowing callers to distinguish "no modifiers" from "empty modifiers".
  *
  * @param map - the modifier map to convert
+ * @returns a composed modifier function, or `undefined` if no map is provided
  */ function maybeModifierMapToFunction(map) {
     var fn;
     if (map != null) {
@@ -12854,6 +13299,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  * Returns {@link NOOP_MODIFIER} if the array is empty or nullish.
  *
  * @param modifiers - array of modifier functions to merge
+ * @returns a single modifier function that applies all provided modifiers, or {@link NOOP_MODIFIER} if empty
  *
  * @example
  * ```ts
@@ -12874,6 +13320,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  * If only one modifier is provided, returns it directly without wrapping.
  *
  * @param modifiers - array of modifier functions to merge, or undefined
+ * @returns a composed modifier function, the single modifier if only one provided, or `undefined` if input is nullish
  */ function maybeMergeModifiers(modifiers) {
     var result = undefined;
     if (modifiers != null) {
@@ -12911,6 +13358,7 @@ var NOOP_MODIFIER = function NOOP_MODIFIER() {
  * Operates via simple string splitting rather than URL parsing, so it works with partial or non-standard URLs.
  *
  * @param url - the full URL string to clean
+ * @returns the URL string with query parameters and hash fragments removed
  *
  * @example
  * ```ts
@@ -13167,17 +13615,12 @@ function _ts_generator$7(thisArg, body) {
                     result = _state.sent();
                     return [
                         3,
-                        4
+                        3
                     ];
                 case 2:
-                    return [
-                        4,
-                        getValueFromGetter(defaultValue)
-                    ];
+                    result = getValueFromGetter(defaultValue);
+                    _state.label = 3;
                 case 3:
-                    result = _state.sent();
-                    _state.label = 4;
-                case 4:
                     return [
                         2,
                         result
@@ -13278,6 +13721,31 @@ function _ts_generator$7(thisArg, body) {
     };
 }
 
+function _array_like_to_array$b(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$6(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$b(arr);
+}
+function _iterable_to_array$6(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+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 _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 _unsupported_iterable_to_array$b(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$b(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);
+}
 /**
  * Creates an {@link ObjectDeltaArrayCompressor} that can compress and expand arrays of objects using delta encoding.
  *
@@ -13289,7 +13757,7 @@ function _ts_generator$7(thisArg, body) {
  */ function objectDeltaArrayCompressor(config) {
     var _equalityChecker = config.equalityChecker;
     var assignKnownValuesToCopy = assignValuesToPOJOFunction({
-        keysFilter: Array.from(_equalityChecker._fields.keys()),
+        keysFilter: _to_consumable_array$6(_equalityChecker._fields.keys()),
         valueFilter: exports.KeyValueTypleValueFilter.NULL
     });
     function compress(uncompressed) {
@@ -13326,7 +13794,7 @@ function _ts_generator$7(thisArg, body) {
         });
         return result;
     }
-    var allKeys = Array.from(_equalityChecker._fields.keys());
+    var allKeys = _to_consumable_array$6(_equalityChecker._fields.keys());
     function expand(compressed) {
         if (compressed.length === 0) {
             return [];
@@ -13452,12 +13920,28 @@ function _type_of$6(obj) {
     if (obj != null && (typeof obj === "undefined" ? "undefined" : _type_of$6(obj)) === 'object') {
         var keys = Object.keys(obj);
         if (keys.length > 0) {
-            for(var i = 0; i < keys.length; i += 1){
-                var key = keys[i];
-                var value = obj[key];
-                var isEmpty = (typeof value === "undefined" ? "undefined" : _type_of$6(value)) === 'object' ? objectIsEmpty(value) : !hasValueOrNotEmpty(value);
-                if (!isEmpty) {
-                    return false;
+            var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+            try {
+                for(var _iterator = keys[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+                    var key = _step.value;
+                    var value = obj[key];
+                    var isEmpty = (typeof value === "undefined" ? "undefined" : _type_of$6(value)) === 'object' ? objectIsEmpty(value) : !hasValueOrNotEmpty(value);
+                    if (!isEmpty) {
+                        return false;
+                    }
+                }
+            } catch (err) {
+                _didIteratorError = true;
+                _iteratorError = err;
+            } finally{
+                try {
+                    if (!_iteratorNormalCompletion && _iterator.return != null) {
+                        _iterator.return();
+                    }
+                } finally{
+                    if (_didIteratorError) {
+                        throw _iteratorError;
+                    }
                 }
             }
         }
@@ -13519,8 +14003,7 @@ function dateFromDateOrTimeSecondsNumber(input) {
     var parsedExpiresFromDate = expiresFromDate != null ? dateFromDateOrTimeMillisecondsNumber(expiresFromDate) : null;
     function getNow(nowOverride) {
         var _ref;
-        var now = (_ref = nowOverride !== null && nowOverride !== void 0 ? nowOverride : inputNow) !== null && _ref !== void 0 ? _ref : new Date();
-        return now;
+        return (_ref = nowOverride !== null && nowOverride !== void 0 ? nowOverride : inputNow) !== null && _ref !== void 0 ? _ref : new Date();
     }
     function hasExpired(nowOverride) {
         var defaultIfNoExpirationDate = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false;
@@ -13635,30 +14118,30 @@ function dateFromDateOrTimeSecondsNumber(input) {
     return firstExpired !== -1;
 }
 
-function _array_like_to_array$9(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$3(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$9(arr);
+function _array_without_holes$5(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$a(arr);
 }
-function _iterable_to_array$3(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$3() {
+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$3(arr) {
-    return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$9(arr) || _non_iterable_spread$3();
+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 _unsupported_iterable_to_array$9(o, minLen) {
+function _unsupported_iterable_to_array$a(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$9(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$9(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$a(o, minLen);
 }
 /**
  * Returns the day of the week for the input date.
@@ -13784,9 +14267,9 @@ function _unsupported_iterable_to_array$9(o, minLen) {
     if (sundayFirst) {
         dayOfWeekNames = [
             sunday
-        ].concat(_to_consumable_array$3(days));
+        ].concat(_to_consumable_array$5(days));
     } else {
-        dayOfWeekNames = _to_consumable_array$3(days).concat([
+        dayOfWeekNames = _to_consumable_array$5(days).concat([
             sunday
         ]);
     }
@@ -13888,6 +14371,20 @@ function _unsupported_iterable_to_array$9(o, minLen) {
     return result;
 }
 
+/**
+ * Converts the input number of milliseconds to whole minutes by flooring the result.
+ *
+ * @param milliseconds - The number of milliseconds to convert.
+ * @returns The equivalent whole minutes, rounded down.
+ *
+ * @example
+ * ```ts
+ * millisecondsToMinutes(180000); // 3
+ * millisecondsToMinutes(90000);  // 1
+ * ```
+ */ function millisecondsToMinutes(milliseconds) {
+    return Math.floor(milliseconds / MS_IN_MINUTE);
+}
 /**
  * Converts the input number of milliseconds to the equivalent in minutes and seconds.
  *
@@ -14239,6 +14736,9 @@ function waitForMs(ms, value) {
  * Polls at a regular interval until a condition is met or the maximum number of attempts is reached.
  *
  * @param config - Polling configuration including check function, wait interval, and max attempts.
+ * @param config.check - predicate function that returns true when the polling condition has been satisfied
+ * @param config.wait - milliseconds to wait between polling iterations; defaults to 250
+ * @param config.timesToGiveup - maximum number of polling iterations before giving up; defaults to `Number.MAX_SAFE_INTEGER`
  * @returns A Promise that resolves when the check condition returns `true` or the max attempts are exhausted.
  */ function poll(param) {
     var check = param.check, _param_wait = param.wait, wait = _param_wait === void 0 ? 250 : _param_wait, _param_timesToGiveup = param.timesToGiveup, timesToGiveup = _param_timesToGiveup === void 0 ? Number.MAX_SAFE_INTEGER : _param_timesToGiveup;
@@ -14380,7 +14880,7 @@ var PROMISE_REF_NUMBER = 0;
     return ref;
 }
 
-function _array_like_to_array$8(arr, len) {
+function _array_like_to_array$9(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;
@@ -14388,8 +14888,8 @@ function _array_like_to_array$8(arr, len) {
 function _array_with_holes$7(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _array_without_holes$2(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$8(arr);
+function _array_without_holes$4(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$9(arr);
 }
 function asyncGeneratorStep$4(gen, resolve, reject, _next, _throw, key, arg) {
     try {
@@ -14433,7 +14933,7 @@ function _define_property$9(obj, key, value) {
     }
     return obj;
 }
-function _iterable_to_array$2(iter) {
+function _iterable_to_array$4(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
 function _iterable_to_array_limit$7(arr, i) {
@@ -14463,7 +14963,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$2() {
+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 _object_spread$5(target) {
@@ -14501,18 +15001,18 @@ function _object_spread_props$2(target, source) {
     return target;
 }
 function _sliced_to_array$7(arr, i) {
-    return _array_with_holes$7(arr) || _iterable_to_array_limit$7(arr, i) || _unsupported_iterable_to_array$8(arr, i) || _non_iterable_rest$7();
+    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$2(arr) {
-    return _array_without_holes$2(arr) || _iterable_to_array$2(arr) || _unsupported_iterable_to_array$8(arr) || _non_iterable_spread$2();
+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 _unsupported_iterable_to_array$8(o, minLen) {
+function _unsupported_iterable_to_array$9(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$8(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$9(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$8(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$9(o, minLen);
 }
 function _ts_generator$4(thisArg, body) {
     var f, y, t, _ = {
@@ -14613,20 +15113,6 @@ function _ts_generator$4(thisArg, body) {
         };
     }
 }
-function _ts_values(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function() {
-            if (o && i >= o.length) o = void 0;
-            return {
-                value: o && o[i++],
-                done: !o
-            };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-}
 /**
  * Runs a single async task and returns the resulting value. Always configured to throw on failure.
  *
@@ -14885,7 +15371,7 @@ function _performAsyncTask(_0, _1) {
                                     2,
                                     [
                                         value
-                                    ].concat(_to_consumable_array$2(result))
+                                    ].concat(_to_consumable_array$4(result))
                                 ];
                             }
                             retriesRemaining = retriesAllowed - tryNumber;
@@ -14919,7 +15405,7 @@ function _performAsyncTask(_0, _1) {
             config = _arguments.length > 2 && _arguments[2] !== void 0 ? _arguments[2] : {};
             inputThrowError = config.throwError, inputRetriesAllowed = config.retriesAllowed, _config_retryWait = config.retryWait, retryWait = _config_retryWait === void 0 ? 200 : _config_retryWait, beforeRetry = config.beforeRetry;
             throwError = inputThrowError !== null && inputThrowError !== void 0 ? inputThrowError : true; // throw errors by default
-            retriesAllowed = inputRetriesAllowed ? inputRetriesAllowed : 0;
+            retriesAllowed = inputRetriesAllowed || 0;
             return [
                 2,
                 iterateTask(value, 0)
@@ -14989,10 +15475,10 @@ function _performAsyncTask(_0, _1) {
  * with configurable concurrency limits and non-concurrent key constraints.
  *
  * @param config - Configuration for the task factory, parallelism, and concurrency behavior.
- * @returns A function that accepts a task input factory and returns a Promise resolving when all tasks complete.
+ * @returns a function that accepts a task input factory and returns a Promise that resolves when all tasks complete
  */ function performTasksFromFactoryInParallelFunction(config) {
     /**
-     * By default returns null
+     * @returns null
      */ var defaultNonConcurrentTaskKeyFactory = function defaultNonConcurrentTaskKeyFactory() {
         return null;
     };
@@ -15003,133 +15489,95 @@ function _performAsyncTask(_0, _1) {
         return new Promise(function(resolve, reject) {
             var requestMoreTasks = function requestMoreTasks(parallelIndex) {
                 return _async_to_generator$4(function() {
-                    var promiseRef, waited;
+                    var promiseRef;
                     return _ts_generator$4(this, function(_state) {
-                        switch(_state.label){
-                            case 0:
-                                if (!isOutOfTasks) return [
-                                    3,
-                                    1
-                                ];
-                                return [
-                                    2
-                                ];
-                            case 1:
-                                promiseRef = promiseReference();
-                                if (!isFulfillingTask) return [
-                                    3,
-                                    3
-                                ];
+                        if (isOutOfTasks) {
+                            return [
+                                2
+                            ];
+                        } else {
+                            promiseRef = promiseReference();
+                            if (isFulfillingTask) {
                                 requestTasksQueue.push([
                                     parallelIndex,
                                     promiseRef
                                 ]);
-                                return [
-                                    4,
-                                    promiseRef.promise
-                                ];
-                            case 2:
-                                waited = _state.sent();
-                                return [
-                                    2,
-                                    waited
-                                ];
-                            case 3:
-                                fulfillRequestMoreTasks(parallelIndex, promiseRef);
-                                _state.label = 4;
-                            case 4:
                                 return [
                                     2,
                                     promiseRef.promise
                                 ];
-                            case 5:
-                                return [
-                                    2
-                                ];
+                            } else {
+                                void fulfillRequestMoreTasks(parallelIndex, promiseRef);
+                            }
+                            return [
+                                2,
+                                promiseRef.promise
+                            ];
                         }
                     });
                 })();
             };
+            var tryAcquireTask = function tryAcquireTask(candidate) {
+                var candidateIndex = candidate[2];
+                if (visitedTaskIndexes.has(candidateIndex)) {
+                    return 'skip';
+                }
+                var keys = candidate[1];
+                var keyOfTaskCurrentlyInUse = setContainsAnyValue(currentParellelTaskKeys, keys);
+                if (keyOfTaskCurrentlyInUse) {
+                    keys.forEach(function(key) {
+                        return waitingConcurrentTasks.addTuples(key, candidate);
+                    });
+                    return 'defer';
+                }
+                addToSet(currentParellelTaskKeys, keys);
+                return 'acquired';
+            };
             var getNextTask = function getNextTask(parallelIndex) {
                 return _async_to_generator$4(function() {
-                    var _loop, nextTask, _ret;
+                    var nextTask, result;
                     return _ts_generator$4(this, function(_state) {
                         switch(_state.label){
-                            case 0:
-                                _loop = function() {
-                                    var nextTaskTuple, nextTaskTupleIndex, keys, keyOfTaskCurrentlyInUse;
-                                    return _ts_generator$4(this, function(_state) {
-                                        switch(_state.label){
-                                            case 0:
-                                                if (!(!isOutOfTasks && incompleteTasks.length === 0)) return [
-                                                    3,
-                                                    2
-                                                ];
-                                                return [
-                                                    4,
-                                                    requestMoreTasks(parallelIndex)
-                                                ];
-                                            case 1:
-                                                nextTask = _state.sent();
-                                                _state.label = 2;
-                                            case 2:
-                                                nextTask = nextTask !== null && nextTask !== void 0 ? nextTask : incompleteTasks.pop();
-                                                if (nextTask != null) {
-                                                    nextTaskTuple = nextTask;
-                                                    nextTaskTupleIndex = nextTaskTuple[2];
-                                                    if (visitedTaskIndexes.has(nextTaskTupleIndex)) {
-                                                        // already run. Ignore.
-                                                        nextTask = undefined;
-                                                    } else {
-                                                        keys = nextTaskTuple[1];
-                                                        keyOfTaskCurrentlyInUse = setContainsAnyValue(currentParellelTaskKeys, keys);
-                                                        if (keyOfTaskCurrentlyInUse) {
-                                                            keys.forEach(function(key) {
-                                                                return waitingConcurrentTasks.addTuples(key, nextTaskTuple);
-                                                            }); // add to each key as waiting
-                                                            nextTask = undefined; // clear to continue loop
-                                                        } else {
-                                                            addToSet(currentParellelTaskKeys, keys); // add to the current task keys, exit loop
-                                                            return [
-                                                                2,
-                                                                "break"
-                                                            ];
-                                                        }
-                                                    }
-                                                } else {
-                                                    return [
-                                                        2,
-                                                        "break" // no tasks remaining, break.
-                                                    ];
-                                                }
-                                                return [
-                                                    2
-                                                ];
-                                        }
-                                    });
-                                };
+                            case 0:
                                 nextTask = undefined;
                                 _state.label = 1;
                             case 1:
                                 if (!!nextTask) return [
+                                    3,
+                                    4
+                                ];
+                                if (!(!isOutOfTasks && incompleteTasks.length === 0)) return [
                                     3,
                                     3
                                 ];
                                 return [
-                                    5,
-                                    _ts_values(_loop())
+                                    4,
+                                    requestMoreTasks(parallelIndex)
                                 ];
                             case 2:
-                                _ret = _state.sent();
-                                if (_ret === "break") return [
-                                    3,
-                                    3
-                                ];
+                                nextTask = _state.sent();
+                                _state.label = 3;
+                            case 3:
+                                nextTask = nextTask !== null && nextTask !== void 0 ? nextTask : incompleteTasks.pop();
+                                if (nextTask == null) {
+                                    return [
+                                        3,
+                                        4
+                                    ];
+                                }
+                                result = tryAcquireTask(nextTask);
+                                if (result === 'acquired') {
+                                    return [
+                                        3,
+                                        4
+                                    ];
+                                }
+                                nextTask = undefined;
                                 return [
                                     3,
                                     1
                                 ];
-                            case 3:
+                            case 4:
                                 if (nextTask) {
                                     // mark to prevent running again/concurrent runs
                                     visitedTaskIndexes.add(nextTask[2]);
@@ -15142,7 +15590,7 @@ function _performAsyncTask(_0, _1) {
                     });
                 })();
             };
-            var onTaskCompleted = function onTaskCompleted(task, parallelIndex) {
+            var onTaskCompleted = function onTaskCompleted(task, _parallelIndex) {
                 var keys = task[1];
                 var indexesPushed = new Set();
                 keys.forEach(function(key) {
@@ -15202,7 +15650,7 @@ function _performAsyncTask(_0, _1) {
                                         ];
                                     }).reverse(); // reverse to use push/pop
                                     baseI += newTaskEntries.length;
-                                    incompleteTasks = _to_consumable_array$2(newTaskEntries).concat(_to_consumable_array$2(incompleteTasks)); // new tasks go to the front of the stack
+                                    incompleteTasks = _to_consumable_array$4(newTaskEntries).concat(_to_consumable_array$4(incompleteTasks)); // new tasks go to the front of the stack
                                 }
                                 _state.label = 2;
                             case 2:
@@ -15221,10 +15669,10 @@ function _performAsyncTask(_0, _1) {
                                 _state.sent();
                                 _state.label = 4;
                             case 4:
-                                if (!isFulfillingTask && requestTasksQueue.length) {
+                                if (requestTasksQueue.length) {
                                     nextItemInQueue = requestTasksQueue.pop();
                                     if (nextItemInQueue) {
-                                        fulfillRequestMoreTasks(nextItemInQueue[0], nextItemInQueue[1]);
+                                        void fulfillRequestMoreTasks(nextItemInQueue[0], nextItemInQueue[1]);
                                     }
                                 }
                                 return [
@@ -15263,10 +15711,10 @@ function _performAsyncTask(_0, _1) {
                                     // build/start promise
                                     promise = taskFactory(nextTask[0], currentRunIndex, nextTask[1]);
                                     currentRunIndex += 1;
-                                    promise.then(function() {
+                                    void promise.then(function() {
                                         onTaskCompleted(nextTask);
                                         setTimeout(function() {
-                                            return dispatchNextPromise(parallelIndex);
+                                            return void dispatchNextPromise(parallelIndex);
                                         }, waitBetweenTasks);
                                     }, function(e) {
                                         hasEncounteredFailure = true;
@@ -15290,7 +15738,7 @@ function _performAsyncTask(_0, _1) {
             }
             // run the initial promises
             range(0, maxPromisesToRunAtOneTime).forEach(function(parallelIndex) {
-                dispatchNextPromise(parallelIndex);
+                void dispatchNextPromise(parallelIndex);
             });
         });
     };
@@ -15442,7 +15890,7 @@ function _object_spread$4(target) {
     var enabled = true;
     setConfig(initialConfig, true);
     function _checkRemainingReset() {
-        if (nextResetAt && isPast(nextResetAt)) {
+        if (isPast(nextResetAt)) {
             reset();
         }
     }
@@ -15671,61 +16119,97 @@ function _ts_generator$3(thisArg, body) {
     var promiseFactories = config.promiseFactories, defaultSuccessOnMaybe = config.successOnMaybe, defaultThrowErrors = config.throwErrors;
     return function(input, config) {
         return _async_to_generator$3(function() {
-            var _ref, inputSuccessOnMaybe, inputThrowErrors, successOnMaybe, throwErrors, result, i, nextPromise, e;
+            var _ref, inputSuccessOnMaybe, inputThrowErrors, successOnMaybe, throwErrors, result, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, factory, nextPromise, e, err;
             return _ts_generator$3(this, function(_state) {
                 switch(_state.label){
                     case 0:
                         _ref = config !== null && config !== void 0 ? config : {}, inputSuccessOnMaybe = _ref.successOnMaybe, inputThrowErrors = _ref.throwErrors;
                         successOnMaybe = inputSuccessOnMaybe !== null && inputSuccessOnMaybe !== void 0 ? inputSuccessOnMaybe : defaultSuccessOnMaybe;
                         throwErrors = inputThrowErrors !== null && inputThrowErrors !== void 0 ? inputThrowErrors : defaultThrowErrors;
-                        i = 0;
+                        _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
                         _state.label = 1;
                     case 1:
-                        if (!(i < promiseFactories.length)) return [
-                            3,
-                            6
-                        ];
+                        _state.trys.push([
+                            1,
+                            8,
+                            9,
+                            10
+                        ]);
+                        _iterator = promiseFactories[Symbol.iterator]();
                         _state.label = 2;
                     case 2:
+                        if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
+                            3,
+                            7
+                        ];
+                        factory = _step.value;
+                        _state.label = 3;
+                    case 3:
                         _state.trys.push([
-                            2,
-                            4,
+                            3,
+                            5,
                             ,
-                            5
+                            6
                         ]);
-                        nextPromise = promiseFactories[i](input);
+                        nextPromise = factory(input);
                         return [
                             4,
                             nextPromise
                         ];
-                    case 3:
+                    case 4:
                         result = _state.sent();
                         if (result != null || successOnMaybe) {
                             return [
                                 3,
-                                6
+                                7
                             ]; // end loop early
                         }
                         return [
                             3,
-                            5
+                            6
                         ];
-                    case 4:
+                    case 5:
                         e = _state.sent();
                         if (throwErrors) {
                             throw e; // throw the error if requested
                         }
                         return [
                             3,
-                            5
+                            6
                         ];
-                    case 5:
-                        i += 1;
+                    case 6:
+                        _iteratorNormalCompletion = true;
                         return [
                             3,
-                            1
+                            2
                         ];
-                    case 6:
+                    case 7:
+                        return [
+                            3,
+                            10
+                        ];
+                    case 8:
+                        err = _state.sent();
+                        _didIteratorError = true;
+                        _iteratorError = err;
+                        return [
+                            3,
+                            10
+                        ];
+                    case 9:
+                        try {
+                            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                                _iterator.return();
+                            }
+                        } finally{
+                            if (_didIteratorError) {
+                                throw _iteratorError;
+                            }
+                        }
+                        return [
+                            7
+                        ];
+                    case 10:
                         return [
                             2,
                             result
@@ -15736,7 +16220,7 @@ function _ts_generator$3(thisArg, body) {
     };
 }
 
-function _array_like_to_array$7(arr, len) {
+function _array_like_to_array$8(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;
@@ -15848,15 +16332,15 @@ function _object_spread_props$1(target, source) {
     return target;
 }
 function _sliced_to_array$6(arr, i) {
-    return _array_with_holes$6(arr) || _iterable_to_array_limit$6(arr, i) || _unsupported_iterable_to_array$7(arr, i) || _non_iterable_rest$6();
+    return _array_with_holes$6(arr) || _iterable_to_array_limit$6(arr, i) || _unsupported_iterable_to_array$8(arr, i) || _non_iterable_rest$6();
 }
-function _unsupported_iterable_to_array$7(o, minLen) {
+function _unsupported_iterable_to_array$8(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$7(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$8(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$7(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$8(o, minLen);
 }
 function _ts_generator$2(thisArg, body) {
     var f, y, t, _ = {
@@ -16207,6 +16691,9 @@ function _is_native_reflect_construct$2() {
             case 'paused':
                 result = null;
                 break;
+            case 'cancelled':
+                result = null;
+                break;
         }
         return result;
     };
@@ -16298,7 +16785,7 @@ function _is_native_reflect_construct$2() {
  * @param timer - The timer to toggle
  * @param toggleRun - If provided, forces the timer to run (true) or stop (false). Otherwise toggles the current state.
  */ function toggleTimerRunning(timer, toggleRun) {
-    toggleRun = toggleRun != null ? toggleRun : timer.state !== 'running';
+    toggleRun = toggleRun !== null && toggleRun !== void 0 ? toggleRun : timer.state !== 'running';
     if (toggleRun) {
         timer.start();
     } else {
@@ -16307,6 +16794,9 @@ function _is_native_reflect_construct$2() {
 }
 /**
  * Returns the approximate end date of the given timer. If a timer is already complete, it returns the time for now.
+ *
+ * @param timer - the timer whose end date to approximate
+ * @returns a Date representing the estimated end time, or null if no duration remains
  */ function approximateTimerEndDate(timer) {
     var durationRemaining = timer.durationRemaining;
     if (durationRemaining != null) {
@@ -16360,7 +16850,7 @@ function dateFromLogicalDate(logicalDate) {
     return isLogicalDateStringCode;
 }
 
-function _array_like_to_array$6(arr, len) {
+function _array_like_to_array$7(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;
@@ -16368,6 +16858,9 @@ function _array_like_to_array$6(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);
@@ -16375,6 +16868,9 @@ 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;
@@ -16402,20 +16898,26 @@ 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$6(arr, i) || _non_iterable_rest$5();
+    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;
 }
-function _unsupported_iterable_to_array$6(o, minLen) {
+function _unsupported_iterable_to_array$7(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$6(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$7(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$6(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$7(o, minLen);
 }
 /**
  * Performs a deep equality comparison between two values.
@@ -16438,76 +16940,90 @@ function _unsupported_iterable_to_array$6(o, minLen) {
  * @param pojoFilter - Filter function applied to each value before comparison
  * @returns `true` if the filtered values are deeply equal
  */ function areEqualPOJOValuesUsingPojoFilter(a, b, pojoFilter) {
+    var result;
     // check self
     if (a === b) {
-        return true;
-    }
-    // run pojo filter before comparison
-    a = pojoFilter(a, true);
-    b = pojoFilter(b, true);
-    // check one value is nullish and other is not
-    if ((a == null || b == null) && (a || b)) {
-        return false;
-    }
-    // object check
-    if ((typeof a === "undefined" ? "undefined" : _type_of$3(a)) === 'object') {
-        // check if they are arrays
-        if (isIterable(a, false)) {
-            if (Array.isArray(a)) {
-                if (a.length !== b.length) {
-                    return false;
-                }
-                var firstInequalityIndex = a.findIndex(function(aValue, i) {
-                    var bValue = b[i];
-                    return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);
-                });
-                return firstInequalityIndex === -1;
-            } else if (_instanceof(a, Set)) {
-                return setsAreEquivalent(a, b);
-            } else if (_instanceof(a, Map)) {
-                var bMap = b;
-                if (a.size !== bMap.size) {
-                    return false;
-                }
-                var firstInequalityIndex1 = Array.from(a.entries()).findIndex(function(param) {
-                    var _param = _sliced_to_array$5(param, 2), key = _param[0], aValue = _param[1];
-                    var bValue = bMap.get(key);
-                    return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);
-                });
-                return firstInequalityIndex1 === -1;
-            }
+        result = true;
+    } else {
+        // run pojo filter before comparison
+        a = pojoFilter(a, true);
+        b = pojoFilter(b, true);
+        // check one value is nullish and other is not
+        if ((a == null || b == null) && (a || b)) {
+            result = false;
+        } else if ((typeof a === "undefined" ? "undefined" : _type_of$3(a)) !== 'object') {
+            result = false;
+        } else if (isIterable(a, false)) {
+            // check if they are iterables (arrays, Sets, Maps)
+            result = _compareIterables(a, b, pojoFilter);
         } else if ((typeof b === "undefined" ? "undefined" : _type_of$3(b)) === 'object') {
-            // check contructors/types
-            var firstType = a === null || a === void 0 ? void 0 : a.constructor.name;
-            var secondType = b === null || b === void 0 ? void 0 : b.constructor.name;
-            if (firstType !== secondType) {
-                return false; // false if not the same type
-            }
-            // check Date comparison
-            if (isDate(a)) {
-                return isEqualDate(a, b);
-            }
-            // check object comparison via keys
-            var aObject = a;
-            var bObject = b;
-            var aKeys = Object.keys(aObject);
-            var bKeys = Object.keys(bObject);
-            // compare keys
-            if (aKeys.length === bKeys.length) {
-                var firstInequalityIndex2 = aKeys.findIndex(function(key) {
-                    var aKeyValue = aObject[key];
-                    var bKeyValue = bObject[key];
-                    return !areEqualPOJOValuesUsingPojoFilter(aKeyValue, bKeyValue, pojoFilter);
-                });
-                if (firstInequalityIndex2 === -1) {
-                    return true; // is equal if no non-matching key/value pair is found
-                }
-            }
+            // check plain object comparison
+            result = _compareObjects(a, b, pojoFilter);
+        } else {
+            result = false;
         }
     }
-    // still not equal if down here
+    return result;
+}
+function _compareIterables(a, b, pojoFilter) {
+    if (Array.isArray(a)) {
+        return _compareArrays(a, b, pojoFilter);
+    }
+    if (_instanceof(a, Set)) {
+        return setsAreEquivalent(a, b);
+    }
+    if (_instanceof(a, Map)) {
+        return _compareMaps(a, b, pojoFilter);
+    }
     return false;
 }
+function _compareArrays(a, b, pojoFilter) {
+    if (a.length !== b.length) {
+        return false;
+    }
+    var firstInequalityIndex = a.findIndex(function(aValue, i) {
+        var bValue = b[i];
+        return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);
+    });
+    return firstInequalityIndex === -1;
+}
+function _compareMaps(a, b, pojoFilter) {
+    if (a.size !== b.size) {
+        return false;
+    }
+    var firstInequalityIndex = _to_consumable_array$3(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);
+    });
+    return firstInequalityIndex === -1;
+}
+function _compareObjects(a, b, pojoFilter) {
+    // check constructors/types
+    var firstType = a.constructor.name;
+    var secondType = b.constructor.name;
+    if (firstType !== secondType) {
+        return false;
+    }
+    // check Date comparison
+    if (isDate(a)) {
+        return isEqualDate(a, b);
+    }
+    // check object comparison via keys
+    var aObject = a;
+    var bObject = b;
+    var aKeys = Object.keys(aObject);
+    var bKeys = Object.keys(bObject);
+    if (aKeys.length !== bKeys.length) {
+        return false;
+    }
+    var firstInequalityIndex = aKeys.findIndex(function(key) {
+        var aKeyValue = aObject[key];
+        var bKeyValue = bObject[key];
+        return !areEqualPOJOValuesUsingPojoFilter(aKeyValue, bKeyValue, pojoFilter);
+    });
+    return firstInequalityIndex === -1;
+}
 /**
  * Creates an {@link ObjectFieldEqualityChecker} that compares two objects field-by-field using configured equality functions.
  *
@@ -16537,7 +17053,11 @@ function _unsupported_iterable_to_array$6(o, minLen) {
         var unequalFields = [];
         _fields.forEach(function(fieldConfig, fieldName) {
             var isEqual = fieldConfig.isEqual;
-            isEqual(a[fieldName], b[fieldName]) ? equalFields.push(fieldName) : unequalFields.push(fieldName);
+            if (isEqual(a[fieldName], b[fieldName])) {
+                equalFields.push(fieldName);
+            } else {
+                unequalFields.push(fieldName);
+            }
         });
         return {
             a: a,
@@ -16591,7 +17111,7 @@ function _unsupported_iterable_to_array$6(o, minLen) {
     });
 }
 
-function _array_like_to_array$5(arr, len) {
+function _array_like_to_array$6(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;
@@ -16627,15 +17147,15 @@ function _non_iterable_rest$4() {
     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 _sliced_to_array$4(arr, i) {
-    return _array_with_holes$4(arr) || _iterable_to_array_limit$4(arr, i) || _unsupported_iterable_to_array$5(arr, i) || _non_iterable_rest$4();
+    return _array_with_holes$4(arr) || _iterable_to_array_limit$4(arr, i) || _unsupported_iterable_to_array$6(arr, i) || _non_iterable_rest$4();
 }
-function _unsupported_iterable_to_array$5(o, minLen) {
+function _unsupported_iterable_to_array$6(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$5(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$6(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$5(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$6(o, minLen);
 }
 /**
  * Converts an {@link ObjectMap} into a `Map` using `Object.entries`.
@@ -16779,6 +17299,9 @@ function _type_of$2(obj) {
 }
 /**
  * Returns true if the value is a plain object (not an array, Date, RegExp, null, etc.).
+ *
+ * @param value - the value to check
+ * @returns true if the value is a plain object with an Object or null prototype
  */ function _isPlainObject(value) {
     var result = false;
     if (value != null && (typeof value === "undefined" ? "undefined" : _type_of$2(value)) === 'object') {
@@ -16812,7 +17335,7 @@ function _type_of$2(obj) {
     };
 }
 
-function _array_like_to_array$4(arr, len) {
+function _array_like_to_array$5(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;
@@ -16848,15 +17371,15 @@ function _non_iterable_rest$3() {
     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 _sliced_to_array$3(arr, i) {
-    return _array_with_holes$3(arr) || _iterable_to_array_limit$3(arr, i) || _unsupported_iterable_to_array$4(arr, i) || _non_iterable_rest$3();
+    return _array_with_holes$3(arr) || _iterable_to_array_limit$3(arr, i) || _unsupported_iterable_to_array$5(arr, i) || _non_iterable_rest$3();
 }
-function _unsupported_iterable_to_array$4(o, minLen) {
+function _unsupported_iterable_to_array$5(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$4(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$5(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$4(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$5(o, minLen);
 }
 /**
  * Creates bidirectional map functions (`from` and `to`) from a set of {@link ModelFieldConversions}.
@@ -16958,7 +17481,7 @@ function _unsupported_iterable_to_array$4(o, minLen) {
  * @returns A function that maps Maybe input values to output values
  */ function modelFieldMapFunction(config) {
     var convert = config.convert;
-    var convertMaybe = config.convertMaybe;
+    var convertMaybe = 'convertMaybe' in config ? config.convertMaybe : undefined;
     var defaultOutput = config.default;
     var defaultInput = config.defaultInput;
     var hasDefaultInput = defaultInput != null;
@@ -16970,7 +17493,7 @@ function _unsupported_iterable_to_array$4(o, minLen) {
             result = convert(input);
         } else {
             if (convertMaybe) {
-                result = convertMaybe(input !== null && input !== void 0 ? input : getDefaultInput());
+                result = convertMaybe(input);
             } else if (hasDefaultInput) {
                 result = convert(getDefaultInput());
             } else {
@@ -16988,8 +17511,7 @@ function _unsupported_iterable_to_array$4(o, minLen) {
  * @param input - Either a config ref or a pre-built conversions ref
  * @returns Resolved field conversions
  */ function toModelFieldConversions(input) {
-    var _input_fieldConversions;
-    var conversions = (_input_fieldConversions = input.fieldConversions) !== null && _input_fieldConversions !== void 0 ? _input_fieldConversions : modelFieldConversions(input.fields);
+    var conversions = 'fieldConversions' in input ? input.fieldConversions : modelFieldConversions(input.fields);
     return conversions;
 }
 /**
@@ -17001,7 +17523,7 @@ function _unsupported_iterable_to_array$4(o, minLen) {
  * @returns Bidirectional model map functions
  */ function toModelMapFunctions(input) {
     var mapFunctions;
-    if (input.mapFunctions != null) {
+    if ('mapFunctions' in input) {
         mapFunctions = input.mapFunctions;
     } else {
         var conversions = toModelFieldConversions(input);
@@ -17178,13 +17700,13 @@ function _object_spread$2(target) {
     }
 }
 
-function _array_like_to_array$3(arr, len) {
+function _array_like_to_array$4(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$1(arr) {
-    if (Array.isArray(arr)) return _array_like_to_array$3(arr);
+function _array_without_holes$2(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$4(arr);
 }
 function _class_call_check$5(instance, Constructor) {
     if (!(instance instanceof Constructor)) {
@@ -17204,22 +17726,22 @@ function _create_class$4(Constructor, protoProps, staticProps) {
     if (staticProps) _defineProperties$4(Constructor, staticProps);
     return Constructor;
 }
-function _iterable_to_array$1(iter) {
+function _iterable_to_array$2(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
-function _non_iterable_spread$1() {
+function _non_iterable_spread$2() {
     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$1(arr) {
-    return _array_without_holes$1(arr) || _iterable_to_array$1(arr) || _unsupported_iterable_to_array$3(arr) || _non_iterable_spread$1();
+function _to_consumable_array$2(arr) {
+    return _array_without_holes$2(arr) || _iterable_to_array$2(arr) || _unsupported_iterable_to_array$4(arr) || _non_iterable_spread$2();
 }
-function _unsupported_iterable_to_array$3(o, minLen) {
+function _unsupported_iterable_to_array$4(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$3(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$4(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$3(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$4(o, minLen);
 }
 /**
  * Type of relation change to perform on a collection of models.
@@ -17280,7 +17802,8 @@ function _unsupported_iterable_to_array$3(o, minLen) {
         },
         {
             key: "modifyCollection",
-            value: function modifyCollection(current, change, mods, config) {
+            value: // eslint-disable-next-line @typescript-eslint/max-params
+            function modifyCollection(current, change, mods, config) {
                 var mask = config.mask, readKey = config.readKey;
                 current = current !== null && current !== void 0 ? current : []; //init current if not set.
                 if (mask) {
@@ -17299,15 +17822,23 @@ function _unsupported_iterable_to_array$3(o, minLen) {
      * The mask results are merged together.
      *
      * Order from the "current" is retained. Anything in currentRetain overrides modifiedResults.
-     */ function _mergeMaskResults(current, currentRetain, modifiedResults, readKey) {
-                return restoreOrderWithValues(current, _to_consumable_array$1(currentRetain).concat(_to_consumable_array$1(modifiedResults)), {
+     *
+     * @param current - the original array whose ordering is preserved
+     * @param currentRetain - items from `current` that were excluded from modification and take precedence in the merge
+     * @param modifiedResults - items that were modified or added during the relation change
+     * @param readKey - function that extracts the relation key from each item for ordering
+     * @returns the merged array with original ordering restored
+     */ // eslint-disable-next-line @typescript-eslint/max-params
+            function _mergeMaskResults(current, currentRetain, modifiedResults, readKey) {
+                return restoreOrderWithValues(current, _to_consumable_array$2(currentRetain).concat(_to_consumable_array$2(modifiedResults)), {
                     readKey: readKey
                 });
             }
         },
         {
             key: "_modifyCollectionWithoutMask",
-            value: function _modifyCollectionWithoutMask(current, change, mods, config) {
+            value: // eslint-disable-next-line @typescript-eslint/max-params
+            function _modifyCollectionWithoutMask(current, change, mods, config) {
                 var _config_readType;
                 var readKey = config.readKey, merge = config.merge, shouldRemove = config.shouldRemove;
                 var readType = (_config_readType = config.readType) !== null && _config_readType !== void 0 ? _config_readType : function() {
@@ -17398,7 +17929,14 @@ function _unsupported_iterable_to_array$3(o, minLen) {
             key: "_modifyCollection",
             value: /**
      * Used to modify a collection which may be multi-type. If readType is provided, the collection is handled as a multi-type map.
-     */ function _modifyCollection(current, mods, modifyCollection, readType) {
+     *
+     * @param current - the current collection of relation objects
+     * @param mods - the modifications to apply to the collection
+     * @param modifyCollection - function that applies modifications to a single-type subset of the collection
+     * @param readType - optional function to read the type from each relation object, enabling multi-type handling
+     * @returns the modified collection with all changes applied
+     */ // eslint-disable-next-line @typescript-eslint/max-params
+            function _modifyCollection(current, mods, modifyCollection, readType) {
                 if (readType) {
                     return ModelRelationUtility._modifyMultiTypeCollection(current, mods, readType, modifyCollection);
                 } else {
@@ -17408,12 +17946,13 @@ function _unsupported_iterable_to_array$3(o, minLen) {
         },
         {
             key: "_modifyMultiTypeCollection",
-            value: function _modifyMultiTypeCollection(input, mods, readType, modifyCollection) {
+            value: // eslint-disable-next-line @typescript-eslint/max-params
+            function _modifyMultiTypeCollection(input, mods, readType, modifyCollection) {
                 var inputMap = makeValuesGroupMap(input, readType);
                 var modsMap = makeValuesGroupMap(mods, readType);
-                var typesModified = new Set(_to_consumable_array$1(inputMap.keys()).concat(_to_consumable_array$1(modsMap.keys())));
+                var typesModified = new Set(_to_consumable_array$2(inputMap.keys()).concat(_to_consumable_array$2(modsMap.keys())));
                 // Break the collections up into their individual types and process separately.
-                var modifiedSubcollections = Array.from(typesModified).map(function(type) {
+                var modifiedSubcollections = _to_consumable_array$2(typesModified).map(function(type) {
                     var _inputMap_get, _modsMap_get;
                     var values = (_inputMap_get = inputMap.get(type)) !== null && _inputMap_get !== void 0 ? _inputMap_get : [];
                     var _$mods = (_modsMap_get = modsMap.get(type)) !== null && _modsMap_get !== void 0 ? _modsMap_get : [];
@@ -17426,7 +17965,7 @@ function _unsupported_iterable_to_array$3(o, minLen) {
                 });
                 // Rejoin all changes.
                 return modifiedSubcollections.reduce(function(x, y) {
-                    return x.concat(y);
+                    return _to_consumable_array$2(x).concat(_to_consumable_array$2(y));
                 }, []);
             }
         },
@@ -17446,11 +17985,10 @@ function _unsupported_iterable_to_array$3(o, minLen) {
                     }
                 });
                 var added = ModelRelationUtility.addToCollection(current, addValues, readKey);
-                var results = ModelRelationUtility._updateSingleTypeCollection(added, updateValues, {
+                return ModelRelationUtility._updateSingleTypeCollection(added, updateValues, {
                     readKey: readKey,
                     merge: merge
                 });
-                return results;
             }
         },
         {
@@ -17482,7 +18020,7 @@ function _unsupported_iterable_to_array$3(o, minLen) {
      * @returns The collection with added items.
      */ function addToCollection(current, add, readKey) {
                 current = current !== null && current !== void 0 ? current : [];
-                return (add === null || add === void 0 ? void 0 : add.length) ? ModelRelationUtility.removeDuplicates(_to_consumable_array$1(add).concat(_to_consumable_array$1(current)), readKey) : current; // Will keep any "added" before any existing ones.
+                return add.length ? ModelRelationUtility.removeDuplicates(_to_consumable_array$2(add).concat(_to_consumable_array$2(current)), readKey) : current; // Will keep any "added" before any existing ones.
             }
         },
         {
@@ -17496,7 +18034,8 @@ function _unsupported_iterable_to_array$3(o, minLen) {
      * @param readKey - Function to extract the unique key from each item.
      * @param shouldRemove - Optional predicate that must return true for a matched item to actually be removed.
      * @returns The collection with matching items removed.
-     */ function removeFromCollection(current, remove, readKey, shouldRemove) {
+     */ // eslint-disable-next-line @typescript-eslint/max-params
+            function removeFromCollection(current, remove, readKey, shouldRemove) {
                 if (current === null || current === void 0 ? void 0 : current.length) {
                     if (shouldRemove) {
                         var currentKeyPairs = makeKeyPairs(current, readKey);
@@ -17587,7 +18126,7 @@ function handlerFactory(readKey, options) {
             var bindHandle = handle.bind(bindTo);
             set(key, bindHandle);
         };
-        var fn = build({
+        return build({
             base: function base(value) {
                 var _ref;
                 var key = readKey(value);
@@ -17609,7 +18148,6 @@ function handlerFactory(readKey, options) {
                 x.setCatchAll = setCatchAll;
             }
         });
-        return fn;
     };
 }
 /**
@@ -17705,7 +18243,7 @@ function handlerFactory(readKey, options) {
     };
 }
 
-function _array_like_to_array$2(arr, len) {
+function _array_like_to_array$3(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;
@@ -17772,15 +18310,15 @@ function _non_iterable_rest$2() {
     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 _sliced_to_array$2(arr, i) {
-    return _array_with_holes$2(arr) || _iterable_to_array_limit$2(arr, i) || _unsupported_iterable_to_array$2(arr, i) || _non_iterable_rest$2();
+    return _array_with_holes$2(arr) || _iterable_to_array_limit$2(arr, i) || _unsupported_iterable_to_array$3(arr, i) || _non_iterable_rest$2();
 }
-function _unsupported_iterable_to_array$2(o, minLen) {
+function _unsupported_iterable_to_array$3(o, minLen) {
     if (!o) return;
-    if (typeof o === "string") return _array_like_to_array$2(o, minLen);
+    if (typeof o === "string") return _array_like_to_array$3(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$2(o, minLen);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$3(o, minLen);
 }
 /**
  * TypedServiceRegistry implementation.
@@ -17998,6 +18536,8 @@ function _define_property$3(obj, key, value) {
             key: "length",
             get: /**
      * The number of items stored.
+     *
+     * @returns the current count of stored key-value pairs
      */ function get() {
                 return this._length;
             }
@@ -18005,6 +18545,7 @@ function _define_property$3(obj, key, value) {
         {
             /**
      * Returns the key at the given index.
+     *
      * @param index The index of the key to retrieve.
      * @returns The key string if found, otherwise null.
      */ key: "key",
@@ -18016,6 +18557,7 @@ function _define_property$3(obj, key, value) {
         {
             /**
      * Checks if a key exists in the storage.
+     *
      * @param key The key to check.
      * @returns True if the key exists, false otherwise.
      */ key: "hasKey",
@@ -18026,6 +18568,7 @@ function _define_property$3(obj, key, value) {
         {
             /**
      * Retrieves an item from storage.
+     *
      * @param key The key of the item to retrieve.
      * @returns The item string if found, otherwise null or undefined.
      */ key: "getItem",
@@ -18038,6 +18581,7 @@ function _define_property$3(obj, key, value) {
             /**
      * Sets an item in storage.
      * If the item is null or undefined, the key will be removed.
+     *
      * @param key The key of the item to set.
      * @param item The item string to store.
      */ key: "setItem",
@@ -18055,6 +18599,7 @@ function _define_property$3(obj, key, value) {
         {
             /**
      * Removes an item from storage.
+     *
      * @param key The key of the item to remove.
      */ key: "removeItem",
             value: function removeItem(key) {
@@ -18221,6 +18766,31 @@ function _is_native_reflect_construct() {
 } 
 ();
 
+function _array_like_to_array$2(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$1(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array$2(arr);
+}
+function _iterable_to_array$1(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+function _non_iterable_spread$1() {
+    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$1(arr) {
+    return _array_without_holes$1(arr) || _iterable_to_array$1(arr) || _unsupported_iterable_to_array$2(arr) || _non_iterable_spread$1();
+}
+function _unsupported_iterable_to_array$2(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array$2(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$2(o, minLen);
+}
 /**
  * Joins together various arrays of CSS classes into a single space-separated string of unique class names.
  *
@@ -18230,7 +18800,7 @@ function _is_native_reflect_construct() {
     var result = '';
     if (cssClasses) {
         var allClasses = cssClassesSet(cssClasses);
-        result = joinStringsWithSpaces(Array.from(allClasses));
+        result = joinStringsWithSpaces(_to_consumable_array$1(allClasses));
     }
     return result;
 }
@@ -18244,11 +18814,11 @@ function _is_native_reflect_construct() {
     var result;
     if (cssClasses) {
         var arrayOfClasses = iterableToArray(cssClasses, false);
-        var arrayOfAllClassValues = arrayOfClasses.map(function(x) {
-            return asArray(x).map(function(x) {
+        var arrayOfAllClassValues = arrayOfClasses.flatMap(function(x) {
+            return asArray(x).flatMap(function(x) {
                 return x.split(' ');
-            }).flat();
-        }).flat();
+            });
+        });
         result = new Set(arrayOfAllClassValues);
     } else {
         result = new Set();
@@ -18316,14 +18886,30 @@ function _unsupported_iterable_to_array$1(o, minLen) {
     return inverted;
 }
 
-/** MIME type for JPEG images. */ var JPEG_MIME_TYPE = 'image/jpeg';
-/** MIME type for PNG images. */ var PNG_MIME_TYPE = 'image/png';
-/** MIME type for WebP images. */ var WEBP_MIME_TYPE = 'image/webp';
-/** MIME type for GIF images. */ var GIF_MIME_TYPE = 'image/gif';
-/** MIME type for HEIF images. */ var HEIF_MIME_TYPE = 'image/heif';
-/** MIME type for TIFF images. */ var TIFF_MIME_TYPE = 'image/tiff';
-/** MIME type for SVG images. */ var SVG_MIME_TYPE = 'image/svg+xml';
-/** MIME type for RAW images. */ var RAW_MIME_TYPE = 'image/raw';
+/**
+ * MIME type for JPEG images.
+ */ var JPEG_MIME_TYPE = 'image/jpeg';
+/**
+ * MIME type for PNG images.
+ */ var PNG_MIME_TYPE = 'image/png';
+/**
+ * MIME type for WebP images.
+ */ var WEBP_MIME_TYPE = 'image/webp';
+/**
+ * MIME type for GIF images.
+ */ var GIF_MIME_TYPE = 'image/gif';
+/**
+ * MIME type for HEIF images.
+ */ var HEIF_MIME_TYPE = 'image/heif';
+/**
+ * MIME type for TIFF images.
+ */ var TIFF_MIME_TYPE = 'image/tiff';
+/**
+ * MIME type for SVG images.
+ */ var SVG_MIME_TYPE = 'image/svg+xml';
+/**
+ * MIME type for RAW images.
+ */ var RAW_MIME_TYPE = 'image/raw';
 /**
  * Maps image file extensions to their corresponding MIME types.
  */ var IMAGE_FILE_EXTENSION_TO_MIME_TYPES_RECORD = {
@@ -18351,16 +18937,36 @@ function mimeTypeForImageFileExtension(extension) {
  */ function imageFileExtensionForMimeType(mimeType) {
     return mimeType ? IMAGE_MIME_TYPES_TO_FILE_EXTENSIONS_RECORD[mimeType] : undefined;
 }
-/** MIME type for PDF documents. */ var PDF_MIME_TYPE = 'application/pdf';
-/** MIME type for DOCX (Word) documents. */ var DOCX_MIME_TYPE = 'application/vnd.openxmlformats-officedocument.wordprocessingml.document';
-/** MIME type for XLSX (Excel) spreadsheets. */ var XLSX_MIME_TYPE = 'application/vnd.openxmlformats-officedocument.spreadsheetml.sheet';
-/** MIME type for plain text files. */ var TXT_MIME_TYPE = 'text/plain';
-/** MIME type for CSV files. */ var CSV_MIME_TYPE = 'text/csv';
-/** MIME type for HTML files. */ var HTML_MIME_TYPE = 'text/html';
-/** MIME type for XML files. */ var XML_MIME_TYPE = 'application/xml';
-/** MIME type for JSON files. */ var JSON_MIME_TYPE = 'application/json';
-/** MIME type for YAML files. */ var YAML_MIME_TYPE = 'application/yaml';
-/** MIME type for Markdown files. */ var MARKDOWN_MIME_TYPE = 'text/markdown';
+/**
+ * MIME type for PDF documents.
+ */ var PDF_MIME_TYPE = 'application/pdf';
+/**
+ * MIME type for DOCX (Word) documents.
+ */ var DOCX_MIME_TYPE = 'application/vnd.openxmlformats-officedocument.wordprocessingml.document';
+/**
+ * MIME type for XLSX (Excel) spreadsheets.
+ */ var XLSX_MIME_TYPE = 'application/vnd.openxmlformats-officedocument.spreadsheetml.sheet';
+/**
+ * MIME type for plain text files.
+ */ var TXT_MIME_TYPE = 'text/plain';
+/**
+ * MIME type for CSV files.
+ */ var CSV_MIME_TYPE = 'text/csv';
+/**
+ * MIME type for HTML files.
+ */ var HTML_MIME_TYPE = 'text/html';
+/**
+ * MIME type for XML files.
+ */ var XML_MIME_TYPE = 'application/xml';
+/**
+ * MIME type for JSON files.
+ */ var JSON_MIME_TYPE = 'application/json';
+/**
+ * MIME type for YAML files.
+ */ var YAML_MIME_TYPE = 'application/yaml';
+/**
+ * MIME type for Markdown files.
+ */ var MARKDOWN_MIME_TYPE = 'text/markdown';
 /**
  * Maps document file extensions to their corresponding MIME types.
  */ var DOCUMENT_FILE_EXTENSION_TO_MIME_TYPES_RECORD = {
@@ -18389,7 +18995,9 @@ function mimeTypeForDocumentFileExtension(extension) {
  */ function documentFileExtensionForMimeType(mimeType) {
     return mimeType ? DOCUMENT_MIME_TYPES_TO_FILE_EXTENSIONS_RECORD[mimeType] : undefined;
 }
-/** MIME type for ZIP archive files. */ var ZIP_FILE_MIME_TYPE = 'application/zip';
+/**
+ * MIME type for ZIP archive files.
+ */ var ZIP_FILE_MIME_TYPE = 'application/zip';
 /**
  * Maps application file extensions to their corresponding MIME types.
  */ var APPLICATION_FILE_EXTENSION_TO_MIME_TYPES_RECORD = {
@@ -18514,7 +19122,7 @@ function mimeTypeForFileExtension(extension) {
             var searchResult = readStrings(value);
             var match = false;
             if (Array.isArray(searchResult)) {
-                match = searchResult.findIndex(decision) !== -1;
+                match = searchResult.some(decision);
             } else if (searchResult != null) {
                 match = decision(searchResult);
             }
@@ -18530,7 +19138,7 @@ function mimeTypeForFileExtension(extension) {
  */ var caseInsensitiveFilterByIndexOfDecisionFactory = function caseInsensitiveFilterByIndexOfDecisionFactory(filterText) {
     var searchString = filterText.toLocaleLowerCase();
     return function(string) {
-        return string.toLocaleLowerCase().indexOf(searchString) !== -1;
+        return string.toLocaleLowerCase().includes(searchString);
     };
 };
 
@@ -18632,11 +19240,9 @@ function _unsupported_iterable_to_array(o, minLen) {
     entries.forEach(function(entry) {
         result = factory(entry, result);
     });
-    if (!result) {
-        result = factory({
-            values: []
-        });
-    }
+    result !== null && result !== void 0 ? result : result = factory({
+        values: []
+    });
     return result;
 }
 /**
@@ -18659,7 +19265,7 @@ function _unsupported_iterable_to_array(o, minLen) {
     var parts = value.split(separator);
     var currentNode = tree;
     parts.forEach(function(nodeValue) {
-        var existingChildNode = currentNode.children[nodeValue];
+        var existingChildNode = currentNode.children[nodeValue]; // may be undefined for new paths
         var childNode = existingChildNode !== null && existingChildNode !== void 0 ? existingChildNode : {
             nodeValue: nodeValue,
             children: {}
@@ -19209,8 +19815,7 @@ function invertMaybeBoolean(x) {
     var chance = inputChance / 100;
     return function() {
         var roll = Math.random();
-        var result = roll <= chance;
-        return result;
+        return roll <= chance;
     };
 }
 /**
@@ -19532,31 +20137,67 @@ function _ts_generator$1(thisArg, body) {
  * ```
  */ function iterate(values, useFn) {
     return _async_to_generator$1(function() {
-        var i;
+        var _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, value, err;
         return _ts_generator$1(this, function(_state) {
             switch(_state.label){
                 case 0:
-                    i = 0;
+                    _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
                     _state.label = 1;
                 case 1:
-                    if (!(i < values.length)) return [
+                    _state.trys.push([
+                        1,
+                        6,
+                        7,
+                        8
+                    ]);
+                    _iterator = values[Symbol.iterator]();
+                    _state.label = 2;
+                case 2:
+                    if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
                         3,
-                        4
+                        5
                     ];
+                    value = _step.value;
                     return [
                         4,
-                        useFn(values[i])
+                        useFn(value)
                     ];
-                case 2:
-                    _state.sent();
-                    _state.label = 3;
                 case 3:
-                    i += 1;
+                    _state.sent();
+                    _state.label = 4;
+                case 4:
+                    _iteratorNormalCompletion = true;
                     return [
                         3,
-                        1
+                        2
                     ];
-                case 4:
+                case 5:
+                    return [
+                        3,
+                        8
+                    ];
+                case 6:
+                    err = _state.sent();
+                    _didIteratorError = true;
+                    _iteratorError = err;
+                    return [
+                        3,
+                        8
+                    ];
+                case 7:
+                    try {
+                        if (!_iteratorNormalCompletion && _iterator.return != null) {
+                            _iterator.return();
+                        }
+                    } finally{
+                        if (_didIteratorError) {
+                            throw _iteratorError;
+                        }
+                    }
+                    return [
+                        7
+                    ];
+                case 8:
                     return [
                         2
                     ];
@@ -19782,11 +20423,11 @@ function _ts_generator(thisArg, body) {
  * @throws Error if neither `use` nor `usePage` is specified in `iterFn`
  */ function iterateFilteredPages(inputPage, loadFn, iterFn) {
     return _async_to_generator(function() {
-        var _ref, _iterFn_usePage, currentPage, hasMore, count, useFn, page, values;
+        var _iterFn_usePage, currentPage, hasMore, count, useFn, page, values;
         return _ts_generator(this, function(_state) {
             switch(_state.label){
                 case 0:
-                    currentPage = (_ref = inputPage === null || inputPage === void 0 ? void 0 : inputPage.page) !== null && _ref !== void 0 ? _ref : 0;
+                    currentPage = inputPage.page;
                     hasMore = true;
                     count = 0;
                     if (!iterFn.use && !iterFn.usePage) {
@@ -19869,9 +20510,8 @@ function _ts_generator(thisArg, body) {
             var parentKey = parentParts.join('/');
             var parent = nodeMap.get(parentKey);
             if (parent) {
-                if (!parent.children) {
-                    parent.children = [];
-                }
+                var _parent, _children;
+                (_children = (_parent = parent).children) !== null && _children !== void 0 ? _children : _parent.children = [];
                 parent.children.push(node);
                 node.parent = parent;
             } else if (includeChildrenWithMissingParentFolder) {
@@ -20638,6 +21278,7 @@ exports.mergeObjects = mergeObjects;
 exports.mergeObjectsFunction = mergeObjectsFunction;
 exports.mergeSlashPaths = mergeSlashPaths;
 exports.messageFromError = messageFromError;
+exports.millisecondsToMinutes = millisecondsToMinutes;
 exports.millisecondsToMinutesAndSeconds = millisecondsToMinutesAndSeconds;
 exports.mimeTypeForApplicationFileExtension = mimeTypeForApplicationFileExtension;
 exports.mimeTypeForDocumentFileExtension = mimeTypeForDocumentFileExtension;