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

package/dist/fp/array/flattenDeep.mjs

@@ -1,6 +1,6 @@
 import { flattenDeep as flattenDeep$1 } from "../../array/flattenDeep.mjs";
 import { combineEagerAndLazyFunctions, createLazyFunction } from "../_internal/lazy.mjs";
-//#region src/fp/array/flattenDeep.ts
+// src/fp/array/flattenDeep.ts
 /**
 * Creates a function that recursively flattens an array.
 *
@@ -20,9 +20,10 @@ function flattenDeep() {
 	function flattenDeepEager(array) {
 		return flattenDeep$1(array);
 	}
-	return combineEagerAndLazyFunctions(flattenDeepEager, createLazyFunction((value, _index, emit) => {
+	const flattenDeepLazy = createLazyFunction((value, _index, emit) => {
 		emitDeep(value, emit);
-	}));
+	});
+	return combineEagerAndLazyFunctions(flattenDeepEager, flattenDeepLazy);
 }
 function emitDeep(value, emit) {
 	if (Array.isArray(value)) {
@@ -31,5 +32,4 @@ function emitDeep(value, emit) {
 	}
 	emit(value);
 }
-//#endregion
 export { flattenDeep };

package/dist/fp/array/forEach.d.mts

@@ -1,4 +1,3 @@
-//#region src/fp/array/forEach.d.ts
 /**
  * Creates a function that runs a callback for every element and returns the original array.
  *
@@ -17,6 +16,4 @@
  * pipe([1, 2, 3], forEach(value => console.log(value)), map(value => value * 2));
  * // => [2, 4, 6]
  */
-declare function forEach<T>(callback: (value: T, index: number) => void): (array: readonly T[]) => readonly T[];
-//#endregion
-export { forEach };
+export declare function forEach<T>(callback: (value: T, index: number) => void): (array: readonly T[]) => readonly T[];

package/dist/fp/array/forEach.d.ts

@@ -1,4 +1,3 @@
-//#region src/fp/array/forEach.d.ts
 /**
  * Creates a function that runs a callback for every element and returns the original array.
  *
@@ -17,6 +16,4 @@
  * pipe([1, 2, 3], forEach(value => console.log(value)), map(value => value * 2));
  * // => [2, 4, 6]
  */
-declare function forEach<T>(callback: (value: T, index: number) => void): (array: readonly T[]) => readonly T[];
-//#endregion
-export { forEach };
+export declare function forEach<T>(callback: (value: T, index: number) => void): (array: readonly T[]) => readonly T[];

package/dist/fp/array/forEach.js

@@ -1,5 +1,5 @@
 const require_lazy = require("../_internal/lazy.js");
-//#region src/fp/array/forEach.ts
+// src/fp/array/forEach.ts
 /**
 * Creates a function that runs a callback for every element and returns the original array.
 *
@@ -29,5 +29,4 @@ function forEach(callback) {
 	});
 	return require_lazy.combineEagerAndLazyFunctions(forEachEager, forEachLazy);
 }
-//#endregion
 exports.forEach = forEach;

package/dist/fp/array/forEach.mjs

@@ -1,5 +1,5 @@
 import { combineEagerAndLazyFunctions, createLazyFunction } from "../_internal/lazy.mjs";
-//#region src/fp/array/forEach.ts
+// src/fp/array/forEach.ts
 /**
 * Creates a function that runs a callback for every element and returns the original array.
 *
@@ -23,10 +23,10 @@ function forEach(callback) {
 		array.forEach(callback);
 		return array;
 	}
-	return combineEagerAndLazyFunctions(forEachEager, createLazyFunction((value, index, emit) => {
+	const forEachLazy = createLazyFunction((value, index, emit) => {
 		callback(value, index);
 		emit(value);
-	}));
+	});
+	return combineEagerAndLazyFunctions(forEachEager, forEachLazy);
 }
-//#endregion
 export { forEach };

package/dist/fp/array/groupBy.d.mts

@@ -1,4 +1,3 @@
-//#region src/fp/array/groupBy.d.ts
 /**
  * Creates a function that groups values by a derived key.
  *
@@ -16,6 +15,4 @@
  * pipe(['ant', 'bear', 'cat'], groupBy(word => word.length));
  * // => { 3: ['ant', 'cat'], 4: ['bear'] }
  */
-declare function groupBy<T, K extends PropertyKey>(getKey: (item: T, index: number, array: readonly T[]) => K): (array: readonly T[]) => Record<K, T[]>;
-//#endregion
-export { groupBy };
+export declare function groupBy<T, K extends PropertyKey>(getKey: (item: T, index: number, array: readonly T[]) => K): (array: readonly T[]) => Record<K, T[]>;

package/dist/fp/array/groupBy.d.ts

@@ -1,4 +1,3 @@
-//#region src/fp/array/groupBy.d.ts
 /**
  * Creates a function that groups values by a derived key.
  *
@@ -16,6 +15,4 @@
  * pipe(['ant', 'bear', 'cat'], groupBy(word => word.length));
  * // => { 3: ['ant', 'cat'], 4: ['bear'] }
  */
-declare function groupBy<T, K extends PropertyKey>(getKey: (item: T, index: number, array: readonly T[]) => K): (array: readonly T[]) => Record<K, T[]>;
-//#endregion
-export { groupBy };
+export declare function groupBy<T, K extends PropertyKey>(getKey: (item: T, index: number, array: readonly T[]) => K): (array: readonly T[]) => Record<K, T[]>;

package/dist/fp/array/groupBy.js

@@ -1,5 +1,5 @@
 const require_groupBy = require("../../array/groupBy.js");
-//#region src/fp/array/groupBy.ts
+// src/fp/array/groupBy.ts
 /**
 * Creates a function that groups values by a derived key.
 *
@@ -22,5 +22,4 @@ function groupBy(getKey) {
 		return require_groupBy.groupBy(array, getKey);
 	};
 }
-//#endregion
 exports.groupBy = groupBy;

package/dist/fp/array/groupBy.mjs

@@ -1,5 +1,5 @@
 import { groupBy as groupBy$1 } from "../../array/groupBy.mjs";
-//#region src/fp/array/groupBy.ts
+// src/fp/array/groupBy.ts
 /**
 * Creates a function that groups values by a derived key.
 *
@@ -22,5 +22,4 @@ function groupBy(getKey) {
 		return groupBy$1(array, getKey);
 	};
 }
-//#endregion
 export { groupBy };

package/dist/fp/array/head.d.mts

@@ -1,4 +1,3 @@
-//#region src/fp/array/head.d.ts
 /**
  * Creates a function that returns the first element of an array, or undefined.
  *
@@ -17,6 +16,4 @@
  * pipe([] as number[], head());
  * // => undefined
  */
-declare function head<T>(): (array: readonly T[]) => T | undefined;
-//#endregion
-export { head };
+export declare function head<T>(): (array: readonly T[]) => T | undefined;

package/dist/fp/array/head.d.ts

@@ -1,4 +1,3 @@
-//#region src/fp/array/head.d.ts
 /**
  * Creates a function that returns the first element of an array, or undefined.
  *
@@ -17,6 +16,4 @@
  * pipe([] as number[], head());
  * // => undefined
  */
-declare function head<T>(): (array: readonly T[]) => T | undefined;
-//#endregion
-export { head };
+export declare function head<T>(): (array: readonly T[]) => T | undefined;

package/dist/fp/array/head.js

@@ -1,5 +1,5 @@
 const require_head = require("../../array/head.js");
-//#region src/fp/array/head.ts
+// src/fp/array/head.ts
 /**
 * Creates a function that returns the first element of an array, or undefined.
 *
@@ -23,5 +23,4 @@ function head() {
 		return require_head.head(array);
 	};
 }
-//#endregion
 exports.head = head;

package/dist/fp/array/head.mjs

@@ -1,5 +1,5 @@
 import { head as head$1 } from "../../array/head.mjs";
-//#region src/fp/array/head.ts
+// src/fp/array/head.ts
 /**
 * Creates a function that returns the first element of an array, or undefined.
 *
@@ -23,5 +23,4 @@ function head() {
 		return head$1(array);
 	};
 }
-//#endregion
 export { head };

package/dist/fp/array/index.d.mts

@@ -66,4 +66,5 @@ import { xorBy } from "./xorBy.mjs";
 import { xorWith } from "./xorWith.mjs";
 import { zip } from "./zip.mjs";
 import { zipObject } from "./zipObject.mjs";
-import { zipWith } from "./zipWith.mjs";
+import { zipWith } from "./zipWith.mjs";
+export { type WindowedOptions, at, cartesianProduct, chunk, chunkBy, combinations, compact, countBy, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, filter, find, findIndex, findLast, findLastIndex, flatMap, flatMapDeep, flatten, flattenDeep, forEach, groupBy, head, initial, intersection, intersectionBy, intersectionWith, isSubset, isSubsetWith, join, keyBy, last, length, map, maxBy, minBy, orderBy, partition, reverse, sample, sampleSize, shuffle, sortBy, tail, take, takeRight, takeRightWhile, takeWhile, toFilled, union, unionBy, unionWith, uniq, uniqBy, uniqWith, unzip, unzipWith, windowed, without, xor, xorBy, xorWith, zip, zipObject, zipWith };

package/dist/fp/array/index.d.ts

@@ -66,4 +66,5 @@ import { xorBy } from "./xorBy.js";
 import { xorWith } from "./xorWith.js";
 import { zip } from "./zip.js";
 import { zipObject } from "./zipObject.js";
-import { zipWith } from "./zipWith.js";
+import { zipWith } from "./zipWith.js";
+export { type WindowedOptions, at, cartesianProduct, chunk, chunkBy, combinations, compact, countBy, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, filter, find, findIndex, findLast, findLastIndex, flatMap, flatMapDeep, flatten, flattenDeep, forEach, groupBy, head, initial, intersection, intersectionBy, intersectionWith, isSubset, isSubsetWith, join, keyBy, last, length, map, maxBy, minBy, orderBy, partition, reverse, sample, sampleSize, shuffle, sortBy, tail, take, takeRight, takeRightWhile, takeWhile, toFilled, union, unionBy, unionWith, uniq, uniqBy, uniqWith, unzip, unzipWith, windowed, without, xor, xorBy, xorWith, zip, zipObject, zipWith };

package/dist/fp/array/index.js

@@ -1,68 +1,136 @@
-require("./at.js");
-require("./cartesianProduct.js");
-require("./chunk.js");
-require("./chunkBy.js");
-require("./combinations.js");
-require("./compact.js");
-require("./countBy.js");
-require("./difference.js");
-require("./differenceBy.js");
-require("./differenceWith.js");
-require("./drop.js");
-require("./dropRight.js");
-require("./dropRightWhile.js");
-require("./dropWhile.js");
-require("./filter.js");
-require("./find.js");
-require("./findIndex.js");
-require("./findLast.js");
-require("./findLastIndex.js");
-require("./flatMap.js");
-require("./flatMapDeep.js");
-require("./flatten.js");
-require("./flattenDeep.js");
-require("./forEach.js");
-require("./groupBy.js");
-require("./head.js");
-require("./initial.js");
-require("./intersection.js");
-require("./intersectionBy.js");
-require("./intersectionWith.js");
-require("./isSubset.js");
-require("./isSubsetWith.js");
-require("./join.js");
-require("./keyBy.js");
-require("./last.js");
-require("./length.js");
-require("./map.js");
-require("./maxBy.js");
-require("./minBy.js");
-require("./orderBy.js");
-require("./partition.js");
-require("./reverse.js");
-require("./sample.js");
-require("./sampleSize.js");
-require("./shuffle.js");
-require("./sortBy.js");
-require("./tail.js");
-require("./take.js");
-require("./takeRight.js");
-require("./takeRightWhile.js");
-require("./takeWhile.js");
-require("./toFilled.js");
-require("./union.js");
-require("./unionBy.js");
-require("./unionWith.js");
-require("./uniq.js");
-require("./uniqBy.js");
-require("./uniqWith.js");
-require("./unzip.js");
-require("./unzipWith.js");
-require("./windowed.js");
-require("./without.js");
-require("./xor.js");
-require("./xorBy.js");
-require("./xorWith.js");
-require("./zip.js");
-require("./zipObject.js");
-require("./zipWith.js");
+const require_at = require("./at.js");
+const require_cartesianProduct = require("./cartesianProduct.js");
+const require_chunk = require("./chunk.js");
+const require_chunkBy = require("./chunkBy.js");
+const require_combinations = require("./combinations.js");
+const require_compact = require("./compact.js");
+const require_countBy = require("./countBy.js");
+const require_difference = require("./difference.js");
+const require_differenceBy = require("./differenceBy.js");
+const require_differenceWith = require("./differenceWith.js");
+const require_drop = require("./drop.js");
+const require_dropRight = require("./dropRight.js");
+const require_dropRightWhile = require("./dropRightWhile.js");
+const require_dropWhile = require("./dropWhile.js");
+const require_filter = require("./filter.js");
+const require_find = require("./find.js");
+const require_findIndex = require("./findIndex.js");
+const require_findLast = require("./findLast.js");
+const require_findLastIndex = require("./findLastIndex.js");
+const require_flatMap = require("./flatMap.js");
+const require_flatMapDeep = require("./flatMapDeep.js");
+const require_flatten = require("./flatten.js");
+const require_flattenDeep = require("./flattenDeep.js");
+const require_forEach = require("./forEach.js");
+const require_groupBy = require("./groupBy.js");
+const require_head = require("./head.js");
+const require_initial = require("./initial.js");
+const require_intersection = require("./intersection.js");
+const require_intersectionBy = require("./intersectionBy.js");
+const require_intersectionWith = require("./intersectionWith.js");
+const require_isSubset = require("./isSubset.js");
+const require_isSubsetWith = require("./isSubsetWith.js");
+const require_join = require("./join.js");
+const require_keyBy = require("./keyBy.js");
+const require_last = require("./last.js");
+const require_length = require("./length.js");
+const require_map = require("./map.js");
+const require_maxBy = require("./maxBy.js");
+const require_minBy = require("./minBy.js");
+const require_orderBy = require("./orderBy.js");
+const require_partition = require("./partition.js");
+const require_reverse = require("./reverse.js");
+const require_sample = require("./sample.js");
+const require_sampleSize = require("./sampleSize.js");
+const require_shuffle = require("./shuffle.js");
+const require_sortBy = require("./sortBy.js");
+const require_tail = require("./tail.js");
+const require_take = require("./take.js");
+const require_takeRight = require("./takeRight.js");
+const require_takeRightWhile = require("./takeRightWhile.js");
+const require_takeWhile = require("./takeWhile.js");
+const require_toFilled = require("./toFilled.js");
+const require_union = require("./union.js");
+const require_unionBy = require("./unionBy.js");
+const require_unionWith = require("./unionWith.js");
+const require_uniq = require("./uniq.js");
+const require_uniqBy = require("./uniqBy.js");
+const require_uniqWith = require("./uniqWith.js");
+const require_unzip = require("./unzip.js");
+const require_unzipWith = require("./unzipWith.js");
+const require_windowed = require("./windowed.js");
+const require_without = require("./without.js");
+const require_xor = require("./xor.js");
+const require_xorBy = require("./xorBy.js");
+const require_xorWith = require("./xorWith.js");
+const require_zip = require("./zip.js");
+const require_zipObject = require("./zipObject.js");
+const require_zipWith = require("./zipWith.js");
+exports.at = require_at.at;
+exports.cartesianProduct = require_cartesianProduct.cartesianProduct;
+exports.chunk = require_chunk.chunk;
+exports.chunkBy = require_chunkBy.chunkBy;
+exports.combinations = require_combinations.combinations;
+exports.compact = require_compact.compact;
+exports.countBy = require_countBy.countBy;
+exports.difference = require_difference.difference;
+exports.differenceBy = require_differenceBy.differenceBy;
+exports.differenceWith = require_differenceWith.differenceWith;
+exports.drop = require_drop.drop;
+exports.dropRight = require_dropRight.dropRight;
+exports.dropRightWhile = require_dropRightWhile.dropRightWhile;
+exports.dropWhile = require_dropWhile.dropWhile;
+exports.filter = require_filter.filter;
+exports.find = require_find.find;
+exports.findIndex = require_findIndex.findIndex;
+exports.findLast = require_findLast.findLast;
+exports.findLastIndex = require_findLastIndex.findLastIndex;
+exports.flatMap = require_flatMap.flatMap;
+exports.flatMapDeep = require_flatMapDeep.flatMapDeep;
+exports.flatten = require_flatten.flatten;
+exports.flattenDeep = require_flattenDeep.flattenDeep;
+exports.forEach = require_forEach.forEach;
+exports.groupBy = require_groupBy.groupBy;
+exports.head = require_head.head;
+exports.initial = require_initial.initial;
+exports.intersection = require_intersection.intersection;
+exports.intersectionBy = require_intersectionBy.intersectionBy;
+exports.intersectionWith = require_intersectionWith.intersectionWith;
+exports.isSubset = require_isSubset.isSubset;
+exports.isSubsetWith = require_isSubsetWith.isSubsetWith;
+exports.join = require_join.join;
+exports.keyBy = require_keyBy.keyBy;
+exports.last = require_last.last;
+exports.length = require_length.length;
+exports.map = require_map.map;
+exports.maxBy = require_maxBy.maxBy;
+exports.minBy = require_minBy.minBy;
+exports.orderBy = require_orderBy.orderBy;
+exports.partition = require_partition.partition;
+exports.reverse = require_reverse.reverse;
+exports.sample = require_sample.sample;
+exports.sampleSize = require_sampleSize.sampleSize;
+exports.shuffle = require_shuffle.shuffle;
+exports.sortBy = require_sortBy.sortBy;
+exports.tail = require_tail.tail;
+exports.take = require_take.take;
+exports.takeRight = require_takeRight.takeRight;
+exports.takeRightWhile = require_takeRightWhile.takeRightWhile;
+exports.takeWhile = require_takeWhile.takeWhile;
+exports.toFilled = require_toFilled.toFilled;
+exports.union = require_union.union;
+exports.unionBy = require_unionBy.unionBy;
+exports.unionWith = require_unionWith.unionWith;
+exports.uniq = require_uniq.uniq;
+exports.uniqBy = require_uniqBy.uniqBy;
+exports.uniqWith = require_uniqWith.uniqWith;
+exports.unzip = require_unzip.unzip;
+exports.unzipWith = require_unzipWith.unzipWith;
+exports.windowed = require_windowed.windowed;
+exports.without = require_without.without;
+exports.xor = require_xor.xor;
+exports.xorBy = require_xorBy.xorBy;
+exports.xorWith = require_xorWith.xorWith;
+exports.zip = require_zip.zip;
+exports.zipObject = require_zipObject.zipObject;
+exports.zipWith = require_zipWith.zipWith;

package/dist/fp/array/index.mjs

@@ -1,68 +1,69 @@
-import "./at.mjs";
-import "./cartesianProduct.mjs";
-import "./chunk.mjs";
-import "./chunkBy.mjs";
-import "./combinations.mjs";
-import "./compact.mjs";
-import "./countBy.mjs";
-import "./difference.mjs";
-import "./differenceBy.mjs";
-import "./differenceWith.mjs";
-import "./drop.mjs";
-import "./dropRight.mjs";
-import "./dropRightWhile.mjs";
-import "./dropWhile.mjs";
-import "./filter.mjs";
-import "./find.mjs";
-import "./findIndex.mjs";
-import "./findLast.mjs";
-import "./findLastIndex.mjs";
-import "./flatMap.mjs";
-import "./flatMapDeep.mjs";
-import "./flatten.mjs";
-import "./flattenDeep.mjs";
-import "./forEach.mjs";
-import "./groupBy.mjs";
-import "./head.mjs";
-import "./initial.mjs";
-import "./intersection.mjs";
-import "./intersectionBy.mjs";
-import "./intersectionWith.mjs";
-import "./isSubset.mjs";
-import "./isSubsetWith.mjs";
-import "./join.mjs";
-import "./keyBy.mjs";
-import "./last.mjs";
-import "./length.mjs";
-import "./map.mjs";
-import "./maxBy.mjs";
-import "./minBy.mjs";
-import "./orderBy.mjs";
-import "./partition.mjs";
-import "./reverse.mjs";
-import "./sample.mjs";
-import "./sampleSize.mjs";
-import "./shuffle.mjs";
-import "./sortBy.mjs";
-import "./tail.mjs";
-import "./take.mjs";
-import "./takeRight.mjs";
-import "./takeRightWhile.mjs";
-import "./takeWhile.mjs";
-import "./toFilled.mjs";
-import "./union.mjs";
-import "./unionBy.mjs";
-import "./unionWith.mjs";
-import "./uniq.mjs";
-import "./uniqBy.mjs";
-import "./uniqWith.mjs";
-import "./unzip.mjs";
-import "./unzipWith.mjs";
-import "./windowed.mjs";
-import "./without.mjs";
-import "./xor.mjs";
-import "./xorBy.mjs";
-import "./xorWith.mjs";
-import "./zip.mjs";
-import "./zipObject.mjs";
-import "./zipWith.mjs";
+import { at } from "./at.mjs";
+import { cartesianProduct } from "./cartesianProduct.mjs";
+import { chunk } from "./chunk.mjs";
+import { chunkBy } from "./chunkBy.mjs";
+import { combinations } from "./combinations.mjs";
+import { compact } from "./compact.mjs";
+import { countBy } from "./countBy.mjs";
+import { difference } from "./difference.mjs";
+import { differenceBy } from "./differenceBy.mjs";
+import { differenceWith } from "./differenceWith.mjs";
+import { drop } from "./drop.mjs";
+import { dropRight } from "./dropRight.mjs";
+import { dropRightWhile } from "./dropRightWhile.mjs";
+import { dropWhile } from "./dropWhile.mjs";
+import { filter } from "./filter.mjs";
+import { find } from "./find.mjs";
+import { findIndex } from "./findIndex.mjs";
+import { findLast } from "./findLast.mjs";
+import { findLastIndex } from "./findLastIndex.mjs";
+import { flatMap } from "./flatMap.mjs";
+import { flatMapDeep } from "./flatMapDeep.mjs";
+import { flatten } from "./flatten.mjs";
+import { flattenDeep } from "./flattenDeep.mjs";
+import { forEach } from "./forEach.mjs";
+import { groupBy } from "./groupBy.mjs";
+import { head } from "./head.mjs";
+import { initial } from "./initial.mjs";
+import { intersection } from "./intersection.mjs";
+import { intersectionBy } from "./intersectionBy.mjs";
+import { intersectionWith } from "./intersectionWith.mjs";
+import { isSubset } from "./isSubset.mjs";
+import { isSubsetWith } from "./isSubsetWith.mjs";
+import { join } from "./join.mjs";
+import { keyBy } from "./keyBy.mjs";
+import { last } from "./last.mjs";
+import { length } from "./length.mjs";
+import { map } from "./map.mjs";
+import { maxBy } from "./maxBy.mjs";
+import { minBy } from "./minBy.mjs";
+import { orderBy } from "./orderBy.mjs";
+import { partition } from "./partition.mjs";
+import { reverse } from "./reverse.mjs";
+import { sample } from "./sample.mjs";
+import { sampleSize } from "./sampleSize.mjs";
+import { shuffle } from "./shuffle.mjs";
+import { sortBy } from "./sortBy.mjs";
+import { tail } from "./tail.mjs";
+import { take } from "./take.mjs";
+import { takeRight } from "./takeRight.mjs";
+import { takeRightWhile } from "./takeRightWhile.mjs";
+import { takeWhile } from "./takeWhile.mjs";
+import { toFilled } from "./toFilled.mjs";
+import { union } from "./union.mjs";
+import { unionBy } from "./unionBy.mjs";
+import { unionWith } from "./unionWith.mjs";
+import { uniq } from "./uniq.mjs";
+import { uniqBy } from "./uniqBy.mjs";
+import { uniqWith } from "./uniqWith.mjs";
+import { unzip } from "./unzip.mjs";
+import { unzipWith } from "./unzipWith.mjs";
+import { windowed } from "./windowed.mjs";
+import { without } from "./without.mjs";
+import { xor } from "./xor.mjs";
+import { xorBy } from "./xorBy.mjs";
+import { xorWith } from "./xorWith.mjs";
+import { zip } from "./zip.mjs";
+import { zipObject } from "./zipObject.mjs";
+import { zipWith } from "./zipWith.mjs";
+export { at, cartesianProduct, chunk, chunkBy, combinations, compact, countBy, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, filter, find, findIndex, findLast, findLastIndex, flatMap, flatMapDeep, flatten, flattenDeep, forEach, groupBy, head, initial, intersection, intersectionBy, intersectionWith, isSubset, isSubsetWith, join, keyBy, last, length, map, maxBy, minBy, orderBy, partition, reverse, sample, sampleSize, shuffle, sortBy, tail, take, takeRight, takeRightWhile, takeWhile, toFilled, union, unionBy, unionWith, uniq, uniqBy, uniqWith, unzip, unzipWith, windowed, without, xor, xorBy, xorWith, zip, zipObject, zipWith };

package/dist/fp/array/initial.d.mts

@@ -1,4 +1,3 @@
-//#region src/fp/array/initial.d.ts
 /**
  * Creates a function that returns every element except the last one.
  *
@@ -14,6 +13,4 @@
  * pipe([1, 2, 3], initial());
  * // => [1, 2]
  */
-declare function initial<T>(): (array: readonly T[]) => T[];
-//#endregion
-export { initial };
+export declare function initial<T>(): (array: readonly T[]) => T[];

package/dist/fp/array/initial.d.ts

@@ -1,4 +1,3 @@
-//#region src/fp/array/initial.d.ts
 /**
  * Creates a function that returns every element except the last one.
  *
@@ -14,6 +13,4 @@
  * pipe([1, 2, 3], initial());
  * // => [1, 2]
  */
-declare function initial<T>(): (array: readonly T[]) => T[];
-//#endregion
-export { initial };
+export declare function initial<T>(): (array: readonly T[]) => T[];

package/dist/fp/array/initial.js

@@ -1,5 +1,5 @@
 const require_initial = require("../../array/initial.js");
-//#region src/fp/array/initial.ts
+// src/fp/array/initial.ts
 /**
 * Creates a function that returns every element except the last one.
 *
@@ -20,5 +20,4 @@ function initial() {
 		return require_initial.initial(array);
 	};
 }
-//#endregion
 exports.initial = initial;

package/dist/fp/array/initial.mjs

@@ -1,5 +1,5 @@
 import { initial as initial$1 } from "../../array/initial.mjs";
-//#region src/fp/array/initial.ts
+// src/fp/array/initial.ts
 /**
 * Creates a function that returns every element except the last one.
 *
@@ -20,5 +20,4 @@ function initial() {
 		return initial$1(array);
 	};
 }
-//#endregion
 export { initial };

package/dist/fp/array/intersection.d.mts

@@ -1,4 +1,3 @@
-//#region src/fp/array/intersection.d.ts
 /**
  * Creates a function that keeps values from the piped array that are also present in another array.
  *
@@ -16,6 +15,4 @@
  * pipe([1, 2, 3], intersection([2, 4]));
  * // => [2]
  */
-declare function intersection<T>(secondArray: readonly T[]): (array: readonly T[]) => T[];
-//#endregion
-export { intersection };
+export declare function intersection<T>(secondArray: readonly T[]): (array: readonly T[]) => T[];

package/dist/fp/array/intersection.d.ts

@@ -1,4 +1,3 @@
-//#region src/fp/array/intersection.d.ts
 /**
  * Creates a function that keeps values from the piped array that are also present in another array.
  *
@@ -16,6 +15,4 @@
  * pipe([1, 2, 3], intersection([2, 4]));
  * // => [2]
  */
-declare function intersection<T>(secondArray: readonly T[]): (array: readonly T[]) => T[];
-//#endregion
-export { intersection };
+export declare function intersection<T>(secondArray: readonly T[]): (array: readonly T[]) => T[];