@vinicunca/perkakas 0.5.3 → 1.0.0

package/dist/drop-first-by.d.ts

@@ -0,0 +1,39 @@
+import { N as NonEmptyArray } from './types-DCY4LHuA.js';
+import { O as OrderRule } from './curry-order-rules-BOMf1JS7.js';
+import 'type-fest';
+
+/**
+ * Drop the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before dropping the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.
+ *
+ * For the opposite operation (to keep `n` elements) see `takeFirstBy`.
+ *
+ * @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.
+ * @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.
+ * @returns A subset of the input array.
+ * @signature
+ *   P.dropFirstBy(data, n, ...rules);
+ * @example
+ *   P.dropFirstBy(['aa', 'aaaa', 'a', 'aaa'], 2, x => x.length); // => ['aaa', 'aaaa']
+ * @dataFirst
+ * @category Array
+ */
+declare function dropFirstBy<T>(data: ReadonlyArray<T>, n: number, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): Array<T>;
+/**
+ * Drop the first `n` items from `data` based on the provided ordering criteria. This allows you to avoid sorting the array before dropping the items. The complexity of this function is *O(Nlogn)* where `N` is the length of the array.
+ *
+ * For the opposite operation (to keep `n` elements) see `takeFirstBy`.
+ *
+ * @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.
+ * @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.
+ * @returns A subset of the input array.
+ * @signature
+ *   P.dropFirstBy(n, ...rules)(data);
+ * @example
+ *   P.pipe(['aa', 'aaaa', 'a', 'aaa'], P.dropFirstBy(2, x => x.length)); // => ['aaa', 'aaaa']
+ * @dataLast
+ * @category Array
+ */
+declare function dropFirstBy<T>(n: number, ...rules: Readonly<NonEmptyArray<OrderRule<T>>>): (data: ReadonlyArray<T>) => Array<T>;
+
+export { dropFirstBy };

package/dist/drop-first-by.js

@@ -0,0 +1 @@
+import{a}from"./chunk-IA53O34Y.js";import"./chunk-JU4UCCME.js";import"./chunk-UYH64IBH.js";import"./chunk-JXXXUJM5.js";import"./chunk-73BYESBE.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropFirstBy};

package/dist/drop-last-while.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkP7OXTPPHcjs = require('./chunk-P7OXTPPH.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLastWhile = _chunkP7OXTPPHcjs.a;

package/dist/drop-last-while.d.cts

@@ -0,0 +1,31 @@
+/**
+ * Removes elements from the end of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array starting from the end and moving towards the beginning, until the predicate returns false. The returned array includes elements from the beginning of the array, up to and including the element that produced false for the predicate.
+ *
+ * @param data - The array.
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropLastWhile(data, predicate)
+ * @example
+ *    P.dropLastWhile([1, 2, 10, 3, 4], x => x < 10) // => [1, 2, 10]
+ * @dataFirst
+ * @category Array
+ */
+declare function dropLastWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+/**
+ * Removes elements from the end of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array starting from the end and moving towards the beginning, until the predicate returns false. The returned array includes elements from the beginning of the array, up to and including the element that produced false for the predicate.
+ *
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropLastWhile(predicate)(data)
+ * @example
+ *    P.pipe([1, 2, 10, 3, 4], P.dropLastWhile(x => x < 10))  // => [1, 2, 10]
+ * @dataLast
+ * @category Array
+ */
+declare function dropLastWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+
+export { dropLastWhile };

package/dist/drop-last-while.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Removes elements from the end of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array starting from the end and moving towards the beginning, until the predicate returns false. The returned array includes elements from the beginning of the array, up to and including the element that produced false for the predicate.
+ *
+ * @param data - The array.
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropLastWhile(data, predicate)
+ * @example
+ *    P.dropLastWhile([1, 2, 10, 3, 4], x => x < 10) // => [1, 2, 10]
+ * @dataFirst
+ * @category Array
+ */
+declare function dropLastWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+/**
+ * Removes elements from the end of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array starting from the end and moving towards the beginning, until the predicate returns false. The returned array includes elements from the beginning of the array, up to and including the element that produced false for the predicate.
+ *
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropLastWhile(predicate)(data)
+ * @example
+ *    P.pipe([1, 2, 10, 3, 4], P.dropLastWhile(x => x < 10))  // => [1, 2, 10]
+ * @dataLast
+ * @category Array
+ */
+declare function dropLastWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+
+export { dropLastWhile };

package/dist/drop-last-while.js

@@ -0,0 +1 @@
+import{a}from"./chunk-QTCQZ7LU.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropLastWhile};

package/dist/drop-last.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZCFTW5HOcjs = require('./chunk-ZCFTW5HO.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropLast = _chunkZCFTW5HOcjs.a;

package/dist/drop-last.d.cts

@@ -0,0 +1,27 @@
+/**
+ * Removes last `n` elements from the `array`.
+ *
+ * @param array - The target array.
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.dropLast(array, n)
+ * @example
+ *    P.dropLast([1, 2, 3, 4, 5], 2) // => [1, 2, 3]
+ * @dataFirst
+ * @category Array
+ */
+declare function dropLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+/**
+ * Removes last `n` elements from the `array`.
+ *
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.dropLast(n)(array)
+ * @example
+ *    P.dropLast(2)([1, 2, 3, 4, 5]) // => [1, 2, 3]
+ * @dataLast
+ * @category Array
+ */
+declare function dropLast<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+
+export { dropLast };

package/dist/drop-last.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Removes last `n` elements from the `array`.
+ *
+ * @param array - The target array.
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.dropLast(array, n)
+ * @example
+ *    P.dropLast([1, 2, 3, 4, 5], 2) // => [1, 2, 3]
+ * @dataFirst
+ * @category Array
+ */
+declare function dropLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+/**
+ * Removes last `n` elements from the `array`.
+ *
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.dropLast(n)(array)
+ * @example
+ *    P.dropLast(2)([1, 2, 3, 4, 5]) // => [1, 2, 3]
+ * @dataLast
+ * @category Array
+ */
+declare function dropLast<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+
+export { dropLast };

package/dist/drop-last.js

@@ -0,0 +1 @@
+import{a}from"./chunk-Z7EBGO2B.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropLast};

package/dist/drop-while.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkU5EQP4BOcjs = require('./chunk-U5EQP4BO.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.dropWhile = _chunkU5EQP4BOcjs.a;

package/dist/drop-while.d.cts

@@ -0,0 +1,31 @@
+/**
+ * Removes elements from the beginning of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array, until the predicate returns false. The returned array includes the rest of the elements, starting with the element that produced false for the predicate.
+ *
+ * @param data - The array.
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropWhile(data, predicate)
+ * @example
+ *    P.dropWhile([1, 2, 10, 3, 4], x => x < 10) // => [10, 3, 4]
+ * @dataFirst
+ * @category Array
+ */
+declare function dropWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+/**
+ * Removes elements from the beginning of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array, until the predicate returns false. The returned array includes the rest of the elements, starting with the element that produced false for the predicate.
+ *
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropWhile(predicate)(data)
+ * @example
+ *    P.pipe([1, 2, 10, 3, 4], P.dropWhile(x => x < 10))  // => [10, 3, 4]
+ * @dataLast
+ * @category Array
+ */
+declare function dropWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+
+export { dropWhile };

package/dist/drop-while.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Removes elements from the beginning of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array, until the predicate returns false. The returned array includes the rest of the elements, starting with the element that produced false for the predicate.
+ *
+ * @param data - The array.
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropWhile(data, predicate)
+ * @example
+ *    P.dropWhile([1, 2, 10, 3, 4], x => x < 10) // => [10, 3, 4]
+ * @dataFirst
+ * @category Array
+ */
+declare function dropWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+/**
+ * Removes elements from the beginning of the array until the predicate returns false.
+ *
+ * The predicate is applied to each element in the array, until the predicate returns false. The returned array includes the rest of the elements, starting with the element that produced false for the predicate.
+ *
+ * @param predicate - The predicate.
+ * @signature
+ *    P.dropWhile(predicate)(data)
+ * @example
+ *    P.pipe([1, 2, 10, 3, 4], P.dropWhile(x => x < 10))  // => [10, 3, 4]
+ * @dataLast
+ * @category Array
+ */
+declare function dropWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+
+export { dropWhile };

package/dist/drop-while.js

@@ -0,0 +1 @@
+import{a}from"./chunk-YWSZXRUY.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as dropWhile};

package/dist/drop.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk65DHT5Z7cjs = require('./chunk-65DHT5Z7.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.drop = _chunk65DHT5Z7cjs.a;

package/dist/drop.d.cts

@@ -0,0 +1,29 @@
+/**
+ * Removes first `n` elements from the `array`.
+ *
+ * @param array - The target array.
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.drop(array, n)
+ * @example
+ *    P.drop([1, 2, 3, 4, 5], 2) // => [3, 4, 5]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function drop<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+/**
+ * Removes first `n` elements from the `array`.
+ *
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.drop(n)(array)
+ * @example
+ *    P.drop(2)([1, 2, 3, 4, 5]) // => [3, 4, 5]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function drop<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+
+export { drop };

package/dist/drop.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Removes first `n` elements from the `array`.
+ *
+ * @param array - The target array.
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.drop(array, n)
+ * @example
+ *    P.drop([1, 2, 3, 4, 5], 2) // => [3, 4, 5]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function drop<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+/**
+ * Removes first `n` elements from the `array`.
+ *
+ * @param n - The number of elements to skip.
+ * @signature
+ *    P.drop(n)(array)
+ * @example
+ *    P.drop(2)([1, 2, 3, 4, 5]) // => [3, 4, 5]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function drop<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+
+export { drop };

package/dist/drop.js

@@ -0,0 +1 @@
+import{a}from"./chunk-66KQORMS.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as drop};

package/dist/entries.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXXQWPQH3cjs = require('./chunk-XXQWPQH3.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.entries = _chunkXXQWPQH3cjs.a;

package/dist/entries.d.cts

@@ -0,0 +1,31 @@
+import { Simplify } from 'type-fest';
+
+type EntryForKey<T, Key extends keyof T> = Key extends number | string ? [key: `${Key}`, value: Required<T>[Key]] : never;
+type Entry<T> = Simplify<{
+    [P in keyof T]-?: EntryForKey<T, P>;
+}[keyof T]>;
+/**
+ * Returns an array of key/values of the enumerable properties of an object.
+ *
+ * @param data - Object to return keys and values of.
+ * @signature
+ *    P.entries(object)
+ * @example
+ *    P.entries({ a: 1, b: 2, c: 3 }); // => [['a', 1], ['b', 2], ['c', 3]]
+ * @dataFirst
+ * @category Object
+ */
+declare function entries<T extends {}>(data: T): Array<Entry<T>>;
+/**
+ * Returns an array of key/values of the enumerable properties of an object.
+ *
+ * @signature
+ *    P.entries()(object)
+ * @example
+ *    P.pipe({ a: 1, b: 2, c: 3 }, P.entries()); // => [['a', 1], ['b', 2], ['c', 3]]
+ * @dataLast
+ * @category Object
+ */
+declare function entries(): <T extends {}>(data: T) => Array<Entry<T>>;
+
+export { entries };

package/dist/entries.d.ts

@@ -0,0 +1,31 @@
+import { Simplify } from 'type-fest';
+
+type EntryForKey<T, Key extends keyof T> = Key extends number | string ? [key: `${Key}`, value: Required<T>[Key]] : never;
+type Entry<T> = Simplify<{
+    [P in keyof T]-?: EntryForKey<T, P>;
+}[keyof T]>;
+/**
+ * Returns an array of key/values of the enumerable properties of an object.
+ *
+ * @param data - Object to return keys and values of.
+ * @signature
+ *    P.entries(object)
+ * @example
+ *    P.entries({ a: 1, b: 2, c: 3 }); // => [['a', 1], ['b', 2], ['c', 3]]
+ * @dataFirst
+ * @category Object
+ */
+declare function entries<T extends {}>(data: T): Array<Entry<T>>;
+/**
+ * Returns an array of key/values of the enumerable properties of an object.
+ *
+ * @signature
+ *    P.entries()(object)
+ * @example
+ *    P.pipe({ a: 1, b: 2, c: 3 }, P.entries()); // => [['a', 1], ['b', 2], ['c', 3]]
+ * @dataLast
+ * @category Object
+ */
+declare function entries(): <T extends {}>(data: T) => Array<Entry<T>>;
+
+export { entries };

package/dist/entries.js

@@ -0,0 +1 @@
+import{a}from"./chunk-PWOIVNVI.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as entries};

package/dist/evolve.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkMQ3SR4YOcjs = require('./chunk-MQ3SR4YO.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.evolve = _chunkMQ3SR4YOcjs.a;

package/dist/evolve.d.cts

@@ -0,0 +1,103 @@
+import { I as IterableContainer } from './types-DCY4LHuA.cjs';
+import 'type-fest';
+
+/**
+ * Creates an assumed `evolver` type from the type of `data` argument.
+ *
+ * @example
+ * interface Data {
+ *   id: number;
+ *   quartile: Array<number>;
+ *   time?: { elapsed: number; remaining?: number };
+ * }
+ * type Nested = Evolver<Data>; //  => type Nested = {
+ * //   id?: ((data: number) => unknown) | undefined;
+ * //   quartile?: ((data: number[]) => unknown) | undefined;
+ * //   time?:
+ * //     | ((data: { elapsed: number; remaining?: number | undefined }) => unknown)
+ * //     | {
+ * //         elapsed?: ((data: number) => unknown) | undefined;
+ * //         remaining?: ((data: number) => unknown) | undefined;
+ * //       }
+ * //     | undefined;
+ * // };
+ */
+type Evolver<T> = T extends object ? T extends IterableContainer ? never : {
+    readonly [K in keyof T]?: K extends symbol ? never : ((data: Required<T>[K]) => unknown) | Evolver<T[K]>;
+} : never;
+/**
+ * Creates return type from the type of arguments of `evolve`.
+ */
+type Evolved<T, E> = T extends object ? {
+    -readonly [K in keyof T]: K extends keyof E ? E[K] extends (...arg: any) => infer R ? R : Evolved<T[K], E[K]> : Required<T>[K];
+} : T;
+/**
+ * Creates a new object by applying functions that is included in `evolver` object parameter
+ * to the `data` object parameter according to their corresponding path.
+ *
+ * Functions included in `evolver` object will not be invoked
+ * if its corresponding key does not exist in the `data` object.
+ * Also, values included in `data` object will be kept as is
+ * if its corresponding key does not exist in the `evolver` object.
+ *
+ * @param object - 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
+ * the corresponding value of `data` object at the same path.
+ * @signature
+ *    P.evolve(data, evolver)
+ * @example
+ *    const evolver = {
+ *      count: add(1),
+ *      time: { elapsed: add(1), remaining: add(-1) },
+ *    };
+ *    const data = {
+ *      id: 10,
+ *      count: 10,
+ *      time: { elapsed: 100, remaining: 1400 },
+ *    };
+ *    evolve(data, evolver)
+ *    // => {
+ *    //   id: 10,
+ *    //   count: 11,
+ *    //   time: { elapsed: 101, remaining: 1399 },
+ *    // }
+ * @dataFirst
+ * @category Object
+ */
+declare function evolve<T extends object, E extends Evolver<T>>(object: T, evolver: E): Evolved<T, E>;
+/**
+ * Creates a new object by applying functions that is included in `evolver` object parameter
+ * to the `data` object parameter according to their corresponding path.
+ *
+ * Functions included in `evolver` object will not be invoked
+ * if its corresponding key does not exist in the `data` object.
+ * Also, values included in `data` object will not be used
+ * if its corresponding key does not exist in the `evolver` object.
+ *
+ * @param evolver - Object that include functions that is applied to
+ * the corresponding value of `data` object at the same path.
+ * @signature
+ *    P.evolve(evolver)(data)
+ * @example
+ *    const evolver = {
+ *      count: add(1),
+ *      time: { elapsed: add(1), remaining: add(-1) },
+ *    };
+ *    const data = {
+ *      id: 10,
+ *      count: 10,
+ *      time: { elapsed: 100, remaining: 1400 },
+ *    };
+ *    P.pipe(object, P.evolve(evolver))
+ *    // => {
+ *    //   id: 10,
+ *    //   count: 11,
+ *    //   time: { elapsed: 101, remaining: 1399 },
+ *    // }
+ * @dataLast
+ * @category Object
+ */
+declare function evolve<T extends object, E extends Evolver<T>>(evolver: E): (object: T) => Evolved<T, E>;
+
+export { evolve };

package/dist/evolve.d.ts

@@ -0,0 +1,103 @@
+import { I as IterableContainer } from './types-DCY4LHuA.js';
+import 'type-fest';
+
+/**
+ * Creates an assumed `evolver` type from the type of `data` argument.
+ *
+ * @example
+ * interface Data {
+ *   id: number;
+ *   quartile: Array<number>;
+ *   time?: { elapsed: number; remaining?: number };
+ * }
+ * type Nested = Evolver<Data>; //  => type Nested = {
+ * //   id?: ((data: number) => unknown) | undefined;
+ * //   quartile?: ((data: number[]) => unknown) | undefined;
+ * //   time?:
+ * //     | ((data: { elapsed: number; remaining?: number | undefined }) => unknown)
+ * //     | {
+ * //         elapsed?: ((data: number) => unknown) | undefined;
+ * //         remaining?: ((data: number) => unknown) | undefined;
+ * //       }
+ * //     | undefined;
+ * // };
+ */
+type Evolver<T> = T extends object ? T extends IterableContainer ? never : {
+    readonly [K in keyof T]?: K extends symbol ? never : ((data: Required<T>[K]) => unknown) | Evolver<T[K]>;
+} : never;
+/**
+ * Creates return type from the type of arguments of `evolve`.
+ */
+type Evolved<T, E> = T extends object ? {
+    -readonly [K in keyof T]: K extends keyof E ? E[K] extends (...arg: any) => infer R ? R : Evolved<T[K], E[K]> : Required<T>[K];
+} : T;
+/**
+ * Creates a new object by applying functions that is included in `evolver` object parameter
+ * to the `data` object parameter according to their corresponding path.
+ *
+ * Functions included in `evolver` object will not be invoked
+ * if its corresponding key does not exist in the `data` object.
+ * Also, values included in `data` object will be kept as is
+ * if its corresponding key does not exist in the `evolver` object.
+ *
+ * @param object - 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
+ * the corresponding value of `data` object at the same path.
+ * @signature
+ *    P.evolve(data, evolver)
+ * @example
+ *    const evolver = {
+ *      count: add(1),
+ *      time: { elapsed: add(1), remaining: add(-1) },
+ *    };
+ *    const data = {
+ *      id: 10,
+ *      count: 10,
+ *      time: { elapsed: 100, remaining: 1400 },
+ *    };
+ *    evolve(data, evolver)
+ *    // => {
+ *    //   id: 10,
+ *    //   count: 11,
+ *    //   time: { elapsed: 101, remaining: 1399 },
+ *    // }
+ * @dataFirst
+ * @category Object
+ */
+declare function evolve<T extends object, E extends Evolver<T>>(object: T, evolver: E): Evolved<T, E>;
+/**
+ * Creates a new object by applying functions that is included in `evolver` object parameter
+ * to the `data` object parameter according to their corresponding path.
+ *
+ * Functions included in `evolver` object will not be invoked
+ * if its corresponding key does not exist in the `data` object.
+ * Also, values included in `data` object will not be used
+ * if its corresponding key does not exist in the `evolver` object.
+ *
+ * @param evolver - Object that include functions that is applied to
+ * the corresponding value of `data` object at the same path.
+ * @signature
+ *    P.evolve(evolver)(data)
+ * @example
+ *    const evolver = {
+ *      count: add(1),
+ *      time: { elapsed: add(1), remaining: add(-1) },
+ *    };
+ *    const data = {
+ *      id: 10,
+ *      count: 10,
+ *      time: { elapsed: 100, remaining: 1400 },
+ *    };
+ *    P.pipe(object, P.evolve(evolver))
+ *    // => {
+ *    //   id: 10,
+ *    //   count: 11,
+ *    //   time: { elapsed: 101, remaining: 1399 },
+ *    // }
+ * @dataLast
+ * @category Object
+ */
+declare function evolve<T extends object, E extends Evolver<T>>(evolver: E): (object: T) => Evolved<T, E>;
+
+export { evolve };

package/dist/evolve.js

@@ -0,0 +1 @@
+import{a}from"./chunk-VJMHXGZD.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as evolve};

package/dist/filter.cjs

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk7IYJC2PMcjs = require('./chunk-7IYJC2PM.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.filter = _chunk7IYJC2PMcjs.a;

package/dist/filter.d.cts

@@ -0,0 +1,43 @@
+/**
+ * Creates a shallow copy of a portion of a given array, filtered down to just
+ * the elements from the given array that pass the test implemented by the
+ * provided function. Equivalent to `Array.prototype.filter`.
+ *
+ * @param data - The array to filter.
+ * @param predicate - A function to execute for each element in the array. It
+ * should return `true` to keep the element in the resulting array, and `false`
+ * otherwise. A type-predicate can also be used to narrow the result.
+ * @returns A shallow copy of the given array containing just the elements that
+ * pass the test. If no elements pass the test, an empty array is returned.
+ * @signature
+ *    P.filter(data, predicate)
+ * @example
+ *    P.filter([1, 2, 3], x => x % 2 === 1) // => [1, 3]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function filter<T, S extends T>(data: ReadonlyArray<T>, predicate: (value: T, index: number, data: ReadonlyArray<T>) => value is S): Array<S>;
+declare function filter<T>(data: ReadonlyArray<T>, predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+/**
+ * Creates a shallow copy of a portion of a given array, filtered down to just
+ * the elements from the given array that pass the test implemented by the
+ * provided function. Equivalent to `Array.prototype.filter`.
+ *
+ * @param predicate - A function to execute for each element in the array. It
+ * should return `true` to keep the element in the resulting array, and `false`
+ * otherwise.
+ * @returns A shallow copy of the given array containing just the elements that
+ * pass the test. If no elements pass the test, an empty array is returned.
+ * @signature
+ *    P.filter(predicate)(data)
+ * @example
+ *    P.pipe([1, 2, 3], P.filter(x => x % 2 === 1)) // => [1, 3]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function filter<T, S extends T>(predicate: (value: T, index: number, data: ReadonlyArray<T>) => value is S): (data: ReadonlyArray<T>) => Array<S>;
+declare function filter<T>(predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean): (data: ReadonlyArray<T>) => Array<T>;
+
+export { filter };