@dereekb/util 13.10.9 → 13.11.0

package/index.cjs.js

@@ -55,6 +55,11 @@ function _unsupported_iterable_to_array$B(o, minLen) {
  *
  * By default treats strings as a non-iterable value, using the string as a single value.
  *
+ * @dbxUtil
+ * @dbxUtilCategory iterable
+ * @dbxUtilTags iterable, array, convert, normalize, ensure
+ * @dbxUtilRelated iterable-to-set, iterable-to-map, as-iterable
+ *
  * @param values - The value or iterable to convert
  * @param treatStringAsIterable - Whether to treat strings as iterable (defaults to false)
  * @returns An array containing the value(s)
@@ -78,6 +83,11 @@ function _unsupported_iterable_to_array$B(o, minLen) {
  *
  * By default treats strings as a non-iterable value, using the string as a single value.
  *
+ * @dbxUtil
+ * @dbxUtilCategory iterable
+ * @dbxUtilTags iterable, set, convert, normalize, unique, dedupe
+ * @dbxUtilRelated iterable-to-array, iterable-to-map
+ *
  * @param values - The value or iterable to convert
  * @param treatStringAsIterable - Whether to treat strings as iterable (defaults to false)
  * @returns A Set containing the value(s)
@@ -103,6 +113,11 @@ function _unsupported_iterable_to_array$B(o, minLen) {
  * Type guard that returns true if the input is an Iterable.
  * By default, strings are not treated as iterable.
  *
+ * @dbxUtil
+ * @dbxUtilCategory iterable
+ * @dbxUtilTags iterable, type-guard, check, symbol-iterator
+ * @dbxUtilRelated is-empty-iterable, as-iterable
+ *
  * @param values - The value to check
  * @param treatStringAsIterable - Whether to treat strings as iterable (defaults to false)
  * @returns True if the value is iterable
@@ -119,6 +134,11 @@ function _unsupported_iterable_to_array$B(o, minLen) {
 /**
  * Returns true if the iterable has no values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory iterable
+ * @dbxUtilTags iterable, empty, check, length
+ * @dbxUtilRelated is-iterable, first-value-from-iterable
+ *
  * @param values - The iterable to check
  * @returns True if the iterable is empty
  */ function isEmptyIterable(values) {
@@ -412,6 +432,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Converts the input value to an array containing itself, or returns itself if it is a non-empty array. Returns undefined if the input is nullish or results in an empty array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, non-empty, convert, ensure, normalize
+ * @dbxUtilRelated convert-maybe-to-array, convert-to-array
+ *
  * @param arrayOrValue - single value or array to convert
  * @returns an array with at least one element, or undefined if the result would be empty
  */ function convertMaybeToNonEmptyArray(arrayOrValue) {
@@ -427,6 +452,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Converts the input value to an array containing itself, or returns itself if it is an array. Returns an empty array if the input is nullish.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, convert, ensure, normalize, maybe, nullish
+ * @dbxUtilRelated convert-maybe-to-non-empty-array, convert-to-array, as-array
+ *
  * @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) {
@@ -441,6 +471,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Converts the input value to an array containing itself, or returns itself if it is already an array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, convert, ensure, wrap, normalize
+ * @dbxUtilRelated convert-maybe-to-array, convert-maybe-to-non-empty-array
+ *
  * @param arrayOrValue - single value or array to convert
  * @returns the input array unchanged, or a new single-element array wrapping the input value
  */ function convertToArray(arrayOrValue) {
@@ -451,6 +486,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Returns the first value from the array, or the value itself if not an array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, first, head, get, value
+ * @dbxUtilRelated last-value, value-at-index, first-and-last-value
+ *
  * @param input - single value or array to retrieve from
  * @returns the first element of the array, or the input value itself
  */ function firstValue(input) {
@@ -459,6 +499,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Returns the last value from the array, or the value itself if not an array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, last, tail, get, value
+ * @dbxUtilRelated first-value, value-at-index, first-and-last-value
+ *
  * @param input - single value or array to retrieve from
  * @returns the last element of the array, or the input value itself
  */ function lastValue(input) {
@@ -469,6 +514,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
  *
  * If the input is not an array, returns that value as both the first and last value.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, first, last, head, tail, tuple, endpoints
+ * @dbxUtilRelated first-value, last-value, value-at-index
+ *
  * @param input - single value or array to retrieve from
  * @returns a two-element tuple of the first and last values
  */ function firstAndLastValue(input) {
@@ -482,6 +532,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Returns the value at the given index from an array, or the value itself if not an array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, index, get, value, at
+ * @dbxUtilRelated first-value, last-value, first-and-last-value
+ *
  * @param input - single value or array to retrieve from
  * @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
@@ -491,6 +546,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Concatenates the input arrays into a single array, filtering out nullish entries.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, concat, concatenate, combine, flatten, merge
+ * @dbxUtilRelated flatten-array, merge-arrays
+ *
  * @param arrays - arrays to concatenate; nullish entries are ignored
  * @returns a single flattened array containing all elements from the non-nullish input arrays
  */ function concatArrays() {
@@ -502,6 +562,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Flattens a two-dimensional array into a single-dimensional array. Any null/undefined entries in the outer dimension are filtered out.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, flatten, flat, nested, two-dimensional, concat
+ * @dbxUtilRelated concat-arrays, flatten-array-or-value-array, merge-arrays
+ *
  * @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) {
@@ -521,6 +586,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Creates a shallow copy of the input array. Returns an empty array if the input is nullish.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, copy, clone, shallow, duplicate
+ * @dbxUtilRelated convert-maybe-to-array
+ *
  * @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) {
@@ -542,6 +612,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Merges all input arrays into a single new array. Nullish entries are ignored.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, merge, concat, flatten, combine
+ * @dbxUtilRelated merge-arrays-into-array
+ *
  * @param arrays - arrays to merge; nullish entries are skipped
  * @returns a new array containing all elements from the provided arrays
  */ function mergeArrays(arrays) {
@@ -595,6 +670,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Copies/takes the elements from the front of the array up to the specified maximum.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, take, front, head, slice, limit
+ * @dbxUtilRelated take-last, split-front
+ *
  * @param values - source array to take from
  * @param maxToTake - maximum number of elements to take from the front
  * @returns a new array containing at most maxToTake elements from the front
@@ -604,6 +684,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Splits the array into two arrays, the first being the front of the array up to the maxToTake, and the second being the remaining values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, split, partition, front, slice
+ * @dbxUtilRelated take-front, take-last
+ *
  * @param values The array to split.
  * @param maxToTake The maximum number of values to take from the front of the array.
  * @returns The front and remaining values.
@@ -617,6 +702,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Copies/takes as many elements as possible from the end.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, take, last, tail, end, slice, limit
+ * @dbxUtilRelated take-front, split-front
+ *
  * @param values Values to take from.
  * @param maxToTake Max number of values to take from the end of the input array.
  * @param keepFromFront Number of values to retain in the front of the array. These are not taken.
@@ -654,6 +744,11 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Counts the total number of elements across all inner arrays of a nested array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, count, nested, total, length, two-dimensional
+ * @dbxUtilRelated flatten-array
+ *
  * @param array - two-dimensional array whose elements are counted
  * @returns the total number of elements across all inner arrays
  */ function countAllInNestedArray(array) {
@@ -664,6 +759,10 @@ function _unsupported_iterable_to_array$A(o, minLen) {
 /**
  * Creates a copy of the array with the items at the specified indexes removed.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, remove, exclude, indexes, filter, copy
+ *
  * @param array - source array to copy from
  * @param removeIndexes - indexes of elements to exclude from the copy
  * @returns a new array without the elements at the specified indexes
@@ -788,6 +887,11 @@ function _unsupported_iterable_to_array$z(o, minLen) {
 /**
  * Converts an {@link IterableOrValue} into a Set. Strings are treated as single values rather than character iterables.
  *
+ * @dbxUtil
+ * @dbxUtilCategory set
+ * @dbxUtilTags set, convert, normalize, ensure, unique, dedupe
+ * @dbxUtilRelated add-to-set, iterable-to-set
+ *
  * @param values - The value or iterable to convert.
  * @returns A new Set containing all values.
  */ function asSet(values) {
@@ -827,6 +931,11 @@ function _unsupported_iterable_to_array$z(o, minLen) {
 /**
  * Adds one or more values to the given set in place.
  *
+ * @dbxUtil
+ * @dbxUtilCategory set
+ * @dbxUtilTags set, add, mutate, insert, in-place
+ * @dbxUtilRelated add-to-set-copy, remove-from-set, toggle-in-set
+ *
  * @param set - The set to add values to.
  * @param values - The value or iterable of values to add.
  */ function addToSet(set, values) {
@@ -848,6 +957,11 @@ function _unsupported_iterable_to_array$z(o, minLen) {
 /**
  * Toggles values in the set in place: adds if absent, removes if present.
  *
+ * @dbxUtil
+ * @dbxUtilCategory set
+ * @dbxUtilTags set, toggle, add, remove, mutate, in-place
+ * @dbxUtilRelated toggle-in-set-copy, add-to-set, remove-from-set
+ *
  * @param set - The set to modify.
  * @param values - The values to toggle.
  */ function toggleInSet(set, values) {
@@ -1329,6 +1443,12 @@ function _unsupported_iterable_to_array$y(o, minLen) {
  * When mode is `'any'`, the resulting function returns `true` if at least one element satisfies the predicate.
  * When mode is `'all'`, it returns `true` only if every element satisfies the predicate.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilKind factory
+ * @dbxUtilTags array, decision, predicate, find, every, some, all, any, factory
+ * @dbxUtilRelated array-decision
+ *
  * @param decision - Predicate used to test individual elements.
  * @param mode - Whether all or any elements must satisfy the predicate.
  * @returns A function that evaluates an array against the configured decision criteria.
@@ -1343,6 +1463,11 @@ function _unsupported_iterable_to_array$y(o, minLen) {
 /**
  * Convenience wrapper that creates and immediately invokes an {@link ArrayDecisionFunction}.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, decision, predicate, find, every, some, all, any
+ * @dbxUtilRelated array-decision-function
+ *
  * @param values - Array to evaluate.
  * @param decision - Predicate used to test individual elements.
  * @param mode - Whether all or any elements must satisfy the predicate.
@@ -1351,7 +1476,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
     return arrayDecisionFunction(decision, mode)(values);
 }
 
-function _define_property$m(obj, key, value) {
+function _define_property$n(obj, key, value) {
     if (key in obj) {
         Object.defineProperty(obj, key, {
             value: value,
@@ -1364,7 +1489,7 @@ function _define_property$m(obj, key, value) {
     }
     return obj;
 }
-function _object_spread$f(target) {
+function _object_spread$g(target) {
     for(var i = 1; i < arguments.length; i++){
         var source = arguments[i] != null ? arguments[i] : {};
         var ownKeys = Object.keys(source);
@@ -1374,7 +1499,7 @@ function _object_spread$f(target) {
             }));
         }
         ownKeys.forEach(function(key) {
-            _define_property$m(target, key, source[key]);
+            _define_property$n(target, key, source[key]);
         });
     }
     return target;
@@ -1382,6 +1507,11 @@ function _object_spread$f(target) {
 /**
  * Checks whether the object has no own enumerable keys.
  *
+ * @dbxUtil
+ * @dbxUtilCategory object
+ * @dbxUtilTags object, empty, keys, check, type-guard
+ * @dbxUtilRelated object-has-key, object-has-keys, has-value-or-not-empty-object
+ *
  * @param obj - Object to check
  * @returns `true` if the object has zero keys
  */ function objectHasNoKeys(obj) {
@@ -1411,6 +1541,10 @@ function objectHasKeys(obj, keys, mode) {
 /**
  * Converts a Map to a plain object by iterating entries and assigning key-value pairs.
  *
+ * @dbxUtil
+ * @dbxUtilCategory object
+ * @dbxUtilTags object, map, convert, transform, dictionary
+ *
  * @param map - Map to convert
  * @returns A plain object with the same key-value pairs
  */ function mapToObject(map) {
@@ -1423,10 +1557,15 @@ function objectHasKeys(obj, keys, mode) {
 /**
  * Creates a shallow copy of an object using the spread operator.
  *
+ * @dbxUtil
+ * @dbxUtilCategory object
+ * @dbxUtilTags object, copy, clone, shallow, spread
+ * @dbxUtilRelated copy-array
+ *
  * @param input - Object to copy
  * @returns A new object with the same properties
  */ function copyObject(input) {
-    return _object_spread$f({}, input);
+    return _object_spread$g({}, input);
 }
 
 function _type_of$l(obj) {
@@ -1436,6 +1575,11 @@ function _type_of$l(obj) {
 /**
  * Type guard that returns `true` if the value is not `null` or `undefined`.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, nullish, type-guard, defined, not-null, value
+ * @dbxUtilRelated is-maybe-so, is-maybe-not, has-value-or-not-empty
+ *
  * @param value - the value to check
  * @returns `true` if the value is not `null` or `undefined`
  */ function hasNonNullValue(value) {
@@ -1450,6 +1594,11 @@ function _type_of$l(obj) {
  *
  * NaN has undefined behavior.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, empty, type-guard, non-empty, value, has-value
+ * @dbxUtilRelated has-value-or-not-empty-object, has-non-null-value, is-not-null-or-empty-string
+ *
  * @param value - the value to check
  * @returns `true` if the value is non-nullish and not empty
  */ function hasValueOrNotEmpty(value) {
@@ -1463,6 +1612,11 @@ function _type_of$l(obj) {
  *
  * NaN has undefined behavior.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, empty, type-guard, object, non-empty, strict
+ * @dbxUtilRelated has-value-or-not-empty, has-non-null-value, object-has-no-keys
+ *
  * @param value - the value to check
  * @returns `true` if the value is non-nullish, non-empty, and not an empty object
  */ function hasValueOrNotEmptyObject(value) {
@@ -1489,6 +1643,11 @@ function _type_of$l(obj) {
  *
  * Useful for filtering out both nullish values and empty strings in a single check.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, string, empty, type-guard, nullish, non-empty
+ * @dbxUtilRelated has-value-or-not-empty, has-non-null-value
+ *
  * @param value - the value to check
  * @returns `true` if the value is not nullish and not an empty string
  */ function isNotNullOrEmptyString(value) {
@@ -1497,6 +1656,11 @@ function _type_of$l(obj) {
 /**
  * Type guard that returns `true` if the input is `null` or `undefined`.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, nullish, type-guard, null, undefined, missing
+ * @dbxUtilRelated is-maybe-so, has-non-null-value
+ *
  * @param value - the value to check
  * @returns `true` if the value is `null` or `undefined`
  */ function isMaybeNot(value) {
@@ -1507,6 +1671,11 @@ function _type_of$l(obj) {
  *
  * Equivalent to {@link hasNonNullValue} but with the `MaybeSo` narrowing type.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, nullish, type-guard, defined, present, non-null
+ * @dbxUtilRelated is-maybe-not, has-non-null-value
+ *
  * @param value - the value to check
  * @returns `true` if the value is neither `null` nor `undefined`
  */ function isMaybeSo(value) {
@@ -1525,6 +1694,11 @@ function _type_of$l(obj) {
 /**
  * Returns `true` if the input is not `null`, `undefined`, or `false`.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, boolean, defined, truthy, type-guard
+ * @dbxUtilRelated is-not-false, has-non-null-value
+ *
  * @param value - the value to check
  * @returns `true` if the value is not `null`, `undefined`, or `false`
  */ function isDefinedAndNotFalse(value) {
@@ -1541,6 +1715,11 @@ function _type_of$l(obj) {
 /**
  * Returns `true` if both inputs are non-nullish and strictly equal (`===`).
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, equal, equality, compare, non-null
+ * @dbxUtilRelated values-are-both-nullish-or-equivalent, has-non-null-value
+ *
  * @param a - first value
  * @param b - second value
  * @returns `true` if both values are non-nullish and strictly equal
@@ -1552,6 +1731,11 @@ function _type_of$l(obj) {
  *
  * This means `null` and `undefined` are considered equivalent to each other, but `false` and `null` are not.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, equal, equality, nullish, compare
+ * @dbxUtilRelated is-same-non-null-value
+ *
  * @param a - first value
  * @param b - second value
  * @returns `true` if both are nullish or both are the same value
@@ -1565,6 +1749,10 @@ function _type_of$l(obj) {
  * - If `b` is `null`, returns `null` (explicit clear).
  * - If `b` is defined, returns `b` (new value).
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags maybe, update, merge, sentinel, patch, optional
+ *
  * @param a - the current value
  * @param b - the update value
  * @returns `a` if `b` is undefined, otherwise `b`
@@ -1593,12 +1781,22 @@ function _type_of$l(obj) {
 /**
  * Filters all maybe values from the input array. If a maybe value is input, returns an empty array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, filter, maybe, nullish, non-null, defined, compact
+ * @dbxUtilRelated filter-empty-array-values, filter-maybe-array-function
+ *
  * @param values - Optional array of optional values to filter.
  * @returns An array containing only non-null and non-undefined values.
  */ var filterMaybeArrayValues = filterMaybeArrayFunction(hasNonNullValue);
 /**
  * Filters all empty and maybe values from the input array. If a maybe value is input, returns an empty array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, filter, empty, maybe, nullish, non-empty, compact
+ * @dbxUtilRelated filter-maybe-array-values, filter-maybe-array-function
+ *
  * @param values - Optional array of optional values to filter.
  * @returns An array containing only non-null, non-undefined, and non-empty values.
  */ var filterEmptyArrayValues = filterMaybeArrayFunction(hasValueOrNotEmpty);
@@ -1633,6 +1831,10 @@ function _type_of$l(obj) {
  * @param config.build - function that mutates the base object to populate it with desired values
  * @returns the fully constructed object of type T
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags build, builder, construct, mutate, configure, factory
+ *
  * @example
  * ```ts
  * interface User { name: string; age: number; }
@@ -1657,6 +1859,12 @@ function _type_of$l(obj) {
  * @param mapFunction - function to apply only when the input is defined
  * @returns a new function that short-circuits on null/undefined inputs
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind factory
+ * @dbxUtilTags map, transform, maybe, nullish, factory, optional
+ * @dbxUtilRelated map-array-function, map-identity-function
+ *
  * @example
  * ```ts
  * const double = (x: number) => x * 2;
@@ -1675,6 +1883,12 @@ function _type_of$l(obj) {
 /**
  * Lifts a per-element MapFunction into one that operates on arrays, applying the mapping to each element.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind factory
+ * @dbxUtilTags map, transform, array, lift, factory
+ * @dbxUtilRelated map-maybe-function, chain-map-functions
+ *
  * @param mapFunction - per-element transformation
  * @returns a function that maps entire arrays
  */ function mapArrayFunction(mapFunction) {
@@ -1688,6 +1902,12 @@ 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.
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind const
+ * @dbxUtilTags map, identity, no-op, sentinel, pass-through, constant
+ * @dbxUtilRelated map-identity-function, is-map-identity-function
+ *
  * @param input - the value to pass through unchanged
  * @returns the same input value, unmodified
  */ var MAP_IDENTITY = function MAP_IDENTITY(input) {
@@ -1757,6 +1977,11 @@ function _type_of$l(obj) {
  * @param input - one or more optional same-type map functions to chain
  * @returns a single composed function that runs all provided functions in order
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags map, chain, compose, pipeline, identity, transform
+ * @dbxUtilRelated chain-map-function, map-identity-function
+ *
  * @example
  * ```ts
  * const fnChain = chainMapSameFunctions([
@@ -1823,6 +2048,11 @@ function _unsupported_iterable_to_array$x(o, minLen) {
 /**
  * Concatenates multiple arrays and returns only unique values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, unique, concat, distinct, dedupe, deduplicate
+ * @dbxUtilRelated unique, flatten-array-unique, concat-arrays
+ *
  * @param arrays - Arrays to concatenate. Null/undefined arrays are ignored.
  * @returns Array containing only unique values from all input arrays.
  */ function concatArraysUnique() {
@@ -1834,6 +2064,11 @@ function _unsupported_iterable_to_array$x(o, minLen) {
 /**
  * Flattens a 2D array and returns only unique values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, flatten, unique, distinct, dedupe, nested
+ * @dbxUtilRelated unique, concat-arrays-unique, flatten-array
+ *
  * @param array - Two-dimensional array to flatten and deduplicate.
  * @returns Array containing only unique values from the flattened input.
  */ function flattenArrayUnique(array) {
@@ -1842,6 +2077,11 @@ function _unsupported_iterable_to_array$x(o, minLen) {
 /**
  * Filters the input values and only returns unique values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, unique, distinct, dedupe, deduplicate, set
+ * @dbxUtilRelated filter-unique-values, filter-unique-function, concat-arrays-unique
+ *
  * @param values - Array of primitive-key values to deduplicate.
  * @param excludeInput - Optional keys or values to exclude from the result.
  * @returns Array containing only unique values with exclusions removed.
@@ -1880,6 +2120,12 @@ function _unsupported_iterable_to_array$x(o, minLen) {
 /**
  * Creates a {@link FilterUniqueFunction} that deduplicates items by their computed key.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilKind factory
+ * @dbxUtilTags array, unique, distinct, dedupe, factory, key, filter
+ * @dbxUtilRelated filter-unique-values, unique, allow-value-once-filter
+ *
  * @param readKey - Function to extract a unique key from each item.
  * @param additionalKeysInput - Optional keys or values to pre-seed as already seen, causing them to be excluded.
  * @returns A reusable filter function that removes duplicate items from arrays.
@@ -1909,6 +2155,11 @@ function _unsupported_iterable_to_array$x(o, minLen) {
 /**
  * Filters an array to contain only items with unique keys.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, unique, filter, dedupe, key, distinct
+ * @dbxUtilRelated filter-unique-function, unique, is-unique-keyed-function
+ *
  * @param values - Array of items to deduplicate.
  * @param readKey - Function to extract a unique key from each item.
  * @param additionalKeys - Optional keys to pre-seed as already seen, excluding matching items.
@@ -1920,6 +2171,12 @@ function _unsupported_iterable_to_array$x(o, minLen) {
 /**
  * Creates an {@link IsUniqueKeyedFunction} that checks whether all items in an array have unique keys.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilKind factory
+ * @dbxUtilTags array, unique, validation, distinct, key, decision, factory
+ * @dbxUtilRelated filter-unique-function, unique
+ *
  * @param readKey - Function to extract a unique key from each item.
  * @returns A decision function that returns true if all items have distinct keys.
  */ function isUniqueKeyedFunction(readKey) {
@@ -1961,7 +2218,7 @@ function _class_call_check$b(instance, Constructor) {
         throw new TypeError("Cannot call a class as a function");
     }
 }
-function _define_property$l(obj, key, value) {
+function _define_property$m(obj, key, value) {
     if (key in obj) {
         Object.defineProperty(obj, key, {
             value: value,
@@ -2224,7 +2481,7 @@ function readModelKey(input) {
  * @deprecated Use {@link UniqueModel} instead.
  */ var AbstractUniqueModel = function AbstractUniqueModel(template) {
     _class_call_check$b(this, AbstractUniqueModel);
-    _define_property$l(this, "id", void 0);
+    _define_property$m(this, "id", void 0);
     this.id = template.id;
 } 
 ;
@@ -2385,7 +2642,7 @@ function _create_class$7(Constructor, protoProps, staticProps) {
     if (protoProps) _defineProperties$7(Constructor.prototype, protoProps);
     return Constructor;
 }
-function _define_property$k(obj, key, value) {
+function _define_property$l(obj, key, value) {
     if (key in obj) {
         Object.defineProperty(obj, key, {
             value: value,
@@ -2423,8 +2680,8 @@ function _unsupported_iterable_to_array$v(o, minLen) {
     function HashSet(config, values) {
         var _this = this;
         _class_call_check$a(this, HashSet);
-        _define_property$k(this, "_map", new Map());
-        _define_property$k(this, "_config", void 0);
+        _define_property$l(this, "_map", new Map());
+        _define_property$l(this, "_config", void 0);
         this._config = config;
         if (values) {
             values.forEach(function(x) {
@@ -2647,6 +2904,11 @@ function reverseCompareFn(compareFn) {
  *
  * The input comparison function must be in ascending order.
  *
+ * @dbxUtil
+ * @dbxUtilCategory sort
+ * @dbxUtilTags sort, order, ascending, descending, compare, direction
+ * @dbxUtilRelated reverse-compare-fn, compare-with-mapped-values-function
+ *
  * @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
@@ -2662,6 +2924,12 @@ function reverseCompareFn(compareFn) {
  * @param comparesFunction - Compares the mapped values.
  * @returns A sort comparison function for the original type.
  *
+ * @dbxUtil
+ * @dbxUtilCategory sort
+ * @dbxUtilKind factory
+ * @dbxUtilTags sort, compare, map, derive, factory, by, key
+ * @dbxUtilRelated reverse-compare-fn, compare-fn-order
+ *
  * @example
  * ```ts
  * const byName = compareWithMappedValuesFunction(
@@ -2832,6 +3100,11 @@ function _unsupported_iterable_to_array$t(o, minLen) {
  * @param batchSize - Maximum number of items per batch.
  * @returns An array of {@link IndexedBatch} arrays.
  *
+ * @dbxUtil
+ * @dbxUtilCategory grouping
+ * @dbxUtilTags array, batch, chunk, split, group, partition, indexed
+ * @dbxUtilRelated batch-calc, item-count-for-batch-index
+ *
  * @example
  * ```ts
  * const result = batch(['a', 'b', 'c', 'd'], 2);
@@ -2853,6 +3126,11 @@ function _unsupported_iterable_to_array$t(o, minLen) {
 /**
  * Calculates batch metrics (count, full batches, remainder) from a {@link BatchCount} configuration.
  *
+ * @dbxUtil
+ * @dbxUtilCategory grouping
+ * @dbxUtilTags batch, calculate, count, remainder, math
+ * @dbxUtilRelated batch, item-count-for-batch-index
+ *
  * @param input - The total items and items-per-batch configuration.
  * @returns A {@link BatchCalc} with computed batch counts and remainder.
  */ function batchCalc(input) {
@@ -2911,6 +3189,11 @@ function _unsupported_iterable_to_array$t(o, minLen) {
  * @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.
  *
+ * @dbxUtil
+ * @dbxUtilCategory grouping
+ * @dbxUtilTags array, order, restore, sort, key, reorder, dedupe
+ * @dbxUtilRelated restore-order-with-values, group-values
+ *
  * @example
  * ```ts
  * const items = [{ key: 'a' }, { key: 'b' }, { key: 'c' }];
@@ -3034,6 +3317,11 @@ function _unsupported_iterable_to_array$t(o, minLen) {
 /**
  * Separates values into included and excluded groups based on a decision function.
  *
+ * @dbxUtil
+ * @dbxUtilCategory grouping
+ * @dbxUtilTags array, separate, partition, split, filter, group
+ * @dbxUtilRelated group-values, pair-group-values
+ *
  * @param values - Values to separate.
  * @param checkInclusion - Returns `true` for values that should be included.
  * @returns A {@link SeparateResult} with included and excluded arrays.
@@ -3435,6 +3723,11 @@ function _unsupported_iterable_to_array$s(o, minLen) {
  * Returns true if the input is a function-like value with a prototype and constructor (i.e., a class or named function declaration).
  * Returns false for arrow functions, class instances, plain objects, and primitives.
  *
+ * @dbxUtil
+ * @dbxUtilCategory type
+ * @dbxUtilTags type, type-guard, function, class, constructor, reflection
+ * @dbxUtilRelated is-class-like-type, get-function-type, is-non-class-function
+ *
  * @param obj - The value to check.
  * @returns Whether the value is a function with a constructor.
  */ function isObjectWithConstructor(obj) {
@@ -3444,6 +3737,11 @@ function _unsupported_iterable_to_array$s(o, minLen) {
  * Returns true if the input is a class (requires `new` to instantiate). Distinguishes classes from regular functions
  * by checking that the prototype is non-writable.
  *
+ * @dbxUtil
+ * @dbxUtilCategory type
+ * @dbxUtilTags type, type-guard, class, reflection, instance
+ * @dbxUtilRelated is-object-with-constructor, get-function-type
+ *
  * @param obj - The value to check.
  * @returns Whether the value is a class type.
  */ function isClassLikeType(obj) {
@@ -3454,6 +3752,11 @@ function _unsupported_iterable_to_array$s(o, minLen) {
  * Determines the function type of the input value: `'class'`, `'function'`, or `'arrow'`.
  * Returns `null` if the input is not a function.
  *
+ * @dbxUtil
+ * @dbxUtilCategory type
+ * @dbxUtilTags type, function, class, arrow, reflection, kind, detect
+ * @dbxUtilRelated is-class-like-type, is-non-class-function, is-object-with-constructor
+ *
  * @param x - The value to inspect.
  * @returns The {@link FunctionType}, or `null` for non-functions.
  */ function getFunctionType(x) {
@@ -3464,6 +3767,11 @@ function _unsupported_iterable_to_array$s(o, minLen) {
 /**
  * Returns true if the input is a function but not a class (i.e., a regular function or arrow function).
  *
+ * @dbxUtil
+ * @dbxUtilCategory type
+ * @dbxUtilTags type, type-guard, function, arrow, reflection, callable
+ * @dbxUtilRelated is-class-like-type, get-function-type
+ *
  * @param x - The value to check.
  * @returns Whether the value is a non-class function.
  */ // eslint-disable-next-line @typescript-eslint/no-unsafe-function-type
@@ -3479,6 +3787,11 @@ function _type_of$j(obj) {
 /**
  * Returns true if the input value is a non-class function (i.e., likely a Getter).
  *
+ * @dbxUtil
+ * @dbxUtilCategory getter
+ * @dbxUtilTags getter, type-guard, function, callable, check
+ * @dbxUtilRelated as-getter, get-value-from-getter
+ *
  * @param value - The value to check
  * @returns True if the value is a non-class function
  */ function isGetter(value) {
@@ -3490,6 +3803,11 @@ function getValueFromGetter(input, args) {
 /**
  * Wraps the input as a Getter function. If it's already a function, returns it directly.
  *
+ * @dbxUtil
+ * @dbxUtilCategory getter
+ * @dbxUtilTags getter, factory, wrap, ensure, normalize
+ * @dbxUtilRelated get-value-from-getter, is-getter
+ *
  * @param input - A value or getter function
  * @returns A Getter function that returns the value
  */ function asGetter(input) {
@@ -3500,6 +3818,12 @@ function getValueFromGetter(input, args) {
 /**
  * Creates a factory that returns a shallow copy of the input value on each call.
  *
+ * @dbxUtil
+ * @dbxUtilCategory getter
+ * @dbxUtilKind factory
+ * @dbxUtilTags getter, factory, copy, clone, object
+ * @dbxUtilRelated as-object-copy-factory, copy-object
+ *
  * @param value - The object to copy
  * @param copyFunction - Optional custom copy function (defaults to copyObject)
  * @returns A factory that produces copies of the value
@@ -3596,6 +3920,12 @@ function makeWithFactoryInput(factory, input) {
 /**
  * Creates a function that checks whether a number falls within the specified inclusive bounds.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilKind factory
+ * @dbxUtilTags number, bound, range, between, check, inclusive, factory
+ * @dbxUtilRelated bound-number-function, bound-number, is-valid-number-bound
+ *
  * @param bounds - The min/max bounds to test against
  * @returns A function that returns `true` if the input number is within bounds
  * @throws Error if the bounds are invalid (min > max)
@@ -3613,6 +3943,12 @@ function makeWithFactoryInput(factory, input) {
  *
  * When `fencePosts` is true, wraps to the nearest "fence post" value, extending the wrap range by one in each direction.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilKind factory
+ * @dbxUtilTags number, wrap, modulo, modular, range, factory, circular
+ * @dbxUtilRelated bound-number-function, bound-number, is-in-number-bound-function
+ *
  * @param wrapNumberFunctionConfig - Configuration with min, max, and optional fence post behavior
  * @returns A function that wraps input numbers into the bounded range
  */ function wrapNumberFunction(wrapNumberFunctionConfig) {
@@ -3638,6 +3974,12 @@ function makeWithFactoryInput(factory, input) {
  *
  * When `wrap` is true, uses modular wrapping. Otherwise, clamps values to the min/max range.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilKind factory
+ * @dbxUtilTags number, bound, clamp, wrap, range, factory, constrain
+ * @dbxUtilRelated bound-number, wrap-number-function, is-in-number-bound-function
+ *
  * @param boundNumberFunctionConfig - Configuration with min, max, and optional wrap behavior
  * @returns A function that bounds input numbers into the configured range
  */ function boundNumberFunction(boundNumberFunctionConfig) {
@@ -3649,6 +3991,11 @@ function makeWithFactoryInput(factory, input) {
 /**
  * Clamps the input number between the min and max values (inclusive).
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, clamp, bound, min, max, range, constrain
+ * @dbxUtilRelated bound-number-function, wrap-number-function, is-in-number-bound-function
+ *
  * @param input - Number to clamp
  * @param min - Minimum allowed value
  * @param max - Maximum allowed value
@@ -3666,6 +4013,11 @@ function _type_of$i(obj) {
  *
  * Returns 0 for null/undefined input.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, percent, decimal, convert, ratio
+ * @dbxUtilRelated percent-number-from-decimal
+ *
  * @param input - A percent number value (e.g., 5 means 5%)
  * @returns The decimal equivalent
  */ function percentNumberToDecimal(input) {
@@ -3676,6 +4028,11 @@ function _type_of$i(obj) {
  *
  * Returns 0 for null/undefined input.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, percent, decimal, convert, ratio
+ * @dbxUtilRelated percent-number-to-decimal
+ *
  * @param input - A decimal percent value (e.g., 0.05 means 5%)
  * @returns The percent number equivalent
  */ function percentNumberFromDecimal(input) {
@@ -3686,6 +4043,10 @@ function _type_of$i(obj) {
  *
  * Strings are parsed via `Number()`. Null/undefined returns 0.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, parse, convert, coerce, string, normalize
+ *
  * @param input - A number, number string, or null/undefined
  * @returns The numeric value, or 0 for null/undefined
  */ function asNumber(input) {
@@ -3708,6 +4069,11 @@ function _type_of$i(obj) {
  *
  * Treats null/undefined as 0.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, divisible, modulo, division, math, check
+ * @dbxUtilRelated nearest-divisible-values, is-even-number, is-odd-number
+ *
  * @param value - The number to check
  * @param divisor - The divisor to test against
  * @returns `true` if the remainder is zero
@@ -3718,6 +4084,11 @@ function _type_of$i(obj) {
 /**
  * Finds the nearest values that are evenly divisible by the divisor, both above (ceil) and below (floor) the input value.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, divisible, nearest, ceil, floor, round, snap, math
+ * @dbxUtilRelated is-number-divisible-by
+ *
  * @param value - The value to find divisible neighbors for
  * @param divisor - The divisor to align to
  * @returns Object with the input value, divisor, and the nearest ceil/floor divisible values
@@ -3735,6 +4106,11 @@ function _type_of$i(obj) {
 /**
  * Checks whether the input is an even number.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, even, parity, math, check
+ * @dbxUtilRelated is-odd-number, is-number-divisible-by
+ *
  * @param value - Number to test
  * @returns `true` if even
  */ function isEvenNumber(value) {
@@ -3743,6 +4119,11 @@ function _type_of$i(obj) {
 /**
  * Checks whether the input is an odd number.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, odd, parity, math, check
+ * @dbxUtilRelated is-even-number, is-number-divisible-by
+ *
  * @param value - Number to test
  * @returns `true` if odd
  */ function isOddNumber(value) {
@@ -3753,6 +4134,10 @@ function _type_of$i(obj) {
  *
  * The `from` value is floored and the `to` value is ceiled before computation.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, sum, range, integers, math, gauss, total
+ *
  * @param from - The starting value (floored to nearest integer)
  * @param to - The ending value (ceiled to nearest integer)
  * @returns Sum of all integers in the range
@@ -3775,6 +4160,11 @@ function _type_of$i(obj) {
 /**
  * Finds the minimum and maximum values from an iterable of numbers.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, min, max, range, sort, bounds, extremes
+ * @dbxUtilRelated sort-compare-number-function
+ *
  * @param values - Iterable of numbers to examine
  * @returns Object with `min` and `max` values
  */ function minAndMaxNumber(values) {
@@ -3783,6 +4173,10 @@ function _type_of$i(obj) {
 /**
  * Computes the logarithm of `y` with base `x`.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, log, logarithm, math, base
+ *
  * @param x - The base of the logarithm
  * @param y - The value to compute the logarithm of
  * @returns The base-x logarithm of y
@@ -3803,6 +4197,12 @@ function _type_of$h(obj) {
 /**
  * Returns a rounding function for the specified rounding type.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilKind factory
+ * @dbxUtilTags number, round, floor, ceil, math, factory, rounding
+ * @dbxUtilRelated cut-value-to-precision-function, round-to-precision-function
+ *
  * @param type - The rounding strategy: 'floor', 'ceil', 'round', or 'none'
  * @returns The corresponding Math function, or an identity function for 'none'
  */ function roundingFunction(type) {
@@ -3831,6 +4231,11 @@ function _type_of$h(obj) {
  *
  * Accepts strings and null/undefined via {@link asNumber}.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, precision, decimal, truncate, cut, round
+ * @dbxUtilRelated cut-value-to-precision-function, cut-value-to-integer, round-to-precision
+ *
  * @param input - Number, number string, or null/undefined
  * @param precision - Number of decimal places to retain
  * @returns The truncated number value
@@ -3843,6 +4248,11 @@ function _type_of$h(obj) {
 /**
  * Truncates a value to an integer by cutting to zero decimal precision.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, integer, truncate, floor, cut, parse
+ * @dbxUtilRelated cut-value-to-precision, as-number
+ *
  * @param input - Number, number string, or null/undefined
  * @returns The truncated integer value
  */ function cutValueToInteger(input) {
@@ -3991,6 +4401,12 @@ var DOLLAR_AMOUNT_STRING_REGEX = /^\$?(\d+)\.?(\d\d)$/;
  *
  * Accepts either a simple max number or a full config object with min, max, and rounding options.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilKind factory
+ * @dbxUtilTags number, random, factory, range, min, max, generate
+ * @dbxUtilRelated random-number, rounding-function
+ *
  * @param maxOrArgs - Maximum value (exclusive) or full configuration object
  * @param roundingInput - Optional rounding mode override
  * @returns A factory function that produces random numbers within the range
@@ -4024,6 +4440,11 @@ var DOLLAR_AMOUNT_STRING_REGEX = /^\$?(\d+)\.?(\d\d)$/;
 /**
  * Generates a single random number using {@link randomNumberFactory}. Convenience function for one-off usage.
  *
+ * @dbxUtil
+ * @dbxUtilCategory number
+ * @dbxUtilTags number, random, range, generate
+ * @dbxUtilRelated random-number-factory
+ *
  * @param maxOrArgs - Maximum value (exclusive) or full configuration object
  * @param roundingInput - Optional rounding mode
  * @returns A single random number
@@ -5037,6 +5458,12 @@ function applyBestFit(input, filter, compare, updateNonBestFit) {
 /**
  * Creates a new ArrayFactory that generates multiple values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilKind factory
+ * @dbxUtilTags array, factory, generate, make, build, create
+ * @dbxUtilRelated array-input-factory, terminating-factory-from-array
+ *
  * @param factory - The factory function used to generate each item
  * @returns A function that takes a count parameter and returns an array of generated items
  */ function arrayFactory(factory) {
@@ -5047,6 +5474,12 @@ function applyBestFit(input, filter, compare, updateNonBestFit) {
 /**
  * Creates an ArrayInputFactory that transforms input values into output values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilKind factory
+ * @dbxUtilTags array, factory, transform, map, generate, build
+ * @dbxUtilRelated array-factory
+ *
  * @param factory - The factory function used to transform each input value
  * @returns A function that takes an array of input values and returns an array of output values
  */ function arrayInputFactory(factory) {
@@ -5305,6 +5738,12 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Creates a {@link RandomPickFactory} from the input values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilKind factory
+ * @dbxUtilTags array, random, pick, sample, choose, factory
+ * @dbxUtilRelated pick-one-randomly, random-array-index
+ *
  * @param values - array of values to randomly pick from
  * @returns a callable factory that returns a random value from the array on each invocation
  * @throws Error if the input array is empty
@@ -5322,6 +5761,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Returns a random index from the input array. Returns 0 if the array is empty.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, random, index, position
+ * @dbxUtilRelated pick-one-randomly, random-pick-factory
+ *
  * @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) {
@@ -5330,6 +5774,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Picks a single item randomly from the input array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, random, pick, sample, choose
+ * @dbxUtilRelated random-pick-factory, random-array-index
+ *
  * @param values - array to pick a random item from
  * @returns a randomly selected item from the array
  * @throws Error if the input array is empty
@@ -5341,6 +5790,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Returns items that exist in both arrays (intersection).
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, set, intersection, intersect, keep, common, both
+ * @dbxUtilRelated exclude-values-from-array
+ *
  * @param values - The source array to filter.
  * @param secondArray - The array of values to keep.
  * @returns A new array containing only the values from `values` that also exist in `secondArray`.
@@ -5350,6 +5804,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Returns items from the first array that do not exist in the second array (difference).
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, set, difference, exclude, subtract, diff
+ * @dbxUtilRelated keep-values-from-array
+ *
  * @param values - The source array to filter.
  * @param secondArray - The array of values to exclude.
  * @returns A new array containing only the values from `values` that do not exist in `secondArray`.
@@ -5359,6 +5818,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Checks whether the given array contains any duplicate values.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, duplicate, check, validation, set
+ * @dbxUtilRelated find-index-of-first-duplicate-value, unique
+ *
  * @param values - The array to check for duplicates.
  * @returns `true` if the array contains at least one duplicate value, `false` otherwise.
  */ function arrayContainsDuplicateValue(values) {
@@ -5367,6 +5831,11 @@ function generateIfDoesNotExist(keys, existing, readKey, generateFn) {
 /**
  * Finds the index of the first duplicate value in the given array.
  *
+ * @dbxUtil
+ * @dbxUtilCategory array
+ * @dbxUtilTags array, duplicate, find, index, search
+ * @dbxUtilRelated array-contains-duplicate-value, unique
+ *
  * @param values - The array to search for duplicates.
  * @returns The index of the first value that is a duplicate of an earlier value, or `-1` if no duplicates exist.
  */ function findIndexOfFirstDuplicateValue(values) {
@@ -5403,6 +5872,11 @@ function joinStrings(input) {
  * Splits a string like {@link String.prototype.split}, but joins overflow segments back together
  * instead of discarding them. Useful when you only want to split on the first N-1 occurrences.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, split, limit, separator, parts, segments
+ * @dbxUtilRelated join-strings, string-split-join-instance
+ *
  * @param input - string to split
  * @param separator - delimiter to split on
  * @param limit - maximum number of resulting segments; overflow segments are rejoined with the separator
@@ -5515,6 +5989,11 @@ function caseInsensitiveString(input) {
 /**
  * Capitalizes the first letter of the input string.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, capitalize, case, uppercase, first
+ * @dbxUtilRelated lowercase-first-letter, case-insensitive-string
+ *
  * @param value - string to capitalize
  * @returns the input string with its first character uppercased
  */ function capitalizeFirstLetter(value) {
@@ -5523,6 +6002,11 @@ function caseInsensitiveString(input) {
 /**
  * Lowercases the first letter of the input string.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, lowercase, case, first, decapitalize
+ * @dbxUtilRelated capitalize-first-letter, case-insensitive-string
+ *
  * @param value - string to modify
  * @returns the input string with its first character lowercased
  */ function lowercaseFirstLetter(value) {
@@ -5532,6 +6016,11 @@ function caseInsensitiveString(input) {
  * Splits the input string into a first name and last name tuple using a space as the delimiter.
  * If the name contains more than one space, the remainder is treated as the last name.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, name, split, first, last, person, parse
+ * @dbxUtilRelated split-join-remainder
+ *
  * @param input - full name string to split
  * @returns a tuple of [firstName, lastName], where lastName includes all text after the first space
  */ function splitJoinNameString(input) {
@@ -5540,6 +6029,10 @@ function caseInsensitiveString(input) {
 /**
  * Creates a string that repeats the given string a specified number of times.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, repeat, build, generate, fill
+ *
  * @param string - the string to repeat
  * @param reapeat - number of times to repeat the string
  * @returns the repeated string concatenation
@@ -5556,6 +6049,11 @@ function caseInsensitiveString(input) {
 /**
  * Creates a {@link CutStringFunction} that truncates strings exceeding the configured maximum length.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilKind factory
+ * @dbxUtilTags string, cut, truncate, ellipsis, max-length, factory, abbreviate
+ *
  * @param config - configuration controlling max length and end text behavior
  * @returns a reusable function that truncates input strings
  */ function cutStringFunction(config) {
@@ -5578,6 +6076,11 @@ function caseInsensitiveString(input) {
 /**
  * Truncates a string to the given maximum length, appending end text (defaults to "...") if truncated.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, cut, truncate, ellipsis, max-length, abbreviate, shorten
+ * @dbxUtilRelated cut-string-function
+ *
  * @param input - the string to truncate, or null/undefined
  * @param maxLength - maximum allowed length for the output string
  * @param endText - text to append when truncated; defaults to "..."
@@ -5593,6 +6096,11 @@ function caseInsensitiveString(input) {
  *
  * Newlines are preserved.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, whitespace, flatten, collapse, normalize, trim
+ * @dbxUtilRelated simplify-whitespace
+ *
  * @param input - string to flatten
  * @returns the string with collapsed whitespace
  */ function flattenWhitespace(input) {
@@ -5601,6 +6109,11 @@ function caseInsensitiveString(input) {
 /**
  * Reduces multiple consecutive newlines to a single newline and collapses multiple whitespace characters to a single space.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, whitespace, simplify, normalize, newline, trim
+ * @dbxUtilRelated flatten-whitespace
+ *
  * @param input - string to simplify
  * @returns the string with simplified whitespace and newlines
  */ function simplifyWhitespace(input) {
@@ -5992,7 +6505,7 @@ function _create_class$6(Constructor, protoProps, staticProps) {
     if (protoProps) _defineProperties$6(Constructor.prototype, protoProps);
     return Constructor;
 }
-function _define_property$j(obj, key, value) {
+function _define_property$k(obj, key, value) {
     if (key in obj) {
         Object.defineProperty(obj, key, {
             value: value,
@@ -6062,7 +6575,7 @@ function _is_native_reflect_construct$4() {
         var _this;
         _this = _call_super$4(this, AssertionError, [
             message
-        ]), _define_property$j(_this, "code", ASSERTION_ERROR_CODE), _define_property$j(_this, "_target", void 0), _define_property$j(_this, "_property", void 0);
+        ]), _define_property$k(_this, "code", ASSERTION_ERROR_CODE), _define_property$k(_this, "_target", void 0), _define_property$k(_this, "_property", void 0);
         _this.name = 'AssertionError';
         _this._target = error.target;
         _this._property = error.propertyKey;
@@ -6167,7 +6680,7 @@ function _create_class$5(Constructor, protoProps, staticProps) {
     if (staticProps) _defineProperties$5(Constructor, staticProps);
     return Constructor;
 }
-function _define_property$i(obj, key, value) {
+function _define_property$j(obj, key, value) {
     if (key in obj) {
         Object.defineProperty(obj, key, {
             value: value,
@@ -6180,7 +6693,7 @@ function _define_property$i(obj, key, value) {
     }
     return obj;
 }
-function _object_spread$e(target) {
+function _object_spread$f(target) {
     for(var i = 1; i < arguments.length; i++){
         var source = arguments[i] != null ? arguments[i] : {};
         var ownKeys = Object.keys(source);
@@ -6190,7 +6703,7 @@ function _object_spread$e(target) {
             }));
         }
         ownKeys.forEach(function(key) {
-            _define_property$i(target, key, source[key]);
+            _define_property$j(target, key, source[key]);
         });
     }
     return target;
@@ -6217,7 +6730,7 @@ function _object_spread$e(target) {
      * @returns A property descriptor interceptor function
      */ function makePropertyDescriptorAssertion(assertValueFn, options, defaultOptions) {
                 // Build options
-                options = _object_spread$e({}, defaultOptions, options);
+                options = _object_spread$f({}, defaultOptions, options);
                 return this.makeSetPropertyDescriptorInterceptor(function(param) {
                     var target = param.target, propertyKey = param.propertyKey, setValue = param.setValue;
                     var _options_map;
@@ -6703,7 +7216,7 @@ function _array_like_to_array$q(arr, len) {
 function _array_with_holes$i(arr) {
     if (Array.isArray(arr)) return arr;
 }
-function _define_property$h(obj, key, value) {
+function _define_property$i(obj, key, value) {
     if (key in obj) {
         Object.defineProperty(obj, key, {
             value: value,
@@ -6743,7 +7256,7 @@ function _iterable_to_array_limit$i(arr, i) {
 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 _object_spread$d(target) {
+function _object_spread$e(target) {
     for(var i = 1; i < arguments.length; i++){
         var source = arguments[i] != null ? arguments[i] : {};
         var ownKeys = Object.keys(source);
@@ -6753,7 +7266,7 @@ function _object_spread$d(target) {
             }));
         }
         ownKeys.forEach(function(key) {
-            _define_property$h(target, key, source[key]);
+            _define_property$i(target, key, source[key]);
         });
     }
     return target;
@@ -6774,8 +7287,22 @@ function _unsupported_iterable_to_array$q(o, minLen) {
     if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$q(o, minLen);
 }
 /**
+ * Creates a reusable {@link StripObjectFunction} that filters values from an object and returns
+ * `undefined` when no keys remain after filtering.
  *
- * @param input
+ * Useful when an upstream consumer treats an "empty" object as a missing value (e.g. for skipping
+ * persistence or omitting a field from a request body).
+ *
+ * @param filter - Filter controlling which key/value pairs are removed from the input object.
+ * @param copy - When true (default), the returned function shallow-copies the input before filtering instead of mutating it.
+ * @returns A function that returns the stripped object, or `undefined` when filtering removed every key.
+ *
+ * @example
+ * ```ts
+ * const stripUndef = stripObjectFunction(KeyValueTypleValueFilter.UNDEFINED);
+ * stripUndef({ a: 1, b: undefined });  // { a: 1 }
+ * stripUndef({ a: undefined });        // undefined
+ * ```
  */ function stripObjectFunction(filter) {
     var copy = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : true;
     var filterFn = filterFromPOJOFunction({
@@ -6791,7 +7318,22 @@ function _unsupported_iterable_to_array$q(o, minLen) {
         return result;
     };
 }
-function stripObject(input, copy) {
+/**
+ * Removes `undefined` values from the input object and returns `undefined` when no keys remain.
+ *
+ * Convenience wrapper around {@link stripObjectFunction} pre-configured to filter out `undefined`.
+ *
+ * @param input - The object to strip; null/undefined inputs short-circuit and return `undefined`.
+ * @param copy - When true (default), shallow-copies the input before filtering instead of mutating it.
+ * @returns The stripped object, or `undefined` when input was missing or filtering removed every key.
+ *
+ * @example
+ * ```ts
+ * stripObject({ a: 1, b: undefined }); // { a: 1 }
+ * stripObject({ a: undefined });       // undefined
+ * stripObject(null);                   // undefined
+ * ```
+ */ function stripObject(input, copy) {
     return stripObjectFunction(exports.KeyValueTypleValueFilter.UNDEFINED, copy)(input);
 }
 // MARK: Object Merging/Overriding
@@ -6859,7 +7401,7 @@ function stripObject(input, copy) {
         var rebuildTemplate = function rebuildTemplate() {
             var template = {};
             from.forEach(function(x) {
-                var relevantValues = filterToRelevantValuesObject(_object_spread$d({}, x));
+                var relevantValues = filterToRelevantValuesObject(_object_spread$e({}, x));
                 Object.assign(template, relevantValues);
             });
             return template;
@@ -7217,7 +7759,7 @@ function stripObject(input, copy) {
     return function(obj, copyOverride) {
         var copyObj = typeof copyOverride === 'boolean' ? copyOverride : copy;
         if (copyObj) {
-            obj = _object_spread$d({}, obj);
+            obj = _object_spread$e({}, obj);
         }
         forEachFn(obj);
         return obj;
@@ -7293,7 +7835,7 @@ function stripObject(input, copy) {
     });
     var fn = function fn(inputTarget, obj) {
         var returnCopy = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : copy;
-        var target = returnCopy ? _object_spread$d({}, inputTarget) : inputTarget;
+        var target = returnCopy ? _object_spread$e({}, inputTarget) : inputTarget;
         assignEachValueToTarget(obj, target);
         return target;
     };
@@ -7745,33 +8287,1495 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
                 addToSet(roles, decodedRoles);
             }
         }
-    });
-    var toRoles = function toRoles(claims) {
-        var roles = new Set();
-        forEachKeyValueAddToSet(claims, roles);
-        return roles;
-    };
-    return {
-        toClaims: toClaims,
-        toRoles: toRoles,
-        defaultClaimValue: defaultClaimValue,
-        defaultEmptyValue: defaultEmptyValue
+    });
+    var toRoles = function toRoles(claims) {
+        var roles = new Set();
+        forEachKeyValueAddToSet(claims, roles);
+        return roles;
+    };
+    return {
+        toClaims: toClaims,
+        toRoles: toRoles,
+        defaultClaimValue: defaultClaimValue,
+        defaultEmptyValue: defaultEmptyValue
+    };
+}
+/**
+ * Converts an {@link AuthClaimsUpdate} to {@link AuthClaims} by stripping all null-valued keys.
+ *
+ * Useful for cleaning up a claims update before persisting or comparing, since update objects
+ * use `null` to indicate claim removal.
+ *
+ * @param authClaimsUpdate - The claims update object potentially containing null values
+ * @returns A clean claims object with all null entries removed
+ */ function authClaims(authClaimsUpdate) {
+    return filterFromPOJO(authClaimsUpdate, {
+        filter: {
+            valueFilter: exports.KeyValueTypleValueFilter.NULL
+        }
+    });
+}
+
+/**
+ * Standard "out-of-band" OAuth 2.0 redirect URI URN.
+ *
+ * Defined by RFC 6749 §1.3 / draft-ietf-oauth-native-apps. Used by native and CLI clients that
+ * have no HTTP server to receive the redirect — the authorization server displays the
+ * authorization code on a final page and the user pastes it back into the application.
+ *
+ * Many providers have deprecated this in favor of loopback redirects (e.g.
+ * `http://127.0.0.1:<port>/callback`), but it remains in use as a fallback for tools that cannot
+ * bind a local port.
+ */ var OAUTH_OOB_REDIRECT_URI = 'urn:ietf:wg:oauth:2.0:oob';
+
+function asyncGeneratorStep$d(gen, resolve, reject, _next, _throw, key, arg) {
+    try {
+        var info = gen[key](arg);
+        var value = info.value;
+    } catch (error) {
+        reject(error);
+        return;
+    }
+    if (info.done) {
+        resolve(value);
+    } else {
+        Promise.resolve(value).then(_next, _throw);
+    }
+}
+function _async_to_generator$d(fn) {
+    return function() {
+        var self = this, args = arguments;
+        return new Promise(function(resolve, reject) {
+            var gen = fn.apply(self, args);
+            function _next(value) {
+                asyncGeneratorStep$d(gen, resolve, reject, _next, _throw, "next", value);
+            }
+            function _throw(err) {
+                asyncGeneratorStep$d(gen, resolve, reject, _next, _throw, "throw", err);
+            }
+            _next(undefined);
+        });
+    };
+}
+function _ts_generator$d(thisArg, body) {
+    var f, y, t, _ = {
+        label: 0,
+        sent: function() {
+            if (t[0] & 1) throw t[1];
+            return t[1];
+        },
+        trys: [],
+        ops: []
+    }, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype), d = Object.defineProperty;
+    return d(g, "next", {
+        value: verb(0)
+    }), d(g, "throw", {
+        value: verb(1)
+    }), d(g, "return", {
+        value: verb(2)
+    }), typeof Symbol === "function" && d(g, Symbol.iterator, {
+        value: function() {
+            return this;
+        }
+    }), g;
+    function verb(n) {
+        return function(v) {
+            return step([
+                n,
+                v
+            ]);
+        };
+    }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while(g && (g = 0, op[0] && (_ = 0)), _)try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [
+                op[0] & 2,
+                t.value
+            ];
+            switch(op[0]){
+                case 0:
+                case 1:
+                    t = op;
+                    break;
+                case 4:
+                    _.label++;
+                    return {
+                        value: op[1],
+                        done: false
+                    };
+                case 5:
+                    _.label++;
+                    y = op[1];
+                    op = [
+                        0
+                    ];
+                    continue;
+                case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                        _ = 0;
+                        continue;
+                    }
+                    if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+                        _.label = op[1];
+                        break;
+                    }
+                    if (op[0] === 6 && _.label < t[1]) {
+                        _.label = t[1];
+                        t = op;
+                        break;
+                    }
+                    if (t && _.label < t[2]) {
+                        _.label = t[2];
+                        _.ops.push(op);
+                        break;
+                    }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) {
+            op = [
+                6,
+                e
+            ];
+            y = 0;
+        } finally{
+            f = t = 0;
+        }
+        if (op[0] & 5) throw op[1];
+        return {
+            value: op[0] ? op[1] : void 0,
+            done: true
+        };
+    }
+}
+/**
+ * Generates a random PKCE code verifier string (43 characters, base64url-encoded).
+ *
+ * @returns A cryptographically random base64url string suitable for use as a PKCE code_verifier.
+ */ function generatePkceCodeVerifier() {
+    var bytes = new Uint8Array(32);
+    crypto.getRandomValues(bytes);
+    return base64UrlEncode(bytes);
+}
+/**
+ * Generates a PKCE code challenge from a code verifier using SHA-256.
+ *
+ * @param verifier - The code verifier string to hash
+ * @returns A base64url-encoded SHA-256 hash of the verifier
+ */ function generatePkceCodeChallenge(verifier) {
+    return _async_to_generator$d(function() {
+        var encoder, data, digest;
+        return _ts_generator$d(this, function(_state) {
+            switch(_state.label){
+                case 0:
+                    encoder = new TextEncoder();
+                    data = encoder.encode(verifier);
+                    return [
+                        4,
+                        crypto.subtle.digest('SHA-256', data)
+                    ];
+                case 1:
+                    digest = _state.sent();
+                    return [
+                        2,
+                        base64UrlEncode(new Uint8Array(digest))
+                    ];
+            }
+        });
+    })();
+}
+function base64UrlEncode(bytes) {
+    var binString = Array.from(bytes, function(byte) {
+        return String.fromCharCode(byte);
+    }).join('');
+    return btoa(binString).replaceAll('+', '-').replaceAll('/', '_').replace(/=+$/, '');
+}
+
+function asyncGeneratorStep$c(gen, resolve, reject, _next, _throw, key, arg) {
+    try {
+        var info = gen[key](arg);
+        var value = info.value;
+    } catch (error) {
+        reject(error);
+        return;
+    }
+    if (info.done) {
+        resolve(value);
+    } else {
+        Promise.resolve(value).then(_next, _throw);
+    }
+}
+function _async_to_generator$c(fn) {
+    return function() {
+        var self = this, args = arguments;
+        return new Promise(function(resolve, reject) {
+            var gen = fn.apply(self, args);
+            function _next(value) {
+                asyncGeneratorStep$c(gen, resolve, reject, _next, _throw, "next", value);
+            }
+            function _throw(err) {
+                asyncGeneratorStep$c(gen, resolve, reject, _next, _throw, "throw", err);
+            }
+            _next(undefined);
+        });
+    };
+}
+function _ts_generator$c(thisArg, body) {
+    var f, y, t, _ = {
+        label: 0,
+        sent: function() {
+            if (t[0] & 1) throw t[1];
+            return t[1];
+        },
+        trys: [],
+        ops: []
+    }, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype), d = Object.defineProperty;
+    return d(g, "next", {
+        value: verb(0)
+    }), d(g, "throw", {
+        value: verb(1)
+    }), d(g, "return", {
+        value: verb(2)
+    }), typeof Symbol === "function" && d(g, Symbol.iterator, {
+        value: function() {
+            return this;
+        }
+    }), g;
+    function verb(n) {
+        return function(v) {
+            return step([
+                n,
+                v
+            ]);
+        };
+    }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while(g && (g = 0, op[0] && (_ = 0)), _)try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [
+                op[0] & 2,
+                t.value
+            ];
+            switch(op[0]){
+                case 0:
+                case 1:
+                    t = op;
+                    break;
+                case 4:
+                    _.label++;
+                    return {
+                        value: op[1],
+                        done: false
+                    };
+                case 5:
+                    _.label++;
+                    y = op[1];
+                    op = [
+                        0
+                    ];
+                    continue;
+                case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                        _ = 0;
+                        continue;
+                    }
+                    if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+                        _.label = op[1];
+                        break;
+                    }
+                    if (op[0] === 6 && _.label < t[1]) {
+                        _.label = t[1];
+                        t = op;
+                        break;
+                    }
+                    if (t && _.label < t[2]) {
+                        _.label = t[2];
+                        _.ops.push(op);
+                        break;
+                    }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) {
+            op = [
+                6,
+                e
+            ];
+            y = 0;
+        } finally{
+            f = t = 0;
+        }
+        if (op[0] & 5) throw op[1];
+        return {
+            value: op[0] ? op[1] : void 0,
+            done: true
+        };
+    }
+}
+/**
+ * Creates an in-memory {@link AsyncValueCache} backed by a single closure-scoped variable.
+ *
+ * Useful as the inner of {@link memoizeAsyncValueCache} and as a stand-in for tests.
+ *
+ * @param initialValue - Optional starting value for the cache. When omitted (or null), the cache starts empty and {@link AsyncValueCache.load} resolves to undefined.
+ * @returns An {@link AsyncValueCache} that stores the latest written value in process memory.
+ *
+ * @example
+ * ```ts
+ * const cache = inMemoryAsyncValueCache<string>('hello');
+ * await cache.load();          // 'hello'
+ * await cache.update('world');
+ * await cache.load();          // 'world'
+ * ```
+ */ function inMemoryAsyncValueCache(initialValue) {
+    var value = initialValue !== null && initialValue !== void 0 ? initialValue : undefined;
+    return {
+        load: function load() {
+            return _async_to_generator$c(function() {
+                return _ts_generator$c(this, function(_state) {
+                    return [
+                        2,
+                        value
+                    ];
+                });
+            })();
+        },
+        update: function update(next) {
+            return _async_to_generator$c(function() {
+                return _ts_generator$c(this, function(_state) {
+                    value = next;
+                    return [
+                        2
+                    ];
+                });
+            })();
+        },
+        clear: function clear() {
+            return _async_to_generator$c(function() {
+                return _ts_generator$c(this, function(_state) {
+                    value = undefined;
+                    return [
+                        2
+                    ];
+                });
+            })();
+        }
+    };
+}
+/**
+ * Creates an in-memory {@link AsyncKeyedValueCache} backed by a closure-scoped record.
+ *
+ * Useful as the inner of {@link memoizeAsyncKeyedValueCache} and as a stand-in for tests.
+ *
+ * Backed by a null-prototype object so inherited properties (`toString`, `hasOwnProperty`, etc.)
+ * are never returned from `get` and `__proto__` keys cannot mutate the prototype chain.
+ *
+ * @param initialEntries - Optional starting entries for the cache. When omitted (or null), the cache starts empty.
+ * @returns An {@link AsyncKeyedValueCache} that stores entries in process memory.
+ *
+ * @example
+ * ```ts
+ * const cache = inMemoryAsyncKeyedValueCache<number>({ a: 1 });
+ * await cache.get('a');        // 1
+ * await cache.set('b', 2);
+ * await cache.load();          // { a: 1, b: 2 }
+ * ```
+ */ function inMemoryAsyncKeyedValueCache(initialEntries) {
+    var entries = Object.assign(Object.create(null), initialEntries !== null && initialEntries !== void 0 ? initialEntries : {});
+    return {
+        load: function load() {
+            return _async_to_generator$c(function() {
+                return _ts_generator$c(this, function(_state) {
+                    return [
+                        2,
+                        Object.assign(Object.create(null), entries)
+                    ];
+                });
+            })();
+        },
+        get: function get(key) {
+            return _async_to_generator$c(function() {
+                return _ts_generator$c(this, function(_state) {
+                    return [
+                        2,
+                        Object.hasOwn(entries, key) ? entries[key] : undefined
+                    ];
+                });
+            })();
+        },
+        set: function set(key, value) {
+            return _async_to_generator$c(function() {
+                var next;
+                return _ts_generator$c(this, function(_state) {
+                    next = Object.assign(Object.create(null), entries);
+                    next[key] = value;
+                    entries = next;
+                    return [
+                        2
+                    ];
+                });
+            })();
+        },
+        remove: function remove(key) {
+            return _async_to_generator$c(function() {
+                var next;
+                return _ts_generator$c(this, function(_state) {
+                    next = Object.assign(Object.create(null), entries);
+                    delete next[key];
+                    entries = next;
+                    return [
+                        2
+                    ];
+                });
+            })();
+        },
+        clear: function clear() {
+            return _async_to_generator$c(function() {
+                return _ts_generator$c(this, function(_state) {
+                    entries = Object.create(null);
+                    return [
+                        2
+                    ];
+                });
+            })();
+        }
+    };
+}
+
+function asyncGeneratorStep$b(gen, resolve, reject, _next, _throw, key, arg) {
+    try {
+        var info = gen[key](arg);
+        var value = info.value;
+    } catch (error) {
+        reject(error);
+        return;
+    }
+    if (info.done) {
+        resolve(value);
+    } else {
+        Promise.resolve(value).then(_next, _throw);
+    }
+}
+function _async_to_generator$b(fn) {
+    return function() {
+        var self = this, args = arguments;
+        return new Promise(function(resolve, reject) {
+            var gen = fn.apply(self, args);
+            function _next(value) {
+                asyncGeneratorStep$b(gen, resolve, reject, _next, _throw, "next", value);
+            }
+            function _throw(err) {
+                asyncGeneratorStep$b(gen, resolve, reject, _next, _throw, "throw", err);
+            }
+            _next(undefined);
+        });
+    };
+}
+function _define_property$h(obj, key, value) {
+    if (key in obj) {
+        Object.defineProperty(obj, key, {
+            value: value,
+            enumerable: true,
+            configurable: true,
+            writable: true
+        });
+    } else {
+        obj[key] = value;
+    }
+    return obj;
+}
+function _object_spread$d(target) {
+    for(var i = 1; i < arguments.length; i++){
+        var source = arguments[i] != null ? arguments[i] : {};
+        var ownKeys = Object.keys(source);
+        if (typeof Object.getOwnPropertySymbols === "function") {
+            ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function(sym) {
+                return Object.getOwnPropertyDescriptor(source, sym).enumerable;
+            }));
+        }
+        ownKeys.forEach(function(key) {
+            _define_property$h(target, key, source[key]);
+        });
+    }
+    return target;
+}
+function ownKeys$7(object, enumerableOnly) {
+    var keys = Object.keys(object);
+    if (Object.getOwnPropertySymbols) {
+        var symbols = Object.getOwnPropertySymbols(object);
+        keys.push.apply(keys, symbols);
+    }
+    return keys;
+}
+function _object_spread_props$7(target, source) {
+    source = source != null ? source : {};
+    if (Object.getOwnPropertyDescriptors) {
+        Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));
+    } else {
+        ownKeys$7(Object(source)).forEach(function(key) {
+            Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));
+        });
+    }
+    return target;
+}
+function _ts_generator$b(thisArg, body) {
+    var f, y, t, _ = {
+        label: 0,
+        sent: function() {
+            if (t[0] & 1) throw t[1];
+            return t[1];
+        },
+        trys: [],
+        ops: []
+    }, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype), d = Object.defineProperty;
+    return d(g, "next", {
+        value: verb(0)
+    }), d(g, "throw", {
+        value: verb(1)
+    }), d(g, "return", {
+        value: verb(2)
+    }), typeof Symbol === "function" && d(g, Symbol.iterator, {
+        value: function() {
+            return this;
+        }
+    }), g;
+    function verb(n) {
+        return function(v) {
+            return step([
+                n,
+                v
+            ]);
+        };
+    }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while(g && (g = 0, op[0] && (_ = 0)), _)try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [
+                op[0] & 2,
+                t.value
+            ];
+            switch(op[0]){
+                case 0:
+                case 1:
+                    t = op;
+                    break;
+                case 4:
+                    _.label++;
+                    return {
+                        value: op[1],
+                        done: false
+                    };
+                case 5:
+                    _.label++;
+                    y = op[1];
+                    op = [
+                        0
+                    ];
+                    continue;
+                case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                        _ = 0;
+                        continue;
+                    }
+                    if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+                        _.label = op[1];
+                        break;
+                    }
+                    if (op[0] === 6 && _.label < t[1]) {
+                        _.label = t[1];
+                        t = op;
+                        break;
+                    }
+                    if (t && _.label < t[2]) {
+                        _.label = t[2];
+                        _.ops.push(op);
+                        break;
+                    }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) {
+            op = [
+                6,
+                e
+            ];
+            y = 0;
+        } finally{
+            f = t = 0;
+        }
+        if (op[0] & 5) throw op[1];
+        return {
+            value: op[0] ? op[1] : void 0,
+            done: true
+        };
+    }
+}
+/**
+ * Wraps an inner {@link AsyncValueCache} with a single-load in-memory memoization layer.
+ *
+ * The first {@link AsyncValueCache.load} call delegates to the inner cache and stores the
+ * result; subsequent calls return the memoized value without touching the inner cache again.
+ * {@link AsyncValueCache.update} writes through to the inner cache and refreshes the memo.
+ * {@link AsyncValueCache.clear} clears both layers.
+ *
+ * Note: the memoized value is per-process. Long-running processes will not observe writes
+ * made by other processes to the inner backing once the memo is populated.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory cache
+ * @dbxUtilTags memoize, memo, cache, async, single-load, async-value
+ * @dbxUtilRelated memoize-async-keyed-value-cache
+ *
+ * @param inner - The backing cache to memoize. Reads are delegated once and cached; writes are forwarded through and refresh the memo.
+ * @returns An {@link AsyncValueCache} that proxies the inner cache with a single-load memoization layer.
+ *
+ * @example
+ * ```ts
+ * const memo = memoizeAsyncValueCache(inMemoryAsyncValueCache<string>('initial'));
+ * await memo.load();           // delegates to inner.load() once
+ * await memo.load();           // returns memoized value without hitting inner
+ * await memo.update('next');   // writes through to inner and refreshes memo
+ * ```
+ */ function memoizeAsyncValueCache(inner) {
+    var loaded;
+    var inFlight;
+    // Bumped on every write/clear so a slow inner.load() resolved after a concurrent
+    // update()/clear() can detect that its result is stale and skip clobbering newer state.
+    var generation = 0;
+    return {
+        load: function load() {
+            if (loaded != null) {
+                return Promise.resolve(loaded.value);
+            }
+            if (inFlight == null) {
+                // Cache the in-flight promise so concurrent callers share the same load instead
+                // of each firing an independent inner.load(). Cleared on settle so a failed load
+                // doesn't permanently poison the memo. The captured generation lets a slow
+                // resolve detect a concurrent update()/clear() and skip clobbering newer state.
+                var startGen = generation;
+                inFlight = inner.load().then(function(value) {
+                    if (generation === startGen) {
+                        loaded = {
+                            value: value
+                        };
+                        inFlight = undefined;
+                    }
+                    return value;
+                }, function(error) {
+                    if (generation === startGen) {
+                        inFlight = undefined;
+                    }
+                    throw error;
+                });
+            }
+            return inFlight;
+        },
+        update: function update(next) {
+            return _async_to_generator$b(function() {
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            generation += 1;
+                            inFlight = undefined;
+                            // Write through to the inner first; only mutate the memoized snapshot once the inner
+                            // call succeeds, so a thrown inner.update doesn't leave the memo with a value that
+                            // never made it to the backing store.
+                            return [
+                                4,
+                                inner.update(next)
+                            ];
+                        case 1:
+                            _state.sent();
+                            loaded = {
+                                value: next
+                            };
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        },
+        clear: function clear() {
+            return _async_to_generator$b(function() {
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            generation += 1;
+                            inFlight = undefined;
+                            return [
+                                4,
+                                inner.clear()
+                            ];
+                        case 1:
+                            _state.sent();
+                            loaded = {
+                                value: undefined
+                            };
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        }
+    };
+}
+/**
+ * Wraps an inner {@link AsyncKeyedValueCache} with a single-load in-memory memoization layer
+ * over the full record.
+ *
+ * The first call to any read method ({@link AsyncKeyedValueCache.load} or {@link AsyncKeyedValueCache.get})
+ * delegates to the inner cache and stores the loaded record; subsequent reads return entries
+ * from the memoized record without re-hitting the inner cache. Writes ({@link AsyncKeyedValueCache.set} /
+ * {@link AsyncKeyedValueCache.remove}) update the memoized record and write through to the inner cache.
+ * {@link AsyncKeyedValueCache.clear} clears both layers.
+ *
+ * Note: the memoized record is per-process. Long-running processes will not observe writes
+ * made by other processes to the inner backing once the memo is populated.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory cache
+ * @dbxUtilTags memoize, memo, cache, async, keyed, record
+ * @dbxUtilRelated memoize-async-value-cache
+ *
+ * @param inner - The backing keyed cache to memoize. The full record is loaded once and cached; writes are forwarded through and applied to the memo.
+ * @returns An {@link AsyncKeyedValueCache} that proxies the inner cache with a record-level memoization layer.
+ *
+ * @example
+ * ```ts
+ * const memo = memoizeAsyncKeyedValueCache(inMemoryAsyncKeyedValueCache<number>({ a: 1 }));
+ * await memo.get('a');           // delegates to inner.load() once
+ * await memo.get('a');           // returns memoized entry without hitting inner
+ * await memo.set('b', 2);        // writes through to inner and updates memo
+ * ```
+ */ function memoizeAsyncKeyedValueCache(inner) {
+    var loaded;
+    var inFlight;
+    // Bumped on every write/clear so a slow inner.load() resolved after a concurrent
+    // set()/remove()/clear() can detect that its result is stale and skip clobbering newer state.
+    var generation = 0;
+    function ensureLoaded() {
+        if (loaded != null) {
+            return Promise.resolve(loaded.entries);
+        }
+        if (inFlight == null) {
+            var startGen = generation;
+            inFlight = inner.load().then(function(entries) {
+                if (generation === startGen) {
+                    loaded = {
+                        entries: entries
+                    };
+                    inFlight = undefined;
+                }
+                return entries;
+            }, function(error) {
+                if (generation === startGen) {
+                    inFlight = undefined;
+                }
+                throw error;
+            });
+        }
+        return inFlight;
+    }
+    return {
+        load: function load() {
+            return _async_to_generator$b(function() {
+                var _tmp;
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            _tmp = [
+                                {}
+                            ];
+                            return [
+                                4,
+                                ensureLoaded()
+                            ];
+                        case 1:
+                            return [
+                                2,
+                                _object_spread$d.apply(void 0, _tmp.concat([
+                                    _state.sent()
+                                ]))
+                            ];
+                    }
+                });
+            })();
+        },
+        get: function get(key) {
+            return _async_to_generator$b(function() {
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            return [
+                                4,
+                                ensureLoaded()
+                            ];
+                        case 1:
+                            return [
+                                2,
+                                _state.sent()[key]
+                            ];
+                    }
+                });
+            })();
+        },
+        set: function set(key, value) {
+            return _async_to_generator$b(function() {
+                var current;
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            return [
+                                4,
+                                ensureLoaded()
+                            ];
+                        case 1:
+                            current = _state.sent();
+                            generation += 1;
+                            inFlight = undefined;
+                            // Write through to the inner first so a failed inner.set doesn't leave the memo with
+                            // an entry that never made it to the backing store.
+                            return [
+                                4,
+                                inner.set(key, value)
+                            ];
+                        case 2:
+                            _state.sent();
+                            loaded = {
+                                entries: _object_spread_props$7(_object_spread$d({}, current), _define_property$h({}, key, value))
+                            };
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        },
+        remove: function remove(key) {
+            return _async_to_generator$b(function() {
+                var current, next;
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            return [
+                                4,
+                                ensureLoaded()
+                            ];
+                        case 1:
+                            current = _state.sent();
+                            generation += 1;
+                            inFlight = undefined;
+                            return [
+                                4,
+                                inner.remove(key)
+                            ];
+                        case 2:
+                            _state.sent();
+                            next = _object_spread$d({}, current);
+                            delete next[key];
+                            loaded = {
+                                entries: next
+                            };
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        },
+        clear: function clear() {
+            return _async_to_generator$b(function() {
+                return _ts_generator$b(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            generation += 1;
+                            inFlight = undefined;
+                            return [
+                                4,
+                                inner.clear()
+                            ];
+                        case 1:
+                            _state.sent();
+                            loaded = {
+                                entries: {}
+                            };
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        }
+    };
+}
+
+function asyncGeneratorStep$a(gen, resolve, reject, _next, _throw, key, arg) {
+    try {
+        var info = gen[key](arg);
+        var value = info.value;
+    } catch (error) {
+        reject(error);
+        return;
+    }
+    if (info.done) {
+        resolve(value);
+    } else {
+        Promise.resolve(value).then(_next, _throw);
+    }
+}
+function _async_to_generator$a(fn) {
+    return function() {
+        var self = this, args = arguments;
+        return new Promise(function(resolve, reject) {
+            var gen = fn.apply(self, args);
+            function _next(value) {
+                asyncGeneratorStep$a(gen, resolve, reject, _next, _throw, "next", value);
+            }
+            function _throw(err) {
+                asyncGeneratorStep$a(gen, resolve, reject, _next, _throw, "throw", err);
+            }
+            _next(undefined);
+        });
+    };
+}
+function _ts_generator$a(thisArg, body) {
+    var f, y, t, _ = {
+        label: 0,
+        sent: function() {
+            if (t[0] & 1) throw t[1];
+            return t[1];
+        },
+        trys: [],
+        ops: []
+    }, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype), d = Object.defineProperty;
+    return d(g, "next", {
+        value: verb(0)
+    }), d(g, "throw", {
+        value: verb(1)
+    }), d(g, "return", {
+        value: verb(2)
+    }), typeof Symbol === "function" && d(g, Symbol.iterator, {
+        value: function() {
+            return this;
+        }
+    }), g;
+    function verb(n) {
+        return function(v) {
+            return step([
+                n,
+                v
+            ]);
+        };
+    }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while(g && (g = 0, op[0] && (_ = 0)), _)try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [
+                op[0] & 2,
+                t.value
+            ];
+            switch(op[0]){
+                case 0:
+                case 1:
+                    t = op;
+                    break;
+                case 4:
+                    _.label++;
+                    return {
+                        value: op[1],
+                        done: false
+                    };
+                case 5:
+                    _.label++;
+                    y = op[1];
+                    op = [
+                        0
+                    ];
+                    continue;
+                case 7:
+                    op = _.ops.pop();
+                    _.trys.pop();
+                    continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+                        _ = 0;
+                        continue;
+                    }
+                    if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+                        _.label = op[1];
+                        break;
+                    }
+                    if (op[0] === 6 && _.label < t[1]) {
+                        _.label = t[1];
+                        t = op;
+                        break;
+                    }
+                    if (t && _.label < t[2]) {
+                        _.label = t[2];
+                        _.ops.push(op);
+                        break;
+                    }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop();
+                    continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) {
+            op = [
+                6,
+                e
+            ];
+            y = 0;
+        } finally{
+            f = t = 0;
+        }
+        if (op[0] & 5) throw op[1];
+        return {
+            value: op[0] ? op[1] : void 0,
+            done: true
+        };
+    }
+}
+/**
+ * Composes multiple {@link AsyncValueCache} instances into a single read-from-first-write-to-all cache.
+ *
+ * - {@link AsyncValueCache.load} returns the first non-null/undefined value from the input caches in order.
+ * - {@link AsyncValueCache.update} writes the value to every input cache, propagating from the
+ *   lowest-precedence (slowest, source-of-truth) tier up to the highest-precedence (fastest) tier
+ *   so a failed write to the backing store is not masked by a successful write to memory.
+ * - {@link AsyncValueCache.clear} clears every input cache in the same lower-to-higher order.
+ *
+ * Useful for memory-then-disk layering or for combining a fast tier with a slow source-of-truth tier.
+ *
+ * @param caches - Ordered tiers from highest-precedence (fastest, e.g. memory) to lowest-precedence (source-of-truth, e.g. disk). Reads honor this order; writes propagate in reverse.
+ * @returns A single {@link AsyncValueCache} layered across the provided tiers.
+ *
+ * @example
+ * ```ts
+ * const layered = mergeAsyncValueCaches<string>([
+ *   inMemoryAsyncValueCache(),
+ *   diskBackedAsyncValueCache()
+ * ]);
+ * await layered.update('hello'); // writes to disk first, then memory
+ * await layered.load();          // returns from memory if present
+ * ```
+ */ function mergeAsyncValueCaches(caches) {
+    return {
+        load: function load() {
+            return _async_to_generator$a(function() {
+                var result, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, cache, value, err;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+                            _state.label = 1;
+                        case 1:
+                            _state.trys.push([
+                                1,
+                                6,
+                                7,
+                                8
+                            ]);
+                            _iterator = caches[Symbol.iterator]();
+                            _state.label = 2;
+                        case 2:
+                            if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
+                                3,
+                                5
+                            ];
+                            cache = _step.value;
+                            return [
+                                4,
+                                cache.load()
+                            ];
+                        case 3:
+                            value = _state.sent();
+                            if (value != null) {
+                                result = value;
+                                return [
+                                    3,
+                                    5
+                                ];
+                            }
+                            _state.label = 4;
+                        case 4:
+                            _iteratorNormalCompletion = true;
+                            return [
+                                3,
+                                2
+                            ];
+                        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,
+                                result
+                            ];
+                    }
+                });
+            })();
+        },
+        update: function update(value) {
+            return _async_to_generator$a(function() {
+                var i;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            i = caches.length - 1;
+                            _state.label = 1;
+                        case 1:
+                            if (!(i >= 0)) return [
+                                3,
+                                4
+                            ];
+                            return [
+                                4,
+                                caches[i].update(value)
+                            ];
+                        case 2:
+                            _state.sent();
+                            _state.label = 3;
+                        case 3:
+                            i -= 1;
+                            return [
+                                3,
+                                1
+                            ];
+                        case 4:
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        },
+        clear: function clear() {
+            return _async_to_generator$a(function() {
+                var i;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            i = caches.length - 1;
+                            _state.label = 1;
+                        case 1:
+                            if (!(i >= 0)) return [
+                                3,
+                                4
+                            ];
+                            return [
+                                4,
+                                caches[i].clear()
+                            ];
+                        case 2:
+                            _state.sent();
+                            _state.label = 3;
+                        case 3:
+                            i -= 1;
+                            return [
+                                3,
+                                1
+                            ];
+                        case 4:
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        }
     };
 }
 /**
- * Converts an {@link AuthClaimsUpdate} to {@link AuthClaims} by stripping all null-valued keys.
+ * Composes multiple {@link AsyncKeyedValueCache} instances into a single read-from-first-write-to-all cache.
  *
- * Useful for cleaning up a claims update before persisting or comparing, since update objects
- * use `null` to indicate claim removal.
+ * - {@link AsyncKeyedValueCache.get} returns the first non-null/undefined value from the input caches in order for a given key.
+ * - {@link AsyncKeyedValueCache.load} returns a merged record where earlier caches' entries take precedence over later caches'.
+ * - Writes ({@link AsyncKeyedValueCache.set} / {@link AsyncKeyedValueCache.remove}) propagate to every input cache.
+ * - {@link AsyncKeyedValueCache.clear} clears every input cache.
  *
- * @param authClaimsUpdate - The claims update object potentially containing null values
- * @returns A clean claims object with all null entries removed
- */ function authClaims(authClaimsUpdate) {
-    return filterFromPOJO(authClaimsUpdate, {
-        filter: {
-            valueFilter: exports.KeyValueTypleValueFilter.NULL
+ * @param caches - Ordered tiers from highest-precedence (fastest, e.g. memory) to lowest-precedence (source-of-truth, e.g. disk). Reads honor this order; writes propagate in reverse.
+ * @returns A single {@link AsyncKeyedValueCache} layered across the provided tiers.
+ *
+ * @example
+ * ```ts
+ * const layered = mergeAsyncKeyedValueCaches<number>([
+ *   inMemoryAsyncKeyedValueCache(),
+ *   diskBackedAsyncKeyedValueCache()
+ * ]);
+ * await layered.set('a', 1);     // writes to disk first, then memory
+ * await layered.get('a');        // returns from memory if present
+ * ```
+ */ function mergeAsyncKeyedValueCaches(caches) {
+    return {
+        load: function load() {
+            return _async_to_generator$a(function() {
+                var merged, i, entries;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            // Use a null-prototype object so a key like "__proto__" loaded from any cache cannot
+                            // mutate the prototype chain via Object.assign.
+                            merged = Object.create(null);
+                            i = caches.length - 1;
+                            _state.label = 1;
+                        case 1:
+                            if (!(i >= 0)) return [
+                                3,
+                                4
+                            ];
+                            return [
+                                4,
+                                caches[i].load()
+                            ];
+                        case 2:
+                            entries = _state.sent();
+                            Object.assign(merged, entries);
+                            _state.label = 3;
+                        case 3:
+                            i -= 1;
+                            return [
+                                3,
+                                1
+                            ];
+                        case 4:
+                            return [
+                                2,
+                                merged
+                            ];
+                    }
+                });
+            })();
+        },
+        get: function get(key) {
+            return _async_to_generator$a(function() {
+                var result, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, cache, value, err;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+                            _state.label = 1;
+                        case 1:
+                            _state.trys.push([
+                                1,
+                                6,
+                                7,
+                                8
+                            ]);
+                            _iterator = caches[Symbol.iterator]();
+                            _state.label = 2;
+                        case 2:
+                            if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
+                                3,
+                                5
+                            ];
+                            cache = _step.value;
+                            return [
+                                4,
+                                cache.get(key)
+                            ];
+                        case 3:
+                            value = _state.sent();
+                            if (value != null) {
+                                result = value;
+                                return [
+                                    3,
+                                    5
+                                ];
+                            }
+                            _state.label = 4;
+                        case 4:
+                            _iteratorNormalCompletion = true;
+                            return [
+                                3,
+                                2
+                            ];
+                        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,
+                                result
+                            ];
+                    }
+                });
+            })();
+        },
+        set: function set(key, value) {
+            return _async_to_generator$a(function() {
+                var i;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            i = caches.length - 1;
+                            _state.label = 1;
+                        case 1:
+                            if (!(i >= 0)) return [
+                                3,
+                                4
+                            ];
+                            return [
+                                4,
+                                caches[i].set(key, value)
+                            ];
+                        case 2:
+                            _state.sent();
+                            _state.label = 3;
+                        case 3:
+                            i -= 1;
+                            return [
+                                3,
+                                1
+                            ];
+                        case 4:
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        },
+        remove: function remove(key) {
+            return _async_to_generator$a(function() {
+                var i;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            i = caches.length - 1;
+                            _state.label = 1;
+                        case 1:
+                            if (!(i >= 0)) return [
+                                3,
+                                4
+                            ];
+                            return [
+                                4,
+                                caches[i].remove(key)
+                            ];
+                        case 2:
+                            _state.sent();
+                            _state.label = 3;
+                        case 3:
+                            i -= 1;
+                            return [
+                                3,
+                                1
+                            ];
+                        case 4:
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
+        },
+        clear: function clear() {
+            return _async_to_generator$a(function() {
+                var i;
+                return _ts_generator$a(this, function(_state) {
+                    switch(_state.label){
+                        case 0:
+                            i = caches.length - 1;
+                            _state.label = 1;
+                        case 1:
+                            if (!(i >= 0)) return [
+                                3,
+                                4
+                            ];
+                            return [
+                                4,
+                                caches[i].clear()
+                            ];
+                        case 2:
+                            _state.sent();
+                            _state.label = 3;
+                        case 3:
+                            i -= 1;
+                            return [
+                                3,
+                                1
+                            ];
+                        case 4:
+                            return [
+                                2
+                            ];
+                    }
+                });
+            })();
         }
-    });
+    };
 }
 
 function _array_like_to_array$o(arr, len) {
@@ -8430,6 +10434,12 @@ function _unsupported_iterable_to_array$n(o, minLen) {
  * @param decision - the constant boolean value to return
  * @returns a decision function that always returns the given boolean
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind factory
+ * @dbxUtilTags decision, boolean, predicate, factory, constant
+ * @dbxUtilRelated as-decision-function, invert-decision
+ *
  * @example
  * ```ts
  * const alwaysTrue = decisionFunction(true);
@@ -8464,6 +10474,11 @@ function _unsupported_iterable_to_array$n(o, minLen) {
  * @param defaultIfUndefined - fallback boolean when the input is nullish (defaults to true)
  * @returns a {@link DecisionFunction} derived from the input
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags decision, normalize, boolean, default, coerce, predicate
+ * @dbxUtilRelated decision-function, invert-decision
+ *
  * @example
  * ```ts
  * const fn = asDecisionFunction(true);
@@ -8567,9 +10582,33 @@ function _unsupported_iterable_to_array$m(o, minLen) {
     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);
 }
-var SLASH_PATH_SEPARATOR = '/';
-var SLASH_PATH_FILE_TYPE_SEPARATOR = '.';
-var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
+/**
+ * The forward-slash character used to separate parts of a slash path.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind const
+ * @dbxUtilTags path, slash, separator, constant, delimiter
+ * @dbxUtilRelated slash-path-file-type-separator, slash-path-parts
+ */ var SLASH_PATH_SEPARATOR = '/';
+/**
+ * The dot character used to separate the file extension from the file name within a slash path.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind const
+ * @dbxUtilTags path, slash, separator, dot, file-type, extension, constant
+ * @dbxUtilRelated slash-path-separator, slash-path-type, slash-path-details
+ */ var SLASH_PATH_FILE_TYPE_SEPARATOR = '.';
+/**
+ * The default set of characters that are considered illegal in a slash path.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind const
+ * @dbxUtilTags path, slash, illegal, characters, default, sanitize, validate
+ * @dbxUtilRelated default-slash-path-illegal-character-replacement, slash-path-validation-factory
+ */ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
     '#',
     '[',
     ']',
@@ -8578,10 +10617,21 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 ];
 /**
  * Default replacement character for illegal characters.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind const
+ * @dbxUtilTags path, slash, illegal, replacement, default, sanitize
+ * @dbxUtilRelated default-slash-path-illegal-characters, slash-path-validation-factory
  */ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTER_REPLACEMENT = '_';
 /**
  * Determines the type of a slash path string.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, type, classify, file, folder, typed, detect
+ * @dbxUtilRelated is-slash-path-file, is-slash-path-folder, is-slash-path-typed-file, is-valid-slash-path
+ *
  * @param input - The slash path to classify.
  * @returns The path type classification.
  */ function slashPathType(input) {
@@ -8612,6 +10662,11 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Type guard that checks if the input is a file path (typed or untyped).
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, file, type-guard, predicate, check, is
+ * @dbxUtilRelated is-slash-path-typed-file, is-slash-path-folder, slash-path-type
+ *
  * @param input - The string to check.
  * @returns Whether the input is a file path.
  */ function isSlashPathFile(input) {
@@ -8621,6 +10676,11 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Type guard that checks if the input is a typed file path (contains a file extension).
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, file, extension, type-guard, predicate, typed
+ * @dbxUtilRelated is-slash-path-file, is-slash-path-folder, slash-path-type
+ *
  * @param input - The string to check.
  * @returns Whether the input is a typed file path.
  */ function isSlashPathTypedFile(input) {
@@ -8630,6 +10690,11 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Type guard that checks if the input is a folder path (ends with a slash).
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, folder, directory, type-guard, predicate, trailing
+ * @dbxUtilRelated is-slash-path-file, is-valid-slash-path, slash-path-type
+ *
  * @param input - The string to check.
  * @returns Whether the input is a folder path.
  */ function isSlashPathFolder(input) {
@@ -8638,6 +10703,11 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Type guard that checks if the input is a valid slash path (not 'invalid' type).
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, valid, type-guard, predicate, check, validate
+ * @dbxUtilRelated slash-path-type, slash-path-validation-factory, slash-path-invalid-error
+ *
  * @param input - The string to check.
  * @returns Whether the input is a valid slash path.
  */ function isValidSlashPath(input) {
@@ -8646,6 +10716,11 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Returns the last part of the slash path.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, name, last, basename, leaf, file, folder
+ * @dbxUtilRelated slash-path-parts, slash-path-details, isolate-slash-path
+ *
  * @param slashPath - The path to extract the name from.
  * @returns The last part of the path (file name or folder name).
  */ function slashPathName(slashPath) {
@@ -8655,6 +10730,11 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Returns each section of a SlashPath.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, split, parts, segments, sections, components
+ * @dbxUtilRelated slash-path-name, slash-path-details, isolate-slash-path
+ *
  * @param slashPath - The path to split.
  * @returns Array of non-empty path segments.
  */ function slashPathParts(slashPath) {
@@ -8663,6 +10743,12 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
 /**
  * Creates a function that enforces the specified start type on a slash path.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, factory, start-type, relative, absolute, normalize
+ * @dbxUtilRelated to-relative-slash-path-start-type, to-absolute-slash-path-start-type, slash-path-factory
+ *
  * @param type - The start type to enforce.
  * @returns A function that transforms paths to the specified start type.
  */ function slashPathStartTypeFactory(type) {
@@ -8689,6 +10775,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Converts a slash path to a relative path by removing all leading slashes.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, relative, leading, strip, normalize, convert
+ * @dbxUtilRelated to-absolute-slash-path-start-type, slash-path-start-type-factory
+ *
  * @param input - The slash path to convert.
  * @returns A relative path without leading slashes.
  */ function toRelativeSlashPathStartType(input) {
@@ -8698,6 +10789,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a SlashPathFolderFactory.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, folder, factory, validate, normalize, trailing-slash
+ * @dbxUtilRelated slash-path-folder, slash-path-validation-factory, add-trailing-slash
+ *
  * @param config Configuration options for the factory.
  * @returns A SlashPathFolderFactory.
  */ function slashPathFolderFactory() {
@@ -8753,6 +10850,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
  *
  * If the input is a file, the folder of the file is returned instead.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, folder, convert, normalize, validate, directory
+ * @dbxUtilRelated slash-path-folder-factory, slash-path-details, add-trailing-slash
+ *
  * @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
@@ -8762,6 +10864,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Converts a slash path to an absolute path by ensuring exactly one leading slash.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, absolute, leading, prefix, normalize, convert
+ * @dbxUtilRelated to-relative-slash-path-start-type, slash-path-start-type-factory, fix-multi-slashes-in-slash-path
+ *
  * @param input - The slash path to convert.
  * @returns An absolute path starting with a single slash.
  */ function toAbsoluteSlashPathStartType(input) {
@@ -8771,6 +10878,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Replaces consecutive double slashes with single slashes.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, fix, collapse, double, normalize, dedupe
+ * @dbxUtilRelated merge-slash-paths, replace-multiple-file-paths-in-slash-path
+ *
  * @param input - The slash path to fix.
  * @returns The path with double slashes collapsed.
  */ function fixMultiSlashesInSlashPath(input) {
@@ -8779,6 +10891,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Replaces consecutive double slashes with single slashes. Alias for {@link fixMultiSlashesInSlashPath}.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, alias, collapse, double, normalize
+ * @dbxUtilRelated fix-multi-slashes-in-slash-path, merge-slash-paths
+ *
  * @param input - The slash path to fix.
  * @returns The path with double slashes collapsed.
  */ function replaceMultipleFilePathsInSlashPath(input) {
@@ -8787,6 +10904,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Removes all trailing slashes from a slash path.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, trim, trailing, strip, remove, normalize
+ * @dbxUtilRelated add-trailing-slash, remove-trailing-file-type-separators
+ *
  * @param input - The slash path to trim.
  * @returns The path without trailing slashes.
  */ function removeTrailingSlashes(input) {
@@ -8795,6 +10917,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Removes all trailing dots from a slash path.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, trim, trailing, dot, file-type, strip, normalize
+ * @dbxUtilRelated remove-trailing-slashes, replace-invalid-file-path-type-separators-in-slash-path
+ *
  * @param input - The slash path to trim.
  * @returns The path without trailing dots.
  */ function removeTrailingFileTypeSeparators(input) {
@@ -8803,6 +10930,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Adds a trailing slash to the input if it does not already have one.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, trailing, append, folder, ensure, normalize
+ * @dbxUtilRelated remove-trailing-slashes, slash-path-folder, slash-path-folder-factory
+ *
  * @param input A slash path.
  * @returns A slash path folder.
  */ function addTrailingSlash(input) {
@@ -8811,6 +10943,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Replaces all extra and invalidate FilePathTypeSeparator values from the SlashPath, returning a valid SlashPath.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, dot, file-type, replace, sanitize, fix, validate
+ * @dbxUtilRelated replace-invalid-file-path-type-separators-in-slash-path-function, slash-path-validation-factory
+ *
  * @param input
  * @param replaceWith
  * @returns
@@ -8820,6 +10957,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a function that replaces all extra and invalidate FilePathTypeSeparator values from the SlashPath, returning a valid SlashPath.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, dot, file-type, factory, replace, sanitize, validate
+ * @dbxUtilRelated replace-invalid-file-path-type-separators-in-slash-path, slash-path-validation-factory
+ *
  * @param input
  * @param replaceWith
  * @returns
@@ -8860,6 +11003,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a validation/fixup function for slash paths that replaces illegal characters and extra dots.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, validate, factory, sanitize, illegal, replace, fix
+ * @dbxUtilRelated is-valid-slash-path, replace-invalid-file-path-type-separators-in-slash-path-function, slash-path-factory, slash-path-invalid-error
+ *
  * @param config - Configuration for validation behavior.
  * @returns A function that validates and fixes a slash path.
  */ function slashPathValidationFactory(config) {
@@ -8885,6 +11034,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a factory function that merges path segments together with optional base path, start type enforcement, and validation.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, factory, merge, base, start-type, validate, normalize
+ * @dbxUtilRelated merge-slash-paths, slash-path-validation-factory, slash-path-start-type-factory
+ *
  * @param config - Configuration for path generation.
  * @returns A factory function that merges input paths into a single validated slash path.
  */ function slashPathFactory(config) {
@@ -8903,6 +11058,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Merges an array of path segments into a single slash path, filtering nullish values and collapsing double slashes.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, merge, join, concat, segments, normalize, dedupe
+ * @dbxUtilRelated slash-path-factory, fix-multi-slashes-in-slash-path, slash-path-parts
+ *
  * @param paths - Array of path segments to merge.
  * @returns The merged slash path.
  */ function mergeSlashPaths(paths) {
@@ -8912,6 +11072,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates an Error indicating that a slash path is invalid.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, error, invalid, throw, validate
+ * @dbxUtilRelated is-valid-slash-path, slash-path-validation-factory
+ *
  * @returns A new Error with a descriptive message.
  */ function slashPathInvalidError() {
     return new Error('The slashPath is invalid.');
@@ -8919,6 +11084,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Splits the path and returns the items at the given ranges.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, isolate, slice, range, segments, extract, sub-path
+ * @dbxUtilRelated isolate-slash-path-function, slash-path-parts, slash-path-details
+ *
  * @param path - The path to isolate parts from.
  * @param range - Index range defining which path segments to extract.
  * @returns A new slash path containing only the segments within the range.
@@ -8930,6 +11100,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates an IsolateSlashPathFunction.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, isolate, factory, slice, range, segments, sub-path
+ * @dbxUtilRelated isolate-slash-path, slash-path-parts, slash-path-details
+ *
  * @param config - Configuration with range, optional start type, and file mode.
  * @returns A function that isolates path segments within the configured range.
  */ function isolateSlashPathFunction(config) {
@@ -8950,6 +11126,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Returns the details of a path.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, details, parse, decompose, file, folder, extension, parts
+ * @dbxUtilRelated slash-path-type, slash-path-parts, slash-path-folder, slash-path-name
+ *
  * @param path The path to get details for.
  * @returns The details of the path.
  */ function slashPathDetails(path) {
@@ -9022,6 +11203,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Expands the input matcher path into decision functions.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, matcher, expand, decision, predicate, wildcard, build
+ * @dbxUtilRelated slash-path-path-matcher, slash-path-sub-path-matcher, slash-path-path-matcher-config
+ *
  * @param path - Matcher path parts to expand into decision functions.
  * @returns Array of decision functions for each path part.
  */ function expandSlashPathPathMatcherPartToDecisionFunctions(path) {
@@ -9064,6 +11250,11 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a SlashPathPathMatcherConfig from the input.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilTags path, slash, matcher, config, normalize, coerce
+ * @dbxUtilRelated slash-path-path-matcher, slash-path-sub-path-matcher
+ *
  * @param input The configuration input.
  * @returns The configuration.
  */ function slashPathPathMatcherConfig(input) {
@@ -9093,6 +11284,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a SlashPathPathMatcher.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, matcher, factory, predicate, wildcard, target, compare
+ * @dbxUtilRelated slash-path-sub-path-matcher, expand-slash-path-path-matcher-part-to-decision-functions, slash-path-path-matcher-config
+ *
  * @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) {
@@ -9148,6 +11345,12 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
 /**
  * Creates a SlashPathSubPathMatcher.
  *
+ * @dbxUtil
+ * @dbxUtilCategory path
+ * @dbxUtilKind factory
+ * @dbxUtilTags path, slash, matcher, sub-path, factory, base-path, prefix, predicate
+ * @dbxUtilRelated slash-path-path-matcher, expand-slash-path-path-matcher-part-to-decision-functions
+ *
  * @param config The configuration for the matcher.
  * @returns The matcher.
  */ function slashPathSubPathMatcher(config) {
@@ -9621,6 +11824,11 @@ function _unsupported_iterable_to_array$l(o, minLen) {
 /**
  * Extracts unique domain names from a list of email addresses (case-insensitive).
  *
+ * @dbxUtil
+ * @dbxUtilCategory contact
+ * @dbxUtilTags email, domain, extract, unique, dedupe, case-insensitive
+ * @dbxUtilRelated read-domain-from-email-address, read-email-domain-from-url-or-email-address
+ *
  * @param addresses - Array of email addresses to extract domains from
  * @returns Array of unique lowercase domain strings
  */ function readDomainsFromEmailAddresses(addresses) {
@@ -9629,6 +11837,11 @@ function _unsupported_iterable_to_array$l(o, minLen) {
 /**
  * Extracts the domain portion from a single email address.
  *
+ * @dbxUtil
+ * @dbxUtilCategory contact
+ * @dbxUtilTags email, domain, extract, parse, lowercase
+ * @dbxUtilRelated read-domains-from-email-addresses, read-email-domain-from-url-or-email-address
+ *
  * @param address - The email address to extract the domain from
  * @returns The lowercase domain string
  */ function readDomainFromEmailAddress(address) {
@@ -9647,6 +11860,11 @@ function _unsupported_iterable_to_array$l(o, minLen) {
  *
  * The "www." prefix is stripped from URL-style inputs since emails typically don't use it.
  *
+ * @dbxUtil
+ * @dbxUtilCategory contact
+ * @dbxUtilTags email, domain, url, extract, normalize, parse, www
+ * @dbxUtilRelated read-domain-from-email-address, read-domains-from-email-addresses
+ *
  * @param urlLikeInput - A URL, email address, or domain string
  * @returns The extracted domain
  */ function readEmailDomainFromUrlOrEmailAddress(urlLikeInput) {
@@ -9695,6 +11913,11 @@ function _unsupported_iterable_to_array$k(o, minLen) {
  * Converts an EmailParticipant object to a formatted string representation.
  * The format is: "name<email>" or "<email>" if no name is provided.
  *
+ * @dbxUtil
+ * @dbxUtilCategory contact
+ * @dbxUtilTags email, participant, convert, format, serialize, name
+ * @dbxUtilRelated convert-email-participant-string-to-participant, coerce-to-email-participants
+ *
  * @param participant - The email participant to convert
  * @returns A formatted string representation of the participant
  */ function convertParticipantToEmailParticipantString(participant) {
@@ -9706,6 +11929,11 @@ function _unsupported_iterable_to_array$k(o, minLen) {
  * Converts a formatted participant string into an EmailParticipant object.
  * Parses strings in the format "name<email>" or "<email>".
  *
+ * @dbxUtil
+ * @dbxUtilCategory contact
+ * @dbxUtilTags email, participant, parse, deserialize, name, address
+ * @dbxUtilRelated convert-participant-to-email-participant-string, coerce-to-email-participants
+ *
  * @param participantString - The string to parse
  * @returns An EmailParticipant object with the extracted name and email
  */ function convertEmailParticipantStringToParticipant(participantString) {
@@ -9721,6 +11949,11 @@ function _unsupported_iterable_to_array$k(o, minLen) {
  * Combines an array of EmailParticipants with an array of email addresses.
  * Email addresses that don't already exist in the participants array are converted to EmailParticipant objects.
  *
+ * @dbxUtil
+ * @dbxUtilCategory contact
+ * @dbxUtilTags email, participant, merge, combine, dedupe, coerce, normalize
+ * @dbxUtilRelated convert-participant-to-email-participant-string, convert-email-participant-string-to-participant
+ *
  * @param options - Object containing participants and/or emails arrays
  * @param options.participants - Array of existing EmailParticipant objects
  * @param options.emails - Array of email addresses to include
@@ -10219,6 +12452,12 @@ function _unsupported_iterable_to_array$j(o, minLen) {
     };
 }
 
+/**
+ * No-op function. Useful as a default callback or as a yargs command's `handler` for parent
+ * commands that only register subcommands.
+ */ // eslint-disable-next-line @typescript-eslint/no-empty-function
+function noop() {}
+
 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];
@@ -12522,6 +14761,12 @@ function _unsupported_iterable_to_array$e(o, minLen) {
  * @param compare - the comparator to wrap
  * @returns a new comparator that handles nullish values safely before delegating to the wrapped comparator
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind factory
+ * @dbxUtilTags equal, equality, compare, comparator, maybe, safe, factory
+ * @dbxUtilRelated safe-compare-equality
+ *
  * @example
  * ```ts
  * const safeCompare = safeEqualityComparatorFunction((a: number, b: number) => a === b);
@@ -12545,6 +14790,11 @@ function _unsupported_iterable_to_array$e(o, minLen) {
  * @param compare - the equality comparator for non-nullish values
  * @returns `true` if the values are considered equal
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags equal, equality, compare, maybe, safe
+ * @dbxUtilRelated safe-equality-comparator-function
+ *
  * @example
  * ```ts
  * safeCompareEquality(0, 1, (a, b) => a === b);
@@ -13102,6 +15352,12 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * @param fn - the equality comparator
  * @returns a function that checks whether a given value equals the captured reference
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind factory
+ * @dbxUtilTags equal, equality, compare, context, factory
+ * @dbxUtilRelated are-equal-context, all-objects-are-equal
+ *
  * @example
  * ```ts
  * const isEqual = (a: number, b: number) => a === b;
@@ -13125,6 +15381,12 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * @param fn - the equality comparator
  * @returns a function that checks whether all input values equal the captured reference
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilKind factory
+ * @dbxUtilTags equal, equality, compare, context, iterable, all, factory
+ * @dbxUtilRelated is-equal-context, all-objects-are-equal
+ *
  * @example
  * ```ts
  * const isEqual = (a: number, b: number) => a === b;
@@ -13157,6 +15419,11 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * @param fn - the equality comparator
  * @returns `true` if all values are equal to each other, or if fewer than two values are provided
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags equal, equality, compare, all, iterable, every
+ * @dbxUtilRelated is-equal-context, are-equal-context
+ *
  * @example
  * ```ts
  * const isEqual = (a: unknown, b: unknown) => a === b;
@@ -13208,6 +15475,11 @@ var MINUTE_OF_DAY_MAXMIMUM = MINUTES_IN_DAY - 1;
  * @param modify - function that mutates the target value
  * @returns a new {@link Modifier} pairing the key with the modify function
  *
+ * @dbxUtil
+ * @dbxUtilCategory value
+ * @dbxUtilTags modifier, mutate, transform, key, factory
+ * @dbxUtilRelated apply-modifiers, modifier-function
+ *
  * @example
  * ```ts
  * const uppercaseName = modifier<{ name: string }>('uppercase', (x) => { x.name = x.name.toUpperCase(); });
@@ -13939,6 +16211,11 @@ function _type_of$6(obj) {
  * Recursively checks whether an object is "empty" — meaning it is null/undefined, has no keys,
  * or all of its values are themselves empty (recursively for nested objects, or falsy for primitives).
  *
+ * @dbxUtil
+ * @dbxUtilCategory object
+ * @dbxUtilTags object, empty, recursive, deep, check, has-value
+ * @dbxUtilRelated object-has-no-keys, has-value-or-not-empty-object
+ *
  * @param obj - Object to check
  * @returns `true` if the object is considered empty
  */ function objectIsEmpty(obj) {
@@ -13977,6 +16254,11 @@ function _type_of$6(obj) {
 /**
  * Converts a Date object or unix timestamp number to a unix timestamp number.
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags date, unix, seconds, timestamp, convert, normalize
+ * @dbxUtilRelated unix-date-time-seconds-number-from-date, date-from-date-or-time-seconds-number
+ *
  * @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) {
@@ -13993,6 +16275,11 @@ function _type_of$6(obj) {
 /**
  * Gets the current time as a unix timestamp number.
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags date, unix, seconds, timestamp, now, current, time
+ * @dbxUtilRelated unix-date-time-seconds-number-from-date
+ *
  * @returns Current time as unix timestamp number
  */ function unixDateTimeSecondsNumberForNow() {
     return unixDateTimeSecondsNumberFromDate(new Date());
@@ -14014,6 +16301,11 @@ function dateFromDateOrTimeSecondsNumber(input) {
 /**
  * Converts a unix timestamp number to a Date object.
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags date, unix, seconds, timestamp, convert, parse
+ * @dbxUtilRelated unix-date-time-seconds-number-from-date, date-from-date-or-time-seconds-number
+ *
  * @param dateTimeNumber - Unix timestamp number to convert
  * @returns Date object if timestamp is valid, null/undefined if timestamp is null/undefined
  */ function unixDateTimeSecondsNumberToDate(dateTimeNumber) {
@@ -14021,8 +16313,20 @@ function dateFromDateOrTimeSecondsNumber(input) {
 }
 
 /**
- * Returns expiration details for the input configuration.
- * Creates an object that can determine when something expires based on various inputs.
+ * Returns an {@link ExpirationDetails} for the given input configuration.
+ *
+ * Use this when you need to ask whether something has expired or what its expiration date is. See {@link ExpirationDetailsInput} for how the expiration date is resolved (`expires` → `expiresAt` → `expiresFromDate + expiresIn`).
+ *
+ * Common patterns:
+ * - **Direct expiration**: `expirationDetails({ expiresAt }).hasExpired()`
+ * - **Wrap an existing object**: `expirationDetails({ expires: token }).hasExpired()`
+ * - **TTL / throttle**: `expirationDetails({ expiresFromDate: lastRunAt, expiresIn: throttleMs })` — see {@link isThrottled}
+ * - **Pre-emptive refresh**: `expirationDetails({ expiresFromDate: expiresAt, expiresIn: -bufferMs })` — treat as expired `bufferMs` before the real expiration, e.g. to refresh a token before it actually dies
+ *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags expiration, expires, expiry, ttl, throttle, refresh, time-to-live
+ * @dbxUtilRelated is-expired, is-throttled, calculate-expiration-date, is-under-threshold, check-atleast-one-not-expired, check-any-have-expired
  *
  * @template T - The type of Expires object
  * @param input - Configuration for calculating expiration
@@ -14052,8 +16356,13 @@ function dateFromDateOrTimeSecondsNumber(input) {
     }
     function getExpirationDateForNow(now) {
         var expirationDate = null;
-        if ((expires === null || expires === void 0 ? void 0 : expires.expiresAt) != null) {
-            expirationDate = expires.expiresAt;
+        // `expires` (when supplied) wins exclusively over the top-level fields per the documented
+        // contract. If the supplied object has no `expiresAt`, the result is "no expiration" — we do
+        // NOT fall through to top-level expiresAt/expiresIn, otherwise an Expires-typed value with a
+        // null expiresAt would silently inherit unrelated top-level overrides.
+        if (expires != null) {
+            var _expires_expiresAt;
+            expirationDate = (_expires_expiresAt = expires.expiresAt) !== null && _expires_expiresAt !== void 0 ? _expires_expiresAt : null;
         } else if (expiresAt != null) {
             expirationDate = expiresAt;
         } else if (expiresIn != null) {
@@ -14073,11 +16382,41 @@ function dateFromDateOrTimeSecondsNumber(input) {
  * Convenience function for calculating and returning the expiration date given the input.
  * This is a shorthand for expirationDetails(input).getExpirationDate().
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags expiration, expires, expiry, ttl, calculate, date
+ * @dbxUtilRelated expiration-details, is-expired
+ *
  * @param input - Input configuration used to calculate the expiration date
  * @returns The calculated expiration date, or null if no expiration is defined
  */ function calculateExpirationDate(input) {
     return expirationDetails(input).getExpirationDate();
 }
+// MARK: isExpired
+/**
+ * Convenience wrapper around {@link expirationDetails}().hasExpired() that treats null/undefined input or no expiration date as expired.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags expiration, expires, expiry, expired, has-expired, is-expired, ttl
+ * @dbxUtilRelated expiration-details, is-throttled, calculate-expiration-date
+ *
+ * @param input - Expiration configuration. Null/undefined is treated as expired.
+ * @param now - Optional override for the current time. Defaults to the current time. Apply any buffer (e.g. for clock skew or pre-emptive refresh) by shifting this value forward.
+ * @returns True when the input is null/undefined or its expiration date has passed; otherwise false.
+ *
+ * @example
+ * isExpired(null); // true
+ * isExpired({ expiresAt: pastDate }); // true
+ * isExpired({ expiresAt: futureDate }); // false
+ * isExpired({ expiresAt: futureDate }, addMilliseconds(new Date(), 60_000)); // true (when within buffer)
+ */ function isExpired(input, now) {
+    var result = true;
+    if (input != null) {
+        result = expirationDetails(input).hasExpired(now, true);
+    }
+    return result;
+}
 /**
  * Returns true if the threshold has not passed since the next run time, compared to now.
  *
@@ -14086,6 +16425,11 @@ function dateFromDateOrTimeSecondsNumber(input) {
  * Example:
  * - Should send a notification at max every 2 days. The threshold is 2 days in milliseconds, and "nextRunAt" is the previously calculated date that was originally "now" + "threshold".
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags threshold, throttle, ttl, time-window, rate-limit
+ * @dbxUtilRelated is-throttled, expiration-details
+ *
  * @param threshold The threshold time. Typically this is amount of time that was used to calculate the original "nextRunAt" time.
  * @param nextRunAt Time the next run will occur. If null/undefined, then this function will return false.
  * @param now Optional override for the current time. Defaults to the current time.
@@ -14102,6 +16446,11 @@ function dateFromDateOrTimeSecondsNumber(input) {
  * Returns true if the throttle time has not passed since the last run time, compared to now.
  * This is useful for rate limiting operations (e.g., "only allow this action once every X milliseconds").
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags throttle, throttled, rate-limit, debounce, ttl, expiration
+ * @dbxUtilRelated expiration-details, is-under-threshold, is-expired
+ *
  * @param throttleTime - Minimum time in milliseconds that must pass between operations
  * @param lastRunAt - Timestamp when the operation was last performed
  * @param now - Optional override for the current time (defaults to the current time)
@@ -14119,6 +16468,11 @@ function dateFromDateOrTimeSecondsNumber(input) {
  *
  * If the list is empty, returns false.
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags expiration, valid, collection, any
+ * @dbxUtilRelated expiration-details, check-any-have-expired
+ *
  * @param details - Collection of ExpirationDetails to check
  * @returns True if at least one item has not expired, false otherwise
  */ function checkAtleastOneNotExpired(details) {
@@ -14133,6 +16487,11 @@ function dateFromDateOrTimeSecondsNumber(input) {
  *
  * If the list is empty, returns the value specified by defaultIfEmpty.
  *
+ * @dbxUtil
+ * @dbxUtilCategory date
+ * @dbxUtilTags expiration, refresh, collection, any
+ * @dbxUtilRelated expiration-details, check-atleast-one-not-expired
+ *
  * @param details - Collection of ExpirationDetails to check
  * @param defaultIfEmpty - Default value to return if the list is empty (defaults to true)
  * @returns True if any item has expired, or the defaultIfEmpty value for an empty list
@@ -14603,6 +16962,11 @@ function _type_of$5(obj) {
 /**
  * Checks whether the input value is a native Promise by testing for a `.then` method.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, type-guard, async, then, check
+ * @dbxUtilRelated is-promise-like, as-promise
+ *
  * @param obj - The value to test.
  * @returns `true` if the value is a Promise, `false` otherwise.
  */ function isPromise(obj) {
@@ -14613,6 +16977,11 @@ function _type_of$5(obj) {
  * Checks whether the input value is PromiseLike (i.e., has a `.then` method), which
  * includes both native Promises and custom thenables.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, type-guard, async, then, thenable, check
+ * @dbxUtilRelated is-promise, as-promise
+ *
  * @param obj - The value to test.
  * @returns `true` if the value is PromiseLike, `false` otherwise.
  */ function isPromiseLike(obj) {
@@ -14766,6 +17135,11 @@ function waitForMs(ms, value) {
 /**
  * Polls at a regular interval until a condition is met or the maximum number of attempts is reached.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, poll, wait, retry, condition, async, interval
+ * @dbxUtilRelated wait-for-ms, perform-task-loop
+ *
  * @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
@@ -14882,6 +17256,10 @@ function _object_spread_props$3(target, source) {
 /**
  * Wraps the input in a resolved Promise if it is not already a Promise.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, async, normalize, resolve, ensure
+ *
  * @param input - A value or Promise to normalize into a Promise.
  * @returns A Promise that resolves to the input value.
  */ function asPromise(input) {
@@ -15143,6 +17521,11 @@ function _ts_generator$4(thisArg, body) {
 /**
  * Runs a single async task and returns the resulting value. Always configured to throw on failure.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, async, task, retry, run, value
+ * @dbxUtilRelated perform-async-task, run-async-tasks-for-values, perform-async-tasks
+ *
  * @param taskFn - The async task to execute.
  * @param config - Optional configuration for retries and retry behavior.
  * @returns The value produced by the task, or undefined if the task produced no value.
@@ -15173,6 +17556,11 @@ function _ts_generator$4(thisArg, body) {
  * Runs an async task for each input value and returns an array of the resulting values.
  * Always configured to throw on failure.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, async, tasks, parallel, batch, retry, run, values
+ * @dbxUtilRelated perform-async-tasks, run-async-task-for-value
+ *
  * @param input - The array of input values to process.
  * @param taskFn - The async task function to run for each input value.
  * @param config - Optional configuration for parallelism and retries.
@@ -15206,6 +17594,11 @@ function _ts_generator$4(thisArg, body) {
  * Performs async tasks for each input value with configurable retry and parallelism behavior.
  * Useful for operations that may experience optimistic concurrency collisions.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags async, promise, parallel, retry, task, batch, concurrency, throttle
+ * @dbxUtilRelated perform-tasks-in-parallel, perform-async-task
+ *
  * @param input - The array of input values to process.
  * @param taskFn - The async function to execute for each input.
  * @param config - Configuration for retries, parallelism, and error handling.
@@ -15275,6 +17668,11 @@ function _ts_generator$4(thisArg, body) {
 /**
  * Performs a single async task with configurable retry behavior and returns the result with success status.
  *
+ * @dbxUtil
+ * @dbxUtilCategory promise
+ * @dbxUtilTags promise, async, task, retry, run, success
+ * @dbxUtilRelated perform-async-tasks, run-async-task-for-value
+ *
  * @param taskFn - The async task to execute.
  * @param config - Optional configuration for retries and error handling.
  * @returns A result object containing the value (if successful) and a success flag.
@@ -17060,6 +19458,11 @@ function _unsupported_iterable_to_array$8(o, minLen) {
  *
  * Recursively compares arrays, objects, Maps, Sets, primitives, and Dates.
  *
+ * @dbxUtil
+ * @dbxUtilCategory object
+ * @dbxUtilTags object, equal, equality, deep, compare, recursive, pojo
+ * @dbxUtilRelated are-equal-pojo-values-using-pojo-filter, all-objects-are-equal
+ *
  * @param a - First value to compare
  * @param b - Second value to compare
  * @returns `true` if the values are deeply equal
@@ -17381,6 +19784,10 @@ function _type_of$2(obj) {
  * Empty nested objects are omitted from the result (they produce no keys).
  * Circular references are detected and treated as leaf values to avoid infinite recursion.
  *
+ * @dbxUtil
+ * @dbxUtilCategory object
+ * @dbxUtilTags object, flatten, flat, nested, dot-notation, deep, traverse
+ *
  * @example
  * ```ts
  * flattenObject({ a: 1, b: { c: 2, d: { e: 3 } } });
@@ -18950,6 +21357,11 @@ function _unsupported_iterable_to_array$3(o, minLen) {
  *
  * Empty segments (e.g. leading underscores in `_USER_ID`) are skipped.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, case, camelcase, snakecase, screaming, convert, transform
+ * @dbxUtilRelated camel-or-pascal-to-screaming-snake
+ *
  * @param input The SCREAMING_SNAKE_CASE input.
  * @returns The camelCase form.
  */ function screamingSnakeToCamelCase(input) {
@@ -18990,6 +21402,11 @@ function _unsupported_iterable_to_array$3(o, minLen) {
  * Each upper-case character (other than the first) is preceded by an
  * underscore, then the whole result is upper-cased.
  *
+ * @dbxUtil
+ * @dbxUtilCategory string
+ * @dbxUtilTags string, case, camelcase, pascalcase, snakecase, screaming, convert, transform
+ * @dbxUtilRelated screaming-snake-to-camel-case
+ *
  * @param input The camelCase / PascalCase input.
  * @returns The SCREAMING_SNAKE_CASE form.
  */ function camelOrPascalToScreamingSnake(input) {
@@ -19676,6 +22093,12 @@ function _unsupported_iterable_to_array(o, minLen) {
  * and optionally, how to construct the nodes themselves (`makeNode`). If `makeNode` is not provided, a default node structure is used.
  * The returned function recursively builds a tree from a root value.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind factory
+ * @dbxUtilTags tree, expand, build, recursive, factory, hierarchy, traverse, children
+ * @dbxUtilRelated expand-trees, expand-flatten-tree-function, explore-tree-function
+ *
  * @template T The type of the value being processed at each node.
  * @template N The type of the TreeNode to be created. Defaults to TreeNode<T, any> if not specified by ExpandTreeWithNodeBuilder.
  * @param config An ExpandTree<T> or ExpandTreeWithNodeBuilder<T, N> configuration object.
@@ -19709,6 +22132,11 @@ function _unsupported_iterable_to_array(o, minLen) {
  * Convenience function for expanding multiple root values into an array of trees.
  * Each value in the input array is treated as a root for a new tree.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilTags tree, expand, multiple, roots, hierarchy, build, batch
+ * @dbxUtilRelated expand-tree-function, expand-flatten-tree-function
+ *
  * @template T The type of the input values.
  * @template N The type of the TreeNode in the resulting trees. Must extend TreeNode<T, N>.
  * @param values An array of root values of type T to expand.
@@ -19720,6 +22148,12 @@ function _unsupported_iterable_to_array(o, minLen) {
 
 /**
  * Decides how to visit a node during tree exploration.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind const
+ * @dbxUtilTags tree, explore, visit, decision, enum, traversal, control
+ * @dbxUtilRelated explore-tree-function, flatten-tree-add-node-decision
  */ var ExploreTreeVisitNodeDecision = {
     /**
      * Visits all nodes and children
@@ -19741,6 +22175,12 @@ function _unsupported_iterable_to_array(o, minLen) {
  * By default uses depth-first traversal, identity mapping, and visits all nodes. All options
  * can be overridden per-call.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind factory
+ * @dbxUtilTags tree, explore, traverse, visit, factory, depth-first, breadth-first, walk
+ * @dbxUtilRelated depth-first-explore-tree-traversal-factory-function, breadth-first-explore-tree-traversal-factory-function, flatten-tree-to-array-function
+ *
  * @param config - Optional default configuration for mapping, filtering, and traversal strategy.
  * @returns A reusable function that explores trees with the configured behavior.
  *
@@ -19790,6 +22230,12 @@ function _unsupported_iterable_to_array(o, minLen) {
  * Visits each node before its children (pre-order). This is the default traversal
  * strategy used by {@link exploreTreeFunction}.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind factory
+ * @dbxUtilTags tree, traverse, depth-first, dfs, pre-order, factory, strategy
+ * @dbxUtilRelated breadth-first-explore-tree-traversal-factory-function, explore-tree-function
+ *
  * @returns A traversal factory that processes nodes in depth-first order.
  *
  * @example
@@ -19822,6 +22268,12 @@ function _unsupported_iterable_to_array(o, minLen) {
  * Visits nodes level by level, processing all nodes at depth N before moving to depth N+1.
  * Uses an internal queue to defer child processing until the current level is complete.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind factory
+ * @dbxUtilTags tree, traverse, breadth-first, bfs, level-order, factory, strategy, queue
+ * @dbxUtilRelated depth-first-explore-tree-traversal-factory-function, explore-tree-function
+ *
  * @returns A traversal factory that processes nodes in breadth-first order.
  *
  * @example
@@ -19915,6 +22367,12 @@ function _object_spread_props(target, source) {
 }
 /**
  * Decides how to add a node to the flattened array during flattening.
+ *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind const
+ * @dbxUtilTags tree, flatten, decision, enum, traversal, control
+ * @dbxUtilRelated explore-tree-visit-node-decision, flatten-tree
  */ var FlattenTreeAddNodeDecision = {
     /**
      * Add all nodes and children
@@ -19932,6 +22390,11 @@ function _object_spread_props(target, source) {
 /**
  * Flattens a tree into an array containing all its nodes using depth-first traversal.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilTags tree, flatten, traverse, depth-first, collect, nodes, array
+ * @dbxUtilRelated flatten-tree-to-array, flatten-tree-to-array-function, explore-tree-function
+ *
  * @param tree - The root node to flatten.
  * @param addNodeFn - Optional filter controlling which nodes and subtrees are included.
  * @returns An array of all nodes in the tree that pass the filter.
@@ -19949,6 +22412,11 @@ function _object_spread_props(target, source) {
  *
  * Useful for accumulating nodes from multiple trees into a single collection.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilTags tree, flatten, append, accumulate, collect, mutate, array
+ * @dbxUtilRelated flatten-tree, flatten-tree-to-array-function
+ *
  * @param tree - The root node to flatten.
  * @param array - The target array to push flattened nodes into.
  * @param addNodeFn - Optional filter controlling which nodes and subtrees are included.
@@ -19969,6 +22437,12 @@ function _object_spread_props(target, source) {
  * Creates a reusable function that traverses trees and collects either the nodes themselves
  * or mapped values into an array. Supports both a simple function signature and a config object.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind factory
+ * @dbxUtilTags tree, flatten, factory, collect, map, traverse, reusable
+ * @dbxUtilRelated flatten-tree, flatten-tree-to-array, expand-flatten-tree-function
+ *
  * @param mapNodeFnOrConfig - Optional mapping function or config object.
  * @param defaultAddNodeFn - Optional default filter for node inclusion.
  * @returns A reusable flattening function.
@@ -20007,6 +22481,12 @@ function _object_spread_props(target, source) {
  * This higher-order function takes a function to expand an array of values `T` into a list of trees (`N[]` where `N` is a TreeNode)
  * and another function to flatten these trees into a single array of values `V`.
  *
+ * @dbxUtil
+ * @dbxUtilCategory tree
+ * @dbxUtilKind factory
+ * @dbxUtilTags tree, expand, flatten, compose, factory, transform
+ * @dbxUtilRelated expand-tree-function, flatten-tree-to-array-function, expand-trees
+ *
  * @template T The type of the initial input values.
  * @template V The type of the values in the final flattened output array.
  * @template N The type of the intermediate tree nodes. Must extend TreeNode with value T and children of type N.
@@ -20031,6 +22511,11 @@ function invertMaybeBoolean(x) {
  * @returns The result of ANDing all boolean values in the array.
  * @throws {TypeError} If the array is empty and no emptyArrayValue is provided.
  *
+ * @dbxUtil
+ * @dbxUtilCategory boolean
+ * @dbxUtilTags boolean, reduce, and, every, all, conjunction, aggregate
+ * @dbxUtilRelated reduce-booleans-with-or, reduce-booleans-with-and-fn
+ *
  * @example
  * ```ts
  * reduceBooleansWithAnd([true, true, true]);   // true
@@ -20043,6 +22528,11 @@ function invertMaybeBoolean(x) {
 /**
  * Reduces an array of booleans with the logical OR operation.
  *
+ * @dbxUtil
+ * @dbxUtilCategory boolean
+ * @dbxUtilTags boolean, reduce, or, some, any, disjunction, aggregate
+ * @dbxUtilRelated reduce-booleans-with-and, reduce-booleans-with-or-fn
+ *
  * @param array - Array of boolean values to reduce.
  * @param emptyArrayValue - Value to return if the array is empty. If not provided and the array is empty, a TypeError will be thrown.
  * @returns The result of ORing all boolean values in the array.
@@ -20115,6 +22605,12 @@ function invertMaybeBoolean(x) {
  * @param config - Configuration for the boolean factory, including the chance of returning true.
  * @returns A factory function (`BooleanFactory`) that generates random boolean values based on the configured chance.
  *
+ * @dbxUtil
+ * @dbxUtilCategory boolean
+ * @dbxUtilKind factory
+ * @dbxUtilTags boolean, factory, random, chance, probability, generate
+ * @dbxUtilRelated random-boolean
+ *
  * @example
  * ```ts
  * const alwaysTrue = booleanFactory({ chance: 100 });
@@ -20134,6 +22630,11 @@ function invertMaybeBoolean(x) {
 /**
  * Returns a random boolean based on the specified chance.
  *
+ * @dbxUtil
+ * @dbxUtilCategory boolean
+ * @dbxUtilTags boolean, random, chance, probability, coin-flip
+ * @dbxUtilRelated boolean-factory
+ *
  * @param chance - Number between 0.0 and 100.0 representing the percentage chance of returning true (default: 50, i.e., 50%).
  * @returns A random boolean value with the specified probability of being true.
  */ function randomBoolean() {
@@ -20268,6 +22769,11 @@ function _define_property$1(obj, key, value) {
  * @param hashFn - A function that takes a string and returns its hashed representation.
  * @returns An array of decoded strings. Values that cannot be decoded are filtered out.
  *
+ * @dbxUtil
+ * @dbxUtilCategory hash
+ * @dbxUtilTags hash, decode, lookup, reverse, salt
+ * @dbxUtilRelated make-hash-decode-map, decode-hashed-values-with-decode-map
+ *
  * @example
  * ```ts
  * const hashed = [hashFn('apple'), hashFn('banana')];
@@ -20282,6 +22788,11 @@ function _define_property$1(obj, key, value) {
  * Creates a `HashDecodeMap` from a list of potential original string values and a hash function.
  * The map's keys are the hashed versions of the `decodeValues`, and the values are the original `decodeValues`.
  *
+ * @dbxUtil
+ * @dbxUtilCategory hash
+ * @dbxUtilTags hash, decode, map, lookup, reverse, factory
+ * @dbxUtilRelated decode-hashed-values, decode-hashed-values-with-decode-map
+ *
  * @param decodeValues - An array of potential original string values.
  * @param hashFn - A function that takes a string and returns its hashed representation.
  * @returns A {@link HashDecodeMap} for decoding hashed values.
@@ -20442,6 +22953,11 @@ function _ts_generator$1(thisArg, body) {
  * @param values - Array of values to iterate over.
  * @param useFn - Callback invoked for each value.
  *
+ * @dbxUtil
+ * @dbxUtilCategory iterate
+ * @dbxUtilTags iterate, async, sequential, each, await, for-each
+ * @dbxUtilRelated perform-async-tasks
+ *
  * @example
  * ```ts
  * await iterate([1, 2, 3], async (value) => {
@@ -21054,6 +23570,7 @@ exports.NOOP_MODIFIER = NOOP_MODIFIER;
 exports.NUMBER_STRING_DENCODER_64 = NUMBER_STRING_DENCODER_64;
 exports.NUMBER_STRING_DENCODER_64_DEFAULT_NEGATIVE_PREFIX = NUMBER_STRING_DENCODER_64_DEFAULT_NEGATIVE_PREFIX;
 exports.NUMBER_STRING_DENCODER_64_DIGITS = NUMBER_STRING_DENCODER_64_DIGITS;
+exports.OAUTH_OOB_REDIRECT_URI = OAUTH_OOB_REDIRECT_URI;
 exports.PDF_ENCRYPT_MARKER = PDF_ENCRYPT_MARKER;
 exports.PDF_EOF_MARKER = PDF_EOF_MARKER;
 exports.PDF_HEADER = PDF_HEADER;
@@ -21366,6 +23883,8 @@ exports.forEachWithArray = forEachWithArray;
 exports.forwardFunction = forwardFunction;
 exports.fractionalHoursToMinutes = fractionalHoursToMinutes;
 exports.generateIfDoesNotExist = generateIfDoesNotExist;
+exports.generatePkceCodeChallenge = generatePkceCodeChallenge;
+exports.generatePkceCodeVerifier = generatePkceCodeVerifier;
 exports.getArrayNextIndex = getArrayNextIndex;
 exports.getBaseLog = getBaseLog;
 exports.getDayOffset = getDayOffset;
@@ -21404,6 +23923,8 @@ exports.hoursAndMinutesToString = hoursAndMinutesToString;
 exports.hoursAndMinutesToTimeUnit = hoursAndMinutesToTimeUnit;
 exports.idBatchFactory = idBatchFactory;
 exports.imageFileExtensionForMimeType = imageFileExtensionForMimeType;
+exports.inMemoryAsyncKeyedValueCache = inMemoryAsyncKeyedValueCache;
+exports.inMemoryAsyncValueCache = inMemoryAsyncValueCache;
 exports.incrementingNumberFactory = incrementingNumberFactory;
 exports.indexDeltaGroup = indexDeltaGroup;
 exports.indexDeltaGroupFunction = indexDeltaGroupFunction;
@@ -21439,6 +23960,7 @@ exports.isEqualContext = isEqualContext;
 exports.isEqualDate = isEqualDate;
 exports.isEqualToValueDecisionFunction = isEqualToValueDecisionFunction;
 exports.isEvenNumber = isEvenNumber;
+exports.isExpired = isExpired;
 exports.isFalseBooleanKeyArray = isFalseBooleanKeyArray;
 exports.isFinalPage = isFinalPage;
 exports.isGetter = isGetter;
@@ -21601,8 +24123,12 @@ exports.maybeMergeModelModifiers = maybeMergeModelModifiers;
 exports.maybeMergeModifiers = maybeMergeModifiers;
 exports.maybeModifierMapToFunction = maybeModifierMapToFunction;
 exports.maybeSet = maybeSet;
+exports.memoizeAsyncKeyedValueCache = memoizeAsyncKeyedValueCache;
+exports.memoizeAsyncValueCache = memoizeAsyncValueCache;
 exports.mergeArrays = mergeArrays;
 exports.mergeArraysIntoArray = mergeArraysIntoArray;
+exports.mergeAsyncKeyedValueCaches = mergeAsyncKeyedValueCaches;
+exports.mergeAsyncValueCaches = mergeAsyncValueCaches;
 exports.mergeFilterFunctions = mergeFilterFunctions;
 exports.mergeModifiers = mergeModifiers;
 exports.mergeObjects = mergeObjects;
@@ -21639,6 +24165,7 @@ exports.multiKeyValueMapFactory = multiKeyValueMapFactory;
 exports.multiValueMapBuilder = multiValueMapBuilder;
 exports.neMostLatLngPoint = neMostLatLngPoint;
 exports.nearestDivisibleValues = nearestDivisibleValues;
+exports.noop = noop;
 exports.numberStringDencoder = numberStringDencoder;
 exports.numberStringDencoderDecodedNumberValueFunction = numberStringDencoderDecodedNumberValueFunction;
 exports.numberStringDencoderEncodedStringValueFunction = numberStringDencoderEncodedStringValueFunction;