es-toolkit 1.49.0 → 1.50.0-dev.1975

package/dist/fp/flow.mjs

@@ -0,0 +1,50 @@
+import { pipe } from "./pipe.mjs";
+//#region src/fp/flow.ts
+/**
+* Performs left-to-right function composition, returning a **reusable function**
+* instead of running immediately. The first function may take any number of
+* arguments; every later function is unary and receives the previous result.
+*
+* `flow` is the deferred sibling of {@link pipe}: where `pipe(value, ...fns)`
+* threads a concrete value through the functions right away, `flow(...fns)`
+* builds a function you can call later (and reuse) with the data. Internally it
+* delegates to `pipe`, so lazy-capable functions (`map`, `filter`, `take`, …)
+* are fused exactly the same way and benefit from early termination.
+*
+* @param functions - The functions to compose. The first may be variadic; the
+*   rest are unary, each receiving the previous function's output.
+* @returns A function that, when called, applies every function left-to-right.
+*
+* @example
+* import { flow } from 'es-toolkit/fp';
+*
+* const addThenSquare = flow(
+*   (x: number, y: number) => x + y,
+*   n => n * n
+* );
+*
+* addThenSquare(1, 2); // => 9
+*
+* @example
+* import { flow, map, filter, take } from 'es-toolkit/fp';
+*
+* // A reusable lazy pipeline. Only the first two even squares are computed.
+* const firstTwoEvenSquares = flow(
+*   map((x: number) => x * x),
+*   filter(x => x % 2 === 0),
+*   take(2)
+* );
+*
+* firstTwoEvenSquares([1, 2, 3, 4, 5, 6, 7, 8]); // => [4, 16]
+*/
+function flow(...functions) {
+	const run = pipe;
+	return function(...args) {
+		if (functions.length === 0) return args[0];
+		if (args.length <= 1) return run(args[0], ...functions);
+		const [first, ...rest] = functions;
+		return run(first.apply(this, args), ...rest);
+	};
+}
+//#endregion
+export { flow };

package/dist/fp/index.d.mts

@@ -67,9 +67,10 @@ import { xorWith } from "./array/xorWith.mjs";
 import { zip } from "./array/zip.mjs";
 import { zipObject } from "./array/zipObject.mjs";
 import { zipWith } from "./array/zipWith.mjs";
+import { flow } from "./flow.mjs";
 import { add } from "./math/add.mjs";
 import { multiply } from "./math/multiply.mjs";
 import { omit } from "./object/omit.mjs";
 import { pick } from "./object/pick.mjs";
 import { pipe } from "./pipe.mjs";
-export { WindowedOptions, add, 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, multiply, omit, orderBy, partition, pick, pipe, 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 };
+export { WindowedOptions, add, at, cartesianProduct, chunk, chunkBy, combinations, compact, countBy, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, filter, find, findIndex, findLast, findLastIndex, flatMap, flatMapDeep, flatten, flattenDeep, flow, forEach, groupBy, head, initial, intersection, intersectionBy, intersectionWith, isSubset, isSubsetWith, join, keyBy, last, length, map, maxBy, minBy, multiply, omit, orderBy, partition, pick, pipe, 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/index.d.ts

@@ -67,9 +67,10 @@ import { xorWith } from "./array/xorWith.js";
 import { zip } from "./array/zip.js";
 import { zipObject } from "./array/zipObject.js";
 import { zipWith } from "./array/zipWith.js";
+import { flow } from "./flow.js";
 import { add } from "./math/add.js";
 import { multiply } from "./math/multiply.js";
 import { omit } from "./object/omit.js";
 import { pick } from "./object/pick.js";
 import { pipe } from "./pipe.js";
-export { WindowedOptions, add, 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, multiply, omit, orderBy, partition, pick, pipe, 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 };
+export { WindowedOptions, add, at, cartesianProduct, chunk, chunkBy, combinations, compact, countBy, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, filter, find, findIndex, findLast, findLastIndex, flatMap, flatMapDeep, flatten, flattenDeep, flow, forEach, groupBy, head, initial, intersection, intersectionBy, intersectionWith, isSubset, isSubsetWith, join, keyBy, last, length, map, maxBy, minBy, multiply, omit, orderBy, partition, pick, pipe, 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/index.js

@@ -68,13 +68,14 @@ const require_zip = require("./array/zip.js");
 const require_zipObject = require("./array/zipObject.js");
 const require_zipWith = require("./array/zipWith.js");
 require("./array/index.js");
+const require_pipe = require("./pipe.js");
+const require_flow = require("./flow.js");
 const require_add = require("./math/add.js");
 const require_multiply = require("./math/multiply.js");
 require("./math/index.js");
 const require_omit = require("./object/omit.js");
 const require_pick = require("./object/pick.js");
 require("./object/index.js");
-const require_pipe = require("./pipe.js");
 exports.add = require_add.add;
 exports.at = require_at.at;
 exports.cartesianProduct = require_cartesianProduct.cartesianProduct;
@@ -99,6 +100,7 @@ exports.flatMap = require_flatMap.flatMap;
 exports.flatMapDeep = require_flatMapDeep.flatMapDeep;
 exports.flatten = require_flatten.flatten;
 exports.flattenDeep = require_flattenDeep.flattenDeep;
+exports.flow = require_flow.flow;
 exports.forEach = require_forEach.forEach;
 exports.groupBy = require_groupBy.groupBy;
 exports.head = require_head.head;

package/dist/fp/index.mjs

@@ -67,11 +67,12 @@ import { zip } from "./array/zip.mjs";
 import { zipObject } from "./array/zipObject.mjs";
 import { zipWith } from "./array/zipWith.mjs";
 import "./array/index.mjs";
+import { pipe } from "./pipe.mjs";
+import { flow } from "./flow.mjs";
 import { add } from "./math/add.mjs";
 import { multiply } from "./math/multiply.mjs";
 import "./math/index.mjs";
 import { omit } from "./object/omit.mjs";
 import { pick } from "./object/pick.mjs";
 import "./object/index.mjs";
-import { pipe } from "./pipe.mjs";
-export { add, 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, multiply, omit, orderBy, partition, pick, pipe, 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 };
+export { add, at, cartesianProduct, chunk, chunkBy, combinations, compact, countBy, difference, differenceBy, differenceWith, drop, dropRight, dropRightWhile, dropWhile, filter, find, findIndex, findLast, findLastIndex, flatMap, flatMapDeep, flatten, flattenDeep, flow, forEach, groupBy, head, initial, intersection, intersectionBy, intersectionWith, isSubset, isSubsetWith, join, keyBy, last, length, map, maxBy, minBy, multiply, omit, orderBy, partition, pick, pipe, 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/pipe.js

@@ -54,22 +54,18 @@ function pipe(value, ...functions) {
 	return output;
 }
 function chunkFunctions(functions) {
-	if (functions.length === 0) return [];
-	let currentGroup = [functions[0]];
-	const result = [currentGroup];
-	let previousIsLazy = currentGroup[0].lazy != null;
-	if (previousIsLazy) currentGroup.lazy = true;
-	if (currentGroup[0].shortCircuit) currentGroup.shortCircuit = true;
-	for (let index = 1; index < functions.length; index++) {
+	const result = [];
+	let currentGroup;
+	for (let index = 0; index < functions.length; index++) {
 		const func = functions[index];
 		const isLazy = func.lazy != null;
-		if (isLazy !== previousIsLazy) {
-			currentGroup = [func];
+		if (currentGroup === void 0 || currentGroup.lazy !== isLazy) {
+			currentGroup = [];
+			currentGroup.lazy = isLazy;
 			result.push(currentGroup);
-		} else currentGroup.push(func);
-		if (isLazy) currentGroup.lazy = true;
+		}
+		currentGroup.push(func);
 		if (func.shortCircuit) currentGroup.shortCircuit = true;
-		previousIsLazy = isLazy;
 	}
 	return result;
 }

package/dist/fp/pipe.mjs

@@ -54,22 +54,18 @@ function pipe(value, ...functions) {
 	return output;
 }
 function chunkFunctions(functions) {
-	if (functions.length === 0) return [];
-	let currentGroup = [functions[0]];
-	const result = [currentGroup];
-	let previousIsLazy = currentGroup[0].lazy != null;
-	if (previousIsLazy) currentGroup.lazy = true;
-	if (currentGroup[0].shortCircuit) currentGroup.shortCircuit = true;
-	for (let index = 1; index < functions.length; index++) {
+	const result = [];
+	let currentGroup;
+	for (let index = 0; index < functions.length; index++) {
 		const func = functions[index];
 		const isLazy = func.lazy != null;
-		if (isLazy !== previousIsLazy) {
-			currentGroup = [func];
+		if (currentGroup === void 0 || currentGroup.lazy !== isLazy) {
+			currentGroup = [];
+			currentGroup.lazy = isLazy;
 			result.push(currentGroup);
-		} else currentGroup.push(func);
-		if (isLazy) currentGroup.lazy = true;
+		}
+		currentGroup.push(func);
 		if (func.shortCircuit) currentGroup.shortCircuit = true;
-		previousIsLazy = isLazy;
 	}
 	return result;
 }

package/dist/map/hasValue.js

@@ -1,4 +1,4 @@
-const require_isEqualsSameValueZero = require("../_internal/isEqualsSameValueZero.js");
+const require_eq = require("../compat/util/eq.js");
 //#region src/map/hasValue.ts
 /**
 * Checks if a Map contains a specific value.
@@ -26,7 +26,7 @@ const require_isEqualsSameValueZero = require("../_internal/isEqualsSameValueZer
 * // result2 will be: false
 */
 function hasValue(map, searchElement) {
-	for (const value of map.values()) if (require_isEqualsSameValueZero.isEqualsSameValueZero(value, searchElement)) return true;
+	for (const value of map.values()) if (require_eq.eq(value, searchElement)) return true;
 	return false;
 }
 //#endregion

package/dist/map/hasValue.mjs

@@ -1,4 +1,4 @@
-import { isEqualsSameValueZero } from "../_internal/isEqualsSameValueZero.mjs";
+import { eq } from "../compat/util/eq.mjs";
 //#region src/map/hasValue.ts
 /**
 * Checks if a Map contains a specific value.
@@ -26,7 +26,7 @@ import { isEqualsSameValueZero } from "../_internal/isEqualsSameValueZero.mjs";
 * // result2 will be: false
 */
 function hasValue(map, searchElement) {
-	for (const value of map.values()) if (isEqualsSameValueZero(value, searchElement)) return true;
+	for (const value of map.values()) if (eq(value, searchElement)) return true;
 	return false;
 }
 //#endregion

package/dist/predicate/isEqualWith.js

@@ -3,8 +3,7 @@ const require_getTag = require("../compat/_internal/getTag.js");
 const require_tags = require("../compat/_internal/tags.js");
 const require_isBuffer = require("./isBuffer.js");
 const require_isPlainObject = require("./isPlainObject.js");
-const require_isEqualsSameValueZero = require("../_internal/isEqualsSameValueZero.js");
-require("../compat/util/eq.js");
+const require_eq = require("../compat/util/eq.js");
 //#region src/predicate/isEqualWith.ts
 /**
 * Compares two values for equality using a custom comparison function.
@@ -71,7 +70,7 @@ function areObjectsEqual(a, b, stack, areValuesEqual) {
 		case require_tags.numberTag: {
 			const x = a.valueOf();
 			const y = b.valueOf();
-			return require_isEqualsSameValueZero.isEqualsSameValueZero(x, y);
+			return require_eq.eq(x, y);
 		}
 		case require_tags.booleanTag:
 		case require_tags.dateTag:

package/dist/predicate/isEqualWith.mjs

@@ -3,8 +3,7 @@ import { getTag } from "../compat/_internal/getTag.mjs";
 import { arrayBufferTag, arrayTag, bigInt64ArrayTag, bigUint64ArrayTag, booleanTag, dataViewTag, dateTag, errorTag, float32ArrayTag, float64ArrayTag, functionTag, int16ArrayTag, int32ArrayTag, int8ArrayTag, mapTag, numberTag, objectTag, regexpTag, setTag, stringTag, symbolTag, uint16ArrayTag, uint32ArrayTag, uint8ArrayTag, uint8ClampedArrayTag } from "../compat/_internal/tags.mjs";
 import { isBuffer } from "./isBuffer.mjs";
 import { isPlainObject } from "./isPlainObject.mjs";
-import { isEqualsSameValueZero } from "../_internal/isEqualsSameValueZero.mjs";
-import "../compat/util/eq.mjs";
+import { eq } from "../compat/util/eq.mjs";
 //#region src/predicate/isEqualWith.ts
 /**
 * Compares two values for equality using a custom comparison function.
@@ -68,7 +67,7 @@ function areObjectsEqual(a, b, stack, areValuesEqual) {
 	if (aTag !== bTag) return false;
 	switch (aTag) {
 		case stringTag: return a.toString() === b.toString();
-		case numberTag: return isEqualsSameValueZero(a.valueOf(), b.valueOf());
+		case numberTag: return eq(a.valueOf(), b.valueOf());
 		case booleanTag:
 		case dateTag:
 		case symbolTag: return Object.is(a.valueOf(), b.valueOf());

package/dist/string/deburr.js

@@ -54,7 +54,7 @@ function deburr(str) {
 	let result = "";
 	for (let i = 0; i < str.length; i++) {
 		const char = str[i];
-		if (char >= "̀" && char <= "ͯ" || char >= "︠" && char <= "︣") continue;
+		if (char >= "̀" && char <= "ͯ" || char >= "⃐" && char <= "⃿" || char >= "︠" && char <= "︯") continue;
 		result += deburrMap.get(char) ?? char;
 	}
 	return result;

package/dist/string/deburr.mjs

@@ -54,7 +54,7 @@ function deburr(str) {
 	let result = "";
 	for (let i = 0; i < str.length; i++) {
 		const char = str[i];
-		if (char >= "̀" && char <= "ͯ" || char >= "︠" && char <= "︣") continue;
+		if (char >= "̀" && char <= "ͯ" || char >= "⃐" && char <= "⃿" || char >= "︠" && char <= "︯") continue;
 		result += deburrMap.get(char) ?? char;
 	}
 	return result;

package/dist/types/DeepPartial.d.mts

@@ -0,0 +1,21 @@
+//#region src/types/DeepPartial.d.ts
+/**
+ * Makes all properties of `T` optional recursively, unlike the built-in
+ * `Partial` which only affects the first level.
+ *
+ * Recurses into plain objects, arrays/tuples (elements do not become sparse),
+ * and `Map`/`Set` contents. Functions, `Date`, and `RegExp` pass through
+ * unchanged.
+ *
+ * @template T - The type to make deeply optional.
+ *
+ * @example
+ * type Config = { server: { host: string; port: number }; debug: boolean };
+ * type ConfigPatch = DeepPartial<Config>;
+ * // => { server?: { host?: string; port?: number }; debug?: boolean }
+ *
+ * const patch: ConfigPatch = { server: { port: 8080 } }; // ok, host omitted
+ */
+type DeepPartial<T> = T extends ((...args: any[]) => unknown) | Date | RegExp ? T : T extends Map<infer K, infer V> ? Map<DeepPartial<K>, DeepPartial<V>> : T extends ReadonlyMap<infer K, infer V> ? ReadonlyMap<DeepPartial<K>, DeepPartial<V>> : T extends Set<infer U> ? Set<DeepPartial<U>> : T extends ReadonlySet<infer U> ? ReadonlySet<DeepPartial<U>> : T extends readonly unknown[] ? { [K in keyof T]: DeepPartial<T[K]> } : T extends object ? { [K in keyof T]?: DeepPartial<T[K]> } : T;
+//#endregion
+export { DeepPartial };

package/dist/types/DeepPartial.d.ts

@@ -0,0 +1,21 @@
+//#region src/types/DeepPartial.d.ts
+/**
+ * Makes all properties of `T` optional recursively, unlike the built-in
+ * `Partial` which only affects the first level.
+ *
+ * Recurses into plain objects, arrays/tuples (elements do not become sparse),
+ * and `Map`/`Set` contents. Functions, `Date`, and `RegExp` pass through
+ * unchanged.
+ *
+ * @template T - The type to make deeply optional.
+ *
+ * @example
+ * type Config = { server: { host: string; port: number }; debug: boolean };
+ * type ConfigPatch = DeepPartial<Config>;
+ * // => { server?: { host?: string; port?: number }; debug?: boolean }
+ *
+ * const patch: ConfigPatch = { server: { port: 8080 } }; // ok, host omitted
+ */
+type DeepPartial<T> = T extends ((...args: any[]) => unknown) | Date | RegExp ? T : T extends Map<infer K, infer V> ? Map<DeepPartial<K>, DeepPartial<V>> : T extends ReadonlyMap<infer K, infer V> ? ReadonlyMap<DeepPartial<K>, DeepPartial<V>> : T extends Set<infer U> ? Set<DeepPartial<U>> : T extends ReadonlySet<infer U> ? ReadonlySet<DeepPartial<U>> : T extends readonly unknown[] ? { [K in keyof T]: DeepPartial<T[K]> } : T extends object ? { [K in keyof T]?: DeepPartial<T[K]> } : T;
+//#endregion
+export { DeepPartial };

package/dist/types/DeepReadonly.d.mts

@@ -0,0 +1,22 @@
+//#region src/types/DeepReadonly.d.ts
+/**
+ * Makes all properties of `T` readonly recursively, unlike the built-in
+ * `Readonly` which only affects the first level.
+ *
+ * Arrays and tuples become readonly, and `Map`/`Set` become
+ * `ReadonlyMap`/`ReadonlySet`. Functions, `Date`, and `RegExp` pass through
+ * unchanged.
+ *
+ * @template T - The type to make deeply readonly.
+ *
+ * @example
+ * type State = { user: { name: string; tags: string[] } };
+ * type FrozenState = DeepReadonly<State>;
+ * // => { readonly user: { readonly name: string; readonly tags: readonly string[] } }
+ *
+ * declare const state: FrozenState;
+ * state.user.name = 'x'; // error: name is readonly
+ */
+type DeepReadonly<T> = T extends ((...args: any[]) => unknown) | Date | RegExp ? T : T extends ReadonlyMap<infer K, infer V> ? ReadonlyMap<DeepReadonly<K>, DeepReadonly<V>> : T extends ReadonlySet<infer U> ? ReadonlySet<DeepReadonly<U>> : T extends object ? { readonly [K in keyof T]: DeepReadonly<T[K]> } : T;
+//#endregion
+export { DeepReadonly };

package/dist/types/DeepReadonly.d.ts

@@ -0,0 +1,22 @@
+//#region src/types/DeepReadonly.d.ts
+/**
+ * Makes all properties of `T` readonly recursively, unlike the built-in
+ * `Readonly` which only affects the first level.
+ *
+ * Arrays and tuples become readonly, and `Map`/`Set` become
+ * `ReadonlyMap`/`ReadonlySet`. Functions, `Date`, and `RegExp` pass through
+ * unchanged.
+ *
+ * @template T - The type to make deeply readonly.
+ *
+ * @example
+ * type State = { user: { name: string; tags: string[] } };
+ * type FrozenState = DeepReadonly<State>;
+ * // => { readonly user: { readonly name: string; readonly tags: readonly string[] } }
+ *
+ * declare const state: FrozenState;
+ * state.user.name = 'x'; // error: name is readonly
+ */
+type DeepReadonly<T> = T extends ((...args: any[]) => unknown) | Date | RegExp ? T : T extends ReadonlyMap<infer K, infer V> ? ReadonlyMap<DeepReadonly<K>, DeepReadonly<V>> : T extends ReadonlySet<infer U> ? ReadonlySet<DeepReadonly<U>> : T extends object ? { readonly [K in keyof T]: DeepReadonly<T[K]> } : T;
+//#endregion
+export { DeepReadonly };

package/dist/types/NonEmptyArray.d.mts

@@ -0,0 +1,14 @@
+//#region src/types/NonEmptyArray.d.ts
+/**
+ * An array guaranteed to have at least one element.
+ * The first element resolves to `T` instead of `T | undefined`.
+ *
+ * @template T - The type of the elements.
+ *
+ * @example
+ * const a: NonEmptyArray<number> = [1, 2, 3]; // ok
+ * const b: NonEmptyArray<number> = [];        // error: empty array not allowed
+ */
+type NonEmptyArray<T> = [T, ...T[]];
+//#endregion
+export { NonEmptyArray };

package/dist/types/NonEmptyArray.d.ts

@@ -0,0 +1,14 @@
+//#region src/types/NonEmptyArray.d.ts
+/**
+ * An array guaranteed to have at least one element.
+ * The first element resolves to `T` instead of `T | undefined`.
+ *
+ * @template T - The type of the elements.
+ *
+ * @example
+ * const a: NonEmptyArray<number> = [1, 2, 3]; // ok
+ * const b: NonEmptyArray<number> = [];        // error: empty array not allowed
+ */
+type NonEmptyArray<T> = [T, ...T[]];
+//#endregion
+export { NonEmptyArray };

package/dist/types/Simplify.d.mts

@@ -0,0 +1,18 @@
+//#region src/types/Simplify.d.ts
+/**
+ * Flattens an intersection or mapped type into a single, readable object type.
+ *
+ * The result is equivalent for plain object types, but editors show the
+ * resolved shape (`{ a: 1; b: 2 }`) instead of `A & B`.
+ *
+ * @template T - The type to flatten.
+ *
+ * @example
+ * type A = { name: string };
+ * type B = { age: number };
+ * type User = Simplify<A & B>;
+ * // hover => { name: string; age: number }   (instead of A & B)
+ */
+type Simplify<T> = { [K in keyof T]: T[K] } & {};
+//#endregion
+export { Simplify };

package/dist/types/Simplify.d.ts

@@ -0,0 +1,18 @@
+//#region src/types/Simplify.d.ts
+/**
+ * Flattens an intersection or mapped type into a single, readable object type.
+ *
+ * The result is equivalent for plain object types, but editors show the
+ * resolved shape (`{ a: 1; b: 2 }`) instead of `A & B`.
+ *
+ * @template T - The type to flatten.
+ *
+ * @example
+ * type A = { name: string };
+ * type B = { age: number };
+ * type User = Simplify<A & B>;
+ * // hover => { name: string; age: number }   (instead of A & B)
+ */
+type Simplify<T> = { [K in keyof T]: T[K] } & {};
+//#endregion
+export { Simplify };

package/dist/types/ValueOf.d.mts

@@ -0,0 +1,14 @@
+//#region src/types/ValueOf.d.ts
+/**
+ * Creates a union of all value types in `T`. The value-side counterpart to `keyof`.
+ *
+ * @template T - The object type to read values from.
+ *
+ * @example
+ * const STATUS = { IDLE: 'idle', ERROR: 'error' } as const;
+ * type Status = ValueOf<typeof STATUS>;
+ * // => 'idle' | 'error'
+ */
+type ValueOf<T> = T[keyof T];
+//#endregion
+export { ValueOf };

package/dist/types/ValueOf.d.ts

@@ -0,0 +1,14 @@
+//#region src/types/ValueOf.d.ts
+/**
+ * Creates a union of all value types in `T`. The value-side counterpart to `keyof`.
+ *
+ * @template T - The object type to read values from.
+ *
+ * @example
+ * const STATUS = { IDLE: 'idle', ERROR: 'error' } as const;
+ * type Status = ValueOf<typeof STATUS>;
+ * // => 'idle' | 'error'
+ */
+type ValueOf<T> = T[keyof T];
+//#endregion
+export { ValueOf };

package/dist/types/Writable.d.mts

@@ -0,0 +1,15 @@
+//#region src/types/Writable.d.ts
+/**
+ * Removes the `readonly` modifier from all properties of `T`.
+ * The inverse of the built-in `Readonly`.
+ *
+ * @template T - The object type to make writable.
+ *
+ * @example
+ * type Config = { readonly host: string; readonly port: number };
+ * type MutableConfig = Writable<Config>;
+ * // => { host: string; port: number }
+ */
+type Writable<T> = { -readonly [K in keyof T]: T[K] };
+//#endregion
+export { Writable };

package/dist/types/Writable.d.ts

@@ -0,0 +1,15 @@
+//#region src/types/Writable.d.ts
+/**
+ * Removes the `readonly` modifier from all properties of `T`.
+ * The inverse of the built-in `Readonly`.
+ *
+ * @template T - The object type to make writable.
+ *
+ * @example
+ * type Config = { readonly host: string; readonly port: number };
+ * type MutableConfig = Writable<Config>;
+ * // => { host: string; port: number }
+ */
+type Writable<T> = { -readonly [K in keyof T]: T[K] };
+//#endregion
+export { Writable };

package/dist/types/index.d.mts

@@ -0,0 +1,7 @@
+import { DeepPartial } from "./DeepPartial.mjs";
+import { DeepReadonly } from "./DeepReadonly.mjs";
+import { NonEmptyArray } from "./NonEmptyArray.mjs";
+import { Simplify } from "./Simplify.mjs";
+import { ValueOf } from "./ValueOf.mjs";
+import { Writable } from "./Writable.mjs";
+export { type DeepPartial, type DeepReadonly, type NonEmptyArray, type Simplify, type ValueOf, type Writable };

package/dist/types/index.d.ts

@@ -0,0 +1,7 @@
+import { DeepPartial } from "./DeepPartial.js";
+import { DeepReadonly } from "./DeepReadonly.js";
+import { NonEmptyArray } from "./NonEmptyArray.js";
+import { Simplify } from "./Simplify.js";
+import { ValueOf } from "./ValueOf.js";
+import { Writable } from "./Writable.js";
+export { type DeepPartial, type DeepReadonly, type NonEmptyArray, type Simplify, type ValueOf, type Writable };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "es-toolkit",
-  "version": "1.49.0",
+  "version": "1.50.0-dev.1975+a443efd8",
   "description": "A state-of-the-art, high-performance JavaScript utility library with a small bundle size and strong type annotations.",
   "homepage": "https://es-toolkit.dev",
   "bugs": "https://github.com/toss/es-toolkit/issues",
@@ -164,6 +164,14 @@
         "default": "./dist/string/index.js"
       }
     },
+    "./types": {
+      "import": {
+        "types": "./dist/types/index.d.mts"
+      },
+      "require": {
+        "types": "./dist/types/index.d.ts"
+      }
+    },
     "./util": {
       "import": {
         "types": "./dist/util/index.d.mts",
@@ -197,10 +205,11 @@
   ],
   "workspaces": [
     "docs",
-    "benchmarks"
+    "benchmarks",
+    "tests/types"
   ],
   "scripts": {
-    "bench": "vitest bench",
+    "bench": "yarn workspace benchmarks bench",
     "build": "tsdown && ./.scripts/postbuild.sh",
     "format": "prettier --write .",
     "gen:benchmark": "node ./.scripts/generate-benchmark.mjs",
@@ -208,7 +217,7 @@
     "lint": "eslint --config eslint.config.mjs --concurrency=auto",
     "packlint": "packlint sort -R",
     "prepack": "yarn build",
-    "test": "vitest --coverage --typecheck",
+    "test": "vitest --coverage",
     "transform": "jscodeshift -t ./.scripts/tests/transform-lodash-test.ts $0 && prettier --write $0",
     "typecheck": "tsc --noEmit"
   },
@@ -220,11 +229,10 @@
     "@trivago/prettier-plugin-sort-imports": "^4.3.0",
     "@types/broken-link-checker": "0.7.3",
     "@types/jscodeshift": "^0.12.0",
-    "@types/lodash": "4.17.20",
     "@types/node": "^24.10.9",
     "@types/tar": "^6.1.13",
     "@typescript-eslint/parser": "^8.26.1",
-    "@vitest/coverage-istanbul": "^4.0.17",
+    "@vitest/coverage-istanbul": "^4.1.10",
     "@vitest/eslint-plugin": "^1.6.6",
     "@vue/compiler-sfc": "^3.5.10",
     "broken-link-checker": "0.7.8",
@@ -248,7 +256,7 @@
     "typescript": "^5.8.2",
     "typescript-eslint": "^8.6.0",
     "vercel": "^54.4.1",
-    "vitest": "^4.0.17"
+    "vitest": "^4.1.10"
   },
   "publishConfig": {
     "access": "public",
@@ -405,6 +413,14 @@
           "default": "./dist/string/index.js"
         }
       },
+      "./types": {
+        "import": {
+          "types": "./dist/types/index.d.mts"
+        },
+        "require": {
+          "types": "./dist/types/index.d.ts"
+        }
+      },
       "./util": {
         "import": {
           "types": "./dist/util/index.d.mts",

package/types.d.ts

@@ -0,0 +1 @@
+export * from './dist/types';

package/dist/_internal/isEqualsSameValueZero.d.mts

@@ -1,17 +0,0 @@
-//#region src/_internal/isEqualsSameValueZero.d.ts
-/**
- * Performs a `SameValueZero` comparison between two values to determine if they are equivalent.
- *
- * @param {any} value - The value to compare.
- * @param {any} other - The other value to compare.
- * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
- *
- * @example
- * eq(1, 1); // true
- * eq(0, -0); // true
- * eq(NaN, NaN); // true
- * eq('a', Object('a')); // false
- */
-declare function isEqualsSameValueZero(value: any, other: any): boolean;
-//#endregion
-export { isEqualsSameValueZero };

package/dist/_internal/isEqualsSameValueZero.d.ts

@@ -1,17 +0,0 @@
-//#region src/_internal/isEqualsSameValueZero.d.ts
-/**
- * Performs a `SameValueZero` comparison between two values to determine if they are equivalent.
- *
- * @param {any} value - The value to compare.
- * @param {any} other - The other value to compare.
- * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
- *
- * @example
- * eq(1, 1); // true
- * eq(0, -0); // true
- * eq(NaN, NaN); // true
- * eq('a', Object('a')); // false
- */
-declare function isEqualsSameValueZero(value: any, other: any): boolean;
-//#endregion
-export { isEqualsSameValueZero };