radashi 12.6.2 → 12.7.1

package/dist/radashi.cjs

@@ -71,13 +71,13 @@ function concat(...values) {
 }
 
 // src/array/counting.ts
-function counting(array, identity) {
+function counting(array, identity2) {
   if (!array) {
     return {};
   }
   return array.reduce(
     (acc, item) => {
-      const id = identity(item);
+      const id = identity2(item);
       acc[id] = (acc[id] ?? 0) + 1;
       return acc;
     },
@@ -86,7 +86,7 @@ function counting(array, identity) {
 }
 
 // src/array/diff.ts
-function diff(root, other, identity = (t) => t) {
+function diff(root, other, identity2 = (t) => t) {
   if (!(root == null ? void 0 : root.length) && !(other == null ? void 0 : other.length)) {
     return [];
   }
@@ -98,12 +98,12 @@ function diff(root, other, identity = (t) => t) {
   }
   const bKeys = other.reduce(
     (acc, item) => {
-      acc[identity(item)] = true;
+      acc[identity2(item)] = true;
       return acc;
     },
     {}
   );
-  return root.filter((a) => !bKeys[identity(a)]);
+  return root.filter((a) => !bKeys[identity2(a)]);
 }
 
 // src/array/first.ts
@@ -144,17 +144,32 @@ function group(array, getGroupId) {
 }
 
 // src/array/intersects.ts
-function intersects(listA, listB, identity) {
+function intersects(listA, listB, identity2) {
   if (!listA || !listB) {
     return false;
   }
-  if (identity) {
-    const known = new Set(listA.map(identity));
-    return listB.some((item) => known.has(identity(item)));
+  if (identity2) {
+    const known = new Set(listA.map(identity2));
+    return listB.some((item) => known.has(identity2(item)));
   }
   return listB.some((item) => listA.includes(item));
 }
 
+// src/array/isArrayEqual.ts
+function isArrayEqual(array1, array2) {
+  if (array1 !== array2) {
+    if (array1.length !== array2.length) {
+      return false;
+    }
+    for (let i = 0; i < array1.length; i++) {
+      if (!Object.is(array1[i], array2[i])) {
+        return false;
+      }
+    }
+  }
+  return true;
+}
+
 // src/array/iterate.ts
 function iterate(count, func, initValue) {
   let value = initValue;
@@ -210,8 +225,8 @@ function merge(prev, array, toKey) {
 // src/array/objectify.ts
 function objectify(array, getKey, getValue = (item) => item) {
   return array.reduce(
-    (acc, item) => {
-      acc[getKey(item)] = getValue(item);
+    (acc, item, i) => {
+      acc[getKey(item, i)] = getValue(item, i);
       return acc;
     },
     {}
@@ -319,7 +334,7 @@ function sift(array) {
 }
 
 // src/array/sort.ts
-function sort(array, getter, desc = false) {
+function sort(array, getter = identity, desc = false) {
   if (!array) {
     return [];
   }
@@ -852,6 +867,11 @@ function castMapping(mapping) {
   return isFunction(mapping) ? mapping : mapping != null ? (input) => input[mapping] : (input) => input;
 }
 
+// src/function/identity.ts
+function identity(value) {
+  return value;
+}
+
 // src/function/noop.ts
 function noop() {
 }
@@ -1099,6 +1119,25 @@ function get(value, path, defaultValue) {
   return current;
 }
 
+// src/object/getOrInsert.ts
+function getOrInsert(map2, key, value) {
+  if (map2.has(key)) {
+    return map2.get(key);
+  }
+  map2.set(key, value);
+  return value;
+}
+
+// src/object/getOrInsertComputed.ts
+function getOrInsertComputed(map2, key, compute) {
+  if (map2.has(key)) {
+    return map2.get(key);
+  }
+  const newValue = compute();
+  map2.set(key, newValue);
+  return newValue;
+}
+
 // src/object/invert.ts
 function invert(obj) {
   if (!obj) {
@@ -1427,21 +1466,7 @@ var QuantityParser = class {
 };
 
 // src/oop/DurationParser.ts
-var _DurationParser = class _DurationParser extends QuantityParser {
-  constructor(options) {
-    super({
-      units: {
-        ..._DurationParser.units,
-        ...options == null ? void 0 : options.units
-      },
-      short: {
-        ..._DurationParser.shortUnits,
-        ...options == null ? void 0 : options.short
-      }
-    });
-  }
-};
-_DurationParser.units = {
+var DURATION_UNITS = {
   week: 6048e5,
   day: 864e5,
   hour: 36e5,
@@ -1449,7 +1474,7 @@ _DurationParser.units = {
   second: 1e3,
   millisecond: 1
 };
-_DurationParser.shortUnits = {
+var DURATION_SHORT_UNITS = {
   w: "week",
   d: "day",
   h: "hour",
@@ -1457,7 +1482,26 @@ _DurationParser.shortUnits = {
   s: "second",
   ms: "millisecond"
 };
-var DurationParser = _DurationParser;
+var DurationParser = class _DurationParser extends QuantityParser {
+  constructor(options) {
+    super({
+      units: {
+        ..._DurationParser.units,
+        ...options == null ? void 0 : options.units
+      },
+      short: {
+        ..._DurationParser.shortUnits,
+        ...options == null ? void 0 : options.short
+      }
+    });
+  }
+  static get units() {
+    return DURATION_UNITS;
+  }
+  static get shortUnits() {
+    return DURATION_SHORT_UNITS;
+  }
+};
 
 // src/oop/Semaphore.ts
 var SemaphorePermit = class {
@@ -1567,6 +1611,11 @@ var TimeoutError = class extends Error {
   }
 };
 
+// src/random/absoluteJitter.ts
+function absoluteJitter(base, offset) {
+  return base + offset * (2 * Math.random() - 1);
+}
+
 // src/random/draw.ts
 function draw(array) {
   const max2 = array.length;
@@ -1577,6 +1626,11 @@ function draw(array) {
   return array[index];
 }
 
+// src/random/proportionalJitter.ts
+function proportionalJitter(base, factor) {
+  return base * (1 - factor * (2 * Math.random() - 1));
+}
+
 // src/random/random.ts
 function random(min2, max2) {
   return Math.floor(Math.random() * (max2 - min2 + 1) + min2);
@@ -1973,6 +2027,19 @@ function isMap(value) {
   return isTagged(value, "[object Map]");
 }
 
+// src/typed/isMapEqual.ts
+function isMapEqual(x, y) {
+  if (x.size !== y.size) {
+    return false;
+  }
+  for (const [key, value] of x) {
+    if (!isEqual(value, y.get(key))) {
+      return false;
+    }
+  }
+  return true;
+}
+
 // src/typed/isNullish.ts
 function isNullish(value) {
   return value === null || value === void 0;
@@ -2037,6 +2104,19 @@ function isSet(value) {
   return isTagged(value, "[object Set]");
 }
 
+// src/typed/isSetEqual.ts
+function isSetEqual(x, y) {
+  if (x.size !== y.size) {
+    return false;
+  }
+  for (const item of x) {
+    if (!y.has(item)) {
+      return false;
+    }
+  }
+  return true;
+}
+
 // src/typed/isString.ts
 function isString(value) {
   return typeof value === "string";
@@ -2075,6 +2155,7 @@ exports.QuantityParser = QuantityParser;
 exports.Semaphore = Semaphore;
 exports.SemaphorePermit = SemaphorePermit;
 exports.TimeoutError = TimeoutError;
+exports.absoluteJitter = absoluteJitter;
 exports.all = all;
 exports.alphabetical = alphabetical;
 exports.always = always;
@@ -2112,12 +2193,16 @@ exports.flat = flat;
 exports.flip = flip;
 exports.fork = fork;
 exports.get = get;
+exports.getOrInsert = getOrInsert;
+exports.getOrInsertComputed = getOrInsertComputed;
 exports.group = group;
 exports.guard = guard;
+exports.identity = identity;
 exports.inRange = inRange;
 exports.intersects = intersects;
 exports.invert = invert;
 exports.isArray = isArray;
+exports.isArrayEqual = isArrayEqual;
 exports.isAsyncIterable = isAsyncIterable;
 exports.isBigInt = isBigInt;
 exports.isBoolean = isBoolean;
@@ -2133,6 +2218,7 @@ exports.isInt = isInt;
 exports.isIntString = isIntString;
 exports.isIterable = isIterable;
 exports.isMap = isMap;
+exports.isMapEqual = isMapEqual;
 exports.isNullish = isNullish;
 exports.isNumber = isNumber;
 exports.isObject = isObject;
@@ -2144,6 +2230,7 @@ exports.isResult = isResult;
 exports.isResultErr = isResultErr;
 exports.isResultOk = isResultOk;
 exports.isSet = isSet;
+exports.isSetEqual = isSetEqual;
 exports.isString = isString;
 exports.isSymbol = isSymbol;
 exports.isTagged = isTagged;
@@ -2180,6 +2267,7 @@ exports.pascal = pascal;
 exports.pick = pick;
 exports.pluck = pluck;
 exports.promiseChain = promiseChain;
+exports.proportionalJitter = proportionalJitter;
 exports.proxied = proxied;
 exports.queueByKey = queueByKey;
 exports.random = random;

package/dist/radashi.d.cts

@@ -241,6 +241,24 @@ declare function group<T, Key extends string | number | symbol>(array: readonly
  */
 declare function intersects<T, K>(listA: readonly T[], listB: readonly T[], identity?: (t: T) => K): boolean;
 
+/**
+ * Checks if two arrays are equal in length and content using
+ * `Object.is` comparison.
+ *
+ * @see https://radashi.js.org/reference/array/isArrayEqual
+ * @example
+ * ```ts
+ * _.isArrayEqual([1, 2, 3], [1, 2, 3]) // => true
+ * _.isArrayEqual([1, 2, 3], [1, 2, 4]) // => false
+ * _.isArrayEqual([1, 2], [1, 2, 3]) // => false
+ * _.isArrayEqual([], []) // => true
+ * _.isArrayEqual([NaN], [NaN]) // => true (Object.is handles NaN)
+ * _.isArrayEqual([0], [-0]) // => false (Object.is handles +0 and -0)
+ * ```
+ * @version 12.7.0
+ */
+declare function isArrayEqual<T>(array1: T[], array2: T[]): boolean;
+
 /**
  * Like a reduce but does not require an array. Only need a number and
  * will iterate the function as many times as specified.
@@ -353,7 +371,7 @@ declare function merge<T>(prev: readonly T[], array: readonly T[], toKey: (item:
  * ```
  * @version 12.1.0
  */
-declare function objectify<T, Key extends string | number | symbol, Value = T>(array: readonly T[], getKey: (item: T) => Key, getValue?: (item: T) => Value): Record<Key, Value>;
+declare function objectify<T, Key extends string | number | symbol, Value = T>(array: readonly T[], getKey: (item: T, index: number) => Key, getValue?: (item: T, index: number) => Value): Record<Key, Value>;
 
 /**
  * Extracts values from an array of objects based on specified
@@ -539,7 +557,7 @@ declare function sift<T>(array: readonly (T | Falsy)[]): T[];
  * ```
  * @version 12.1.0
  */
-declare function sort<T>(array: readonly T[], getter: (item: T) => number, desc?: boolean): T[];
+declare function sort<T>(array: readonly T[], getter?: (item: T) => number, desc?: boolean): T[];
 
 /**
  * Either adds or removes an item from an array, based on whether it
@@ -2221,6 +2239,21 @@ type MappedOutput<TMapping, TInput = any> = TMapping extends (data: TInput) => i
  */
 type MappingFunction<TMapping extends Mapping | null | undefined> = <TInput extends MappedInput<TMapping>>(input: TInput) => MappedOutput<TMapping, TInput>;
 
+/**
+ * A function that returns the value passed to it.
+ *
+ * @see https://radashi.js.org/reference/function/identity
+ * @example
+ * ```ts
+ * identity() // => undefined
+ * identity(1) // => 1
+ * identity("a") // => "a"
+ * ```
+ * @version 12.7.0
+ */
+declare function identity(): undefined;
+declare function identity<T>(value: T): T;
+
 /**
  * A callback that does nothing and returns undefined.
  *
@@ -2319,6 +2352,7 @@ declare function lerp(from: number, to: number, amount: number): number;
  */
 declare function max(array: readonly [number, ...number[]]): number;
 declare function max(array: readonly number[]): number | null;
+declare function max<T>(array: readonly [T, ...T[]], getter: (item: T) => number): T;
 declare function max<T>(array: readonly T[], getter: (item: T) => number): T | null;
 
 /**
@@ -2334,6 +2368,7 @@ declare function max<T>(array: readonly T[], getter: (item: T) => number): T | n
  */
 declare function min(array: readonly [number, ...number[]]): number;
 declare function min(array: readonly number[]): number | null;
+declare function min<T>(array: readonly [T, ...T[]], getter: (item: T) => number): T;
 declare function min<T>(array: readonly T[], getter: (item: T) => number): T | null;
 
 /**
@@ -2720,6 +2755,40 @@ declare function filterKey(obj: object, key: keyof any, filter: KeyFilter | null
  */
 declare function get<TDefault = unknown>(value: any, path: string, defaultValue?: TDefault): TDefault;
 
+/**
+ * Returns a map entry or stores and returns the provided value when missing.
+ *
+ * @see https://radashi.js.org/reference/object/getOrInsert
+ * @example
+ * ```ts
+ * const counts = new Map<string, number>()
+ *
+ * getOrInsert(counts, 'clicks', 1)
+ * getOrInsert(counts, 'clicks', 5)
+ * // => 1
+ * ```
+ * @version 12.7.0
+ */
+declare function getOrInsert<K, V>(map: Map<K, V>, key: K, value: V): V;
+declare function getOrInsert<K extends object, V>(map: Map<K, V> | WeakMap<K, V>, key: K, value: V): V;
+
+/**
+ * Returns a map entry or stores the computed value when the key is missing.
+ *
+ * @see https://radashi.js.org/reference/object/getOrInsertComputed
+ * @example
+ * ```ts
+ * const counts = new Map<string, number>()
+ *
+ * getOrInsertComputed(counts, 'clicks', () => 1)
+ * getOrInsertComputed(counts, 'clicks', () => 5)
+ * // => 1
+ * ```
+ * @version 12.7.0
+ */
+declare function getOrInsertComputed<K, V>(map: Map<K, V>, key: K, factory: () => V): V;
+declare function getOrInsertComputed<K extends object, V>(map: Map<K, V> | WeakMap<K, V>, key: K, compute: () => V): V;
+
 /**
  * Returns a new object whose keys are the values of the given object
  * and its values are the keys of the given object.
@@ -3098,6 +3167,22 @@ type DurationShortUnit = keyof typeof DurationParser.shortUnits;
  * A human-readable duration string.
  */
 type DurationString<TUnit extends string = never, TShortUnit extends string = never> = QuantityString<DurationUnit | TUnit, DurationShortUnit | TShortUnit>;
+declare const DURATION_UNITS: {
+    readonly week: 604800000;
+    readonly day: 86400000;
+    readonly hour: 3600000;
+    readonly minute: 60000;
+    readonly second: 1000;
+    readonly millisecond: 1;
+};
+declare const DURATION_SHORT_UNITS: {
+    readonly w: "week";
+    readonly d: "day";
+    readonly h: "hour";
+    readonly m: "minute";
+    readonly s: "second";
+    readonly ms: "millisecond";
+};
 /**
  * Parses a duration string into its numeric value.
  *
@@ -3110,22 +3195,8 @@ type DurationString<TUnit extends string = never, TShortUnit extends string = ne
  */
 declare class DurationParser<TUnit extends string = never, TShortUnit extends string = never> extends QuantityParser<DurationUnit | TUnit, DurationShortUnit | TShortUnit> {
     constructor(options?: DurationParser.Options<TUnit, TShortUnit>);
-    static units: {
-        readonly week: 604800000;
-        readonly day: 86400000;
-        readonly hour: 3600000;
-        readonly minute: 60000;
-        readonly second: 1000;
-        readonly millisecond: 1;
-    };
-    static shortUnits: {
-        readonly w: "week";
-        readonly d: "day";
-        readonly h: "hour";
-        readonly m: "minute";
-        readonly s: "second";
-        readonly ms: "millisecond";
-    };
+    static get units(): typeof DURATION_UNITS;
+    static get shortUnits(): typeof DURATION_SHORT_UNITS;
 }
 declare namespace DurationParser {
     /**
@@ -3212,6 +3283,20 @@ declare class TimeoutError extends Error {
     constructor(message?: string);
 }
 
+/**
+ * Returns a value randomly jittered by an absolute offset.
+ *
+ * @see https://radashi.js.org/reference/random/absoluteJitter
+ * @example
+ * ```ts
+ * const result = absoluteJitter(100, 5)
+ * result >= 95 && result <= 105
+ * // => true
+ * ```
+ * @version 12.7.0
+ */
+declare function absoluteJitter(base: number, offset: number): number;
+
 /**
  * “Draw” a random item from an array. The item is not removed from
  * the array. Returns `null` if the array is empty.
@@ -3230,6 +3315,20 @@ declare class TimeoutError extends Error {
  */
 declare function draw<const T extends readonly any[]>(array: T): T extends readonly [any, ...any[]] ? T[number] : T[number] | null;
 
+/**
+ * Returns a value randomly jittered by a proportion of the base value.
+ *
+ * @see https://radashi.js.org/reference/random/proportionalJitter
+ * @example
+ * ```ts
+ * const result = proportionalJitter(100, 0.25)
+ * result >= 75 && result <= 125
+ * // => true
+ * ```
+ * @version 12.7.0
+ */
+declare function proportionalJitter(base: number, factor: number): number;
+
 /**
  * Generates a random integer between min and max. Both min and max
  * are inclusive.
@@ -3812,6 +3911,15 @@ type ExtractMap<T> = T extends any ? [StrictExtract<T, ReadonlyMap<unknown, unkn
     ReadonlyMap<unknown, unknown>
 ] ? Extract<T, ReadonlyMap<unknown, unknown>> : [StrictExtract<T, Map<unknown, unknown>>] extends [Map<unknown, unknown>] ? Extract<T, Map<unknown, unknown>> : Map<unknown, unknown> extends T ? Map<unknown, unknown> : never : never;
 
+/**
+ * Check if two maps are equal. Items are checked for deep equality
+ * using the `isEqual` function.
+ *
+ * @see https://radashi.js.org/reference/typed/isMapEqual
+ * @version 12.7.0
+ */
+declare function isMapEqual(x: Map<any, any>, y: Map<any, any>): boolean;
+
 /**
  * Return true if the given value is null or undefined.
  *
@@ -4009,6 +4117,16 @@ declare function isSet<Input>(value: Input): value is ExtractSet<Input>;
  */
 type ExtractSet<T> = T extends any ? [StrictExtract<T, ReadonlySet<unknown>>] extends [ReadonlySet<unknown>] ? Extract<T, ReadonlySet<unknown>> : [StrictExtract<T, Set<unknown>>] extends [Set<unknown>] ? Extract<T, Set<unknown>> : Set<unknown> extends T ? Set<unknown> : never : never;
 
+/**
+ * Check if two sets are equal.
+ *
+ * Note: This does NOT check for deep equality of the items.
+ *
+ * @see https://radashi.js.org/reference/typed/isSetEqual
+ * @version 12.7.0
+ */
+declare function isSetEqual(x: Set<any>, y: Set<any>): boolean;
+
 /**
  * Checks if the given value is a string.
  *
@@ -4097,4 +4215,4 @@ declare function isWeakMap<K extends WeakKey = WeakKey, V = unknown>(value: unkn
  */
 declare function isWeakSet<T extends WeakKey = WeakKey>(value: unknown): value is WeakSet<T>;
 
-export { AggregateErrorOrPolyfill as AggregateError, Any, type Assign, type Awaitable, type BoxedPrimitive, type BuiltInType, type CastArray, type CastArrayIfExists, type Class, type CloningStrategy, type Comparable, type ComparableProperty, type Comparator, type ComparatorMapping, type CompatibleProperty, type Concat, type Crush, type CustomClass, type CustomClassRegistry, type DebounceFunction, type DebounceOptions, DefaultCloningStrategy, DurationParser, type DurationShortUnit, type DurationString, type DurationUnit, type Err, type ExtractArray, type ExtractClass, type ExtractMap, type ExtractNotAny, type ExtractSet, type Falsy, FastCloningStrategy, type FilteredKeys, type Flip, type GuardReturnType, type Intersect, type IsExactType, type KeyFilter, type KeyFilterFunction, type LowercaseKeys, type MappedInput, type MappedOutput, type Mapping, type MappingFunction, type MemoOptions, type NoInfer$1 as NoInfer, type Ok, type OnceFunction, type OptionalKeys, type OptionalMapping, type ParallelOptions, type Primitive, type PromiseWithResolvers, QuantityParser, type QuantityString, type RequiredKeys, type Result, type ResultPromise, type RetryOptions, Semaphore, type SemaphoreAcquireOptions, SemaphorePermit, type Series, type Simplify, type StrictExtract, type SwitchAny, type SwitchNever, type ThrottledFunction, TimeoutError, type ToEmpty, type ToEmptyAble, type TraverseContext, type TraverseOptions, type TraverseVisitor, type TryitResult, type TypedArray, type UppercaseKeys, all, alphabetical, always, assert, assign, boil, callable, camel, capitalize, cartesianProduct, castArray, castArrayIfExists, castComparator, castMapping, chain, clamp, clone, cloneDeep, cluster, compose, concat, construct, counting, crush, dash, debounce, dedent, defer, diff, draw, escapeHTML, filterKey, first, flat, flip, fork, get, group, guard, inRange, intersects, invert, isArray, isAsyncIterable, isBigInt, isBoolean, isClass, isDangerousKey, isDate, isEmpty, isEqual, isError, isFloat, isFunction, isInt, isIntString, isIterable, isMap, isNullish, isNumber, isObject, isPlainObject, isPrimitive, isPromise, isRegExp, isResult, isResultErr, isResultOk, isSet, isString, isSymbol, isTagged, isUndefined, isWeakMap, isWeakSet, iterate, keys, last, lerp, list, listify, lowerize, map, mapEntries, mapKeys, mapValues, mapify, max, memo, memoLastCall, merge, min, noop, objectify, omit, once, parallel, parseDuration, parseQuantity, partial, partob, pascal, pick, pluck, promiseChain, proxied, queueByKey, random, range, reduce, remove, replace, replaceOrAppend, retry, round, select, selectFirst, series, set, shake, shift, shuffle, sift, similarity, sleep, snake, sort, sum, template, throttle, timeout, title, toFloat, toInt, toResult, toggle, traverse, trim, tryit as try, tryit, uid, unique, unzip, upperize, withResolvers, zip, zipToObject };
+export { AggregateErrorOrPolyfill as AggregateError, Any, type Assign, type Awaitable, type BoxedPrimitive, type BuiltInType, type CastArray, type CastArrayIfExists, type Class, type CloningStrategy, type Comparable, type ComparableProperty, type Comparator, type ComparatorMapping, type CompatibleProperty, type Concat, type Crush, type CustomClass, type CustomClassRegistry, type DebounceFunction, type DebounceOptions, DefaultCloningStrategy, DurationParser, type DurationShortUnit, type DurationString, type DurationUnit, type Err, type ExtractArray, type ExtractClass, type ExtractMap, type ExtractNotAny, type ExtractSet, type Falsy, FastCloningStrategy, type FilteredKeys, type Flip, type GuardReturnType, type Intersect, type IsExactType, type KeyFilter, type KeyFilterFunction, type LowercaseKeys, type MappedInput, type MappedOutput, type Mapping, type MappingFunction, type MemoOptions, type NoInfer$1 as NoInfer, type Ok, type OnceFunction, type OptionalKeys, type OptionalMapping, type ParallelOptions, type Primitive, type PromiseWithResolvers, QuantityParser, type QuantityString, type RequiredKeys, type Result, type ResultPromise, type RetryOptions, Semaphore, type SemaphoreAcquireOptions, SemaphorePermit, type Series, type Simplify, type StrictExtract, type SwitchAny, type SwitchNever, type ThrottledFunction, TimeoutError, type ToEmpty, type ToEmptyAble, type TraverseContext, type TraverseOptions, type TraverseVisitor, type TryitResult, type TypedArray, type UppercaseKeys, absoluteJitter, all, alphabetical, always, assert, assign, boil, callable, camel, capitalize, cartesianProduct, castArray, castArrayIfExists, castComparator, castMapping, chain, clamp, clone, cloneDeep, cluster, compose, concat, construct, counting, crush, dash, debounce, dedent, defer, diff, draw, escapeHTML, filterKey, first, flat, flip, fork, get, getOrInsert, getOrInsertComputed, group, guard, identity, inRange, intersects, invert, isArray, isArrayEqual, isAsyncIterable, isBigInt, isBoolean, isClass, isDangerousKey, isDate, isEmpty, isEqual, isError, isFloat, isFunction, isInt, isIntString, isIterable, isMap, isMapEqual, isNullish, isNumber, isObject, isPlainObject, isPrimitive, isPromise, isRegExp, isResult, isResultErr, isResultOk, isSet, isSetEqual, isString, isSymbol, isTagged, isUndefined, isWeakMap, isWeakSet, iterate, keys, last, lerp, list, listify, lowerize, map, mapEntries, mapKeys, mapValues, mapify, max, memo, memoLastCall, merge, min, noop, objectify, omit, once, parallel, parseDuration, parseQuantity, partial, partob, pascal, pick, pluck, promiseChain, proportionalJitter, proxied, queueByKey, random, range, reduce, remove, replace, replaceOrAppend, retry, round, select, selectFirst, series, set, shake, shift, shuffle, sift, similarity, sleep, snake, sort, sum, template, throttle, timeout, title, toFloat, toInt, toResult, toggle, traverse, trim, tryit as try, tryit, uid, unique, unzip, upperize, withResolvers, zip, zipToObject };

package/dist/radashi.d.ts

@@ -241,6 +241,24 @@ declare function group<T, Key extends string | number | symbol>(array: readonly
  */
 declare function intersects<T, K>(listA: readonly T[], listB: readonly T[], identity?: (t: T) => K): boolean;
 
+/**
+ * Checks if two arrays are equal in length and content using
+ * `Object.is` comparison.
+ *
+ * @see https://radashi.js.org/reference/array/isArrayEqual
+ * @example
+ * ```ts
+ * _.isArrayEqual([1, 2, 3], [1, 2, 3]) // => true
+ * _.isArrayEqual([1, 2, 3], [1, 2, 4]) // => false
+ * _.isArrayEqual([1, 2], [1, 2, 3]) // => false
+ * _.isArrayEqual([], []) // => true
+ * _.isArrayEqual([NaN], [NaN]) // => true (Object.is handles NaN)
+ * _.isArrayEqual([0], [-0]) // => false (Object.is handles +0 and -0)
+ * ```
+ * @version 12.7.0
+ */
+declare function isArrayEqual<T>(array1: T[], array2: T[]): boolean;
+
 /**
  * Like a reduce but does not require an array. Only need a number and
  * will iterate the function as many times as specified.
@@ -353,7 +371,7 @@ declare function merge<T>(prev: readonly T[], array: readonly T[], toKey: (item:
  * ```
  * @version 12.1.0
  */
-declare function objectify<T, Key extends string | number | symbol, Value = T>(array: readonly T[], getKey: (item: T) => Key, getValue?: (item: T) => Value): Record<Key, Value>;
+declare function objectify<T, Key extends string | number | symbol, Value = T>(array: readonly T[], getKey: (item: T, index: number) => Key, getValue?: (item: T, index: number) => Value): Record<Key, Value>;
 
 /**
  * Extracts values from an array of objects based on specified
@@ -539,7 +557,7 @@ declare function sift<T>(array: readonly (T | Falsy)[]): T[];
  * ```
  * @version 12.1.0
  */
-declare function sort<T>(array: readonly T[], getter: (item: T) => number, desc?: boolean): T[];
+declare function sort<T>(array: readonly T[], getter?: (item: T) => number, desc?: boolean): T[];
 
 /**
  * Either adds or removes an item from an array, based on whether it
@@ -2221,6 +2239,21 @@ type MappedOutput<TMapping, TInput = any> = TMapping extends (data: TInput) => i
  */
 type MappingFunction<TMapping extends Mapping | null | undefined> = <TInput extends MappedInput<TMapping>>(input: TInput) => MappedOutput<TMapping, TInput>;
 
+/**
+ * A function that returns the value passed to it.
+ *
+ * @see https://radashi.js.org/reference/function/identity
+ * @example
+ * ```ts
+ * identity() // => undefined
+ * identity(1) // => 1
+ * identity("a") // => "a"
+ * ```
+ * @version 12.7.0
+ */
+declare function identity(): undefined;
+declare function identity<T>(value: T): T;
+
 /**
  * A callback that does nothing and returns undefined.
  *
@@ -2319,6 +2352,7 @@ declare function lerp(from: number, to: number, amount: number): number;
  */
 declare function max(array: readonly [number, ...number[]]): number;
 declare function max(array: readonly number[]): number | null;
+declare function max<T>(array: readonly [T, ...T[]], getter: (item: T) => number): T;
 declare function max<T>(array: readonly T[], getter: (item: T) => number): T | null;
 
 /**
@@ -2334,6 +2368,7 @@ declare function max<T>(array: readonly T[], getter: (item: T) => number): T | n
  */
 declare function min(array: readonly [number, ...number[]]): number;
 declare function min(array: readonly number[]): number | null;
+declare function min<T>(array: readonly [T, ...T[]], getter: (item: T) => number): T;
 declare function min<T>(array: readonly T[], getter: (item: T) => number): T | null;
 
 /**
@@ -2720,6 +2755,40 @@ declare function filterKey(obj: object, key: keyof any, filter: KeyFilter | null
  */
 declare function get<TDefault = unknown>(value: any, path: string, defaultValue?: TDefault): TDefault;
 
+/**
+ * Returns a map entry or stores and returns the provided value when missing.
+ *
+ * @see https://radashi.js.org/reference/object/getOrInsert
+ * @example
+ * ```ts
+ * const counts = new Map<string, number>()
+ *
+ * getOrInsert(counts, 'clicks', 1)
+ * getOrInsert(counts, 'clicks', 5)
+ * // => 1
+ * ```
+ * @version 12.7.0
+ */
+declare function getOrInsert<K, V>(map: Map<K, V>, key: K, value: V): V;
+declare function getOrInsert<K extends object, V>(map: Map<K, V> | WeakMap<K, V>, key: K, value: V): V;
+
+/**
+ * Returns a map entry or stores the computed value when the key is missing.
+ *
+ * @see https://radashi.js.org/reference/object/getOrInsertComputed
+ * @example
+ * ```ts
+ * const counts = new Map<string, number>()
+ *
+ * getOrInsertComputed(counts, 'clicks', () => 1)
+ * getOrInsertComputed(counts, 'clicks', () => 5)
+ * // => 1
+ * ```
+ * @version 12.7.0
+ */
+declare function getOrInsertComputed<K, V>(map: Map<K, V>, key: K, factory: () => V): V;
+declare function getOrInsertComputed<K extends object, V>(map: Map<K, V> | WeakMap<K, V>, key: K, compute: () => V): V;
+
 /**
  * Returns a new object whose keys are the values of the given object
  * and its values are the keys of the given object.
@@ -3098,6 +3167,22 @@ type DurationShortUnit = keyof typeof DurationParser.shortUnits;
  * A human-readable duration string.
  */
 type DurationString<TUnit extends string = never, TShortUnit extends string = never> = QuantityString<DurationUnit | TUnit, DurationShortUnit | TShortUnit>;
+declare const DURATION_UNITS: {
+    readonly week: 604800000;
+    readonly day: 86400000;
+    readonly hour: 3600000;
+    readonly minute: 60000;
+    readonly second: 1000;
+    readonly millisecond: 1;
+};
+declare const DURATION_SHORT_UNITS: {
+    readonly w: "week";
+    readonly d: "day";
+    readonly h: "hour";
+    readonly m: "minute";
+    readonly s: "second";
+    readonly ms: "millisecond";
+};
 /**
  * Parses a duration string into its numeric value.
  *
@@ -3110,22 +3195,8 @@ type DurationString<TUnit extends string = never, TShortUnit extends string = ne
  */
 declare class DurationParser<TUnit extends string = never, TShortUnit extends string = never> extends QuantityParser<DurationUnit | TUnit, DurationShortUnit | TShortUnit> {
     constructor(options?: DurationParser.Options<TUnit, TShortUnit>);
-    static units: {
-        readonly week: 604800000;
-        readonly day: 86400000;
-        readonly hour: 3600000;
-        readonly minute: 60000;
-        readonly second: 1000;
-        readonly millisecond: 1;
-    };
-    static shortUnits: {
-        readonly w: "week";
-        readonly d: "day";
-        readonly h: "hour";
-        readonly m: "minute";
-        readonly s: "second";
-        readonly ms: "millisecond";
-    };
+    static get units(): typeof DURATION_UNITS;
+    static get shortUnits(): typeof DURATION_SHORT_UNITS;
 }
 declare namespace DurationParser {
     /**
@@ -3212,6 +3283,20 @@ declare class TimeoutError extends Error {
     constructor(message?: string);
 }
 
+/**
+ * Returns a value randomly jittered by an absolute offset.
+ *
+ * @see https://radashi.js.org/reference/random/absoluteJitter
+ * @example
+ * ```ts
+ * const result = absoluteJitter(100, 5)
+ * result >= 95 && result <= 105
+ * // => true
+ * ```
+ * @version 12.7.0
+ */
+declare function absoluteJitter(base: number, offset: number): number;
+
 /**
  * “Draw” a random item from an array. The item is not removed from
  * the array. Returns `null` if the array is empty.
@@ -3230,6 +3315,20 @@ declare class TimeoutError extends Error {
  */
 declare function draw<const T extends readonly any[]>(array: T): T extends readonly [any, ...any[]] ? T[number] : T[number] | null;
 
+/**
+ * Returns a value randomly jittered by a proportion of the base value.
+ *
+ * @see https://radashi.js.org/reference/random/proportionalJitter
+ * @example
+ * ```ts
+ * const result = proportionalJitter(100, 0.25)
+ * result >= 75 && result <= 125
+ * // => true
+ * ```
+ * @version 12.7.0
+ */
+declare function proportionalJitter(base: number, factor: number): number;
+
 /**
  * Generates a random integer between min and max. Both min and max
  * are inclusive.
@@ -3812,6 +3911,15 @@ type ExtractMap<T> = T extends any ? [StrictExtract<T, ReadonlyMap<unknown, unkn
     ReadonlyMap<unknown, unknown>
 ] ? Extract<T, ReadonlyMap<unknown, unknown>> : [StrictExtract<T, Map<unknown, unknown>>] extends [Map<unknown, unknown>] ? Extract<T, Map<unknown, unknown>> : Map<unknown, unknown> extends T ? Map<unknown, unknown> : never : never;
 
+/**
+ * Check if two maps are equal. Items are checked for deep equality
+ * using the `isEqual` function.
+ *
+ * @see https://radashi.js.org/reference/typed/isMapEqual
+ * @version 12.7.0
+ */
+declare function isMapEqual(x: Map<any, any>, y: Map<any, any>): boolean;
+
 /**
  * Return true if the given value is null or undefined.
  *
@@ -4009,6 +4117,16 @@ declare function isSet<Input>(value: Input): value is ExtractSet<Input>;
  */
 type ExtractSet<T> = T extends any ? [StrictExtract<T, ReadonlySet<unknown>>] extends [ReadonlySet<unknown>] ? Extract<T, ReadonlySet<unknown>> : [StrictExtract<T, Set<unknown>>] extends [Set<unknown>] ? Extract<T, Set<unknown>> : Set<unknown> extends T ? Set<unknown> : never : never;
 
+/**
+ * Check if two sets are equal.
+ *
+ * Note: This does NOT check for deep equality of the items.
+ *
+ * @see https://radashi.js.org/reference/typed/isSetEqual
+ * @version 12.7.0
+ */
+declare function isSetEqual(x: Set<any>, y: Set<any>): boolean;
+
 /**
  * Checks if the given value is a string.
  *
@@ -4097,4 +4215,4 @@ declare function isWeakMap<K extends WeakKey = WeakKey, V = unknown>(value: unkn
  */
 declare function isWeakSet<T extends WeakKey = WeakKey>(value: unknown): value is WeakSet<T>;
 
-export { AggregateErrorOrPolyfill as AggregateError, Any, type Assign, type Awaitable, type BoxedPrimitive, type BuiltInType, type CastArray, type CastArrayIfExists, type Class, type CloningStrategy, type Comparable, type ComparableProperty, type Comparator, type ComparatorMapping, type CompatibleProperty, type Concat, type Crush, type CustomClass, type CustomClassRegistry, type DebounceFunction, type DebounceOptions, DefaultCloningStrategy, DurationParser, type DurationShortUnit, type DurationString, type DurationUnit, type Err, type ExtractArray, type ExtractClass, type ExtractMap, type ExtractNotAny, type ExtractSet, type Falsy, FastCloningStrategy, type FilteredKeys, type Flip, type GuardReturnType, type Intersect, type IsExactType, type KeyFilter, type KeyFilterFunction, type LowercaseKeys, type MappedInput, type MappedOutput, type Mapping, type MappingFunction, type MemoOptions, type NoInfer$1 as NoInfer, type Ok, type OnceFunction, type OptionalKeys, type OptionalMapping, type ParallelOptions, type Primitive, type PromiseWithResolvers, QuantityParser, type QuantityString, type RequiredKeys, type Result, type ResultPromise, type RetryOptions, Semaphore, type SemaphoreAcquireOptions, SemaphorePermit, type Series, type Simplify, type StrictExtract, type SwitchAny, type SwitchNever, type ThrottledFunction, TimeoutError, type ToEmpty, type ToEmptyAble, type TraverseContext, type TraverseOptions, type TraverseVisitor, type TryitResult, type TypedArray, type UppercaseKeys, all, alphabetical, always, assert, assign, boil, callable, camel, capitalize, cartesianProduct, castArray, castArrayIfExists, castComparator, castMapping, chain, clamp, clone, cloneDeep, cluster, compose, concat, construct, counting, crush, dash, debounce, dedent, defer, diff, draw, escapeHTML, filterKey, first, flat, flip, fork, get, group, guard, inRange, intersects, invert, isArray, isAsyncIterable, isBigInt, isBoolean, isClass, isDangerousKey, isDate, isEmpty, isEqual, isError, isFloat, isFunction, isInt, isIntString, isIterable, isMap, isNullish, isNumber, isObject, isPlainObject, isPrimitive, isPromise, isRegExp, isResult, isResultErr, isResultOk, isSet, isString, isSymbol, isTagged, isUndefined, isWeakMap, isWeakSet, iterate, keys, last, lerp, list, listify, lowerize, map, mapEntries, mapKeys, mapValues, mapify, max, memo, memoLastCall, merge, min, noop, objectify, omit, once, parallel, parseDuration, parseQuantity, partial, partob, pascal, pick, pluck, promiseChain, proxied, queueByKey, random, range, reduce, remove, replace, replaceOrAppend, retry, round, select, selectFirst, series, set, shake, shift, shuffle, sift, similarity, sleep, snake, sort, sum, template, throttle, timeout, title, toFloat, toInt, toResult, toggle, traverse, trim, tryit as try, tryit, uid, unique, unzip, upperize, withResolvers, zip, zipToObject };
+export { AggregateErrorOrPolyfill as AggregateError, Any, type Assign, type Awaitable, type BoxedPrimitive, type BuiltInType, type CastArray, type CastArrayIfExists, type Class, type CloningStrategy, type Comparable, type ComparableProperty, type Comparator, type ComparatorMapping, type CompatibleProperty, type Concat, type Crush, type CustomClass, type CustomClassRegistry, type DebounceFunction, type DebounceOptions, DefaultCloningStrategy, DurationParser, type DurationShortUnit, type DurationString, type DurationUnit, type Err, type ExtractArray, type ExtractClass, type ExtractMap, type ExtractNotAny, type ExtractSet, type Falsy, FastCloningStrategy, type FilteredKeys, type Flip, type GuardReturnType, type Intersect, type IsExactType, type KeyFilter, type KeyFilterFunction, type LowercaseKeys, type MappedInput, type MappedOutput, type Mapping, type MappingFunction, type MemoOptions, type NoInfer$1 as NoInfer, type Ok, type OnceFunction, type OptionalKeys, type OptionalMapping, type ParallelOptions, type Primitive, type PromiseWithResolvers, QuantityParser, type QuantityString, type RequiredKeys, type Result, type ResultPromise, type RetryOptions, Semaphore, type SemaphoreAcquireOptions, SemaphorePermit, type Series, type Simplify, type StrictExtract, type SwitchAny, type SwitchNever, type ThrottledFunction, TimeoutError, type ToEmpty, type ToEmptyAble, type TraverseContext, type TraverseOptions, type TraverseVisitor, type TryitResult, type TypedArray, type UppercaseKeys, absoluteJitter, all, alphabetical, always, assert, assign, boil, callable, camel, capitalize, cartesianProduct, castArray, castArrayIfExists, castComparator, castMapping, chain, clamp, clone, cloneDeep, cluster, compose, concat, construct, counting, crush, dash, debounce, dedent, defer, diff, draw, escapeHTML, filterKey, first, flat, flip, fork, get, getOrInsert, getOrInsertComputed, group, guard, identity, inRange, intersects, invert, isArray, isArrayEqual, isAsyncIterable, isBigInt, isBoolean, isClass, isDangerousKey, isDate, isEmpty, isEqual, isError, isFloat, isFunction, isInt, isIntString, isIterable, isMap, isMapEqual, isNullish, isNumber, isObject, isPlainObject, isPrimitive, isPromise, isRegExp, isResult, isResultErr, isResultOk, isSet, isSetEqual, isString, isSymbol, isTagged, isUndefined, isWeakMap, isWeakSet, iterate, keys, last, lerp, list, listify, lowerize, map, mapEntries, mapKeys, mapValues, mapify, max, memo, memoLastCall, merge, min, noop, objectify, omit, once, parallel, parseDuration, parseQuantity, partial, partob, pascal, pick, pluck, promiseChain, proportionalJitter, proxied, queueByKey, random, range, reduce, remove, replace, replaceOrAppend, retry, round, select, selectFirst, series, set, shake, shift, shuffle, sift, similarity, sleep, snake, sort, sum, template, throttle, timeout, title, toFloat, toInt, toResult, toggle, traverse, trim, tryit as try, tryit, uid, unique, unzip, upperize, withResolvers, zip, zipToObject };

package/dist/radashi.js

@@ -69,13 +69,13 @@ function concat(...values) {
 }
 
 // src/array/counting.ts
-function counting(array, identity) {
+function counting(array, identity2) {
   if (!array) {
     return {};
   }
   return array.reduce(
     (acc, item) => {
-      const id = identity(item);
+      const id = identity2(item);
       acc[id] = (acc[id] ?? 0) + 1;
       return acc;
     },
@@ -84,7 +84,7 @@ function counting(array, identity) {
 }
 
 // src/array/diff.ts
-function diff(root, other, identity = (t) => t) {
+function diff(root, other, identity2 = (t) => t) {
   if (!(root == null ? void 0 : root.length) && !(other == null ? void 0 : other.length)) {
     return [];
   }
@@ -96,12 +96,12 @@ function diff(root, other, identity = (t) => t) {
   }
   const bKeys = other.reduce(
     (acc, item) => {
-      acc[identity(item)] = true;
+      acc[identity2(item)] = true;
       return acc;
     },
     {}
   );
-  return root.filter((a) => !bKeys[identity(a)]);
+  return root.filter((a) => !bKeys[identity2(a)]);
 }
 
 // src/array/first.ts
@@ -142,17 +142,32 @@ function group(array, getGroupId) {
 }
 
 // src/array/intersects.ts
-function intersects(listA, listB, identity) {
+function intersects(listA, listB, identity2) {
   if (!listA || !listB) {
     return false;
   }
-  if (identity) {
-    const known = new Set(listA.map(identity));
-    return listB.some((item) => known.has(identity(item)));
+  if (identity2) {
+    const known = new Set(listA.map(identity2));
+    return listB.some((item) => known.has(identity2(item)));
   }
   return listB.some((item) => listA.includes(item));
 }
 
+// src/array/isArrayEqual.ts
+function isArrayEqual(array1, array2) {
+  if (array1 !== array2) {
+    if (array1.length !== array2.length) {
+      return false;
+    }
+    for (let i = 0; i < array1.length; i++) {
+      if (!Object.is(array1[i], array2[i])) {
+        return false;
+      }
+    }
+  }
+  return true;
+}
+
 // src/array/iterate.ts
 function iterate(count, func, initValue) {
   let value = initValue;
@@ -208,8 +223,8 @@ function merge(prev, array, toKey) {
 // src/array/objectify.ts
 function objectify(array, getKey, getValue = (item) => item) {
   return array.reduce(
-    (acc, item) => {
-      acc[getKey(item)] = getValue(item);
+    (acc, item, i) => {
+      acc[getKey(item, i)] = getValue(item, i);
       return acc;
     },
     {}
@@ -317,7 +332,7 @@ function sift(array) {
 }
 
 // src/array/sort.ts
-function sort(array, getter, desc = false) {
+function sort(array, getter = identity, desc = false) {
   if (!array) {
     return [];
   }
@@ -850,6 +865,11 @@ function castMapping(mapping) {
   return isFunction(mapping) ? mapping : mapping != null ? (input) => input[mapping] : (input) => input;
 }
 
+// src/function/identity.ts
+function identity(value) {
+  return value;
+}
+
 // src/function/noop.ts
 function noop() {
 }
@@ -1097,6 +1117,25 @@ function get(value, path, defaultValue) {
   return current;
 }
 
+// src/object/getOrInsert.ts
+function getOrInsert(map2, key, value) {
+  if (map2.has(key)) {
+    return map2.get(key);
+  }
+  map2.set(key, value);
+  return value;
+}
+
+// src/object/getOrInsertComputed.ts
+function getOrInsertComputed(map2, key, compute) {
+  if (map2.has(key)) {
+    return map2.get(key);
+  }
+  const newValue = compute();
+  map2.set(key, newValue);
+  return newValue;
+}
+
 // src/object/invert.ts
 function invert(obj) {
   if (!obj) {
@@ -1425,21 +1464,7 @@ var QuantityParser = class {
 };
 
 // src/oop/DurationParser.ts
-var _DurationParser = class _DurationParser extends QuantityParser {
-  constructor(options) {
-    super({
-      units: {
-        ..._DurationParser.units,
-        ...options == null ? void 0 : options.units
-      },
-      short: {
-        ..._DurationParser.shortUnits,
-        ...options == null ? void 0 : options.short
-      }
-    });
-  }
-};
-_DurationParser.units = {
+var DURATION_UNITS = {
   week: 6048e5,
   day: 864e5,
   hour: 36e5,
@@ -1447,7 +1472,7 @@ _DurationParser.units = {
   second: 1e3,
   millisecond: 1
 };
-_DurationParser.shortUnits = {
+var DURATION_SHORT_UNITS = {
   w: "week",
   d: "day",
   h: "hour",
@@ -1455,7 +1480,26 @@ _DurationParser.shortUnits = {
   s: "second",
   ms: "millisecond"
 };
-var DurationParser = _DurationParser;
+var DurationParser = class _DurationParser extends QuantityParser {
+  constructor(options) {
+    super({
+      units: {
+        ..._DurationParser.units,
+        ...options == null ? void 0 : options.units
+      },
+      short: {
+        ..._DurationParser.shortUnits,
+        ...options == null ? void 0 : options.short
+      }
+    });
+  }
+  static get units() {
+    return DURATION_UNITS;
+  }
+  static get shortUnits() {
+    return DURATION_SHORT_UNITS;
+  }
+};
 
 // src/oop/Semaphore.ts
 var SemaphorePermit = class {
@@ -1565,6 +1609,11 @@ var TimeoutError = class extends Error {
   }
 };
 
+// src/random/absoluteJitter.ts
+function absoluteJitter(base, offset) {
+  return base + offset * (2 * Math.random() - 1);
+}
+
 // src/random/draw.ts
 function draw(array) {
   const max2 = array.length;
@@ -1575,6 +1624,11 @@ function draw(array) {
   return array[index];
 }
 
+// src/random/proportionalJitter.ts
+function proportionalJitter(base, factor) {
+  return base * (1 - factor * (2 * Math.random() - 1));
+}
+
 // src/random/random.ts
 function random(min2, max2) {
   return Math.floor(Math.random() * (max2 - min2 + 1) + min2);
@@ -1971,6 +2025,19 @@ function isMap(value) {
   return isTagged(value, "[object Map]");
 }
 
+// src/typed/isMapEqual.ts
+function isMapEqual(x, y) {
+  if (x.size !== y.size) {
+    return false;
+  }
+  for (const [key, value] of x) {
+    if (!isEqual(value, y.get(key))) {
+      return false;
+    }
+  }
+  return true;
+}
+
 // src/typed/isNullish.ts
 function isNullish(value) {
   return value === null || value === void 0;
@@ -2035,6 +2102,19 @@ function isSet(value) {
   return isTagged(value, "[object Set]");
 }
 
+// src/typed/isSetEqual.ts
+function isSetEqual(x, y) {
+  if (x.size !== y.size) {
+    return false;
+  }
+  for (const item of x) {
+    if (!y.has(item)) {
+      return false;
+    }
+  }
+  return true;
+}
+
 // src/typed/isString.ts
 function isString(value) {
   return typeof value === "string";
@@ -2065,4 +2145,4 @@ function isWeakSet(value) {
   return isTagged(value, "[object WeakSet]");
 }
 
-export { AggregateErrorOrPolyfill as AggregateError, DefaultCloningStrategy, DurationParser, FastCloningStrategy, QuantityParser, Semaphore, SemaphorePermit, TimeoutError, all, alphabetical, always, assert, assign, boil, callable, camel, capitalize, cartesianProduct, castArray, castArrayIfExists, castComparator, castMapping, chain, clamp, clone, cloneDeep, cluster, compose, concat, construct, counting, crush, dash, debounce, dedent, defer, diff, draw, escapeHTML, filterKey, first, flat, flip, fork, get, group, guard, inRange, intersects, invert, isArray, isAsyncIterable, isBigInt, isBoolean, isClass, isDangerousKey, isDate, isEmpty, isEqual, isError, isFloat, isFunction, isInt, isIntString, isIterable, isMap, isNullish, isNumber, isObject, isPlainObject, isPrimitive, isPromise, isRegExp, isResult, isResultErr, isResultOk, isSet, isString, isSymbol, isTagged, isUndefined, isWeakMap, isWeakSet, iterate, keys, last, lerp, list, listify, lowerize, map, mapEntries, mapKeys, mapValues, mapify, max, memo, memoLastCall, merge, min, noop, objectify, omit, once, parallel, parseDuration, parseQuantity, partial, partob, pascal, pick, pluck, promiseChain, proxied, queueByKey, random, range, reduce, remove, replace, replaceOrAppend, retry, round, select, selectFirst, series, set, shake, shift, shuffle, sift, similarity, sleep, snake, sort, sum, template, throttle, timeout, title, toFloat, toInt, toResult, toggle, traverse, trim, tryit as try, tryit, uid, unique, unzip, upperize, withResolvers, zip, zipToObject };
+export { AggregateErrorOrPolyfill as AggregateError, DefaultCloningStrategy, DurationParser, FastCloningStrategy, QuantityParser, Semaphore, SemaphorePermit, TimeoutError, absoluteJitter, all, alphabetical, always, assert, assign, boil, callable, camel, capitalize, cartesianProduct, castArray, castArrayIfExists, castComparator, castMapping, chain, clamp, clone, cloneDeep, cluster, compose, concat, construct, counting, crush, dash, debounce, dedent, defer, diff, draw, escapeHTML, filterKey, first, flat, flip, fork, get, getOrInsert, getOrInsertComputed, group, guard, identity, inRange, intersects, invert, isArray, isArrayEqual, isAsyncIterable, isBigInt, isBoolean, isClass, isDangerousKey, isDate, isEmpty, isEqual, isError, isFloat, isFunction, isInt, isIntString, isIterable, isMap, isMapEqual, isNullish, isNumber, isObject, isPlainObject, isPrimitive, isPromise, isRegExp, isResult, isResultErr, isResultOk, isSet, isSetEqual, isString, isSymbol, isTagged, isUndefined, isWeakMap, isWeakSet, iterate, keys, last, lerp, list, listify, lowerize, map, mapEntries, mapKeys, mapValues, mapify, max, memo, memoLastCall, merge, min, noop, objectify, omit, once, parallel, parseDuration, parseQuantity, partial, partob, pascal, pick, pluck, promiseChain, proportionalJitter, proxied, queueByKey, random, range, reduce, remove, replace, replaceOrAppend, retry, round, select, selectFirst, series, set, shake, shift, shuffle, sift, similarity, sleep, snake, sort, sum, template, throttle, timeout, title, toFloat, toInt, toResult, toggle, traverse, trim, tryit as try, tryit, uid, unique, unzip, upperize, withResolvers, zip, zipToObject };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "radashi",
-  "version": "12.6.2",
+  "version": "12.7.1",
   "type": "module",
   "description": "The modern, community-first TypeScript toolkit with all of the fast, readable, and minimal utility functions you need. Type-safe, dependency-free, tree-shakeable, fully tested.",
   "repository": {
@@ -42,6 +42,7 @@
     "test": "vitest run --coverage",
     "test-branch": "node scripts/run test-branch",
     "test-single": "node scripts/run test-single",
+    "tree-shake-check": "node scripts/run tree-shake",
     "update-browserslist": "node scripts/run update-browserslist"
   },
   "devDependencies": {