es-toolkit 1.50.0 → 1.51.0-dev.2069

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/indexOf.js

@@ -1,4 +1,5 @@
 const require_isArrayLike = require("../predicate/isArrayLike.js");
+const require_toInteger = require("../util/toInteger.js");
 //#region src/compat/array/indexOf.ts
 /**
 * Finds the index of the first occurrence of a value in an array.
@@ -20,7 +21,7 @@ const require_isArrayLike = require("../predicate/isArrayLike.js");
 function indexOf(array, searchElement, fromIndex) {
 	if (!require_isArrayLike.isArrayLike(array)) return -1;
 	if (Number.isNaN(searchElement)) {
-		fromIndex = fromIndex ?? 0;
+		fromIndex = require_toInteger.toInteger(fromIndex ?? 0);
 		if (fromIndex < 0) fromIndex = Math.max(0, array.length + fromIndex);
 		for (let i = fromIndex; i < array.length; i++) if (Number.isNaN(array[i])) return i;
 		return -1;

package/dist/compat/array/indexOf.mjs

@@ -1,4 +1,5 @@
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
+import { toInteger } from "../util/toInteger.mjs";
 //#region src/compat/array/indexOf.ts
 /**
 * Finds the index of the first occurrence of a value in an array.
@@ -20,7 +21,7 @@ import { isArrayLike } from "../predicate/isArrayLike.mjs";
 function indexOf(array, searchElement, fromIndex) {
 	if (!isArrayLike(array)) return -1;
 	if (Number.isNaN(searchElement)) {
-		fromIndex = fromIndex ?? 0;
+		fromIndex = toInteger(fromIndex ?? 0);
 		if (fromIndex < 0) fromIndex = Math.max(0, array.length + fromIndex);
 		for (let i = fromIndex; i < array.length; i++) if (Number.isNaN(array[i])) return i;
 		return -1;

package/dist/compat/array/intersection.js

@@ -1,5 +1,6 @@
 const require_intersection = require("../../array/intersection.js");
 const require_uniq = require("../../array/uniq.js");
+const require_toArray = require("../_internal/toArray.js");
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 //#region src/compat/array/intersection.ts
 /**
@@ -22,11 +23,11 @@ const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 function intersection(...arrays) {
 	if (arrays.length === 0) return [];
 	if (!require_isArrayLikeObject.isArrayLikeObject(arrays[0])) return [];
-	let result = require_uniq.uniq(Array.from(arrays[0]));
+	let result = require_uniq.uniq(require_toArray.toArray(arrays[0]));
 	for (let i = 1; i < arrays.length; i++) {
 		const array = arrays[i];
 		if (!require_isArrayLikeObject.isArrayLikeObject(array)) return [];
-		result = require_intersection.intersection(result, Array.from(array));
+		result = require_intersection.intersection(result, require_toArray.toArray(array));
 	}
 	return result;
 }

package/dist/compat/array/intersection.mjs

@@ -1,5 +1,6 @@
 import { intersection as intersection$1 } from "../../array/intersection.mjs";
 import { uniq } from "../../array/uniq.mjs";
+import { toArray } from "../_internal/toArray.mjs";
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 //#region src/compat/array/intersection.ts
 /**
@@ -22,11 +23,11 @@ import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 function intersection(...arrays) {
 	if (arrays.length === 0) return [];
 	if (!isArrayLikeObject(arrays[0])) return [];
-	let result = uniq(Array.from(arrays[0]));
+	let result = uniq(toArray(arrays[0]));
 	for (let i = 1; i < arrays.length; i++) {
 		const array = arrays[i];
 		if (!isArrayLikeObject(array)) return [];
-		result = intersection$1(result, Array.from(array));
+		result = intersection$1(result, toArray(array));
 	}
 	return result;
 }

package/dist/compat/array/intersectionBy.js

@@ -4,7 +4,7 @@ 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_iteratee = require("../util/iteratee.js");
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 //#region src/compat/array/intersectionBy.ts
 /**
@@ -38,22 +38,18 @@ const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 function intersectionBy(array, ...values) {
 	if (!require_isArrayLikeObject.isArrayLikeObject(array)) return [];
 	const lastValue = require_last.last(values);
-	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);
+	const hasIteratee = !require_isArrayLikeObject.isArrayLikeObject(lastValue);
+	const count = hasIteratee ? values.length - 1 : values.length;
+	const mapper = hasIteratee ? require_iteratee.iteratee(lastValue) : require_identity.identity;
+	const iteratee$1 = typeof lastValue === "function" ? (item) => mapper(item) : mapper;
+	if (count <= 0) return require_uniqBy.uniqBy(require_toArray.toArray(array), iteratee$1);
 	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 (iteratee) result = require_intersectionBy.intersectionBy(result, require_toArray.toArray(value), iteratee);
+		result = require_intersectionBy.intersectionBy(result, require_toArray.toArray(value), iteratee$1);
 	}
 	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

@@ -4,7 +4,7 @@ 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 { iteratee } from "../util/iteratee.mjs";
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 //#region src/compat/array/intersectionBy.ts
 /**
@@ -38,22 +38,18 @@ import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 function intersectionBy(array, ...values) {
 	if (!isArrayLikeObject(array)) return [];
 	const lastValue = last(values);
-	const count = isArrayLikeObject(lastValue) ? values.length : values.length - 1;
-	const iteratee = getIteratee(lastValue);
-	if (count <= 0) return uniqBy(toArray(array), iteratee ?? identity);
+	const hasIteratee = !isArrayLikeObject(lastValue);
+	const count = hasIteratee ? values.length - 1 : values.length;
+	const mapper = hasIteratee ? iteratee(lastValue) : identity;
+	const iteratee$1 = typeof lastValue === "function" ? (item) => mapper(item) : mapper;
+	if (count <= 0) return uniqBy(toArray(array), iteratee$1);
 	let result = uniq(toArray(array));
 	for (let i = 0; i < count; ++i) {
 		const value = values[i];
 		if (!isArrayLikeObject(value)) return [];
-		if (iteratee) result = intersectionBy$1(result, toArray(value), iteratee);
+		result = intersectionBy$1(result, toArray(value), iteratee$1);
 	}
 	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,7 +1,9 @@
 const require_intersectionWith = require("../../array/intersectionWith.js");
+const require_uniq = require("../../array/uniq.js");
+const require_uniqWith = require("../../array/uniqWith.js");
 const require_eq = require("../util/eq.js");
+const require_toArray = require("../_internal/toArray.js");
 const require_last = require("./last.js");
-const require_uniq = require("./uniq.js");
 //#region src/compat/array/intersectionWith.ts
 /**
 * Returns the intersection of multiple arrays based on a custom equality function.
@@ -24,28 +26,14 @@ function intersectionWith(firstArr, ...otherArrs) {
 	let uniq$1 = require_uniq.uniq;
 	if (typeof _comparator === "function") {
 		comparator = _comparator;
-		uniq$1 = uniqPreserve0;
+		uniq$1 = (arr) => require_uniqWith.uniqWith(arr, comparator);
 		otherArrs.pop();
 	}
-	let result = uniq$1(Array.from(firstArr));
+	let result = uniq$1(require_toArray.toArray(firstArr));
 	for (let i = 0; i < otherArrs.length; ++i) {
 		const otherArr = otherArrs[i];
 		if (otherArr == null) return [];
-		result = require_intersectionWith.intersectionWith(result, Array.from(otherArr), comparator);
-	}
-	return result;
-}
-/**
-* This function is to preserve the sign of `-0`, which is a behavior in lodash.
-*/
-function uniqPreserve0(arr) {
-	const result = [];
-	const added = /* @__PURE__ */ new Set();
-	for (let i = 0; i < arr.length; i++) {
-		const item = arr[i];
-		if (added.has(item)) continue;
-		result.push(item);
-		added.add(item);
+		result = require_intersectionWith.intersectionWith(result, require_toArray.toArray(otherArr), comparator);
 	}
 	return result;
 }

package/dist/compat/array/intersectionWith.mjs

@@ -1,7 +1,9 @@
 import { intersectionWith as intersectionWith$1 } from "../../array/intersectionWith.mjs";
+import { uniq } from "../../array/uniq.mjs";
+import { uniqWith } from "../../array/uniqWith.mjs";
 import { eq } from "../util/eq.mjs";
+import { toArray } from "../_internal/toArray.mjs";
 import { last } from "./last.mjs";
-import { uniq } from "./uniq.mjs";
 //#region src/compat/array/intersectionWith.ts
 /**
 * Returns the intersection of multiple arrays based on a custom equality function.
@@ -24,28 +26,14 @@ function intersectionWith(firstArr, ...otherArrs) {
 	let uniq$1 = uniq;
 	if (typeof _comparator === "function") {
 		comparator = _comparator;
-		uniq$1 = uniqPreserve0;
+		uniq$1 = (arr) => uniqWith(arr, comparator);
 		otherArrs.pop();
 	}
-	let result = uniq$1(Array.from(firstArr));
+	let result = uniq$1(toArray(firstArr));
 	for (let i = 0; i < otherArrs.length; ++i) {
 		const otherArr = otherArrs[i];
 		if (otherArr == null) return [];
-		result = intersectionWith$1(result, Array.from(otherArr), comparator);
-	}
-	return result;
-}
-/**
-* This function is to preserve the sign of `-0`, which is a behavior in lodash.
-*/
-function uniqPreserve0(arr) {
-	const result = [];
-	const added = /* @__PURE__ */ new Set();
-	for (let i = 0; i < arr.length; i++) {
-		const item = arr[i];
-		if (added.has(item)) continue;
-		result.push(item);
-		added.add(item);
+		result = intersectionWith$1(result, toArray(otherArr), comparator);
 	}
 	return result;
 }

package/dist/compat/array/last.js

@@ -25,7 +25,7 @@ const require_isArrayLike = require("../predicate/isArrayLike.js");
 * // noElement will be undefined
 */
 function last(array) {
-	if (!require_isArrayLike.isArrayLike(array)) return;
+	if (!require_isArrayLike.isArrayLike(array) || array.length === 0) return;
 	return require_last.last(require_toArray.toArray(array));
 }
 //#endregion

package/dist/compat/array/last.mjs

@@ -25,7 +25,7 @@ import { isArrayLike } from "../predicate/isArrayLike.mjs";
 * // noElement will be undefined
 */
 function last(array) {
-	if (!isArrayLike(array)) return;
+	if (!isArrayLike(array) || array.length === 0) return;
 	return last$1(toArray(array));
 }
 //#endregion

package/dist/compat/array/lastIndexOf.js

@@ -8,8 +8,10 @@ function lastIndexOf(array, searchElement, fromIndex) {
 	if (fromIndex !== void 0) index = index < 0 ? Math.max(length + index, 0) : Math.min(index, length - 1);
 	if (Number.isNaN(searchElement)) {
 		for (let i = index; i >= 0; i--) if (Number.isNaN(array[i])) return i;
+		return -1;
 	}
-	return Array.from(array).lastIndexOf(searchElement, index);
+	for (let i = index; i >= 0; i--) if (array[i] === searchElement) return i;
+	return -1;
 }
 //#endregion
 exports.lastIndexOf = lastIndexOf;

package/dist/compat/array/lastIndexOf.mjs

@@ -8,8 +8,10 @@ function lastIndexOf(array, searchElement, fromIndex) {
 	if (fromIndex !== void 0) index = index < 0 ? Math.max(length + index, 0) : Math.min(index, length - 1);
 	if (Number.isNaN(searchElement)) {
 		for (let i = index; i >= 0; i--) if (Number.isNaN(array[i])) return i;
+		return -1;
 	}
-	return Array.from(array).lastIndexOf(searchElement, index);
+	for (let i = index; i >= 0; i--) if (array[i] === searchElement) return i;
+	return -1;
 }
 //#endregion
 export { lastIndexOf };

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

@@ -1,3 +1,4 @@
+const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_toPath = require("../util/toPath.js");
 const require_compareValues = require("../_internal/compareValues.js");
 const require_isKey = require("../_internal/isKey.js");
@@ -36,26 +37,27 @@ const require_isKey = require("../_internal/isKey.js");
 function orderBy(collection, criteria, orders, guard) {
 	if (collection == null) return [];
 	orders = guard ? void 0 : orders;
-	if (!Array.isArray(collection)) collection = Object.values(collection);
+	if (!Array.isArray(collection)) collection = require_isArrayLike.isArrayLike(collection) ? Array.from(collection) : Object.values(collection);
 	if (!Array.isArray(criteria)) criteria = criteria == null ? [null] : [criteria];
 	if (criteria.length === 0) criteria = [null];
 	if (!Array.isArray(orders)) orders = orders == null ? [] : [orders];
 	orders = orders.map((order) => String(order));
 	const getValueByNestedPath = (object, path) => {
 		let target = object;
-		for (let i = 0; i < path.length && target != null; ++i) target = target[path[i]];
-		return target;
+		let index = 0;
+		for (; index < path.length && target != null; ++index) target = target[path[index]];
+		return index > 0 && index === path.length ? target : void 0;
 	};
 	const getValueByCriterion = (criterion, object) => {
-		if (object == null || criterion == null) return object;
+		if (criterion == null) return object;
+		if (object == null) return;
 		if (typeof criterion === "object" && "key" in criterion) {
 			if (Object.hasOwn(object, criterion.key)) return object[criterion.key];
 			return getValueByNestedPath(object, criterion.path);
 		}
 		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

@@ -1,3 +1,4 @@
+import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { toPath } from "../util/toPath.mjs";
 import { compareValues } from "../_internal/compareValues.mjs";
 import { isKey } from "../_internal/isKey.mjs";
@@ -36,26 +37,27 @@ import { isKey } from "../_internal/isKey.mjs";
 function orderBy(collection, criteria, orders, guard) {
 	if (collection == null) return [];
 	orders = guard ? void 0 : orders;
-	if (!Array.isArray(collection)) collection = Object.values(collection);
+	if (!Array.isArray(collection)) collection = isArrayLike(collection) ? Array.from(collection) : Object.values(collection);
 	if (!Array.isArray(criteria)) criteria = criteria == null ? [null] : [criteria];
 	if (criteria.length === 0) criteria = [null];
 	if (!Array.isArray(orders)) orders = orders == null ? [] : [orders];
 	orders = orders.map((order) => String(order));
 	const getValueByNestedPath = (object, path) => {
 		let target = object;
-		for (let i = 0; i < path.length && target != null; ++i) target = target[path[i]];
-		return target;
+		let index = 0;
+		for (; index < path.length && target != null; ++index) target = target[path[index]];
+		return index > 0 && index === path.length ? target : void 0;
 	};
 	const getValueByCriterion = (criterion, object) => {
-		if (object == null || criterion == null) return object;
+		if (criterion == null) return object;
+		if (object == null) return;
 		if (typeof criterion === "object" && "key" in criterion) {
 			if (Object.hasOwn(object, criterion.key)) return object[criterion.key];
 			return getValueByNestedPath(object, criterion.path);
 		}
 		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/partition.js

@@ -8,7 +8,7 @@ const require_iteratee = require("../util/iteratee.js");
 * `predicate` returns falsy for. The predicate is invoked with one argument: (value).
 *
 * @template T
-* @param source - The array or object to iterate over.
+* @param collection - The array or object to iterate over.
 * @param [predicate=identity] - The function invoked per iteration.
 * @returns Returns the array of grouped elements.
 *
@@ -25,14 +25,14 @@ const require_iteratee = require("../util/iteratee.js");
 * partition([{ a: 1 }, { a: 2 }, { a: 3 }], ['a', 2]);
 * // => [[{ a: 2 }], [{ a: 1 }, { a: 3 }]]
 */
-function partition(source, predicate = require_identity.identity) {
-	if (!source) return [[], []];
-	const collection = require_isArrayLike.isArrayLike(source) ? source : Object.values(source);
+function partition(collection, predicate = require_identity.identity) {
+	if (!collection) return [[], []];
+	const values = require_isArrayLike.isArrayLike(collection) ? collection : Object.values(collection);
 	predicate = require_iteratee.iteratee(predicate);
 	const matched = [];
 	const unmatched = [];
-	for (let i = 0; i < collection.length; i++) {
-		const value = collection[i];
+	for (let i = 0; i < values.length; i++) {
+		const value = values[i];
 		if (predicate(value)) matched.push(value);
 		else unmatched.push(value);
 	}

package/dist/compat/array/partition.mjs

@@ -8,7 +8,7 @@ import { iteratee } from "../util/iteratee.mjs";
 * `predicate` returns falsy for. The predicate is invoked with one argument: (value).
 *
 * @template T
-* @param source - The array or object to iterate over.
+* @param collection - The array or object to iterate over.
 * @param [predicate=identity] - The function invoked per iteration.
 * @returns Returns the array of grouped elements.
 *
@@ -25,14 +25,14 @@ import { iteratee } from "../util/iteratee.mjs";
 * partition([{ a: 1 }, { a: 2 }, { a: 3 }], ['a', 2]);
 * // => [[{ a: 2 }], [{ a: 1 }, { a: 3 }]]
 */
-function partition(source, predicate = identity) {
-	if (!source) return [[], []];
-	const collection = isArrayLike(source) ? source : Object.values(source);
+function partition(collection, predicate = identity) {
+	if (!collection) return [[], []];
+	const values = isArrayLike(collection) ? collection : Object.values(collection);
 	predicate = iteratee(predicate);
 	const matched = [];
 	const unmatched = [];
-	for (let i = 0; i < collection.length; i++) {
-		const value = collection[i];
+	for (let i = 0; i < values.length; i++) {
+		const value = values[i];
 		if (predicate(value)) matched.push(value);
 		else unmatched.push(value);
 	}

package/dist/compat/array/pull.js

@@ -13,7 +13,7 @@ const require_pull = require("../../array/pull.js");
 *
 * @example
 * const numbers = [1, 2, 3, 4, 5, 2, 4];
-* pull(numbers, [2, 4]);
+* pull(numbers, 2, 4);
 * console.log(numbers); // [1, 3, 5]
 */
 function pull(arr, ...valuesToRemove) {

package/dist/compat/array/pull.mjs

@@ -13,7 +13,7 @@ import { pull as pull$1 } from "../../array/pull.mjs";
 *
 * @example
 * const numbers = [1, 2, 3, 4, 5, 2, 4];
-* pull(numbers, [2, 4]);
+* pull(numbers, 2, 4);
 * console.log(numbers); // [1, 3, 5]
 */
 function pull(arr, ...valuesToRemove) {

package/dist/compat/array/pullAll.js

@@ -1,4 +1,5 @@
 const require_pull = require("../../array/pull.js");
+const require_isNil = require("../../predicate/isNil.js");
 //#region src/compat/array/pullAll.ts
 /**
 * Removes all specified values from an array.
@@ -17,6 +18,7 @@ const require_pull = require("../../array/pull.js");
 * console.log(numbers); // [1, 3, 5]
 */
 function pullAll(arr, valuesToRemove = []) {
+	if (require_isNil.isNil(valuesToRemove)) return arr;
 	return require_pull.pull(arr, Array.from(valuesToRemove));
 }
 //#endregion

package/dist/compat/array/pullAll.mjs

@@ -1,4 +1,5 @@
 import { pull } from "../../array/pull.mjs";
+import { isNil } from "../../predicate/isNil.mjs";
 //#region src/compat/array/pullAll.ts
 /**
 * Removes all specified values from an array.
@@ -17,6 +18,7 @@ import { pull } from "../../array/pull.mjs";
 * console.log(numbers); // [1, 3, 5]
 */
 function pullAll(arr, valuesToRemove = []) {
+	if (isNil(valuesToRemove)) return arr;
 	return pull(arr, Array.from(valuesToRemove));
 }
 //#endregion

package/dist/compat/array/remove.js

@@ -12,22 +12,26 @@ const require_iteratee = require("../util/iteratee.js");
 * @example
 * // Using a predicate function
 * const numbers = [1, 2, 3, 4, 5];
-* remove(numbers, value => value % 2 === 0); // => [1, 3, 5]
+* remove(numbers, value => value % 2 === 0); // => [2, 4]
+* console.log(numbers); // => [1, 3, 5]
 *
 * @example
 * // Using a partial object
 * const objects = [{ a: 1 }, { a: 2 }, { a: 3 }];
-* remove(objects, { a: 1 }); // => [{ a: 2 }, { a: 3 }]
+* remove(objects, { a: 1 }); // => [{ a: 1 }]
+* console.log(objects); // => [{ a: 2 }, { a: 3 }]
 *
 * @example
 * // Using a property-value pair
 * const objects = [{ a: 1 }, { a: 2 }, { a: 3 }];
-* remove(objects, ['a', 1]); // => [{ a: 2 }, { a: 3 }]
+* remove(objects, ['a', 1]); // => [{ a: 1 }]
+* console.log(objects); // => [{ a: 2 }, { a: 3 }]
 *
 * @example
 * // Using a property key
 * const objects = [{ a: 0 }, { a: 1 }];
-* remove(objects, 'a'); // => [{ a: 0 }]
+* remove(objects, 'a'); // => [{ a: 1 }]
+* console.log(objects); // => [{ a: 0 }]
 */
 function remove(arr, shouldRemoveElement = require_identity.identity) {
 	return require_remove.remove(arr, require_iteratee.iteratee(shouldRemoveElement));

package/dist/compat/array/remove.mjs

@@ -12,22 +12,26 @@ import { iteratee } from "../util/iteratee.mjs";
 * @example
 * // Using a predicate function
 * const numbers = [1, 2, 3, 4, 5];
-* remove(numbers, value => value % 2 === 0); // => [1, 3, 5]
+* remove(numbers, value => value % 2 === 0); // => [2, 4]
+* console.log(numbers); // => [1, 3, 5]
 *
 * @example
 * // Using a partial object
 * const objects = [{ a: 1 }, { a: 2 }, { a: 3 }];
-* remove(objects, { a: 1 }); // => [{ a: 2 }, { a: 3 }]
+* remove(objects, { a: 1 }); // => [{ a: 1 }]
+* console.log(objects); // => [{ a: 2 }, { a: 3 }]
 *
 * @example
 * // Using a property-value pair
 * const objects = [{ a: 1 }, { a: 2 }, { a: 3 }];
-* remove(objects, ['a', 1]); // => [{ a: 2 }, { a: 3 }]
+* remove(objects, ['a', 1]); // => [{ a: 1 }]
+* console.log(objects); // => [{ a: 2 }, { a: 3 }]
 *
 * @example
 * // Using a property key
 * const objects = [{ a: 0 }, { a: 1 }];
-* remove(objects, 'a'); // => [{ a: 0 }]
+* remove(objects, 'a'); // => [{ a: 1 }]
+* console.log(objects); // => [{ a: 0 }]
 */
 function remove(arr, shouldRemoveElement = identity) {
 	return remove$1(arr, iteratee(shouldRemoveElement));

package/dist/compat/array/reverse.js

@@ -22,7 +22,7 @@
 */
 function reverse(array) {
 	if (array == null) return array;
-	return array.reverse();
+	return Array.prototype.reverse.call(array);
 }
 //#endregion
 exports.reverse = reverse;

package/dist/compat/array/reverse.mjs

@@ -22,7 +22,7 @@
 */
 function reverse(array) {
 	if (array == null) return array;
-	return array.reverse();
+	return Array.prototype.reverse.call(array);
 }
 //#endregion
 export { reverse };