es-toolkit 1.49.0 → 1.50.0

package/dist/compat/array/findLast.js

@@ -6,9 +6,9 @@ const require_toInteger = require("../util/toInteger.js");
 * Finds the last item in an object that has a specific property, where the property name is provided as a PropertyKey.
 *
 * @template T
-* @param source - The source array or object to search through.
-* @param doesMatch - 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 source.length-1 for arrays or Object.keys(source).length-1 for objects.
+* @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 [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.
 *
 * @example
@@ -17,23 +17,23 @@ const require_toInteger = require("../util/toInteger.js");
 * const result = findLast(obj, 'name');
 * console.log(result); // { id: 3, name: 'Bob' }
 */
-function findLast(source, _doesMatch = require_identity.identity, fromIndex) {
-	if (!source) return;
-	const length = Array.isArray(source) ? source.length : Object.keys(source).length;
+function findLast(collection, predicate = 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(_doesMatch);
-	if (!Array.isArray(source)) {
-		const keys = Object.keys(source);
+	const doesMatch = require_iteratee.iteratee(predicate);
+	if (!Array.isArray(collection)) {
+		const keys = Object.keys(collection);
 		for (let i = fromIndex; i >= 0; i--) {
 			const key = keys[i];
-			const value = source[key];
-			if (doesMatch(value, key, source)) return value;
+			const value = collection[key];
+			if (doesMatch(value, key, collection)) return value;
 		}
 		return;
 	}
-	return source.slice(0, fromIndex + 1).findLast(doesMatch);
+	return collection.slice(0, fromIndex + 1).findLast(doesMatch);
 }
 //#endregion
 exports.findLast = findLast;

package/dist/compat/array/findLast.mjs

@@ -6,9 +6,9 @@ import { toInteger } from "../util/toInteger.mjs";
 * Finds the last item in an object that has a specific property, where the property name is provided as a PropertyKey.
 *
 * @template T
-* @param source - The source array or object to search through.
-* @param doesMatch - 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 source.length-1 for arrays or Object.keys(source).length-1 for objects.
+* @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 [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.
 *
 * @example
@@ -17,23 +17,23 @@ import { toInteger } from "../util/toInteger.mjs";
 * const result = findLast(obj, 'name');
 * console.log(result); // { id: 3, name: 'Bob' }
 */
-function findLast(source, _doesMatch = identity, fromIndex) {
-	if (!source) return;
-	const length = Array.isArray(source) ? source.length : Object.keys(source).length;
+function findLast(collection, predicate = 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(_doesMatch);
-	if (!Array.isArray(source)) {
-		const keys = Object.keys(source);
+	const doesMatch = iteratee(predicate);
+	if (!Array.isArray(collection)) {
+		const keys = Object.keys(collection);
 		for (let i = fromIndex; i >= 0; i--) {
 			const key = keys[i];
-			const value = source[key];
-			if (doesMatch(value, key, source)) return value;
+			const value = collection[key];
+			if (doesMatch(value, key, collection)) return value;
 		}
 		return;
 	}
-	return source.slice(0, fromIndex + 1).findLast(doesMatch);
+	return collection.slice(0, fromIndex + 1).findLast(doesMatch);
 }
 //#endregion
 export { findLast };

package/dist/compat/array/findLastIndex.js

@@ -20,6 +20,7 @@ const require_matchesProperty = require("../predicate/matchesProperty.js");
 */
 function findLastIndex(arr, doesMatch = require_identity.identity, fromIndex = arr ? arr.length - 1 : 0) {
 	if (!arr) return -1;
+	if (Number.isNaN(fromIndex)) fromIndex = 0;
 	if (fromIndex < 0) fromIndex = Math.max(arr.length + fromIndex, 0);
 	else fromIndex = Math.min(fromIndex, arr.length - 1);
 	const subArray = require_toArray.toArray(arr).slice(0, fromIndex + 1);

package/dist/compat/array/findLastIndex.mjs

@@ -20,6 +20,7 @@ import { matchesProperty } from "../predicate/matchesProperty.mjs";
 */
 function findLastIndex(arr, doesMatch = identity, fromIndex = arr ? arr.length - 1 : 0) {
 	if (!arr) return -1;
+	if (Number.isNaN(fromIndex)) fromIndex = 0;
 	if (fromIndex < 0) fromIndex = Math.max(arr.length + fromIndex, 0);
 	else fromIndex = Math.min(fromIndex, arr.length - 1);
 	const subArray = toArray(arr).slice(0, fromIndex + 1);

package/dist/compat/array/flatMap.js

@@ -1,3 +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");
@@ -7,14 +8,14 @@ const require_map = require("./map.js");
 *
 * @template R
 * @param collection - The collection to iterate over.
-* @param [iteratee] - The function invoked per iteration.
+* @param [iteratee=identity] - The function invoked per iteration.
 * @returns Returns the new flattened array.
 *
 * @example
 * flatMap([1, 2], n => [n, n * 2]);
 * // => [1, 2, 2, 4]
 */
-function flatMap(collection, iteratee) {
+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);

package/dist/compat/array/flatMap.mjs

@@ -1,3 +1,4 @@
+import { identity } from "../../function/identity.mjs";
 import { isNil } from "../../predicate/isNil.mjs";
 import { flattenDepth } from "./flattenDepth.mjs";
 import { map } from "./map.mjs";
@@ -7,14 +8,14 @@ import { map } from "./map.mjs";
 *
 * @template R
 * @param collection - The collection to iterate over.
-* @param [iteratee] - The function invoked per iteration.
+* @param [iteratee=identity] - The function invoked per iteration.
 * @returns Returns the new flattened array.
 *
 * @example
 * flatMap([1, 2], n => [n, n * 2]);
 * // => [1, 2, 2, 4]
 */
-function flatMap(collection, iteratee) {
+function flatMap(collection, iteratee = identity) {
 	if (isNil(collection)) return [];
 	return flattenDepth(isNil(iteratee) ? map(collection) : map(collection, iteratee), 1);
 }

package/dist/compat/array/flatMapDepth.js

@@ -1,6 +1,6 @@
 const require_identity = require("../../function/identity.js");
 const require_iteratee = require("../util/iteratee.js");
-const require_flatten = require("./flatten.js");
+const require_flattenDepth = require("./flattenDepth.js");
 const require_map = require("./map.js");
 //#region src/compat/array/flatMapDepth.ts
 /**
@@ -20,7 +20,7 @@ function flatMapDepth(collection, iteratee$1 = require_identity.identity, depth
 	if (collection == null) return [];
 	const iterateeFn = require_iteratee.iteratee(iteratee$1);
 	const mapped = require_map.map(collection, iterateeFn);
-	return require_flatten.flatten(mapped, depth);
+	return require_flattenDepth.flattenDepth(mapped, depth);
 }
 //#endregion
 exports.flatMapDepth = flatMapDepth;

package/dist/compat/array/flatMapDepth.mjs

@@ -1,6 +1,6 @@
 import { identity } from "../../function/identity.mjs";
 import { iteratee } from "../util/iteratee.mjs";
-import { flatten } from "./flatten.mjs";
+import { flattenDepth } from "./flattenDepth.mjs";
 import { map } from "./map.mjs";
 //#region src/compat/array/flatMapDepth.ts
 /**
@@ -18,7 +18,7 @@ import { map } from "./map.mjs";
 */
 function flatMapDepth(collection, iteratee$1 = identity, depth = 1) {
 	if (collection == null) return [];
-	return flatten(map(collection, iteratee(iteratee$1)), depth);
+	return flattenDepth(map(collection, iteratee(iteratee$1)), depth);
 }
 //#endregion
 export { flatMapDepth };

package/dist/compat/array/flatten.d.mts

@@ -3,14 +3,13 @@
  * Flattens array up to depth times.
  *
  * @template T
- * @param value - The array to flatten.
- * @param depth - The maximum recursion depth.
+ * @param array - The array to flatten.
  * @returns Returns the new flattened array.
  *
  * @example
- * flatten([1, [2, [3, [4]], 5]], 2);
- * // => [1, 2, 3, [4], 5]
+ * flatten([1, [2, [3, [4]], 5]]);
+ * // => [1, 2, [3, [4]], 5]
  */
-declare function flatten<T>(value: ArrayLike<T | readonly T[]> | null | undefined): T[];
+declare function flatten<T>(array: ArrayLike<T | readonly T[]> | null | undefined): T[];
 //#endregion
 export { flatten };

package/dist/compat/array/flatten.d.ts

@@ -3,14 +3,13 @@
  * Flattens array up to depth times.
  *
  * @template T
- * @param value - The array to flatten.
- * @param depth - The maximum recursion depth.
+ * @param array - The array to flatten.
  * @returns Returns the new flattened array.
  *
  * @example
- * flatten([1, [2, [3, [4]], 5]], 2);
- * // => [1, 2, 3, [4], 5]
+ * flatten([1, [2, [3, [4]], 5]]);
+ * // => [1, 2, [3, [4]], 5]
  */
-declare function flatten<T>(value: ArrayLike<T | readonly T[]> | null | undefined): T[];
+declare function flatten<T>(array: ArrayLike<T | readonly T[]> | null | undefined): T[];
 //#endregion
 export { flatten };

package/dist/compat/array/flatten.js

@@ -1,19 +1,18 @@
-const require_isArrayLike = require("../predicate/isArrayLike.js");
+const require_flattenDepth = require("./flattenDepth.js");
 //#region src/compat/array/flatten.ts
-function flatten(value, depth = 1) {
-	const result = [];
-	const flooredDepth = Math.floor(depth);
-	if (!require_isArrayLike.isArrayLike(value)) return result;
-	const recursive = (arr, currentDepth) => {
-		for (let i = 0; i < arr.length; i++) {
-			const item = arr[i];
-			if (currentDepth < flooredDepth && (Array.isArray(item) || Boolean(item?.[Symbol.isConcatSpreadable]) || item !== null && typeof item === "object" && Object.prototype.toString.call(item) === "[object Arguments]")) if (Array.isArray(item)) recursive(item, currentDepth + 1);
-			else recursive(Array.from(item), currentDepth + 1);
-			else result.push(item);
-		}
-	};
-	recursive(Array.from(value), 0);
-	return result;
+/**
+* Flattens array up to depth times.
+*
+* @template T
+* @param array - The array to flatten.
+* @returns Returns the new flattened array.
+*
+* @example
+* flatten([1, [2, [3, [4]], 5]]);
+* // => [1, 2, [3, [4]], 5]
+*/
+function flatten(array) {
+	return require_flattenDepth.flattenDepth(array, 1);
 }
 //#endregion
 exports.flatten = flatten;

package/dist/compat/array/flatten.mjs

@@ -1,19 +1,18 @@
-import { isArrayLike } from "../predicate/isArrayLike.mjs";
+import { flattenDepth } from "./flattenDepth.mjs";
 //#region src/compat/array/flatten.ts
-function flatten(value, depth = 1) {
-	const result = [];
-	const flooredDepth = Math.floor(depth);
-	if (!isArrayLike(value)) return result;
-	const recursive = (arr, currentDepth) => {
-		for (let i = 0; i < arr.length; i++) {
-			const item = arr[i];
-			if (currentDepth < flooredDepth && (Array.isArray(item) || Boolean(item?.[Symbol.isConcatSpreadable]) || item !== null && typeof item === "object" && Object.prototype.toString.call(item) === "[object Arguments]")) if (Array.isArray(item)) recursive(item, currentDepth + 1);
-			else recursive(Array.from(item), currentDepth + 1);
-			else result.push(item);
-		}
-	};
-	recursive(Array.from(value), 0);
-	return result;
+/**
+* Flattens array up to depth times.
+*
+* @template T
+* @param array - The array to flatten.
+* @returns Returns the new flattened array.
+*
+* @example
+* flatten([1, [2, [3, [4]], 5]]);
+* // => [1, 2, [3, [4]], 5]
+*/
+function flatten(array) {
+	return flattenDepth(array, 1);
 }
 //#endregion
 export { flatten };

package/dist/compat/array/flattenDeep.d.mts

@@ -12,6 +12,6 @@ import { ListOfRecursiveArraysOrValues } from "../_internal/ListOfRecursiveArray
  * flattenDeep([1, [2, [3, [4]], 5]]);
  * // => [1, 2, 3, 4, 5]
  */
-declare function flattenDeep<T>(value: ListOfRecursiveArraysOrValues<T> | null | undefined): Array<T extends string ? T : T extends ArrayLike<any> ? never : T>;
+declare function flattenDeep<T>(array: ListOfRecursiveArraysOrValues<T> | null | undefined): Array<T extends string ? T : T extends ArrayLike<any> ? never : T>;
 //#endregion
 export { flattenDeep };

package/dist/compat/array/flattenDeep.d.ts

@@ -12,6 +12,6 @@ import { ListOfRecursiveArraysOrValues } from "../_internal/ListOfRecursiveArray
  * flattenDeep([1, [2, [3, [4]], 5]]);
  * // => [1, 2, 3, 4, 5]
  */
-declare function flattenDeep<T>(value: ListOfRecursiveArraysOrValues<T> | null | undefined): Array<T extends string ? T : T extends ArrayLike<any> ? never : T>;
+declare function flattenDeep<T>(array: ListOfRecursiveArraysOrValues<T> | null | undefined): Array<T extends string ? T : T extends ArrayLike<any> ? never : T>;
 //#endregion
 export { flattenDeep };

package/dist/compat/array/flattenDeep.js

@@ -11,8 +11,8 @@ const require_flattenDepth = require("./flattenDepth.js");
 * flattenDeep([1, [2, [3, [4]], 5]]);
 * // => [1, 2, 3, 4, 5]
 */
-function flattenDeep(value) {
-	return require_flattenDepth.flattenDepth(value, Infinity);
+function flattenDeep(array) {
+	return require_flattenDepth.flattenDepth(array, Infinity);
 }
 //#endregion
 exports.flattenDeep = flattenDeep;

package/dist/compat/array/flattenDeep.mjs

@@ -11,8 +11,8 @@ import { flattenDepth } from "./flattenDepth.mjs";
 * flattenDeep([1, [2, [3, [4]], 5]]);
 * // => [1, 2, 3, 4, 5]
 */
-function flattenDeep(value) {
-	return flattenDepth(value, Infinity);
+function flattenDeep(array) {
+	return flattenDepth(array, Infinity);
 }
 //#endregion
 export { flattenDeep };

package/dist/compat/array/flattenDepth.js

@@ -1,4 +1,6 @@
-const require_flatten = require("./flatten.js");
+const require_isArray = require("../predicate/isArray.js");
+const require_isArrayLike = require("../predicate/isArrayLike.js");
+const require_isArguments = require("../predicate/isArguments.js");
 //#region src/compat/array/flattenDepth.ts
 /**
 * Recursively flattens array up to depth times.
@@ -18,7 +20,21 @@ const require_flatten = require("./flatten.js");
 * // => [1, 2, 3, [4], 5]
 */
 function flattenDepth(array, depth = 1) {
-	return require_flatten.flatten(array, depth);
+	if (!require_isArrayLike.isArrayLike(array)) return [];
+	const result = [];
+	const flooredDepth = Math.floor(depth);
+	const recursive = (arr, currentDepth) => {
+		for (let i = 0; i < arr.length; i++) {
+			const item = arr[i];
+			if (isFlattenable(item) && currentDepth < flooredDepth) recursive(item, currentDepth + 1);
+			else result.push(item);
+		}
+	};
+	recursive(Array.from(array), 0);
+	return result;
+}
+function isFlattenable(value) {
+	return require_isArray.isArray(value) || require_isArguments.isArguments(value) || Boolean(value && value[Symbol.isConcatSpreadable]);
 }
 //#endregion
 exports.flattenDepth = flattenDepth;

package/dist/compat/array/flattenDepth.mjs

@@ -1,4 +1,6 @@
-import { flatten } from "./flatten.mjs";
+import { isArray } from "../predicate/isArray.mjs";
+import { isArrayLike } from "../predicate/isArrayLike.mjs";
+import { isArguments } from "../predicate/isArguments.mjs";
 //#region src/compat/array/flattenDepth.ts
 /**
 * Recursively flattens array up to depth times.
@@ -18,7 +20,21 @@ import { flatten } from "./flatten.mjs";
 * // => [1, 2, 3, [4], 5]
 */
 function flattenDepth(array, depth = 1) {
-	return flatten(array, depth);
+	if (!isArrayLike(array)) return [];
+	const result = [];
+	const flooredDepth = Math.floor(depth);
+	const recursive = (arr, currentDepth) => {
+		for (let i = 0; i < arr.length; i++) {
+			const item = arr[i];
+			if (isFlattenable(item) && currentDepth < flooredDepth) recursive(item, currentDepth + 1);
+			else result.push(item);
+		}
+	};
+	recursive(Array.from(array), 0);
+	return result;
+}
+function isFlattenable(value) {
+	return isArray(value) || isArguments(value) || Boolean(value && value[Symbol.isConcatSpreadable]);
 }
 //#endregion
 export { flattenDepth };

package/dist/compat/array/groupBy.js

@@ -1,5 +1,6 @@
 const require_groupBy = require("../../array/groupBy.js");
 const require_identity = require("../../function/identity.js");
+const require_toArray = require("../_internal/toArray.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_iteratee = require("../util/iteratee.js");
 //#region src/compat/array/groupBy.ts
@@ -13,7 +14,7 @@ const require_iteratee = require("../util/iteratee.js");
 * @template T - The type of elements in the array or values in the object.
 * @template K - The type of keys.
 * @param source - The collection to group.
-* @param [_getKeyFromItem] - The iteratee to transform keys.
+* @param [_getKeyFromItem=identity] - The iteratee to transform keys.
 *   - If a function is provided, it's invoked for each element in the collection.
 *   - If a property name (string) is provided, that property of each element is used as the key.
 *   - If a property-value pair (array) is provided, elements with matching property values are used.
@@ -33,10 +34,10 @@ const require_iteratee = require("../util/iteratee.js");
 * const result = groupBy(array, 'length');
 * // => { 3: ['one', 'two'], 5: ['three'] }
 */
-function groupBy(source, _getKeyFromItem) {
+function groupBy(source, _getKeyFromItem = require_identity.identity) {
 	if (source == null) return {};
-	const items = require_isArrayLike.isArrayLike(source) ? Array.from(source) : Object.values(source);
-	const getKeyFromItem = require_iteratee.iteratee(_getKeyFromItem ?? require_identity.identity);
+	const items = require_isArrayLike.isArrayLike(source) ? require_toArray.toArray(source) : Object.values(source);
+	const getKeyFromItem = require_iteratee.iteratee(_getKeyFromItem);
 	return require_groupBy.groupBy(items, getKeyFromItem);
 }
 //#endregion

package/dist/compat/array/groupBy.mjs

@@ -1,5 +1,6 @@
 import { groupBy as groupBy$1 } from "../../array/groupBy.mjs";
 import { identity } from "../../function/identity.mjs";
+import { toArray } from "../_internal/toArray.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { iteratee } from "../util/iteratee.mjs";
 //#region src/compat/array/groupBy.ts
@@ -13,7 +14,7 @@ import { iteratee } from "../util/iteratee.mjs";
 * @template T - The type of elements in the array or values in the object.
 * @template K - The type of keys.
 * @param source - The collection to group.
-* @param [_getKeyFromItem] - The iteratee to transform keys.
+* @param [_getKeyFromItem=identity] - The iteratee to transform keys.
 *   - If a function is provided, it's invoked for each element in the collection.
 *   - If a property name (string) is provided, that property of each element is used as the key.
 *   - If a property-value pair (array) is provided, elements with matching property values are used.
@@ -33,9 +34,9 @@ import { iteratee } from "../util/iteratee.mjs";
 * const result = groupBy(array, 'length');
 * // => { 3: ['one', 'two'], 5: ['three'] }
 */
-function groupBy(source, _getKeyFromItem) {
+function groupBy(source, _getKeyFromItem = identity) {
 	if (source == null) return {};
-	return groupBy$1(isArrayLike(source) ? Array.from(source) : Object.values(source), iteratee(_getKeyFromItem ?? identity));
+	return groupBy$1(isArrayLike(source) ? toArray(source) : Object.values(source), iteratee(_getKeyFromItem));
 }
 //#endregion
 export { groupBy };

package/dist/compat/array/includes.js

@@ -1,5 +1,5 @@
-const require_isEqualsSameValueZero = require("../../_internal/isEqualsSameValueZero.js");
-require("../util/eq.js");
+const require_eq = require("../util/eq.js");
+const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_toInteger = require("../util/toInteger.js");
 const require_isString = require("../predicate/isString.js");
 //#region src/compat/array/includes.ts
@@ -29,11 +29,16 @@ function includes(source, target, fromIndex, guard) {
 		return source.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;
+		return false;
+	}
 	const keys = Object.keys(source);
 	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]);
-		if (require_isEqualsSameValueZero.isEqualsSameValueZero(value, target)) return true;
+		if (require_eq.eq(value, target)) return true;
 	}
 	return false;
 }

package/dist/compat/array/includes.mjs

@@ -1,5 +1,5 @@
-import { isEqualsSameValueZero } from "../../_internal/isEqualsSameValueZero.mjs";
-import "../util/eq.mjs";
+import { eq } from "../util/eq.mjs";
+import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { toInteger } from "../util/toInteger.mjs";
 import { isString } from "../predicate/isString.mjs";
 //#region src/compat/array/includes.ts
@@ -29,9 +29,14 @@ function includes(source, target, fromIndex, guard) {
 		return source.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;
+		return false;
+	}
 	const keys = Object.keys(source);
 	if (fromIndex < 0) fromIndex = Math.max(0, keys.length + fromIndex);
-	for (let i = fromIndex; i < keys.length; i++) if (isEqualsSameValueZero(Reflect.get(source, keys[i]), target)) return true;
+	for (let i = fromIndex; i < keys.length; i++) if (eq(Reflect.get(source, keys[i]), target)) return true;
 	return false;
 }
 //#endregion

package/dist/compat/array/intersectionBy.js

@@ -1,7 +1,9 @@
 const require_intersectionBy = require("../../array/intersectionBy.js");
 const require_last = require("../../array/last.js");
 const require_uniq = require("../../array/uniq.js");
+const require_uniqBy = require("../../array/uniqBy.js");
 const require_identity = require("../../function/identity.js");
+const require_toArray = require("../_internal/toArray.js");
 const require_property = require("../object/property.js");
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 //#region src/compat/array/intersectionBy.ts
@@ -36,17 +38,22 @@ const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 function intersectionBy(array, ...values) {
 	if (!require_isArrayLikeObject.isArrayLikeObject(array)) return [];
 	const lastValue = require_last.last(values);
-	if (lastValue === void 0) return Array.from(array);
-	let result = require_uniq.uniq(Array.from(array));
 	const count = require_isArrayLikeObject.isArrayLikeObject(lastValue) ? values.length : values.length - 1;
+	const iteratee = getIteratee(lastValue);
+	if (count <= 0) return require_uniqBy.uniqBy(require_toArray.toArray(array), iteratee ?? require_identity.identity);
+	let result = require_uniq.uniq(require_toArray.toArray(array));
 	for (let i = 0; i < count; ++i) {
 		const value = values[i];
 		if (!require_isArrayLikeObject.isArrayLikeObject(value)) return [];
-		if (require_isArrayLikeObject.isArrayLikeObject(lastValue)) result = require_intersectionBy.intersectionBy(result, Array.from(value), require_identity.identity);
-		else if (typeof lastValue === "function") result = require_intersectionBy.intersectionBy(result, Array.from(value), (value) => lastValue(value));
-		else if (typeof lastValue === "string") result = require_intersectionBy.intersectionBy(result, Array.from(value), require_property.property(lastValue));
+		if (iteratee) result = require_intersectionBy.intersectionBy(result, require_toArray.toArray(value), iteratee);
 	}
 	return result;
 }
+function getIteratee(value) {
+	if (require_isArrayLikeObject.isArrayLikeObject(value)) return require_identity.identity;
+	if (typeof value === "function") return (item) => value(item);
+	if (typeof value === "string") return require_property.property(value);
+	return null;
+}
 //#endregion
 exports.intersectionBy = intersectionBy;

package/dist/compat/array/intersectionBy.mjs

@@ -1,7 +1,9 @@
 import { intersectionBy as intersectionBy$1 } from "../../array/intersectionBy.mjs";
 import { last } from "../../array/last.mjs";
 import { uniq } from "../../array/uniq.mjs";
+import { uniqBy } from "../../array/uniqBy.mjs";
 import { identity } from "../../function/identity.mjs";
+import { toArray } from "../_internal/toArray.mjs";
 import { property } from "../object/property.mjs";
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 //#region src/compat/array/intersectionBy.ts
@@ -36,17 +38,22 @@ import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 function intersectionBy(array, ...values) {
 	if (!isArrayLikeObject(array)) return [];
 	const lastValue = last(values);
-	if (lastValue === void 0) return Array.from(array);
-	let result = uniq(Array.from(array));
 	const count = isArrayLikeObject(lastValue) ? values.length : values.length - 1;
+	const iteratee = getIteratee(lastValue);
+	if (count <= 0) return uniqBy(toArray(array), iteratee ?? identity);
+	let result = uniq(toArray(array));
 	for (let i = 0; i < count; ++i) {
 		const value = values[i];
 		if (!isArrayLikeObject(value)) return [];
-		if (isArrayLikeObject(lastValue)) result = intersectionBy$1(result, Array.from(value), identity);
-		else if (typeof lastValue === "function") result = intersectionBy$1(result, Array.from(value), (value) => lastValue(value));
-		else if (typeof lastValue === "string") result = intersectionBy$1(result, Array.from(value), property(lastValue));
+		if (iteratee) result = intersectionBy$1(result, toArray(value), iteratee);
 	}
 	return result;
 }
+function getIteratee(value) {
+	if (isArrayLikeObject(value)) return identity;
+	if (typeof value === "function") return (item) => value(item);
+	if (typeof value === "string") return property(value);
+	return null;
+}
 //#endregion
 export { intersectionBy };

package/dist/compat/array/intersectionWith.js

@@ -1,6 +1,5 @@
 const require_intersectionWith = require("../../array/intersectionWith.js");
-const require_isEqualsSameValueZero = require("../../_internal/isEqualsSameValueZero.js");
-require("../util/eq.js");
+const require_eq = require("../util/eq.js");
 const require_last = require("./last.js");
 const require_uniq = require("./uniq.js");
 //#region src/compat/array/intersectionWith.ts
@@ -21,7 +20,7 @@ const require_uniq = require("./uniq.js");
 function intersectionWith(firstArr, ...otherArrs) {
 	if (firstArr == null) return [];
 	const _comparator = require_last.last(otherArrs);
-	let comparator = require_isEqualsSameValueZero.isEqualsSameValueZero;
+	let comparator = require_eq.eq;
 	let uniq$1 = require_uniq.uniq;
 	if (typeof _comparator === "function") {
 		comparator = _comparator;

package/dist/compat/array/intersectionWith.mjs

@@ -1,6 +1,5 @@
 import { intersectionWith as intersectionWith$1 } from "../../array/intersectionWith.mjs";
-import { isEqualsSameValueZero } from "../../_internal/isEqualsSameValueZero.mjs";
-import "../util/eq.mjs";
+import { eq } from "../util/eq.mjs";
 import { last } from "./last.mjs";
 import { uniq } from "./uniq.mjs";
 //#region src/compat/array/intersectionWith.ts
@@ -21,7 +20,7 @@ import { uniq } from "./uniq.mjs";
 function intersectionWith(firstArr, ...otherArrs) {
 	if (firstArr == null) return [];
 	const _comparator = last(otherArrs);
-	let comparator = isEqualsSameValueZero;
+	let comparator = eq;
 	let uniq$1 = uniq;
 	if (typeof _comparator === "function") {
 		comparator = _comparator;