@catbee/utils 0.0.6 → 0.0.8-next.0

package/build/src/utils/array.utils.js

@@ -1,364 +0,0 @@
-"use strict";
-/*
- * The MIT License
- *
- * Copyright (c) 2025 Catbee Technologies
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.chunk = chunk;
-exports.unique = unique;
-exports.flattenDeep = flattenDeep;
-exports.random = random;
-exports.groupBy = groupBy;
-exports.shuffle = shuffle;
-exports.pluck = pluck;
-exports.difference = difference;
-exports.intersect = intersect;
-exports.mergeSort = mergeSort;
-exports.zip = zip;
-exports.partition = partition;
-exports.range = range;
-exports.take = take;
-exports.takeWhile = takeWhile;
-exports.compact = compact;
-exports.countBy = countBy;
-const obj_utils_1 = require("./obj.utils");
-/**
- * Splits an array into chunks of the specified size.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The array to split into chunks.
- * @param {number} size - The number of elements per chunk.
- * @returns {T[][]} A new array containing chunked arrays.
- * @throws {TypeError} If array is not an array.
- * @throws {Error} If chunk size is not a positive integer.
- */
-function chunk(array, size) {
-    if (!Array.isArray(array))
-        throw new TypeError('Expected an array');
-    if (!array.length)
-        return [];
-    if (!Number.isInteger(size) || size <= 0)
-        throw new Error('Chunk size must be a positive integer');
-    return Array.from({ length: Math.ceil(array.length / size) }, (_, i) => array.slice(i * size, i * size + size));
-}
-/**
- * Removes duplicate values from an array.
- * Optionally enforces uniqueness by a key function.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @param {(item: T) => unknown} [keyFn] - Optional function to determine uniqueness by key.
- * @returns {T[]} A new array with unique values.
- */
-function unique(array, keyFn) {
-    if (!Array.isArray(array) || array.length === 0)
-        return [];
-    if (!keyFn)
-        return Array.from(new Set(array));
-    const seen = new Set();
-    return array.filter(item => {
-        const key = keyFn(item);
-        if (seen.has(key))
-            return false;
-        seen.add(key);
-        return true;
-    });
-}
-/**
- * Deeply flattens a nested array to a single-level array.
- *
- * @template T The leaf type of array elements.
- * @param {any[]} array - The (possibly deeply nested) input array.
- * @returns {T[]} A deeply flattened array.
- */
-function flattenDeep(array) {
-    if (!Array.isArray(array))
-        return [];
-    return array.reduce((acc, val) => {
-        if (Array.isArray(val)) {
-            acc.push(...flattenDeep(val));
-        }
-        else {
-            acc.push(val);
-        }
-        return acc;
-    }, []);
-}
-/**
- * Returns a random element from an array, or undefined if empty.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @returns {T | undefined} A randomly selected item, or undefined if array is empty or not an array.
- */
-function random(array) {
-    if (!Array.isArray(array) || array.length === 0)
-        return undefined;
-    return array[Math.floor(Math.random() * array.length)];
-}
-function groupBy(array, keyOrFn) {
-    if (!Array.isArray(array) || array.length === 0)
-        return {};
-    const keyFn = typeof keyOrFn === 'function' ? keyOrFn : (item) => item[keyOrFn];
-    return array.reduce((acc, item) => {
-        const key = keyFn(item);
-        if (!acc[key])
-            acc[key] = [];
-        acc[key].push(item);
-        return acc;
-    }, {});
-}
-/* eslint-enable no-redeclare */
-/**
- * Shuffles an array using the Fisher-Yates algorithm.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @returns {T[]} A new shuffled array.
- * @throws {TypeError} If array is not an array.
- */
-function shuffle(array) {
-    if (!Array.isArray(array))
-        throw new TypeError('Expected an array');
-    const copy = array.slice();
-    for (let i = copy.length - 1; i > 0; i--) {
-        const j = Math.floor(Math.random() * (i + 1));
-        [copy[i], copy[j]] = [copy[j], copy[i]];
-    }
-    return copy;
-}
-/**
- * Returns an array of property values from an array of objects.
- *
- * @template T The type of array elements.
- * @template K The object property to pluck.
- * @param {T[]} array - The input array.
- * @param {K} key - The property name to pluck.
- * @returns {T[K][]} Array of property values.
- */
-function pluck(array, key) {
-    if (!Array.isArray(array))
-        return [];
-    return array.map(item => item[key]);
-}
-/**
- * Returns values in array A that are not in array B.
- *
- * @template T The type of array elements.
- * @param {T[]} a - First array.
- * @param {T[]} b - Second array.
- * @returns {T[]} Elements in A that are not in B.
- */
-function difference(a, b) {
-    if (!Array.isArray(a) || !Array.isArray(b))
-        return [];
-    const setB = new Set(b);
-    return a.filter(item => !setB.has(item));
-}
-/**
- * Returns common values between arrays A and B.
- *
- * @template T The type of array elements.
- * @param {T[]} a - First array.
- * @param {T[]} b - Second array.
- * @returns {T[]} Elements that exist in both arrays.
- */
-function intersect(a, b) {
-    if (!Array.isArray(a) || !Array.isArray(b))
-        return [];
-    const setB = new Set(b);
-    return a.filter(item => setB.has(item));
-}
-/**
- * Sorts an array of objects by a nested key using Merge Sort (O(n log n)).
- * Missing/undefined keys are sorted to the "end" (asc) or "start" (desc).
- *
- * @template T The type of array elements (objects).
- * @param {T[]} array - Array of objects to sort.
- * @param {string | ((item: T) => any)} key - Dot-notated key (e.g., "profile.age") or function.
- * @param {"asc" | "desc"} [direction="asc"] - Sort direction: 'asc' or 'desc'.
- * @returns {T[]} A new sorted array.
- * @throws {TypeError} If array is not an array.
- */
-function mergeSort(array, key, direction = 'asc') {
-    if (!Array.isArray(array))
-        throw new TypeError('Expected array');
-    if (array.length <= 1)
-        return array.slice();
-    const keyFn = typeof key === 'function' ? key : (item) => (0, obj_utils_1.getValueByPath)(item, key);
-    const compare = (a, b) => {
-        const aVal = keyFn(a);
-        const bVal = keyFn(b);
-        // Sorts undefined/null last for "asc", first for "desc"
-        if (aVal === bVal)
-            return 0;
-        if (aVal == null)
-            return direction === 'asc' ? 1 : -1;
-        if (bVal == null)
-            return direction === 'asc' ? -1 : 1;
-        return direction === 'asc' ? (aVal < bVal ? -1 : 1) : aVal > bVal ? -1 : 1;
-    };
-    const merge = (left, right) => {
-        const result = [];
-        let i = 0, j = 0;
-        while (i < left.length && j < right.length) {
-            if (compare(left[i], right[j]) <= 0)
-                result.push(left[i++]);
-            else
-                result.push(right[j++]);
-        }
-        return result.concat(left.slice(i)).concat(right.slice(j));
-    };
-    const sort = (arr) => {
-        if (arr.length <= 1)
-            return arr;
-        const mid = Math.floor(arr.length / 2);
-        const left = sort(arr.slice(0, mid));
-        const right = sort(arr.slice(mid));
-        return merge(left, right);
-    };
-    return sort(array);
-}
-/**
- * Combines multiple arrays into a single array of grouped elements.
- * Output array length equals the length of the shortest input array.
- *
- * @example zip([1, 2], ['a', 'b']) => [[1, 'a'], [2, 'b']]
- * @param {...Array<T>[]} arrays - Two or more arrays to zip together.
- * @returns {Array<T[]>} Array of grouped elements.
- */
-function zip(...arrays) {
-    if (arrays.length === 0)
-        return [];
-    if (arrays.some(arr => !Array.isArray(arr))) {
-        throw new TypeError('All arguments must be arrays');
-    }
-    const minLength = Math.min(...arrays.map(arr => arr.length));
-    const result = [];
-    for (let i = 0; i < minLength; i++) {
-        result.push(arrays.map(arr => arr[i]));
-    }
-    return result;
-}
-/**
- * Splits an array into two arrays based on a predicate function.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @param {(item: T, index: number, array: T[]) => boolean} predicate - Function to test each element.
- * @returns {[T[], T[]]} A tuple of two arrays: [matched, unmatched].
- */
-function partition(array, predicate) {
-    if (!Array.isArray(array))
-        return [[], []];
-    return array.reduce(([pass, fail], item, index) => {
-        return predicate(item, index, array) ? [[...pass, item], fail] : [pass, [...fail, item]];
-    }, [[], []]);
-}
-/**
- * Generates an array of numbers within a specified range.
- *
- * @param {number} start - Start of range (inclusive).
- * @param {number} end - End of range (exclusive).
- * @param {number} [step=1] - Step between numbers.
- * @returns {number[]} Array of numbers in range.
- */
-function range(start, end, step = 1) {
-    if (!Number.isFinite(start) || !Number.isFinite(end) || !Number.isFinite(step)) {
-        throw new TypeError('Arguments must be finite numbers');
-    }
-    if (step === 0)
-        throw new Error('Step cannot be zero');
-    const isAscending = step > 0;
-    if ((isAscending && start >= end) || (!isAscending && start <= end)) {
-        return [];
-    }
-    const length = Math.max(Math.ceil((end - start) / step), 0);
-    const result = new Array(length);
-    for (let i = 0, value = start; i < length; i++, value += step) {
-        result[i] = value;
-    }
-    return result;
-}
-/**
- * Returns the first n elements of an array.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @param {number} [n=1] - Number of elements to take.
- * @returns {T[]} New array with first n elements.
- */
-function take(array, n = 1) {
-    if (!Array.isArray(array) || n <= 0)
-        return [];
-    return array.slice(0, n);
-}
-/**
- * Takes elements from the array while predicate returns true.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @param {(item: T, index: number) => boolean} predicate - Function to test each element.
- * @returns {T[]} New array with taken elements.
- */
-function takeWhile(array, predicate) {
-    if (!Array.isArray(array))
-        return [];
-    const result = [];
-    for (let i = 0; i < array.length; i++) {
-        if (!predicate(array[i], i))
-            break;
-        result.push(array[i]);
-    }
-    return result;
-}
-/**
- * Removes all falsy values from an array.
- * False, null, 0, "", undefined, and NaN are falsy.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @returns {NonNullable<T>[]} New array with falsy values removed.
- */
-function compact(array) {
-    if (!Array.isArray(array))
-        return [];
-    return array.filter(Boolean);
-}
-/**
- * Counts array elements by a key function.
- *
- * @template T The type of array elements.
- * @param {T[]} array - The input array.
- * @param {(item: T) => string | number | symbol} keyFn - Function to generate count key.
- * @returns {Record<string, number>} Object with counts by key.
- */
-function countBy(array, keyFn) {
-    if (!Array.isArray(array))
-        return {};
-    return array.reduce((acc, item) => {
-        const key = String(keyFn(item));
-        acc[key] = (acc[key] || 0) + 1;
-        return acc;
-    }, {});
-}
-//# sourceMappingURL=array.utils.js.map

package/build/src/utils/array.utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.utils.js","sourceRoot":"","sources":["../../../src/utils/array.utils.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;AAcH,sBAKC;AAWD,wBAUC;AASD,kCAUC;AASD,wBAGC;AAqBD,0BAeC;AAWD,0BAQC;AAWD,sBAGC;AAUD,gCAIC;AAUD,8BAIC;AAaD,8BAmCC;AAUD,kBAcC;AAUD,8BASC;AAUD,sBAmBC;AAUD,oBAGC;AAUD,8BAUC;AAUD,0BAGC;AAUD,0BAWC;AAjWD,2CAA6C;AAE7C;;;;;;;;;GASG;AACH,SAAgB,KAAK,CAAI,KAAU,EAAE,IAAY;IAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC;IACpE,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACnG,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;AAClH,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,MAAM,CAAI,KAAU,EAAE,KAA4B;IAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3D,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW,CAAC;IAChC,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CAAI,KAAY;IACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,OAAO,KAAK,CAAC,MAAM,CAAM,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QACpC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,GAAG,WAAW,CAAI,GAAG,CAAC,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,EAAE,EAAE,CAAC,CAAC;AACT,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,MAAM,CAAI,KAAU;IAClC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAClE,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACzD,CAAC;AAqBD,SAAgB,OAAO,CACrB,KAAU,EACV,OAA0D;IAE1D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3D,MAAM,KAAK,GAAG,OAAO,OAAO,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAO,EAAE,EAAE,CAAC,IAAI,CAAC,OAAkB,CAAC,CAAC;IAC9F,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QACZ,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAA6B,CAAC;QACpD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,GAAG,CAAC;IACb,CAAC,EACD,EAA2C,CAC5C,CAAC;AACJ,CAAC;AACD,gCAAgC;AAEhC;;;;;;;GAOG;AACH,SAAgB,OAAO,CAAI,KAAU;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC;IACpE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,KAAK,CAAuB,KAAU,EAAE,GAAM;IAC5D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,UAAU,CAAI,CAAM,EAAE,CAAM;IAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,SAAS,CAAI,CAAM,EAAE,CAAM;IACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,SAAS,CAAI,KAAU,EAAE,GAAgC,EAAE,YAA4B,KAAK;IAC1G,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,gBAAgB,CAAC,CAAC;IACjE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IAE5C,MAAM,KAAK,GAAG,OAAO,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAO,EAAE,EAAE,CAAC,IAAA,0BAAc,EAAC,IAAc,EAAE,GAAG,CAAC,CAAC;IAEjG,MAAM,OAAO,GAAG,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,wDAAwD;QACxD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAC5B,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,CAAC,IAAS,EAAE,KAAU,EAAO,EAAE;QAC3C,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,EACP,CAAC,GAAG,CAAC,CAAC;QACR,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC3C,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;;gBACvD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,GAAQ,EAAO,EAAE;QAC7B,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC,CAAC;IACF,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,GAAG,CAAI,GAAG,MAAa;IACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,SAAS,CAAC,8BAA8B,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,SAAS,CAAI,KAAU,EAAE,SAA0D;IACjG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAE3C,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5B,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC3F,CAAC,EACD,CAAC,EAAS,EAAE,EAAS,CAAC,CACvB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,OAAe,CAAC;IAChE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/E,MAAM,IAAI,SAAS,CAAC,kCAAkC,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,IAAI,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAEvD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC;IAC7B,IAAI,CAAC,WAAW,IAAI,KAAK,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,WAAW,IAAI,KAAK,IAAI,GAAG,CAAC,EAAE,CAAC;QACpE,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;QAC9D,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,IAAI,CAAI,KAAU,EAAE,IAAY,CAAC;IAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/C,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,SAAS,CAAI,KAAU,EAAE,SAA8C;IACrF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,MAAM;QACnC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,OAAO,CAAI,KAAU;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,OAAO,KAAK,CAAC,MAAM,CAAC,OAAO,CAAqB,CAAC;AACnD,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,OAAO,CAAI,KAAU,EAAE,KAA4C;IACjF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QACZ,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAChC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,OAAO,GAAG,CAAC;IACb,CAAC,EACD,EAA4B,CAC7B,CAAC;AACJ,CAAC","sourcesContent":["/*\n * The MIT License\n *\n * Copyright (c) 2025 Catbee Technologies\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { getValueByPath } from './obj.utils';\n\n/**\n * Splits an array into chunks of the specified size.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The array to split into chunks.\n * @param {number} size - The number of elements per chunk.\n * @returns {T[][]} A new array containing chunked arrays.\n * @throws {TypeError} If array is not an array.\n * @throws {Error} If chunk size is not a positive integer.\n */\nexport function chunk<T>(array: T[], size: number): T[][] {\n  if (!Array.isArray(array)) throw new TypeError('Expected an array');\n  if (!array.length) return [];\n  if (!Number.isInteger(size) || size <= 0) throw new Error('Chunk size must be a positive integer');\n  return Array.from({ length: Math.ceil(array.length / size) }, (_, i) => array.slice(i * size, i * size + size));\n}\n\n/**\n * Removes duplicate values from an array.\n * Optionally enforces uniqueness by a key function.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @param {(item: T) => unknown} [keyFn] - Optional function to determine uniqueness by key.\n * @returns {T[]} A new array with unique values.\n */\nexport function unique<T>(array: T[], keyFn?: (item: T) => unknown): T[] {\n  if (!Array.isArray(array) || array.length === 0) return [];\n  if (!keyFn) return Array.from(new Set(array));\n  const seen = new Set<unknown>();\n  return array.filter(item => {\n    const key = keyFn(item);\n    if (seen.has(key)) return false;\n    seen.add(key);\n    return true;\n  });\n}\n\n/**\n * Deeply flattens a nested array to a single-level array.\n *\n * @template T The leaf type of array elements.\n * @param {any[]} array - The (possibly deeply nested) input array.\n * @returns {T[]} A deeply flattened array.\n */\nexport function flattenDeep<T>(array: any[]): T[] {\n  if (!Array.isArray(array)) return [];\n  return array.reduce<T[]>((acc, val) => {\n    if (Array.isArray(val)) {\n      acc.push(...flattenDeep<T>(val));\n    } else {\n      acc.push(val);\n    }\n    return acc;\n  }, []);\n}\n\n/**\n * Returns a random element from an array, or undefined if empty.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @returns {T | undefined} A randomly selected item, or undefined if array is empty or not an array.\n */\nexport function random<T>(array: T[]): T | undefined {\n  if (!Array.isArray(array) || array.length === 0) return undefined;\n  return array[Math.floor(Math.random() * array.length)];\n}\n\n/* eslint-disable no-redeclare */\n/**\n * Groups items in an array by a key or key function.\n *\n * @template T The type of array elements.\n * @overload\n * @param {T[]} array - The array to group.\n * @param {keyof T} key - Property key to group by.\n * @returns {Record<string, T[]>}\n * @overload\n * @param {T[]} array - The array to group.\n * @param {(item: T) => string | number | symbol} keyFn - Function to generate group key from item.\n * @returns {Record<K, T[]>}\n * @param {T[]} array - The array to group.\n * @param {keyof T | ((item: T) => string | number | symbol)} keyOrFn - Property key or key-generating function.\n * @returns {Record<string | number | symbol, T[]>} An object mapping group keys to item arrays.\n */\nexport function groupBy<T>(array: T[], key: keyof T): Record<string, T[]>;\nexport function groupBy<T, K extends string | number | symbol>(array: T[], keyFn: (item: T) => K): Record<K, T[]>;\nexport function groupBy<T>(\n  array: T[],\n  keyOrFn: keyof T | ((item: T) => string | number | symbol)\n): Record<string | number | symbol, T[]> {\n  if (!Array.isArray(array) || array.length === 0) return {};\n  const keyFn = typeof keyOrFn === 'function' ? keyOrFn : (item: T) => item[keyOrFn as keyof T];\n  return array.reduce(\n    (acc, item) => {\n      const key = keyFn(item) as string | number | symbol;\n      if (!acc[key]) acc[key] = [];\n      acc[key].push(item);\n      return acc;\n    },\n    {} as Record<string | number | symbol, T[]>\n  );\n}\n/* eslint-enable no-redeclare */\n\n/**\n * Shuffles an array using the Fisher-Yates algorithm.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @returns {T[]} A new shuffled array.\n * @throws {TypeError} If array is not an array.\n */\nexport function shuffle<T>(array: T[]): T[] {\n  if (!Array.isArray(array)) throw new TypeError('Expected an array');\n  const copy = array.slice();\n  for (let i = copy.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1));\n    [copy[i], copy[j]] = [copy[j], copy[i]];\n  }\n  return copy;\n}\n\n/**\n * Returns an array of property values from an array of objects.\n *\n * @template T The type of array elements.\n * @template K The object property to pluck.\n * @param {T[]} array - The input array.\n * @param {K} key - The property name to pluck.\n * @returns {T[K][]} Array of property values.\n */\nexport function pluck<T, K extends keyof T>(array: T[], key: K): T[K][] {\n  if (!Array.isArray(array)) return [];\n  return array.map(item => item[key]);\n}\n\n/**\n * Returns values in array A that are not in array B.\n *\n * @template T The type of array elements.\n * @param {T[]} a - First array.\n * @param {T[]} b - Second array.\n * @returns {T[]} Elements in A that are not in B.\n */\nexport function difference<T>(a: T[], b: T[]): T[] {\n  if (!Array.isArray(a) || !Array.isArray(b)) return [];\n  const setB = new Set(b);\n  return a.filter(item => !setB.has(item));\n}\n\n/**\n * Returns common values between arrays A and B.\n *\n * @template T The type of array elements.\n * @param {T[]} a - First array.\n * @param {T[]} b - Second array.\n * @returns {T[]} Elements that exist in both arrays.\n */\nexport function intersect<T>(a: T[], b: T[]): T[] {\n  if (!Array.isArray(a) || !Array.isArray(b)) return [];\n  const setB = new Set(b);\n  return a.filter(item => setB.has(item));\n}\n\n/**\n * Sorts an array of objects by a nested key using Merge Sort (O(n log n)).\n * Missing/undefined keys are sorted to the \"end\" (asc) or \"start\" (desc).\n *\n * @template T The type of array elements (objects).\n * @param {T[]} array - Array of objects to sort.\n * @param {string | ((item: T) => any)} key - Dot-notated key (e.g., \"profile.age\") or function.\n * @param {\"asc\" | \"desc\"} [direction=\"asc\"] - Sort direction: 'asc' or 'desc'.\n * @returns {T[]} A new sorted array.\n * @throws {TypeError} If array is not an array.\n */\nexport function mergeSort<T>(array: T[], key: string | ((item: T) => any), direction: 'asc' | 'desc' = 'asc'): T[] {\n  if (!Array.isArray(array)) throw new TypeError('Expected array');\n  if (array.length <= 1) return array.slice();\n\n  const keyFn = typeof key === 'function' ? key : (item: T) => getValueByPath(item as object, key);\n\n  const compare = (a: T, b: T) => {\n    const aVal = keyFn(a);\n    const bVal = keyFn(b);\n    // Sorts undefined/null last for \"asc\", first for \"desc\"\n    if (aVal === bVal) return 0;\n    if (aVal == null) return direction === 'asc' ? 1 : -1;\n    if (bVal == null) return direction === 'asc' ? -1 : 1;\n    return direction === 'asc' ? (aVal < bVal ? -1 : 1) : aVal > bVal ? -1 : 1;\n  };\n\n  const merge = (left: T[], right: T[]): T[] => {\n    const result: T[] = [];\n    let i = 0,\n      j = 0;\n    while (i < left.length && j < right.length) {\n      if (compare(left[i], right[j]) <= 0) result.push(left[i++]);\n      else result.push(right[j++]);\n    }\n    return result.concat(left.slice(i)).concat(right.slice(j));\n  };\n\n  const sort = (arr: T[]): T[] => {\n    if (arr.length <= 1) return arr;\n    const mid = Math.floor(arr.length / 2);\n    const left = sort(arr.slice(0, mid));\n    const right = sort(arr.slice(mid));\n    return merge(left, right);\n  };\n  return sort(array);\n}\n\n/**\n * Combines multiple arrays into a single array of grouped elements.\n * Output array length equals the length of the shortest input array.\n *\n * @example zip([1, 2], ['a', 'b']) => [[1, 'a'], [2, 'b']]\n * @param {...Array<T>[]} arrays - Two or more arrays to zip together.\n * @returns {Array<T[]>} Array of grouped elements.\n */\nexport function zip<T>(...arrays: T[][]): T[][] {\n  if (arrays.length === 0) return [];\n  if (arrays.some(arr => !Array.isArray(arr))) {\n    throw new TypeError('All arguments must be arrays');\n  }\n\n  const minLength = Math.min(...arrays.map(arr => arr.length));\n  const result: T[][] = [];\n\n  for (let i = 0; i < minLength; i++) {\n    result.push(arrays.map(arr => arr[i]));\n  }\n\n  return result;\n}\n\n/**\n * Splits an array into two arrays based on a predicate function.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @param {(item: T, index: number, array: T[]) => boolean} predicate - Function to test each element.\n * @returns {[T[], T[]]} A tuple of two arrays: [matched, unmatched].\n */\nexport function partition<T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean): [T[], T[]] {\n  if (!Array.isArray(array)) return [[], []];\n\n  return array.reduce(\n    ([pass, fail], item, index) => {\n      return predicate(item, index, array) ? [[...pass, item], fail] : [pass, [...fail, item]];\n    },\n    [[] as T[], [] as T[]]\n  );\n}\n\n/**\n * Generates an array of numbers within a specified range.\n *\n * @param {number} start - Start of range (inclusive).\n * @param {number} end - End of range (exclusive).\n * @param {number} [step=1] - Step between numbers.\n * @returns {number[]} Array of numbers in range.\n */\nexport function range(start: number, end: number, step: number = 1): number[] {\n  if (!Number.isFinite(start) || !Number.isFinite(end) || !Number.isFinite(step)) {\n    throw new TypeError('Arguments must be finite numbers');\n  }\n  if (step === 0) throw new Error('Step cannot be zero');\n\n  const isAscending = step > 0;\n  if ((isAscending && start >= end) || (!isAscending && start <= end)) {\n    return [];\n  }\n\n  const length = Math.max(Math.ceil((end - start) / step), 0);\n  const result = new Array(length);\n\n  for (let i = 0, value = start; i < length; i++, value += step) {\n    result[i] = value;\n  }\n\n  return result;\n}\n\n/**\n * Returns the first n elements of an array.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @param {number} [n=1] - Number of elements to take.\n * @returns {T[]} New array with first n elements.\n */\nexport function take<T>(array: T[], n: number = 1): T[] {\n  if (!Array.isArray(array) || n <= 0) return [];\n  return array.slice(0, n);\n}\n\n/**\n * Takes elements from the array while predicate returns true.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @param {(item: T, index: number) => boolean} predicate - Function to test each element.\n * @returns {T[]} New array with taken elements.\n */\nexport function takeWhile<T>(array: T[], predicate: (item: T, index: number) => boolean): T[] {\n  if (!Array.isArray(array)) return [];\n\n  const result: T[] = [];\n  for (let i = 0; i < array.length; i++) {\n    if (!predicate(array[i], i)) break;\n    result.push(array[i]);\n  }\n\n  return result;\n}\n\n/**\n * Removes all falsy values from an array.\n * False, null, 0, \"\", undefined, and NaN are falsy.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @returns {NonNullable<T>[]} New array with falsy values removed.\n */\nexport function compact<T>(array: T[]): NonNullable<T>[] {\n  if (!Array.isArray(array)) return [];\n  return array.filter(Boolean) as NonNullable<T>[];\n}\n\n/**\n * Counts array elements by a key function.\n *\n * @template T The type of array elements.\n * @param {T[]} array - The input array.\n * @param {(item: T) => string | number | symbol} keyFn - Function to generate count key.\n * @returns {Record<string, number>} Object with counts by key.\n */\nexport function countBy<T>(array: T[], keyFn: (item: T) => string | number | symbol): Record<string, number> {\n  if (!Array.isArray(array)) return {};\n\n  return array.reduce(\n    (acc, item) => {\n      const key = String(keyFn(item));\n      acc[key] = (acc[key] || 0) + 1;\n      return acc;\n    },\n    {} as Record<string, number>\n  );\n}\n"]}

package/build/src/utils/async.utils.d.ts

@@ -1,174 +0,0 @@
-/**
- * Delays execution for a specified number of milliseconds.
- *
- * @param {number} ms - The number of milliseconds to sleep.
- * @returns {Promise<void>} A Promise that resolves after the given time.
- */
-export declare function sleep(ms: number): Promise<void>;
-/**
- * Creates a debounced version of a function that delays its execution.
- * Provides `.cancel()` and `.flush()` methods.
- *
- * @template T
- * @param {T} fn - The function to debounce.
- * @param {number} delay - Delay in milliseconds.
- * @returns {T & { cancel: () => void; flush: () => void }} A debounced function.
- */
-export declare function debounce<T extends (...args: any[]) => void>(fn: T, delay: number): {
-    (...args: Parameters<T>): void;
-    cancel(): void;
-    flush(): void;
-} & {
-    cancel: () => void;
-    flush: () => void;
-};
-/**
- * Creates a throttled version of a function that limits its execution rate.
- * Allows control over leading/trailing invocation.
- *
- * @template T
- * @param {T} fn - The function to throttle.
- * @param {number} limit - Minimum time between calls in milliseconds.
- * @param {{ leading?: boolean, trailing?: boolean }} [opts] - Options for leading/trailing edge throttling.
- * @returns {(...args: Parameters<T>) => void} A throttled function.
- */
-export declare function throttle<T extends (...args: any[]) => void>(fn: T, limit: number, opts?: {
-    leading?: boolean;
-    trailing?: boolean;
-}): (...args: Parameters<T>) => void;
-/**
- * Retries an asynchronous function a given number of times with optional delay/backoff.
- *
- * @template T
- * @param {() => Promise<T>} fn - The async function to retry.
- * @param {number} [retries=3] - Number of retry attempts.
- * @param {number} [delay=500] - Delay in milliseconds between retries.
- * @param {boolean} [backoff=false] - Use exponential backoff between attempts.
- * @param {(error: unknown, attempt: number) => void} [onRetry] - Callback for each retry attempt.
- * @returns {Promise<T>} The result of the async function if successful.
- * @throws {*} The last encountered error if all retries fail.
- */
-export declare function retry<T>(fn: () => Promise<T>, retries?: number, delay?: number, backoff?: boolean, onRetry?: (error: unknown, attempt: number) => void): Promise<T>;
-/**
- * Wraps a promise and rejects it if it doesn't resolve within the specified timeout.
- *
- * @template T
- * @param {Promise<T>} promise - The original promise.
- * @param {number} ms - Timeout in milliseconds.
- * @param {string} [message="Operation timed out"] - Optional timeout message.
- * @returns {Promise<T>} A promise that resolves or rejects within the timeout.
- */
-export declare function withTimeout<T>(promise: Promise<T>, ms: number, message?: string): Promise<T>;
-/**
- * Executes async tasks in true batches.
- * Each batch runs in parallel, but batches run sequentially.
- * All tasks in a batch start at the same time, next batch waits for full completion.
- * NOTE: For more granular concurrency, use a "queue" or "pooled" approach.
- *
- * @template T
- * @param {Array<() => Promise<T>>} tasks - An array of functions that return Promises.
- * @param {number} limit - Number of tasks to run in parallel per batch.
- * @returns {Promise<T[]>} A promise that resolves to an array of resolved values.
- */
-export declare function runInBatches<T>(tasks: (() => Promise<T>)[], limit: number): Promise<T[]>;
-/**
- * Wraps a function and ensures it is only called once at a time.
- * Calls made while one is in progress will wait for the same Promise.
- * Optionally, new calls can be dropped while in progress (drop=true).
- *
- * @template TArgs
- * @template TResult
- * @param {(...args: TArgs) => Promise<TResult>} fn - The async function to wrap.
- * @param {boolean} [drop=false] - If true, new calls while one is pending are rejected.
- * @returns {(...args: TArgs) => Promise<TResult>} A wrapped function with singleton behavior.
- */
-export declare function singletonAsync<TArgs extends unknown[], TResult>(fn: (...args: TArgs) => Promise<TResult>, drop?: boolean): (...args: TArgs) => Promise<TResult>;
-/**
- * Resolves a list of async tasks in parallel, returning both resolved and rejected results.
- *
- * @template T
- * @param {Array<() => Promise<T>>} tasks - Array of promise-returning functions.
- * @returns {Promise<PromiseSettledResult<T>[]>} Results including status and value/reason.
- */
-export declare function settleAll<T>(tasks: (() => Promise<T>)[]): Promise<PromiseSettledResult<T>[]>;
-export interface TaskQueue {
-    <T>(taskFn: () => Promise<T>): Promise<T>;
-    pause: () => void;
-    resume: () => void;
-    readonly length: number;
-    readonly isPaused: boolean;
-}
-/**
- * A simple task queue that executes async tasks with a concurrency limit.
- * Exposes pause, resume, and queue length getters.
- *
- * @param {number} limit - Maximum number of concurrent tasks.
- * @returns {function & { pause: () => void, resume: () => void, length: number, isPaused: boolean }}
- *   Enqueue function plus queue controls.
- */
-export declare function createTaskQueue(limit: number): TaskQueue;
-/**
- * Executes async functions sequentially and collects results.
- * Useful when order matters or tasks depend on each other.
- *
- * @template T
- * @param {Array<() => Promise<T>>} tasks - Array of promise-returning functions.
- * @returns {Promise<T[]>} Array of resolved values.
- */
-export declare function runInSeries<T>(tasks: (() => Promise<T>)[]): Promise<T[]>;
-/**
- * Memoizes an async function, caching results for repeated calls with identical arguments.
- * Optional TTL (time-to-live) for cached entries.
- *
- * @template T Function return type
- * @template Args Function arguments types
- * @param {(...args: Args) => Promise<T>} fn - The async function to memoize
- * @param {object} [options] - Memoization options
- * @param {number} [options.ttl] - Cache TTL in milliseconds (optional)
- * @param {(args: Args) => string} [options.keyFn] - Custom key generator function
- * @returns {(...args: Args) => Promise<T>} Memoized function
- */
-export declare function memoizeAsync<T, Args extends any[]>(fn: (...args: Args) => Promise<T>, options?: {
-    ttl?: number;
-    keyFn?: (args: Args) => string;
-}): (...args: Args) => Promise<T>;
-/**
- * Creates an abortable version of a promise that can be cancelled using an AbortController.
- *
- * @template T
- * @param {Promise<T>} promise - The promise to make abortable
- * @param {AbortSignal} signal - AbortSignal from AbortController
- * @param {any} [abortValue] - Value to use when rejecting on abort
- * @returns {Promise<T>} Promise that rejects if the signal is aborted
- */
-export declare function abortable<T>(promise: Promise<T>, signal: AbortSignal, abortValue?: any): Promise<T>;
-/**
- * Creates a promise with external resolve/reject functions.
- * Useful for creating promises that can be resolved or rejected from outside.
- *
- * @template T
- * @returns {[Promise<T>, (value: T | PromiseLike<T>) => void, (reason?: any) => void]}
- *   Tuple of [promise, resolve, reject]
- */
-export declare function createDeferred<T>(): [Promise<T>, (value: T | PromiseLike<T>) => void, (reason?: any) => void];
-/**
- * Chains a series of async functions, passing the result of each to the next.
- * Similar to function composition but for async functions.
- *
- * @template T
- * @param {Array<(input: any) => Promise<any>>} fns - Array of async functions to compose
- * @returns {(input: any) => Promise<T>} Composed function
- */
-export declare function waterfall<T>(fns: Array<(input: any) => Promise<any>>): (initialValue: any) => Promise<T>;
-/**
- * Creates a rate limiter that ensures functions aren't called more than
- * a specified number of times per interval.
- *
- * @template T
- * @param {(...args: any[]) => Promise<T>} fn - Function to rate limit
- * @param {number} maxCalls - Maximum calls allowed per interval
- * @param {number} interval - Time interval in milliseconds
- * @returns {(...args: any[]) => Promise<T>} Rate limited function
- */
-export declare function rateLimit<T>(fn: (...args: any[]) => Promise<T>, maxCalls: number, interval: number): (...args: any[]) => Promise<T>;
-//# sourceMappingURL=async.utils.d.ts.map