@vinicunca/perkakas 1.9.0 → 1.12.0

package/dist/pick-by.d.cts

@@ -1,6 +1,68 @@
-import "./is-bounded-record-kpsb1wQA.cjs";
-import "./to-string-gK5yUyfp.cjs";
-import "./enumerable-string-key-of-D2OpyD6n.cjs";
-import "./enumerable-string-keyed-value-of-aov5dXss.cjs";
-import { pickBy } from "./pick-by-WPJjBk-W.cjs";
-export { pickBy };
+import { t as IsBoundedRecord } from "./is-bounded-record-D9YK_OC8.cjs";
+import { t as ToString } from "./to-string-Se4KcQka.cjs";
+import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-FUg082M_.cjs";
+import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-CEclDoqe.cjs";
+import { IsNever, Simplify } from "type-fest";
+
+//#region src/pick-by.d.ts
+type EnumeratedPartial<T> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? { -readonly [P in keyof T as ToString<P>]?: Required<T>[P] } : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>> : never;
+type EnumeratedPartialNarrowed<T, S> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? ExactProps<T, S> & PartialProps<T, S> : Record<EnumerableStringKeyOf<T>, Extract<EnumerableStringKeyedValueOf<T>, S>>> : never;
+type ExactProps<T, S> = { -readonly [P in keyof T as ToString<IsExactProp<T, P, S> extends true ? P : never>]: Extract<Required<T>[P], S> };
+type PartialProps<T, S> = { -readonly [P in keyof T as ToString<IsPartialProp<T, P, S> extends true ? P : never>]?: IsNever<Extract<T[P], S>> extends true ? S extends T[P] ? S : never : Extract<T[P], S> };
+type IsExactProp<T, P$1 extends keyof T, S> = T[P$1] extends Extract<T[P$1], S> ? true : false;
+type IsPartialProp<T, P$1 extends keyof T, S> = IsExactProp<T, P$1, S> extends true ? false : IsNever<Extract<T[P$1], S>> extends true ? S extends T[P$1] ? true : false : true;
+/**
+ * Iterates over the entries of `data` and reconstructs the object using only
+ * entries that `predicate` accepts. Symbol keys are not passed to the predicate
+ * and would be filtered out from the output object.
+ *
+ * See `omitBy` for a complementary function which starts with a shallow copy of
+ * the input object and removes the entries that the predicate rejects. Because
+ * it is subtractive symbol keys would be copied over to the output object.
+ * See also `entries`, `filter`, and `fromEntries` which could be used to build
+ * your own version of `pickBy` if you need more control (though the resulting
+ * type might be less precise).
+ *
+ * @param data - The target object.
+ * @param predicate - A function that takes the value, key, and the data itself
+ * and returns true if the entry should be part of the output object, or `false`
+ * to remove it. If the function is a type-guard on the value the output type
+ * would be narrowed accordingly.
+ * @returns A shallow copy of the input object with the rejected entries
+ * removed.
+ * @signature P.pickBy(data, predicate)
+ * @example
+ *    P.pickBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {A: 3, B: 4}
+ * @dataFirst
+ * @category Object
+ */
+declare function pickBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): EnumeratedPartialNarrowed<T, S>;
+declare function pickBy<T extends object>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): EnumeratedPartial<T>;
+/**
+ * Iterates over the entries of `data` and reconstructs the object using only
+ * entries that `predicate` accepts. Symbol keys are not passed to the predicate
+ * and would be filtered out from the output object.
+ *
+ * See `omitBy` for a complementary function which starts with a shallow copy of
+ * the input object and removes the entries that the predicate rejects. Because
+ * it is subtractive symbol keys would be copied over to the output object.
+ * See also `entries`, `filter`, and `fromEntries` which could be used to build
+ * your own version of `pickBy` if you need more control (though the resulting
+ * type might be less precise).
+ *
+ * @param predicate - A function that takes the value, key, and the data itself
+ * and returns true if the entry should be part of the output object, or `false`
+ * to remove it. If the function is a type-guard on the value the output type
+ * would be narrowed accordingly.
+ * @signature
+ *   P.pickBy(predicate)(data)
+ * @example
+ *    P.pipe({a: 1, b: 2, A: 3, B: 4}, pickBy((val, key) => key.toUpperCase() === key)); // => {A: 3, B: 4}
+ * @dataLast
+ * @category Object
+ */
+declare function pickBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): (data: T) => EnumeratedPartialNarrowed<T, S>;
+declare function pickBy<T extends object>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): (data: T) => EnumeratedPartial<T>;
+//#endregion
+export { pickBy };
+//# sourceMappingURL=pick-by.d.cts.map

package/dist/pick-by.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick-by.d.cts","names":[],"sources":["../src/pick-by.ts"],"sourcesContent":[],"mappings":";;;;;;;KAUK,uBAAuB,oBACxB,SACE,gBAAgB,0CAGY,KAAK,SAAS,MAAM,SAAS,GAAG,IAXP,GAmBjD,MAbL,CAaY,qBAbK,CAaiB,CAbjB,CAAA,EAaqB,4BAbrB,CAakD,CAblD,CAAA,CAAA,CAAA,GAAA,KAAA;KA2BjB,yBA3BuB,CAAA,CAAA,EAAA,CAAA,CAAA,GA2BW,CA3BX,SAAA,OAAA,GA4BxB,QA5BwB,CA6BtB,eA7BsB,CA6BN,CA7BM,CAAA,SAAA,IAAA,GA8BlB,UA9BkB,CA8BP,CA9BO,EA8BJ,CA9BI,CAAA,GA8BC,YA9BD,CA8Bc,CA9Bd,EA8BiB,CA9BjB,CAAA,GAmClB,MAnCkB,CAoChB,qBApCgB,CAoCM,CApCN,CAAA,EAqChB,OArCgB,CAqCR,4BArCQ,CAqCqB,CArCrB,CAAA,EAqCyB,CArCzB,CAAA,CAAA,CAAA,GAAA,KAAA;KA2CvB,UAzCiB,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAhB,MA2CkB,CA3ClB,IA2CuB,QA3CvB,CA4CF,WA5CE,CA4CU,CA5CV,EA4Ca,CA5Cb,EA4CgB,CA5ChB,CAAA,SAAA,IAAA,GA4CkC,CA5ClC,GAAA,KAAA,CAAA,GA6CA,OA7CA,CA6CQ,QA7CR,CA6CiB,CA7CjB,CAAA,CA6CoB,CA7CpB,CAAA,EA6CwB,CA7CxB,CAAA,EAG4B;KA+C7B,YA/C2C,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAT,MAiDf,CAjDe,IAiDV,QAjDU,CAkDnC,aAlDmC,CAkDrB,CAlDqB,EAkDlB,CAlDkB,EAkDf,CAlDe,CAAA,SAAA,IAAA,GAkDG,CAlDH,GAAA,KAAA,CAAA,IAmDhC,OAnDgC,CAmDxB,OAnDwB,CAmDhB,CAnDgB,CAmDd,CAnDc,CAAA,EAmDV,CAnDU,CAAA,CAAA,SAAA,IAAA,GAyDjC,CAzDiC,SAyDvB,CAzDuB,CAyDrB,CAzDqB,CAAA,GA0D/B,CA1D+B,GAAA,KAAA,GA4DjC,OA5DiC,CA4DzB,CA5DyB,CA4DvB,CA5DuB,CAAA,EA4DnB,CA5DmB,CAAA,EAAwB;KAkE1D,WAlEiD,CAAA,CAAA,EAAA,YAAA,MAkElB,CAlEkB,EAAA,CAAA,CAAA,GAmElD,CAnEkD,CAmEhD,GAnEgD,CAAA,SAmErC,OAnEqC,CAmE7B,CAnE6B,CAmE3B,GAnE2B,CAAA,EAmEvB,CAnEuB,CAAA,GAAA,IAAA,GAAA,KAAA;KA0EjD,aA1E6D,CAAA,CAAA,EAAA,YAAA,MA0E5B,CA1E4B,EAAA,CAAA,CAAA,GA2E9D,WA3E8D,CA2ElD,CA3EkD,EA2E/C,GA3E+C,EA2E5C,CA3E4C,CAAA,SAAA,IAAA,GAAA,KAAA,GA6E5D,OA7E4D,CA6EpD,OA7EoD,CA6E5C,CA7E4C,CA6E1C,GA7E0C,CAAA,EA6EtC,CA7EsC,CAAA,CAAA,SAAA,IAAA,GA8E1D,CA9E0D,SA8EhD,CA9EgD,CA8E9C,GA9E8C,CAAA,GAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;AAJtD;;;;;;;;;;;;;;;;;;AA2BA,iBA0FI,MA1FJ,CAAA,UAAA,MAAA,EAAA,UA4FA,4BA5FA,CA4F6B,CA5F7B,CAAA,CAAA,CAAA,IAAA,EA8FJ,CA9FI,EAAA,SAAA,EAAA,CAAA,KAAA,EAgGD,4BAhGC,CAgG4B,CAhG5B,CAAA,EAAA,GAAA,EAiGH,qBAjGG,CAiGmB,CAjGnB,CAAA,EAAA,IAAA,EAkGF,CAlGE,EAAA,GAAA,KAAA,IAmGI,CAnGJ,CAAA,EAoGT,yBApGS,CAoGiB,CApGjB,EAoGoB,CApGpB,CAAA;AAeP,iBAsFW,MAtFD,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAuFP,CAvFO,EAAA,SAAA,EAAA,CAAA,KAAA,EAyFJ,4BAzFI,CAyFyB,CAzFzB,CAAA,EAAA,GAAA,EA0FN,qBA1FM,CA0FgB,CA1FhB,CAAA,EAAA,IAAA,EA2FL,CA3FK,EAAA,GAAA,OAAA,CAAA,EA6FZ,iBA7FY,CA6FM,CA7FN,CAAA;;;;;;;;;;;;;;AAIF;;;;;;;;;;AASgB,iBAyGb,MAzGa,CAAA,UAAA,MAAA,EAAA,UA2GjB,4BA3GiB,CA2GY,CA3GZ,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EA8GlB,4BA9GkB,CA8GW,CA9GX,CAAA,EAAA,GAAA,EA+GpB,qBA/GoB,CA+GE,CA/GF,CAAA,EAAA,IAAA,EAgHnB,CAhHmB,EAAA,GAAA,KAAA,IAiHb,CAjHa,CAAA,EAAA,CAAA,IAAA,EAkHnB,CAlHmB,EAAA,GAkHb,yBAlHa,CAkHa,CAlHb,EAkHgB,CAlHhB,CAAA;AAAd,iBAmHC,MAnHD,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAqHJ,4BArHI,CAqHyB,CArHzB,CAAA,EAAA,GAAA,EAsHN,qBAtHM,CAsHgB,CAtHhB,CAAA,EAAA,IAAA,EAuHL,CAvHK,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EAyHL,CAzHK,EAAA,GAyHC,iBAzHD,CAyHmB,CAzHnB,CAAA"}

package/dist/pick-by.d.ts

@@ -1,6 +1,68 @@
-import "./is-bounded-record-DEQ2a3_Y.js";
-import "./to-string-B9YWszXY.js";
-import "./enumerable-string-key-of-nnI9DYHk.js";
-import "./enumerable-string-keyed-value-of-D0kMm_yz.js";
-import { pickBy } from "./pick-by-BuU3hu7X.js";
-export { pickBy };
+import { t as IsBoundedRecord } from "./is-bounded-record-BGclJjRX.js";
+import { t as ToString } from "./to-string-C6_OnZ6e.js";
+import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-DMAkBhMk.js";
+import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-B2F2aTB7.js";
+import { IsNever, Simplify } from "type-fest";
+
+//#region src/pick-by.d.ts
+type EnumeratedPartial<T> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? { -readonly [P in keyof T as ToString<P>]?: Required<T>[P] } : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>> : never;
+type EnumeratedPartialNarrowed<T, S> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? ExactProps<T, S> & PartialProps<T, S> : Record<EnumerableStringKeyOf<T>, Extract<EnumerableStringKeyedValueOf<T>, S>>> : never;
+type ExactProps<T, S> = { -readonly [P in keyof T as ToString<IsExactProp<T, P, S> extends true ? P : never>]: Extract<Required<T>[P], S> };
+type PartialProps<T, S> = { -readonly [P in keyof T as ToString<IsPartialProp<T, P, S> extends true ? P : never>]?: IsNever<Extract<T[P], S>> extends true ? S extends T[P] ? S : never : Extract<T[P], S> };
+type IsExactProp<T, P$1 extends keyof T, S> = T[P$1] extends Extract<T[P$1], S> ? true : false;
+type IsPartialProp<T, P$1 extends keyof T, S> = IsExactProp<T, P$1, S> extends true ? false : IsNever<Extract<T[P$1], S>> extends true ? S extends T[P$1] ? true : false : true;
+/**
+ * Iterates over the entries of `data` and reconstructs the object using only
+ * entries that `predicate` accepts. Symbol keys are not passed to the predicate
+ * and would be filtered out from the output object.
+ *
+ * See `omitBy` for a complementary function which starts with a shallow copy of
+ * the input object and removes the entries that the predicate rejects. Because
+ * it is subtractive symbol keys would be copied over to the output object.
+ * See also `entries`, `filter`, and `fromEntries` which could be used to build
+ * your own version of `pickBy` if you need more control (though the resulting
+ * type might be less precise).
+ *
+ * @param data - The target object.
+ * @param predicate - A function that takes the value, key, and the data itself
+ * and returns true if the entry should be part of the output object, or `false`
+ * to remove it. If the function is a type-guard on the value the output type
+ * would be narrowed accordingly.
+ * @returns A shallow copy of the input object with the rejected entries
+ * removed.
+ * @signature P.pickBy(data, predicate)
+ * @example
+ *    P.pickBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {A: 3, B: 4}
+ * @dataFirst
+ * @category Object
+ */
+declare function pickBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): EnumeratedPartialNarrowed<T, S>;
+declare function pickBy<T extends object>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): EnumeratedPartial<T>;
+/**
+ * Iterates over the entries of `data` and reconstructs the object using only
+ * entries that `predicate` accepts. Symbol keys are not passed to the predicate
+ * and would be filtered out from the output object.
+ *
+ * See `omitBy` for a complementary function which starts with a shallow copy of
+ * the input object and removes the entries that the predicate rejects. Because
+ * it is subtractive symbol keys would be copied over to the output object.
+ * See also `entries`, `filter`, and `fromEntries` which could be used to build
+ * your own version of `pickBy` if you need more control (though the resulting
+ * type might be less precise).
+ *
+ * @param predicate - A function that takes the value, key, and the data itself
+ * and returns true if the entry should be part of the output object, or `false`
+ * to remove it. If the function is a type-guard on the value the output type
+ * would be narrowed accordingly.
+ * @signature
+ *   P.pickBy(predicate)(data)
+ * @example
+ *    P.pipe({a: 1, b: 2, A: 3, B: 4}, pickBy((val, key) => key.toUpperCase() === key)); // => {A: 3, B: 4}
+ * @dataLast
+ * @category Object
+ */
+declare function pickBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): (data: T) => EnumeratedPartialNarrowed<T, S>;
+declare function pickBy<T extends object>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): (data: T) => EnumeratedPartial<T>;
+//#endregion
+export { pickBy };
+//# sourceMappingURL=pick-by.d.ts.map

package/dist/pick-by.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick-by.d.ts","names":[],"sources":["../src/pick-by.ts"],"sourcesContent":[],"mappings":";;;;;;;KAUK,uBAAuB,oBACxB,SACE,gBAAgB,0CAGY,KAAK,SAAS,MAAM,SAAS,GAAG,IAXP,GAmBjD,MAbL,CAaY,qBAbK,CAaiB,CAbjB,CAAA,EAaqB,4BAbrB,CAakD,CAblD,CAAA,CAAA,CAAA,GAAA,KAAA;KA2BjB,yBA3BuB,CAAA,CAAA,EAAA,CAAA,CAAA,GA2BW,CA3BX,SAAA,OAAA,GA4BxB,QA5BwB,CA6BtB,eA7BsB,CA6BN,CA7BM,CAAA,SAAA,IAAA,GA8BlB,UA9BkB,CA8BP,CA9BO,EA8BJ,CA9BI,CAAA,GA8BC,YA9BD,CA8Bc,CA9Bd,EA8BiB,CA9BjB,CAAA,GAmClB,MAnCkB,CAoChB,qBApCgB,CAoCM,CApCN,CAAA,EAqChB,OArCgB,CAqCR,4BArCQ,CAqCqB,CArCrB,CAAA,EAqCyB,CArCzB,CAAA,CAAA,CAAA,GAAA,KAAA;KA2CvB,UAzCiB,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAhB,MA2CkB,CA3ClB,IA2CuB,QA3CvB,CA4CF,WA5CE,CA4CU,CA5CV,EA4Ca,CA5Cb,EA4CgB,CA5ChB,CAAA,SAAA,IAAA,GA4CkC,CA5ClC,GAAA,KAAA,CAAA,GA6CA,OA7CA,CA6CQ,QA7CR,CA6CiB,CA7CjB,CAAA,CA6CoB,CA7CpB,CAAA,EA6CwB,CA7CxB,CAAA,EAG4B;KA+C7B,YA/C2C,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAT,MAiDf,CAjDe,IAiDV,QAjDU,CAkDnC,aAlDmC,CAkDrB,CAlDqB,EAkDlB,CAlDkB,EAkDf,CAlDe,CAAA,SAAA,IAAA,GAkDG,CAlDH,GAAA,KAAA,CAAA,IAmDhC,OAnDgC,CAmDxB,OAnDwB,CAmDhB,CAnDgB,CAmDd,CAnDc,CAAA,EAmDV,CAnDU,CAAA,CAAA,SAAA,IAAA,GAyDjC,CAzDiC,SAyDvB,CAzDuB,CAyDrB,CAzDqB,CAAA,GA0D/B,CA1D+B,GAAA,KAAA,GA4DjC,OA5DiC,CA4DzB,CA5DyB,CA4DvB,CA5DuB,CAAA,EA4DnB,CA5DmB,CAAA,EAAwB;KAkE1D,WAlEiD,CAAA,CAAA,EAAA,YAAA,MAkElB,CAlEkB,EAAA,CAAA,CAAA,GAmElD,CAnEkD,CAmEhD,GAnEgD,CAAA,SAmErC,OAnEqC,CAmE7B,CAnE6B,CAmE3B,GAnE2B,CAAA,EAmEvB,CAnEuB,CAAA,GAAA,IAAA,GAAA,KAAA;KA0EjD,aA1E6D,CAAA,CAAA,EAAA,YAAA,MA0E5B,CA1E4B,EAAA,CAAA,CAAA,GA2E9D,WA3E8D,CA2ElD,CA3EkD,EA2E/C,GA3E+C,EA2E5C,CA3E4C,CAAA,SAAA,IAAA,GAAA,KAAA,GA6E5D,OA7E4D,CA6EpD,OA7EoD,CA6E5C,CA7E4C,CA6E1C,GA7E0C,CAAA,EA6EtC,CA7EsC,CAAA,CAAA,SAAA,IAAA,GA8E1D,CA9E0D,SA8EhD,CA9EgD,CA8E9C,GA9E8C,CAAA,GAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;AAJtD;;;;;;;;;;;;;;;;;;AA2BA,iBA0FI,MA1FJ,CAAA,UAAA,MAAA,EAAA,UA4FA,4BA5FA,CA4F6B,CA5F7B,CAAA,CAAA,CAAA,IAAA,EA8FJ,CA9FI,EAAA,SAAA,EAAA,CAAA,KAAA,EAgGD,4BAhGC,CAgG4B,CAhG5B,CAAA,EAAA,GAAA,EAiGH,qBAjGG,CAiGmB,CAjGnB,CAAA,EAAA,IAAA,EAkGF,CAlGE,EAAA,GAAA,KAAA,IAmGI,CAnGJ,CAAA,EAoGT,yBApGS,CAoGiB,CApGjB,EAoGoB,CApGpB,CAAA;AAeP,iBAsFW,MAtFD,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAuFP,CAvFO,EAAA,SAAA,EAAA,CAAA,KAAA,EAyFJ,4BAzFI,CAyFyB,CAzFzB,CAAA,EAAA,GAAA,EA0FN,qBA1FM,CA0FgB,CA1FhB,CAAA,EAAA,IAAA,EA2FL,CA3FK,EAAA,GAAA,OAAA,CAAA,EA6FZ,iBA7FY,CA6FM,CA7FN,CAAA;;;;;;;;;;;;;;AAIF;;;;;;;;;;AASgB,iBAyGb,MAzGa,CAAA,UAAA,MAAA,EAAA,UA2GjB,4BA3GiB,CA2GY,CA3GZ,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EA8GlB,4BA9GkB,CA8GW,CA9GX,CAAA,EAAA,GAAA,EA+GpB,qBA/GoB,CA+GE,CA/GF,CAAA,EAAA,IAAA,EAgHnB,CAhHmB,EAAA,GAAA,KAAA,IAiHb,CAjHa,CAAA,EAAA,CAAA,IAAA,EAkHnB,CAlHmB,EAAA,GAkHb,yBAlHa,CAkHa,CAlHb,EAkHgB,CAlHhB,CAAA;AAAd,iBAmHC,MAnHD,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAqHJ,4BArHI,CAqHyB,CArHzB,CAAA,EAAA,GAAA,EAsHN,qBAtHM,CAsHgB,CAtHhB,CAAA,EAAA,IAAA,EAuHL,CAvHK,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EAyHL,CAzHK,EAAA,GAyHC,iBAzHD,CAyHmB,CAzHnB,CAAA"}

package/dist/pick-by.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{pickBy as e}from"./pick-by-CM_x6iCC.js";export{e as pickBy};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n={};for(let[r,i]of Object.entries(e))t(i,r,e)&&(n[r]=i);return n}export{t as pickBy};
+//# sourceMappingURL=pick-by.js.map

package/dist/pick-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick-by.js","names":["out: Partial<Record<string, unknown>>"],"sources":["../src/pick-by.ts"],"sourcesContent":["import type { IsNever, Simplify } from 'type-fest';\nimport type { EnumerableStringKeyOf } from './internal/types/enumerable-string-key-of';\nimport type { EnumerableStringKeyedValueOf } from './internal/types/enumerable-string-keyed-value-of';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport type { ToString } from './internal/types/to-string';\nimport { curry } from './curry';\n\n// When the predicate isn't a type-guard we don't know which properties would be\n// part of the output and which wouldn't so we can only safely downgrade the\n// whole object to a Partial of the input.\ntype EnumeratedPartial<T> = T extends unknown\n  ? Simplify<\n      IsBoundedRecord<T> extends true\n        ? {\n            // Object.entries returns keys as strings.\n            -readonly [P in keyof T as ToString<P>]?: Required<T>[P];\n          }\n        // For unbounded records (a simple Record with primitive `string` or\n        // `number` keys) the return type here could technically be T; but for\n        // cases where the record is unbounded but is more complex (like\n        // `symbol` keys) we want to \"reconstruct\" the record from just its\n        // enumerable components (which are the ones accessible via\n        // `Object.entries`).\n        : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>\n    >\n  : never;\n\n// When the predicate is a type-guard we have more information to work with when\n// constructing the type of the output object. We can safely remove any property\n// which value would never come up true for the predicate, AND we can also\n// assume that properties that match the predicate perfectly would **always**\n// show up in the output object. Hence to build the output object we need to\n// build and merge 2 output objects: One for the properties which have a value\n// of at type that would always yield a `true` result from the predicate, these\n// are the \"matches\", which would not change the \"optionality\" of the input\n// object's props, and one for partial matches which would also make the props\n// optional (as they could have a value that would be filtered out).\ntype EnumeratedPartialNarrowed<T, S> = T extends unknown\n  ? Simplify<\n      IsBoundedRecord<T> extends true\n        ? ExactProps<T, S> & PartialProps<T, S>\n        // For unbounded records we need to \"reconstruct\" the record and\n        // narrow the value types. Similar to the non-narrowed case, we need\n        // to also ignore `symbol` keys and any values that are only relevant\n        // to them.\n        : Record<\n            EnumerableStringKeyOf<T>,\n            Extract<EnumerableStringKeyedValueOf<T>, S>\n          >\n    >\n  : never;\n\n// The exact case, props here would always be part of the output object\ntype ExactProps<T, S> = {\n  // Object.entries returns keys as strings.\n  -readonly [P in keyof T as ToString<\n    IsExactProp<T, P, S> extends true ? P : never\n  >]: Extract<Required<T>[P], S>;\n};\n\n// The partial case, props here might be part of the output object, but might\n// not be, hence they are optional.\ntype PartialProps<T, S> = {\n  // Object.entries returns keys as strings.\n  -readonly [P in keyof T as ToString<\n    IsPartialProp<T, P, S> extends true ? P : never\n  >]?: IsNever<Extract<T[P], S>> extends true\n    // If the result of extracting S from T[P] is never but S still extends\n    // it, it means that T[P] is too wide and S can't be extracted from it:\n    // e.g. if T[P] is `number` S is `1` then `Extract<number, 1> === never`.\n    // For these cases we can return S directly as the type as it's already\n    // very narrowed compared to T[P].\n    ? S extends T[P]\n      ? S\n      : never\n    : Extract<T[P], S>;\n};\n\n// If the input object's value type extends itself when the type-guard is\n// extracted from it we can safely assume that the predicate would always return\n// true for any value of that property.\ntype IsExactProp<T, P extends keyof T, S>\n  = T[P] extends Extract<T[P], S> ? true : false;\n\n// ...and if the input object's value type isn't an exact match, but still has\n// some partial match (i.g. the extracted type-guard isn't completely disjoint)\n// then we can assume that the property can sometimes return true, and sometimes\n// false when passed to the predicate, hence it should be optional in the\n// output.\ntype IsPartialProp<T, P extends keyof T, S>\n  = IsExactProp<T, P, S> extends true\n    ? false\n    : IsNever<Extract<T[P], S>> extends true\n      ? S extends T[P]\n        // If the result of extracting S from T[P] is never but S still\n        // extends it, it means that T[P] is too wide and S can't be\n        // extracted from it: e.g. if T[P] is `number` S is `1` then\n        // `Extract<number, 1> === never`, but `1` extends `number`. We need\n        // to handle these cases when we extract the value too (see above).\n        ? true\n        : false\n      : true;\n\n/**\n * Iterates over the entries of `data` and reconstructs the object using only\n * entries that `predicate` accepts. Symbol keys are not passed to the predicate\n * and would be filtered out from the output object.\n *\n * See `omitBy` for a complementary function which starts with a shallow copy of\n * the input object and removes the entries that the predicate rejects. Because\n * it is subtractive symbol keys would be copied over to the output object.\n * See also `entries`, `filter`, and `fromEntries` which could be used to build\n * your own version of `pickBy` if you need more control (though the resulting\n * type might be less precise).\n *\n * @param data - The target object.\n * @param predicate - A function that takes the value, key, and the data itself\n * and returns true if the entry should be part of the output object, or `false`\n * to remove it. If the function is a type-guard on the value the output type\n * would be narrowed accordingly.\n * @returns A shallow copy of the input object with the rejected entries\n * removed.\n * @signature P.pickBy(data, predicate)\n * @example\n *    P.pickBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {A: 3, B: 4}\n * @dataFirst\n * @category Object\n */\nexport function pickBy<\n  T extends object,\n  S extends EnumerableStringKeyedValueOf<T>,\n>(\n  data: T,\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => value is S,\n): EnumeratedPartialNarrowed<T, S>;\nexport function pickBy<T extends object>(\n  data: T,\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => boolean,\n): EnumeratedPartial<T>;\n\n/**\n * Iterates over the entries of `data` and reconstructs the object using only\n * entries that `predicate` accepts. Symbol keys are not passed to the predicate\n * and would be filtered out from the output object.\n *\n * See `omitBy` for a complementary function which starts with a shallow copy of\n * the input object and removes the entries that the predicate rejects. Because\n * it is subtractive symbol keys would be copied over to the output object.\n * See also `entries`, `filter`, and `fromEntries` which could be used to build\n * your own version of `pickBy` if you need more control (though the resulting\n * type might be less precise).\n *\n * @param predicate - A function that takes the value, key, and the data itself\n * and returns true if the entry should be part of the output object, or `false`\n * to remove it. If the function is a type-guard on the value the output type\n * would be narrowed accordingly.\n * @signature\n *   P.pickBy(predicate)(data)\n * @example\n *    P.pipe({a: 1, b: 2, A: 3, B: 4}, pickBy((val, key) => key.toUpperCase() === key)); // => {A: 3, B: 4}\n * @dataLast\n * @category Object\n */\nexport function pickBy<\n  T extends object,\n  S extends EnumerableStringKeyedValueOf<T>,\n>(\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => value is S,\n): (data: T) => EnumeratedPartialNarrowed<T, S>;\nexport function pickBy<T extends object>(\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => boolean,\n): (data: T) => EnumeratedPartial<T>;\n\nexport function pickBy(...args: ReadonlyArray<unknown>): unknown {\n  return curry(pickByImplementation, args);\n}\n\nfunction pickByImplementation<T extends object>(\n  data: T,\n  predicate: (value: unknown, key: string, data: T) => boolean,\n): Record<string, unknown> {\n  const out: Partial<Record<string, unknown>> = {};\n\n  for (const [key, value] of Object.entries(data)) {\n    if (predicate(value, key, data)) {\n      out[key] = value;\n    }\n  }\n\n  return out;\n}\n"],"mappings":"wCA6LA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EACyB,CACzB,IAAMA,EAAwC,EAAE,CAEhD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAK,CACzC,EAAU,EAAO,EAAK,EAAK,GAC7B,EAAI,GAAO,GAIf,OAAO"}

package/dist/pick.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./pick-DH_wjXvd.cjs`);exports.pick=e.pick;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t){let n={};for(let r of t)r in e&&(n[r]=e[r]);return n}exports.pick=t;

package/dist/pick.d.cts

@@ -1,7 +1,66 @@
-import "./is-union-BEGCMhOi.cjs";
-import "./iterable-container-V5sa0V_H.cjs";
-import "./perkakas-type-error-0tHtaPbi.cjs";
-import "./tuple-parts-BIyABPYv.cjs";
-import "./is-bounded-record-kpsb1wQA.cjs";
-import { pick } from "./pick-ChVH4t7j.cjs";
-export { pick };
+import { t as IsUnion } from "./is-union-Dp9mCo1b.cjs";
+import { t as TupleParts } from "./tuple-parts-BJQEORxn.cjs";
+import { n as IsBounded, t as IsBoundedRecord } from "./is-bounded-record-D9YK_OC8.cjs";
+import { EmptyObject, IsNever, KeysOfUnion, Writable } from "type-fest";
+
+//#region src/pick.d.ts
+type PickFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = T extends unknown ? Keys extends unknown ? IsNever<Extract<Keys[number], keyof T>> extends true ? EmptyObject : Writable<IsBoundedRecord<T> extends true ? PickBoundedFromArray<T, Keys> : PickUnbounded<T, Extract<Keys[number], keyof T>>> : never : never;
+/**
+ * Bounded records have bounded keys and result in a bounded output. The only
+ * question left is whether to add the prop as-is, or make it optional. This
+ * can be determined by the part of the keys array the prop is defined in, and
+ * the way that element is defined: if the array contains a singular literal
+ * key in either the required prefix or the suffix, we know that prop should be
+ * picked as-is, otherwise, the key might not be present in the keys array so it
+ * can only be picked optionally.
+ */
+type PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = Pick<T, Extract<ItemsByUnion<TupleParts<Keys>['required']>['singular'] | ItemsByUnion<TupleParts<Keys>['suffix']>['singular'], keyof T>> & Partial<Pick<T, Extract<ItemsByUnion<TupleParts<Keys>['required']>['union'] | TupleParts<Keys>['optional'][number] | TupleParts<Keys>['item'] | ItemsByUnion<TupleParts<Keys>['suffix']>['union'], keyof T>>>;
+/**
+ * We split the fixed tuple item types into **singular** props (e.g., `"a"`),
+ * and unions of several props (e.g., `"a" | "b"`).
+ *
+ * We assume that T is a fixed tuple (no optional or rest elements), and that
+ * all elements in it are bounded (as defined by `IsBounded`).
+ */
+type ItemsByUnion<T, Singular = never, Union = never> = T extends readonly [infer Head, ...infer Rest] ? IsUnion<Head> extends true ? ItemsByUnion<Rest, Singular, Union | Head> : ItemsByUnion<Rest, Singular | Head, Union> : {
+  singular: Singular;
+  union: Union;
+};
+/**
+ * The built-in `Pick` is weird when it comes to picking bounded keys from
+ * unbounded records. It reconstructs the output object regardless of the shape
+ * of the input: `Pick<Record<string, "world">, "hello">` results in the type
+ * `{ hello: "world" }`, but you'd expect it to be optional because we don't
+ * know if the record contains a `hello` prop or not!
+ *
+ * !Important: We assume T is unbounded and don't test for it!
+ *
+ * See: https://www.typescriptlang.org/play/?#code/PTAEE0HsFcHIBNQFMAeAHJBjALqAGqNpKAEZKigAGA3qABZIA2jkA-AFygBEA7pAE6N4XUAF9KAGlLRcAQ0ayAzgChsATwz5QAXlAAFAJaYA1gB4ASlgHxTi7PwMA7AOZTeAoVwB8bhs0jeANzKIBSgAHqsykA.
+ */
+type PickUnbounded<T, Keys extends keyof T> = IsBounded<Keys> extends true ? Partial<Pick<T, Keys>> : Pick<T, Keys>;
+/**
+ * Creates an object composed of the picked `data` properties.
+ *
+ * @param keys - The property names.
+ * @signature P.pick([prop1, prop2])(object)
+ * @example
+ *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.pick(['a', 'd'])) // => { a: 1, d: 4 }
+ * @dataLast
+ * @category Object
+ */
+declare function pick<T extends object, const Keys extends ReadonlyArray<KeysOfUnion<T>>>(keys: Keys): (data: T) => PickFromArray<T, Keys>;
+/**
+ * Creates an object composed of the picked `data` properties.
+ *
+ * @param data - The target object.
+ * @param keys - The property names.
+ * @signature P.pick(object, [prop1, prop2])
+ * @example
+ *    P.pick({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { a: 1, d: 4 }
+ * @dataFirst
+ * @category Object
+ */
+declare function pick<T extends object, const Keys extends ReadonlyArray<KeysOfUnion<T>>>(data: T, keys: Keys): PickFromArray<T, Keys>;
+//#endregion
+export { pick };
+//# sourceMappingURL=pick.d.cts.map

package/dist/pick.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick.d.cts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;;;;;KAOK,8BAA8B,cAAc,YAAY,OAEzD,oBACE,uBAOE,QAAQ,QAAQ,oBAAoB,mBAClC,cAIA,SACE,gBAAgB,kBACZ,qBAAqB,GAAG,QACxB,cAAc,GAAG,QAAQ,oBAAoB;AArBE;;;;;;;;;KAmC1D,oBAtBG,CAAA,CAAA,EAAA,aAsBkC,aAtBlC,CAsBgD,WAtBhD,CAsB4D,CAtB5D,CAAA,CAAA,CAAA,GAwBJ,IAxBI,CAyBJ,CAzBI,EA4BJ,OA5BI,CA6BA,YA7BA,CA6Ba,UA7Bb,CA6BwB,IA7BxB,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,UAAA,CAAA,GA8BA,YA9BA,CA8Ba,UA9Bb,CA8BwB,IA9BxB,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,UAAA,CAAA,EAAA,MA+BI,CA/BJ,CAAA,CAAA,GAmCJ,OAnCI,CAoCF,IApCE,CAqCA,CArCA,EAwCA,OAxCA,CAyCI,YAzCJ,CAyCiB,UAzCjB,CAyC4B,IAzC5B,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,OAAA,CAAA,GA2CI,UA3CJ,CA2Ce,IA3Cf,CAAA,CAAA,UAAA,CAAA,CAAA,MAAA,CAAA,GA4CI,UA5CJ,CA4Ce,IA5Cf,CAAA,CAAA,MAAA,CAAA,GA6CI,YA7CJ,CA6CiB,UA7CjB,CA6C4B,IA7C5B,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,OAAA,CAAA,EAAA,MA8CQ,CA9CR,CAAA,CAAA,CAAA;;;;;;;;KA0DH,YAlDoC,CAAA,CAAA,EAAA,WAAA,KAAA,EAAA,QAAA,KAAA,CAAA,GAkDe,CAlDf,SAAA,SAAA,CAAoB,KAAA,KAAA,EAA5B,GAAA,KAAA,KAAA,CAAjB,GAsDZ,OAtDY,CAsDJ,IAtDI,CAAA,SAAA,IAAA,GAuDV,YAvDU,CAuDG,IAvDH,EAuDS,QAvDT,EAuDmB,KAvDnB,GAuD2B,IAvD3B,CAAA,GAwDV,YAxDU,CAwDG,IAxDH,EAwDS,QAxDT,GAwDoB,IAxDpB,EAwD0B,KAxD1B,CAAA,GAAA;EAHN,QAAA,EA4DM,QA5DN;EAAQ,KAAA,EA4De,KA5Df;AAAA,CAAA;;;;;;;;;;;;KAyEb,aAlDD,CAAA,CAAA,EAAA,aAAA,MAkDqC,CAlDrC,CAAA,GAkD0C,SAlD1C,CAkDoD,IAlDpD,CAAA,SAAA,IAAA,GAkDyE,OAlDzE,CAkDiF,IAlDjF,CAkDsF,CAlDtF,EAkDyF,IAlDzF,CAAA,CAAA,GAkDkG,IAlDlG,CAkDuG,CAlDvG,EAkD0G,IAlD1G,CAAA;;;;;;;;;;;AAiBqB,iBA6CT,IA7CS,CAAA,UAAA,MAAA,EAAA,mBA+CJ,aA/CI,CA+CU,WA/CV,CA+CsB,CA/CtB,CAAA,CAAA,CAAA,CAAA,IAAA,EAgDjB,IAhDiB,CAAA,EAAA,CAAA,IAAA,EAgDH,CAhDG,EAAA,GAgDG,aAhDH,CAgDiB,CAhDjB,EAgDoB,IAhDpB,CAAA;;;;;;;AAVd;;;;;AA4Bc,iBA2CT,IA3CS,CAAA,UAAA,MAAA,EAAA,mBA6CJ,aA7CI,CA6CU,WA7CV,CA6CsB,CA7CtB,CAAA,CAAA,CAAA,CAAA,IAAA,EA8CjB,CA9CiB,EAAA,IAAA,EA8CR,IA9CQ,CAAA,EA8CD,aA9CC,CA8Ca,CA9Cb,EA8CgB,IA9ChB,CAAA"}

package/dist/pick.d.ts

@@ -1,7 +1,66 @@
-import "./is-union-J33UR5By.js";
-import "./iterable-container-F9CDF7ym.js";
-import "./perkakas-type-error-2yBU0Drj.js";
-import "./tuple-parts-Du2iVN8H.js";
-import "./is-bounded-record-DEQ2a3_Y.js";
-import { pick } from "./pick-DvCrGRHa.js";
-export { pick };
+import { t as IsUnion } from "./is-union-Bu19sEkP.js";
+import { t as TupleParts } from "./tuple-parts-Bhbm4jiu.js";
+import { n as IsBounded, t as IsBoundedRecord } from "./is-bounded-record-BGclJjRX.js";
+import { EmptyObject, IsNever, KeysOfUnion, Writable } from "type-fest";
+
+//#region src/pick.d.ts
+type PickFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = T extends unknown ? Keys extends unknown ? IsNever<Extract<Keys[number], keyof T>> extends true ? EmptyObject : Writable<IsBoundedRecord<T> extends true ? PickBoundedFromArray<T, Keys> : PickUnbounded<T, Extract<Keys[number], keyof T>>> : never : never;
+/**
+ * Bounded records have bounded keys and result in a bounded output. The only
+ * question left is whether to add the prop as-is, or make it optional. This
+ * can be determined by the part of the keys array the prop is defined in, and
+ * the way that element is defined: if the array contains a singular literal
+ * key in either the required prefix or the suffix, we know that prop should be
+ * picked as-is, otherwise, the key might not be present in the keys array so it
+ * can only be picked optionally.
+ */
+type PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = Pick<T, Extract<ItemsByUnion<TupleParts<Keys>['required']>['singular'] | ItemsByUnion<TupleParts<Keys>['suffix']>['singular'], keyof T>> & Partial<Pick<T, Extract<ItemsByUnion<TupleParts<Keys>['required']>['union'] | TupleParts<Keys>['optional'][number] | TupleParts<Keys>['item'] | ItemsByUnion<TupleParts<Keys>['suffix']>['union'], keyof T>>>;
+/**
+ * We split the fixed tuple item types into **singular** props (e.g., `"a"`),
+ * and unions of several props (e.g., `"a" | "b"`).
+ *
+ * We assume that T is a fixed tuple (no optional or rest elements), and that
+ * all elements in it are bounded (as defined by `IsBounded`).
+ */
+type ItemsByUnion<T, Singular = never, Union = never> = T extends readonly [infer Head, ...infer Rest] ? IsUnion<Head> extends true ? ItemsByUnion<Rest, Singular, Union | Head> : ItemsByUnion<Rest, Singular | Head, Union> : {
+  singular: Singular;
+  union: Union;
+};
+/**
+ * The built-in `Pick` is weird when it comes to picking bounded keys from
+ * unbounded records. It reconstructs the output object regardless of the shape
+ * of the input: `Pick<Record<string, "world">, "hello">` results in the type
+ * `{ hello: "world" }`, but you'd expect it to be optional because we don't
+ * know if the record contains a `hello` prop or not!
+ *
+ * !Important: We assume T is unbounded and don't test for it!
+ *
+ * See: https://www.typescriptlang.org/play/?#code/PTAEE0HsFcHIBNQFMAeAHJBjALqAGqNpKAEZKigAGA3qABZIA2jkA-AFygBEA7pAE6N4XUAF9KAGlLRcAQ0ayAzgChsATwz5QAXlAAFAJaYA1gB4ASlgHxTi7PwMA7AOZTeAoVwB8bhs0jeANzKIBSgAHqsykA.
+ */
+type PickUnbounded<T, Keys extends keyof T> = IsBounded<Keys> extends true ? Partial<Pick<T, Keys>> : Pick<T, Keys>;
+/**
+ * Creates an object composed of the picked `data` properties.
+ *
+ * @param keys - The property names.
+ * @signature P.pick([prop1, prop2])(object)
+ * @example
+ *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.pick(['a', 'd'])) // => { a: 1, d: 4 }
+ * @dataLast
+ * @category Object
+ */
+declare function pick<T extends object, const Keys extends ReadonlyArray<KeysOfUnion<T>>>(keys: Keys): (data: T) => PickFromArray<T, Keys>;
+/**
+ * Creates an object composed of the picked `data` properties.
+ *
+ * @param data - The target object.
+ * @param keys - The property names.
+ * @signature P.pick(object, [prop1, prop2])
+ * @example
+ *    P.pick({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { a: 1, d: 4 }
+ * @dataFirst
+ * @category Object
+ */
+declare function pick<T extends object, const Keys extends ReadonlyArray<KeysOfUnion<T>>>(data: T, keys: Keys): PickFromArray<T, Keys>;
+//#endregion
+export { pick };
+//# sourceMappingURL=pick.d.ts.map

package/dist/pick.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick.d.ts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;;;;;KAOK,8BAA8B,cAAc,YAAY,OAEzD,oBACE,uBAOE,QAAQ,QAAQ,oBAAoB,mBAClC,cAIA,SACE,gBAAgB,kBACZ,qBAAqB,GAAG,QACxB,cAAc,GAAG,QAAQ,oBAAoB;AArBE;;;;;;;;;KAmC1D,oBAtBG,CAAA,CAAA,EAAA,aAsBkC,aAtBlC,CAsBgD,WAtBhD,CAsB4D,CAtB5D,CAAA,CAAA,CAAA,GAwBJ,IAxBI,CAyBJ,CAzBI,EA4BJ,OA5BI,CA6BA,YA7BA,CA6Ba,UA7Bb,CA6BwB,IA7BxB,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,UAAA,CAAA,GA8BA,YA9BA,CA8Ba,UA9Bb,CA8BwB,IA9BxB,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,UAAA,CAAA,EAAA,MA+BI,CA/BJ,CAAA,CAAA,GAmCJ,OAnCI,CAoCF,IApCE,CAqCA,CArCA,EAwCA,OAxCA,CAyCI,YAzCJ,CAyCiB,UAzCjB,CAyC4B,IAzC5B,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,OAAA,CAAA,GA2CI,UA3CJ,CA2Ce,IA3Cf,CAAA,CAAA,UAAA,CAAA,CAAA,MAAA,CAAA,GA4CI,UA5CJ,CA4Ce,IA5Cf,CAAA,CAAA,MAAA,CAAA,GA6CI,YA7CJ,CA6CiB,UA7CjB,CA6C4B,IA7C5B,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,OAAA,CAAA,EAAA,MA8CQ,CA9CR,CAAA,CAAA,CAAA;;;;;;;;KA0DH,YAlDoC,CAAA,CAAA,EAAA,WAAA,KAAA,EAAA,QAAA,KAAA,CAAA,GAkDe,CAlDf,SAAA,SAAA,CAAoB,KAAA,KAAA,EAA5B,GAAA,KAAA,KAAA,CAAjB,GAsDZ,OAtDY,CAsDJ,IAtDI,CAAA,SAAA,IAAA,GAuDV,YAvDU,CAuDG,IAvDH,EAuDS,QAvDT,EAuDmB,KAvDnB,GAuD2B,IAvD3B,CAAA,GAwDV,YAxDU,CAwDG,IAxDH,EAwDS,QAxDT,GAwDoB,IAxDpB,EAwD0B,KAxD1B,CAAA,GAAA;EAHN,QAAA,EA4DM,QA5DN;EAAQ,KAAA,EA4De,KA5Df;AAAA,CAAA;;;;;;;;;;;;KAyEb,aAlDD,CAAA,CAAA,EAAA,aAAA,MAkDqC,CAlDrC,CAAA,GAkD0C,SAlD1C,CAkDoD,IAlDpD,CAAA,SAAA,IAAA,GAkDyE,OAlDzE,CAkDiF,IAlDjF,CAkDsF,CAlDtF,EAkDyF,IAlDzF,CAAA,CAAA,GAkDkG,IAlDlG,CAkDuG,CAlDvG,EAkD0G,IAlD1G,CAAA;;;;;;;;;;;AAiBqB,iBA6CT,IA7CS,CAAA,UAAA,MAAA,EAAA,mBA+CJ,aA/CI,CA+CU,WA/CV,CA+CsB,CA/CtB,CAAA,CAAA,CAAA,CAAA,IAAA,EAgDjB,IAhDiB,CAAA,EAAA,CAAA,IAAA,EAgDH,CAhDG,EAAA,GAgDG,aAhDH,CAgDiB,CAhDjB,EAgDoB,IAhDpB,CAAA;;;;;;;AAVd;;;;;AA4Bc,iBA2CT,IA3CS,CAAA,UAAA,MAAA,EAAA,mBA6CJ,aA7CI,CA6CU,WA7CV,CA6CsB,CA7CtB,CAAA,CAAA,CAAA,CAAA,IAAA,EA8CjB,CA9CiB,EAAA,IAAA,EA8CR,IA9CQ,CAAA,EA8CD,aA9CC,CA8Ca,CA9Cb,EA8CgB,IA9ChB,CAAA"}

package/dist/pick.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{pick as e}from"./pick-DeXJU-DB.js";export{e as pick};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n={};for(let r of t)r in e&&(n[r]=e[r]);return n}export{t as pick};
+//# sourceMappingURL=pick.js.map

package/dist/pick.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pick.js","names":["out: Partial<Pick<T, Keys[number]>>"],"sources":["../src/pick.ts"],"sourcesContent":["import type { EmptyObject, IsNever, KeysOfUnion, Writable } from 'type-fest';\nimport type { IsBounded } from './internal/types/is-bounded';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport type { IsUnion } from './internal/types/is-union';\nimport type { TupleParts } from './internal/types/tuple-parts';\nimport { curry } from './curry';\n\ntype PickFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>>\n  // Distribute unions for both object types and key arrays.\n  = T extends unknown\n    ? Keys extends unknown\n      // When T is a union (or when Keys is empty) the picked props might\n      // not exist in some of its sub-types, e.g.,\n      //   `pick(... as { a: string } | { b: number }, ['a'])`,\n      // if we simply let the regular \"constructive\" logic run, the\n      // resulting type would be `{}` which doesn't behave like an empty\n      // object! instead, we want to use a more explicit *empty* type.\n      ? IsNever<Extract<Keys[number], keyof T>> extends true\n        ? EmptyObject\n        // Remove `readonly` modifiers from picked props since we return a\n        // new, mutable, object. We don't wrap the result with `Simplify` to\n        // flatten it because `Writable` does the same thing implicitly.\n        : Writable<\n            IsBoundedRecord<T> extends true\n              ? PickBoundedFromArray<T, Keys>\n              : PickUnbounded<T, Extract<Keys[number], keyof T>>\n          >\n      : never\n    : never;\n\n/**\n * Bounded records have bounded keys and result in a bounded output. The only\n * question left is whether to add the prop as-is, or make it optional. This\n * can be determined by the part of the keys array the prop is defined in, and\n * the way that element is defined: if the array contains a singular literal\n * key in either the required prefix or the suffix, we know that prop should be\n * picked as-is, otherwise, the key might not be present in the keys array so it\n * can only be picked optionally.\n */\ntype PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>>\n  // Literal keys in the prefix/suffix are guaranteed present.\n  = Pick<\n    T,\n    // When T is a union the keys need to be narrowed to just those that are\n    // keys of the specific sub-type being built\n    Extract<\n      | ItemsByUnion<TupleParts<Keys>['required']>['singular']\n      | ItemsByUnion<TupleParts<Keys>['suffix']>['singular'],\n      keyof T\n    >\n  >\n    // Union keys, optional elements, and rest elements are optional.\n  & Partial<\n      Pick<\n        T,\n        // When T is a union the keys need to be narrowed to just those that are\n        // keys of the specific sub-type being built.\n        Extract<\n          | ItemsByUnion<TupleParts<Keys>['required']>['union']\n          // TODO: the optional part of the keys array will always be empty because its impossible to provide the pick function with a tuple with optional elements; this is because optional elements are always implicitly `undefined` too; which breaks the constraint that all keys are keys of T (`undefined` is not a key of anything). We can lift this restriction by supporting `undefined` in the runtime and relaxing the type constraint to allow it, but this relaxed constraint enables a niche feature (optional tuple elements) at the expense of better type-safety for the more common cases of fixed tuples and arrays. Anyway... if we ever change it, this part of the output type will ensure the output is still correct:\n          | TupleParts<Keys>['optional'][number]\n          | TupleParts<Keys>['item']\n          | ItemsByUnion<TupleParts<Keys>['suffix']>['union'],\n          keyof T\n        >\n      >\n    >;\n\n/**\n * We split the fixed tuple item types into **singular** props (e.g., `\"a\"`),\n * and unions of several props (e.g., `\"a\" | \"b\"`).\n *\n * We assume that T is a fixed tuple (no optional or rest elements), and that\n * all elements in it are bounded (as defined by `IsBounded`).\n */\ntype ItemsByUnion<T, Singular = never, Union = never> = T extends readonly [\n  infer Head,\n  ...infer Rest,\n]\n  ? IsUnion<Head> extends true\n    ? ItemsByUnion<Rest, Singular, Union | Head>\n    : ItemsByUnion<Rest, Singular | Head, Union>\n  : { singular: Singular; union: Union };\n\n/**\n * The built-in `Pick` is weird when it comes to picking bounded keys from\n * unbounded records. It reconstructs the output object regardless of the shape\n * of the input: `Pick<Record<string, \"world\">, \"hello\">` results in the type\n * `{ hello: \"world\" }`, but you'd expect it to be optional because we don't\n * know if the record contains a `hello` prop or not!\n *\n * !Important: We assume T is unbounded and don't test for it!\n *\n * See: https://www.typescriptlang.org/play/?#code/PTAEE0HsFcHIBNQFMAeAHJBjALqAGqNpKAEZKigAGA3qABZIA2jkA-AFygBEA7pAE6N4XUAF9KAGlLRcAQ0ayAzgChsATwz5QAXlAAFAJaYA1gB4ASlgHxTi7PwMA7AOZTeAoVwB8bhs0jeANzKIBSgAHqsykA.\n */\ntype PickUnbounded<T, Keys extends keyof T> = IsBounded<Keys> extends true ? Partial<Pick<T, Keys>> : Pick<T, Keys>;\n\n/**\n * Creates an object composed of the picked `data` properties.\n *\n * @param keys - The property names.\n * @signature P.pick([prop1, prop2])(object)\n * @example\n *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.pick(['a', 'd'])) // => { a: 1, d: 4 }\n * @dataLast\n * @category Object\n */\nexport function pick<\n  T extends object,\n  const Keys extends ReadonlyArray<KeysOfUnion<T>>,\n>(keys: Keys): (data: T) => PickFromArray<T, Keys>;\n\n/**\n * Creates an object composed of the picked `data` properties.\n *\n * @param data - The target object.\n * @param keys - The property names.\n * @signature P.pick(object, [prop1, prop2])\n * @example\n *    P.pick({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { a: 1, d: 4 }\n * @dataFirst\n * @category Object\n */\nexport function pick<\n  T extends object,\n  const Keys extends ReadonlyArray<KeysOfUnion<T>>,\n>(data: T, keys: Keys): PickFromArray<T, Keys>;\n\nexport function pick(...args: ReadonlyArray<unknown>): unknown {\n  return curry(pickImplementation, args);\n}\n\nfunction pickImplementation<\n  T extends object,\n  Keys extends ReadonlyArray<keyof T>,\n>(object: T, keys: Keys): PickFromArray<T, Keys> {\n  const out: Partial<Pick<T, Keys[number]>> = {};\n  for (const key of keys) {\n    if (key in object) {\n      out[key] = object[key];\n    }\n  }\n  // @ts-expect-error [ts2322] - We build the type incrementally, there's no way to make typescript infer that we \"finished\" building the object and to treat it as such.\n  return out;\n}\n"],"mappings":"wCAgIA,SAAgB,EAAK,GAAG,EAAuC,CAC7D,OAAO,EAAM,EAAoB,EAAK,CAGxC,SAAS,EAGP,EAAW,EAAoC,CAC/C,IAAMA,EAAsC,EAAE,CAC9C,IAAK,IAAM,KAAO,EACZ,KAAO,IACT,EAAI,GAAO,EAAO,IAItB,OAAO"}

package/dist/pipe-BGazHnZ_.js

@@ -0,0 +1,2 @@
+import{t as e}from"./utility-evaluators-BwYLtB8b.js";function t(e,...t){let a=e,o=t.map(e=>`lazy`in e?r(e):void 0),s=0;for(;s<t.length;){if(o[s]===void 0||!i(a)){let e=t[s];a=e(a),s+=1;continue}let e=[];for(let n=s;n<t.length;n++){let t=o[n];if(t===void 0||(e.push(t),t.isSingle))break}let r=[];for(let t of a)if(n(t,r,e))break;let{isSingle:c}=e.at(-1);a=c?r[0]:r,s+=e.length}return a}function n(t,r,i){if(i.length===0)return r.push(t),!1;let a=t,o=e,s=!1;for(let[e,t]of i.entries()){let{index:c,items:l}=t;if(l.push(a),o=t(a,c,l),t.index+=1,o.hasNext){if(o.hasMany??!1){for(let t of o.next)if(n(t,r,i.slice(e+1)))return!0;return s}a=o.next}if(!o.hasNext)break;o.done&&(s=!0)}return o.hasNext&&r.push(a),s}function r(e){let{lazy:t,lazyArgs:n}=e,r=t(...n);return Object.assign(r,{isSingle:t.single??!1,index:0,items:[]})}function i(e){return typeof e==`string`||typeof e==`object`&&!!e&&Symbol.iterator in e}export{t};
+//# sourceMappingURL=pipe-BGazHnZ_.js.map

package/dist/pipe-BGazHnZ_.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipe-BGazHnZ_.js","names":["lazySequence: Array<PreparedLazyOperation>","accumulator: Array<unknown>","lazyResult: LazyResult<any>"],"sources":["../src/pipe.ts"],"sourcesContent":["/* eslint-disable ts/no-explicit-any */\n/* eslint-disable jsdoc/check-param-names -- we don't document the op params, it'd be redundant */\n\nimport type { LazyDefinition } from './internal/types/lazy-definition';\nimport type { LazyEvaluator } from './internal/types/lazy-evaluator';\nimport type { LazyResult } from './internal/types/lazy-result';\nimport { SKIP_ITEM } from './internal/utility-evaluators';\n\ntype PreparedLazyOperation = LazyEvaluator & {\n  readonly isSingle: boolean;\n\n  // These are intentionally mutable, they maintain the lazy piped state.\n  index: number;\n  items: Array<unknown>;\n};\n\ntype LazyOp = LazyDefinition & ((input: unknown) => unknown);\n\n/**\n * Perform left-to-right function composition.\n *\n * @param value - The initial value.\n * @param operations - The list of operations to apply.\n * @signature P.pipe(data, op1, op2, op3)\n * @example\n *    P.pipe(\n *      [1, 2, 3, 4],\n *      P.map(x => x * 2),\n *      arr => [arr[0] + arr[1], arr[2] + arr[3]],\n *    ) // => [6, 14]\n * @dataFirst\n * @category Function\n */\nexport function pipe<A, B>(value: A, op1: (input: A) => B): B;\nexport function pipe<A, B, C>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n): C;\n\nexport function pipe<A, B, C, D>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n): D;\n\nexport function pipe<A, B, C, D, E>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n): E;\n\nexport function pipe<A, B, C, D, E, F>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n  op5: (input: E) => F,\n): F;\n\nexport function pipe<A, B, C, D, E, F, G>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n  op5: (input: E) => F,\n  op6: (input: F) => G,\n): G;\n\nexport function pipe<A, B, C, D, E, F, G, H>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n  op5: (input: E) => F,\n  op6: (input: F) => G,\n  op7: (input: G) => H,\n): H;\n\nexport function pipe<A, B, C, D, E, F, G, H, I>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n  op5: (input: E) => F,\n  op6: (input: F) => G,\n  op7: (input: G) => H,\n  op8: (input: H) => I,\n): I;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J>(\n  value: A,\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n  op5: (input: E) => F,\n  op6: (input: F) => G,\n  op7: (input: G) => H,\n  op8: (input: H) => I,\n  op9: (input: I) => J,\n): J;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K>(\n  value: A,\n  op01: (input: A) => B,\n  op02: (input: B) => C,\n  op03: (input: C) => D,\n  op04: (input: D) => E,\n  op05: (input: E) => F,\n  op06: (input: F) => G,\n  op07: (input: G) => H,\n  op08: (input: H) => I,\n  op09: (input: I) => J,\n  op10: (input: J) => K,\n): K;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L>(\n  value: A,\n  op01: (input: A) => B,\n  op02: (input: B) => C,\n  op03: (input: C) => D,\n  op04: (input: D) => E,\n  op05: (input: E) => F,\n  op06: (input: F) => G,\n  op07: (input: G) => H,\n  op08: (input: H) => I,\n  op09: (input: I) => J,\n  op10: (input: J) => K,\n  op11: (input: K) => L,\n): L;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M>(\n  value: A,\n  op01: (input: A) => B,\n  op02: (input: B) => C,\n  op03: (input: C) => D,\n  op04: (input: D) => E,\n  op05: (input: E) => F,\n  op06: (input: F) => G,\n  op07: (input: G) => H,\n  op08: (input: H) => I,\n  op09: (input: I) => J,\n  op10: (input: J) => K,\n  op11: (input: K) => L,\n  op12: (input: L) => M,\n): M;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(\n  value: A,\n  op01: (input: A) => B,\n  op02: (input: B) => C,\n  op03: (input: C) => D,\n  op04: (input: D) => E,\n  op05: (input: E) => F,\n  op06: (input: F) => G,\n  op07: (input: G) => H,\n  op08: (input: H) => I,\n  op09: (input: I) => J,\n  op10: (input: J) => K,\n  op11: (input: K) => L,\n  op12: (input: L) => M,\n  op13: (input: M) => N,\n): N;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>(\n  value: A,\n  op01: (input: A) => B,\n  op02: (input: B) => C,\n  op03: (input: C) => D,\n  op04: (input: D) => E,\n  op05: (input: E) => F,\n  op06: (input: F) => G,\n  op07: (input: G) => H,\n  op08: (input: H) => I,\n  op09: (input: I) => J,\n  op10: (input: J) => K,\n  op11: (input: K) => L,\n  op12: (input: L) => M,\n  op13: (input: M) => N,\n  op14: (input: N) => O,\n): O;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P>(\n  value: A,\n  op01: (input: A) => B,\n  op02: (input: B) => C,\n  op03: (input: C) => D,\n  op04: (input: D) => E,\n  op05: (input: E) => F,\n  op06: (input: F) => G,\n  op07: (input: G) => H,\n  op08: (input: H) => I,\n  op09: (input: I) => J,\n  op10: (input: J) => K,\n  op11: (input: K) => L,\n  op12: (input: L) => M,\n  op13: (input: M) => N,\n  op14: (input: N) => O,\n  op15: (input: O) => P,\n): P;\n\nexport function pipe(\n  input: unknown,\n  ...operations: ReadonlyArray<((value: any) => unknown) | LazyOp>\n): any {\n  let output = input;\n\n  const lazyOperations = operations.map((op) =>\n    'lazy' in op ? prepareLazyOperation(op) : undefined);\n\n  let operationIndex = 0;\n  while (operationIndex < operations.length) {\n    const lazyOperation = lazyOperations[operationIndex];\n    if (lazyOperation === undefined || !isIterable(output)) {\n      const operation = operations[operationIndex]!;\n      output = operation(output);\n      operationIndex += 1;\n      continue;\n    }\n\n    const lazySequence: Array<PreparedLazyOperation> = [];\n    for (let index = operationIndex; index < operations.length; index++) {\n      const lazyOp = lazyOperations[index];\n      if (lazyOp === undefined) {\n        break;\n      }\n\n      lazySequence.push(lazyOp);\n      if (lazyOp.isSingle) {\n        break;\n      }\n    }\n\n    const accumulator: Array<unknown> = [];\n\n    for (const value of output) {\n      const shouldExitEarly = processItem(value, accumulator, lazySequence);\n      if (shouldExitEarly) {\n        break;\n      }\n    }\n\n    const { isSingle } = lazySequence.at(-1)!;\n    output = isSingle ? accumulator[0] : accumulator;\n    operationIndex += lazySequence.length;\n  }\n  return output;\n}\n\nfunction processItem(\n  item: unknown,\n  accumulator: Array<unknown>,\n  lazySequence: ReadonlyArray<PreparedLazyOperation>,\n): boolean {\n  if (lazySequence.length === 0) {\n    accumulator.push(item);\n    return false;\n  }\n\n  let currentItem = item;\n\n  let lazyResult: LazyResult<any> = SKIP_ITEM;\n  let isDone = false;\n  for (const [operationsIndex, lazyFn] of lazySequence.entries()) {\n    const { index, items } = lazyFn;\n    items.push(currentItem);\n    lazyResult = lazyFn(currentItem, index, items);\n    lazyFn.index += 1;\n    if (lazyResult.hasNext) {\n      if (lazyResult.hasMany ?? false) {\n        for (const subItem of lazyResult.next as ReadonlyArray<unknown>) {\n          const subResult = processItem(\n            subItem,\n            accumulator,\n            lazySequence.slice(operationsIndex + 1),\n          );\n          if (subResult) {\n            return true;\n          }\n        }\n        return isDone;\n      }\n      currentItem = lazyResult.next;\n    }\n    if (!lazyResult.hasNext) {\n      break;\n    }\n    // process remaining functions in the pipe\n    // but don't process remaining elements in the input array\n    if (lazyResult.done) {\n      isDone = true;\n    }\n  }\n\n  if (lazyResult.hasNext) {\n    accumulator.push(currentItem);\n  }\n\n  return isDone;\n}\n\nfunction prepareLazyOperation(op: LazyOp): PreparedLazyOperation {\n  const { lazy, lazyArgs } = op;\n  const fn = lazy(...lazyArgs);\n  return Object.assign(fn, {\n    isSingle: lazy.single ?? false,\n    index: 0,\n    items: [] as Array<unknown>,\n  });\n}\n\nfunction isIterable(something: unknown): something is Iterable<unknown> {\n  // Check for null and undefined to avoid errors when accessing Symbol.iterator\n  return (\n    typeof something === 'string'\n    || (typeof something === 'object'\n      && something !== null\n      && Symbol.iterator in something)\n  );\n}\n"],"mappings":"qDAiNA,SAAgB,EACd,EACA,GAAG,EACE,CACL,IAAI,EAAS,EAEP,EAAiB,EAAW,IAAK,GACrC,SAAU,EAAK,EAAqB,EAAG,CAAG,IAAA,GAAU,CAElD,EAAiB,EACrB,KAAO,EAAiB,EAAW,QAAQ,CAEzC,GADsB,EAAe,KACf,IAAA,IAAa,CAAC,EAAW,EAAO,CAAE,CACtD,IAAM,EAAY,EAAW,GAC7B,EAAS,EAAU,EAAO,CAC1B,GAAkB,EAClB,SAGF,IAAMA,EAA6C,EAAE,CACrD,IAAK,IAAI,EAAQ,EAAgB,EAAQ,EAAW,OAAQ,IAAS,CACnE,IAAM,EAAS,EAAe,GAM9B,GALI,IAAW,IAAA,KAIf,EAAa,KAAK,EAAO,CACrB,EAAO,UACT,MAIJ,IAAMC,EAA8B,EAAE,CAEtC,IAAK,IAAM,KAAS,EAElB,GADwB,EAAY,EAAO,EAAa,EAAa,CAEnE,MAIJ,GAAM,CAAE,YAAa,EAAa,GAAG,GAAG,CACxC,EAAS,EAAW,EAAY,GAAK,EACrC,GAAkB,EAAa,OAEjC,OAAO,EAGT,SAAS,EACP,EACA,EACA,EACS,CACT,GAAI,EAAa,SAAW,EAE1B,OADA,EAAY,KAAK,EAAK,CACf,GAGT,IAAI,EAAc,EAEdC,EAA8B,EAC9B,EAAS,GACb,IAAK,GAAM,CAAC,EAAiB,KAAW,EAAa,SAAS,CAAE,CAC9D,GAAM,CAAE,QAAO,SAAU,EAIzB,GAHA,EAAM,KAAK,EAAY,CACvB,EAAa,EAAO,EAAa,EAAO,EAAM,CAC9C,EAAO,OAAS,EACZ,EAAW,QAAS,CACtB,GAAI,EAAW,SAAW,GAAO,CAC/B,IAAK,IAAM,KAAW,EAAW,KAM/B,GALkB,EAChB,EACA,EACA,EAAa,MAAM,EAAkB,EAAE,CACxC,CAEC,MAAO,GAGX,OAAO,EAET,EAAc,EAAW,KAE3B,GAAI,CAAC,EAAW,QACd,MAIE,EAAW,OACb,EAAS,IAQb,OAJI,EAAW,SACb,EAAY,KAAK,EAAY,CAGxB,EAGT,SAAS,EAAqB,EAAmC,CAC/D,GAAM,CAAE,OAAM,YAAa,EACrB,EAAK,EAAK,GAAG,EAAS,CAC5B,OAAO,OAAO,OAAO,EAAI,CACvB,SAAU,EAAK,QAAU,GACzB,MAAO,EACP,MAAO,EAAE,CACV,CAAC,CAGJ,SAAS,EAAW,EAAoD,CAEtE,OACE,OAAO,GAAc,UACjB,OAAO,GAAc,YACpB,GACA,OAAO,YAAY"}

package/dist/pipe-CB7Lufqv.cjs

@@ -0,0 +1 @@
+const e=require(`./utility-evaluators-CAbODbuk.cjs`);function t(e,...t){let a=e,o=t.map(e=>`lazy`in e?r(e):void 0),s=0;for(;s<t.length;){if(o[s]===void 0||!i(a)){let e=t[s];a=e(a),s+=1;continue}let e=[];for(let n=s;n<t.length;n++){let t=o[n];if(t===void 0||(e.push(t),t.isSingle))break}let r=[];for(let t of a)if(n(t,r,e))break;let{isSingle:c}=e.at(-1);a=c?r[0]:r,s+=e.length}return a}function n(t,r,i){if(i.length===0)return r.push(t),!1;let a=t,o=e.t,s=!1;for(let[e,t]of i.entries()){let{index:c,items:l}=t;if(l.push(a),o=t(a,c,l),t.index+=1,o.hasNext){if(o.hasMany??!1){for(let t of o.next)if(n(t,r,i.slice(e+1)))return!0;return s}a=o.next}if(!o.hasNext)break;o.done&&(s=!0)}return o.hasNext&&r.push(a),s}function r(e){let{lazy:t,lazyArgs:n}=e,r=t(...n);return Object.assign(r,{isSingle:t.single??!1,index:0,items:[]})}function i(e){return typeof e==`string`||typeof e==`object`&&!!e&&Symbol.iterator in e}Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return t}});

package/dist/pipe.cjs

@@ -1 +1 @@
-require(`./utility-evaluators-DqJcWENu.cjs`);const e=require(`./pipe-DlFjc4Wf.cjs`);exports.pipe=e.pipe;
+const e=require(`./pipe-CB7Lufqv.cjs`);exports.pipe=e.t;

package/dist/pipe.d.cts

@@ -1,2 +1,34 @@
-import { pipe } from "./pipe-BbenIdBH.cjs";
-export { pipe };
+//#region src/pipe.d.ts
+/**
+ * Perform left-to-right function composition.
+ *
+ * @param value - The initial value.
+ * @param operations - The list of operations to apply.
+ * @signature P.pipe(data, op1, op2, op3)
+ * @example
+ *    P.pipe(
+ *      [1, 2, 3, 4],
+ *      P.map(x => x * 2),
+ *      arr => [arr[0] + arr[1], arr[2] + arr[3]],
+ *    ) // => [6, 14]
+ * @dataFirst
+ * @category Function
+ */
+declare function pipe<A, B>(value: A, op1: (input: A) => B): B;
+declare function pipe<A, B, C>(value: A, op1: (input: A) => B, op2: (input: B) => C): C;
+declare function pipe<A, B, C, D>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D): D;
+declare function pipe<A, B, C, D, E>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E): E;
+declare function pipe<A, B, C, D, E, F>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F): F;
+declare function pipe<A, B, C, D, E, F, G>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G): G;
+declare function pipe<A, B, C, D, E, F, G, H>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G, op7: (input: G) => H): H;
+declare function pipe<A, B, C, D, E, F, G, H, I>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G, op7: (input: G) => H, op8: (input: H) => I): I;
+declare function pipe<A, B, C, D, E, F, G, H, I, J>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G, op7: (input: G) => H, op8: (input: H) => I, op9: (input: I) => J): J;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K): K;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L): L;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M): M;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M, op13: (input: M) => N): N;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M, op13: (input: M) => N, op14: (input: N) => O): O;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M, op13: (input: M) => N, op14: (input: N) => O, op15: (input: O) => P): P;
+//#endregion
+export { pipe };
+//# sourceMappingURL=pipe.d.cts.map

package/dist/pipe.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipe.d.cts","names":[],"sources":["../src/pipe.ts"],"sourcesContent":[],"mappings":";;AAiCA;;;;;;AACA;;;;;;;;AAMgB,iBAPA,IAOI,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAPc,CAOd,EAAA,GAAA,EAAA,CAAA,KAAA,EAP8B,CAO9B,EAAA,GAPoC,CAOpC,CAAA,EAPwC,CAOxC;AACX,iBAPO,IAOP,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EANA,CAMA,EAAA,GAAA,EAAA,CAAA,KAAA,EALM,CAKN,EAAA,GALY,CAKZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAJM,CAIN,EAAA,GAJY,CAIZ,CAAA,EAHN,CAGM;AACM,iBAFC,IAED,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EADN,CACM,EAAA,GAAA,EAAA,CAAA,KAAA,EAAA,CAAA,EAAA,GAAM,CAAN,EAAA,GAAA,EAAA,CAAA,KAAA,EACA,CADA,EAAA,GACM,CADN,EAAA,GAAA,EAAA,CAAA,KAAA,EAEA,CAFA,EAAA,GAEM,CAFN,CAAA,EAGZ,CAHY;AAAM,iBAKL,IALK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAMZ,CANY,EAAA,GAAA,EAAA,CAAA,KAAA,EAON,CAPM,EAAA,GAOA,CAPA,EAAA,GAAA,EAAA,CAAA,KAAA,EAQN,CARM,EAAA,GAQA,CARA,EAAA,GAAA,EAAA,CAAA,KAAA,EASN,CATM,EAAA,GASA,CATA,EAAA,GAAA,EAAA,CAAA,KAAA,EAUN,CAVM,EAAA,GAUA,CAVA,CAAA,EAWlB,CAXkB;AACN,iBAYC,IAZD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAaN,CAbM,EAAA,GAAA,EAAA,CAAA,KAAA,EAcA,CAdA,EAAA,GAcM,CAdN,EAAA,GAAA,EAAA,CAAA,KAAA,EAeA,CAfA,EAAA,GAeM,CAfN,EAAA,GAAA,EAAA,CAAA,KAAA,EAgBA,CAhBA,EAAA,GAgBM,CAhBN,EAAA,GAAA,EAAA,CAAA,KAAA,EAiBA,CAjBA,EAAA,GAiBM,CAjBN,EAAA,GAAA,EAAA,CAAA,KAAA,EAkBA,CAlBA,EAAA,GAkBM,CAlBN,CAAA,EAmBZ,CAnBY;AAAM,iBAqBL,IArBK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAsBZ,CAtBY,EAAA,GAAA,EAAA,CAAA,KAAA,EAuBN,CAvBM,EAAA,GAuBA,CAvBA,EAAA,GAAA,EAAA,CAAA,KAAA,EAwBN,CAxBM,EAAA,GAwBA,CAxBA,EAAA,GAAA,EAAA,CAAA,KAAA,EAyBN,CAzBM,EAAA,GAyBA,CAzBA,EAAA,GAAA,EAAA,CAAA,KAAA,EA0BN,CA1BM,EAAA,GA0BA,CA1BA,EAAA,GAAA,EAAA,CAAA,KAAA,EA2BN,CA3BM,EAAA,GA2BA,CA3BA,EAAA,GAAA,EAAA,CAAA,KAAA,EA4BN,CA5BM,EAAA,GA4BA,CA5BA,CAAA,EA6BlB,CA7BkB;AACN,iBA8BC,IA9BD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA+BN,CA/BM,EAAA,GAAA,EAAA,CAAA,KAAA,EAgCA,CAhCA,EAAA,GAgCM,CAhCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAiCA,CAjCA,EAAA,GAiCM,CAjCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAkCA,CAlCA,EAAA,GAkCM,CAlCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAmCA,CAnCA,EAAA,GAmCM,CAnCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAoCA,CApCA,EAAA,GAoCM,CApCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAqCA,CArCA,EAAA,GAqCM,CArCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAsCA,CAtCA,EAAA,GAsCM,CAtCN,CAAA,EAuCZ,CAvCY;AAAM,iBAyCL,IAzCK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA0CZ,CA1CY,EAAA,GAAA,EAAA,CAAA,KAAA,EA2CN,CA3CM,EAAA,GA2CA,CA3CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA4CN,CA5CM,EAAA,GA4CA,CA5CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA6CN,CA7CM,EAAA,GA6CA,CA7CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA8CN,CA9CM,EAAA,GA8CA,CA9CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA+CN,CA/CM,EAAA,GA+CA,CA/CA,EAAA,GAAA,EAAA,CAAA,KAAA,EAgDN,CAhDM,EAAA,GAgDA,CAhDA,EAAA,GAAA,EAAA,CAAA,KAAA,EAiDN,CAjDM,EAAA,GAiDA,CAjDA,EAAA,GAAA,EAAA,CAAA,KAAA,EAkDN,CAlDM,EAAA,GAkDA,CAlDA,CAAA,EAmDlB,CAnDkB;AAClB,iBAoDa,IApDb,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAqDM,CArDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAsDY,CAtDZ,EAAA,GAsDkB,CAtDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EAuDY,CAvDZ,EAAA,GAuDkB,CAvDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EAwDY,CAxDZ,EAAA,GAwDkB,CAxDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EAyDY,CAzDZ,EAAA,GAyDkB,CAzDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA0DY,CA1DZ,EAAA,GA0DkB,CA1DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA2DY,CA3DZ,EAAA,GA2DkB,CA3DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA4DY,CA5DZ,EAAA,GA4DkB,CA5DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA6DY,CA7DZ,EAAA,GA6DkB,CA7DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA8DY,CA9DZ,EAAA,GA8DkB,CA9DlB,CAAA,EA+DA,CA/DA;AAAC,iBAiEY,IAjEZ,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAkEK,CAlEL,EAAA,IAAA,EAAA,CAAA,KAAA,EAmEY,CAnEZ,EAAA,GAmEkB,CAnElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAoEY,CApEZ,EAAA,GAoEkB,CApElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAqEY,CArEZ,EAAA,GAqEkB,CArElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAsEY,CAtEZ,EAAA,GAsEkB,CAtElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAuEY,CAvEZ,EAAA,GAuEkB,CAvElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAwEY,CAxEZ,EAAA,GAwEkB,CAxElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAyEY,CAzEZ,EAAA,GAyEkB,CAzElB,EAAA,IAAA,EAAA,CAAA,KAAA,EA0EY,CA1EZ,EAAA,GA0EkB,CA1ElB,EAAA,IAAA,EAAA,CAAA,KAAA,EA2EY,CA3EZ,EAAA,GA2EkB,CA3ElB,EAAA,IAAA,EAAA,CAAA,KAAA,EA4EY,CA5EZ,EAAA,GA4EkB,CA5ElB,CAAA,EA6ED,CA7EC;AAEY,iBA6EA,IA7EI,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA8EX,CA9EW,EAAA,IAAA,EAAA,CAAA,KAAA,EA+EJ,CA/EI,EAAA,GA+EE,CA/EF,EAAA,IAAA,EAAA,CAAA,KAAA,EAgFJ,CAhFI,EAAA,GAgFE,CAhFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAiFJ,CAjFI,EAAA,GAiFE,CAjFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAkFJ,CAlFI,EAAA,GAkFE,CAlFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAmFJ,CAnFI,EAAA,GAmFE,CAnFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAoFJ,CApFI,EAAA,GAoFE,CApFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAqFJ,CArFI,EAAA,GAqFE,CArFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAsFJ,CAtFI,EAAA,GAsFE,CAtFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAuFJ,CAvFI,EAAA,GAuFE,CAvFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAwFJ,CAxFI,EAAA,GAwFE,CAxFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAyFJ,CAzFI,EAAA,GAyFE,CAzFF,CAAA,EA0FjB,CA1FiB;AACX,iBA2FO,IA3FP,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA4FA,CA5FA,EAAA,IAAA,EAAA,CAAA,KAAA,EA6FO,CA7FP,EAAA,GA6Fa,CA7Fb,EAAA,IAAA,EAAA,CAAA,KAAA,EA8FO,CA9FP,EAAA,GA8Fa,CA9Fb,EAAA,IAAA,EAAA,CAAA,KAAA,EA+FO,CA/FP,EAAA,GA+Fa,CA/Fb,EAAA,IAAA,EAAA,CAAA,KAAA,EAgGO,CAhGP,EAAA,GAgGa,CAhGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAiGO,CAjGP,EAAA,GAiGa,CAjGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAkGO,CAlGP,EAAA,GAkGa,CAlGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAmGO,CAnGP,EAAA,GAmGa,CAnGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAoGO,CApGP,EAAA,GAoGa,CApGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAqGO,CArGP,EAAA,GAqGa,CArGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAsGO,CAtGP,EAAA,GAsGa,CAtGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAuGO,CAvGP,EAAA,GAuGa,CAvGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAwGO,CAxGP,EAAA,GAwGa,CAxGb,CAAA,EAyGN,CAzGM;AACM,iBA0GC,IA1GD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA2GN,CA3GM,EAAA,IAAA,EAAA,CAAA,KAAA,EA4GC,CA5GD,EAAA,GA4GO,CA5GP,EAAA,IAAA,EAAA,CAAA,KAAA,EA6GC,CA7GD,EAAA,GA6GO,CA7GP,EAAA,IAAA,EAAA,CAAA,KAAA,EA8GC,CA9GD,EAAA,GA8GO,CA9GP,EAAA,IAAA,EAAA,CAAA,KAAA,EA+GC,CA/GD,EAAA,GA+GO,CA/GP,EAAA,IAAA,EAAA,CAAA,KAAA,EAgHC,CAhHD,EAAA,GAgHO,CAhHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAiHC,CAjHD,EAAA,GAiHO,CAjHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAkHC,CAlHD,EAAA,GAkHO,CAlHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAmHC,CAnHD,EAAA,GAmHO,CAnHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAoHC,CApHD,EAAA,GAoHO,CApHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAqHC,CArHD,EAAA,GAqHO,CArHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAsHC,CAtHD,EAAA,GAsHO,CAtHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAuHC,CAvHD,EAAA,GAuHO,CAvHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAwHC,CAxHD,EAAA,GAwHO,CAxHP,CAAA,EAyHZ,CAzHY;AAAM,iBA2HL,IA3HK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA4HZ,CA5HY,EAAA,IAAA,EAAA,CAAA,KAAA,EA6HL,CA7HK,EAAA,GA6HC,CA7HD,EAAA,IAAA,EAAA,CAAA,KAAA,EA8HL,CA9HK,EAAA,GA8HC,CA9HD,EAAA,IAAA,EAAA,CAAA,KAAA,EA+HL,CA/HK,EAAA,GA+HC,CA/HD,EAAA,IAAA,EAAA,CAAA,KAAA,EAgIL,CAhIK,EAAA,GAgIC,CAhID,EAAA,IAAA,EAAA,CAAA,KAAA,EAiIL,CAjIK,EAAA,GAiIC,CAjID,EAAA,IAAA,EAAA,CAAA,KAAA,EAkIL,CAlIK,EAAA,GAkIC,CAlID,EAAA,IAAA,EAAA,CAAA,KAAA,EAmIL,CAnIK,EAAA,GAmIC,CAnID,EAAA,IAAA,EAAA,CAAA,KAAA,EAoIL,CApIK,EAAA,GAoIC,CApID,EAAA,IAAA,EAAA,CAAA,KAAA,EAqIL,CArIK,EAAA,GAqIC,CArID,EAAA,IAAA,EAAA,CAAA,KAAA,EAsIL,CAtIK,EAAA,GAsIC,CAtID,EAAA,IAAA,EAAA,CAAA,KAAA,EAuIL,CAvIK,EAAA,GAuIC,CAvID,EAAA,IAAA,EAAA,CAAA,KAAA,EAwIL,CAxIK,EAAA,GAwIC,CAxID,EAAA,IAAA,EAAA,CAAA,KAAA,EAyIL,CAzIK,EAAA,GAyIC,CAzID,EAAA,IAAA,EAAA,CAAA,KAAA,EA0IL,CA1IK,EAAA,GA0IC,CA1ID,CAAA,EA2IlB,CA3IkB;AACN,iBA4IC,IA5ID,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA6IN,CA7IM,EAAA,IAAA,EAAA,CAAA,KAAA,EA8IC,CA9ID,EAAA,GA8IO,CA9IP,EAAA,IAAA,EAAA,CAAA,KAAA,EA+IC,CA/ID,EAAA,GA+IO,CA/IP,EAAA,IAAA,EAAA,CAAA,KAAA,EAgJC,CAhJD,EAAA,GAgJO,CAhJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAiJC,CAjJD,EAAA,GAiJO,CAjJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAkJC,CAlJD,EAAA,GAkJO,CAlJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAmJC,CAnJD,EAAA,GAmJO,CAnJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAoJC,CApJD,EAAA,GAoJO,CApJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAqJC,CArJD,EAAA,GAqJO,CArJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAsJC,CAtJD,EAAA,GAsJO,CAtJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAuJC,CAvJD,EAAA,GAuJO,CAvJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAwJC,CAxJD,EAAA,GAwJO,CAxJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAyJC,CAzJD,EAAA,GAyJO,CAzJP,EAAA,IAAA,EAAA,CAAA,KAAA,EA0JC,CA1JD,EAAA,GA0JO,CA1JP,EAAA,IAAA,EAAA,CAAA,KAAA,EA2JC,CA3JD,EAAA,GA2JO,CA3JP,EAAA,IAAA,EAAA,CAAA,KAAA,EA4JC,CA5JD,EAAA,GA4JO,CA5JP,CAAA,EA6JZ,CA7JY"}

package/dist/pipe.d.ts

@@ -1,2 +1,34 @@
-import { pipe } from "./pipe-D_b9Li8m.js";
-export { pipe };
+//#region src/pipe.d.ts
+/**
+ * Perform left-to-right function composition.
+ *
+ * @param value - The initial value.
+ * @param operations - The list of operations to apply.
+ * @signature P.pipe(data, op1, op2, op3)
+ * @example
+ *    P.pipe(
+ *      [1, 2, 3, 4],
+ *      P.map(x => x * 2),
+ *      arr => [arr[0] + arr[1], arr[2] + arr[3]],
+ *    ) // => [6, 14]
+ * @dataFirst
+ * @category Function
+ */
+declare function pipe<A, B>(value: A, op1: (input: A) => B): B;
+declare function pipe<A, B, C>(value: A, op1: (input: A) => B, op2: (input: B) => C): C;
+declare function pipe<A, B, C, D>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D): D;
+declare function pipe<A, B, C, D, E>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E): E;
+declare function pipe<A, B, C, D, E, F>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F): F;
+declare function pipe<A, B, C, D, E, F, G>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G): G;
+declare function pipe<A, B, C, D, E, F, G, H>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G, op7: (input: G) => H): H;
+declare function pipe<A, B, C, D, E, F, G, H, I>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G, op7: (input: G) => H, op8: (input: H) => I): I;
+declare function pipe<A, B, C, D, E, F, G, H, I, J>(value: A, op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G, op7: (input: G) => H, op8: (input: H) => I, op9: (input: I) => J): J;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K): K;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L): L;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M): M;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M, op13: (input: M) => N): N;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M, op13: (input: M) => N, op14: (input: N) => O): O;
+declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P>(value: A, op01: (input: A) => B, op02: (input: B) => C, op03: (input: C) => D, op04: (input: D) => E, op05: (input: E) => F, op06: (input: F) => G, op07: (input: G) => H, op08: (input: H) => I, op09: (input: I) => J, op10: (input: J) => K, op11: (input: K) => L, op12: (input: L) => M, op13: (input: M) => N, op14: (input: N) => O, op15: (input: O) => P): P;
+//#endregion
+export { pipe };
+//# sourceMappingURL=pipe.d.ts.map

package/dist/pipe.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipe.d.ts","names":[],"sources":["../src/pipe.ts"],"sourcesContent":[],"mappings":";;AAiCA;;;;;;AACA;;;;;;;;AAMgB,iBAPA,IAOI,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAPc,CAOd,EAAA,GAAA,EAAA,CAAA,KAAA,EAP8B,CAO9B,EAAA,GAPoC,CAOpC,CAAA,EAPwC,CAOxC;AACX,iBAPO,IAOP,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EANA,CAMA,EAAA,GAAA,EAAA,CAAA,KAAA,EALM,CAKN,EAAA,GALY,CAKZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAJM,CAIN,EAAA,GAJY,CAIZ,CAAA,EAHN,CAGM;AACM,iBAFC,IAED,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EADN,CACM,EAAA,GAAA,EAAA,CAAA,KAAA,EAAA,CAAA,EAAA,GAAM,CAAN,EAAA,GAAA,EAAA,CAAA,KAAA,EACA,CADA,EAAA,GACM,CADN,EAAA,GAAA,EAAA,CAAA,KAAA,EAEA,CAFA,EAAA,GAEM,CAFN,CAAA,EAGZ,CAHY;AAAM,iBAKL,IALK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAMZ,CANY,EAAA,GAAA,EAAA,CAAA,KAAA,EAON,CAPM,EAAA,GAOA,CAPA,EAAA,GAAA,EAAA,CAAA,KAAA,EAQN,CARM,EAAA,GAQA,CARA,EAAA,GAAA,EAAA,CAAA,KAAA,EASN,CATM,EAAA,GASA,CATA,EAAA,GAAA,EAAA,CAAA,KAAA,EAUN,CAVM,EAAA,GAUA,CAVA,CAAA,EAWlB,CAXkB;AACN,iBAYC,IAZD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAaN,CAbM,EAAA,GAAA,EAAA,CAAA,KAAA,EAcA,CAdA,EAAA,GAcM,CAdN,EAAA,GAAA,EAAA,CAAA,KAAA,EAeA,CAfA,EAAA,GAeM,CAfN,EAAA,GAAA,EAAA,CAAA,KAAA,EAgBA,CAhBA,EAAA,GAgBM,CAhBN,EAAA,GAAA,EAAA,CAAA,KAAA,EAiBA,CAjBA,EAAA,GAiBM,CAjBN,EAAA,GAAA,EAAA,CAAA,KAAA,EAkBA,CAlBA,EAAA,GAkBM,CAlBN,CAAA,EAmBZ,CAnBY;AAAM,iBAqBL,IArBK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAsBZ,CAtBY,EAAA,GAAA,EAAA,CAAA,KAAA,EAuBN,CAvBM,EAAA,GAuBA,CAvBA,EAAA,GAAA,EAAA,CAAA,KAAA,EAwBN,CAxBM,EAAA,GAwBA,CAxBA,EAAA,GAAA,EAAA,CAAA,KAAA,EAyBN,CAzBM,EAAA,GAyBA,CAzBA,EAAA,GAAA,EAAA,CAAA,KAAA,EA0BN,CA1BM,EAAA,GA0BA,CA1BA,EAAA,GAAA,EAAA,CAAA,KAAA,EA2BN,CA3BM,EAAA,GA2BA,CA3BA,EAAA,GAAA,EAAA,CAAA,KAAA,EA4BN,CA5BM,EAAA,GA4BA,CA5BA,CAAA,EA6BlB,CA7BkB;AACN,iBA8BC,IA9BD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA+BN,CA/BM,EAAA,GAAA,EAAA,CAAA,KAAA,EAgCA,CAhCA,EAAA,GAgCM,CAhCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAiCA,CAjCA,EAAA,GAiCM,CAjCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAkCA,CAlCA,EAAA,GAkCM,CAlCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAmCA,CAnCA,EAAA,GAmCM,CAnCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAoCA,CApCA,EAAA,GAoCM,CApCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAqCA,CArCA,EAAA,GAqCM,CArCN,EAAA,GAAA,EAAA,CAAA,KAAA,EAsCA,CAtCA,EAAA,GAsCM,CAtCN,CAAA,EAuCZ,CAvCY;AAAM,iBAyCL,IAzCK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA0CZ,CA1CY,EAAA,GAAA,EAAA,CAAA,KAAA,EA2CN,CA3CM,EAAA,GA2CA,CA3CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA4CN,CA5CM,EAAA,GA4CA,CA5CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA6CN,CA7CM,EAAA,GA6CA,CA7CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA8CN,CA9CM,EAAA,GA8CA,CA9CA,EAAA,GAAA,EAAA,CAAA,KAAA,EA+CN,CA/CM,EAAA,GA+CA,CA/CA,EAAA,GAAA,EAAA,CAAA,KAAA,EAgDN,CAhDM,EAAA,GAgDA,CAhDA,EAAA,GAAA,EAAA,CAAA,KAAA,EAiDN,CAjDM,EAAA,GAiDA,CAjDA,EAAA,GAAA,EAAA,CAAA,KAAA,EAkDN,CAlDM,EAAA,GAkDA,CAlDA,CAAA,EAmDlB,CAnDkB;AAClB,iBAoDa,IApDb,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAqDM,CArDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAsDY,CAtDZ,EAAA,GAsDkB,CAtDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EAuDY,CAvDZ,EAAA,GAuDkB,CAvDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EAwDY,CAxDZ,EAAA,GAwDkB,CAxDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EAyDY,CAzDZ,EAAA,GAyDkB,CAzDlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA0DY,CA1DZ,EAAA,GA0DkB,CA1DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA2DY,CA3DZ,EAAA,GA2DkB,CA3DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA4DY,CA5DZ,EAAA,GA4DkB,CA5DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA6DY,CA7DZ,EAAA,GA6DkB,CA7DlB,EAAA,GAAA,EAAA,CAAA,KAAA,EA8DY,CA9DZ,EAAA,GA8DkB,CA9DlB,CAAA,EA+DA,CA/DA;AAAC,iBAiEY,IAjEZ,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAkEK,CAlEL,EAAA,IAAA,EAAA,CAAA,KAAA,EAmEY,CAnEZ,EAAA,GAmEkB,CAnElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAoEY,CApEZ,EAAA,GAoEkB,CApElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAqEY,CArEZ,EAAA,GAqEkB,CArElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAsEY,CAtEZ,EAAA,GAsEkB,CAtElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAuEY,CAvEZ,EAAA,GAuEkB,CAvElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAwEY,CAxEZ,EAAA,GAwEkB,CAxElB,EAAA,IAAA,EAAA,CAAA,KAAA,EAyEY,CAzEZ,EAAA,GAyEkB,CAzElB,EAAA,IAAA,EAAA,CAAA,KAAA,EA0EY,CA1EZ,EAAA,GA0EkB,CA1ElB,EAAA,IAAA,EAAA,CAAA,KAAA,EA2EY,CA3EZ,EAAA,GA2EkB,CA3ElB,EAAA,IAAA,EAAA,CAAA,KAAA,EA4EY,CA5EZ,EAAA,GA4EkB,CA5ElB,CAAA,EA6ED,CA7EC;AAEY,iBA6EA,IA7EI,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA8EX,CA9EW,EAAA,IAAA,EAAA,CAAA,KAAA,EA+EJ,CA/EI,EAAA,GA+EE,CA/EF,EAAA,IAAA,EAAA,CAAA,KAAA,EAgFJ,CAhFI,EAAA,GAgFE,CAhFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAiFJ,CAjFI,EAAA,GAiFE,CAjFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAkFJ,CAlFI,EAAA,GAkFE,CAlFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAmFJ,CAnFI,EAAA,GAmFE,CAnFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAoFJ,CApFI,EAAA,GAoFE,CApFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAqFJ,CArFI,EAAA,GAqFE,CArFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAsFJ,CAtFI,EAAA,GAsFE,CAtFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAuFJ,CAvFI,EAAA,GAuFE,CAvFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAwFJ,CAxFI,EAAA,GAwFE,CAxFF,EAAA,IAAA,EAAA,CAAA,KAAA,EAyFJ,CAzFI,EAAA,GAyFE,CAzFF,CAAA,EA0FjB,CA1FiB;AACX,iBA2FO,IA3FP,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA4FA,CA5FA,EAAA,IAAA,EAAA,CAAA,KAAA,EA6FO,CA7FP,EAAA,GA6Fa,CA7Fb,EAAA,IAAA,EAAA,CAAA,KAAA,EA8FO,CA9FP,EAAA,GA8Fa,CA9Fb,EAAA,IAAA,EAAA,CAAA,KAAA,EA+FO,CA/FP,EAAA,GA+Fa,CA/Fb,EAAA,IAAA,EAAA,CAAA,KAAA,EAgGO,CAhGP,EAAA,GAgGa,CAhGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAiGO,CAjGP,EAAA,GAiGa,CAjGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAkGO,CAlGP,EAAA,GAkGa,CAlGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAmGO,CAnGP,EAAA,GAmGa,CAnGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAoGO,CApGP,EAAA,GAoGa,CApGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAqGO,CArGP,EAAA,GAqGa,CArGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAsGO,CAtGP,EAAA,GAsGa,CAtGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAuGO,CAvGP,EAAA,GAuGa,CAvGb,EAAA,IAAA,EAAA,CAAA,KAAA,EAwGO,CAxGP,EAAA,GAwGa,CAxGb,CAAA,EAyGN,CAzGM;AACM,iBA0GC,IA1GD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA2GN,CA3GM,EAAA,IAAA,EAAA,CAAA,KAAA,EA4GC,CA5GD,EAAA,GA4GO,CA5GP,EAAA,IAAA,EAAA,CAAA,KAAA,EA6GC,CA7GD,EAAA,GA6GO,CA7GP,EAAA,IAAA,EAAA,CAAA,KAAA,EA8GC,CA9GD,EAAA,GA8GO,CA9GP,EAAA,IAAA,EAAA,CAAA,KAAA,EA+GC,CA/GD,EAAA,GA+GO,CA/GP,EAAA,IAAA,EAAA,CAAA,KAAA,EAgHC,CAhHD,EAAA,GAgHO,CAhHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAiHC,CAjHD,EAAA,GAiHO,CAjHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAkHC,CAlHD,EAAA,GAkHO,CAlHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAmHC,CAnHD,EAAA,GAmHO,CAnHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAoHC,CApHD,EAAA,GAoHO,CApHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAqHC,CArHD,EAAA,GAqHO,CArHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAsHC,CAtHD,EAAA,GAsHO,CAtHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAuHC,CAvHD,EAAA,GAuHO,CAvHP,EAAA,IAAA,EAAA,CAAA,KAAA,EAwHC,CAxHD,EAAA,GAwHO,CAxHP,CAAA,EAyHZ,CAzHY;AAAM,iBA2HL,IA3HK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA4HZ,CA5HY,EAAA,IAAA,EAAA,CAAA,KAAA,EA6HL,CA7HK,EAAA,GA6HC,CA7HD,EAAA,IAAA,EAAA,CAAA,KAAA,EA8HL,CA9HK,EAAA,GA8HC,CA9HD,EAAA,IAAA,EAAA,CAAA,KAAA,EA+HL,CA/HK,EAAA,GA+HC,CA/HD,EAAA,IAAA,EAAA,CAAA,KAAA,EAgIL,CAhIK,EAAA,GAgIC,CAhID,EAAA,IAAA,EAAA,CAAA,KAAA,EAiIL,CAjIK,EAAA,GAiIC,CAjID,EAAA,IAAA,EAAA,CAAA,KAAA,EAkIL,CAlIK,EAAA,GAkIC,CAlID,EAAA,IAAA,EAAA,CAAA,KAAA,EAmIL,CAnIK,EAAA,GAmIC,CAnID,EAAA,IAAA,EAAA,CAAA,KAAA,EAoIL,CApIK,EAAA,GAoIC,CApID,EAAA,IAAA,EAAA,CAAA,KAAA,EAqIL,CArIK,EAAA,GAqIC,CArID,EAAA,IAAA,EAAA,CAAA,KAAA,EAsIL,CAtIK,EAAA,GAsIC,CAtID,EAAA,IAAA,EAAA,CAAA,KAAA,EAuIL,CAvIK,EAAA,GAuIC,CAvID,EAAA,IAAA,EAAA,CAAA,KAAA,EAwIL,CAxIK,EAAA,GAwIC,CAxID,EAAA,IAAA,EAAA,CAAA,KAAA,EAyIL,CAzIK,EAAA,GAyIC,CAzID,EAAA,IAAA,EAAA,CAAA,KAAA,EA0IL,CA1IK,EAAA,GA0IC,CA1ID,CAAA,EA2IlB,CA3IkB;AACN,iBA4IC,IA5ID,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA6IN,CA7IM,EAAA,IAAA,EAAA,CAAA,KAAA,EA8IC,CA9ID,EAAA,GA8IO,CA9IP,EAAA,IAAA,EAAA,CAAA,KAAA,EA+IC,CA/ID,EAAA,GA+IO,CA/IP,EAAA,IAAA,EAAA,CAAA,KAAA,EAgJC,CAhJD,EAAA,GAgJO,CAhJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAiJC,CAjJD,EAAA,GAiJO,CAjJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAkJC,CAlJD,EAAA,GAkJO,CAlJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAmJC,CAnJD,EAAA,GAmJO,CAnJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAoJC,CApJD,EAAA,GAoJO,CApJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAqJC,CArJD,EAAA,GAqJO,CArJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAsJC,CAtJD,EAAA,GAsJO,CAtJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAuJC,CAvJD,EAAA,GAuJO,CAvJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAwJC,CAxJD,EAAA,GAwJO,CAxJP,EAAA,IAAA,EAAA,CAAA,KAAA,EAyJC,CAzJD,EAAA,GAyJO,CAzJP,EAAA,IAAA,EAAA,CAAA,KAAA,EA0JC,CA1JD,EAAA,GA0JO,CA1JP,EAAA,IAAA,EAAA,CAAA,KAAA,EA2JC,CA3JD,EAAA,GA2JO,CA3JP,EAAA,IAAA,EAAA,CAAA,KAAA,EA4JC,CA5JD,EAAA,GA4JO,CA5JP,CAAA,EA6JZ,CA7JY"}

package/dist/pipe.js

@@ -1 +1 @@
-import"./utility-evaluators-CnQVdcZv.js";import{pipe as e}from"./pipe-CtsfTnqv.js";export{e as pipe};
+import{t as e}from"./pipe-BGazHnZ_.js";export{e as pipe};

package/dist/piped.cjs

@@ -1 +1 @@
-require(`./utility-evaluators-DqJcWENu.cjs`),require(`./pipe-DlFjc4Wf.cjs`);const e=require(`./piped-xRnbs0j5.cjs`);exports.piped=e.piped;
+const e=require(`./pipe-CB7Lufqv.cjs`);function t(...t){return n=>e.t(n,...t)}exports.piped=t;