@vinicunca/perkakas 0.4.0 → 0.4.3

package/dist/types/array/drop-while.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"drop-while.d.ts","sourceRoot":"","sources":["../../../src/array/drop-while.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EACtB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,KAAK,CAAC,CAAC,CAAC,CAAC;AAEZ;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAC9B,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC"}

package/dist/types/array/drop.d.ts

@@ -1,32 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-/**
- * 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
- * @pipeable
- * @category Array
- */
-export 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
- * @pipeable
- * @category Array
- */
-export declare function drop<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
-export declare namespace drop {
-    function lazy<T>(n: number): LazyEvaluator<T>;
-}
-//# sourceMappingURL=drop.d.ts.map

package/dist/types/array/drop.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"drop.d.ts","sourceRoot":"","sources":["../../../src/array/drop.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKtD;;;;;;;;;;;;GAYG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AAEtE;;;;;;;;;;;GAWG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAU1E,yBAAiB,IAAI,CAAC;IACpB,SAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAUnD;CACF"}

package/dist/types/array/filter.d.ts

@@ -1,63 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-import type { Pred, PredIndexed, PredIndexedOptional } from '../utils/types';
-/**
- * Filter the elements of an array that meet the condition specified in a callback function.
- *
- * @param array The array to filter.
- * @param fn the callback function.
- * @signature
- *    P.filter(array, fn)
- *    P.filter.indexed(array, fn)
- * @example
- *    P.filter([1, 2, 3], x => x % 2 === 1) // => [1, 3]
- *    P.filter.indexed([1, 2, 3], (x, i, array) => x % 2 === 1) // => [1, 3]
- *    // Excludes the values from `other` array
- *    P.filter(array, P.isNot(P.isIncludedIn(other)))
- *    // Returns a list of elements that exist in both array.
- *    P.filter(array, P.isIncludedIn(other))
- * @dataFirst
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function filter<T, S extends T>(array: ReadonlyArray<T>, fn: (value: T) => value is S): Array<S>;
-export declare function filter<T>(array: ReadonlyArray<T>, fn: Pred<T, boolean>): Array<T>;
-/**
- * Filter the elements of an array that meet the condition specified in a callback function.
- *
- * @param fn the callback function.
- * @signature
- *    P.filter(fn)(array)
- *    P.filter.indexed(fn)(array)
- * @example
- *    P.pipe([1, 2, 3], P.filter(x => x % 2 === 1)) // => [1, 3]
- *    P.pipe([1, 2, 3], P.filter.indexed((x, i) => x % 2 === 1)) // => [1, 3]
- *    // Filter out all falsy values
- *    P.filter(P.isTruthy)
- *    // Counts how many values of the collection pass the specified predicate
- *    P.filter(fn).length
- *    // Excludes the values from `other` array
- *    P.filter(P.isNot(P.isIncludedIn(other)))
- *    // Returns a list of elements that exist in both array.
- *    P.filter(P.isIncludedIn(other))
- * @dataLast
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function filter<T, S extends T>(fn: (input: T) => input is S): (array: ReadonlyArray<T>) => Array<S>;
-export declare function filter<T>(fn: Pred<T, boolean>): (array: ReadonlyArray<T>) => Array<T>;
-export declare namespace filter {
-    function indexed<T, S extends T>(array: ReadonlyArray<T>, fn: (input: T, index: number, array: ReadonlyArray<T>) => input is S): Array<S>;
-    function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): Array<T>;
-    /**
-     * @dataLast
-     */
-    function indexed<T, S extends T>(fn: (input: T, index: number, array: ReadonlyArray<T>) => input is S): (array: ReadonlyArray<T>) => Array<S>;
-    function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => Array<T>;
-    const lazy: <T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T>;
-    const lazyIndexed: (<T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T>) & {
-        readonly indexed: true;
-    };
-}
-//# sourceMappingURL=filter.d.ts.map

package/dist/types/array/filter.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../../src/array/filter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAM7E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACnC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,GAC3B,KAAK,CAAC,CAAC,CAAC,CAAC;AACZ,wBAAgB,MAAM,CAAC,CAAC,EACtB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,KAAK,CAAC,CAAC,CAAC,CAAC;AAEZ;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACnC,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,GAC3B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AACzC,wBAAgB,MAAM,CAAC,CAAC,EACtB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAwBzC,yBAAiB,MAAM,CAAC;IACtB,SAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACpC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,GACnE,KAAK,CAAC,CAAC,CAAC,CAAC;IACZ,SAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,KAAK,CAAC,CAAC,CAAC,CAAC;IACZ;;OAEG;IACH,SAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACpC,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,GACnE,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;IACzC,SAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;IAKlC,MAAM,IAAI,8DAAe,CAAC;IAC1B,MAAM,WAAW;;KAA6B,CAAC;CACvD"}

package/dist/types/array/find-index.d.ts

@@ -1,54 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-import type { Pred, PredIndexed, PredIndexedOptional } from '../utils/types';
-/**
- * Returns the index of the first element in the array where predicate is true, and -1 otherwise.
- *
- * @param items the array
- * @param fn the predicate
- * @signature
- *    P.findIndex(items, fn)
- *    P.findIndex.indexed(items, fn)
- * @example
- *    P.findIndex([1, 3, 4, 6], n => n % 2 === 0) // => 2
- *    P.findIndex.indexed([1, 3, 4, 6], (n, i) => n % 2 === 0) // => 2
- * @dataFirst
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function findIndex<T>(items: ReadonlyArray<T>, fn: Pred<T, boolean>): number;
-/**
- * Returns the index of the first element in the array where predicate is true, and -1 otherwise.
- *
- * @param fn the predicate
- * @signature
- *    P.findIndex(fn)(items)
- *    P.findIndex.indexed(fn)(items)
- * @example
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.findIndex(n => n % 2 === 0)
- *    ) // => 2
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.findIndex.indexed((n, i) => n % 2 === 0)
- *    ) // => 2
- * @dataLast
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function findIndex<T>(fn: Pred<T, boolean>): (items: ReadonlyArray<T>) => number;
-export declare namespace findIndex {
-    function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): number;
-    function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => number;
-    const lazy: (<T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T, number>) & {
-        readonly single: true;
-    };
-    const lazyIndexed: (<T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T, number>) & {
-        readonly indexed: true;
-    } & {
-        readonly single: true;
-    };
-}
-//# sourceMappingURL=find-index.d.ts.map

package/dist/types/array/find-index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-index.d.ts","sourceRoot":"","sources":["../../../src/array/find-index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAM7E;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,MAAM,CAAC;AAEV;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC;AA0BvC,yBAAiB,SAAS,CAAC;IACzB,SAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,MAAM,CAAC;IACV,SAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC;IAKhC,MAAM,IAAI;;KAAyB,CAAC;IAEpC,MAAM,WAAW;;;;KAAuC,CAAC;CACjE"}

package/dist/types/array/find-last-index.d.ts

@@ -1,45 +0,0 @@
-import type { Pred, PredIndexed } from '../utils/types';
-/**
- * Returns the index of the last element in the array where predicate is true, and -1 otherwise.
- *
- * @param array the array
- * @param fn the predicate
- * @signature
- *    P.findLastIndex(items, fn)
- *    P.findLastIndex.indexed(items, fn)
- * @example
- *    P.findLastIndex([1, 3, 4, 6], n => n % 2 === 1) // => 1
- *    P.findLastIndex.indexed([1, 3, 4, 6], (n, i) => n % 2 === 1) // => 1
- * @dataFirst
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function findLastIndex<T>(array: ReadonlyArray<T>, fn: Pred<T, boolean>): number;
-/**
- * Returns the index of the last element in the array where predicate is true, and -1 otherwise.
- *
- * @param fn the predicate
- * @signature
- *    P.findLastIndex(fn)(items)
- *    P.findLastIndex.indexed(fn)(items)
- * @example
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.findLastIndex(n => n % 2 === 1)
- *    ) // => 1
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.findLastIndex.indexed((n, i) => n % 2 === 1)
- *    ) // => 1
- * @dataLast
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function findLastIndex<T>(fn: Pred<T, boolean>): (array: ReadonlyArray<T>) => number;
-export declare namespace findLastIndex {
-    function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): number;
-    function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => number;
-}
-//# sourceMappingURL=find-last-index.d.ts.map

package/dist/types/array/find-last-index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-last-index.d.ts","sourceRoot":"","sources":["../../../src/array/find-last-index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAuB,MAAM,gBAAgB,CAAC;AAI7E;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,MAAM,CAAC;AAEV;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC;AAkBvC,yBAAiB,aAAa,CAAC;IAC7B,SAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,MAAM,CAAC;IACV,SAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC;CAKxC"}

package/dist/types/array/find-last.d.ts

@@ -1,45 +0,0 @@
-import type { Pred, PredIndexed } from '../utils/types';
-/**
- * Returns the value of the last element in the array where predicate is true, and undefined
- * otherwise.
- * @param array the array
- * @param fn the predicate
- * @signature
- *    P.findLast(items, fn)
- *    P.findLast.indexed(items, fn)
- * @example
- *    P.findLast([1, 3, 4, 6], n => n % 2 === 1) // => 3
- *    P.findLast.indexed([1, 3, 4, 6], (n, i) => n % 2 === 1) // => 3
- * @dataFirst
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function findLast<T>(array: ReadonlyArray<T>, fn: Pred<T, boolean>): T | undefined;
-/**
- * Returns the value of the last element in the array where predicate is true, and undefined
- * otherwise.
- * @param fn the predicate
- * @signature
- *    P.findLast(fn)(items)
- *    P.findLast.indexed(fn)(items)
- * @example
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.findLast(n => n % 2 === 1)
- *    ) // => 3
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.findLast.indexed((n, i) => n % 2 === 1)
- *    ) // => 3
- * @dataLast
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function findLast<T = never>(fn: Pred<T, boolean>): (array: ReadonlyArray<T>) => T | undefined;
-export declare namespace findLast {
-    function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): T | undefined;
-    function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => T | undefined;
-}
-//# sourceMappingURL=find-last.d.ts.map

package/dist/types/array/find-last.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"find-last.d.ts","sourceRoot":"","sources":["../../../src/array/find-last.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAuB,MAAM,gBAAgB,CAAC;AAI7E;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACxB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,GAAG,SAAS,CAAC;AAEjB;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,QAAQ,CAAC,CAAC,GAAG,KAAK,EAChC,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;AAkB9C,yBAAiB,QAAQ,CAAC;IACxB,SAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,GAAG,SAAS,CAAC;IACjB,SAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;CAK/C"}

package/dist/types/array/find.d.ts

@@ -1,52 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-import type { Pred, PredIndexed, PredIndexedOptional } from '../utils/types';
-/**
- * Returns the value of the first element in the array where predicate is true, and undefined otherwise.
- * @param items the array
- * @param fn the predicate
- * @signature
- *    P.find(items, fn)
- *    P.find.indexed(items, fn)
- * @example
- *    P.find([1, 3, 4, 6], n => n % 2 === 0) // => 4
- *    P.find.indexed([1, 3, 4, 6], (n, i) => n % 2 === 0) // => 4
- * @dataFirst
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function find<T>(items: ReadonlyArray<T>, fn: Pred<T, boolean>): T | undefined;
-/**
- * Returns the value of the first element in the array where predicate is true, and undefined otherwise.
- * @param fn the predicate
- * @signature
- *    P.find(fn)(items)
- *    P.find.indexed(fn)(items)
- * @example
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.find(n => n % 2 === 0)
- *    ) // => 4
- *    P.pipe(
- *      [1, 3, 4, 6],
- *      P.find.indexed((n, i) => n % 2 === 0)
- *    ) // => 4
- * @dataLast
- * @indexed
- * @pipeable
- * @category Array
- */
-export declare function find<T = never>(fn: Pred<T, boolean>): (array: ReadonlyArray<T>) => T | undefined;
-export declare namespace find {
-    function indexed<T>(array: ReadonlyArray<T>, fn: PredIndexed<T, boolean>): T | undefined;
-    function indexed<T>(fn: PredIndexed<T, boolean>): (array: ReadonlyArray<T>) => T | undefined;
-    const lazy: (<T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T>) & {
-        readonly single: true;
-    };
-    const lazyIndexed: (<T>(fn: PredIndexedOptional<T, boolean>) => LazyEvaluator<T>) & {
-        readonly indexed: true;
-    } & {
-        readonly single: true;
-    };
-}
-//# sourceMappingURL=find.d.ts.map

package/dist/types/array/find.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"find.d.ts","sourceRoot":"","sources":["../../../src/array/find.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAM7E;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,IAAI,CAAC,CAAC,EACpB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,GAAG,SAAS,CAAC;AAEjB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,IAAI,CAAC,CAAC,GAAG,KAAK,EAC5B,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,GACnB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;AAoB9C,yBAAiB,IAAI,CAAC;IACpB,SAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,GAAG,SAAS,CAAC;IACjB,SAAgB,OAAO,CAAC,CAAC,EACvB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,GAC1B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;IAKvC,MAAM,IAAI;;KAAyB,CAAC;IAEpC,MAAM,WAAW;;;;KAAuC,CAAC;CACjE"}

package/dist/types/array/first-by.d.ts

@@ -1,56 +0,0 @@
-import type { IterableContainer, NonEmptyArray } from '../utils/types';
-import { type OrderRule } from '../utils/purry-order-rules';
-type FirstBy<T extends IterableContainer> = (T extends readonly [unknown, ...ReadonlyArray<unknown>] ? never : T extends readonly [...ReadonlyArray<unknown>, unknown] ? never : undefined) | T[number];
-/**
- * Find the first element in the array that adheres to the order rules provided. This is a superset of what a typical `maxBy` or `minBy` function would do as it allows defining "tie-breaker" rules when values are equal, and allows comparing items using any logic. This function is equivalent to calling `P.first(P.sortBy(...))` but runs at *O(n)* instead of *O(nlogn)*.
- *
- * Use `nthBy` if you need an element other that the first, or `takeFirstBy` if you more than just the first element.
- *
- * @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 ordeP.
- * @returns the first element by the order criteria, or `undefined` if the array
- * is empty. (The function provides strong typing if the input type assures the
- * array isn't empty).
- * @signature
- *   P.firstBy(...rules)(data);
- * @example
- *   const max = P.pipe([1,2,3], P.firstBy([P.identity, "desc"])); // => 3;
- *   const min = P.pipe([1,2,3], P.firstBy([1,2,3])); // => 1;
- *
- *   const data = [{ a: "a" }, { a: "aa" }, { a: "aaa" }] as const;
- *   const maxBy = P.pipe(data, P.firstBy([(item) => item.a.length, "desc"])); // => { a: "aaa" };
- *   const minBy = P.pipe(data, P.firstBy((item) => item.a.length)); // => { a: "a" };
- *
- *   const data = [{type: "cat", size: 1}, {type: "cat", size: 2}, {type: "dog", size: 3}] as const;
- *   const multi = P.pipe(data, P.firstBy(P.prop('type'), [P.prop('size'), 'desc'])); // => {type: "cat", size: 2}
- * @dataLast
- * @category Array
- */
-export declare function firstBy<T extends IterableContainer>(...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): (data: T) => FirstBy<T>;
-/**
- * Find the first element in the array that adheres to the order rules provided. This is a superset of what a typical `maxBy` or `minBy` function would do as it allows defining "tie-breaker" rules when values are equal, and allows comparing items using any logic. This function is equivalent to calling `P.first(P.sortBy(...))` but runs at *O(n)* instead of *O(nlogn)*.
- *
- * Use `nthBy` if you need an element other that the first, or `takeFirstBy` if you more than just the first element.
- *
- * @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 ordeP.
- * @returns the first element by the order criteria, or `undefined` if the array
- * is empty. (The function provides strong typing if the input type assures the
- * array isn't empty).
- * @signature
- *   P.firstBy(data, ...rules);
- * @example
- *   const max = P.firstBy([1,2,3], [P.identity, "desc"]); // => 3;
- *   const min = P.firstBy([1,2,3], P.identity); // => 1;
- *
- *   const data = [{ a: "a" }, { a: "aa" }, { a: "aaa" }] as const;
- *   const maxBy = P.firstBy(data, [(item) => item.a.length, "desc"]); // => { a: "aaa" };
- *   const minBy = P.firstBy(data, (item) => item.a.length); // => { a: "a" };
- *
- *   const data = [{type: "cat", size: 1}, {type: "cat", size: 2}, {type: "dog", size: 3}] as const;
- *   const multi = P.firstBy(data, P.prop('type'), [P.prop('size'), 'desc']); // => {type: "cat", size: 2}
- * @dataFirst
- * @category Array
- */
-export declare function firstBy<T extends IterableContainer>(data: T, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): FirstBy<T>;
-export {};
-//# sourceMappingURL=first-by.d.ts.map

package/dist/types/array/first-by.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"first-by.d.ts","sourceRoot":"","sources":["../../../src/array/first-by.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAmB,iBAAiB,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAExF,OAAO,EAAE,KAAK,SAAS,EAAmB,MAAM,4BAA4B,CAAC;AAG7E,KAAK,OAAO,CAAC,CAAC,SAAS,iBAAiB,IACpC,CAAC,CAAC,SAAS,SAAS,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,GACtD,KAAK,GACL,CAAC,SAAS,SAAS,CAAC,GAAG,aAAa,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,GACrD,KAAK,GACL,SAAS,CAAC,GACV,CAAC,CAAC,MAAM,CAAC,CAAC;AAElB;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,iBAAiB,EACjD,GAAG,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GACtD,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,iBAAiB,EACjD,IAAI,EAAE,CAAC,EACP,GAAG,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GACtD,OAAO,CAAC,CAAC,CAAC,CAAC"}

package/dist/types/array/first.d.ts

@@ -1,32 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-import type { IterableContainer } from '../utils/types';
-type FirstOut<T extends IterableContainer> = T extends [] ? undefined : T extends readonly [unknown, ...Array<unknown>] ? T[0] : T extends readonly [...infer Pre, infer Last] ? Last | Pre[0] : T[0] | undefined;
-/**
- * Gets the first element of `array`.
- * Note: In `pipe`, use `first()` form instead of `first`. Otherwise, the inferred type is lost.
- * @param array the array
- * @signature
- *    P.first(array)
- * @example
- *    P.first([1, 2, 3]) // => 1
- *    P.first([]) // => undefined
- *    P.pipe(
- *      [1, 2, 4, 8, 16],
- *      P.filter(x => x > 3),
- *      P.first(),
- *      x => x + 1
- *    ); // => 5
- *
- * @category Array
- * @pipeable
- */
-export declare function first<T extends IterableContainer>(array: Readonly<T>): FirstOut<T>;
-export declare function first<T extends IterableContainer>(): (array: Readonly<T>) => FirstOut<T>;
-export declare namespace first {
-    function lazy<T>(): LazyEvaluator<T>;
-    namespace lazy {
-        const single = true;
-    }
-}
-export {};
-//# sourceMappingURL=first.d.ts.map

package/dist/types/array/first.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"first.d.ts","sourceRoot":"","sources":["../../../src/array/first.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAIxD,KAAK,QAAQ,CAAC,CAAC,SAAS,iBAAiB,IAAI,CAAC,SAAS,EAAE,GACrD,SAAS,GACT,CAAC,SAAS,SAAS,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,GAC7C,CAAC,CAAC,CAAC,CAAC,GACJ,CAAC,SAAS,SAAS,CAAC,GAAG,MAAM,GAAG,EAAE,MAAM,IAAI,CAAC,GAC3C,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GACb,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AAEzB;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,iBAAiB,EAC/C,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GACjB,QAAQ,CAAC,CAAC,CAAC,CAAC;AACf,wBAAgB,KAAK,CAAC,CAAC,SAAS,iBAAiB,KAAK,CACpD,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,KACf,QAAQ,CAAC,CAAC,CAAC,CAAC;AAUjB,yBAAiB,KAAK,CAAC;IACrB,SAAgB,IAAI,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAE1C;IAED,UAAiB,IAAI,CAAC;QACb,MAAM,MAAM,OAAO,CAAC;KAC5B;CACF"}

package/dist/types/array/flat-map-to-obj.d.ts

@@ -1,50 +0,0 @@
-/**
- * Map each element of an array into an object using a defined callback function and flatten the result.
- * @param array The array to map.
- * @param fn The mapping function, which should return an Array of key-value pairs, similar to Object.fromEntries
- * @returns The new mapped object.
- * @signature
- *    P.flatMapToObj(array, fn)
- *    P.flatMapToObj.indexed(array, fn)
- * @example
- *  P.flatMapToObj([1, 2, 3], (x) =>
- *    x % 2 === 1 ? [[String(x), x]] : []
- *  ) // => {1: 1, 3: 3}
- *  P.flatMapToObj.indexed(['a', 'b'], (x, i) => [
- *    [x, i],
- *    [x + x, i + i],
- *  ]) // => {a: 0, aa: 0, b: 1, bb: 2}
- * @dataFirst
- * @indexed
- * @category Array
- */
-export declare function flatMapToObj<T, K extends PropertyKey, V>(array: ReadonlyArray<T>, fn: (element: T) => Array<[K, V]>): Record<K, V>;
-/**
- * Map each element of an array into an object using a defined callback function and flatten the result.
- * @param fn The mapping function, which should return an Array of key-value pairs, similar to Object.fromEntries
- * @returns The new mapped object.
- * @signature
- *    P.flatMapToObj(fn)(array)
- *    P.flatMapToObj(fn)(array)
- * @example
- *    P.pipe(
- *      [1, 2, 3],
- *      P.flatMapToObj(x => (x % 2 === 1 ? [[String(x), x]] : []))
- *    ) // => {1: 1, 3: 3}
- *    P.pipe(
- *      ['a', 'b'],
- *      P.flatMapToObj.indexed((x, i) => [
- *        [x, i],
- *        [x + x, i + i],
- *      ])
- *    ) // => {a: 0, aa: 0, b: 1, bb: 2}
- * @dataLast
- * @indexed
- * @category Array
- */
-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 {
-    function indexed<T, K extends PropertyKey, V>(array: ReadonlyArray<T>, fn: (element: T, index: number, array: ReadonlyArray<T>) => Array<[K, V]>): Record<K, V>;
-    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=flat-map-to-obj.d.ts.map

package/dist/types/array/flat-map-to-obj.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flat-map-to-obj.d.ts","sourceRoot":"","sources":["../../../src/array/flat-map-to-obj.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,EACtD,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAEhB;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,EACtD,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAChC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AA2B7C,yBAAiB,YAAY,CAAC;IAC5B,SAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,EACjD,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GACxE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChB,SAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,EACjD,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GACxE,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAI9C"}

package/dist/types/array/flat-map.d.ts

@@ -1,32 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-/**
- * Map each element of an array using a defined callback function and flatten the mapped result.
- *
- * @param array The array to map.
- * @param fn The function mapper.
- * @signature
- *    P.flatMap(array, fn)
- * @example
- *    P.flatMap([1, 2, 3], x => [x, x * 10]) // => [1, 10, 2, 20, 3, 30]
- * @dataFirst
- * @pipeable
- * @category Array
- */
-export declare function flatMap<T, K>(array: ReadonlyArray<T>, fn: (input: T) => K | ReadonlyArray<K>): Array<K>;
-/**
- * Map each element of an array using a defined callback function and flatten the mapped result.
- *
- * @param fn The function mapper.
- * @signature
- *    P.flatMap(fn)(array)
- * @example
- *    P.pipe([1, 2, 3], P.flatMap(x => [x, x * 10])) // => [1, 10, 2, 20, 3, 30]
- * @dataLast
- * @pipeable
- * @category Array
- */
-export declare function flatMap<T, K>(fn: (input: T) => K | ReadonlyArray<K>): (array: ReadonlyArray<T>) => Array<K>;
-export declare namespace flatMap {
-    function lazy<T, K>(fn: (input: T) => K | ReadonlyArray<K>): LazyEvaluator<T, K>;
-}
-//# sourceMappingURL=flat-map.d.ts.map

package/dist/types/array/flat-map.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flat-map.d.ts","sourceRoot":"","sources":["../../../src/array/flat-map.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKtD;;;;;;;;;;;;GAYG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAC1B,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GACrC,KAAK,CAAC,CAAC,CAAC,CAAC;AAEZ;;;;;;;;;;;GAWG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAC1B,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GACrC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAazC,yBAAiB,OAAO,CAAC;IACvB,SAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAQtF;CACF"}

package/dist/types/array/flatten-deep.d.ts

@@ -1,37 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-type FlattenDeep<T> = T extends ReadonlyArray<infer K> ? FlattenDeep2<K> : T;
-type FlattenDeep2<T> = T extends ReadonlyArray<infer K> ? FlattenDeep3<K> : T;
-type FlattenDeep3<T> = T extends ReadonlyArray<infer K> ? FlattenDeep4<K> : T;
-type FlattenDeep4<T> = T extends ReadonlyArray<infer K> ? K : T;
-/**
- * Recursively flattens `array`.
- *
- * @param items the target array
- * @signature
- *   P.flattenDeep(array)
- * @example
- *    P.flattenDeep([[1, 2], [[3], [4, 5]]]) // => [1, 2, 3, 4, 5]
- * @pipeable
- * @category Array
- */
-export declare function flattenDeep<T>(items: ReadonlyArray<T>): Array<FlattenDeep<T>>;
-/**
- * Recursively flattens `array`.
- *
- * @signature
- *   P.flattenDeep()(array)
- * @example
- *    P.pipe(
- *      [[1, 2], [[3], [4, 5]]],
- *      P.flattenDeep(),
- *    ); // => [1, 2, 3, 4, 5]
- * @dataLast
- * @pipeable
- * @category Array
- */
-export declare function flattenDeep<T>(): (items: ReadonlyArray<T>) => Array<FlattenDeep<T>>;
-export declare namespace flattenDeep {
-    function lazy<T>(): LazyEvaluator<T, any>;
-}
-export {};
-//# sourceMappingURL=flatten-deep.d.ts.map

package/dist/types/array/flatten-deep.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flatten-deep.d.ts","sourceRoot":"","sources":["../../../src/array/flatten-deep.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKtD,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7E,KAAK,YAAY,CAAC,CAAC,IAAI,CAAC,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC9E,KAAK,YAAY,CAAC,CAAC,IAAI,CAAC,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC9E,KAAK,YAAY,CAAC,CAAC,IAAI,CAAC,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAEhE;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AAE/E;;;;;;;;;;;;;GAaG;AACH,wBAAgB,WAAW,CAAC,CAAC,KAAK,CAChC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KACpB,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AA2B3B,yBAAiB,WAAW,CAAC;IAC3B,SAAgB,IAAI,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC,EAAE,GAAG,CAAC,CAO/C;CACF"}

package/dist/types/array/flatten.d.ts

@@ -1,39 +0,0 @@
-import type { LazyEvaluator } from '../function/pipe';
-type Flatten<T> = T extends ReadonlyArray<infer K> ? K : T;
-/**
- * Flattens `array` a single level deep.
- *
- * @param items the target array
- * @signature
- *    P.flatten(array)
- * @example
- *    P.flatten([[1, 2], [3], [4, 5]]) // => [1, 2, 3, 4, 5]
- *    P.pipe(
- *      [[1, 2], [3], [4, 5]],
- *      P.flatten(),
- *    ); // => [1, 2, 3, 4, 5]
- * @dataFirst
- * @pipeable
- * @category Array
- */
-export declare function flatten<T>(items: ReadonlyArray<T>): Array<Flatten<T>>;
-/**
- * Flattens `array` a single level deep.
- *
- * @signature
- *   P.flatten()(array)
- * @example
- *    P.pipe(
- *      [[1, 2], [3], [4, 5]],
- *      P.flatten(),
- *    ); // => [1, 2, 3, 4, 5]
- * @dataLast
- * @pipeable
- * @category Array
- */
-export declare function flatten<T>(): (items: ReadonlyArray<T>) => Array<Flatten<T>>;
-export declare namespace flatten {
-    function lazy<T>(): LazyEvaluator<T, Flatten<T>>;
-}
-export {};
-//# sourceMappingURL=flatten.d.ts.map

package/dist/types/array/flatten.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flatten.d.ts","sourceRoot":"","sources":["../../../src/array/flatten.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKtD,KAAK,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAE3D;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AAEvE;;;;;;;;;;;;;GAaG;AACH,wBAAgB,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AAU7E,yBAAiB,OAAO,CAAC;IACvB,SAAgB,IAAI,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAMtD;CACF"}