es-toolkit 1.20.0 → 1.21.0-dev.660

package/CHANGELOG.md

@@ -1,5 +1,18 @@
 # es-toolkit Changelog
 
+## Version v1.21.0
+
+Released on September 25th, 2024.
+
+- Added support for [constantCase](https://es-toolkit.slash.page/reference/string/constantCase.html) and [isError](https://es-toolkit.slash.page/reference/predicate/isError.html).
+- Added compatibility functions for [pad](https://es-toolkit.slash.page/reference/compat/string/pad.html), [padStart](https://es-toolkit.slash.page/reference/compat/string/padStart.html), [padEnd](https://es-toolkit.slash.page/reference/compat/string/padEnd.html), [defer](https://es-toolkit.slash.page/reference/compat/function/defer.html), [isFinite](https://es-toolkit.slash.page/reference/compat/predicate/isFinite.html), [toNumber](https://es-toolkit.slash.page/reference/compat/math/toNumber.html), [toFinite](https://es-toolkit.slash.page/reference/compat/math/toFinite.html), and [toInteger](https://es-toolkit.slash.page/reference/compat/math/toInteger.html).
+- Improved performance for [flatten](https://es-toolkit.slash.page/reference/array/flatten.html), [isNumber](https://es-toolkit.slash.page/reference/predicate/isNumber.html), [isString](https://es-toolkit.slash.page/reference/predicate/isString.html), [isSymbol](https://es-toolkit.slash.page/reference/predicate/isSymbol.html), [isRegExp](https://es-toolkit.slash.page/reference/predicate/isRegExp.html), and [isBoolean](https://es-toolkit.slash.page/reference/predicate/isBoolean.html).
+- Fixed [compact](https://es-toolkit.slash.page/reference/array/compact.html) to correctly exclude `0n` as a falsey value.
+- Fixed [pick](https://es-toolkit.slash.page/reference/object/pick.html) to not pick nonexistent keys from the original object.
+- Fixed [omit](https://es-toolkit.slash.page/reference/object/omit.html) to accept readonly arrays.
+
+This version includes contributions from @hyesungoh, @D-Sketon, @mass2527, @gweesin, @VVSOGI, @coding-honey, @seonghun0828, and @jsparkdev. Thank you for your valuable contributions!
+
 ## Version v1.20.0
 
 Released on September 20th, 2024.

package/dist/_chunk/{isWeakSet-E_VMwB.js → isWeakSet-1xFSnK.js}

@@ -238,6 +238,10 @@ function isFunction(value) {
     return typeof value === 'function';
 }
 
+function isRegExp(value) {
+    return value instanceof RegExp;
+}
+
 function isWeakMap(value) {
     return value instanceof WeakMap;
 }
@@ -257,6 +261,7 @@ exports.isLength = isLength;
 exports.isNil = isNil;
 exports.isNotNil = isNotNil;
 exports.isNull = isNull;
+exports.isRegExp = isRegExp;
 exports.isUndefined = isUndefined;
 exports.isWeakMap = isWeakMap;
 exports.isWeakSet = isWeakSet;

package/dist/_chunk/{toMerged-Bzkqyz.js → toMerged-D-sLFv.js}

@@ -4,22 +4,24 @@ const isPlainObject = require('./isPlainObject-BIekvL.js');
 
 function omitBy(obj, shouldOmit) {
     const result = {};
-    for (const [key, value] of Object.entries(obj)) {
-        if (shouldOmit(value, key)) {
-            continue;
+    const objEntries = Object.entries(obj);
+    for (let i = 0; i < objEntries.length; i++) {
+        const [key, value] = objEntries[i];
+        if (!shouldOmit(value, key)) {
+            result[key] = value;
         }
-        result[key] = value;
     }
     return result;
 }
 
 function pickBy(obj, shouldPick) {
     const result = {};
-    for (const [key, value] of Object.entries(obj)) {
-        if (!shouldPick(value, key)) {
-            continue;
+    const objEntries = Object.entries(obj);
+    for (let i = 0; i < objEntries.length; i++) {
+        const [key, value] = objEntries[i];
+        if (shouldPick(value, key)) {
+            result[key] = value;
         }
-        result[key] = value;
     }
     return result;
 }

package/dist/_chunk/{zipWith-CDtN9Y.js → zipWith-DEcUS4.js}

@@ -27,7 +27,8 @@ function chunk(arr, size) {
 
 function compact(arr) {
     const result = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         if (item) {
             result.push(item);
         }
@@ -37,7 +38,8 @@ function compact(arr) {
 
 function countBy(arr, mapper) {
     const result = {};
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = mapper(item);
         result[key] = (result[key] ?? 0) + 1;
     }
@@ -103,7 +105,8 @@ function flatten(arr, depth = 1) {
     const result = [];
     const flooredDepth = Math.floor(depth);
     const recursive = (arr, currentDepth) => {
-        for (const item of arr) {
+        for (let i = 0; i < arr.length; i++) {
+            const item = arr[i];
             if (Array.isArray(item) && currentDepth < flooredDepth) {
                 recursive(item, currentDepth + 1);
             }
@@ -137,7 +140,8 @@ function forEachRight(arr, callback) {
 
 function groupBy(arr, getKeyFromItem) {
     const result = Object.create(null);
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = getKeyFromItem(item);
         if (result[key] == null) {
             result[key] = [];
@@ -181,7 +185,8 @@ function isSubset(superset, subset) {
 
 function keyBy(arr, getKeyFromItem) {
     const result = {};
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = getKeyFromItem(item);
         result[key] = item;
     }
@@ -195,7 +200,8 @@ function last(arr) {
 function maxBy(items, getValue) {
     let maxElement = items[0];
     let max = -Infinity;
-    for (const element of items) {
+    for (let i = 0; i < items.length; i++) {
+        const element = items[i];
         const value = getValue(element);
         if (value > max) {
             max = value;
@@ -208,7 +214,8 @@ function maxBy(items, getValue) {
 function minBy(items, getValue) {
     let minElement = items[0];
     let min = Infinity;
-    for (const element of items) {
+    for (let i = 0; i < items.length; i++) {
+        const element = items[i];
         const value = getValue(element);
         if (value < min) {
             min = value;
@@ -221,7 +228,8 @@ function minBy(items, getValue) {
 function partition(arr, isInTruthy) {
     const truthy = [];
     const falsy = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         if (isInTruthy(item)) {
             truthy.push(item);
         }
@@ -298,7 +306,8 @@ function takeRightWhile(arr, shouldContinueTaking) {
 
 function takeWhile(arr, shouldContinueTaking) {
     const result = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         if (!shouldContinueTaking(item)) {
             break;
         }
@@ -328,7 +337,9 @@ function union(arr1, arr2) {
 
 function unionBy(arr1, arr2, mapper) {
     const map = new Map();
-    for (const item of [...arr1, ...arr2]) {
+    const items = [...arr1, ...arr2];
+    for (let i = 0; i < items.length; i++) {
+        const item = items[i];
         const key = mapper(item);
         if (!map.has(key)) {
             map.set(key, item);
@@ -339,7 +350,8 @@ function unionBy(arr1, arr2, mapper) {
 
 function uniqWith(arr, areItemsEqual) {
     const result = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const isUniq = result.every(v => !areItemsEqual(v, item));
         if (isUniq) {
             result.push(item);
@@ -354,7 +366,8 @@ function unionWith(arr1, arr2, areItemsEqual) {
 
 function uniqBy(arr, mapper) {
     const map = new Map();
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = mapper(item);
         if (!map.has(key)) {
             map.set(key, item);

package/dist/array/compact.d.mts

@@ -1,13 +1,13 @@
-type NotFalsey<T> = Exclude<T, false | null | 0 | '' | undefined>;
+type NotFalsey<T> = Exclude<T, false | null | 0 | 0n | '' | undefined>;
 /**
- * Removes falsey values (false, null, 0, '', undefined, NaN) from an array.
+ * Removes falsey values (false, null, 0, 0n, '', undefined, NaN) from an array.
  *
  * @template T - The type of elements in the array.
  * @param {T[]} arr - The input array to remove falsey values.
- * @returns {Array<Exclude<T, false | null | 0 | '' | undefined>>} - A new array with all falsey values removed.
+ * @returns {Array<Exclude<T, false | null | 0 | 0n | '' | undefined>>} - A new array with all falsey values removed.
  *
  * @example
- * compact([0, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);
+ * compact([0, 0n, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);
  * Returns: [1, 2, 3, 4, 5]
  */
 declare function compact<T>(arr: readonly T[]): Array<NotFalsey<T>>;

package/dist/array/compact.d.ts

@@ -1,13 +1,13 @@
-type NotFalsey<T> = Exclude<T, false | null | 0 | '' | undefined>;
+type NotFalsey<T> = Exclude<T, false | null | 0 | 0n | '' | undefined>;
 /**
- * Removes falsey values (false, null, 0, '', undefined, NaN) from an array.
+ * Removes falsey values (false, null, 0, 0n, '', undefined, NaN) from an array.
  *
  * @template T - The type of elements in the array.
  * @param {T[]} arr - The input array to remove falsey values.
- * @returns {Array<Exclude<T, false | null | 0 | '' | undefined>>} - A new array with all falsey values removed.
+ * @returns {Array<Exclude<T, false | null | 0 | 0n | '' | undefined>>} - A new array with all falsey values removed.
  *
  * @example
- * compact([0, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);
+ * compact([0, 0n, 1, false, 2, '', 3, null, undefined, 4, NaN, 5]);
  * Returns: [1, 2, 3, 4, 5]
  */
 declare function compact<T>(arr: readonly T[]): Array<NotFalsey<T>>;

package/dist/array/compact.mjs

@@ -1,6 +1,7 @@
 function compact(arr) {
     const result = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         if (item) {
             result.push(item);
         }

package/dist/array/countBy.mjs

@@ -1,6 +1,7 @@
 function countBy(arr, mapper) {
     const result = {};
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = mapper(item);
         result[key] = (result[key] ?? 0) + 1;
     }

package/dist/array/flatten.mjs

@@ -2,7 +2,8 @@ function flatten(arr, depth = 1) {
     const result = [];
     const flooredDepth = Math.floor(depth);
     const recursive = (arr, currentDepth) => {
-        for (const item of arr) {
+        for (let i = 0; i < arr.length; i++) {
+            const item = arr[i];
             if (Array.isArray(item) && currentDepth < flooredDepth) {
                 recursive(item, currentDepth + 1);
             }

package/dist/array/groupBy.mjs

@@ -1,6 +1,7 @@
 function groupBy(arr, getKeyFromItem) {
     const result = Object.create(null);
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = getKeyFromItem(item);
         if (result[key] == null) {
             result[key] = [];

package/dist/array/index.js

@@ -2,7 +2,7 @@
 
 Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
 
-const zipWith = require('../_chunk/zipWith-CDtN9Y.js');
+const zipWith = require('../_chunk/zipWith-DEcUS4.js');
 
 function drop(arr, itemsCount) {
     itemsCount = Math.max(itemsCount, 0);

package/dist/array/keyBy.mjs

@@ -1,6 +1,7 @@
 function keyBy(arr, getKeyFromItem) {
     const result = {};
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = getKeyFromItem(item);
         result[key] = item;
     }

package/dist/array/maxBy.d.mts

@@ -9,6 +9,14 @@
  * @example
  * maxBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 3 }
  * maxBy([], x => x.a); // Returns: undefined
+ * maxBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'john', age: 30 }
  */
 declare function maxBy<T>(items: readonly [T, ...T[]], getValue: (element: T) => number): T;
 /**
@@ -22,6 +30,14 @@ declare function maxBy<T>(items: readonly [T, ...T[]], getValue: (element: T) =>
  * @example
  * maxBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 3 }
  * maxBy([], x => x.a); // Returns: undefined
+ * maxBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'john', age: 30 }
  */
 declare function maxBy<T>(items: readonly T[], getValue: (element: T) => number): T | undefined;
 

package/dist/array/maxBy.d.ts

@@ -9,6 +9,14 @@
  * @example
  * maxBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 3 }
  * maxBy([], x => x.a); // Returns: undefined
+ * maxBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'john', age: 30 }
  */
 declare function maxBy<T>(items: readonly [T, ...T[]], getValue: (element: T) => number): T;
 /**
@@ -22,6 +30,14 @@ declare function maxBy<T>(items: readonly [T, ...T[]], getValue: (element: T) =>
  * @example
  * maxBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 3 }
  * maxBy([], x => x.a); // Returns: undefined
+ * maxBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'john', age: 30 }
  */
 declare function maxBy<T>(items: readonly T[], getValue: (element: T) => number): T | undefined;
 

package/dist/array/maxBy.mjs

@@ -1,7 +1,8 @@
 function maxBy(items, getValue) {
     let maxElement = items[0];
     let max = -Infinity;
-    for (const element of items) {
+    for (let i = 0; i < items.length; i++) {
+        const element = items[i];
         const value = getValue(element);
         if (value > max) {
             max = value;

package/dist/array/minBy.d.mts

@@ -9,6 +9,14 @@
  * @example
  * minBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 1 }
  * minBy([], x => x.a); // Returns: undefined
+ * minBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'joe', age: 26 }
  */
 declare function minBy<T>(items: readonly [T, ...T[]], getValue: (element: T) => number): T;
 /**
@@ -22,6 +30,14 @@ declare function minBy<T>(items: readonly [T, ...T[]], getValue: (element: T) =>
  * @example
  * minBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 1 }
  * minBy([], x => x.a); // Returns: undefined
+ * minBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'joe', age: 26 }
  */
 declare function minBy<T>(items: readonly T[], getValue: (element: T) => number): T | undefined;
 

package/dist/array/minBy.d.ts

@@ -9,6 +9,14 @@
  * @example
  * minBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 1 }
  * minBy([], x => x.a); // Returns: undefined
+ * minBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'joe', age: 26 }
  */
 declare function minBy<T>(items: readonly [T, ...T[]], getValue: (element: T) => number): T;
 /**
@@ -22,6 +30,14 @@ declare function minBy<T>(items: readonly [T, ...T[]], getValue: (element: T) =>
  * @example
  * minBy([{ a: 1 }, { a: 2 }, { a: 3 }], x => x.a); // Returns: { a: 1 }
  * minBy([], x => x.a); // Returns: undefined
+ * minBy(
+ *   [
+ *     { name: 'john', age: 30 },
+ *     { name: 'jane', age: 28 },
+ *     { name: 'joe', age: 26 },
+ *   ],
+ *   x => x.age
+ * ); // Returns: { name: 'joe', age: 26 }
  */
 declare function minBy<T>(items: readonly T[], getValue: (element: T) => number): T | undefined;
 

package/dist/array/minBy.mjs

@@ -1,7 +1,8 @@
 function minBy(items, getValue) {
     let minElement = items[0];
     let min = Infinity;
-    for (const element of items) {
+    for (let i = 0; i < items.length; i++) {
+        const element = items[i];
         const value = getValue(element);
         if (value < min) {
             min = value;

package/dist/array/partition.mjs

@@ -1,7 +1,8 @@
 function partition(arr, isInTruthy) {
     const truthy = [];
     const falsy = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         if (isInTruthy(item)) {
             truthy.push(item);
         }

package/dist/array/takeWhile.mjs

@@ -1,6 +1,7 @@
 function takeWhile(arr, shouldContinueTaking) {
     const result = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         if (!shouldContinueTaking(item)) {
             break;
         }

package/dist/array/unionBy.mjs

@@ -1,6 +1,8 @@
 function unionBy(arr1, arr2, mapper) {
     const map = new Map();
-    for (const item of [...arr1, ...arr2]) {
+    const items = [...arr1, ...arr2];
+    for (let i = 0; i < items.length; i++) {
+        const item = items[i];
         const key = mapper(item);
         if (!map.has(key)) {
             map.set(key, item);

package/dist/array/uniqBy.mjs

@@ -1,6 +1,7 @@
 function uniqBy(arr, mapper) {
     const map = new Map();
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const key = mapper(item);
         if (!map.has(key)) {
             map.set(key, item);

package/dist/array/uniqWith.mjs

@@ -1,6 +1,7 @@
 function uniqWith(arr, areItemsEqual) {
     const result = [];
-    for (const item of arr) {
+    for (let i = 0; i < arr.length; i++) {
+        const item = arr[i];
         const isUniq = result.every(v => !areItemsEqual(v, item));
         if (isUniq) {
             result.push(item);