es-toolkit 1.52.0-dev.2140 → 1.52.0-dev.2141

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

@@ -1,6 +1,4 @@
 import { ValueIteratee } from "../_internal/ValueIteratee.js";
-
-//#region src/compat/array/uniqBy.d.ts
 /**
  * Creates a duplicate-free version of an array, using an optional transform function.
  *
@@ -13,6 +11,4 @@ import { ValueIteratee } from "../_internal/ValueIteratee.js";
  * uniqBy([2.1, 1.2, 2.3], Math.floor);
  * // => [2.1, 1.2]
  */
-declare function uniqBy<T>(array: ArrayLike<T> | null | undefined, iteratee: ValueIteratee<T>): T[];
-//#endregion
-export { uniqBy };
+export declare function uniqBy<T>(array: ArrayLike<T> | null | undefined, iteratee: ValueIteratee<T>): T[];

package/dist/compat/array/uniqBy.js

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

package/dist/compat/array/uniqBy.mjs

@@ -4,10 +4,9 @@ import { identity } from "../../function/identity.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { iteratee } from "../util/iteratee.mjs";
 import { normalizeZero } from "../_internal/normalizeZero.mjs";
-//#region src/compat/array/uniqBy.ts
+// src/compat/array/uniqBy.ts
 function uniqBy(array, iteratee$1 = identity) {
 	if (!isArrayLike(array)) return [];
 	return uniqBy$1(Array.from(array), ary(iteratee(iteratee$1), 1)).map(normalizeZero);
 }
-//#endregion
 export { uniqBy };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/uniqWith.d.ts
 type Comparator<T> = (a: T, b: T) => boolean;
 /**
  * This method is like `uniq`, except that it accepts a `comparator` which is used to determine the equality of elements.
@@ -23,6 +22,5 @@ type Comparator<T> = (a: T, b: T) => boolean;
  * const result = uniqWith(array, (a, b) => a % 2 === b % 2)
  * // result will be [1, 2]
  */
-declare function uniqWith<T>(arr: ArrayLike<T> | null | undefined, comparator?: Comparator<T>): T[];
-//#endregion
-export { uniqWith };
+export declare function uniqWith<T>(arr: ArrayLike<T> | null | undefined, comparator?: Comparator<T>): T[];
+export {};

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/uniqWith.d.ts
 type Comparator<T> = (a: T, b: T) => boolean;
 /**
  * This method is like `uniq`, except that it accepts a `comparator` which is used to determine the equality of elements.
@@ -23,6 +22,5 @@ type Comparator<T> = (a: T, b: T) => boolean;
  * const result = uniqWith(array, (a, b) => a % 2 === b % 2)
  * // result will be [1, 2]
  */
-declare function uniqWith<T>(arr: ArrayLike<T> | null | undefined, comparator?: Comparator<T>): T[];
-//#endregion
-export { uniqWith };
+export declare function uniqWith<T>(arr: ArrayLike<T> | null | undefined, comparator?: Comparator<T>): T[];
+export {};

package/dist/compat/array/uniqWith.js

@@ -1,7 +1,7 @@
 const require_uniqWith = require("../../array/uniqWith.js");
 const require_isArrayLike = require("../predicate/isArrayLike.js");
 const require_uniq = require("./uniq.js");
-//#region src/compat/array/uniqWith.ts
+// src/compat/array/uniqWith.ts
 /**
 * This method is like `uniq`, except that it accepts a `comparator` which is used to determine the equality of elements.
 *
@@ -30,5 +30,4 @@ function uniqWith(arr, comparator) {
 	if (typeof comparator !== "function") return require_uniq.uniq(Array.from(arr));
 	return require_uniqWith.uniqWith(Array.from(arr), (kept, candidate) => comparator(candidate, kept));
 }
-//#endregion
 exports.uniqWith = uniqWith;

package/dist/compat/array/uniqWith.mjs

@@ -1,7 +1,7 @@
 import { uniqWith as uniqWith$1 } from "../../array/uniqWith.mjs";
 import { isArrayLike } from "../predicate/isArrayLike.mjs";
 import { uniq } from "./uniq.mjs";
-//#region src/compat/array/uniqWith.ts
+// src/compat/array/uniqWith.ts
 /**
 * This method is like `uniq`, except that it accepts a `comparator` which is used to determine the equality of elements.
 *
@@ -30,5 +30,4 @@ function uniqWith(arr, comparator) {
 	if (typeof comparator !== "function") return uniq(Array.from(arr));
 	return uniqWith$1(Array.from(arr), (kept, candidate) => comparator(candidate, kept));
 }
-//#endregion
 export { uniqWith };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/unzip.d.ts
 /**
  * Gathers elements in the same position in an internal array
  * from a grouped array of elements and returns them as a new array.
@@ -15,6 +14,4 @@
  * const result = unzip(zipped);
  * // result will be [['a', 'b'], [true, false], [1, 2]]
  */
-declare function unzip<T>(array: T[][] | ArrayLike<ArrayLike<T>> | null | undefined): T[][];
-//#endregion
-export { unzip };
+export declare function unzip<T>(array: T[][] | ArrayLike<ArrayLike<T>> | null | undefined): T[][];

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/unzip.d.ts
 /**
  * Gathers elements in the same position in an internal array
  * from a grouped array of elements and returns them as a new array.
@@ -15,6 +14,4 @@
  * const result = unzip(zipped);
  * // result will be [['a', 'b'], [true, false], [1, 2]]
  */
-declare function unzip<T>(array: T[][] | ArrayLike<ArrayLike<T>> | null | undefined): T[][];
-//#endregion
-export { unzip };
+export declare function unzip<T>(array: T[][] | ArrayLike<ArrayLike<T>> | null | undefined): T[][];

package/dist/compat/array/unzip.js

@@ -1,7 +1,7 @@
 const require_unzip = require("../../array/unzip.js");
 const require_isArray = require("../predicate/isArray.js");
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
-//#region src/compat/array/unzip.ts
+// src/compat/array/unzip.ts
 /**
 * Gathers elements in the same position in an internal array
 * from a grouped array of elements and returns them as a new array.
@@ -24,5 +24,4 @@ function unzip(array) {
 	array = array.filter((item) => require_isArrayLikeObject.isArrayLikeObject(item));
 	return require_unzip.unzip(array);
 }
-//#endregion
 exports.unzip = unzip;

package/dist/compat/array/unzip.mjs

@@ -1,7 +1,7 @@
 import { unzip as unzip$1 } from "../../array/unzip.mjs";
 import { isArray } from "../predicate/isArray.mjs";
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
-//#region src/compat/array/unzip.ts
+// src/compat/array/unzip.ts
 /**
 * Gathers elements in the same position in an internal array
 * from a grouped array of elements and returns them as a new array.
@@ -24,5 +24,4 @@ function unzip(array) {
 	array = array.filter((item) => isArrayLikeObject(item));
 	return unzip$1(array);
 }
-//#endregion
 export { unzip };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/unzipWith.d.ts
 /**
  * This method is like `unzip` except that it accepts an iteratee to specify
  * how regrouped values should be combined. The iteratee is invoked with the
@@ -13,7 +12,7 @@
  * unzipWith([[1, 10, 100], [2, 20, 200]], (a, b) => a + b);
  * // => [3, 30, 300]
  */
-declare function unzipWith<T, R>(array: ArrayLike<ArrayLike<T>> | null | undefined, iteratee: (...values: T[]) => R): R[];
+export declare function unzipWith<T, R>(array: ArrayLike<ArrayLike<T>> | null | undefined, iteratee: (...values: T[]) => R): R[];
 /**
  * This method is like `unzip` except that it accepts an iteratee to specify
  * how regrouped values should be combined.
@@ -26,6 +25,4 @@ declare function unzipWith<T, R>(array: ArrayLike<ArrayLike<T>> | null | undefin
  * unzipWith([[1, 10, 100], [2, 20, 200]]);
  * // => [[1, 2], [10, 20], [100, 200]]
  */
-declare function unzipWith<T>(array: ArrayLike<ArrayLike<T>> | null | undefined): T[][];
-//#endregion
-export { unzipWith };
+export declare function unzipWith<T>(array: ArrayLike<ArrayLike<T>> | null | undefined): T[][];

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/unzipWith.d.ts
 /**
  * This method is like `unzip` except that it accepts an iteratee to specify
  * how regrouped values should be combined. The iteratee is invoked with the
@@ -13,7 +12,7 @@
  * unzipWith([[1, 10, 100], [2, 20, 200]], (a, b) => a + b);
  * // => [3, 30, 300]
  */
-declare function unzipWith<T, R>(array: ArrayLike<ArrayLike<T>> | null | undefined, iteratee: (...values: T[]) => R): R[];
+export declare function unzipWith<T, R>(array: ArrayLike<ArrayLike<T>> | null | undefined, iteratee: (...values: T[]) => R): R[];
 /**
  * This method is like `unzip` except that it accepts an iteratee to specify
  * how regrouped values should be combined.
@@ -26,6 +25,4 @@ declare function unzipWith<T, R>(array: ArrayLike<ArrayLike<T>> | null | undefin
  * unzipWith([[1, 10, 100], [2, 20, 200]]);
  * // => [[1, 2], [10, 20], [100, 200]]
  */
-declare function unzipWith<T>(array: ArrayLike<ArrayLike<T>> | null | undefined): T[][];
-//#endregion
-export { unzipWith };
+export declare function unzipWith<T>(array: ArrayLike<ArrayLike<T>> | null | undefined): T[][];

package/dist/compat/array/unzipWith.js

@@ -1,7 +1,7 @@
 const require_unzip = require("../../array/unzip.js");
 const require_isArray = require("../predicate/isArray.js");
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
-//#region src/compat/array/unzipWith.ts
+// src/compat/array/unzipWith.ts
 /**
 * Unzips an array of arrays, applying an `iteratee` function to regrouped elements.
 *
@@ -29,5 +29,4 @@ function unzipWith(array, iteratee) {
 	}
 	return result;
 }
-//#endregion
 exports.unzipWith = unzipWith;

package/dist/compat/array/unzipWith.mjs

@@ -1,7 +1,7 @@
 import { unzip } from "../../array/unzip.mjs";
 import { isArray } from "../predicate/isArray.mjs";
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
-//#region src/compat/array/unzipWith.ts
+// src/compat/array/unzipWith.ts
 /**
 * Unzips an array of arrays, applying an `iteratee` function to regrouped elements.
 *
@@ -29,5 +29,4 @@ function unzipWith(array, iteratee) {
 	}
 	return result;
 }
-//#endregion
 export { unzipWith };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/without.d.ts
 /**
  * Creates an array that excludes all specified values.
  *
@@ -19,6 +18,4 @@
  * without(['a', 'b', 'c', 'a'], 'a');
  * // Returns: ['b', 'c']
  */
-declare function without<T>(array: ArrayLike<T> | null | undefined, ...values: T[]): T[];
-//#endregion
-export { without };
+export declare function without<T>(array: ArrayLike<T> | null | undefined, ...values: T[]): T[];

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/without.d.ts
 /**
  * Creates an array that excludes all specified values.
  *
@@ -19,6 +18,4 @@
  * without(['a', 'b', 'c', 'a'], 'a');
  * // Returns: ['b', 'c']
  */
-declare function without<T>(array: ArrayLike<T> | null | undefined, ...values: T[]): T[];
-//#endregion
-export { without };
+export declare function without<T>(array: ArrayLike<T> | null | undefined, ...values: T[]): T[];

package/dist/compat/array/without.js

@@ -1,6 +1,6 @@
 const require_normalizeZero = require("../_internal/normalizeZero.js");
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
-//#region src/compat/array/without.ts
+// src/compat/array/without.ts
 /**
 * Creates an array that excludes all specified values.
 *
@@ -31,5 +31,4 @@ function without(array, ...values) {
 	}
 	return result;
 }
-//#endregion
 exports.without = without;

package/dist/compat/array/without.mjs

@@ -1,6 +1,6 @@
 import { normalizeZero } from "../_internal/normalizeZero.mjs";
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
-//#region src/compat/array/without.ts
+// src/compat/array/without.ts
 /**
 * Creates an array that excludes all specified values.
 *
@@ -31,5 +31,4 @@ function without(array, ...values) {
 	}
 	return result;
 }
-//#endregion
 export { without };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/xor.d.ts
 /**
  * Computes the symmetric difference of the provided arrays, returning an array of elements
  * that exist in only one of the arrays.
@@ -19,6 +18,4 @@
  * // Returns [1, 3, 5]
  * xor([1, 2], [2, 3], [4, 5]);
  */
-declare function xor<T>(...arrays: Array<ArrayLike<T> | null | undefined>): T[];
-//#endregion
-export { xor };
+export declare function xor<T>(...arrays: Array<ArrayLike<T> | null | undefined>): T[];

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/xor.d.ts
 /**
  * Computes the symmetric difference of the provided arrays, returning an array of elements
  * that exist in only one of the arrays.
@@ -19,6 +18,4 @@
  * // Returns [1, 3, 5]
  * xor([1, 2], [2, 3], [4, 5]);
  */
-declare function xor<T>(...arrays: Array<ArrayLike<T> | null | undefined>): T[];
-//#endregion
-export { xor };
+export declare function xor<T>(...arrays: Array<ArrayLike<T> | null | undefined>): T[];

package/dist/compat/array/xor.js

@@ -1,6 +1,6 @@
 const require_isArrayLikeObject = require("../predicate/isArrayLikeObject.js");
 const require_toArray = require("../util/toArray.js");
-//#region src/compat/array/xor.ts
+// src/compat/array/xor.ts
 /**
 * Computes the symmetric difference of the provided arrays, returning an array of elements
 * that exist in only one of the arrays.
@@ -34,5 +34,4 @@ function xor(...arrays) {
 	for (const [item, count] of itemCounts) if (count === 1) result.push(item);
 	return result;
 }
-//#endregion
 exports.xor = xor;

package/dist/compat/array/xor.mjs

@@ -1,6 +1,6 @@
 import { isArrayLikeObject } from "../predicate/isArrayLikeObject.mjs";
 import { toArray } from "../util/toArray.mjs";
-//#region src/compat/array/xor.ts
+// src/compat/array/xor.ts
 /**
 * Computes the symmetric difference of the provided arrays, returning an array of elements
 * that exist in only one of the arrays.
@@ -34,5 +34,4 @@ function xor(...arrays) {
 	for (const [item, count] of itemCounts) if (count === 1) result.push(item);
 	return result;
 }
-//#endregion
 export { xor };

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

@@ -1,6 +1,4 @@
 import { ValueIteratee } from "../_internal/ValueIteratee.mjs";
-
-//#region src/compat/array/xorBy.d.ts
 /**
  * This method is like `xor` except that it accepts `iteratee` which is
  * invoked for each element of each `arrays` to generate the criterion by which
@@ -19,7 +17,7 @@ import { ValueIteratee } from "../_internal/ValueIteratee.mjs";
  * xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
  * // => [{ 'x': 2 }]
  */
-declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
+export declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
 /**
  * This method is like `xor` except that it accepts `iteratee` which is
  * invoked for each element of each `arrays` to generate the criterion by which
@@ -35,7 +33,7 @@ declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, iteratee?: Va
  * xorBy([2.1, 1.2], [4.3, 2.4], Math.floor);
  * // => [1.2, 4.3]
  */
-declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
+export declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
 /**
  * This method is like `xor` except that it accepts `iteratee` which is
  * invoked for each element of each `arrays` to generate the criterion by which
@@ -52,6 +50,4 @@ declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: Arra
  * xorBy([1.2, 2.3], [3.4, 4.5], [5.6, 6.7], Math.floor);
  * // => [1.2, 3.4, 5.6]
  */
-declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...iteratee: Array<ValueIteratee<T> | ArrayLike<T> | null | undefined>): T[];
-//#endregion
-export { xorBy };
+export declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...iteratee: Array<ValueIteratee<T> | ArrayLike<T> | null | undefined>): T[];

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

@@ -1,6 +1,4 @@
 import { ValueIteratee } from "../_internal/ValueIteratee.js";
-
-//#region src/compat/array/xorBy.d.ts
 /**
  * This method is like `xor` except that it accepts `iteratee` which is
  * invoked for each element of each `arrays` to generate the criterion by which
@@ -19,7 +17,7 @@ import { ValueIteratee } from "../_internal/ValueIteratee.js";
  * xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
  * // => [{ 'x': 2 }]
  */
-declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
+export declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
 /**
  * This method is like `xor` except that it accepts `iteratee` which is
  * invoked for each element of each `arrays` to generate the criterion by which
@@ -35,7 +33,7 @@ declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, iteratee?: Va
  * xorBy([2.1, 1.2], [4.3, 2.4], Math.floor);
  * // => [1.2, 4.3]
  */
-declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
+export declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, iteratee?: ValueIteratee<T>): T[];
 /**
  * This method is like `xor` except that it accepts `iteratee` which is
  * invoked for each element of each `arrays` to generate the criterion by which
@@ -52,6 +50,4 @@ declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: Arra
  * xorBy([1.2, 2.3], [3.4, 4.5], [5.6, 6.7], Math.floor);
  * // => [1.2, 3.4, 5.6]
  */
-declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...iteratee: Array<ValueIteratee<T> | ArrayLike<T> | null | undefined>): T[];
-//#endregion
-export { xorBy };
+export declare function xorBy<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...iteratee: Array<ValueIteratee<T> | ArrayLike<T> | null | undefined>): T[];

package/dist/compat/array/xorBy.js

@@ -7,7 +7,7 @@ const require_differenceBy = require("./differenceBy.js");
 const require_intersectionBy = require("./intersectionBy.js");
 const require_unionBy = require("./unionBy.js");
 const require_uniq = require("./uniq.js");
-//#region src/compat/array/xorBy.ts
+// src/compat/array/xorBy.ts
 /**
 * Computes the symmetric difference between two arrays using a custom mapping function.
 * The symmetric difference is the set of elements which are in either of the arrays,
@@ -38,5 +38,4 @@ function xorBy(...values) {
 	const intersections = require_windowed.windowed(arrays, 2).map(([arr1, arr2]) => require_intersectionBy.intersectionBy(arr1, arr2, mapper));
 	return require_differenceBy.differenceBy(union, require_unionBy.unionBy(...intersections, mapper), mapper);
 }
-//#endregion
 exports.xorBy = xorBy;

package/dist/compat/array/xorBy.mjs

@@ -7,7 +7,7 @@ import { differenceBy } from "./differenceBy.mjs";
 import { intersectionBy } from "./intersectionBy.mjs";
 import { unionBy } from "./unionBy.mjs";
 import { uniq } from "./uniq.mjs";
-//#region src/compat/array/xorBy.ts
+// src/compat/array/xorBy.ts
 /**
 * Computes the symmetric difference between two arrays using a custom mapping function.
 * The symmetric difference is the set of elements which are in either of the arrays,
@@ -34,7 +34,8 @@ function xorBy(...values) {
 	}
 	const arrays = values.filter(isArrayLikeObject);
 	if (arrays.length < 2) return uniq(arrays[0]);
-	return differenceBy(unionBy(...arrays, mapper), unionBy(...windowed(arrays, 2).map(([arr1, arr2]) => intersectionBy(arr1, arr2, mapper)), mapper), mapper);
+	const union = unionBy(...arrays, mapper);
+	const intersections = windowed(arrays, 2).map(([arr1, arr2]) => intersectionBy(arr1, arr2, mapper));
+	return differenceBy(union, unionBy(...intersections, mapper), mapper);
 }
-//#endregion
 export { xorBy };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/xorWith.d.ts
 /**
  * This method is like `xor` except that it accepts `comparator` which is
  * invoked to compare elements of `arrays`. The comparator is invoked
@@ -15,7 +14,7 @@
  * xorWith(objects, others, isEqual);
  * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
  */
-declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
+export declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
 /**
  * This method is like `xor` except that it accepts `comparator` which is
  * invoked to compare elements of `arrays`. The comparator is invoked
@@ -31,7 +30,7 @@ declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, comparator?
  * xorWith([1, 2], [2, 3], (a, b) => a === b);
  * // => [1, 3]
  */
-declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
+export declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
 /**
  * This method is like `xor` except that it accepts `comparator` which is
  * invoked to compare elements of `arrays`. The comparator is invoked
@@ -48,6 +47,4 @@ declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: Ar
  * xorWith([1], [2], [3], (a, b) => a === b);
  * // => [1, 2, 3]
  */
-declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...comparator: Array<((a: T, b: T) => boolean) | ArrayLike<T> | null | undefined>): T[];
-//#endregion
-export { xorWith };
+export declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...comparator: Array<((a: T, b: T) => boolean) | ArrayLike<T> | null | undefined>): T[];

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/xorWith.d.ts
 /**
  * This method is like `xor` except that it accepts `comparator` which is
  * invoked to compare elements of `arrays`. The comparator is invoked
@@ -15,7 +14,7 @@
  * xorWith(objects, others, isEqual);
  * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
  */
-declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
+export declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
 /**
  * This method is like `xor` except that it accepts `comparator` which is
  * invoked to compare elements of `arrays`. The comparator is invoked
@@ -31,7 +30,7 @@ declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, comparator?
  * xorWith([1, 2], [2, 3], (a, b) => a === b);
  * // => [1, 3]
  */
-declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
+export declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, comparator?: (a: T, b: T) => boolean): T[];
 /**
  * This method is like `xor` except that it accepts `comparator` which is
  * invoked to compare elements of `arrays`. The comparator is invoked
@@ -48,6 +47,4 @@ declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: Ar
  * xorWith([1], [2], [3], (a, b) => a === b);
  * // => [1, 2, 3]
  */
-declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...comparator: Array<((a: T, b: T) => boolean) | ArrayLike<T> | null | undefined>): T[];
-//#endregion
-export { xorWith };
+export declare function xorWith<T>(arrays: ArrayLike<T> | null | undefined, arrays2: ArrayLike<T> | null | undefined, arrays3: ArrayLike<T> | null | undefined, ...comparator: Array<((a: T, b: T) => boolean) | ArrayLike<T> | null | undefined>): T[];

package/dist/compat/array/xorWith.js

@@ -6,7 +6,7 @@ const require_intersectionWith = require("./intersectionWith.js");
 const require_unionWith = require("./unionWith.js");
 const require_uniq = require("./uniq.js");
 const require_xor = require("./xor.js");
-//#region src/compat/array/xorWith.ts
+// src/compat/array/xorWith.ts
 /**
 * Creates an array of unique values that is the symmetric difference of the given arrays using a custom comparator function.
 *
@@ -35,5 +35,4 @@ function xorWith(...values) {
 	const intersections = require_windowed.windowed(arrays, 2).map(([arr1, arr2]) => require_intersectionWith.intersectionWith(arr1, arr2, comparator));
 	return require_differenceWith.differenceWith(union, require_unionWith.unionWith(...intersections, comparator), comparator);
 }
-//#endregion
 exports.xorWith = xorWith;

package/dist/compat/array/xorWith.mjs

@@ -6,7 +6,7 @@ import { intersectionWith } from "./intersectionWith.mjs";
 import { unionWith } from "./unionWith.mjs";
 import { uniq } from "./uniq.mjs";
 import { xor } from "./xor.mjs";
-//#region src/compat/array/xorWith.ts
+// src/compat/array/xorWith.ts
 /**
 * Creates an array of unique values that is the symmetric difference of the given arrays using a custom comparator function.
 *
@@ -31,7 +31,8 @@ function xorWith(...values) {
 	const comparator = lastValue;
 	const arrays = values.slice(0, -1).filter(isArrayLikeObject);
 	if (arrays.length < 2) return uniq(arrays[0]);
-	return differenceWith(unionWith(...arrays, comparator), unionWith(...windowed(arrays, 2).map(([arr1, arr2]) => intersectionWith(arr1, arr2, comparator)), comparator), comparator);
+	const union = unionWith(...arrays, comparator);
+	const intersections = windowed(arrays, 2).map(([arr1, arr2]) => intersectionWith(arr1, arr2, comparator));
+	return differenceWith(union, unionWith(...intersections, comparator), comparator);
 }
-//#endregion
 export { xorWith };

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

@@ -1,4 +1,3 @@
-//#region src/compat/array/zip.d.ts
 /**
  * Combines multiple arrays into a single array of tuples.
  *
@@ -31,7 +30,7 @@
  * zip([1, 2], ['a', 'b']);
  * // => [[1, 'a'], [2, 'b']]
  */
-declare function zip<T, U>(arr1: ArrayLike<T>, arr2: ArrayLike<U>): Array<[T | undefined, U | undefined]>;
+export declare function zip<T, U>(arr1: ArrayLike<T>, arr2: ArrayLike<U>): Array<[T | undefined, U | undefined]>;
 /**
  * Combines multiple arrays into a single array of tuples.
  *
@@ -67,7 +66,7 @@ declare function zip<T, U>(arr1: ArrayLike<T>, arr2: ArrayLike<U>): Array<[T | u
  * zip([1, 2], ['a', 'b'], [true, false]);
  * // => [[1, 'a', true], [2, 'b', false]]
  */
-declare function zip<T, U, V>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: ArrayLike<V>): Array<[T | undefined, U | undefined, V | undefined]>;
+export declare function zip<T, U, V>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: ArrayLike<V>): Array<[T | undefined, U | undefined, V | undefined]>;
 /**
  * Combines multiple arrays into a single array of tuples.
  *
@@ -106,7 +105,7 @@ declare function zip<T, U, V>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: Arra
  * zip([1], ['a'], [true], [null]);
  * // => [[1, 'a', true, null]]
  */
-declare function zip<T, U, V, W>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: ArrayLike<V>, arr4: ArrayLike<W>): Array<[T | undefined, U | undefined, V | undefined, W | undefined]>;
+export declare function zip<T, U, V, W>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: ArrayLike<V>, arr4: ArrayLike<W>): Array<[T | undefined, U | undefined, V | undefined, W | undefined]>;
 /**
  * Combines multiple arrays into a single array of tuples.
  *
@@ -148,7 +147,7 @@ declare function zip<T, U, V, W>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: A
  * zip([1], ['a'], [true], [null], [undefined]);
  * // => [[1, 'a', true, null, undefined]]
  */
-declare function zip<T, U, V, W, X>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: ArrayLike<V>, arr4: ArrayLike<W>, arr5: ArrayLike<X>): Array<[T | undefined, U | undefined, V | undefined, W | undefined, X | undefined]>;
+export declare function zip<T, U, V, W, X>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3: ArrayLike<V>, arr4: ArrayLike<W>, arr5: ArrayLike<X>): Array<[T | undefined, U | undefined, V | undefined, W | undefined, X | undefined]>;
 /**
  * Combines multiple arrays into a single array of tuples.
  *
@@ -182,6 +181,4 @@ declare function zip<T, U, V, W, X>(arr1: ArrayLike<T>, arr2: ArrayLike<U>, arr3
  * zip([1, 2], ['a', 'b'], [true, false]);
  * // => [[1, 'a', true], [2, 'b', false]]
  */
-declare function zip<T>(...arrays: Array<ArrayLike<T> | null | undefined>): Array<Array<T | undefined>>;
-//#endregion
-export { zip };
+export declare function zip<T>(...arrays: Array<ArrayLike<T> | null | undefined>): Array<Array<T | undefined>>;