@vinicunca/perkakas 1.7.0 → 1.8.0

package/dist/first-by-Dm9iyhMz.d.cts

@@ -0,0 +1,60 @@
+import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
+import { NonEmptyArray } from "./non-empty-array-D3ZRHApS.cjs";
+import { OrderRule } from "./curry-order-rules-1zjlAgqa.cjs";
+
+//#region src/first-by.d.ts
+type FirstBy<T extends IterableContainer> = T[number] | (T extends readonly [unknown, ...ReadonlyArray<unknown>] ? never : T extends readonly [...ReadonlyArray<unknown>, unknown] ? never : undefined);
+/**
+ * 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 order.
+ * @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(P.identity())); // => 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
+ */
+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 order.
+ * @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
+ */
+declare function firstBy<T extends IterableContainer>(data: T, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): FirstBy<T>;
+//#endregion
+export { firstBy };
+//# sourceMappingURL=first-by-Dm9iyhMz.d.cts.map

package/dist/first-by-Dm9iyhMz.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"first-by-Dm9iyhMz.d.cts","names":[],"sources":["../src/first-by.ts"],"sourcesContent":[],"mappings":";;;;;KAOK,kBAAkB,qBACjB,aACC,gCAAgC,kCAE/B,uBAAuB;;AARuC;;;;;;;;;AAoCtE;;;;;;;;;;;AA6BA;;;AACQ,iBA9BQ,OA8BR,CAAA,UA9B0B,iBA8B1B,CAAA,CAAA,GAAA,KAAA,EA7BI,QA6BJ,CA7Ba,aA6Bb,CA7B2B,SA6B3B,CA7BqC,CA6BrC,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAA,IAAA,EA5BE,CA4BF,EAAA,GA5BQ,OA4BR,CA5BgB,CA4BhB,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;iBADQ,kBAAkB,yBAC1B,aACI,SAAS,cAAc,UAAU,eAC1C,QAAQ"}

package/dist/first-by.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBSNCALDTcjs = require('./chunk-BSNCALDT.cjs');require('./chunk-EROXO3T4.cjs');require('./chunk-66JP4PUG.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.firstBy = _chunkBSNCALDTcjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`),require(`./curry-order-rules-UcuuWkKd.cjs`),require(`./has-at-least-D-ahiJB6.cjs`);const e=require(`./first-by-BzxRBZ5J.cjs`);exports.firstBy=e.firstBy;

package/dist/first-by.d.cts

@@ -1,58 +1,5 @@
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.cjs';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
-
-type FirstBy<T extends IterableContainer> = T[number] | (T extends readonly [unknown, ...ReadonlyArray<unknown>] ? never : T extends readonly [...ReadonlyArray<unknown>, unknown] ? never : undefined);
-/**
- * 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 order.
- * @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(P.identity())); // => 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
- */
-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 order.
- * @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
- */
-declare function firstBy<T extends IterableContainer>(data: T, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): FirstBy<T>;
-
-export { firstBy };
+import "./iterable-container-V5sa0V_H.cjs";
+import "./non-empty-array-D3ZRHApS.cjs";
+import "./curry-order-rules-1zjlAgqa.cjs";
+import { firstBy } from "./first-by-Dm9iyhMz.cjs";
+export { firstBy };

package/dist/first-by.d.ts

@@ -1,58 +1,5 @@
-import { O as OrderRule } from './curry-order-rules-BKXCPBNx.js';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
-
-type FirstBy<T extends IterableContainer> = T[number] | (T extends readonly [unknown, ...ReadonlyArray<unknown>] ? never : T extends readonly [...ReadonlyArray<unknown>, unknown] ? never : undefined);
-/**
- * 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 order.
- * @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(P.identity())); // => 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
- */
-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 order.
- * @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
- */
-declare function firstBy<T extends IterableContainer>(data: T, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): FirstBy<T>;
-
-export { firstBy };
+import "./iterable-container-wtkYslN_.js";
+import "./non-empty-array-D3HWDPMt.js";
+import "./curry-order-rules-Cthu8rj4.js";
+import { firstBy } from "./first-by-C0qf5rwh.js";
+export { firstBy };

package/dist/first-by.js

@@ -1 +1 @@
-import{a}from"./chunk-GRKRFDIL.js";import"./chunk-7KBK2RWQ.js";import"./chunk-ITDJLXHO.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as firstBy};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import"./curry-order-rules-BuA7D1F4.js";import"./has-at-least-6iRvhsST.js";import{firstBy as e}from"./first-by-B5IsCexF.js";export{e as firstBy};

package/dist/first.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkTXPRX236cjs = require('./chunk-TXPRX236.cjs');require('./chunk-SXNRBENP.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.first = _chunkTXPRX236cjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`),require(`./to-single-Bnq9l8Zp.cjs`);const e=require(`./first-Dbxt3OEg.cjs`);exports.first=e.first;

package/dist/first.d.cts

@@ -1,38 +1,3 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-
-type First<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`.
- *
- * @param data - The array.
- * @returns The first element of the array.
- * @signature
- *    P.first(array)
- * @example
- *    P.first([1, 2, 3]) // => 1
- *    P.first([]) // => undefined
- * @dataFirst
- * @lazy
- * @category Array
- */
-declare function first<T extends IterableContainer>(data: T): First<T>;
-/**
- * Gets the first element of `array`.
- *
- * @returns The first element of the array.
- * @signature
- *    P.first()(array)
- * @example
- *    P.pipe(
- *      [1, 2, 4, 8, 16],
- *      P.filter(x => x > 3),
- *      P.first(),
- *      x => x + 1
- *    ); // => 5
- * @dataLast
- * @lazy
- * @category Array
- */
-declare function first(): <T extends IterableContainer>(data: T) => First<T>;
-
-export { first };
+import "./iterable-container-V5sa0V_H.cjs";
+import { first } from "./first-C3rp67g0.cjs";
+export { first };

package/dist/first.d.ts

@@ -1,38 +1,3 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-
-type First<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`.
- *
- * @param data - The array.
- * @returns The first element of the array.
- * @signature
- *    P.first(array)
- * @example
- *    P.first([1, 2, 3]) // => 1
- *    P.first([]) // => undefined
- * @dataFirst
- * @lazy
- * @category Array
- */
-declare function first<T extends IterableContainer>(data: T): First<T>;
-/**
- * Gets the first element of `array`.
- *
- * @returns The first element of the array.
- * @signature
- *    P.first()(array)
- * @example
- *    P.pipe(
- *      [1, 2, 4, 8, 16],
- *      P.filter(x => x > 3),
- *      P.first(),
- *      x => x + 1
- *    ); // => 5
- * @dataLast
- * @lazy
- * @category Array
- */
-declare function first(): <T extends IterableContainer>(data: T) => First<T>;
-
-export { first };
+import "./iterable-container-wtkYslN_.js";
+import { first } from "./first-1NtfTucX.js";
+export { first };

package/dist/first.js

@@ -1 +1 @@
-import{a}from"./chunk-Z5YZYBC2.js";import"./chunk-NHTBBY2L.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as first};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import"./to-single-bHVECPzX.js";import{first as e}from"./first-DDQc8owl.js";export{e as first};

package/dist/flat-BayJJsR-.cjs

@@ -0,0 +1 @@
+const e=require(`./lazy-data-last-impl-3PAFkslW.cjs`),t=require(`./utility-evaluators-DqJcWENu.cjs`);function n(t,n){return typeof t==`object`?r(t,n):e.lazyDataLastImpl(r,t===void 0?[]:[t],i)}function r(e,t){return t===void 0?e.flat():e.flat(t)}function i(e){return e===void 0||e===1?a:e<=0?t.lazyIdentityEvaluator:t=>Array.isArray(t)?{next:t.flat(e-1),hasNext:!0,hasMany:!0,done:!1}:{next:t,hasNext:!0,done:!1}}function a(e){return Array.isArray(e)?{next:e,hasNext:!0,hasMany:!0,done:!1}:{next:e,hasNext:!0,done:!1}}Object.defineProperty(exports,`flat`,{enumerable:!0,get:function(){return n}});

package/dist/flat-BbBf5kJs.d.ts

@@ -0,0 +1,53 @@
+import { IterableContainer } from "./iterable-container-wtkYslN_.js";
+import { IsNumericLiteral } from "type-fest";
+
+//#region src/flat.d.ts
+type FlatArray<T, Depth extends number, Iteration extends ReadonlyArray<unknown> = []> = Depth extends Iteration['length'] ? T : T extends readonly [] ? [] : T extends readonly [infer Item, ...infer Rest] ? [...(Item extends IterableContainer ? FlatArray<Item, Depth, [...Iteration, unknown]> : [Item]), ...FlatArray<Rest, Depth, Iteration>] : Array<FlatSimpleArrayItems<T, Depth, Iteration>>;
+type FlatSimpleArrayItems<T, Depth extends number, Iteration extends ReadonlyArray<unknown> = [], IsDone extends boolean = false> = {
+  done: T;
+  recur: T extends ReadonlyArray<infer InnerArr> ? FlatSimpleArrayItems<InnerArr, Depth, [...Iteration, unknown], Iteration['length'] extends Depth ? true : false> : T;
+}[IsDone extends true ? 'done' : 'recur'];
+/**
+ * Creates a new array with all sub-array elements concatenated into it
+ * recursively up to the specified depth. Equivalent to the built-in
+ * `Array.prototype.flat` method.
+ *
+ * @param data - The items to flatten.
+ * @param depth - The depth level specifying how deep a nested array structure
+ * should be flattened. Defaults to 1. Non literal values (those typed as
+ * `number`cannot be used. `Infinity`, `Number.POSITIVE_INFINITY` and
+ * `Number.MAX_VALUE` are all typed as `number` and can't be used either. For
+ * "unlimited" depth use a literal value that would exceed your expected
+ * practical maximum nesting level.
+ * @signature
+ *   P.flat(data)
+ *   P.flat(data, depth)
+ * @example
+ *   P.flat([[1, 2], [3, 4], [5], [[6]]]); // => [1, 2, 3, 4, 5, [6]]
+ *   P.flat([[[1]], [[2]]], 2); // => [1, 2]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function flat<T extends IterableContainer, Depth extends number = 1>(data: T, depth?: IsNumericLiteral<Depth> extends true ? Depth : never): FlatArray<T, Depth>;
+/**
+ * Creates a new array with all sub-array elements concatenated into it
+ * recursively up to the specified depth. Equivalent to the built-in
+ * `Array.prototype.flat` method.
+ *
+ * @param depth - The depth level specifying how deep a nested array structure
+ * should be flattened. Defaults to 1.
+ * @signature
+ *   P.flat()(data)
+ *   P.flat(depth)(data)
+ * @example
+ *   P.pipe([[1, 2], [3, 4], [5], [[6]]], P.flat()); // => [1, 2, 3, 4, 5, [6]]
+ *   P.pipe([[[1]], [[2]]], P.flat(2)); // => [1, 2]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function flat<Depth extends number = 1>(depth?: IsNumericLiteral<Depth> extends true ? Depth : never): <T extends IterableContainer>(data: T) => FlatArray<T, Depth>;
+//#endregion
+export { flat };
+//# sourceMappingURL=flat-BbBf5kJs.d.ts.map

package/dist/flat-BbBf5kJs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat-BbBf5kJs.d.ts","names":[],"sources":["../src/flat.ts"],"sourcesContent":[],"mappings":";;;;KASK,qDAGe,+BAChB,cAAc,sBAEd,IACA,6BAGE,sDAKQ,aAAa,oBAEb,UAAU,MAAM,WAAW,wBAE1B,QAnBV,GAqBQ,SArBC,CAqBS,IArBT,EAqBe,KArBf,EAqBsB,SArBtB,CAAA,CAAA,GAwBN,KAxBM,CAwBA,oBAxBA,CAwBqB,CAxBrB,EAwBwB,KAxBxB,EAwB+B,SAxB/B,CAAA,CAAA;KA8BT,oBA3Be,CAAA,CAAA,EAAA,cAAA,MAAA,EAAA,kBA8BA,aA9BA,CAAA,OAAA,CAAA,GAAA,EAAA,EAAA,eAAA,OAAA,GAAA,KAAA,CAAA,GAAA;MAChB,EAgCI,CAhCJ;OAAc,EAiCT,CAjCS,SAiCC,aAjCD,CAAA,KAAA,SAAA,CAAA,GAkCZ,oBAlCY,CAmCZ,QAnCY,EAoCZ,KApCY,EAAA,CAEd,GAmCM,SAnCN,EACA,OAAA,GAqCE,SAlCA,CAAA,QAAA,CAAA,SAkC4B,KAlC5B,GAAA,IAAA,GAAA,KAAA,CAAA,GAoCA,CApCA;EAqCJ,MAhCY,SAAA,IAAA,GAAA,MAAA,GAAA,OAAA,CAAA;;;;;;;;;;;;;;;;;AASD;;;;;;AAeP,iBAgCU,IAhCV,CAAA,UAiCM,iBAjCN,EAAA,cAAA,MAAA,GAAA,CAAA,CAAA,CAAA,IAAA,EAoCE,CApCF,EAAA,KAAA,CAAA,EAqCI,gBArCJ,CAqCqB,KArCrB,CAAA,SAAA,IAAA,GAqC2C,KArC3C,GAAA,KAAA,CAAA,EAsCH,SAtCG,CAsCO,CAtCP,EAsCU,KAtCV,CAAA;;;;;;;;;AAgCN;;;;;;;;;AAMG,iBAmBa,IAnBb,CAAA,cAAA,MAAA,GAAA,CAAA,CAAA,CAAA,KAAA,CAAA,EAoBO,gBApBP,CAoBwB,KApBxB,CAAA,SAAA,IAAA,GAoB8C,KApB9C,GAAA,KAAA,CAAA,EAAA,CAAA,UAqBW,iBArBX,CAAA,CAAA,IAAA,EAqBoC,CArBpC,EAAA,GAqB0C,SArB1C,CAqBoD,CArBpD,EAqBuD,KArBvD,CAAA"}

package/dist/flat-CJrZ3ALE.d.cts

@@ -0,0 +1,53 @@
+import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
+import { IsNumericLiteral } from "type-fest";
+
+//#region src/flat.d.ts
+type FlatArray<T, Depth extends number, Iteration extends ReadonlyArray<unknown> = []> = Depth extends Iteration['length'] ? T : T extends readonly [] ? [] : T extends readonly [infer Item, ...infer Rest] ? [...(Item extends IterableContainer ? FlatArray<Item, Depth, [...Iteration, unknown]> : [Item]), ...FlatArray<Rest, Depth, Iteration>] : Array<FlatSimpleArrayItems<T, Depth, Iteration>>;
+type FlatSimpleArrayItems<T, Depth extends number, Iteration extends ReadonlyArray<unknown> = [], IsDone extends boolean = false> = {
+  done: T;
+  recur: T extends ReadonlyArray<infer InnerArr> ? FlatSimpleArrayItems<InnerArr, Depth, [...Iteration, unknown], Iteration['length'] extends Depth ? true : false> : T;
+}[IsDone extends true ? 'done' : 'recur'];
+/**
+ * Creates a new array with all sub-array elements concatenated into it
+ * recursively up to the specified depth. Equivalent to the built-in
+ * `Array.prototype.flat` method.
+ *
+ * @param data - The items to flatten.
+ * @param depth - The depth level specifying how deep a nested array structure
+ * should be flattened. Defaults to 1. Non literal values (those typed as
+ * `number`cannot be used. `Infinity`, `Number.POSITIVE_INFINITY` and
+ * `Number.MAX_VALUE` are all typed as `number` and can't be used either. For
+ * "unlimited" depth use a literal value that would exceed your expected
+ * practical maximum nesting level.
+ * @signature
+ *   P.flat(data)
+ *   P.flat(data, depth)
+ * @example
+ *   P.flat([[1, 2], [3, 4], [5], [[6]]]); // => [1, 2, 3, 4, 5, [6]]
+ *   P.flat([[[1]], [[2]]], 2); // => [1, 2]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function flat<T extends IterableContainer, Depth extends number = 1>(data: T, depth?: IsNumericLiteral<Depth> extends true ? Depth : never): FlatArray<T, Depth>;
+/**
+ * Creates a new array with all sub-array elements concatenated into it
+ * recursively up to the specified depth. Equivalent to the built-in
+ * `Array.prototype.flat` method.
+ *
+ * @param depth - The depth level specifying how deep a nested array structure
+ * should be flattened. Defaults to 1.
+ * @signature
+ *   P.flat()(data)
+ *   P.flat(depth)(data)
+ * @example
+ *   P.pipe([[1, 2], [3, 4], [5], [[6]]], P.flat()); // => [1, 2, 3, 4, 5, [6]]
+ *   P.pipe([[[1]], [[2]]], P.flat(2)); // => [1, 2]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function flat<Depth extends number = 1>(depth?: IsNumericLiteral<Depth> extends true ? Depth : never): <T extends IterableContainer>(data: T) => FlatArray<T, Depth>;
+//#endregion
+export { flat };
+//# sourceMappingURL=flat-CJrZ3ALE.d.cts.map

package/dist/flat-CJrZ3ALE.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat-CJrZ3ALE.d.cts","names":[],"sources":["../src/flat.ts"],"sourcesContent":[],"mappings":";;;;KASK,qDAGe,+BAChB,cAAc,sBAEd,IACA,6BAGE,sDAKQ,aAAa,oBAEb,UAAU,MAAM,WAAW,wBAE1B,QAnBV,GAqBQ,SArBC,CAqBS,IArBT,EAqBe,KArBf,EAqBsB,SArBtB,CAAA,CAAA,GAwBN,KAxBM,CAwBA,oBAxBA,CAwBqB,CAxBrB,EAwBwB,KAxBxB,EAwB+B,SAxB/B,CAAA,CAAA;KA8BT,oBA3Be,CAAA,CAAA,EAAA,cAAA,MAAA,EAAA,kBA8BA,aA9BA,CAAA,OAAA,CAAA,GAAA,EAAA,EAAA,eAAA,OAAA,GAAA,KAAA,CAAA,GAAA;MAChB,EAgCI,CAhCJ;OAAc,EAiCT,CAjCS,SAiCC,aAjCD,CAAA,KAAA,SAAA,CAAA,GAkCZ,oBAlCY,CAmCZ,QAnCY,EAoCZ,KApCY,EAAA,CAEd,GAmCM,SAnCN,EACA,OAAA,GAqCE,SAlCA,CAAA,QAAA,CAAA,SAkC4B,KAlC5B,GAAA,IAAA,GAAA,KAAA,CAAA,GAoCA,CApCA;EAqCJ,MAhCY,SAAA,IAAA,GAAA,MAAA,GAAA,OAAA,CAAA;;;;;;;;;;;;;;;;;AASD;;;;;;AAeP,iBAgCU,IAhCV,CAAA,UAiCM,iBAjCN,EAAA,cAAA,MAAA,GAAA,CAAA,CAAA,CAAA,IAAA,EAoCE,CApCF,EAAA,KAAA,CAAA,EAqCI,gBArCJ,CAqCqB,KArCrB,CAAA,SAAA,IAAA,GAqC2C,KArC3C,GAAA,KAAA,CAAA,EAsCH,SAtCG,CAsCO,CAtCP,EAsCU,KAtCV,CAAA;;;;;;;;;AAgCN;;;;;;;;;AAMG,iBAmBa,IAnBb,CAAA,cAAA,MAAA,GAAA,CAAA,CAAA,CAAA,KAAA,CAAA,EAoBO,gBApBP,CAoBwB,KApBxB,CAAA,SAAA,IAAA,GAoB8C,KApB9C,GAAA,KAAA,CAAA,EAAA,CAAA,UAqBW,iBArBX,CAAA,CAAA,IAAA,EAqBoC,CArBpC,EAAA,GAqB0C,SArB1C,CAqBoD,CArBpD,EAqBuD,KArBvD,CAAA"}

package/dist/flat-Cd7pIXar.js

@@ -0,0 +1,2 @@
+import{lazyDataLastImpl as e}from"./lazy-data-last-impl-7QfM1xXg.js";import{lazyIdentityEvaluator as t}from"./utility-evaluators-CnQVdcZv.js";function n(t,n){return typeof t==`object`?r(t,n):e(r,t===void 0?[]:[t],i)}function r(e,t){return t===void 0?e.flat():e.flat(t)}function i(e){return e===void 0||e===1?a:e<=0?t:t=>Array.isArray(t)?{next:t.flat(e-1),hasNext:!0,hasMany:!0,done:!1}:{next:t,hasNext:!0,done:!1}}function a(e){return Array.isArray(e)?{next:e,hasNext:!0,hasMany:!0,done:!1}:{next:e,hasNext:!0,done:!1}}export{n as flat};
+//# sourceMappingURL=flat-Cd7pIXar.js.map

package/dist/flat-Cd7pIXar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat-Cd7pIXar.js","names":[],"sources":["../src/flat.ts"],"sourcesContent":["import type { IsNumericLiteral } from 'type-fest';\n\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport type { LazyEvaluator } from './internal/types/lazy-evaluator';\nimport type { LazyResult } from './internal/types/lazy-result';\n\nimport { lazyDataLastImpl } from './internal/lazy-data-last-impl';\nimport { lazyIdentityEvaluator } from './internal/utility-evaluators';\n\ntype FlatArray<\n  T,\n  Depth extends number,\n  Iteration extends ReadonlyArray<unknown> = [],\n> = Depth extends Iteration['length']\n  // Stopping condition for the recursion when the array is a tuple.\n  ? T\n  : T extends readonly []\n    // Trivial result when the array is empty.\n    ? []\n    : T extends readonly [infer Item, ...infer Rest]\n      // Tuples could be special-cased by \"iterating\" over each item\n      // separately so that we maintain more information from the input type,\n      // instead of putting all values in a union.\n      ? [\n          ...(Item extends IterableContainer\n            // If the item itself is an array we continue going deeper\n            ? FlatArray<Item, Depth, [...Iteration, unknown]>\n            // But if it isn't we add it to the output tuple\n            : [Item]),\n          // And we merge this with the result from the rest of the tuple.\n          ...FlatArray<Rest, Depth, Iteration>,\n        ]\n      // For simple arrays we compute the item type, and wrap it with an array.\n      : Array<FlatSimpleArrayItems<T, Depth, Iteration>>;\n\n// This type is based on the built-in type for `Array.prototype.flat` from the\n// ES2019 Array typescript library, but we improved it to handle any depth\n// (avoiding the fixed `20` in the built-in type).\n// @see https://github.com/microsoft/TypeScript/blob/main/src/lib/es2019.array.d.ts#L1-L5\ntype FlatSimpleArrayItems<\n  T,\n  Depth extends number,\n  Iteration extends ReadonlyArray<unknown> = [],\n  IsDone extends boolean = false,\n> = {\n  done: T;\n  recur: T extends ReadonlyArray<infer InnerArr>\n    ? FlatSimpleArrayItems<\n      InnerArr,\n      Depth,\n      [...Iteration, unknown],\n      // This trick allows us to continue 1 iteration more than the depth,\n      // which is required to flatten the array up to depth.\n      Iteration['length'] extends Depth ? true : false\n    >\n    : T;\n}[IsDone extends true ? 'done' : 'recur'];\n\n/**\n * Creates a new array with all sub-array elements concatenated into it\n * recursively up to the specified depth. Equivalent to the built-in\n * `Array.prototype.flat` method.\n *\n * @param data - The items to flatten.\n * @param depth - The depth level specifying how deep a nested array structure\n * should be flattened. Defaults to 1. Non literal values (those typed as\n * `number`cannot be used. `Infinity`, `Number.POSITIVE_INFINITY` and\n * `Number.MAX_VALUE` are all typed as `number` and can't be used either. For\n * \"unlimited\" depth use a literal value that would exceed your expected\n * practical maximum nesting level.\n * @signature\n *   P.flat(data)\n *   P.flat(data, depth)\n * @example\n *   P.flat([[1, 2], [3, 4], [5], [[6]]]); // => [1, 2, 3, 4, 5, [6]]\n *   P.flat([[[1]], [[2]]], 2); // => [1, 2]\n * @dataFirst\n * @lazy\n * @category Array\n */\nexport function flat<\n  T extends IterableContainer,\n  Depth extends number = 1,\n>(\n  data: T,\n  depth?: IsNumericLiteral<Depth> extends true ? Depth : never,\n): FlatArray<T, Depth>;\n\n/**\n * Creates a new array with all sub-array elements concatenated into it\n * recursively up to the specified depth. Equivalent to the built-in\n * `Array.prototype.flat` method.\n *\n * @param depth - The depth level specifying how deep a nested array structure\n * should be flattened. Defaults to 1.\n * @signature\n *   P.flat()(data)\n *   P.flat(depth)(data)\n * @example\n *   P.pipe([[1, 2], [3, 4], [5], [[6]]], P.flat()); // => [1, 2, 3, 4, 5, [6]]\n *   P.pipe([[[1]], [[2]]], P.flat(2)); // => [1, 2]\n * @dataLast\n * @lazy\n * @category Array\n */\nexport function flat<Depth extends number = 1>(\n  depth?: IsNumericLiteral<Depth> extends true ? Depth : never,\n): <T extends IterableContainer>(data: T) => FlatArray<T, Depth>;\n\nexport function flat(\n  dataOrDepth?: IterableContainer | number,\n  depth?: number,\n): unknown {\n  if (typeof dataOrDepth === 'object') {\n    return flatImplementation(dataOrDepth, depth);\n  }\n\n  return lazyDataLastImpl(\n    flatImplementation,\n    dataOrDepth === undefined ? [] : [dataOrDepth],\n    lazyImplementation,\n  );\n}\n\nfunction flatImplementation(\n  data: IterableContainer,\n  depth?: number,\n): IterableContainer {\n  return (depth === undefined ? data.flat() : data.flat(depth));\n};\n\nfunction lazyImplementation(depth?: number): LazyEvaluator {\n  if (depth === undefined || depth === 1) {\n    return lazyShallow;\n  }\n\n  if (depth <= 0) {\n    return lazyIdentityEvaluator;\n  }\n\n  return (value) =>\n    Array.isArray(value)\n      ? {\n          next: value.flat(depth - 1),\n          hasNext: true,\n          hasMany: true,\n          done: false,\n        }\n      : { next: value, hasNext: true, done: false }; ;\n}\n\n/**\n * This function is pulled out so that we don't generate a new function\n * each time. Because it doesn't need to run with recursion it could be pulled\n * out from the lazyImplementation and be reused for all invocations.\n */\nfunction lazyShallow<T>(value: T): LazyResult<T> {\n  return Array.isArray(value)\n    ? { next: value, hasNext: true, hasMany: true, done: false }\n    : { next: value, hasNext: true, done: false };\n}\n"],"mappings":"8IA6GA,SAAgB,EACd,EACA,EACS,CAKT,OAJI,OAAO,GAAgB,SAClB,EAAmB,EAAa,EAAM,CAGxC,EACL,EACA,IAAgB,IAAA,GAAY,EAAE,CAAG,CAAC,EAAY,CAC9C,EACD,CAGH,SAAS,EACP,EACA,EACmB,CACnB,OAAQ,IAAU,IAAA,GAAY,EAAK,MAAM,CAAG,EAAK,KAAK,EAAM,CAG9D,SAAS,EAAmB,EAA+B,CASzD,OARI,IAAU,IAAA,IAAa,IAAU,EAC5B,EAGL,GAAS,EACJ,EAGD,GACN,MAAM,QAAQ,EAAM,CAChB,CACE,KAAM,EAAM,KAAK,EAAQ,EAAE,CAC3B,QAAS,GACT,QAAS,GACT,KAAM,GACP,CACD,CAAE,KAAM,EAAO,QAAS,GAAM,KAAM,GAAO,CAQnD,SAAS,EAAe,EAAyB,CAC/C,OAAO,MAAM,QAAQ,EAAM,CACvB,CAAE,KAAM,EAAO,QAAS,GAAM,QAAS,GAAM,KAAM,GAAO,CAC1D,CAAE,KAAM,EAAO,QAAS,GAAM,KAAM,GAAO"}

package/dist/flat-map-1WAgW39N.js

@@ -0,0 +1,2 @@
+import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t,r)}function n(e,t){return e.flatMap(t)}function r(e){return(t,n,r)=>{let i=e(t,n,r);return Array.isArray(i)?{done:!1,hasNext:!0,hasMany:!0,next:i}:{done:!1,hasNext:!0,next:i}}}export{t as flatMap};
+//# sourceMappingURL=flat-map-1WAgW39N.js.map

package/dist/flat-map-1WAgW39N.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat-map-1WAgW39N.js","names":[],"sources":["../src/flat-map.ts"],"sourcesContent":["import type { LazyEvaluator } from './internal/types/lazy-evaluator';\n\nimport { curry } from './curry';\n\n/**\n * Returns a new array formed by applying a given callback function to each\n * element of the array, and then flattening the result by one level. It is\n * identical to a `map` followed by a `flat` of depth 1\n * (`flat(map(data, ...args))`), but slightly more efficient than calling those\n * two methods separately. Equivalent to `Array.prototype.flatMap`.\n *\n * @param data - The items to map and flatten.\n * @param callbackfn - A function to execute for each element in the array. It\n * should return an array containing new elements of the new array, or a single\n * non-array value to be added to the new array.\n * @returns A new array with each element being the result of the callback\n * function and flattened by a depth of 1.\n * @signature\n *    P.flatMap(data, callbackfn)\n * @example\n *    P.flatMap([1, 2, 3], x => [x, x * 10]) // => [1, 10, 2, 20, 3, 30]\n * @dataFirst\n * @lazy\n * @category Array\n */\nexport function flatMap<T, U>(\n  data: ReadonlyArray<T>,\n  callbackfn: (\n    input: T,\n    index: number,\n    data: ReadonlyArray<T>,\n  ) => ReadonlyArray<U> | U,\n): Array<U>;\n\n/**\n * Returns a new array formed by applying a given callback function to each\n * element of the array, and then flattening the result by one level. It is\n * identical to a `map` followed by a `flat` of depth 1\n * (`flat(map(data, ...args))`), but slightly more efficient than calling those\n * two methods separately. Equivalent to `Array.prototype.flatMap`.\n *\n * @param callbackfn - A function to execute for each element in the array. It\n * should return an array containing new elements of the new array, or a single\n * non-array value to be added to the new array.\n * @returns A new array with each element being the result of the callback\n * function and flattened by a depth of 1.\n * @signature\n *    P.flatMap(callbackfn)(data)\n * @example\n *    P.pipe([1, 2, 3], P.flatMap(x => [x, x * 10])) // => [1, 10, 2, 20, 3, 30]\n * @dataLast\n * @lazy\n * @category Array\n */\nexport function flatMap<T, U>(\n  callbackfn: (\n    input: T,\n    index: number,\n    data: ReadonlyArray<T>,\n  ) => ReadonlyArray<U> | U,\n): (data: ReadonlyArray<T>) => Array<U>;\n\nexport function flatMap(...args: ReadonlyArray<unknown>): unknown {\n  return curry(flatMapImplementation, args, lazyImplementation);\n}\n\nfunction flatMapImplementation<T, U>(\n  data: ReadonlyArray<T>,\n  callbackfn: (\n    value: T,\n    index: number,\n    data: ReadonlyArray<T>,\n  ) => ReadonlyArray<U> | U,\n): Array<U> {\n  return data.flatMap(callbackfn);\n}\n\nfunction lazyImplementation<T, K>(\n  callbackfn: (\n    input: T,\n    index: number,\n    data: ReadonlyArray<T>,\n  ) => K | ReadonlyArray<K>,\n): LazyEvaluator<T, K> {\n  // @ts-expect-error [ts2322] - We need to make LazyMany better so it accommodate the typing here...\n  return (value, index, data) => {\n    const next = callbackfn(value, index, data);\n    return Array.isArray(next)\n      ? { done: false, hasNext: true, hasMany: true, next }\n      : { done: false, hasNext: true, next };\n  };\n}\n"],"mappings":"4CA8DA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAM,EAAmB,CAG/D,SAAS,EACP,EACA,EAKU,CACV,OAAO,EAAK,QAAQ,EAAW,CAGjC,SAAS,EACP,EAKqB,CAErB,OAAQ,EAAO,EAAO,IAAS,CAC7B,IAAM,EAAO,EAAW,EAAO,EAAO,EAAK,CAC3C,OAAO,MAAM,QAAQ,EAAK,CACtB,CAAE,KAAM,GAAO,QAAS,GAAM,QAAS,GAAM,OAAM,CACnD,CAAE,KAAM,GAAO,QAAS,GAAM,OAAM"}

package/dist/flat-map-BI-sJd2B.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-BPVIsvo3.cjs`);function t(...t){return e.curry(n,t,r)}function n(e,t){return e.flatMap(t)}function r(e){return(t,n,r)=>{let i=e(t,n,r);return Array.isArray(i)?{done:!1,hasNext:!0,hasMany:!0,next:i}:{done:!1,hasNext:!0,next:i}}}Object.defineProperty(exports,`flatMap`,{enumerable:!0,get:function(){return t}});

package/dist/flat-map-Do5YLueq.d.cts

@@ -0,0 +1,47 @@
+//#region src/flat-map.d.ts
+/**
+ * Returns a new array formed by applying a given callback function to each
+ * element of the array, and then flattening the result by one level. It is
+ * identical to a `map` followed by a `flat` of depth 1
+ * (`flat(map(data, ...args))`), but slightly more efficient than calling those
+ * two methods separately. Equivalent to `Array.prototype.flatMap`.
+ *
+ * @param data - The items to map and flatten.
+ * @param callbackfn - A function to execute for each element in the array. It
+ * should return an array containing new elements of the new array, or a single
+ * non-array value to be added to the new array.
+ * @returns A new array with each element being the result of the callback
+ * function and flattened by a depth of 1.
+ * @signature
+ *    P.flatMap(data, callbackfn)
+ * @example
+ *    P.flatMap([1, 2, 3], x => [x, x * 10]) // => [1, 10, 2, 20, 3, 30]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function flatMap<T, U>(data: ReadonlyArray<T>, callbackfn: (input: T, index: number, data: ReadonlyArray<T>) => ReadonlyArray<U> | U): Array<U>;
+/**
+ * Returns a new array formed by applying a given callback function to each
+ * element of the array, and then flattening the result by one level. It is
+ * identical to a `map` followed by a `flat` of depth 1
+ * (`flat(map(data, ...args))`), but slightly more efficient than calling those
+ * two methods separately. Equivalent to `Array.prototype.flatMap`.
+ *
+ * @param callbackfn - A function to execute for each element in the array. It
+ * should return an array containing new elements of the new array, or a single
+ * non-array value to be added to the new array.
+ * @returns A new array with each element being the result of the callback
+ * function and flattened by a depth of 1.
+ * @signature
+ *    P.flatMap(callbackfn)(data)
+ * @example
+ *    P.pipe([1, 2, 3], P.flatMap(x => [x, x * 10])) // => [1, 10, 2, 20, 3, 30]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function flatMap<T, U>(callbackfn: (input: T, index: number, data: ReadonlyArray<T>) => ReadonlyArray<U> | U): (data: ReadonlyArray<T>) => Array<U>;
+//#endregion
+export { flatMap };
+//# sourceMappingURL=flat-map-Do5YLueq.d.cts.map

package/dist/flat-map-Do5YLueq.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat-map-Do5YLueq.d.cts","names":[],"sources":["../src/flat-map.ts"],"sourcesContent":[],"mappings":";;AAyBA;;;;;;;;;;;;;AA6BA;;;;;;;AAK0B,iBAlCV,OAkCU,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAjClB,aAiCkB,CAjCJ,CAiCI,CAAA,EAAA,UAAA,EAAA,CAAA,KAAA,EA/Bf,CA+Be,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EA7BhB,aA6BgB,CA7BF,CA6BE,CAAA,EAAA,GA5BnB,aA4BmB,CA5BL,CA4BK,CAAA,GA5BA,CA4BA,CAAA,EA3BvB,KA2BuB,CA3BjB,CA2BiB,CAAA;;;;;;;;;;;;;;;;;;;;;iBALV,kCAEL,wBAED,cAAc,OACjB,cAAc,KAAK,WAChB,cAAc,OAAO,MAAM"}

package/dist/flat-map-Ok5sZOb2.d.ts

@@ -0,0 +1,47 @@
+//#region src/flat-map.d.ts
+/**
+ * Returns a new array formed by applying a given callback function to each
+ * element of the array, and then flattening the result by one level. It is
+ * identical to a `map` followed by a `flat` of depth 1
+ * (`flat(map(data, ...args))`), but slightly more efficient than calling those
+ * two methods separately. Equivalent to `Array.prototype.flatMap`.
+ *
+ * @param data - The items to map and flatten.
+ * @param callbackfn - A function to execute for each element in the array. It
+ * should return an array containing new elements of the new array, or a single
+ * non-array value to be added to the new array.
+ * @returns A new array with each element being the result of the callback
+ * function and flattened by a depth of 1.
+ * @signature
+ *    P.flatMap(data, callbackfn)
+ * @example
+ *    P.flatMap([1, 2, 3], x => [x, x * 10]) // => [1, 10, 2, 20, 3, 30]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function flatMap<T, U>(data: ReadonlyArray<T>, callbackfn: (input: T, index: number, data: ReadonlyArray<T>) => ReadonlyArray<U> | U): Array<U>;
+/**
+ * Returns a new array formed by applying a given callback function to each
+ * element of the array, and then flattening the result by one level. It is
+ * identical to a `map` followed by a `flat` of depth 1
+ * (`flat(map(data, ...args))`), but slightly more efficient than calling those
+ * two methods separately. Equivalent to `Array.prototype.flatMap`.
+ *
+ * @param callbackfn - A function to execute for each element in the array. It
+ * should return an array containing new elements of the new array, or a single
+ * non-array value to be added to the new array.
+ * @returns A new array with each element being the result of the callback
+ * function and flattened by a depth of 1.
+ * @signature
+ *    P.flatMap(callbackfn)(data)
+ * @example
+ *    P.pipe([1, 2, 3], P.flatMap(x => [x, x * 10])) // => [1, 10, 2, 20, 3, 30]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function flatMap<T, U>(callbackfn: (input: T, index: number, data: ReadonlyArray<T>) => ReadonlyArray<U> | U): (data: ReadonlyArray<T>) => Array<U>;
+//#endregion
+export { flatMap };
+//# sourceMappingURL=flat-map-Ok5sZOb2.d.ts.map

package/dist/flat-map-Ok5sZOb2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flat-map-Ok5sZOb2.d.ts","names":[],"sources":["../src/flat-map.ts"],"sourcesContent":[],"mappings":";;AAyBA;;;;;;;;;;;;;AA6BA;;;;;;;AAK0B,iBAlCV,OAkCU,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAjClB,aAiCkB,CAjCJ,CAiCI,CAAA,EAAA,UAAA,EAAA,CAAA,KAAA,EA/Bf,CA+Be,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EA7BhB,aA6BgB,CA7BF,CA6BE,CAAA,EAAA,GA5BnB,aA4BmB,CA5BL,CA4BK,CAAA,GA5BA,CA4BA,CAAA,EA3BvB,KA2BuB,CA3BjB,CA2BiB,CAAA;;;;;;;;;;;;;;;;;;;;;iBALV,kCAEL,wBAED,cAAc,OACjB,cAAc,KAAK,WAChB,cAAc,OAAO,MAAM"}

package/dist/flat-map.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkH45R7G32cjs = require('./chunk-H45R7G32.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.flatMap = _chunkH45R7G32cjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./flat-map-BI-sJd2B.cjs`);exports.flatMap=e.flatMap;

package/dist/flat-map.d.cts

@@ -1,45 +1,2 @@
-/**
- * Returns a new array formed by applying a given callback function to each
- * element of the array, and then flattening the result by one level. It is
- * identical to a `map` followed by a `flat` of depth 1
- * (`flat(map(data, ...args))`), but slightly more efficient than calling those
- * two methods separately. Equivalent to `Array.prototype.flatMap`.
- *
- * @param data - The items to map and flatten.
- * @param callbackfn - A function to execute for each element in the array. It
- * should return an array containing new elements of the new array, or a single
- * non-array value to be added to the new array.
- * @returns A new array with each element being the result of the callback
- * function and flattened by a depth of 1.
- * @signature
- *    P.flatMap(data, callbackfn)
- * @example
- *    P.flatMap([1, 2, 3], x => [x, x * 10]) // => [1, 10, 2, 20, 3, 30]
- * @dataFirst
- * @lazy
- * @category Array
- */
-declare function flatMap<T, U>(data: ReadonlyArray<T>, callbackfn: (input: T, index: number, data: ReadonlyArray<T>) => ReadonlyArray<U> | U): Array<U>;
-/**
- * Returns a new array formed by applying a given callback function to each
- * element of the array, and then flattening the result by one level. It is
- * identical to a `map` followed by a `flat` of depth 1
- * (`flat(map(data, ...args))`), but slightly more efficient than calling those
- * two methods separately. Equivalent to `Array.prototype.flatMap`.
- *
- * @param callbackfn - A function to execute for each element in the array. It
- * should return an array containing new elements of the new array, or a single
- * non-array value to be added to the new array.
- * @returns A new array with each element being the result of the callback
- * function and flattened by a depth of 1.
- * @signature
- *    P.flatMap(callbackfn)(data)
- * @example
- *    P.pipe([1, 2, 3], P.flatMap(x => [x, x * 10])) // => [1, 10, 2, 20, 3, 30]
- * @dataLast
- * @lazy
- * @category Array
- */
-declare function flatMap<T, U>(callbackfn: (input: T, index: number, data: ReadonlyArray<T>) => ReadonlyArray<U> | U): (data: ReadonlyArray<T>) => Array<U>;
-
-export { flatMap };
+import { flatMap } from "./flat-map-Do5YLueq.cjs";
+export { flatMap };