es-toolkit 1.50.0-dev.2001 → 1.50.0-dev.2026

package/dist/compat/array/fill.mjs

@@ -1,6 +1,7 @@
 import { fill as fill$1 } from "../../array/fill.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { toInteger } from "../util/toInteger.mjs";
+import { isIterateeCall } from "../_internal/isIterateeCall.mjs";
 import { isString } from "../predicate/isString.mjs";
 //#region src/compat/array/fill.ts
 /**
@@ -33,6 +34,10 @@ import { isString } from "../predicate/isString.mjs";
 function fill(array, value, start = 0, end = array ? array.length : 0) {
 	if (!isArrayLike(array)) return [];
 	if (isString(array)) return array;
+	if (start && typeof start !== "number" && isIterateeCall(array, value, start)) {
+		start = 0;
+		end = array.length;
+	}
 	start = toInteger(start);
 	end = toInteger(end);
 	if (!start) start = 0;

package/dist/compat/array/findIndex.js

@@ -1,6 +1,4 @@
-const require_property = require("../object/property.js");
-const require_matches = require("../predicate/matches.js");
-const require_matchesProperty = require("../predicate/matchesProperty.js");
+const require_iteratee = require("../util/iteratee.js");
 const require_toInteger = require("../util/toInteger.js");
 const require_identity = require("../function/identity.js");
 //#region src/compat/array/findIndex.ts
@@ -24,22 +22,8 @@ function findIndex(arr, doesMatch = require_identity.identity, fromIndex = 0) {
 	fromIndex = require_toInteger.toInteger(fromIndex);
 	if (fromIndex < 0) fromIndex = Math.max(arr.length + fromIndex, 0);
 	const subArray = Array.from(arr).slice(fromIndex);
-	let index = -1;
-	switch (typeof doesMatch) {
-		case "function":
-			index = subArray.findIndex(doesMatch);
-			break;
-		case "object":
-			if (Array.isArray(doesMatch) && doesMatch.length === 2) {
-				const key = doesMatch[0];
-				const value = doesMatch[1];
-				index = subArray.findIndex(require_matchesProperty.matchesProperty(key, value));
-			} else index = subArray.findIndex(require_matches.matches(doesMatch));
-			break;
-		case "number":
-		case "symbol":
-		case "string": index = subArray.findIndex(require_property.property(doesMatch));
-	}
+	const iteratee$1 = require_iteratee.iteratee(doesMatch);
+	const index = subArray.findIndex(iteratee$1);
 	return index === -1 ? -1 : index + fromIndex;
 }
 //#endregion

package/dist/compat/array/findIndex.mjs

@@ -1,6 +1,4 @@
-import { property } from "../object/property.mjs";
-import { matches } from "../predicate/matches.mjs";
-import { matchesProperty } from "../predicate/matchesProperty.mjs";
+import { iteratee } from "../util/iteratee.mjs";
 import { toInteger } from "../util/toInteger.mjs";
 import { identity } from "../function/identity.mjs";
 //#region src/compat/array/findIndex.ts
@@ -24,22 +22,8 @@ function findIndex(arr, doesMatch = identity, fromIndex = 0) {
 	fromIndex = toInteger(fromIndex);
 	if (fromIndex < 0) fromIndex = Math.max(arr.length + fromIndex, 0);
 	const subArray = Array.from(arr).slice(fromIndex);
-	let index = -1;
-	switch (typeof doesMatch) {
-		case "function":
-			index = subArray.findIndex(doesMatch);
-			break;
-		case "object":
-			if (Array.isArray(doesMatch) && doesMatch.length === 2) {
-				const key = doesMatch[0];
-				const value = doesMatch[1];
-				index = subArray.findIndex(matchesProperty(key, value));
-			} else index = subArray.findIndex(matches(doesMatch));
-			break;
-		case "number":
-		case "symbol":
-		case "string": index = subArray.findIndex(property(doesMatch));
-	}
+	const iteratee$1 = iteratee(doesMatch);
+	const index = subArray.findIndex(iteratee$1);
 	return index === -1 ? -1 : index + fromIndex;
 }
 //#endregion

package/dist/compat/array/findLast.js

@@ -7,7 +7,7 @@ const require_toInteger = require("../util/toInteger.js");
 *
 * @template T
 * @param collection - The array or object to search through.
-* @param [predicate=identity] - The criteria to match. It can be a function, a partial object, a key-value pair, or a property name.
+* @param [_doesMatch=identity] - The criteria to match. It can be a function, a partial object, a key-value pair, or a property name.
 * @param [fromIndex] - The index to start the search from, defaults to collection.length-1 for arrays or Object.keys(collection).length-1 for objects.
 * @returns The last property value that has the specified property, or `undefined` if no match is found.
 *
@@ -17,13 +17,13 @@ const require_toInteger = require("../util/toInteger.js");
 * const result = findLast(obj, 'name');
 * console.log(result); // { id: 3, name: 'Bob' }
 */
-function findLast(collection, predicate = require_identity.identity, fromIndex) {
+function findLast(collection, _doesMatch = require_identity.identity, fromIndex) {
 	if (!collection) return;
 	const length = Array.isArray(collection) ? collection.length : Object.keys(collection).length;
 	fromIndex = require_toInteger.toInteger(fromIndex ?? length - 1);
 	if (fromIndex < 0) fromIndex = Math.max(length + fromIndex, 0);
 	else fromIndex = Math.min(fromIndex, length - 1);
-	const doesMatch = require_iteratee.iteratee(predicate);
+	const doesMatch = require_iteratee.iteratee(_doesMatch);
 	if (!Array.isArray(collection)) {
 		const keys = Object.keys(collection);
 		for (let i = fromIndex; i >= 0; i--) {

package/dist/compat/array/findLast.mjs

@@ -7,7 +7,7 @@ import { toInteger } from "../util/toInteger.mjs";
 *
 * @template T
 * @param collection - The array or object to search through.
-* @param [predicate=identity] - The criteria to match. It can be a function, a partial object, a key-value pair, or a property name.
+* @param [_doesMatch=identity] - The criteria to match. It can be a function, a partial object, a key-value pair, or a property name.
 * @param [fromIndex] - The index to start the search from, defaults to collection.length-1 for arrays or Object.keys(collection).length-1 for objects.
 * @returns The last property value that has the specified property, or `undefined` if no match is found.
 *
@@ -17,13 +17,13 @@ import { toInteger } from "../util/toInteger.mjs";
 * const result = findLast(obj, 'name');
 * console.log(result); // { id: 3, name: 'Bob' }
 */
-function findLast(collection, predicate = identity, fromIndex) {
+function findLast(collection, _doesMatch = identity, fromIndex) {
 	if (!collection) return;
 	const length = Array.isArray(collection) ? collection.length : Object.keys(collection).length;
 	fromIndex = toInteger(fromIndex ?? length - 1);
 	if (fromIndex < 0) fromIndex = Math.max(length + fromIndex, 0);
 	else fromIndex = Math.min(fromIndex, length - 1);
-	const doesMatch = iteratee(predicate);
+	const doesMatch = iteratee(_doesMatch);
 	if (!Array.isArray(collection)) {
 		const keys = Object.keys(collection);
 		for (let i = fromIndex; i >= 0; i--) {

package/dist/compat/array/flatMap.js

@@ -1,7 +1,4 @@
-const require_identity = require("../../function/identity.js");
-const require_isNil = require("../../predicate/isNil.js");
-const require_flattenDepth = require("./flattenDepth.js");
-const require_map = require("./map.js");
+const require_flatMapDepth = require("./flatMapDepth.js");
 //#region src/compat/array/flatMap.ts
 /**
 * Creates a flattened array of values by running each element in collection through iteratee and flattening the mapped results.
@@ -15,10 +12,8 @@ const require_map = require("./map.js");
 * flatMap([1, 2], n => [n, n * 2]);
 * // => [1, 2, 2, 4]
 */
-function flatMap(collection, iteratee = require_identity.identity) {
-	if (require_isNil.isNil(collection)) return [];
-	const mapped = require_isNil.isNil(iteratee) ? require_map.map(collection) : require_map.map(collection, iteratee);
-	return require_flattenDepth.flattenDepth(mapped, 1);
+function flatMap(collection, iteratee) {
+	return require_flatMapDepth.flatMapDepth(collection, iteratee, 1);
 }
 //#endregion
 exports.flatMap = flatMap;

package/dist/compat/array/flatMap.mjs

@@ -1,7 +1,4 @@
-import { identity } from "../../function/identity.mjs";
-import { isNil } from "../../predicate/isNil.mjs";
-import { flattenDepth } from "./flattenDepth.mjs";
-import { map } from "./map.mjs";
+import { flatMapDepth } from "./flatMapDepth.mjs";
 //#region src/compat/array/flatMap.ts
 /**
 * Creates a flattened array of values by running each element in collection through iteratee and flattening the mapped results.
@@ -15,9 +12,8 @@ import { map } from "./map.mjs";
 * flatMap([1, 2], n => [n, n * 2]);
 * // => [1, 2, 2, 4]
 */
-function flatMap(collection, iteratee = identity) {
-	if (isNil(collection)) return [];
-	return flattenDepth(isNil(iteratee) ? map(collection) : map(collection, iteratee), 1);
+function flatMap(collection, iteratee) {
+	return flatMapDepth(collection, iteratee, 1);
 }
 //#endregion
 export { flatMap };

package/dist/compat/array/flatMapDepth.js

@@ -8,7 +8,7 @@ const require_map = require("./map.js");
 *
 * @template T, R
 * @param collection - The array or object to iterate over.
-* @param [iteratee] - The function that produces the new array elements.
+* @param [iteratee=identity] - The function that produces the new array elements.
 * @param [depth=1] - The maximum recursion depth.
 * @returns A new array that has been flattened up to the specified depth.
 *

package/dist/compat/array/flatMapDepth.mjs

@@ -8,7 +8,7 @@ import { map } from "./map.mjs";
 *
 * @template T, R
 * @param collection - The array or object to iterate over.
-* @param [iteratee] - The function that produces the new array elements.
+* @param [iteratee=identity] - The function that produces the new array elements.
 * @param [depth=1] - The maximum recursion depth.
 * @returns A new array that has been flattened up to the specified depth.
 *

package/dist/compat/array/includes.js

@@ -8,7 +8,7 @@ const require_isString = require("../predicate/isString.js");
 *
 * The comparison uses SameValueZero to check for inclusion.
 *
-* @param source - The source to search in. It can be an array, an object, or a string.
+* @param collection - The source to search in. It can be an array, an object, or a string.
 * @param [target] - The value to search for in the source.
 * @param [fromIndex=0] - The index to start searching from. If negative, it is treated as an offset from the end of the source.
 * @returns `true` if the value is found in the source, `false` otherwise.
@@ -19,25 +19,25 @@ const require_isString = require("../predicate/isString.js");
 * includes('hello world', 'world'); // true
 * includes('hello world', 'test'); // false
 */
-function includes(source, target, fromIndex, guard) {
-	if (source == null) return false;
+function includes(collection, target, fromIndex, guard) {
+	if (collection == null) return false;
 	if (guard || !fromIndex) fromIndex = 0;
 	else fromIndex = require_toInteger.toInteger(fromIndex);
-	if (require_isString.isString(source)) {
-		if (fromIndex > source.length || target instanceof RegExp) return false;
-		if (fromIndex < 0) fromIndex = Math.max(0, source.length + fromIndex);
-		return source.includes(target, fromIndex);
+	if (require_isString.isString(collection)) {
+		if (fromIndex > collection.length || target instanceof RegExp) return false;
+		if (fromIndex < 0) fromIndex = Math.max(0, collection.length + fromIndex);
+		return collection.includes(target, fromIndex);
 	}
-	if (Array.isArray(source)) return source.includes(target, fromIndex);
-	if (require_isArrayLike.isArrayLike(source)) {
-		if (fromIndex < 0) fromIndex = Math.max(0, source.length + fromIndex);
-		for (let i = fromIndex; i < source.length; i++) if (require_eq.eq(source[i], target)) return true;
+	if (Array.isArray(collection)) return collection.includes(target, fromIndex);
+	if (require_isArrayLike.isArrayLike(collection)) {
+		if (fromIndex < 0) fromIndex = Math.max(0, collection.length + fromIndex);
+		for (let i = fromIndex; i < collection.length; i++) if (require_eq.eq(collection[i], target)) return true;
 		return false;
 	}
-	const keys = Object.keys(source);
+	const keys = Object.keys(collection);
 	if (fromIndex < 0) fromIndex = Math.max(0, keys.length + fromIndex);
 	for (let i = fromIndex; i < keys.length; i++) {
-		const value = Reflect.get(source, keys[i]);
+		const value = Reflect.get(collection, keys[i]);
 		if (require_eq.eq(value, target)) return true;
 	}
 	return false;

package/dist/compat/array/includes.mjs

@@ -8,7 +8,7 @@ import { isString } from "../predicate/isString.mjs";
 *
 * The comparison uses SameValueZero to check for inclusion.
 *
-* @param source - The source to search in. It can be an array, an object, or a string.
+* @param collection - The source to search in. It can be an array, an object, or a string.
 * @param [target] - The value to search for in the source.
 * @param [fromIndex=0] - The index to start searching from. If negative, it is treated as an offset from the end of the source.
 * @returns `true` if the value is found in the source, `false` otherwise.
@@ -19,24 +19,24 @@ import { isString } from "../predicate/isString.mjs";
 * includes('hello world', 'world'); // true
 * includes('hello world', 'test'); // false
 */
-function includes(source, target, fromIndex, guard) {
-	if (source == null) return false;
+function includes(collection, target, fromIndex, guard) {
+	if (collection == null) return false;
 	if (guard || !fromIndex) fromIndex = 0;
 	else fromIndex = toInteger(fromIndex);
-	if (isString(source)) {
-		if (fromIndex > source.length || target instanceof RegExp) return false;
-		if (fromIndex < 0) fromIndex = Math.max(0, source.length + fromIndex);
-		return source.includes(target, fromIndex);
+	if (isString(collection)) {
+		if (fromIndex > collection.length || target instanceof RegExp) return false;
+		if (fromIndex < 0) fromIndex = Math.max(0, collection.length + fromIndex);
+		return collection.includes(target, fromIndex);
 	}
-	if (Array.isArray(source)) return source.includes(target, fromIndex);
-	if (isArrayLike(source)) {
-		if (fromIndex < 0) fromIndex = Math.max(0, source.length + fromIndex);
-		for (let i = fromIndex; i < source.length; i++) if (eq(source[i], target)) return true;
+	if (Array.isArray(collection)) return collection.includes(target, fromIndex);
+	if (isArrayLike(collection)) {
+		if (fromIndex < 0) fromIndex = Math.max(0, collection.length + fromIndex);
+		for (let i = fromIndex; i < collection.length; i++) if (eq(collection[i], target)) return true;
 		return false;
 	}
-	const keys = Object.keys(source);
+	const keys = Object.keys(collection);
 	if (fromIndex < 0) fromIndex = Math.max(0, keys.length + fromIndex);
-	for (let i = fromIndex; i < keys.length; i++) if (eq(Reflect.get(source, keys[i]), target)) return true;
+	for (let i = fromIndex; i < keys.length; i++) if (eq(Reflect.get(collection, keys[i]), target)) return true;
 	return false;
 }
 //#endregion

package/dist/compat/array/map.js

@@ -3,10 +3,10 @@ const require_range = require("../../math/range.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_iteratee = require("../util/iteratee.js");
 //#region src/compat/array/map.ts
-function map(collection, _iteratee) {
+function map(collection, _iteratee = require_identity.identity) {
 	if (!collection) return [];
-	const keys = require_isArrayLike.isArrayLike(collection) || Array.isArray(collection) ? require_range.range(0, collection.length) : Object.keys(collection);
-	const iteratee$1 = require_iteratee.iteratee(_iteratee ?? require_identity.identity);
+	const keys = require_isArrayLike.isArrayLike(collection) ? require_range.range(0, collection.length) : Object.keys(collection);
+	const iteratee$1 = require_iteratee.iteratee(_iteratee);
 	const result = new Array(keys.length);
 	for (let i = 0; i < keys.length; i++) {
 		const key = keys[i];

package/dist/compat/array/map.mjs

@@ -3,10 +3,10 @@ import { range } from "../../math/range.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { iteratee } from "../util/iteratee.mjs";
 //#region src/compat/array/map.ts
-function map(collection, _iteratee) {
+function map(collection, _iteratee = identity) {
 	if (!collection) return [];
-	const keys = isArrayLike(collection) || Array.isArray(collection) ? range(0, collection.length) : Object.keys(collection);
-	const iteratee$1 = iteratee(_iteratee ?? identity);
+	const keys = isArrayLike(collection) ? range(0, collection.length) : Object.keys(collection);
+	const iteratee$1 = iteratee(_iteratee);
 	const result = new Array(keys.length);
 	for (let i = 0; i < keys.length; i++) {
 		const key = keys[i];

package/dist/compat/array/orderBy.js

@@ -54,8 +54,7 @@ function orderBy(collection, criteria, orders, guard) {
 		}
 		if (typeof criterion === "function") return criterion(object);
 		if (Array.isArray(criterion)) return getValueByNestedPath(object, criterion);
-		if (typeof object === "object") return object[criterion];
-		return object;
+		return object[criterion];
 	};
 	const preparedCriteria = criteria.map((criterion) => {
 		if (Array.isArray(criterion) && criterion.length === 1) criterion = criterion[0];

package/dist/compat/array/orderBy.mjs

@@ -54,8 +54,7 @@ function orderBy(collection, criteria, orders, guard) {
 		}
 		if (typeof criterion === "function") return criterion(object);
 		if (Array.isArray(criterion)) return getValueByNestedPath(object, criterion);
-		if (typeof object === "object") return object[criterion];
-		return object;
+		return object[criterion];
 	};
 	const preparedCriteria = criteria.map((criterion) => {
 		if (Array.isArray(criterion) && criterion.length === 1) criterion = criterion[0];

package/dist/compat/array/takeRightWhile.js

@@ -1,8 +1,8 @@
 const require_identity = require("../../function/identity.js");
 const require_negate = require("../../function/negate.js");
 const require_toArray = require("../_internal/toArray.js");
+const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_iteratee = require("../util/iteratee.js");
-const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 //#region src/compat/array/takeRightWhile.ts
 /**
 * Creates a slice of the array with elements taken from the end while the specified predicate is satisfied.
@@ -50,7 +50,7 @@ const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 * console.log(result6); // []
 */
 function takeRightWhile(_array, predicate) {
-	if (!require_isArrayLikeObject.isArrayLikeObject(_array)) return [];
+	if (!require_isArrayLike.isArrayLike(_array)) return [];
 	const array = require_toArray.toArray(_array);
 	const index = array.findLastIndex(require_negate.negate(require_iteratee.iteratee(predicate ?? require_identity.identity)));
 	return array.slice(index + 1);

package/dist/compat/array/takeRightWhile.mjs

@@ -1,8 +1,8 @@
 import { identity } from "../../function/identity.mjs";
 import { negate } from "../../function/negate.mjs";
 import { toArray } from "../_internal/toArray.mjs";
+import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { iteratee } from "../util/iteratee.mjs";
-import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 //#region src/compat/array/takeRightWhile.ts
 /**
 * Creates a slice of the array with elements taken from the end while the specified predicate is satisfied.
@@ -50,7 +50,7 @@ import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 * console.log(result6); // []
 */
 function takeRightWhile(_array, predicate) {
-	if (!isArrayLikeObject(_array)) return [];
+	if (!isArrayLike(_array)) return [];
 	const array = toArray(_array);
 	const index = array.findLastIndex(negate(iteratee(predicate ?? identity)));
 	return array.slice(index + 1);

package/dist/compat/array/takeWhile.js

@@ -1,6 +1,6 @@
 const require_toArray = require("../_internal/toArray.js");
+const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_iteratee = require("../util/iteratee.js");
-const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 const require_identity = require("../function/identity.js");
 const require_negate = require("../function/negate.js");
 //#region src/compat/array/takeWhile.ts
@@ -50,7 +50,7 @@ const require_negate = require("../function/negate.js");
 * console.log(result6); // []
 **/
 function takeWhile(array, predicate) {
-	if (!require_isArrayLikeObject.isArrayLikeObject(array)) return [];
+	if (!require_isArrayLike.isArrayLike(array)) return [];
 	const _array = require_toArray.toArray(array);
 	const index = _array.findIndex(require_negate.negate(require_iteratee.iteratee(predicate ?? require_identity.identity)));
 	return index === -1 ? _array : _array.slice(0, index);

package/dist/compat/array/takeWhile.mjs

@@ -1,6 +1,6 @@
 import { toArray } from "../_internal/toArray.mjs";
+import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { iteratee } from "../util/iteratee.mjs";
-import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 import { identity } from "../function/identity.mjs";
 import { negate } from "../function/negate.mjs";
 //#region src/compat/array/takeWhile.ts
@@ -50,7 +50,7 @@ import { negate } from "../function/negate.mjs";
 * console.log(result6); // []
 **/
 function takeWhile(array, predicate) {
-	if (!isArrayLikeObject(array)) return [];
+	if (!isArrayLike(array)) return [];
 	const _array = toArray(array);
 	const index = _array.findIndex(negate(iteratee(predicate ?? identity)));
 	return index === -1 ? _array : _array.slice(0, index);

package/dist/compat/array/uniqBy.js

@@ -1,11 +1,11 @@
 const require_uniqBy = require("../../array/uniqBy.js");
 const require_ary = require("../../function/ary.js");
 const require_identity = require("../../function/identity.js");
+const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_iteratee = require("../util/iteratee.js");
-const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 //#region src/compat/array/uniqBy.ts
 function uniqBy(array, iteratee$1 = require_identity.identity) {
-	if (!require_isArrayLikeObject.isArrayLikeObject(array)) return [];
+	if (!require_isArrayLike.isArrayLike(array)) return [];
 	return require_uniqBy.uniqBy(Array.from(array), require_ary.ary(require_iteratee.iteratee(iteratee$1), 1));
 }
 //#endregion

package/dist/compat/array/uniqBy.mjs

@@ -1,11 +1,11 @@
 import { uniqBy as uniqBy$1 } from "../../array/uniqBy.mjs";
 import { ary } from "../../function/ary.mjs";
 import { identity } from "../../function/identity.mjs";
+import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { iteratee } from "../util/iteratee.mjs";
-import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 //#region src/compat/array/uniqBy.ts
 function uniqBy(array, iteratee$1 = identity) {
-	if (!isArrayLikeObject(array)) return [];
+	if (!isArrayLike(array)) return [];
 	return uniqBy$1(Array.from(array), ary(iteratee(iteratee$1), 1));
 }
 //#endregion

package/dist/compat/compat.js

@@ -54,8 +54,8 @@ const require_head = require("./array/head.js");
 require("./array/first.js");
 const require_flattenDepth = require("./array/flattenDepth.js");
 const require_map = require("./array/map.js");
-const require_flatMap = require("./array/flatMap.js");
 const require_flatMapDepth = require("./array/flatMapDepth.js");
+const require_flatMap = require("./array/flatMap.js");
 const require_flatMapDeep = require("./array/flatMapDeep.js");
 const require_flatten = require("./array/flatten.js");
 const require_flattenDeep = require("./array/flattenDeep.js");

package/dist/compat/compat.mjs

@@ -54,8 +54,8 @@ import { head } from "./array/head.mjs";
 import "./array/first.mjs";
 import { flattenDepth } from "./array/flattenDepth.mjs";
 import { map } from "./array/map.mjs";
-import { flatMap } from "./array/flatMap.mjs";
 import { flatMapDepth } from "./array/flatMapDepth.mjs";
+import { flatMap } from "./array/flatMap.mjs";
 import { flatMapDeep } from "./array/flatMapDeep.mjs";
 import { flatten } from "./array/flatten.mjs";
 import { flattenDeep } from "./array/flattenDeep.mjs";

package/dist/compat/index.js

@@ -54,8 +54,8 @@ const require_findLastIndex = require("./array/findLastIndex.js");
 const require_head = require("./array/head.js");
 const require_flattenDepth = require("./array/flattenDepth.js");
 const require_map = require("./array/map.js");
-const require_flatMap = require("./array/flatMap.js");
 const require_flatMapDepth = require("./array/flatMapDepth.js");
+const require_flatMap = require("./array/flatMap.js");
 const require_flatMapDeep = require("./array/flatMapDeep.js");
 const require_flatten = require("./array/flatten.js");
 const require_flattenDeep = require("./array/flattenDeep.js");

package/dist/compat/index.mjs

@@ -50,8 +50,8 @@ import { findLastIndex } from "./array/findLastIndex.mjs";
 import { head } from "./array/head.mjs";
 import { flattenDepth } from "./array/flattenDepth.mjs";
 import { map } from "./array/map.mjs";
-import { flatMap } from "./array/flatMap.mjs";
 import { flatMapDepth } from "./array/flatMapDepth.mjs";
+import { flatMap } from "./array/flatMap.mjs";
 import { flatMapDeep } from "./array/flatMapDeep.mjs";
 import { flatten } from "./array/flatten.mjs";
 import { flattenDeep } from "./array/flattenDeep.mjs";

package/dist/compat/util/toArray.js

@@ -1,3 +1,4 @@
+const require_isIterable = require("../../predicate/isIterable.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_isMap = require("../predicate/isMap.js");
 const require_isSet = require("../predicate/isSet.js");
@@ -17,7 +18,10 @@ const require_isSet = require("../predicate/isSet.js");
 function toArray(value) {
 	if (value == null) return [];
 	if (require_isArrayLike.isArrayLike(value) || require_isMap.isMap(value) || require_isSet.isSet(value)) return Array.from(value);
-	if (typeof value === "object") return Object.values(value);
+	if (typeof value === "object") {
+		if (require_isIterable.isIterable(value)) return Array.from(value);
+		return Object.values(value);
+	}
 	return [];
 }
 //#endregion

package/dist/compat/util/toArray.mjs

@@ -1,3 +1,4 @@
+import { isIterable } from "../../predicate/isIterable.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { isMap } from "../predicate/isMap.mjs";
 import { isSet } from "../predicate/isSet.mjs";
@@ -17,7 +18,10 @@ import { isSet } from "../predicate/isSet.mjs";
 function toArray(value) {
 	if (value == null) return [];
 	if (isArrayLike(value) || isMap(value) || isSet(value)) return Array.from(value);
-	if (typeof value === "object") return Object.values(value);
+	if (typeof value === "object") {
+		if (isIterable(value)) return Array.from(value);
+		return Object.values(value);
+	}
 	return [];
 }
 //#endregion

package/dist/compat/util/toString.js

@@ -17,8 +17,11 @@
 */
 function toString(value) {
 	if (value == null) return "";
+	return baseToString(value);
+}
+function baseToString(value) {
 	if (typeof value === "string") return value;
-	if (Array.isArray(value)) return value.map(toString).join(",");
+	if (Array.isArray(value)) return value.map(baseToString).join(",");
 	const result = String(value);
 	if (result === "0" && Object.is(Number(value), -0)) return "-0";
 	return result;

package/dist/compat/util/toString.mjs

@@ -17,8 +17,11 @@
 */
 function toString(value) {
 	if (value == null) return "";
+	return baseToString(value);
+}
+function baseToString(value) {
 	if (typeof value === "string") return value;
-	if (Array.isArray(value)) return value.map(toString).join(",");
+	if (Array.isArray(value)) return value.map(baseToString).join(",");
 	const result = String(value);
 	if (result === "0" && Object.is(Number(value), -0)) return "-0";
 	return result;

package/dist/function/retry.js

@@ -35,8 +35,10 @@ async function retry(func, _options) {
 		} catch (err) {
 			error = err;
 			if (!shouldRetry(err, attempts)) throw err;
-			const currentDelay = typeof delay$1 === "function" ? delay$1(attempts) : delay$1;
-			await require_delay.delay(currentDelay);
+			if (attempts < retries) {
+				const currentDelay = typeof delay$1 === "function" ? delay$1(attempts) : delay$1;
+				await require_delay.delay(currentDelay);
+			}
 		}
 	}
 	throw error;

package/dist/function/retry.mjs

@@ -35,7 +35,7 @@ async function retry(func, _options) {
 		} catch (err) {
 			error = err;
 			if (!shouldRetry(err, attempts)) throw err;
-			await delay(typeof delay$1 === "function" ? delay$1(attempts) : delay$1);
+			if (attempts < retries) await delay(typeof delay$1 === "function" ? delay$1(attempts) : delay$1);
 		}
 	}
 	throw error;

package/dist/index.d.mts

@@ -121,7 +121,10 @@ import { pick } from "./object/pick.mjs";
 import { pickBy } from "./object/pickBy.mjs";
 import { sortKeys } from "./object/sortKeys.mjs";
 import { toCamelCaseKeys } from "./object/toCamelCaseKeys.mjs";
+import { toConstantCaseKeys } from "./object/toConstantCaseKeys.mjs";
+import { toKebabCaseKeys } from "./object/toKebabCaseKeys.mjs";
 import { toMerged } from "./object/toMerged.mjs";
+import { toPascalCaseKeys } from "./object/toPascalCaseKeys.mjs";
 import { toSnakeCaseKeys } from "./object/toSnakeCaseKeys.mjs";
 import { isArrayBuffer } from "./predicate/isArrayBuffer.mjs";
 import { isBlob } from "./predicate/isBlob.mjs";
@@ -185,4 +188,4 @@ import { words } from "./string/words.mjs";
 import { attempt } from "./util/attempt.mjs";
 import { attemptAsync } from "./util/attemptAsync.mjs";
 import { invariant } from "./util/invariant.mjs";
-export { AbortError, DebounceOptions, DebouncedFunction, MemoizeCache, Mutex, Semaphore, ThrottleOptions, ThrottledFunction, TimeoutError, after, allKeyed, ary, invariant as assert, asyncNoop, at, attempt, attemptAsync, before, camelCase, capitalize, cartesianProduct, chunk, chunkBy, clamp, clone, cloneDeep, cloneDeepWith, combinations, compact, constantCase, countBy, curry, curryRight, debounce, deburr, delay, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, escape, escapeRegExp, fill, filterAsync, findKey, flatMap, flatMapAsync, flatMapDeep, flatten, flattenDeep, flattenObject, flow, flowRight, forEachAsync, forEachRight, groupBy, head, identity, inRange, initial, intersection, intersectionBy, intersectionWith, invariant, invert, isArrayBuffer, isBlob, isBoolean, isBrowser, isBuffer, isDate, isEmptyObject, isEqual, isEqualWith, isError, isFile, isFunction, isIterable, isJSON, isJSONArray, isJSONObject, isJSONValue, isLength, isMap, isNil, isNode, isNotNil, isNull, isNumber, isPlainObject, isPrimitive, isPromise, isRegExp, isSet, isString, isSubset, isSubsetWith, isSymbol, isTypedArray, isUndefined, isWeakMap, isWeakSet, kebabCase, keyBy, last, limitAsync, lowerCase, lowerFirst, mapAsync, mapKeys, mapValues, maxBy, mean, meanBy, median, medianBy, memoize, merge, mergeWith, minBy, negate, noop, omit, omitBy, once, orderBy, pad, partial, partialRight, partition, pascalCase, percentile, pick, pickBy, pull, pullAt, random, randomInt, range, rangeRight, reduceAsync, remove, rest, retry, reverseString, round, sample, sampleSize, shuffle, snakeCase, sortBy, sortKeys, spread, startCase, sum, sumBy, tail, take, takeRight, takeRightWhile, takeWhile, throttle, timeout, toCamelCaseKeys, toFilled, toMerged, toSnakeCaseKeys, trim, trimEnd, trimStart, unary, unescape, union, unionBy, unionWith, uniq, uniqBy, uniqWith, unzip, unzipWith, upperCase, upperFirst, windowed, withTimeout, without, words, xor, xorBy, xorWith, zip, zipObject, zipWith };
+export { AbortError, DebounceOptions, DebouncedFunction, MemoizeCache, Mutex, Semaphore, ThrottleOptions, ThrottledFunction, TimeoutError, after, allKeyed, ary, invariant as assert, asyncNoop, at, attempt, attemptAsync, before, camelCase, capitalize, cartesianProduct, chunk, chunkBy, clamp, clone, cloneDeep, cloneDeepWith, combinations, compact, constantCase, countBy, curry, curryRight, debounce, deburr, delay, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, escape, escapeRegExp, fill, filterAsync, findKey, flatMap, flatMapAsync, flatMapDeep, flatten, flattenDeep, flattenObject, flow, flowRight, forEachAsync, forEachRight, groupBy, head, identity, inRange, initial, intersection, intersectionBy, intersectionWith, invariant, invert, isArrayBuffer, isBlob, isBoolean, isBrowser, isBuffer, isDate, isEmptyObject, isEqual, isEqualWith, isError, isFile, isFunction, isIterable, isJSON, isJSONArray, isJSONObject, isJSONValue, isLength, isMap, isNil, isNode, isNotNil, isNull, isNumber, isPlainObject, isPrimitive, isPromise, isRegExp, isSet, isString, isSubset, isSubsetWith, isSymbol, isTypedArray, isUndefined, isWeakMap, isWeakSet, kebabCase, keyBy, last, limitAsync, lowerCase, lowerFirst, mapAsync, mapKeys, mapValues, maxBy, mean, meanBy, median, medianBy, memoize, merge, mergeWith, minBy, negate, noop, omit, omitBy, once, orderBy, pad, partial, partialRight, partition, pascalCase, percentile, pick, pickBy, pull, pullAt, random, randomInt, range, rangeRight, reduceAsync, remove, rest, retry, reverseString, round, sample, sampleSize, shuffle, snakeCase, sortBy, sortKeys, spread, startCase, sum, sumBy, tail, take, takeRight, takeRightWhile, takeWhile, throttle, timeout, toCamelCaseKeys, toConstantCaseKeys, toFilled, toKebabCaseKeys, toMerged, toPascalCaseKeys, toSnakeCaseKeys, trim, trimEnd, trimStart, unary, unescape, union, unionBy, unionWith, uniq, uniqBy, uniqWith, unzip, unzipWith, upperCase, upperFirst, windowed, withTimeout, without, words, xor, xorBy, xorWith, zip, zipObject, zipWith };