es-toolkit 1.13.1 → 1.14.0-dev.397

package/CHANGELOG.md

@@ -1,5 +1,13 @@
 # es-toolkit Changelog
 
+## Version v1.14.0
+
+Released on August 9th, 2024.
+
+- (`es-toolkit`) Added support for [mapKeys](https://es-toolkit.slash.page/reference/object/mapKeys.html), [mapValues](https://es-toolkit.slash.page/reference/object/mapValues.html), [cloneDeep](https://es-toolkit.slash.page/reference/object/cloneDeep.html), [before](https://es-toolkit.slash.page/reference/function/before.html), [after](https://es-toolkit.slash.page/reference/function/after.html), [isSubset](https://es-toolkit.slash.page/reference/array/isSubset.html), [ary](https://es-toolkit.slash.page/reference/function/ary.html), [unary](https://es-toolkit.slash.page/reference/function/unary.html), [flattenDeep](https://es-toolkit.slash.page/reference/array/flattenDeep.html), [isEqual](https://es-toolkit.slash.page/reference/predicate/isEqual.html), [isFunction](https://es-toolkit.slash.page/reference/predicate/isFunction.html), [isBoolean](https://es-toolkit.slash.page/reference/predicate/isBoolean.html), [isPrimitive](https://es-toolkit.slash.page/reference/predicate/isPrimitive.html), and [isTypedArray](https://es-toolkit.slash.page/reference/predicate/isTypedArray.html).
+- (`es-toolkit/compat`) Added support for [matches](https://es-toolkit.slash.page/reference/compat/predicate/matches.html), [isMatch](https://es-toolkit.slash.page/reference/compat/predicate/isMatch.html), [isArray](https://es-toolkit.slash.page/reference/compat/predicate/isArray.html), [isArrayLike](https://es-toolkit.slash.page/reference/compat/predicate/isArrayLike.html), [isObjectLike](https://es-toolkit.slash.page/reference/compat/predicate/isObjectLike.html), [isArguments](https://es-toolkit.slash.page/reference/compat/predicate/isArguments.html), [size](https://es-toolkit.slash.page/reference/compat/array/size.html), [bind](https://es-toolkit.slash.page/reference/compat/function/bind.html), [flattenDepth](https://es-toolkit.slash.page/reference/array/flatten.html), and [padStart](https://es-toolkit.slash.page/reference/compat/string/padStart.html).
+- Added compatibility tests with lodash for many functions like [initial](https://es-toolkit.slash.page/reference/array/initial.html), [last](https://es-toolkit.slash.page/reference/array/last.html), [takeRight](https://es-toolkit.slash.page/reference/array/takeRight.html), [without](https://es-toolkit.slash.page/reference/array/without.html), [uniq](https://es-toolkit.slash.page/reference/array/uniq.html), [invert](https://es-toolkit.slash.page/reference/object/invert.html), [isNull](https://es-toolkit.slash.page/reference/predicate/isNull.html), [isUndefined](https://es-toolkit.slash.page/reference/predicate/isUndefined.html), and [isNil](https://es-toolkit.slash.page/reference/predicate/isNil.html).
+
 ## Version v1.13.1
 
 Released on July 20th, 2024.
@@ -10,7 +18,7 @@ Released on July 20th, 2024.
 
 Released on July 20th, 2024.
 
-`es-toolkit` can now be used in various CDNs, like [unpkg](https://unpkg.com) and [jsdelivr](https://www.jsdelivr.com). See more in our [installation docs](https://es-toolkit.slash.page/installation.html)
+`es-toolkit` can now be used in various CDNs, like [unpkg](https://unpkg.com) and [jsdelivr](https://www.jsdelivr.com). See more in our [usage docs](https://es-toolkit.slash.page/usage.html)
 
 ### Features
 

package/dist/_chunk/index-CwRt_M.js

@@ -0,0 +1,46 @@
+'use strict';
+
+class AbortError extends Error {
+    constructor(message = 'The operation was aborted') {
+        super(message);
+        this.name = 'AbortError';
+    }
+}
+
+class TimeoutError extends Error {
+    constructor(message = 'The operation was timed out') {
+        super(message);
+        this.name = 'TimeoutError';
+    }
+}
+
+function delay(ms, { signal } = {}) {
+    return new Promise((resolve, reject) => {
+        const abortError = () => {
+            reject(new AbortError());
+        };
+        const abortHandler = () => {
+            clearTimeout(timeoutId);
+            abortError();
+        };
+        if (signal?.aborted) {
+            return abortError();
+        }
+        const timeoutId = setTimeout(resolve, ms);
+        signal?.addEventListener('abort', abortHandler, { once: true });
+    });
+}
+
+async function timeout(ms) {
+    await delay(ms);
+    throw new TimeoutError();
+}
+
+async function withTimeout(run, ms) {
+    return Promise.race([run(), timeout(ms)]);
+}
+
+exports.AbortError = AbortError;
+exports.TimeoutError = TimeoutError;
+exports.delay = delay;
+exports.withTimeout = withTimeout;

package/dist/_chunk/initial-BTrQy1.js

@@ -0,0 +1,514 @@
+'use strict';
+
+const randomInt = require('./randomInt-CF7bZK.js');
+
+function chunk(arr, size) {
+    if (!Number.isInteger(size) || size <= 0) {
+        throw new Error('Size must be an integer greater than zero.');
+    }
+    const chunkLength = Math.ceil(arr.length / size);
+    const result = Array(chunkLength);
+    for (let index = 0; index < chunkLength; index++) {
+        const start = index * size;
+        const end = start + size;
+        result[index] = arr.slice(start, end);
+    }
+    return result;
+}
+
+function compact(arr) {
+    const result = [];
+    for (const item of arr) {
+        if (item) {
+            result.push(item);
+        }
+    }
+    return result;
+}
+
+function countBy(arr, mapper) {
+    const result = {};
+    for (const item of arr) {
+        const key = mapper(item);
+        result[key] = (result[key] ?? 0) + 1;
+    }
+    return result;
+}
+
+function difference(firstArr, secondArr) {
+    const secondSet = new Set(secondArr);
+    return firstArr.filter(item => !secondSet.has(item));
+}
+
+function differenceBy(firstArr, secondArr, mapper) {
+    const mappedSecondSet = new Set(secondArr.map(item => mapper(item)));
+    return firstArr.filter(item => {
+        return !mappedSecondSet.has(mapper(item));
+    });
+}
+
+function differenceWith(firstArr, secondArr, areItemsEqual) {
+    return firstArr.filter(firstItem => {
+        return secondArr.every(secondItem => {
+            return !areItemsEqual(firstItem, secondItem);
+        });
+    });
+}
+
+function drop(arr, itemsCount) {
+    itemsCount = Math.max(itemsCount, 0);
+    return arr.slice(itemsCount);
+}
+
+function dropRight(arr, itemsCount) {
+    itemsCount = Math.min(-itemsCount, 0);
+    if (itemsCount === 0) {
+        return arr.slice();
+    }
+    return arr.slice(0, itemsCount);
+}
+
+function dropRightWhile(arr, canContinueDropping) {
+    for (let i = arr.length - 1; i >= 0; i--) {
+        if (!canContinueDropping(arr[i])) {
+            return arr.slice(0, i + 1);
+        }
+    }
+    return [];
+}
+
+function dropWhile(arr, canContinueDropping) {
+    const dropEndIndex = arr.findIndex(item => !canContinueDropping(item));
+    if (dropEndIndex === -1) {
+        return [];
+    }
+    return arr.slice(dropEndIndex);
+}
+
+function fill(array, value, start = 0, end = array.length) {
+    const length = array.length;
+    const finalStart = Math.max(start >= 0 ? start : length + start, 0);
+    const finalEnd = Math.min(end >= 0 ? end : length + end, length);
+    for (let i = finalStart; i < finalEnd; i++) {
+        array[i] = value;
+    }
+    return array;
+}
+
+function flatten(arr, depth = 1) {
+    const result = [];
+    const flooredDepth = Math.floor(depth);
+    const recursive = (arr, currentDepth) => {
+        for (const item of arr) {
+            if (Array.isArray(item) && currentDepth < flooredDepth) {
+                recursive(item, currentDepth + 1);
+            }
+            else {
+                result.push(item);
+            }
+        }
+    };
+    recursive(arr, 0);
+    return result;
+}
+
+function flatMap(arr, iteratee, depth = 1) {
+    return flatten(arr.map(item => iteratee(item)), depth);
+}
+
+function forEachRight(arr, callback) {
+    for (let i = arr.length - 1; i >= 0; i--) {
+        const element = arr[i];
+        callback(element, i, arr);
+    }
+}
+
+function groupBy(arr, getKeyFromItem) {
+    const result = {};
+    for (const item of arr) {
+        const key = getKeyFromItem(item);
+        if (result[key] == null) {
+            result[key] = [];
+        }
+        result[key].push(item);
+    }
+    return result;
+}
+
+function intersection(firstArr, secondArr) {
+    const secondSet = new Set(secondArr);
+    return firstArr.filter(item => {
+        return secondSet.has(item);
+    });
+}
+
+function intersectionBy(firstArr, secondArr, mapper) {
+    const mappedSecondSet = new Set(secondArr.map(mapper));
+    return firstArr.filter(item => mappedSecondSet.has(mapper(item)));
+}
+
+function intersectionWith(firstArr, secondArr, areItemsEqual) {
+    return firstArr.filter(firstItem => {
+        return secondArr.some(secondItem => {
+            return areItemsEqual(firstItem, secondItem);
+        });
+    });
+}
+
+function keyBy(arr, getKeyFromItem) {
+    const result = {};
+    for (const item of arr) {
+        const key = getKeyFromItem(item);
+        result[key] = item;
+    }
+    return result;
+}
+
+function maxBy(items, getValue) {
+    let maxElement = items[0];
+    let max = -Infinity;
+    for (const element of items) {
+        const value = getValue(element);
+        if (value > max) {
+            max = value;
+            maxElement = element;
+        }
+    }
+    return maxElement;
+}
+
+function minBy(items, getValue) {
+    let minElement = items[0];
+    let min = Infinity;
+    for (const element of items) {
+        const value = getValue(element);
+        if (value < min) {
+            min = value;
+            minElement = element;
+        }
+    }
+    return minElement;
+}
+
+function orderBy(collection, keys, orders) {
+    const compareValues = (a, b, order) => {
+        if (a < b) {
+            return order === 'asc' ? -1 : 1;
+        }
+        if (a > b) {
+            return order === 'asc' ? 1 : -1;
+        }
+        return 0;
+    };
+    const effectiveOrders = keys.map((_, index) => orders[index] || orders[orders.length - 1]);
+    return collection.slice().sort((a, b) => {
+        for (let i = 0; i < keys.length; i++) {
+            const key = keys[i];
+            const order = effectiveOrders[i];
+            const result = compareValues(a[key], b[key], order);
+            if (result !== 0) {
+                return result;
+            }
+        }
+        return 0;
+    });
+}
+
+function partition(arr, isInTruthy) {
+    const truthy = [];
+    const falsy = [];
+    for (const item of arr) {
+        if (isInTruthy(item)) {
+            truthy.push(item);
+        }
+        else {
+            falsy.push(item);
+        }
+    }
+    return [truthy, falsy];
+}
+
+function sample(arr) {
+    const randomIndex = Math.floor(Math.random() * arr.length);
+    return arr[randomIndex];
+}
+
+function sampleSize(array, size) {
+    if (size > array.length) {
+        throw new Error('Size must be less than or equal to the length of array.');
+    }
+    const result = new Array(size);
+    const selected = new Set();
+    for (let step = array.length - size, resultIndex = 0; step < array.length; step++, resultIndex++) {
+        let index = randomInt.randomInt(0, step + 1);
+        if (selected.has(index)) {
+            index = step;
+        }
+        selected.add(index);
+        result[resultIndex] = array[index];
+    }
+    return result;
+}
+
+function shuffle(arr) {
+    const result = arr.slice();
+    for (let i = result.length - 1; i >= 1; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [result[i], result[j]] = [result[j], result[i]];
+    }
+    return result;
+}
+
+function take(arr, count) {
+    return arr.slice(0, count);
+}
+
+function takeRight(arr, count = 1) {
+    if (count <= 0) {
+        return [];
+    }
+    return arr.slice(-count);
+}
+
+function takeRightWhile(arr, shouldContinueTaking) {
+    for (let i = arr.length - 1; i >= 0; i--) {
+        if (!shouldContinueTaking(arr[i])) {
+            return arr.slice(i + 1);
+        }
+    }
+    return arr.slice();
+}
+
+function takeWhile(arr, shouldContinueTaking) {
+    const result = [];
+    for (const item of arr) {
+        if (!shouldContinueTaking(item)) {
+            break;
+        }
+        result.push(item);
+    }
+    return result;
+}
+
+function uniq(arr) {
+    return Array.from(new Set(arr));
+}
+
+function union(arr1, arr2) {
+    return uniq(arr1.concat(arr2));
+}
+
+function unionBy(arr1, arr2, mapper) {
+    const map = new Map();
+    for (const item of [...arr1, ...arr2]) {
+        const key = mapper(item);
+        if (!map.has(key)) {
+            map.set(key, item);
+        }
+    }
+    return Array.from(map.values());
+}
+
+function uniqWith(arr, areItemsEqual) {
+    const result = [];
+    for (const item of arr) {
+        const isUniq = result.every(v => !areItemsEqual(v, item));
+        if (isUniq) {
+            result.push(item);
+        }
+    }
+    return result;
+}
+
+function unionWith(arr1, arr2, areItemsEqual) {
+    return uniqWith(arr1.concat(arr2), areItemsEqual);
+}
+
+function uniqBy(arr, mapper) {
+    const map = new Map();
+    for (const item of arr) {
+        const key = mapper(item);
+        if (!map.has(key)) {
+            map.set(key, item);
+        }
+    }
+    return Array.from(map.values());
+}
+
+function unzip(zipped) {
+    let maxLen = 0;
+    for (let i = 0; i < zipped.length; i++) {
+        if (zipped[i].length > maxLen) {
+            maxLen = zipped[i].length;
+        }
+    }
+    const result = new Array(maxLen);
+    for (let i = 0; i < maxLen; i++) {
+        result[i] = new Array(zipped.length);
+        for (let j = 0; j < zipped.length; j++) {
+            result[i][j] = zipped[j][i];
+        }
+    }
+    return result;
+}
+
+function unzipWith(target, iteratee) {
+    const maxLength = Math.max(...target.map(innerArray => innerArray.length));
+    const result = new Array(maxLength);
+    for (let i = 0; i < maxLength; i++) {
+        const group = new Array(target.length);
+        for (let j = 0; j < target.length; j++) {
+            group[j] = target[j][i];
+        }
+        result[i] = iteratee(...group);
+    }
+    return result;
+}
+
+function xor(arr1, arr2) {
+    return difference(union(arr1, arr2), intersection(arr1, arr2));
+}
+
+function xorBy(arr1, arr2, mapper) {
+    const union = unionBy(arr1, arr2, mapper);
+    const intersection = intersectionBy(arr1, arr2, mapper);
+    return differenceBy(union, intersection, mapper);
+}
+
+function xorWith(arr1, arr2, areElementsEqual) {
+    const union = unionWith(arr1, arr2, areElementsEqual);
+    const intersection = intersectionWith(arr1, arr2, areElementsEqual);
+    return differenceWith(union, intersection, areElementsEqual);
+}
+
+function zip(...arrs) {
+    const result = [];
+    const maxIndex = Math.max(...arrs.map(x => x.length));
+    for (let i = 0; i < maxIndex; i++) {
+        const element = [];
+        for (const arr of arrs) {
+            element.push(arr[i]);
+        }
+        result.push(element);
+    }
+    return result;
+}
+
+function zipObject(keys, values) {
+    const result = {};
+    for (let i = 0; i < keys.length; i++) {
+        result[keys[i]] = values[i];
+    }
+    return result;
+}
+
+function zipWith(arr1, ...rest) {
+    const arrs = [arr1, ...rest.slice(0, -1)];
+    const combine = rest[rest.length - 1];
+    const result = [];
+    const maxIndex = Math.max(...arrs.map(arr => arr.length));
+    for (let i = 0; i < maxIndex; i++) {
+        const elements = arrs.map(arr => arr[i]);
+        result.push(combine(...elements));
+    }
+    return result;
+}
+
+function without(array, ...values) {
+    const valuesSet = new Set(values);
+    return array.filter(item => !valuesSet.has(item));
+}
+
+function head(arr) {
+    return arr[0];
+}
+
+function isSubset(superset, subset) {
+    return difference(subset, superset).length === 0;
+}
+
+function tail(arr) {
+    const len = arr.length;
+    if (len <= 1) {
+        return [];
+    }
+    const result = new Array(len - 1);
+    for (let i = 1; i < len; i++) {
+        result[i - 1] = arr[i];
+    }
+    return result;
+}
+
+function toFilled(arr, value, start = 0, end = arr.length) {
+    const length = arr.length;
+    const finalStart = Math.max(start >= 0 ? start : length + start, 0);
+    const finalEnd = Math.min(end >= 0 ? end : length + end, length);
+    const newArr = arr.slice();
+    for (let i = finalStart; i < finalEnd; i++) {
+        newArr[i] = value;
+    }
+    return newArr;
+}
+
+function last(arr) {
+    return arr[arr.length - 1];
+}
+
+function initial(arr) {
+    if (arr.length <= 1) {
+        return [];
+    }
+    return arr.slice(0, -1);
+}
+
+exports.chunk = chunk;
+exports.compact = compact;
+exports.countBy = countBy;
+exports.difference = difference;
+exports.differenceBy = differenceBy;
+exports.differenceWith = differenceWith;
+exports.drop = drop;
+exports.dropRight = dropRight;
+exports.dropRightWhile = dropRightWhile;
+exports.dropWhile = dropWhile;
+exports.fill = fill;
+exports.flatMap = flatMap;
+exports.flatten = flatten;
+exports.forEachRight = forEachRight;
+exports.groupBy = groupBy;
+exports.head = head;
+exports.initial = initial;
+exports.intersection = intersection;
+exports.intersectionBy = intersectionBy;
+exports.intersectionWith = intersectionWith;
+exports.isSubset = isSubset;
+exports.keyBy = keyBy;
+exports.last = last;
+exports.maxBy = maxBy;
+exports.minBy = minBy;
+exports.orderBy = orderBy;
+exports.partition = partition;
+exports.sample = sample;
+exports.sampleSize = sampleSize;
+exports.shuffle = shuffle;
+exports.tail = tail;
+exports.take = take;
+exports.takeRight = takeRight;
+exports.takeRightWhile = takeRightWhile;
+exports.takeWhile = takeWhile;
+exports.toFilled = toFilled;
+exports.union = union;
+exports.unionBy = unionBy;
+exports.unionWith = unionWith;
+exports.uniq = uniq;
+exports.uniqBy = uniqBy;
+exports.uniqWith = uniqWith;
+exports.unzip = unzip;
+exports.unzipWith = unzipWith;
+exports.without = without;
+exports.xor = xor;
+exports.xorBy = xorBy;
+exports.xorWith = xorWith;
+exports.zip = zip;
+exports.zipObject = zipObject;
+exports.zipWith = zipWith;