@dereekb/util 13.6.17 → 13.8.0

package/index.esm.js

@@ -352,43 +352,33 @@ function _unsupported_iterable_to_array$A(o, minLen) {
  * @returns An array containing the tuple(s)
  * @throws Error if input is not an array
  */ function wrapTuples(input) {
-    if (Array.isArray(input)) {
-        // check if the first item is an array. Tuples can contain arrays as the first value.
-        if (input.length > 0) {
-            var firstValueInPotentialTupleOrArray = input[0];
-            var inputIsSingleTuple = false;
-            if (Array.isArray(firstValueInPotentialTupleOrArray)) {
-                // if the first nested value is an array then the top-level value may be an array and not a tuple. Check the length of all the other values in the array to see if they have the same length.
-                var expectedLength = firstValueInPotentialTupleOrArray.length;
-                // if it is an array of tuples, all values should be the same length and be arrays. If not an array, then we're looking at a tuple.
-                var firstNonUniformTupleValueIndex = input.findIndex(function(x) {
-                    if (Array.isArray(x)) {
-                        return x.length !== expectedLength;
-                    } else {
-                        return true; // non-array value. The input is a tuple.
-                    }
-                });
-                inputIsSingleTuple = firstNonUniformTupleValueIndex !== -1;
-            } else {
-                inputIsSingleTuple = true;
-                return [
-                    input
-                ];
-            }
-            // first value of the tuple could also be an array. If it is, check the other tuples all have the same length.
-            if (inputIsSingleTuple) {
-                return [
-                    input
-                ];
-            } else {
-                return input;
-            }
+    if (!Array.isArray(input)) {
+        throw new Error('Input is not an array/tuple...');
+    }
+    var result;
+    // check if the first item is an array. Tuples can contain arrays as the first value.
+    if (input.length > 0) {
+        var firstValueInPotentialTupleOrArray = input[0];
+        var inputIsSingleTuple = false;
+        if (Array.isArray(firstValueInPotentialTupleOrArray)) {
+            // if the first nested value is an array then the top-level value may be an array and not a tuple. Check the length of all the other values in the array to see if they have the same length.
+            var expectedLength = firstValueInPotentialTupleOrArray.length;
+            // if it is an array of tuples, all values should be the same length and be arrays. If not an array, then we're looking at a tuple.
+            var firstNonUniformTupleValueIndex = input.findIndex(function(x) {
+                return Array.isArray(x) ? x.length !== expectedLength : true; // non-array value means the input is a tuple.
+            });
+            inputIsSingleTuple = firstNonUniformTupleValueIndex !== -1;
         } else {
-            return input; // is an empty array.
+            inputIsSingleTuple = true;
         }
+        // first value of the tuple could also be an array. If it is, check the other tuples all have the same length.
+        result = inputIsSingleTuple ? [
+            input
+        ] : input;
     } else {
-        throw new Error('Input is not an array/tuple...');
+        result = input; // is an empty array.
     }
+    return result;
 }
 
 function _array_like_to_array$z(arr, len) {
@@ -438,11 +428,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
  * @param arrayOrValue - single value, array, or nullish value to convert
  * @returns the input wrapped in an array, the input array itself, or an empty array if nullish
  */ function convertMaybeToArray(arrayOrValue) {
-    if (arrayOrValue != null) {
-        return convertToArray(arrayOrValue);
-    } else {
-        return [];
-    }
+    return arrayOrValue != null ? convertToArray(arrayOrValue) : [];
 }
 /**
  * Alias for {@link convertMaybeToArray}. Converts a maybe value or array into an array, returning an empty array for nullish input.
@@ -474,11 +460,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
  * @param input - single value or array to retrieve from
  * @returns the last element of the array, or the input value itself
  */ function lastValue(input) {
-    if (Array.isArray(input)) {
-        return input[input.length - 1];
-    } else {
-        return input;
-    }
+    return Array.isArray(input) ? input[input.length - 1] : input;
 }
 /**
  * Returns a tuple with the first and last value of the input.
@@ -502,11 +484,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
  * @param index - zero-based index of the element to retrieve
  * @returns the element at the specified index, or the input value itself if not an array
  */ function valueAtIndex(input, index) {
-    if (Array.isArray(input)) {
-        return input[index];
-    } else {
-        return input;
-    }
+    return Array.isArray(input) ? input[index] : input;
 }
 /**
  * Concatenates the input arrays into a single array, filtering out nullish entries.
@@ -600,10 +578,9 @@ function _unsupported_iterable_to_array$z(o, minLen) {
  */ function pushItemOrArrayItemsIntoArray(target, value) {
     if (Array.isArray(value)) {
         return pushArrayItemsIntoArray(target, value);
-    } else {
-        target.push(value);
-        return target;
     }
+    target.push(value);
+    return target;
 }
 /**
  * Merges all elements from the source array into the target array using push.
@@ -717,18 +694,19 @@ function _unsupported_iterable_to_array$z(o, minLen) {
  * ```
  */ function readKeysFunction(readKey) {
     return function(values) {
+        var result;
         if (Array.isArray(values)) {
-            var keys = [];
+            result = [];
             values.forEach(function(x) {
                 var key = readKey(x);
                 if (key != null) {
-                    pushItemOrArrayItemsIntoArray(keys, key);
+                    pushItemOrArrayItemsIntoArray(result, key);
                 }
             });
-            return keys;
         } else {
-            return asArray(readKey(values));
+            result = asArray(readKey(values));
         }
+        return result;
     };
 }
 /**
@@ -753,24 +731,25 @@ function _unsupported_iterable_to_array$z(o, minLen) {
  * ```
  */ function readKeysSetFunction(readKey) {
     return function(values) {
+        var result;
         if (Array.isArray(values)) {
-            var keys = new Set();
+            result = new Set();
             values.forEach(function(x) {
                 var key = readKey(x);
                 if (key != null) {
                     if (Array.isArray(key)) {
                         key.forEach(function(x) {
-                            return keys.add(x);
+                            return result.add(x);
                         });
                     } else {
-                        keys.add(key);
+                        result.add(key);
                     }
                 }
             });
-            return keys;
         } else {
-            return new Set(asArray(readKey(values)));
+            result = new Set(asArray(readKey(values)));
         }
+        return result;
     };
 }
 /**
@@ -1249,13 +1228,9 @@ function _unsupported_iterable_to_array$y(o, minLen) {
  */ function setContainsAnyValue(valuesSet, valuesToFind) {
     var emptyValuesToFindArrayResult = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : false;
     var valuesToFindArray = iterableToArray(valuesToFind);
-    if (valuesToFindArray.length > 0) {
-        return valuesToFindArray.some(function(x) {
-            return valuesSet.has(x);
-        });
-    } else {
-        return emptyValuesToFindArrayResult;
-    }
+    return valuesToFindArray.length > 0 ? valuesToFindArray.some(function(x) {
+        return valuesSet.has(x);
+    }) : emptyValuesToFindArrayResult;
 }
 /**
  * Returns true if values contains all values in valuesToFind.
@@ -1282,13 +1257,9 @@ function _unsupported_iterable_to_array$y(o, minLen) {
  */ function setContainsAllValues(valuesSet, valuesToFind) {
     var emptyValuesToFindArrayResult = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : true;
     var valuesToFindArray = iterableToArray(valuesToFind);
-    if (valuesToFindArray.length > 0) {
-        return !valuesToFindArray.some(function(x) {
-            return !valuesSet.has(x);
-        });
-    } else {
-        return emptyValuesToFindArrayResult;
-    }
+    return valuesToFindArray.length > 0 ? !valuesToFindArray.some(function(x) {
+        return !valuesSet.has(x);
+    }) : emptyValuesToFindArrayResult;
 }
 /**
  * Returns true if both iterables are defined (or are both null/undefined) and have the same values exactly.
@@ -1342,20 +1313,16 @@ function _unsupported_iterable_to_array$x(o, minLen) {
  * @returns The inverted function, or the original if invert is false
  */ function invertBooleanReturnFunction(decisionFn) {
     var invert = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : true;
-    if (invert) {
-        return function() {
-            for(var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++){
-                args[_key] = arguments[_key];
-            }
-            var _decisionFn;
-            var result = (_decisionFn = decisionFn).call.apply(_decisionFn, [
-                undefined
-            ].concat(_to_consumable_array$k(args)));
-            return !result;
-        };
-    } else {
-        return decisionFn;
-    }
+    return invert ? function() {
+        for(var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++){
+            args[_key] = arguments[_key];
+        }
+        var _decisionFn;
+        var result = (_decisionFn = decisionFn).call.apply(_decisionFn, [
+            undefined
+        ].concat(_to_consumable_array$k(args)));
+        return !result;
+    } : decisionFn;
 }
 
 /**
@@ -1486,11 +1453,7 @@ function _type_of$l(obj) {
  * @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);
-    } else {
-        return isNotNullOrEmptyString(value);
-    }
+    return isIterable(value, false) ? !isEmptyIterable(value) : isNotNullOrEmptyString(value);
 }
 /**
  * Type guard that checks whether the input has a meaningful value, including checking for empty objects.
@@ -1503,13 +1466,15 @@ function _type_of$l(obj) {
  * @param value - the value to check
  * @returns `true` if the value is non-nullish, non-empty, and not an empty object
  */ function hasValueOrNotEmptyObject(value) {
+    var result;
     if (isIterable(value, true)) {
-        return !isEmptyIterable(value);
+        result = !isEmptyIterable(value);
     } else if (isNotNullOrEmptyString(value)) {
-        return (typeof value === "undefined" ? "undefined" : _type_of$l(value)) === 'object' ? !objectHasNoKeys(value) : true;
+        result = (typeof value === "undefined" ? "undefined" : _type_of$l(value)) === 'object' ? !objectHasNoKeys(value) : true;
     } else {
-        return false;
+        result = false;
     }
+    return result;
 }
 /**
  * Returns `true` if the input value is a non-empty string or is `true`.
@@ -1823,13 +1788,9 @@ function _type_of$l(obj) {
 }
 function chainMapFunction(a, b) {
     var apply = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : true;
-    if (apply && b != null) {
-        return function(x) {
-            return b(a(x));
-        };
-    } else {
-        return a;
-    }
+    return apply && b != null ? function(x) {
+        return b(a(x));
+    } : a;
 }
 
 function _array_like_to_array$w(arr, len) {
@@ -2784,24 +2745,23 @@ function reverseCompareFn(compareFn) {
         var _firstValueFromIterable;
         var min = (_firstValueFromIterable = firstValueFromIterable(values)) !== null && _firstValueFromIterable !== void 0 ? _firstValueFromIterable : undefined;
         var max = min;
-        if (min != null && max != null) {
-            forEachInIterable(values, function(x) {
-                var compareMin = compareFn(x, min);
-                var compareMax = compareFn(x, max);
-                if (compareMin < 0) {
-                    min = x;
-                }
-                if (compareMax > 0) {
-                    max = x;
-                }
-            });
-            return {
-                min: min,
-                max: max
-            };
-        } else {
+        if (min == null || max == null) {
             return null;
         }
+        forEachInIterable(values, function(x) {
+            var compareMin = compareFn(x, min);
+            var compareMax = compareFn(x, max);
+            if (compareMin < 0) {
+                min = x;
+            }
+            if (compareMax > 0) {
+                max = x;
+            }
+        });
+        return {
+            min: min,
+            max: max
+        };
     };
 }
 
@@ -3425,11 +3385,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
  */ function bitwiseSetDencoder(maxIndex) {
     var decoder = maxIndex ? bitwiseSetDecoder(maxIndex) : dencodeBitwiseSet;
     return function(input) {
-        if (typeof input === 'number') {
-            return decoder(input);
-        } else {
-            return encodeBitwiseSet(input);
-        }
+        return typeof input === 'number' ? decoder(input) : encodeBitwiseSet(input);
     };
 }
 /**
@@ -3469,11 +3425,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
     var encoder = bitwiseObjectEncoder(config.toSetFunction);
     var decoder = bitwiseObjectdecoder(config.fromSetFunction, config.maxIndex);
     return function(input) {
-        if (typeof input === 'number') {
-            return decoder(input);
-        } else {
-            return encoder(input);
-        }
+        return typeof input === 'number' ? decoder(input) : encoder(input);
     };
 }
 
@@ -3531,11 +3483,7 @@ function _type_of$j(obj) {
     return isNonClassFunction(value);
 }
 function getValueFromGetter(input, args) {
-    if (isNonClassFunction(input)) {
-        return input(args);
-    } else {
-        return input;
-    }
+    return isNonClassFunction(input) ? input(args) : input;
 }
 /**
  * Wraps the input as a Getter function. If it's already a function, returns it directly.
@@ -3543,13 +3491,9 @@ function getValueFromGetter(input, args) {
  * @param input - A value or getter function
  * @returns A Getter function that returns the value
  */ function asGetter(input) {
-    if (isNonClassFunction(input)) {
+    return isNonClassFunction(input) ? input : function() {
         return input;
-    } else {
-        return function() {
-            return input;
-        };
-    }
+    };
 }
 /**
  * Creates a factory that returns a shallow copy of the input value on each call.
@@ -3571,11 +3515,7 @@ function getValueFromGetter(input, args) {
  * @param copyFunction - Optional custom copy function
  * @returns An ObjectCopyFactory for the input
  */ function asObjectCopyFactory(input, copyFunction) {
-    if ((typeof input === "undefined" ? "undefined" : _type_of$j(input)) === 'object') {
-        return objectCopyFactory(input, copyFunction);
-    } else {
-        return asGetter(input);
-    }
+    return (typeof input === "undefined" ? "undefined" : _type_of$j(input)) === 'object' ? objectCopyFactory(input, copyFunction) : asGetter(input);
 }
 /**
  * Wraps the input value in a Getter function that always returns it.
@@ -3678,13 +3618,15 @@ function makeWithFactoryInput(factory, input) {
     var distance = max - min;
     var isInBound = isInNumberBoundFunction(wrapNumberFunctionConfig);
     var fn = function fn(input) {
+        var result;
         if (isInBound(input)) {
-            return input;
+            result = 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;
-            return ((input - min) % distance + distance) % distance + min + fencePostOffset;
+            result = ((input - min) % distance + distance) % distance + min + fencePostOffset;
         }
+        return result;
     };
     fn._wrap = wrapNumberFunctionConfig;
     return fn;
@@ -3698,13 +3640,9 @@ function makeWithFactoryInput(factory, input) {
  * @returns A function that bounds input numbers into the configured range
  */ function boundNumberFunction(boundNumberFunctionConfig) {
     var min = boundNumberFunctionConfig.min, max = boundNumberFunctionConfig.max, wrap = boundNumberFunctionConfig.wrap;
-    if (wrap) {
-        return wrapNumberFunction(boundNumberFunctionConfig);
-    } else {
-        return function(input) {
-            return boundNumber(input, min, max);
-        };
-    }
+    return wrap ? wrapNumberFunction(boundNumberFunctionConfig) : function(input) {
+        return boundNumber(input, min, max);
+    };
 }
 /**
  * Clamps the input number between the min and max values (inclusive).
@@ -3931,16 +3869,18 @@ function _type_of$h(obj) {
  * @returns A function that rounds numbers to the configured precision
  */ function roundToPrecisionFunction(precision) {
     var roundFn = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : 'round';
+    var result;
     if (roundFn === 'cut') {
-        return function(value) {
+        result = function result(value) {
             return cutToPrecision(value, precision);
         };
     } else {
         var rndFn = roundingFunction(roundFn);
-        return function(value) {
+        result = function result(value) {
             return +(rndFn(Number(value + 'e+' + precision)) + 'e-' + precision);
         };
     }
+    return result;
 }
 /**
  * Rounds a number to the specified decimal precision using `Math.round`.
@@ -4028,11 +3968,7 @@ var DOLLAR_AMOUNT_STRING_REGEX = /^\$?([0-9]+)\.?([0-9][0-9])$/;
  * @param number - The dollar amount to format
  * @returns Formatted string with two decimal places (e.g., "12.50")
  */ function dollarAmountString(number) {
-    if (number) {
-        return cutToPrecision(number, DOLLAR_AMOUNT_PRECISION).toFixed(DOLLAR_AMOUNT_PRECISION);
-    } else {
-        return '0.00';
-    }
+    return number ? cutToPrecision(number, DOLLAR_AMOUNT_PRECISION).toFixed(DOLLAR_AMOUNT_PRECISION) : '0.00';
 }
 /**
  * Creates a function that formats dollar amounts as strings with a unit prefix (e.g., "$12.50").
@@ -4289,11 +4225,7 @@ var DOLLAR_AMOUNT_STRING_REGEX = /^\$?([0-9]+)\.?([0-9][0-9])$/;
  * @param emptyArrayValue - value to return when the array is empty
  * @returns the reduced result, or the empty array value if the array is empty
  */ function reduceNumbers(reduceFn, array, emptyArrayValue) {
-    if (array.length === 0) {
-        return emptyArrayValue;
-    } else {
-        return reduceNumbersFn(reduceFn, emptyArrayValue)(array);
-    }
+    return array.length === 0 ? emptyArrayValue : reduceNumbersFn(reduceFn, emptyArrayValue)(array);
 }
 function reduceNumbersFn(reduceFn, emptyArrayValue) {
     var rFn = function rFn(array) {
@@ -4460,11 +4392,7 @@ function reduceNumbersFn(reduceFn, emptyArrayValue) {
     return function(values) {
         var minMax = findMinMax(values);
         var max = minMax === null || minMax === void 0 ? void 0 : minMax.max;
-        if (max != null) {
-            return readNextIndex(max);
-        } else {
-            return 0;
-        }
+        return max != null ? readNextIndex(max) : 0;
     };
 }
 /**
@@ -4480,11 +4408,7 @@ function reduceNumbersFn(reduceFn, emptyArrayValue) {
     }; //return the max index + 1 by default.
     return function(sortedValues) {
         var lastValueInSorted = lastValue(sortedValues);
-        if (lastValueInSorted != null) {
-            return readNextIndex(lastValueInSorted);
-        } else {
-            return 0;
-        }
+        return lastValueInSorted != null ? readNextIndex(lastValueInSorted) : 0;
     };
 }
 /**
@@ -4503,15 +4427,10 @@ function reduceNumbersFn(reduceFn, emptyArrayValue) {
     var minAndMaxItems = minAndMaxIndexItemsFunction(readIndex);
     var fn = function fn(values) {
         var result = minAndMaxItems(values);
-        if (result != null) {
-            var min = result.min, max = result.max;
-            return {
-                min: readIndex(min),
-                max: readIndex(max)
-            };
-        } else {
-            return null;
-        }
+        return result != null ? {
+            min: readIndex(result.min),
+            max: readIndex(result.max)
+        } : null;
     };
     fn._readIndex = readIndex;
     return fn;
@@ -4642,11 +4561,7 @@ function reduceNumbersFn(reduceFn, emptyArrayValue) {
         var ra = readIndexRange(a);
         var rb = readIndexRange(b);
         var comp = ra.minIndex - rb.minIndex; // sort by smaller minIndexes first
-        if (comp === 0) {
-            return ra.maxIndex - rb.maxIndex; // sort by larger maxIndexes first
-        } else {
-            return comp;
-        }
+        return comp === 0 ? ra.maxIndex - rb.maxIndex : comp; // sort by larger maxIndexes first when equal
     };
 }
 /**
@@ -4670,14 +4585,10 @@ function reduceNumbersFn(reduceFn, emptyArrayValue) {
  * @param input - a single index number or an IndexRange
  * @returns the normalized IndexRange
  */ function indexRange(input) {
-    if (typeof input === 'number') {
-        return {
-            minIndex: input,
-            maxIndex: input + 1
-        };
-    } else {
-        return input;
-    }
+    return typeof input === 'number' ? {
+        minIndex: input,
+        maxIndex: input + 1
+    } : input;
 }
 /**
  * Creates a {@link FitToIndexRangeFunction} that clamps index numbers to the given range boundaries.
@@ -4728,16 +4639,15 @@ function indexRangeCheckReaderFunction(input) {
 }
 function indexRangeCheckFunctionConfigToIndexRange(param) {
     var indexRange = param.indexRange, inclusiveMaxIndex = param.inclusiveMaxIndex;
-    if (inclusiveMaxIndex) {
-        var minIndex = indexRange.minIndex, maxIndexInput = indexRange.maxIndex;
-        var maxIndex = maxIndexInput + 1;
-        return {
-            minIndex: minIndex,
-            maxIndex: maxIndex
-        };
-    } else {
+    if (!inclusiveMaxIndex) {
         return indexRange;
     }
+    var minIndex = indexRange.minIndex, maxIndexInput = indexRange.maxIndex;
+    var maxIndex = maxIndexInput + 1;
+    return {
+        minIndex: minIndex,
+        maxIndex: maxIndex
+    };
 }
 /**
  * Normalizes an {@link IndexRangeFunctionInput} to a full {@link IndexRangeFunctionConfig},
@@ -5272,65 +5182,59 @@ function getArrayNextIndex(array, index) {
             return function() {
                 return {};
             }; // no pairs to match on
-        } else {
-            // pairs sorted in ascending order
-            var pairs = values.map(pairFactory).sort(sortByIndexRangeAscendingCompareFunction(function(x) {
-                return x.range;
-            }));
-            return function(index) {
-                // find the first item that fits the
-                var matchIndex = -1;
-                var i;
-                for(i = 0; i < pairs.length; i += 1){
-                    var comparison = pairs[i];
-                    if (comparison.range.minIndex <= index) {
-                        if (comparison.range.maxIndex > index) {
-                            matchIndex = i;
-                            break;
-                        }
-                    // continue otherwise.
-                    } else {
-                        break; // outside the min index, is not within these values at all
+        }
+        // pairs sorted in ascending order
+        var pairs = values.map(pairFactory).sort(sortByIndexRangeAscendingCompareFunction(function(x) {
+            return x.range;
+        }));
+        return function(index) {
+            // find the first item that fits the
+            var matchIndex = -1;
+            var i;
+            for(i = 0; i < pairs.length; i += 1){
+                var comparison = pairs[i];
+                if (comparison.range.minIndex <= index) {
+                    if (comparison.range.maxIndex > index) {
+                        matchIndex = i;
+                        break;
                     }
-                }
-                var match;
-                var prev;
-                var next;
-                if (matchIndex === -1) {
-                    var _pairs_, _pairs_i;
-                    // no match
-                    match = undefined;
-                    // use i otherwise
-                    prev = (_pairs_ = pairs[i - 1]) === null || _pairs_ === void 0 ? void 0 : _pairs_.value;
-                    next = (_pairs_i = pairs[i]) === null || _pairs_i === void 0 ? void 0 : _pairs_i.value;
+                // continue otherwise.
                 } else {
-                    var _pairs_matchIndex, _pairs_1, _pairs_2;
-                    match = (_pairs_matchIndex = pairs[matchIndex]) === null || _pairs_matchIndex === void 0 ? void 0 : _pairs_matchIndex.value;
-                    prev = (_pairs_1 = pairs[matchIndex - 1]) === null || _pairs_1 === void 0 ? void 0 : _pairs_1.value;
-                    next = (_pairs_2 = pairs[matchIndex + 1]) === null || _pairs_2 === void 0 ? void 0 : _pairs_2.value;
+                    break; // outside the min index, is not within these values at all
                 }
-                var info = {
-                    prev: prev,
-                    match: match,
-                    next: next
-                };
-                return info;
+            }
+            var match;
+            var prev;
+            var next;
+            if (matchIndex === -1) {
+                var _pairs_, _pairs_i;
+                // no match
+                match = undefined;
+                // use i otherwise
+                prev = (_pairs_ = pairs[i - 1]) === null || _pairs_ === void 0 ? void 0 : _pairs_.value;
+                next = (_pairs_i = pairs[i]) === null || _pairs_i === void 0 ? void 0 : _pairs_i.value;
+            } else {
+                var _pairs_matchIndex, _pairs_1, _pairs_2;
+                match = (_pairs_matchIndex = pairs[matchIndex]) === null || _pairs_matchIndex === void 0 ? void 0 : _pairs_matchIndex.value;
+                prev = (_pairs_1 = pairs[matchIndex - 1]) === null || _pairs_1 === void 0 ? void 0 : _pairs_1.value;
+                next = (_pairs_2 = pairs[matchIndex + 1]) === null || _pairs_2 === void 0 ? void 0 : _pairs_2.value;
+            }
+            var info = {
+                prev: prev,
+                match: match,
+                next: next
             };
-        }
+            return info;
+        };
     };
 }
 
 function limitArray(array, inputConfig) {
     if (array && (inputConfig === null || inputConfig === void 0 ? void 0 : inputConfig.limit) != null) {
         var limit = inputConfig.limit, limitFromEnd = inputConfig.limitFromEnd;
-        if (limitFromEnd) {
-            return takeLast(array, limit);
-        } else {
-            return takeFront(array, limit);
-        }
-    } else {
-        return array;
+        return limitFromEnd ? takeLast(array, limit) : takeFront(array, limit);
     }
+    return array;
 }
 
 /**
@@ -5415,12 +5319,7 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
  * @param values - array to generate a random index for
  * @returns a random valid index within the array, or 0 if the array is empty
  */ function randomArrayIndex(values) {
-    if (values.length === 0) {
-        return 0;
-    } else {
-        var random = Math.random();
-        return Math.round(random * (values.length - 1));
-    }
+    return values.length === 0 ? 0 : Math.round(Math.random() * (values.length - 1));
 }
 /**
  * Picks a single item randomly from the input array.
@@ -5467,12 +5366,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
  */ function findIndexOfFirstDuplicateValue(values) {
     var encountered = new Set();
     return values.findIndex(function(x) {
-        if (encountered.has(x)) {
-            return true;
-        } else {
+        var isDuplicate = encountered.has(x);
+        if (!isDuplicate) {
             encountered.add(x);
-            return false;
         }
+        return isDuplicate;
     });
 }
 
@@ -5603,11 +5501,7 @@ function caseInsensitiveString(input) {
  * @returns the prefixed string, or undefined if the input is null/undefined
  */ function addPlusPrefixToNumber(value) {
     var prefix = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : '+';
-    if (value != null) {
-        return value > 0 ? "".concat(prefix).concat(value) : "".concat(value);
-    } else {
-        return undefined;
-    }
+    return value != null ? value > 0 ? "".concat(prefix).concat(value) : "".concat(value) : undefined;
 }
 /**
  * Capitalizes the first letter of the input string.
@@ -5894,30 +5788,29 @@ function caseInsensitiveString(input) {
     var fromStart = config.fromStart, fromEnd = config.fromEnd;
     var takeFromStart = Math.abs(fromStart !== null && fromStart !== void 0 ? fromStart : 0);
     var takeFromEnd = Math.abs(fromEnd !== null && fromEnd !== void 0 ? fromEnd : 0);
+    var result;
     if (fromStart && fromEnd) {
-        return function(input) {
+        result = function result(input) {
             var totalTake = takeFromStart + takeFromEnd;
-            var result;
             if (totalTake >= input.length) {
-                result = input;
-            } else {
-                var startPart = input.slice(0, takeFromStart);
-                var endPart = input.slice(-takeFromEnd);
-                result = startPart + endPart;
+                return input;
             }
-            return result;
+            var startPart = input.slice(0, takeFromStart);
+            var endPart = input.slice(-takeFromEnd);
+            return startPart + endPart;
         };
     } else if (fromStart) {
-        return function(input) {
+        result = function result(input) {
             return input.slice(0, takeFromStart);
         };
     } else if (fromEnd) {
-        return function(input) {
+        result = function result(input) {
             return input.slice(-takeFromEnd);
         };
     } else {
-        return MAP_IDENTITY;
+        result = MAP_IDENTITY;
     }
+    return result;
 }
 
 /**
@@ -5955,11 +5848,7 @@ function caseInsensitiveString(input) {
  * @returns a function that applies the configured transformations to an array of strings
  */ function transformStrings(config) {
     var transform = transformStringFunction(config);
-    if (isMapIdentityFunction(transform)) {
-        return mapIdentityFunction();
-    } else {
-        return mapArrayFunction(transform);
-    }
+    return isMapIdentityFunction(transform) ? mapIdentityFunction() : mapArrayFunction(transform);
 }
 /**
  * Converts an iterable of strings to a lowercase string array for case-insensitive operations.
@@ -6055,19 +5944,15 @@ function caseInsensitiveString(input) {
     var exclude = excludeInput ? asArray(excludeInput) : undefined;
     var transform = transformStrings(config);
     var caseInsensitiveCompare = config.caseInsensitive && !config.toLowercase && !config.toUppercase;
-    if (caseInsensitiveCompare) {
-        // transform after finding unique values
-        return function(input) {
-            return transform(filterUniqueCaseInsensitiveStrings(input, function(x) {
-                return x;
-            }, exclude));
-        };
-    } else {
-        // transform before, and then use a set to find unique values
-        return function(input) {
-            return unique(transform(input), exclude);
-        };
-    }
+    // When case-insensitive compare is needed, transform after finding unique values.
+    // Otherwise, transform before and then use a set to find unique values.
+    return caseInsensitiveCompare ? function(input) {
+        return transform(filterUniqueCaseInsensitiveStrings(input, function(x) {
+            return x;
+        }, exclude));
+    } : function(input) {
+        return unique(transform(input), exclude);
+    };
 }
 
 function _assert_this_initialized$4(self) {
@@ -6583,14 +6468,16 @@ function _unsupported_iterable_to_array$q(o, minLen) {
  * // tuples: [['a', 1], ['c', 'hello']]
  * ```
  */ function filterKeyValueTuplesFunction(filter) {
+    var result;
     if (filter != null) {
         var filterFn = filterKeyValueTupleFunction(filter);
-        return function(obj) {
+        result = function result(obj) {
             return allKeyValueTuples(obj).filter(filterFn);
         };
     } else {
-        return allKeyValueTuples;
+        result = allKeyValueTuples;
     }
+    return result;
 }
 /**
  * Returns all key/value pairs from the object as tuples using `Object.entries`.
@@ -6643,13 +6530,9 @@ function _unsupported_iterable_to_array$q(o, minLen) {
  * @param input - Enum value or filter object
  * @returns Normalized filter object
  */ function filterKeyValueTuplesInputToFilter(input) {
-    if ((typeof input === "undefined" ? "undefined" : _type_of$f(input)) === 'object') {
-        return input;
-    } else {
-        return {
-            valueFilter: input
-        };
-    }
+    return (typeof input === "undefined" ? "undefined" : _type_of$f(input)) === 'object' ? input : {
+        valueFilter: input
+    };
 }
 /**
  * Creates a filter predicate function for key/value tuples based on the provided filter configuration.
@@ -7664,11 +7547,7 @@ function isInSetDecisionFunction(set, inputReadValue) {
  * @param input
  * @returns
  */ function maybeSet(input) {
-    if (input != null) {
-        return new Set(asArray(input));
-    } else {
-        return input;
-    }
+    return input != null ? new Set(asArray(input)) : input;
 }
 
 function _array_like_to_array$o(arr, len) {
@@ -7772,11 +7651,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
                         return claimsValue;
                     },
                     decodeRolesFromValue: function decodeRolesFromValue(value) {
-                        if (value === expectedValue) {
-                            return [];
-                        } else {
-                            return claimRoles;
-                        }
+                        return value === expectedValue ? [] : claimRoles;
                     }
                 };
             } else {
@@ -7791,11 +7666,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
                         return claimsValue;
                     },
                     decodeRolesFromValue: function decodeRolesFromValue(value) {
-                        if (value === expectedValue) {
-                            return claimRoles;
-                        } else {
-                            return [];
-                        }
+                        return value === expectedValue ? claimRoles : [];
                     }
                 };
             }
@@ -8016,11 +7887,7 @@ function _unsupported_iterable_to_array$n(o, minLen) {
  * @returns the modified string, or the original if the decision is false
  */ // eslint-disable-next-line @typescript-eslint/max-params
 function replaceCharacterAtIndexIf(input, index, replacement, decision) {
-    if (decision(input[index])) {
-        return replaceCharacterAtIndexWith(input, index, replacement);
-    } else {
-        return input;
-    }
+    return decision(input[index]) ? replaceCharacterAtIndexWith(input, index, replacement) : input;
 }
 /**
  * Replaces the character at the given index with the replacement string.
@@ -8480,7 +8347,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
 }
 /**
  * Regex matching common phone number formatting characters to strip: parentheses, hyphens, spaces, and dots.
- */ var PHONE_NUMBER_FORMATTING_CHARACTERS_REGEX = /[() \-\.]/g;
+ */ var PHONE_NUMBER_FORMATTING_CHARACTERS_REGEX = /[() \-.]/g;
 /**
  * Attempts to convert a raw phone number string into a valid {@link E164PhoneNumber}.
  *
@@ -8568,11 +8435,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
  */ function asDecisionFunction(valueOrFunction) {
     var defaultIfUndefined = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : true;
     var input = valueOrFunction !== null && valueOrFunction !== void 0 ? valueOrFunction : defaultIfUndefined;
-    if (typeof input === 'boolean') {
-        return decisionFunction(input);
-    } else {
-        return input;
-    }
+    return typeof input === 'boolean' ? decisionFunction(input) : input;
 }
 function isEqualToValueDecisionFunction(equalityValue) {
     var equalityValueCheckFunction;
@@ -9043,11 +8906,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
         if (isFolder) {
             joined = joined + SLASH_PATH_SEPARATOR; // end with a slash.
         }
-        if (startType === 'absolute' || path.startsWith(SLASH_PATH_SEPARATOR)) {
-            return toAbsoluteSlashPathStartType(joined);
-        } else {
-            return joined;
-        }
+        return startType === 'absolute' || path.startsWith(SLASH_PATH_SEPARATOR) ? toAbsoluteSlashPathStartType(joined) : joined;
     };
 }
 /**
@@ -9715,11 +9574,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
  * @returns A `tel:` URL string with the extension appended using `;` if present.
  */ function telUrlStringForE164PhoneNumberPair(pair) {
     // https://stackoverflow.com/questions/9482633/how-do-i-include-extensions-in-the-tel-uri
-    if (pair.extension) {
-        return "tel:".concat(pair.number, ";").concat(pair.extension);
-    } else {
-        return "tel:".concat(pair.number);
-    }
+    return pair.extension ? "tel:".concat(pair.number, ";").concat(pair.extension) : "tel:".concat(pair.number);
 }
 
 /**
@@ -9831,19 +9686,21 @@ function _unsupported_iterable_to_array$j(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;
+    var result;
     if (!emails.length) {
-        return participants;
+        result = participants;
     } else {
         var participantEmails = participants.map(function(x) {
             return x.email;
         });
         var emailsWithoutParticipants = excludeValuesFromArray(emails, participantEmails);
-        return _to_consumable_array$b(participants).concat(_to_consumable_array$b(emailsWithoutParticipants.map(function(email) {
+        result = _to_consumable_array$b(participants).concat(_to_consumable_array$b(emailsWithoutParticipants.map(function(email) {
             return {
                 email: email
             };
         })));
     }
+    return result;
 }
 
 /**
@@ -10239,8 +10096,7 @@ function toReadableError(inputError) {
  * @param buffer - Buffer-like object to check. Only requires the `includes` method.
  * @returns true if the buffer contains a `/Encrypt` entry indicating password protection.
  */ function isPdfPasswordProtected(buffer) {
-    var result = buffer.includes('/Encrypt');
-    return result;
+    return buffer.includes('/Encrypt');
 }
 
 function _array_like_to_array$i(arr, len) {
@@ -11047,16 +10903,15 @@ function _unsupported_iterable_to_array$f(o, minLen) {
             return filterMaybeArrayValues(input.map(function(x) {
                 return map.get(x);
             }));
-        } else {
-            var value = map.get(input);
+        }
+        var value = map.get(input);
+        if (value == null) {
+            value = defaultValue(input);
             if (value == null) {
-                value = defaultValue(input);
-                if (value == null) {
-                    throw new Error("Encountered unknown value ".concat(input, " in primativeKeyDencoder."));
-                }
+                throw new Error("Encountered unknown value ".concat(input, " in primativeKeyDencoder."));
             }
-            return value;
         }
+        return value;
     };
     fn._map = map;
     return fn;
@@ -11099,10 +10954,9 @@ function _unsupported_iterable_to_array$f(o, minLen) {
         if (typeof input === 'string') {
             var split = splitEncodedValues(input);
             return dencoder(split);
-        } else {
-            var encoded = dencoder(input);
-            return encoded.join(joiner);
         }
+        var encoded = dencoder(input);
+        return encoded.join(joiner);
     };
 }
 /**
@@ -12402,11 +12256,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  * @returns a function that returns `true` if the input is within the reference bound
  */ function isWithinLatLngBoundFunction(bound) {
     var fn = function fn(boundOrPoint) {
-        if (isLatLngPoint(boundOrPoint)) {
-            return isLatLngPointWithinLatLngBound(boundOrPoint, bound);
-        } else {
-            return isLatLngBoundWithinLatLngBound(boundOrPoint, bound);
-        }
+        return isLatLngPoint(boundOrPoint) ? isLatLngPointWithinLatLngBound(boundOrPoint, bound) : isLatLngBoundWithinLatLngBound(boundOrPoint, bound);
     };
     fn._bound = bound;
     return fn;
@@ -12438,15 +12288,14 @@ function _unsupported_iterable_to_array$d(o, minLen) {
     var sw = within.sw, ne = within.ne;
     var lat = point.lat, lng = point.lng;
     var latIsBounded = lat >= sw.lat && lat <= ne.lat;
-    if (latIsBounded) {
-        if (latLngBoundStrictlyWrapsMap(within)) {
-            // included if between sw to the max possible value/bound (180), and ne to the min possible value/bound (-180)
-            return lng >= sw.lng || lng <= ne.lng;
-        } else {
-            return lng >= sw.lng && lng <= ne.lng;
-        }
+    if (!latIsBounded) {
+        return false;
     }
-    return false;
+    if (latLngBoundStrictlyWrapsMap(within)) {
+        // included if between sw to the max possible value/bound (180), and ne to the min possible value/bound (-180)
+        return lng >= sw.lng || lng <= ne.lng;
+    }
+    return lng >= sw.lng && lng <= ne.lng;
 }
 /**
  * Checks whether two bounds overlap each other.
@@ -12467,11 +12316,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
  */ function overlapsLatLngBoundFunction(bound) {
     var a = boundToRectangle(bound);
     var fn = function fn(boundOrPoint) {
-        if (isLatLngPoint(boundOrPoint)) {
-            return isLatLngPointWithinLatLngBound(boundOrPoint, bound);
-        } else {
-            return rectangleOverlapsRectangle(a, boundToRectangle(boundOrPoint));
-        }
+        return isLatLngPoint(boundOrPoint) ? isLatLngPointWithinLatLngBound(boundOrPoint, bound) : rectangleOverlapsRectangle(a, boundToRectangle(boundOrPoint));
     };
     fn._bound = bound;
     return fn;
@@ -12791,13 +12636,15 @@ function isConsideredUtcTimezoneString(timezone) {
     return "".concat(year, "-").concat(month, "-").concat(day);
 }
 function dateFromDateOrTimeMillisecondsNumber(input) {
+    var result;
     if (input == null) {
-        return input;
+        result = input;
     } else if (isDate(input)) {
-        return input;
+        result = input;
     } else {
-        return unixMillisecondsNumberToDate(input);
+        result = unixMillisecondsNumberToDate(input);
     }
+    return result;
 }
 /**
  * Converts a unix timestamp number to a Date object.
@@ -13907,28 +13754,29 @@ function _object_spread$7(target) {
  * @param b - Second array (or single value) of partial objects
  * @returns 2D array where result[i][j] is `{ ...a[i], ...b[j] }`
  */ function objectMergeMatrix(a, b) {
+    var result;
     if (a && b) {
         var aNorm = convertToArray(a);
         var bNorm = convertToArray(b);
-        var results = aNorm.map(function(a) {
+        result = aNorm.map(function(a) {
             return bNorm.map(function(b) {
                 return _object_spread$7({}, a, b);
             });
         });
-        return results;
     } else if (a) {
-        return [
+        result = [
             convertToArray(a)
         ];
     } else if (b) {
-        return [
+        result = [
             convertToArray(b)
         ];
     } else {
-        return [
+        result = [
             []
         ];
     }
+    return result;
 }
 
 function _type_of$6(obj) {
@@ -13980,13 +13828,15 @@ function _type_of$6(obj) {
  * @param input - Date object or unix timestamp number to convert
  * @returns Unix timestamp number if input is valid, null/undefined if input is null/undefined
  */ function unixDateTimeSecondsNumberFromDateOrTimeNumber(input) {
+    var result;
     if (input == null) {
-        return input;
+        result = input;
     } else if (isDate(input)) {
-        return unixDateTimeSecondsNumberFromDate(input);
+        result = unixDateTimeSecondsNumberFromDate(input);
     } else {
-        return input;
+        result = input;
     }
+    return result;
 }
 /**
  * Gets the current time as a unix timestamp number.
@@ -13999,13 +13849,15 @@ function unixDateTimeSecondsNumberFromDate(date) {
     return date != null ? Math.ceil(date.getTime() / 1000) : date;
 }
 function dateFromDateOrTimeSecondsNumber(input) {
+    var result;
     if (input == null) {
-        return input;
+        result = input;
     } else if (isDate(input)) {
-        return input;
+        result = input;
     } else {
-        return unixDateTimeSecondsNumberToDate(input);
+        result = unixDateTimeSecondsNumberToDate(input);
     }
+    return result;
 }
 /**
  * Converts a unix timestamp number to a Date object.
@@ -14361,13 +14213,15 @@ function _unsupported_iterable_to_array$a(o, minLen) {
  * @param days - The number of days to offset (positive or negative)
  * @returns The resulting DayOfWeek
  */ function getDayOffset(day, days) {
+    var result;
     if (days === 0) {
-        return day;
+        result = day;
     } else if (days < 0) {
-        return getPreviousDay(day, days);
+        result = getPreviousDay(day, days);
     } else {
-        return getNextDay(day, days);
+        result = getNextDay(day, days);
     }
+    return result;
 }
 /**
  * Returns the DayOfWeek that is the given number of days before the input day.
@@ -14778,11 +14632,7 @@ function waitForMs(ms, value) {
 }
 
 function mapPromiseOrValue(input, mapFn) {
-    if (isPromise(input)) {
-        return input.then(mapFn);
-    } else {
-        return mapFn(input);
-    }
+    return isPromise(input) ? input.then(mapFn) : mapFn(input);
 }
 
 function _define_property$a(obj, key, value) {
@@ -15407,21 +15257,19 @@ function _performAsyncTask(_0, _1) {
                                         return doNextTry();
                                     }) : doNextTry()
                                 ];
-                            } else {
-                                // Error out.
-                                if (throwError) {
-                                    throw result[0];
-                                } else {
-                                    return [
-                                        2,
-                                        [
-                                            value,
-                                            undefined,
-                                            false
-                                        ]
-                                    ];
-                                }
                             }
+                            // Error out.
+                            if (throwError) {
+                                throw result[0];
+                            }
+                            return [
+                                2,
+                                [
+                                    value,
+                                    undefined,
+                                    false
+                                ]
+                            ];
                     }
                 });
             })();
@@ -15483,11 +15331,7 @@ function _performAsyncTask(_0, _1) {
         if (maxParallelTasks && !nonConcurrentTaskKeyFactory) {
             result = function result(input) {
                 // if there is no custom nonConcurrentTaskKeyFactory, then we can just run all tasks at once and skip the overhead of performTasksInParallel if the input has less than the maxParallelTasks
-                if (input.length <= maxParallelTasks) {
-                    return performAllTasksInUnlimitedParallel(input);
-                } else {
-                    return performTasksWithInput(input);
-                }
+                return input.length <= maxParallelTasks ? performAllTasksInUnlimitedParallel(input) : performTasksWithInput(input);
             };
         } else {
             result = performTasksWithInput;
@@ -15520,25 +15364,20 @@ function _performAsyncTask(_0, _1) {
                             return [
                                 2
                             ];
+                        }
+                        promiseRef = promiseReference();
+                        if (isFulfillingTask) {
+                            requestTasksQueue.push([
+                                parallelIndex,
+                                promiseRef
+                            ]);
                         } else {
-                            promiseRef = promiseReference();
-                            if (isFulfillingTask) {
-                                requestTasksQueue.push([
-                                    parallelIndex,
-                                    promiseRef
-                                ]);
-                                return [
-                                    2,
-                                    promiseRef.promise
-                                ];
-                            } else {
-                                void fulfillRequestMoreTasks(parallelIndex, promiseRef);
-                            }
-                            return [
-                                2,
-                                promiseRef.promise
-                            ];
+                            void fulfillRequestMoreTasks(parallelIndex, promiseRef);
                         }
+                        return [
+                            2,
+                            promiseRef.promise
+                        ];
                     });
                 })();
             };
@@ -15873,11 +15712,7 @@ function _object_spread$4(target) {
             currentCount = count + increasedExecutions;
             timeOfLastExecution = new Date();
         }
-        if (effectiveCount >= countForMaxWaitTime) {
-            return config.maxWaitTime;
-        } else {
-            return (Math.pow(config.exponentRate, Math.max(effectiveCount, 0)) - 1) * MS_IN_SECOND;
-        }
+        return effectiveCount >= countForMaxWaitTime ? config.maxWaitTime : (Math.pow(config.exponentRate, Math.max(effectiveCount, 0)) - 1) * MS_IN_SECOND;
     }
     function getNextWaitTime(increase) {
         return _nextWaitTime(increase !== null && increase !== void 0 ? increase : 0);
@@ -16824,11 +16659,7 @@ function _is_native_reflect_construct$2() {
  * @returns a Date representing the estimated end time, or null if no duration remains
  */ function approximateTimerEndDate(timer) {
     var durationRemaining = timer.durationRemaining;
-    if (durationRemaining != null) {
-        return new Date(Date.now() + durationRemaining);
-    } else {
-        return null;
-    }
+    return durationRemaining != null ? new Date(Date.now() + durationRemaining) : null;
 }
 
 /**
@@ -17845,11 +17676,7 @@ function _object_spread$2(target) {
  * @param config - The host and port configuration, or null/undefined
  * @returns The joined string, or null/undefined if config is null/undefined
  */ function joinHostAndPort(config) {
-    if (config) {
-        return "".concat(config.host, ":").concat(config.port);
-    } else {
-        return config;
-    }
+    return config ? "".concat(config.host, ":").concat(config.port) : config;
 }
 
 function _array_like_to_array$4(arr, len) {
@@ -17963,9 +17790,8 @@ function _unsupported_iterable_to_array$4(o, minLen) {
                     var _separateValues1 = separateValues(mods, mask), modModify = _separateValues1.included;
                     var modifiedResults = this._modifyCollectionWithoutMask(currentModify, change, modModify, config);
                     return this._mergeMaskResults(current, currentRetain, modifiedResults, readKey);
-                } else {
-                    return this._modifyCollectionWithoutMask(current, change, mods, config);
                 }
+                return this._modifyCollectionWithoutMask(current, change, mods, config);
             }
         },
         {
@@ -18089,11 +17915,7 @@ function _unsupported_iterable_to_array$4(o, minLen) {
      * @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 {
-                    return modifyCollection(current, mods);
-                }
+                return readType ? ModelRelationUtility._modifyMultiTypeCollection(current, mods, readType, modifyCollection) : modifyCollection(current, mods);
             }
         },
         {
@@ -18109,11 +17931,7 @@ function _unsupported_iterable_to_array$4(o, minLen) {
                     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 : [];
                     // Only modify if they've got changes for their type.
-                    if (_$mods.length === 0) {
-                        return values; // No mods, no change to those types.
-                    } else {
-                        return modifyCollection(values, _$mods);
-                    }
+                    return _$mods.length === 0 ? values : modifyCollection(values, _$mods);
                 });
                 // Rejoin all changes.
                 return modifiedSubcollections.reduce(function(x, y) {
@@ -18188,28 +18006,26 @@ function _unsupported_iterable_to_array$4(o, minLen) {
      * @returns The collection with matching items removed.
      */ // 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);
-                        var map = new Map(currentKeyPairs);
-                        remove.forEach(function(x) {
-                            var key = readKey(x);
-                            var removalTarget = map.get(key);
-                            if (removalTarget && shouldRemove(removalTarget)) {
-                                map.delete(key); // Remove from the map.
-                            }
-                        });
-                        return currentKeyPairs.filter(function(x) {
-                            return map.has(x[0]);
-                        }).map(function(x) {
-                            return x[1];
-                        }); // Retain order, remove from map.
-                    } else {
-                        return ModelRelationUtility.removeKeysFromCollection(current, remove.map(readKey), readKey);
-                    }
-                } else {
+                if (!(current === null || current === void 0 ? void 0 : current.length)) {
                     return [];
                 }
+                if (shouldRemove) {
+                    var currentKeyPairs = makeKeyPairs(current, readKey);
+                    var map = new Map(currentKeyPairs);
+                    remove.forEach(function(x) {
+                        var key = readKey(x);
+                        var removalTarget = map.get(key);
+                        if (removalTarget && shouldRemove(removalTarget)) {
+                            map.delete(key); // Remove from the map.
+                        }
+                    });
+                    return currentKeyPairs.filter(function(x) {
+                        return map.has(x[0]);
+                    }).map(function(x) {
+                        return x[1];
+                    }); // Retain order, remove from map.
+                }
+                return ModelRelationUtility.removeKeysFromCollection(current, remove.map(readKey), readKey);
             }
         },
         {
@@ -19424,11 +19240,7 @@ function _unsupported_iterable_to_array(o, minLen) {
     var separator = config.separator, mergeMeta = config.mergeMeta;
     var value = inputValue.value, leafMeta = inputValue.leafMeta, nodeMeta = inputValue.nodeMeta;
     function nextMeta(node, nextMeta) {
-        if (mergeMeta && node.meta != null) {
-            return mergeMeta(node.meta, nextMeta);
-        } else {
-            return nextMeta;
-        }
+        return mergeMeta && node.meta != null ? mergeMeta(node.meta, nextMeta) : nextMeta;
     }
     var parts = value.split(separator);
     var currentNode = tree;
@@ -19956,13 +19768,9 @@ function invertMaybeBoolean(x) {
     var rFn = function rFn(array) {
         return Boolean(array.reduce(reduceFn));
     };
-    if (emptyArrayValue != null) {
-        return function(array) {
-            return array.length ? rFn(array) : emptyArrayValue;
-        };
-    } else {
-        return rFn;
-    }
+    return emptyArrayValue != null ? function(array) {
+        return array.length ? rFn(array) : emptyArrayValue;
+    } : rFn;
 }
 /**
  * Creates a new BooleanFactory that generates random boolean values based on chance.