remeda - npm Package Compare versions

Comparing version 2.0.0-beta.2 to 2.0.0-beta.3

dist/commonjs/index.js

@@ -28,2 +28,3 @@ "use strict";
 __exportStar(require("./conditional"), exports);
+__exportStar(require("./constant"), exports);
 __exportStar(require("./countBy"), exports);
@@ -35,2 +36,3 @@ __exportStar(require("./createPipe"), exports);
 __exportStar(require("./divide"), exports);
+__exportStar(require("./doNothing"), exports);
 __exportStar(require("./drop"), exports);
@@ -41,2 +43,3 @@ __exportStar(require("./dropFirstBy"), exports);
 __exportStar(require("./dropWhile"), exports);
+__exportStar(require("./entries"), exports);
 __exportStar(require("./equals"), exports);
@@ -58,5 +61,8 @@ __exportStar(require("./evolve"), exports);
 __exportStar(require("./forEachObj"), exports);
+__exportStar(require("./fromEntries"), exports);
+__exportStar(require("./fromKeys"), exports);
 __exportStar(require("./fromPairs"), exports);
 __exportStar(require("./groupBy"), exports);
 __exportStar(require("./hasAtLeast"), exports);
+__exportStar(require("./hasSubObject"), exports);
 __exportStar(require("./identity"), exports);
@@ -78,3 +84,5 @@ __exportStar(require("./indexBy"), exports);
 __exportStar(require("./isNonNull"), exports);
+__exportStar(require("./isNonNullish"), exports);
 __exportStar(require("./isNot"), exports);
+__exportStar(require("./isNullish"), exports);
 __exportStar(require("./isNumber"), exports);
@@ -116,2 +124,3 @@ __exportStar(require("./isObject"), exports);
 __exportStar(require("./pipe"), exports);
+__exportStar(require("./piped"), exports);
 __exportStar(require("./prop"), exports);
@@ -157,2 +166,5 @@ __exportStar(require("./purry"), exports);
 __exportStar(require("./uniqWith"), exports);
+__exportStar(require("./unique"), exports);
+__exportStar(require("./uniqueBy"), exports);
+__exportStar(require("./uniqueWith"), exports);
 __exportStar(require("./values"), exports);
@@ -159,0 +171,0 @@ __exportStar(require("./zip"), exports);

dist/commonjs/merge.js

@@ -20,4 +20,4 @@ "use strict";
 exports.merge = merge;
-function _merge(a, b) {
-    return __assign(__assign({}, a), b);
+function _merge(data, source) {
+    return __assign(__assign({}, data), source);
 }

dist/commonjs/omit.js

@@ -26,3 +26,3 @@ "use strict";
 exports.omit = void 0;
-var fromPairs_1 = require("./fromPairs");
+var fromEntries_1 = require("./fromEntries");
 var hasAtLeast_1 = require("./hasAtLeast");
@@ -47,3 +47,3 @@ var purry_1 = require("./purry");
     var asSet = new Set(propNames);
-    return (0, fromPairs_1.fromPairs)(Object.entries(data).filter(function (_a) {
+    return (0, fromEntries_1.fromEntries)(Object.entries(data).filter(function (_a) {
         var key = _a[0];
@@ -50,0 +50,0 @@ return !asSet.has(key);

dist/es/index.js

@@ -12,2 +12,3 @@ export * from "./add";
 export * from "./conditional";
+export * from "./constant";
 export * from "./countBy";
@@ -19,2 +20,3 @@ export * from "./createPipe";
 export * from "./divide";
+export * from "./doNothing";
 export * from "./drop";
@@ -25,2 +27,3 @@ export * from "./dropFirstBy";
 export * from "./dropWhile";
+export * from "./entries";
 export * from "./equals";
@@ -42,5 +45,8 @@ export * from "./evolve";
 export * from "./forEachObj";
+export * from "./fromEntries";
+export * from "./fromKeys";
 export * from "./fromPairs";
 export * from "./groupBy";
 export * from "./hasAtLeast";
+export * from "./hasSubObject";
 export * from "./identity";
@@ -62,3 +68,5 @@ export * from "./indexBy";
 export * from "./isNonNull";
+export * from "./isNonNullish";
 export * from "./isNot";
+export * from "./isNullish";
 export * from "./isNumber";
@@ -100,2 +108,3 @@ export * from "./isObject";
 export * from "./pipe";
+export * from "./piped";
 export * from "./prop";
@@ -141,2 +150,5 @@ export * from "./purry";
 export * from "./uniqWith";
+export * from "./unique";
+export * from "./uniqueBy";
+export * from "./uniqueWith";
 export * from "./values";
@@ -143,0 +155,0 @@ export * from "./zip";

dist/es/merge.js

@@ -16,4 +16,4 @@ var __assign = (this && this.__assign) || function () {
 }
-function _merge(a, b) {
-    return __assign(__assign({}, a), b);
+function _merge(data, source) {
+    return __assign(__assign({}, data), source);
 }

dist/es/omit.js

@@ -23,3 +23,3 @@ var __assign = (this && this.__assign) || function () {
 };
-import { fromPairs } from "./fromPairs";
+import { fromEntries } from "./fromEntries";
 import { hasAtLeast } from "./hasAtLeast";
@@ -43,3 +43,3 @@ import { purry } from "./purry";
     var asSet = new Set(propNames);
-    return fromPairs(Object.entries(data).filter(function (_a) {
+    return fromEntries(Object.entries(data).filter(function (_a) {
         var key = _a[0];
@@ -46,0 +46,0 @@ return !asSet.has(key);

dist/types/add.d.ts

@@ -19,3 +19,2 @@ /**
  *
- * @param value - The number.
  * @param addend - The number to add to the value.
@@ -22,0 +21,0 @@ * @signature

dist/types/ceil.d.ts

@@ -24,3 +24,2 @@ /**
  *
- * @param value - The number to round up.
  * @param precision - The precision to round up to. Must be an integer between -15 and 15.
@@ -27,0 +26,0 @@ * @signature

dist/types/clamp.d.ts

@@ -23,3 +23,2 @@ type Limits = {
  *
- * @param value - The number.
  * @param limits - The bounds limits.
@@ -26,0 +25,0 @@ * @signature

dist/types/compact.d.ts

@@ -5,4 +5,3 @@ /**
  *
- * **DEPRECATED: equivalent to `R.filter(R.isTruthy)` and so will be removed in
- * v2**.
+ * ! **DEPRECATED**: Use `R.filter(items, R.isTruthy)`. Will be removed in V2!
  *
@@ -14,6 +13,6 @@ * @param items - The array to compact.
  *    R.compact([0, 1, false, 2, '', 3]) // => [1, 2, 3]
- * @category Array
- * @deprecated Equivalent to `R.filter(R.isTruthy)` and so will be removed in v2.
+ * @category Deprecated
+ * @deprecated Use `R.filter(items, R.isTruthy)`. Will be removed in V2!
  */
 export declare function compact<T>(items: ReadonlyArray<T | "" | 0 | false | null | undefined>): Array<T>;
 //# sourceMappingURL=compact.d.ts.map

dist/types/conditional.d.ts

@@ -26,3 +26,2 @@ type Case<In, Out, Thru extends In = In> = readonly [
  *
- * @param data - The input data to be evaluated against the provided cases.
  * @param cases - A list of (up to 10) tuples, each defining a case. Each tuple
@@ -29,0 +28,0 @@ * consists of a predicate (or a type-predicate) and a transformer function that

dist/types/countBy.d.ts

@@ -5,3 +5,3 @@ import type { Pred, PredIndexed } from "./_types";
  *
- * **DEPRECATED: equivalent to `R.filter(fn).length` and so will be removed in v2**.
+ * ! **DEPRECATED**: Use `R.filter(items, fn).length`. Will be removed in v2!
  *
@@ -16,6 +16,21 @@ * @param items - The input data.
  * @indexed
- * @category Array
- * @deprecated Equivalent to `R.filter(fn).length` and so will be removed in v2.
+ * @category Deprecated
+ * @deprecated Use `R.filter(items, fn).length`. Will be removed in v2.
  */
 export declare function countBy<T>(items: ReadonlyArray<T>, fn: Pred<T, boolean>): number;
+/**
+ * Counts how many values of the collection pass the specified predicate.
+ *
+ * ! **DEPRECATED**: Use `<T>(items: ReadonlyArray<T>) => R.filter(items, fn).length` or if in a pipe: `R.pipe(..., R.filter(fn), R.length(), ...)`. Will be removed in v2!
+ *
+ * @param fn - The predicate.
+ * @signature
+ *    R.countBy(fn)(array)
+ * @example
+ *    R.pipe([1, 2, 3, 4, 5], R.countBy(x => x % 2 === 0)) // => 2
+ * @dataLast
+ * @indexed
+ * @category Deprecated
+ * @deprecated Use `<T>(items: ReadonlyArray<T>) => R.filter(items, fn).length` or if in a pipe: `R.pipe(..., R.filter(fn), R.length(), ...)`. Will be removed in v2.
+ */
 export declare function countBy<T>(fn: Pred<T, boolean>): (array: ReadonlyArray<T>) => number;
@@ -26,5 +41,7 @@ export declare namespace countBy {
      *
+     * ! **DEPRECATED**: Use `R.filter.indexed(items, fn).length`. Will be removed in v2!
+     *
      * @example
      *    R.pipe([1, 2, 3, 4, 5], R.countBy(x => x % 2 === 0)) // => 2
-     * @deprecated Equivalent to `R.filter.indexed(fn).length` and so will be removed in v2.
+     * @deprecated Use `R.filter.indexed(items, fn).length`. Will be removed in v2.
      */
@@ -35,5 +52,7 @@ function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): number;
      *
+     * ! **DEPRECATED**: Use `<T>(items: ReadonlyArray<T>) => R.filter.indexed(items, fn).length` or if in a pipe: `R.pipe(..., R.filter.indexed(fn), R.length(), ...)`. Will be removed in v2!
+     *
      * @example
      *    R.pipe([1, 2, 3, 4, 5], R.countBy(x => x % 2 === 0)) // => 2
-     * @deprecated Equivalent to `R.filter.indexed(fn).length` and so will be removed in v2.
+     * @deprecated Use `<T>(items: ReadonlyArray<T>) => R.filter.indexed(items, fn).length` or if in a pipe: `R.pipe(..., R.filter.indexed(fn), R.length(), ...)`. Will be removed in v2.
      */
@@ -40,0 +59,0 @@ function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => number;

dist/types/createPipe.d.ts

 /**
  * Creates a data-last pipe function. First function must be always annotated. Other functions are automatically inferred.
  *
+ * ! **DEPRECATED**: Use `R.piped(op1, op2, op3)`. Will be removed in V2!
+ *
  * @signature
@@ -11,3 +13,4 @@ *    R.createPipe(op1, op2, op3)(data);
  *    )(1) // => 6
- * @category Function
+ * @category Deprecated
+ * @deprecated Use `R.piped(op1, op2, op3)`. Will be removed in V2!
  */
@@ -14,0 +17,0 @@ export declare function createPipe<A, B>(op1: (input: A) => B): (value: A) => B;

dist/types/difference.d.ts

@@ -5,4 +5,3 @@ import type { LazyEvaluator } from "./pipe";
  *
- * **DEPRECATED: equivalent to `R.filter(array, R.isNot(R.isIncludedIn(other)))`
- * and will be removed in v2.**.
+ * ! **DEPRECATED**: Use `R.filter(array, R.isNot(R.isIncludedIn(other)))`. Will be removed in v2!
  *
@@ -17,4 +16,4 @@ * @param array - The source array.
  * @pipeable
- * @category Array
- * @deprecated Equivalent to `R.filter(array, R.isNot(R.isIncludedIn(other)))` and will be removed in v2.
+ * @category Deprecated
+ * @deprecated Use `R.filter(array, R.isNot(R.isIncludedIn(other)))`. Will be removed in v2.
  */
@@ -25,4 +24,3 @@ export declare function difference<T>(array: ReadonlyArray<T>, other: ReadonlyArray<T>): Array<T>;
  *
- * **DEPRECATED: equivalent to `R.filter(R.isNot(R.isIncludedIn(other)))` and
- * will be removed in v2.**.
+ * ! **DEPRECATED**: Use `R.filter(R.isNot(R.isIncludedIn(other)))`. Will be removed in v2!
  *
@@ -41,4 +39,4 @@ * @param other - The values to exclude.
  * @pipeable
- * @category Array
- * @deprecated Equivalent to `R.filter(R.isNot(R.isIncludedIn(other)))` and will be removed in v2.
+ * @category Deprecated
+ * @deprecated Use `R.filter(R.isNot(R.isIncludedIn(other)))`. Will be removed in v2.
  */
@@ -45,0 +43,0 @@ export declare function difference<T, K>(other: ReadonlyArray<T>): (array: ReadonlyArray<K>) => Array<T>;

dist/types/divide.d.ts

@@ -18,3 +18,2 @@ /**
  *
- * @param value - The number.
  * @param divisor - The number to divide the value by.
@@ -21,0 +20,0 @@ * @signature

dist/types/drop.d.ts

@@ -19,3 +19,2 @@ import type { LazyEvaluator } from "./pipe";
  *
- * @param array - The target array.
  * @param n - The number of elements to skip.
@@ -22,0 +21,0 @@ * @signature

dist/types/dropFirstBy.d.ts

@@ -25,3 +25,2 @@ import type { OrderRule } from "./_purryOrderRules";
  *
- * @param data - The input array.
  * @param n - The number of items to drop. If `n` is non-positive no items would be dropped and a *clone* of the input would be returned, if `n` is bigger then data.length no items would be returned.
@@ -28,0 +27,0 @@ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.

dist/types/dropLast.d.ts

@@ -17,3 +17,2 @@ /**
  *
- * @param array - The target array.
  * @param n - The number of elements to skip.
@@ -20,0 +19,0 @@ * @signature

dist/types/equals.d.ts

@@ -5,3 +5,3 @@ /**
  *
- * **DEPRECATED: use R.isDeepEqual().**.
+ * ! **DEPRECATED**: Use `R.isDeepEqual(a, b)`. Will be removed in V2.
  *
@@ -17,4 +17,4 @@ * @param a - The first object to compare.
  * @dataFirst
- * @category Object
- * @deprecated Use `R.isDeepEqual`.
+ * @category Deprecated
+ * @deprecated Use `R.isDeepEqual(a, b)`. Will be removed in V2.
  */
@@ -26,3 +26,3 @@ export declare function equals(a: unknown, b: unknown): boolean;
  *
- * **DEPRECATED: use R.isDeepEqual().**.
+ * ! **DEPRECATED**: Use `R.isDeepEqual(b)`. Will be removed in V2.
  *
@@ -38,6 +38,6 @@ * @param a - The first object to compare.
  * @dataLast
- * @category Object
- * @deprecated Use `R.isDeepEqual`.
+ * @category Deprecated
+ * @deprecated Use `R.isDeepEqual(b)`. Will be removed in V2.
  */
 export declare function equals(a: unknown): (b: unknown) => boolean;
 //# sourceMappingURL=equals.d.ts.map

dist/types/evolve.d.ts

@@ -41,3 +41,3 @@ import type { IterableContainer } from "./_types";
  *
- * @param data - Object whose value is applied to the corresponding function
+ * @param object - Object whose value is applied to the corresponding function
  * that is defined in `evolver` at the same path.
@@ -77,4 +77,2 @@ * @param evolver - Object that include functions that is applied to
  *
- * @param data - Object whose value is applied to the corresponding function
- * that is defined in `evolver` at the same path.
  * @param evolver - Object that include functions that is applied to
@@ -81,0 +79,0 @@ * the corresponding value of `data` object at the same path.

dist/types/find.d.ts

@@ -6,3 +6,3 @@ import type { Pred, PredIndexed, PredIndexedOptional } from "./_types";
  *
- * @param items - The array.
+ * @param array - The array.
  * @param fn - The predicate.
@@ -9,0 +9,0 @@ * @signature

dist/types/findIndex.d.ts

@@ -6,3 +6,3 @@ import type { Pred, PredIndexed, PredIndexedOptional } from "./_types";
  *
- * @param items - The array.
+ * @param array - The array.
  * @param fn - The predicate.
@@ -24,3 +24,2 @@ * @signature
  *
- * @param items - The array.
  * @param fn - The predicate.
@@ -27,0 +26,0 @@ * @signature

dist/types/findLastIndex.d.ts

@@ -22,3 +22,2 @@ import type { Pred, PredIndexed } from "./_types";
  *
- * @param array - The array.
  * @param fn - The predicate.
@@ -25,0 +24,0 @@ * @signature

dist/types/first.d.ts

@@ -22,3 +22,2 @@ import type { IterableContainer } from "./_types";
  *
- * @param data - The array.
  * @returns The first element of the array.
@@ -25,0 +24,0 @@ * @signature

dist/types/firstBy.d.ts

@@ -9,3 +9,2 @@ import type { OrderRule } from "./_purryOrderRules";
  *
- * @param data - An array of items.
  * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
@@ -12,0 +11,0 @@ * @returns The first element by the order criteria, or `undefined` if the array

dist/types/flatMap.d.ts

@@ -19,3 +19,2 @@ import type { LazyEvaluator } from "./pipe";
  *
- * @param array - The array to map.
  * @param fn - The function mapper.
@@ -22,0 +21,0 @@ * @signature

dist/types/flatMapToObj.d.ts

 /**
  * Map each element of an array into an object using a defined callback function and flatten the result.
  *
+ * ! **DEPRECATED**: Use `R.fromEntries.strict(R.flatMap(array, fn))`. Will be removed in V2!
+ *
  * @param array - The array to map.
@@ -20,3 +22,4 @@ * @param fn - The mapping function, which should return an Array of key-value pairs, similar to Object.fromEntries.
  * @indexed
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.fromEntries.strict(R.flatMap(array, fn))`. Will be removed in V2!
  */
@@ -27,2 +30,4 @@ export declare function flatMapToObj<T, K extends PropertyKey, V>(array: ReadonlyArray<T>, fn: (element: T) => Array<[K, V]>): Record<K, V>;
  *
+ * ! **DEPRECATED**: Use `(array: ReadonlyArray<T>) => R.fromEntries.strict(R.flatMap(array, fn))` or if used in a pipe: `pipe(..., R.flatMap(fn), R.fromEntries.strict(), ...)`. Will be removed in V2!
+ *
  * @param fn - The mapping function, which should return an Array of key-value pairs, similar to Object.fromEntries.
@@ -47,9 +52,16 @@ * @returns The new mapped object.
  * @indexed
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `(array: ReadonlyArray<T>) => R.fromEntries.strict(R.flatMap(array, fn))` or if used in a pipe: `pipe(..., R.flatMap(fn), R.fromEntries.strict(), ...)`. Will be removed in V2!
  */
 export declare function flatMapToObj<T, K extends PropertyKey, V>(fn: (element: T) => Array<[K, V]>): (array: ReadonlyArray<T>) => Record<K, V>;
 export declare namespace flatMapToObj {
+    /**
+     * @deprecated Use `R.fromEntries.strict(R.flatten(R.map.indexed(array, fn)))`. Will be removed in V2!
+     */
     function indexed<T, K extends PropertyKey, V>(array: ReadonlyArray<T>, fn: (element: T, index: number, array: ReadonlyArray<T>) => Array<[K, V]>): Record<K, V>;
+    /**
+     * @deprecated Use `(array: ReadonlyArray<T>) => R.fromEntries.strict(R.flatten(R.map.indexed(array, fn)))` or if used in a pipe: `pipe(..., R.map.indexed(fn), R.flatten(), R.fromEntries.strict(), ...)`. Will be removed in V2!
+     */
     function indexed<T, K extends PropertyKey, V>(fn: (element: T, index: number, array: ReadonlyArray<T>) => Array<[K, V]>): (array: ReadonlyArray<T>) => Record<K, V>;
 }
 //# sourceMappingURL=flatMapToObj.d.ts.map

dist/types/flatten.d.ts

@@ -19,3 +19,2 @@ import type { LazyEvaluator } from "./pipe";
  *
- * @param items - The target array.
  * @signature
@@ -22,0 +21,0 @@ *   R.flatten()(array)

dist/types/flattenDeep.d.ts

@@ -21,3 +21,2 @@ import type { LazyEvaluator } from "./pipe";
  *
- * @param items - The target array.
  * @signature
@@ -24,0 +23,0 @@ *   R.flattenDeep()(array)

dist/types/floor.d.ts

@@ -24,3 +24,2 @@ /**
  *
- * @param value - The number to round down.
  * @param precision - The precision to round down to. Must be an integer between -15 and 15.
@@ -27,0 +26,0 @@ * @signature

dist/types/fromPairs.d.ts

@@ -14,2 +14,4 @@ import type { IterableContainer } from "./_types";
  *
+ * ! **DEPRECATED**: Use `R.fromEntries(pairs)`, for dataLast invocations use the functional form `R.fromEntries()`. Will be removed in V2!
+ *
  * @param pairs - The list of input tuples.
@@ -32,3 +34,4 @@ * @signature
  * @strict
- * @category Object
+ * @category Deprecated
+ * @deprecated Use `R.fromEntries(pairs)`, for dataLast invocations use the functional form `R.fromEntries()`. Will be removed in V2!
  */
@@ -47,2 +50,5 @@ export declare function fromPairs<V>(pairs: ReadonlyArray<Entry<number, V>>): Record<number, V>;
 export declare namespace fromPairs {
+    /**
+     * @deprecated Use `R.fromEntries.strict(pairs)`, for dataLast invocations use the functional form `R.fromEntries.strict()`. Will be removed in V2!
+     */
     const strict: Strict;
@@ -49,0 +55,0 @@ }

dist/types/hasAtLeast.d.ts

@@ -28,3 +28,2 @@ import type { ReadonlyTuple } from "./_types";
  *
- * @param data - The input array.
  * @param minimum - The minimum number of elements the array must have.
@@ -31,0 +30,0 @@ * @returns True if the array's length is *at least* `minimum`.

dist/types/identity.d.ts

 /**
  * A function that always returns the param passed to it.
  *
+ * @param value - The param to return.
  * @signature
@@ -5,0 +6,0 @@ *    R.identity(data)

dist/types/index.d.ts

@@ -12,2 +12,3 @@ export * from "./add";
 export * from "./conditional";
+export * from "./constant";
 export * from "./countBy";
@@ -19,2 +20,3 @@ export * from "./createPipe";
 export * from "./divide";
+export * from "./doNothing";
 export * from "./drop";
@@ -25,2 +27,3 @@ export * from "./dropFirstBy";
 export * from "./dropWhile";
+export * from "./entries";
 export * from "./equals";
@@ -42,5 +45,8 @@ export * from "./evolve";
 export * from "./forEachObj";
+export * from "./fromEntries";
+export * from "./fromKeys";
 export * from "./fromPairs";
 export * from "./groupBy";
 export * from "./hasAtLeast";
+export * from "./hasSubObject";
 export * from "./identity";
@@ -62,3 +68,5 @@ export * from "./indexBy";
 export * from "./isNonNull";
+export * from "./isNonNullish";
 export * from "./isNot";
+export * from "./isNullish";
 export * from "./isNumber";
@@ -100,2 +108,3 @@ export * from "./isObject";
 export * from "./pipe";
+export * from "./piped";
 export * from "./prop";
@@ -141,2 +150,5 @@ export * from "./purry";
 export * from "./uniqWith";
+export * from "./unique";
+export * from "./uniqueBy";
+export * from "./uniqueWith";
 export * from "./values";
@@ -143,0 +155,0 @@ export * from "./zip";

dist/types/indexBy.d.ts

@@ -25,3 +25,2 @@ import type { PredIndexed } from "./_types";
  *
- * @param array - The array.
  * @param fn - The indexing function.
@@ -28,0 +27,0 @@ * @signature

dist/types/intersection.d.ts

@@ -5,4 +5,3 @@ import type { LazyEvaluator } from "./pipe";
  *
- * **DEPRECATED: equivalent to `R.filter(array, R.isIncludedIn(other))` and will
- * be removed in v2.**.
+ * ! **DEPRECATED**: Use `R.filter(array, R.isIncludedIn(other))`. Will be removed in v2!
  *
@@ -17,4 +16,4 @@ * @param array - The source array.
  * @pipeable
- * @category Array
- * @deprecated Equivalent to `R.filter(array, R.isIncludedIn(other))` and will be removed in v2.
+ * @category Deprecated
+ * @deprecated Use `R.filter(array, R.isIncludedIn(other))`. Will be removed in v2.
  */
@@ -25,4 +24,3 @@ export declare function intersection<T>(source: ReadonlyArray<T>, other: ReadonlyArray<T>): Array<T>;
  *
- * **DEPRECATED: equivalent to `R.filter(R.isIncludedIn(other))` and will be
- * removed in v2.**.
+ * ! **DEPRECATED**: Use `R.filter(R.isIncludedIn(other))`. Will be removed in v2!
  *
@@ -37,4 +35,4 @@ * @param array - The source array.
  * @pipeable
- * @category Array
- * @deprecated Equivalent to `R.filter(R.isIncludedIn(other))` and will be removed in v2.
+ * @category Deprecated
+ * @deprecated Use `R.filter(R.isIncludedIn(other))`. Will be removed in v2.
  */
@@ -41,0 +39,0 @@ export declare function intersection<T, K>(other: ReadonlyArray<T>): (source: ReadonlyArray<K>) => Array<T>;

dist/types/invert.d.ts

@@ -20,3 +20,2 @@ type Inverted<T extends object> = T[keyof T] extends PropertyKey ? Record<T[keyof T], keyof T> : never;
  *
- * @param object - The object.
  * @signature
@@ -23,0 +22,0 @@ *    R.invert()(object)

dist/types/isDeepEqual.d.ts

@@ -41,3 +41,2 @@ /**
  *
- * @param data - The first value to compare.
  * @param other - The second value to compare.
@@ -44,0 +43,0 @@ * @signature

dist/types/isDefined.d.ts

 /**
- * A function that checks if the passed parameter is defined and narrows its type accordingly.
- * To test specifically for `undefined` (and not `null`) use the strict variant of this function.
+ * A function that checks if the passed parameter is defined and narrows its
+ * type accordingly. To test specifically for `undefined` (and not `null`) use
+ * the strict variant of this function.
  *
+ * ! **DEPRECATED**: If your type accepts `null` use `R.isNullish(data)`, otherwise prefer `R.isDefined.strict(data)`. The **non-strict** version will be removed in V2!
+ *
  * @param data - The variable to check.
@@ -18,2 +21,3 @@ * @returns True if the passed input is defined, false otherwise.
  * @category Guard
+ * @deprecated If your type accepts `null` use `R.isNullish(data)`, otherwise prefer `R.isDefined.strict(data)`. The **non-strict** version will be removed in V2!
  */
@@ -20,0 +24,0 @@ export declare function isDefined<T>(data: T): data is NonNullable<T>;

dist/types/isIncludedIn.d.ts

@@ -37,3 +37,2 @@ import type { IterableContainer } from "./_types";
  *
- * @param data - The item that is checked.
  * @param container - The items that are checked against.
@@ -40,0 +39,0 @@ * @returns A narrowed version of the input data on success, `false` otherwise.

dist/types/isNil.d.ts

 /**
  * A function that checks if the passed parameter is Nil (null or undefined) and narrows its type accordingly.
  *
+ * ! **DEPRECATED**: Use `R.isNullish(data)`. Will be removed in V2!
+ *
  * @param data - The variable to check.
@@ -12,5 +14,6 @@ * @returns True if the passed input is Nil (null or undefined), false otherwise.
  *    R.isNil('somethingElse') //=> false
- * @category Guard
+ * @category Deprecated
+ * @deprecated Use `R.isNullish(data)`. Will be removed in V2!
  */
 export declare function isNil<T>(data: T): data is Extract<T, null | undefined>;
 //# sourceMappingURL=isNil.d.ts.map

dist/types/isObject.d.ts

@@ -5,3 +5,3 @@ type DefinitelyObject<T> = Exclude<Extract<T, object>, Array<any> | Function | ReadonlyArray<any>> extends never ? Record<string, unknown> : Exclude<Extract<T, object>, Array<any> | Function | ReadonlyArray<any>>;
  *
- * ! **DEPRECATED: The semantics of this guard are confusing. It excludes Arrays but does not exclude other complex objects like Classes or built-in objects (such as Date, Promise, Error, etc.). Instead, consider using `isObjectType` for a more inclusive validation encompassing any JavaScript "object" type, or `isPlainObject` for a more specific validation targeting simple struct/shape/record-like objects. To replicate the existing logic, use: `const isObject = (x) => isObjectType(x) && !Array.isArray(x)`.** !
+ * ! **DEPRECATED**: Use: `R.isObjectType(data) && R.isNonNull(data) && !R.isArray(data)` or `R.isPlainObject(data)`. Will be removed in V2!
  *
@@ -18,4 +18,4 @@ * @param data - The variable to check.
  *    R.isObject('somethingElse') //=> false
- * @category Guard
- * @deprecated - The semantics of this guard are confusing. It excludes Arrays but does not exclude other complex objects like Classes or built-in objects (such as Date, Promise, Error, etc.). Instead, consider using `isObjectType` for a more inclusive validation encompassing any JavaScript "object" type, or `isPlainObject` for a more specific validation targeting simple struct/shape/record-like objects. To replicate the existing logic, use: `const isObject = (x) => isObjectType(x) && !Array.isArray(x)`.
+ * @category Deprecated
+ * @deprecated Use: `R.isObjectType(data) && R.isNonNull(data) && !R.isArray(data)` or `R.isPlainObject(data)`. Will be removed in V2!
  */
@@ -22,0 +22,0 @@ export declare function isObject<T>(data: T | object): data is DefinitelyObject<T>;

dist/types/join.d.ts

@@ -33,3 +33,2 @@ import type { IterableContainer } from "./_types";
  *
- * @param data - The array to join.
  * @param glue - The string to put in between every two elements.
@@ -36,0 +35,0 @@ * @signature

dist/types/last.d.ts

@@ -20,3 +20,2 @@ import type { NonEmptyArray } from "./_types";
  *
- * @param array - The array.
  * @signature
@@ -23,0 +22,0 @@ *    R.last()(array)

dist/types/length.d.ts

@@ -17,3 +17,2 @@ type Enumerable<T> = ArrayLike<T> | Iterable<T>;
  *
- * @param items - The input data.
  * @signature
@@ -20,0 +19,0 @@ *    R.length()(array)

dist/types/maxBy.d.ts

@@ -5,3 +5,3 @@ import type { PredIndexed } from "./_types";
  *
- * If you need more control over how "max" is defined, consider using `firstBy` instead. `maxBy` might be deprecated in the future!
+ * ! **DEPRECATED**: Use `R.firstBy([fn, "desc"])`. Will be removed in V2!
  *
@@ -19,3 +19,4 @@ * @param fn - The predicate.
  * @indexed
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.firstBy([fn, "desc"])`. Will be removed in V2!
  */
@@ -26,2 +27,4 @@ export declare function maxBy<T>(fn: (item: T) => number): (items: ReadonlyArray<T>) => T | undefined;
  *
+ * ! **DEPRECATED**: Use `R.firstBy(items, fn)`. Will be removed in V2!
+ *
  * @param items - The array.
@@ -39,3 +42,4 @@ * @param fn - The predicate.
  * @indexed
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.firstBy(items, [fn, "desc"])`. Will be removed in V2!
  */
@@ -42,0 +46,0 @@ export declare function maxBy<T>(items: ReadonlyArray<T>, fn: (item: T) => number): T | undefined;

dist/types/merge.d.ts

@@ -0,9 +1,21 @@
+import type { Merge } from "./type-fest/merge";
 /**
- * Merges two objects. The same as `Object.assign`.
- * `b` object will override properties of `a`.
+ * Merges two objects into one by combining their properties, effectively
+ * creating a new object that incorporates elements from both. The merge
+ * operation prioritizes the second object's properties, allowing them to
+ * overwrite those from the first object with the same names.
  *
- * @param a - The first object.
- * @param b - The second object.
+ * Equivalent to `{ ...data, ...source }`.
+ *
+ * @param data - The destination object, serving as the basis for the merge.
+ * Properties from this object are included in the new object, but will be
+ * overwritten by properties from the source object with matching keys.
+ * @param source - The source object, whose properties will be included in the
+ * new object. If properties in this object share keys with properties in the
+ * destination object, the values from the source object will be used in the
+ * new object.
+ * @returns An object fully containing `source`, and any properties from `data`
+ * that don't share a name with any property in `source`.
  * @signature
- *    R.merge(a, b)
+ *    R.merge(data, source)
  * @example
@@ -14,15 +26,28 @@ *    R.merge({ x: 1, y: 2 }, { y: 10, z: 2 }) // => { x: 1, y: 10, z: 2 }
  */
-export declare function merge<A, B>(a: A, b: B): A & B;
+export declare function merge<T, Source>(data: T, source: Source): Merge<T, Source>;
 /**
- * Merges two objects. The same as `Object.assign`. `b` object will override properties of `a`.
+ * Merges two objects into one by combining their properties, effectively
+ * creating a new object that incorporates elements from both. The merge
+ * operation prioritizes the second object's properties, allowing them to
+ * overwrite those from the first object with the same names.
  *
- * @param b - The second object.
+ * Equivalent to `{ ...data, ...source }`.
+ *
+ * @param source - The source object, whose properties will be included in the
+ * new object. If properties in this object share keys with properties in the
+ * destination object, the values from the source object will be used in the
+ * new object.
+ * @returns An object fully containing `source`, and any properties from `data`
+ * that don't share a name with any property in `source`.
  * @signature
- *    R.merge(b)(a)
+ *    R.merge(source)(data)
  * @example
- *    R.merge({ y: 10, z: 2 })({ x: 1, y: 2 }) // => { x: 1, y: 10, z: 2 }
+ *    R.pipe(
+ *      { x: 1, y: 2 },
+ *      R.merge({ y: 10, z: 2 }),
+ *    ); // => { x: 1, y: 10, z: 2 }
  * @dataLast
  * @category Object
  */
-export declare function merge<A, B>(b: B): (a: A) => A & B;
+export declare function merge<Source>(source: Source): <T>(data: T) => Merge<T, Source>;
 //# sourceMappingURL=merge.d.ts.map

dist/types/mergeDeep.d.ts

@@ -19,3 +19,2 @@ import type { MergeDeep } from "./type-fest/merge-deep";
  *
- * @param destination - The object to merge into. In general, this object would have it's values overridden.
  * @param source - The object to merge from. In general, shared keys would be taken from this object.
@@ -22,0 +21,0 @@ * @returns The merged object.

dist/types/minBy.d.ts

@@ -5,3 +5,3 @@ import type { PredIndexed } from "./_types";
  *
- * If you need more control over how "min" is defined, consider using `firstBy` instead. `minBy` might be deprecated in the future!
+ * ! **DEPRECATED**: Use `R.firstBy(fn)`. Will be removed in V2!
  *
@@ -19,3 +19,4 @@ * @param fn - The predicate.
  * @indexed
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.firstBy(fn)`. Will be removed in V2!
  */
@@ -26,2 +27,4 @@ export declare function minBy<T>(fn: (item: T) => number): (items: ReadonlyArray<T>) => T | undefined;
  *
+ * ! **DEPRECATED**: Use `R.firstBy(items, fn)`. Will be removed in V2!
+ *
  * @param items - The array.
@@ -39,3 +42,4 @@ * @param fn - The predicate.
  * @indexed
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.firstBy(items, fn)`. Will be removed in V2!
  */
@@ -42,0 +46,0 @@ export declare function minBy<T>(items: ReadonlyArray<T>, fn: (item: T) => number): T | undefined;

dist/types/multiply.d.ts

@@ -18,3 +18,2 @@ /**
  *
- * @param value - The number.
  * @param multiplicand - The number to multiply the value by.
@@ -21,0 +20,0 @@ * @signature

dist/types/noop.d.ts

 /**
  * A function that returns always `undefined`.
  *
+ * ! **DEPRECATED**: Use `R.constant(undefined)`, or `R.doNothing()` if the function doesn't need to return a value. Will be removed in V2!
+ *
  * @signature
@@ -8,5 +10,6 @@ *    R.noop()
  *    onSomething(R.noop)
- * @category Function
+ * @category Deprecated
+ * @deprecated Use `R.constant(undefined)`, or `R.doNothing()` if the function doesn't need to return a value. Will be removed in V2!
  */
 export declare const noop: () => undefined;
 //# sourceMappingURL=noop.d.ts.map

dist/types/nthBy.d.ts

@@ -25,3 +25,2 @@ import type { OrderRule } from "./_purryOrderRules";
  *
- * @param data - The input array.
  * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
@@ -28,0 +27,0 @@ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.

dist/types/omit.d.ts

 /**
  * Returns a partial copy of an object omitting the keys specified.
  *
- * @param data - The object.
  * @param propNames - The property names.
@@ -6,0 +5,0 @@ * @signature

dist/types/only.d.ts

@@ -21,3 +21,2 @@ import type { IterableContainer } from "./_types";
  *
- * @param array - The target array.
  * @signature
@@ -24,0 +23,0 @@ *    R.only()(array)

dist/types/pathOr.d.ts

@@ -66,3 +66,2 @@ /**
  *
- * @param object - The target object.
  * @param path - The path of the property to get.
@@ -69,0 +68,0 @@ * @param defaultValue - The default value.

dist/types/purry.d.ts

@@ -23,2 +23,3 @@ import type { LazyEvaluator } from "./pipe";
  * @param args - The arguments.
+ * @param lazyFactory - A lazy version of the function to purry.
  * @signature R.purry(fn, arguments);
@@ -25,0 +26,0 @@ * @example

dist/types/rankBy.d.ts

@@ -25,3 +25,2 @@ import type { OrderRule } from "./_purryOrderRules";
  *
- * @param data - The input array.
  * @param item - The item whose rank is to be determined.
@@ -28,0 +27,0 @@ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.

dist/types/reduce.d.ts

 /**
  * Calls the specified callback function for all the elements in an array. The return value of the callback function is the accumulated result, and is provided as an argument in the next call to the callback function.
  *
- * @param array - The array to reduce.
+ * @param items - The array to reduce.
  * @param fn - The callback function.
@@ -6,0 +6,0 @@ * @param initialValue - The initial value to use as an accumulator value in the callback function.

dist/types/reject.d.ts

@@ -6,2 +6,4 @@ import type { Pred, PredIndexed, PredIndexedOptional } from "./_types";
  *
+ * ! **DEPRECATED**: Use `R.filter(items, R.isNot(fn))`. Will be removed in V2!
+ *
  * @param items - The array to reject.
@@ -18,3 +20,4 @@ * @param fn - The callback function.
  * @pipeable
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.filter(items, R.isNot(fn))`. Will be removed in V2!
  */
@@ -25,2 +28,4 @@ export declare function reject<T>(items: ReadonlyArray<T>, fn: Pred<T, boolean>): Array<T>;
  *
+ * ! **DEPRECATED**: Use `R.filter(R.isNot(fn))`. Will be removed in V2!
+ *
  * @param items - The array to reject.
@@ -37,7 +42,14 @@ * @param fn - The callback function.
  * @pipeable
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.filter(R.isNot(fn))`. Will be removed in V2!
  */
 export declare function reject<T>(fn: Pred<T, boolean>): (items: ReadonlyArray<T>) => Array<T>;
 export declare namespace reject {
+    /**
+     * @deprecated Use `R.filter.indexed(items, (item, index, array) => !fn(item, index, array))`. Will be removed in V2!
+     */
     function indexed<T, K>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): Array<K>;
+    /**
+     * @deprecated Use `R.filter.indexed((item, index, array) => !fn(item, index, array))`. Will be removed in V2!
+     */
     function indexed<T, K>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => Array<K>;
@@ -44,0 +56,0 @@ const lazy: <T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T>;

dist/types/reverse.d.ts

@@ -18,3 +18,2 @@ type Reverse<T extends ReadonlyArray<unknown>, R extends ReadonlyArray<unknown> = []> = ReturnType<T extends IsNoTuple<T> ? () => [...T, ...R] : T extends readonly [infer F, ...infer L] ? () => Reverse<L, [F, ...R]> : () => R>;
  *
- * @param array - The array.
  * @signature
@@ -21,0 +20,0 @@ *    R.reverse()(array);

dist/types/round.d.ts

@@ -24,3 +24,2 @@ /**
  *
- * @param value - The number to round.
  * @param precision - The precision to round to. Must be an integer between -15 and 15.
@@ -27,0 +26,0 @@ * @signature

dist/types/sample.d.ts

@@ -19,3 +19,3 @@ import type { IterableContainer } from "./_types";
  *
- * @param array - The array.
+ * @param data - The array.
  * @param sampleSize - The number of elements to take.
@@ -43,3 +43,2 @@ * @signature
  *
- * @param array - The array.
  * @param sampleSize - The number of elements to take.
@@ -46,0 +45,0 @@ * @signature

dist/types/setPath.d.ts

@@ -20,3 +20,2 @@ import type { Narrow } from "./_narrow";
  *
- * @param obj - The target method.
  * @param path - The array of properties.
@@ -23,0 +22,0 @@ * @param value - The value to set.

dist/types/sliceString.d.ts

@@ -8,3 +8,2 @@ /**
  *
- * @param string - The string to slice.
  * @param indexStart - The index of the first character to include in the returned substring.
@@ -11,0 +10,0 @@ * @param indexEnd - (optional) The index of the first character to exclude from the returned substring.

dist/types/sortBy.d.ts

@@ -16,3 +16,2 @@ import type { OrderRule } from "./_purryOrderRules";
  *
- * @param data - The input array.
  * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
@@ -50,4 +49,4 @@ * @returns A shallow copy of the input array sorted by the provided rules.
  *
- * @param data - The input array.
- * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @param array - The input array.
+ * @param sortRules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
  * @returns A shallow copy of the input array sorted by the provided rules.
@@ -54,0 +53,0 @@ * @signature

dist/types/sortedIndex.d.ts

@@ -31,3 +31,2 @@ /**
  *
- * @param data - The (ascending) sorted array.
  * @param item - The item to insert.
@@ -34,0 +33,0 @@ * @returns Insertion index (In the range 0..array.length).

dist/types/sortedIndexBy.d.ts

@@ -38,3 +38,2 @@ /**
  *
- * @param data - The (ascending) sorted array.
  * @param item - The item to insert.
@@ -41,0 +40,0 @@ * @param valueFunction - All comparisons would be performed on the result of

dist/types/sortedIndexWith.d.ts

@@ -44,3 +44,2 @@ /**
  *
- * @param data - Array, "sorted" by `predicate`.
  * @param predicate - A predicate which also defines the array's order.
@@ -47,0 +46,0 @@ * @returns Index (In the range 0..data.length).

dist/types/sortedLastIndex.d.ts

@@ -31,3 +31,2 @@ /**
  *
- * @param data - The (ascending) sorted array.
  * @param item - The item to insert.
@@ -34,0 +33,0 @@ * @returns Insertion index (In the range 0..data.length).

dist/types/sortedLastIndexBy.d.ts

@@ -38,3 +38,2 @@ /**
  *
- * @param data - The (ascending) sorted array.
  * @param item - The item to insert.
@@ -41,0 +40,0 @@ * @param valueFunction - All comparisons would be performed on the result of

dist/types/splice.d.ts

@@ -20,3 +20,2 @@ /**
  *
- * @param items - The array to splice.
  * @param start - The index from which to start removing elements.
@@ -23,0 +22,0 @@ * @param deleteCount - The number of elements to remove.

dist/types/splitAt.d.ts

@@ -18,3 +18,2 @@ /**
  *
- * @param array - The array to split.
  * @param index - The index to split at.
@@ -21,0 +20,0 @@ * @signature

dist/types/subtract.d.ts

@@ -19,3 +19,2 @@ /**
  *
- * @param value - The number.
  * @param subtrahend - The number to subtract from the value.
@@ -22,0 +21,0 @@ * @signature

dist/types/takeFirstBy.d.ts

@@ -25,3 +25,2 @@ import type { OrderRule } from "./_purryOrderRules";
  *
- * @param data - The input array.
  * @param n - The number of items to take. If `n` is non-positive no items would be returned, if `n` is bigger then data.length a *clone* of `data` would be returned.
@@ -28,0 +27,0 @@ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.

dist/types/times.d.ts

@@ -23,3 +23,2 @@ /**
  * @param fn - The function to invoke. Passed one argument, the current value of `n`.
- * @param count - A value between `0` and `n - 1`. Increments after each function call.
  * @returns An array containing the return values of all calls to `fn`.
@@ -26,0 +25,0 @@ * @example times(identity)(5); //=> [0, 1, 2, 3, 4]

dist/types/toPairs.d.ts

 /**
  * Returns an array of key/values of the enumerable properties of an object.
  *
+ * ! **DEPRECATED** Use `R.entries(object)`, for dataLast invocations use the functional form `R.entries()`. Will be removed in V2!
+ *
  * @param object - Object to return keys and values of.
@@ -21,3 +23,4 @@ * @signature
  * @strict
- * @category Object
+ * @category Deprecated
+ * @deprecated Use `R.entries(object)`, for dataLast invocations use the functional form `R.entries()`. Will be removed in V2!
  */
@@ -30,2 +33,5 @@ export declare function toPairs<T>(object: Readonly<Record<string, T>>): Array<[string, T]>;
 export declare namespace toPairs {
+    /**
+     * @deprecated Use `R.entries.strict(object)`, for dataLast invocations use the functional form `R.entries.strict(object)`. Will be removed in V2!
+     */
     const strict: Strict;
@@ -32,0 +38,0 @@ }

dist/types/type-fest/merge.d.ts

@@ -1,9 +0,9 @@
-import type { EnforceOptional } from "./enforce-optional";
 import type { OmitIndexSignature } from "./omit-index-signature";
 import type { PickIndexSignature } from "./pick-index-signature";
+import type { Simplify } from "./simplify";
 type SimpleMerge<Destination, Source> = Source & {
     [Key in keyof Destination as Key extends keyof Source ? never : Key]: Destination[Key];
 };
-export type Merge<Destination, Source> = EnforceOptional<SimpleMerge<OmitIndexSignature<Destination>, OmitIndexSignature<Source>> & SimpleMerge<PickIndexSignature<Destination>, PickIndexSignature<Source>>>;
+export type Merge<Destination, Source> = Simplify<SimpleMerge<OmitIndexSignature<Destination>, OmitIndexSignature<Source>> & SimpleMerge<PickIndexSignature<Destination>, PickIndexSignature<Source>>>;
 export {};
 //# sourceMappingURL=merge.d.ts.map

dist/types/type.d.ts

 /**
  * Gives a single-word string description of the (native) type of a value, returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not attempt to distinguish user Object types any further, reporting them all as 'Object'.
  *
+ * ! **DEPRECATED**: Use `typeof val`, or one of the guards offered by this library. Will be removed in V2! We don't know what the use case for this function is. If you have a use case reach out via a GitHub issue so we can discuss this.
+ *
  * @param val - Value to return type of.
@@ -17,5 +19,6 @@ * @signature
  *    R.type(undefined); //=> "Undefined"
- * @category Type
+ * @category Deprecated
+ * @deprecated Use `typeof val`, or one of the guards offered by this library. Will be removed in V2! We don't know what the use case for this function is. If you have a use case reach out via a GitHub issue so we can discuss this.
  */
 export declare function type(val: unknown): string;
 //# sourceMappingURL=type.d.ts.map

dist/types/uniq.d.ts

@@ -6,2 +6,4 @@ import type { LazyEvaluator } from "./pipe";
  *
+ * ! **DEPRECATED**: Use `R.unique(array)`. Will be removed in V2.
+ *
  * @param array - The array to filter.
@@ -14,3 +16,4 @@ * @signature
  * @pipeable
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.unique(array)`. Will be removed in V2.
  */
@@ -22,2 +25,4 @@ export declare function uniq<T>(array: ReadonlyArray<T>): Array<T>;
  *
+ * ! **DEPRECATED**: Use `R.unique()`. Will be removed in V2.
+ *
  * @param array - The array to filter.
@@ -34,3 +39,4 @@ * @signature
  * @pipeable
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.unique()`. Will be removed in V2.
  */
@@ -37,0 +43,0 @@ export declare function uniq<T>(): (array: ReadonlyArray<T>) => Array<T>;

dist/types/uniqBy.d.ts

@@ -1,2 +0,1 @@
-export declare function uniqBy<T, K>(array: ReadonlyArray<T>, transformer: (item: T) => K): Array<T>;
 /**
@@ -6,3 +5,6 @@ * Returns a new array containing only one copy of each element in the original list transformed by a function.
  *
- * @param array
+ * ! **DEPRECATED**: Use `R.uniqueBy(array, fn)`. Will be removed in V2!
+ *
+ * @param array - The array to filter.
+ * @param transformer
  * @signature
@@ -15,2 +17,19 @@ *    R.uniqBy(array, fn)
  *    ) // => [{n: 1}, {n: 2}, {n: 5}, {n: 6}, {n: 7}]
+ * @dataFirst
+ * @pipeable
+ * @category Deprecated
+ * @deprecated Use `R.uniqueBy(array, fn)`. Will be removed in V2!
+ */
+export declare function uniqBy<T, K>(array: ReadonlyArray<T>, transformer: (item: T) => K): Array<T>;
+/**
+ * Returns a new array containing only one copy of each element in the original list transformed by a function.
+ * Elements are compared by reference using Set.
+ *
+ * ! **DEPRECATED**: Use `R.uniqueBy(fn)`. Will be removed in V2!
+ *
+ * @param array - The array to filter.
+ * @param transformer
+ * @signature
+ *    R.uniqBy(fn)(array)
+ * @example
  *    R.pipe(
@@ -21,6 +40,8 @@ *      [{n: 1}, {n: 2}, {n: 2}, {n: 5}, {n: 1}, {n: 6}, {n: 7}], // only 4 iterations
  *    ) // => [{n: 1}, {n: 2}, {n: 5}]
+ * @dataLast
  * @pipeable
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.uniqueBy(fn)`. Will be removed in V2!
  */
 export declare function uniqBy<T, K>(transformer: (item: T) => K): (array: ReadonlyArray<T>) => Array<T>;
 //# sourceMappingURL=uniqBy.d.ts.map

dist/types/uniqWith.d.ts

@@ -7,2 +7,4 @@ import type { LazyEvaluator } from "./pipe";
  *
+ * ! **DEPRECATED**: Use `R.uniqueWith(array, isEquals)`. Will be removed in V2!
+ *
  * @param array - The array to filter.
@@ -18,3 +20,4 @@ * @param isEquals - The comparator.
  * @dataFirst
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.uniqueWith(array, isEquals)`. Will be removed in V2!
  */
@@ -26,2 +29,4 @@ export declare function uniqWith<T>(array: ReadonlyArray<T>, isEquals: IsEquals<T>): Array<T>;
  *
+ * ! **DEPRECATED**: Use `R.uniqueWith(isEquals)`. Will be removed in V2!
+ *
  * @param isEquals - The comparator.
@@ -39,3 +44,4 @@ * @signature R.uniqWith(isEquals)(array)
  * @dataLast
- * @category Object
+ * @category Deprecated
+ * @deprecated Use `R.uniqueWith(isEquals)`. Will be removed in V2!
  */
@@ -42,0 +48,0 @@ export declare function uniqWith<T>(isEquals: IsEquals<T>): (array: ReadonlyArray<T>) => Array<T>;

dist/types/zipObj.d.ts

@@ -5,2 +5,4 @@ /**
  *
+ * ! **DEPRECATED**: Use `R.fromEntries.strict(R.zip(first, second))`. Will be removed in V2!
+ *
  * @param first - The first input list.
@@ -13,3 +15,4 @@ * @param second - The second input list.
  * @dataFirst
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `R.fromEntries.strict(R.zip(first, second))`. Will be removed in V2!
  */
@@ -21,2 +24,4 @@ export declare function zipObj<F extends PropertyKey, S>(first: ReadonlyArray<F>, second: ReadonlyArray<S>): Record<F, S>;
  *
+ * ! **DEPRECATED**: Use `<F extends PropertyKey>(first: ReadonlyArray<F>) => R.fromEntries.strict(R.zip(first, second))` or if as part of a pipe: `R.pipe(..., R.zip(second), R.fromEntries.strict(), ...)`. Will be removed in V2!
+ *
  * @param second - The second input list.
@@ -28,5 +33,6 @@ * @signature
  * @dataLast
- * @category Array
+ * @category Deprecated
+ * @deprecated Use `<F extends PropertyKey>(first: ReadonlyArray<F>) => R.fromEntries.strict(R.zip(first, second))` or if as part of a pipe: `R.pipe(..., R.zip(second), R.fromEntries.strict(), ...)`. Will be removed in V2!
  */
 export declare function zipObj<S>(second: ReadonlyArray<S>): <F extends PropertyKey>(first: ReadonlyArray<F>) => Record<F, S>;
 //# sourceMappingURL=zipObj.d.ts.map

package.json

 {
   "name": "remeda",
-  "version": "2.0.0-beta.2",
+  "version": "2.0.0-beta.3",
   "description": "A utility library for JavaScript and Typescript.",
@@ -23,2 +23,3 @@ "keywords": [
   "sideEffects": false,
+  "type": "module",
   "main": "dist/commonjs/index.js",
@@ -49,4 +50,4 @@ "module": "dist/es/index.js",
     "@eslint/js": "^8.57.0",
+    "@types/eslint-config-prettier": "^6.11.3",
     "@types/eslint__js": "^8.42.3",
-    "@types/eslint-config-prettier": "^6.11.3",
     "@vitest/coverage-v8": "^1.3.1",
@@ -53,0 +54,0 @@ "eslint": "^8.57.0",

README.md

@@ -100,3 +100,3 @@ # Remeda
 
-Many functions support lazy evaluation when using `pipe` or `createPipe`. These functions have a `pipeable` tag in the documentation.
+Many functions support lazy evaluation when using `pipe` or `piped`. These functions have a `pipeable` tag in the documentation.
 Lazy evaluation is not supported in Ramda and only partially supported in lodash.
@@ -149,3 +149,3 @@
 1. The usage must be programmer friendly, and that's more important than following XYZ paradigm strictly.
-2. Manual annotation should never be required, and proper typings should infer everything. The only exception is the first function in `createPipe`.
+2. Manual annotation should never be required, and proper typings should infer everything. The only exception is the first function in `piped`.
 3. ES6 polyfill is required. Core methods are reused, and data structure (like Map/Set) are not re-implemented.
@@ -152,0 +152,0 @@ 4. The implementation of each function should be as minimal as possible. Tree-shaking is supported by default. (Do you know that `lodash.keyBy` has 14KB after minification?)

No alert changes

Improved metrics

Total package byte prevSize

602775

increased by8.19%

Number of package files

691

increased by7.47%

Lines of code

12302

increased by7.62%

Is type module

Yes

No dependency changes