@vinicunca/perkakas 1.8.0 → 1.12.0

package/dist/pick-by-D6ACT8QA.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pick-by-D6ACT8QA.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":"4CA6LA,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-by-DVekF8fN.d.cts

@@ -1,68 +0,0 @@
-import { IsBoundedRecord } from "./is-bounded-record-kpsb1wQA.cjs";
-import { ToString } from "./to-string-gK5yUyfp.cjs";
-import { EnumerableStringKeyOf } from "./enumerable-string-key-of-D2OpyD6n.cjs";
-import { EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-aov5dXss.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 extends keyof T, S> = T[P] extends Extract<T[P], S> ? true : false;
-type IsPartialProp<T, P extends keyof T, S> = IsExactProp<T, P, S> extends true ? false : IsNever<Extract<T[P], S>> extends true ? S extends T[P] ? 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-DVekF8fN.d.cts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"pick-by-DVekF8fN.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,yBA3BiB,CAAA,CAAA,EAAA,CAAA,CAAA,GA2BiB,CA3BjB,SAAA,OAAA,GA4BlB,QA5BkB,CA6BhB,eA7BgB,CA6BA,CA7BA,CAAA,SAAA,IAAA,GA8BZ,UA9BY,CA8BD,CA9BC,EA8BE,CA9BF,CAAA,GA8BO,YA9BP,CA8BoB,CA9BpB,EA8BuB,CA9BvB,CAAA,GAmCZ,MAnCY,CAoCV,qBApCU,CAoCY,CApCZ,CAAA,EAqCV,OArCU,CAqCF,4BArCE,CAqC2B,CArC3B,CAAA,EAqC+B,CArC/B,CAAA,CAAA,CAAA,GAAA,KAAA;KA2CjB,UA3CuB,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAEN,MA2CE,CA3CF,IA2CO,QA3CP,CA4ClB,WA5CkB,CA4CN,CA5CM,EA4CH,CA5CG,EA4CA,CA5CA,CAAA,SAAA,IAAA,GA4CkB,CA5ClB,GAAA,KAAA,CAAA,GA6ChB,OA7CgB,CA6CR,QA7CQ,CA6CC,CA7CD,CAAA,CA6CI,CA7CJ,CAAA,EA6CQ,CA7CR,CAAA;KAkDjB,YA/C6B,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAc,MAiDxB,CAjDwB,IAiDnB,QAjDmB,CAkD5C,aAlD4C,CAkD9B,CAlD8B,EAkD3B,CAlD2B,EAkDxB,CAlDwB,CAAA,SAAA,IAAA,GAkDN,CAlDM,GAAA,KAAA,CAAA,IAmDzC,OAnDyC,CAmDjC,OAnDiC,CAmDzB,CAnDyB,CAmDvB,CAnDuB,CAAA,EAmDnB,CAnDmB,CAAA,CAAA,SAAA,IAAA,GAyD1C,CAzD0C,SAyDhC,CAzDgC,CAyD9B,CAzD8B,CAAA,GA0DxC,CA1DwC,GAAA,KAAA,GA4D1C,OA5D0C,CA4DlC,CA5DkC,CA4DhC,CA5DgC,CAAA,EA4D5B,CA5D4B,CAAA;KAkE3C,WAlE0D,CAAA,CAAA,EAAA,UAAA,MAkE3B,CAlE2B,EAAA,CAAA,CAAA,GAmE3D,CAnE2D,CAmEzD,CAnEyD,CAAA,SAmE9C,OAnE8C,CAmEtC,CAnEsC,CAmEpC,CAnEoC,CAAA,EAmEhC,CAnEgC,CAAA,GAAA,IAAA,GAAA,KAAA;KA0E1D,aA1EiD,CAAA,CAAA,EAAA,UAAA,MA0EhB,CA1EgB,EAAA,CAAA,CAAA,GA2ElD,WA3EkD,CA2EtC,CA3EsC,EA2EnC,CA3EmC,EA2EhC,CA3EgC,CAAA,SAAA,IAAA,GAAA,KAAA,GA6EhD,OA7EgD,CA6ExC,OA7EwC,CA6EhC,CA7EgC,CA6E9B,CA7E8B,CAAA,EA6E1B,CA7E0B,CAAA,CAAA,SAAA,IAAA,GA8E9C,CA9E8C,SA8EpC,CA9EoC,CA8ElC,CA9EkC,CAAA,GAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;;AAJ1C;;;;;;;;;;;;;;;;;AAkCF,iBAmFM,MAnFN,CAAA,UAAA,MAAA,EAAA,UAqFE,4BArFF,CAqF+B,CArF/B,CAAA,CAAA,CAAA,IAAA,EAuFF,CAvFE,EAAA,SAAA,EAAA,CAAA,KAAA,EAyFC,4BAzFD,CAyF8B,CAzF9B,CAAA,EAAA,GAAA,EA0FD,qBA1FC,CA0FqB,CA1FrB,CAAA,EAAA,IAAA,EA2FA,CA3FA,EAAA,GAAA,KAAA,IA4FM,CA5FN,CAAA,EA6FP,yBA7FO,CA6FmB,CA7FnB,EA6FsB,CA7FtB,CAAA;AAPN,iBAqGY,MArGZ,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAsGI,CAtGJ,EAAA,SAAA,EAAA,CAAA,KAAA,EAwGO,4BAxGP,CAwGoC,CAxGpC,CAAA,EAAA,GAAA,EAyGK,qBAzGL,CAyG2B,CAzG3B,CAAA,EAAA,IAAA,EA0GM,CA1GN,EAAA,GAAA,OAAA,CAAA,EA4GD,iBA5GC,CA4GiB,CA5GjB,CAAA;;AAAQ;;;;;;;;;;;;;;;AAmBC;;;;;;;AAQ6B,iBA0G1B,MA1G0B,CAAA,UAAA,MAAA,EAAA,UA4G9B,4BA5G8B,CA4GD,CA5GC,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EA+G/B,4BA/G+B,CA+GF,CA/GE,CAAA,EAAA,GAAA,EAgHjC,qBAhHiC,CAgHX,CAhHW,CAAA,EAAA,IAAA,EAiHhC,CAjHgC,EAAA,GAAA,KAAA,IAkH1B,CAlH0B,CAAA,EAAA,CAAA,IAAA,EAmHhC,CAnHgC,EAAA,GAmH1B,yBAnH0B,CAmHA,CAnHA,EAmHG,CAnHH,CAAA;AADb,iBAqHb,MArHa,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAuHlB,4BAvHkB,CAuHW,CAvHX,CAAA,EAAA,GAAA,EAwHpB,qBAxHoB,CAwHE,CAxHF,CAAA,EAAA,IAAA,EAyHnB,CAzHmB,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EA2HnB,CA3HmB,EAAA,GA2Hb,iBA3Ha,CA2HK,CA3HL,CAAA"}

package/dist/pipe-CjmXKJLt.d.ts

@@ -1,34 +0,0 @@
-//#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-CjmXKJLt.d.ts.map

package/dist/pipe-CjmXKJLt.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pipe-CjmXKJLt.d.ts","names":[],"sources":["../src/pipe.ts"],"sourcesContent":[],"mappings":";;AAiCA;;;;;;;AACA;;;;;;;AAIG,iBALa,IAKb,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAL+B,CAK/B,EAAA,GAAA,EAAA,CAAA,KAAA,EAL+C,CAK/C,EAAA,GALqD,CAKrD,CAAA,EALyD,CAKzD;AAAC,iBAJY,IAIZ,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAHK,CAGL,EAAA,GAAA,EAAA,CAAA,KAAA,EAFW,CAEX,EAAA,GAFiB,CAEjB,EAAA,GAAA,EAAA,CAAA,KAAA,EADW,CACX,EAAA,GADiB,CACjB,CAAA,EAAD,CAAC;AAEY,iBAAA,IAAI,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EACX,CADW,EAAA,GAAA,EAAA,CAAA,KAAA,EAEL,CAFK,EAAA,GAEC,CAFD,EAAA,GAAA,EAAA,CAAA,KAAA,EAGL,CAHK,EAAA,GAGC,CAHD,EAAA,GAAA,EAAA,CAAA,KAAA,EAIL,CAJK,EAAA,GAIC,CAJD,CAAA,EAKjB,CALiB;AAAA,iBAOJ,IAPI,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAQX,CARW,EAAA,GAAA,EAAA,CAAA,KAAA,EASL,CATK,EAAA,GASC,CATD,EAAA,GAAA,EAAA,CAAA,KAAA,EAUL,CAVK,EAAA,GAUC,CAVD,EAAA,GAAA,EAAA,CAAA,KAAA,EAWL,CAXK,EAAA,GAWC,CAXD,EAAA,GAAA,EAAA,CAAA,KAAA,EAYL,CAZK,EAAA,GAYC,CAZD,CAAA,EAajB,CAbiB;AACX,iBAcO,IAdP,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAeA,CAfA,EAAA,GAAA,EAAA,CAAA,KAAA,EAgBM,CAhBN,EAAA,GAgBY,CAhBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAiBM,CAjBN,EAAA,GAiBY,CAjBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAkBM,CAlBN,EAAA,GAkBY,CAlBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAmBM,CAnBN,EAAA,GAmBY,CAnBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAoBM,CApBN,EAAA,GAoBY,CApBZ,CAAA,EAqBN,CArBM;AACM,iBAsBC,IAtBD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAuBN,CAvBM,EAAA,GAAA,EAAA,CAAA,KAAA,EAwBA,CAxBA,EAAA,GAwBM,CAxBN,EAAA,GAAA,EAAA,CAAA,KAAA,EAyBA,CAzBA,EAAA,GAyBM,CAzBN,EAAA,GAAA,EAAA,CAAA,KAAA,EA0BA,CA1BA,EAAA,GA0BM,CA1BN,EAAA,GAAA,EAAA,CAAA,KAAA,EA2BA,CA3BA,EAAA,GA2BM,CA3BN,EAAA,GAAA,EAAA,CAAA,KAAA,EA4BA,CA5BA,EAAA,GA4BM,CA5BN,EAAA,GAAA,EAAA,CAAA,KAAA,EA6BA,CA7BA,EAAA,GA6BM,CA7BN,CAAA,EA8BZ,CA9BY;AAAM,iBAgCL,IAhCK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAiCZ,CAjCY,EAAA,GAAA,EAAA,CAAA,KAAA,EAkCN,CAlCM,EAAA,GAkCA,CAlCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAmCN,CAnCM,EAAA,GAmCA,CAnCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAoCN,CApCM,EAAA,GAoCA,CApCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAqCN,CArCM,EAAA,GAqCA,CArCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAsCN,CAtCM,EAAA,GAsCA,CAtCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAuCN,CAvCM,EAAA,GAuCA,CAvCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAwCN,CAxCM,EAAA,GAwCA,CAxCA,CAAA,EAyClB,CAzCkB;AACN,iBA0CC,IA1CD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA2CN,CA3CM,EAAA,GAAA,EAAA,CAAA,KAAA,EA4CA,CA5CA,EAAA,GA4CM,CA5CN,EAAA,GAAA,EAAA,CAAA,KAAA,EA6CA,CA7CA,EAAA,GA6CM,CA7CN,EAAA,GAAA,EAAA,CAAA,KAAA,EA8CA,CA9CA,EAAA,GA8CM,CA9CN,EAAA,GAAA,EAAA,CAAA,KAAA,EA+CA,CA/CA,EAAA,GA+CM,CA/CN,EAAA,GAAA,EAAA,CAAA,KAAA,EAgDA,CAhDA,EAAA,GAgDM,CAhDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAiDA,CAjDA,EAAA,GAiDM,CAjDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAkDA,CAlDA,EAAA,GAkDM,CAlDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAmDA,CAnDA,EAAA,GAmDM,CAnDN,CAAA,EAoDZ,CApDY;AAAM,iBAsDL,IAtDK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAuDZ,CAvDY,EAAA,GAAA,EAAA,CAAA,KAAA,EAwDN,CAxDM,EAAA,GAwDA,CAxDA,EAAA,GAAA,EAAA,CAAA,KAAA,EAyDN,CAzDM,EAAA,GAyDA,CAzDA,EAAA,GAAA,EAAA,CAAA,KAAA,EA0DN,CA1DM,EAAA,GA0DA,CA1DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA2DN,CA3DM,EAAA,GA2DA,CA3DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA4DN,CA5DM,EAAA,GA4DA,CA5DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA6DN,CA7DM,EAAA,GA6DA,CA7DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA8DN,CA9DM,EAAA,GA8DA,CA9DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA+DN,CA/DM,EAAA,GA+DA,CA/DA,EAAA,GAAA,EAAA,CAAA,KAAA,EAgEN,CAhEM,EAAA,GAgEA,CAhEA,CAAA,EAiElB,CAjEkB;AACN,iBAkEC,IAlED,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,EAmEN,CAnEM,EAAA,IAAA,EAAA,CAAA,KAAA,EAoEC,CApED,EAAA,GAoEO,CApEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAqEC,CArED,EAAA,GAqEO,CArEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAsEC,CAtED,EAAA,GAsEO,CAtEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAuEC,CAvED,EAAA,GAuEO,CAvEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAwEC,CAxED,EAAA,GAwEO,CAxEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAyEC,CAzED,EAAA,GAyEO,CAzEP,EAAA,IAAA,EAAA,CAAA,KAAA,EA0EC,CA1ED,EAAA,GA0EO,CA1EP,EAAA,IAAA,EAAA,CAAA,KAAA,EA2EC,CA3ED,EAAA,GA2EO,CA3EP,EAAA,IAAA,EAAA,CAAA,KAAA,EA4EC,CA5ED,EAAA,GA4EO,CA5EP,EAAA,IAAA,EAAA,CAAA,KAAA,EA6EC,CA7ED,EAAA,GA6EO,CA7EP,CAAA,EA8EZ,CA9EY;AAAM,iBAgFL,IAhFK,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,EAiFZ,CAjFY,EAAA,IAAA,EAAA,CAAA,KAAA,EAkFL,CAlFK,EAAA,GAkFC,CAlFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAmFL,CAnFK,EAAA,GAmFC,CAnFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAoFL,CApFK,EAAA,GAoFC,CApFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAqFL,CArFK,EAAA,GAqFC,CArFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAsFL,CAtFK,EAAA,GAsFC,CAtFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAuFL,CAvFK,EAAA,GAuFC,CAvFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAwFL,CAxFK,EAAA,GAwFC,CAxFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAyFL,CAzFK,EAAA,GAyFC,CAzFD,EAAA,IAAA,EAAA,CAAA,KAAA,EA0FL,CA1FK,EAAA,GA0FC,CA1FD,EAAA,IAAA,EAAA,CAAA,KAAA,EA2FL,CA3FK,EAAA,GA2FC,CA3FD,EAAA,IAAA,EAAA,CAAA,KAAA,EA4FL,CA5FK,EAAA,GA4FC,CA5FD,CAAA,EA6FlB,CA7FkB;AAClB,iBA8Fa,IA9Fb,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,EA+FM,CA/FN,EAAA,IAAA,EAAA,CAAA,KAAA,EAgGa,CAhGb,EAAA,GAgGmB,CAhGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAiGa,CAjGb,EAAA,GAiGmB,CAjGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAkGa,CAlGb,EAAA,GAkGmB,CAlGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAmGa,CAnGb,EAAA,GAmGmB,CAnGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAoGa,CApGb,EAAA,GAoGmB,CApGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAqGa,CArGb,EAAA,GAqGmB,CArGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAsGa,CAtGb,EAAA,GAsGmB,CAtGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAuGa,CAvGb,EAAA,GAuGmB,CAvGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAwGa,CAxGb,EAAA,GAwGmB,CAxGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAyGa,CAzGb,EAAA,GAyGmB,CAzGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EA0Ga,CA1Gb,EAAA,GA0GmB,CA1GnB,EAAA,IAAA,EAAA,CAAA,KAAA,EA2Ga,CA3Gb,EAAA,GA2GmB,CA3GnB,CAAA,EA4GA,CA5GA;AAAC,iBA8GY,IA9GZ,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,EA+GK,CA/GL,EAAA,IAAA,EAAA,CAAA,KAAA,EAgHY,CAhHZ,EAAA,GAgHkB,CAhHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAiHY,CAjHZ,EAAA,GAiHkB,CAjHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAkHY,CAlHZ,EAAA,GAkHkB,CAlHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAmHY,CAnHZ,EAAA,GAmHkB,CAnHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAoHY,CApHZ,EAAA,GAoHkB,CApHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAqHY,CArHZ,EAAA,GAqHkB,CArHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAsHY,CAtHZ,EAAA,GAsHkB,CAtHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAuHY,CAvHZ,EAAA,GAuHkB,CAvHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAwHY,CAxHZ,EAAA,GAwHkB,CAxHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAyHY,CAzHZ,EAAA,GAyHkB,CAzHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EA0HY,CA1HZ,EAAA,GA0HkB,CA1HlB,EAAA,IAAA,EAAA,CAAA,KAAA,EA2HY,CA3HZ,EAAA,GA2HkB,CA3HlB,EAAA,IAAA,EAAA,CAAA,KAAA,EA4HY,CA5HZ,EAAA,GA4HkB,CA5HlB,CAAA,EA6HD,CA7HC;AAEY,iBA6HA,IA7HI,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,EA8HX,CA9HW,EAAA,IAAA,EAAA,CAAA,KAAA,EA+HJ,CA/HI,EAAA,GA+HE,CA/HF,EAAA,IAAA,EAAA,CAAA,KAAA,EAgIJ,CAhII,EAAA,GAgIE,CAhIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAiIJ,CAjII,EAAA,GAiIE,CAjIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAkIJ,CAlII,EAAA,GAkIE,CAlIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAmIJ,CAnII,EAAA,GAmIE,CAnIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAoIJ,CApII,EAAA,GAoIE,CApIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAqIJ,CArII,EAAA,GAqIE,CArIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAsIJ,CAtII,EAAA,GAsIE,CAtIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAuIJ,CAvII,EAAA,GAuIE,CAvIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAwIJ,CAxII,EAAA,GAwIE,CAxIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAyIJ,CAzII,EAAA,GAyIE,CAzIF,EAAA,IAAA,EAAA,CAAA,KAAA,EA0IJ,CA1II,EAAA,GA0IE,CA1IF,EAAA,IAAA,EAAA,CAAA,KAAA,EA2IJ,CA3II,EAAA,GA2IE,CA3IF,EAAA,IAAA,EAAA,CAAA,KAAA,EA4IJ,CA5II,EAAA,GA4IE,CA5IF,CAAA,EA6IjB,CA7IiB;AAAA,iBA+IJ,IA/II,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,EAgJX,CAhJW,EAAA,IAAA,EAAA,CAAA,KAAA,EAiJJ,CAjJI,EAAA,GAiJE,CAjJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAkJJ,CAlJI,EAAA,GAkJE,CAlJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAmJJ,CAnJI,EAAA,GAmJE,CAnJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAoJJ,CApJI,EAAA,GAoJE,CApJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAqJJ,CArJI,EAAA,GAqJE,CArJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAsJJ,CAtJI,EAAA,GAsJE,CAtJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAuJJ,CAvJI,EAAA,GAuJE,CAvJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAwJJ,CAxJI,EAAA,GAwJE,CAxJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAyJJ,CAzJI,EAAA,GAyJE,CAzJF,EAAA,IAAA,EAAA,CAAA,KAAA,EA0JJ,CA1JI,EAAA,GA0JE,CA1JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA2JJ,CA3JI,EAAA,GA2JE,CA3JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA4JJ,CA5JI,EAAA,GA4JE,CA5JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA6JJ,CA7JI,EAAA,GA6JE,CA7JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA8JJ,CA9JI,EAAA,GA8JE,CA9JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA+JJ,CA/JI,EAAA,GA+JE,CA/JF,CAAA,EAgKjB,CAhKiB"}

package/dist/pipe-CtsfTnqv.js

@@ -1,2 +0,0 @@
-import{SKIP_ITEM as e}from"./utility-evaluators-CnQVdcZv.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 as pipe};
-//# sourceMappingURL=pipe-CtsfTnqv.js.map

package/dist/pipe-CtsfTnqv.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pipe-CtsfTnqv.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":"6DAiNA,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-DGVP9PCt.d.cts

@@ -1,34 +0,0 @@
-//#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-DGVP9PCt.d.cts.map

package/dist/pipe-DGVP9PCt.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pipe-DGVP9PCt.d.cts","names":[],"sources":["../src/pipe.ts"],"sourcesContent":[],"mappings":";;AAiCA;;;;;;;AACA;;;;;;;AAIG,iBALa,IAKb,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAL+B,CAK/B,EAAA,GAAA,EAAA,CAAA,KAAA,EAL+C,CAK/C,EAAA,GALqD,CAKrD,CAAA,EALyD,CAKzD;AAAC,iBAJY,IAIZ,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAHK,CAGL,EAAA,GAAA,EAAA,CAAA,KAAA,EAFW,CAEX,EAAA,GAFiB,CAEjB,EAAA,GAAA,EAAA,CAAA,KAAA,EADW,CACX,EAAA,GADiB,CACjB,CAAA,EAAD,CAAC;AAEY,iBAAA,IAAI,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EACX,CADW,EAAA,GAAA,EAAA,CAAA,KAAA,EAEL,CAFK,EAAA,GAEC,CAFD,EAAA,GAAA,EAAA,CAAA,KAAA,EAGL,CAHK,EAAA,GAGC,CAHD,EAAA,GAAA,EAAA,CAAA,KAAA,EAIL,CAJK,EAAA,GAIC,CAJD,CAAA,EAKjB,CALiB;AAAA,iBAOJ,IAPI,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAQX,CARW,EAAA,GAAA,EAAA,CAAA,KAAA,EASL,CATK,EAAA,GASC,CATD,EAAA,GAAA,EAAA,CAAA,KAAA,EAUL,CAVK,EAAA,GAUC,CAVD,EAAA,GAAA,EAAA,CAAA,KAAA,EAWL,CAXK,EAAA,GAWC,CAXD,EAAA,GAAA,EAAA,CAAA,KAAA,EAYL,CAZK,EAAA,GAYC,CAZD,CAAA,EAajB,CAbiB;AACX,iBAcO,IAdP,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAeA,CAfA,EAAA,GAAA,EAAA,CAAA,KAAA,EAgBM,CAhBN,EAAA,GAgBY,CAhBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAiBM,CAjBN,EAAA,GAiBY,CAjBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAkBM,CAlBN,EAAA,GAkBY,CAlBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAmBM,CAnBN,EAAA,GAmBY,CAnBZ,EAAA,GAAA,EAAA,CAAA,KAAA,EAoBM,CApBN,EAAA,GAoBY,CApBZ,CAAA,EAqBN,CArBM;AACM,iBAsBC,IAtBD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAuBN,CAvBM,EAAA,GAAA,EAAA,CAAA,KAAA,EAwBA,CAxBA,EAAA,GAwBM,CAxBN,EAAA,GAAA,EAAA,CAAA,KAAA,EAyBA,CAzBA,EAAA,GAyBM,CAzBN,EAAA,GAAA,EAAA,CAAA,KAAA,EA0BA,CA1BA,EAAA,GA0BM,CA1BN,EAAA,GAAA,EAAA,CAAA,KAAA,EA2BA,CA3BA,EAAA,GA2BM,CA3BN,EAAA,GAAA,EAAA,CAAA,KAAA,EA4BA,CA5BA,EAAA,GA4BM,CA5BN,EAAA,GAAA,EAAA,CAAA,KAAA,EA6BA,CA7BA,EAAA,GA6BM,CA7BN,CAAA,EA8BZ,CA9BY;AAAM,iBAgCL,IAhCK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAiCZ,CAjCY,EAAA,GAAA,EAAA,CAAA,KAAA,EAkCN,CAlCM,EAAA,GAkCA,CAlCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAmCN,CAnCM,EAAA,GAmCA,CAnCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAoCN,CApCM,EAAA,GAoCA,CApCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAqCN,CArCM,EAAA,GAqCA,CArCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAsCN,CAtCM,EAAA,GAsCA,CAtCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAuCN,CAvCM,EAAA,GAuCA,CAvCA,EAAA,GAAA,EAAA,CAAA,KAAA,EAwCN,CAxCM,EAAA,GAwCA,CAxCA,CAAA,EAyClB,CAzCkB;AACN,iBA0CC,IA1CD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EA2CN,CA3CM,EAAA,GAAA,EAAA,CAAA,KAAA,EA4CA,CA5CA,EAAA,GA4CM,CA5CN,EAAA,GAAA,EAAA,CAAA,KAAA,EA6CA,CA7CA,EAAA,GA6CM,CA7CN,EAAA,GAAA,EAAA,CAAA,KAAA,EA8CA,CA9CA,EAAA,GA8CM,CA9CN,EAAA,GAAA,EAAA,CAAA,KAAA,EA+CA,CA/CA,EAAA,GA+CM,CA/CN,EAAA,GAAA,EAAA,CAAA,KAAA,EAgDA,CAhDA,EAAA,GAgDM,CAhDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAiDA,CAjDA,EAAA,GAiDM,CAjDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAkDA,CAlDA,EAAA,GAkDM,CAlDN,EAAA,GAAA,EAAA,CAAA,KAAA,EAmDA,CAnDA,EAAA,GAmDM,CAnDN,CAAA,EAoDZ,CApDY;AAAM,iBAsDL,IAtDK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,KAAA,EAuDZ,CAvDY,EAAA,GAAA,EAAA,CAAA,KAAA,EAwDN,CAxDM,EAAA,GAwDA,CAxDA,EAAA,GAAA,EAAA,CAAA,KAAA,EAyDN,CAzDM,EAAA,GAyDA,CAzDA,EAAA,GAAA,EAAA,CAAA,KAAA,EA0DN,CA1DM,EAAA,GA0DA,CA1DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA2DN,CA3DM,EAAA,GA2DA,CA3DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA4DN,CA5DM,EAAA,GA4DA,CA5DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA6DN,CA7DM,EAAA,GA6DA,CA7DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA8DN,CA9DM,EAAA,GA8DA,CA9DA,EAAA,GAAA,EAAA,CAAA,KAAA,EA+DN,CA/DM,EAAA,GA+DA,CA/DA,EAAA,GAAA,EAAA,CAAA,KAAA,EAgEN,CAhEM,EAAA,GAgEA,CAhEA,CAAA,EAiElB,CAjEkB;AACN,iBAkEC,IAlED,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,EAmEN,CAnEM,EAAA,IAAA,EAAA,CAAA,KAAA,EAoEC,CApED,EAAA,GAoEO,CApEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAqEC,CArED,EAAA,GAqEO,CArEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAsEC,CAtED,EAAA,GAsEO,CAtEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAuEC,CAvED,EAAA,GAuEO,CAvEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAwEC,CAxED,EAAA,GAwEO,CAxEP,EAAA,IAAA,EAAA,CAAA,KAAA,EAyEC,CAzED,EAAA,GAyEO,CAzEP,EAAA,IAAA,EAAA,CAAA,KAAA,EA0EC,CA1ED,EAAA,GA0EO,CA1EP,EAAA,IAAA,EAAA,CAAA,KAAA,EA2EC,CA3ED,EAAA,GA2EO,CA3EP,EAAA,IAAA,EAAA,CAAA,KAAA,EA4EC,CA5ED,EAAA,GA4EO,CA5EP,EAAA,IAAA,EAAA,CAAA,KAAA,EA6EC,CA7ED,EAAA,GA6EO,CA7EP,CAAA,EA8EZ,CA9EY;AAAM,iBAgFL,IAhFK,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,EAiFZ,CAjFY,EAAA,IAAA,EAAA,CAAA,KAAA,EAkFL,CAlFK,EAAA,GAkFC,CAlFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAmFL,CAnFK,EAAA,GAmFC,CAnFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAoFL,CApFK,EAAA,GAoFC,CApFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAqFL,CArFK,EAAA,GAqFC,CArFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAsFL,CAtFK,EAAA,GAsFC,CAtFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAuFL,CAvFK,EAAA,GAuFC,CAvFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAwFL,CAxFK,EAAA,GAwFC,CAxFD,EAAA,IAAA,EAAA,CAAA,KAAA,EAyFL,CAzFK,EAAA,GAyFC,CAzFD,EAAA,IAAA,EAAA,CAAA,KAAA,EA0FL,CA1FK,EAAA,GA0FC,CA1FD,EAAA,IAAA,EAAA,CAAA,KAAA,EA2FL,CA3FK,EAAA,GA2FC,CA3FD,EAAA,IAAA,EAAA,CAAA,KAAA,EA4FL,CA5FK,EAAA,GA4FC,CA5FD,CAAA,EA6FlB,CA7FkB;AAClB,iBA8Fa,IA9Fb,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,EA+FM,CA/FN,EAAA,IAAA,EAAA,CAAA,KAAA,EAgGa,CAhGb,EAAA,GAgGmB,CAhGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAiGa,CAjGb,EAAA,GAiGmB,CAjGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAkGa,CAlGb,EAAA,GAkGmB,CAlGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAmGa,CAnGb,EAAA,GAmGmB,CAnGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAoGa,CApGb,EAAA,GAoGmB,CApGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAqGa,CArGb,EAAA,GAqGmB,CArGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAsGa,CAtGb,EAAA,GAsGmB,CAtGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAuGa,CAvGb,EAAA,GAuGmB,CAvGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAwGa,CAxGb,EAAA,GAwGmB,CAxGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EAyGa,CAzGb,EAAA,GAyGmB,CAzGnB,EAAA,IAAA,EAAA,CAAA,KAAA,EA0Ga,CA1Gb,EAAA,GA0GmB,CA1GnB,EAAA,IAAA,EAAA,CAAA,KAAA,EA2Ga,CA3Gb,EAAA,GA2GmB,CA3GnB,CAAA,EA4GA,CA5GA;AAAC,iBA8GY,IA9GZ,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,EA+GK,CA/GL,EAAA,IAAA,EAAA,CAAA,KAAA,EAgHY,CAhHZ,EAAA,GAgHkB,CAhHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAiHY,CAjHZ,EAAA,GAiHkB,CAjHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAkHY,CAlHZ,EAAA,GAkHkB,CAlHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAmHY,CAnHZ,EAAA,GAmHkB,CAnHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAoHY,CApHZ,EAAA,GAoHkB,CApHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAqHY,CArHZ,EAAA,GAqHkB,CArHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAsHY,CAtHZ,EAAA,GAsHkB,CAtHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAuHY,CAvHZ,EAAA,GAuHkB,CAvHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAwHY,CAxHZ,EAAA,GAwHkB,CAxHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EAyHY,CAzHZ,EAAA,GAyHkB,CAzHlB,EAAA,IAAA,EAAA,CAAA,KAAA,EA0HY,CA1HZ,EAAA,GA0HkB,CA1HlB,EAAA,IAAA,EAAA,CAAA,KAAA,EA2HY,CA3HZ,EAAA,GA2HkB,CA3HlB,EAAA,IAAA,EAAA,CAAA,KAAA,EA4HY,CA5HZ,EAAA,GA4HkB,CA5HlB,CAAA,EA6HD,CA7HC;AAEY,iBA6HA,IA7HI,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,EA8HX,CA9HW,EAAA,IAAA,EAAA,CAAA,KAAA,EA+HJ,CA/HI,EAAA,GA+HE,CA/HF,EAAA,IAAA,EAAA,CAAA,KAAA,EAgIJ,CAhII,EAAA,GAgIE,CAhIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAiIJ,CAjII,EAAA,GAiIE,CAjIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAkIJ,CAlII,EAAA,GAkIE,CAlIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAmIJ,CAnII,EAAA,GAmIE,CAnIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAoIJ,CApII,EAAA,GAoIE,CApIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAqIJ,CArII,EAAA,GAqIE,CArIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAsIJ,CAtII,EAAA,GAsIE,CAtIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAuIJ,CAvII,EAAA,GAuIE,CAvIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAwIJ,CAxII,EAAA,GAwIE,CAxIF,EAAA,IAAA,EAAA,CAAA,KAAA,EAyIJ,CAzII,EAAA,GAyIE,CAzIF,EAAA,IAAA,EAAA,CAAA,KAAA,EA0IJ,CA1II,EAAA,GA0IE,CA1IF,EAAA,IAAA,EAAA,CAAA,KAAA,EA2IJ,CA3II,EAAA,GA2IE,CA3IF,EAAA,IAAA,EAAA,CAAA,KAAA,EA4IJ,CA5II,EAAA,GA4IE,CA5IF,CAAA,EA6IjB,CA7IiB;AAAA,iBA+IJ,IA/II,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,EAgJX,CAhJW,EAAA,IAAA,EAAA,CAAA,KAAA,EAiJJ,CAjJI,EAAA,GAiJE,CAjJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAkJJ,CAlJI,EAAA,GAkJE,CAlJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAmJJ,CAnJI,EAAA,GAmJE,CAnJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAoJJ,CApJI,EAAA,GAoJE,CApJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAqJJ,CArJI,EAAA,GAqJE,CArJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAsJJ,CAtJI,EAAA,GAsJE,CAtJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAuJJ,CAvJI,EAAA,GAuJE,CAvJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAwJJ,CAxJI,EAAA,GAwJE,CAxJF,EAAA,IAAA,EAAA,CAAA,KAAA,EAyJJ,CAzJI,EAAA,GAyJE,CAzJF,EAAA,IAAA,EAAA,CAAA,KAAA,EA0JJ,CA1JI,EAAA,GA0JE,CA1JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA2JJ,CA3JI,EAAA,GA2JE,CA3JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA4JJ,CA5JI,EAAA,GA4JE,CA5JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA6JJ,CA7JI,EAAA,GA6JE,CA7JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA8JJ,CA9JI,EAAA,GA8JE,CA9JF,EAAA,IAAA,EAAA,CAAA,KAAA,EA+JJ,CA/JI,EAAA,GA+JE,CA/JF,CAAA,EAgKjB,CAhKiB"}

package/dist/pipe-DlFjc4Wf.cjs

@@ -1 +0,0 @@
-const e=require(`./utility-evaluators-DqJcWENu.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.SKIP_ITEM,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,`pipe`,{enumerable:!0,get:function(){return t}});

package/dist/piped-7IMVVz1U.d.ts

@@ -1,31 +0,0 @@
-//#region src/piped.d.ts
-/**
- * A dataLast version of `pipe` that could be used to provide more complex
- * computations to functions that accept a function as a param (like `map`,
- * `filter`, `groupBy`, etc.).
- *
- * The first function must be always annotated. Other functions are
- * automatically inferred.
- *
- * @signature
- *    P.piped(...ops)(data);
- * @example
- *    P.filter(
- *      [{ a: 1 }, { a: 2 }, { a: 3 }],
- *      P.piped(
- *        P.prop('a'),
- *        (x) => x % 2 === 0,
- *      ),
- *    ); // => [{ a: 2 }]
- * @category Function
- */
-declare function piped<A, B>(op1: (input: A) => B): (value: A) => B;
-declare function piped<A, B, C>(op1: (input: A) => B, op2: (input: B) => C): (value: A) => C;
-declare function piped<A, B, C, D>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D): (value: A) => D;
-declare function piped<A, B, C, D, E>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E): (value: A) => E;
-declare function piped<A, B, C, D, E, F>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F): (value: A) => F;
-declare function piped<A, B, C, D, E, F, G>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G): (value: A) => G;
-declare function piped<A, B, C, D, E, F, G, H>(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): (value: A) => H;
-//#endregion
-export { piped };
-//# sourceMappingURL=piped-7IMVVz1U.d.ts.map

package/dist/piped-7IMVVz1U.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"piped-7IMVVz1U.d.ts","names":[],"sources":["../src/piped.ts"],"sourcesContent":[],"mappings":";;AAsBA;;;;;;;AAEA;;;;;;;;;AAKA;;;AACqB,iBARL,KAQK,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EARoB,CAQpB,EAAA,GAR0B,CAQ1B,CAAA,EAAA,CAAA,KAAA,EARsC,CAQtC,EAAA,GAR4C,CAQ5C;AACN,iBAPC,KAOD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EANA,CAMA,EAAA,GANM,CAMN,EAAA,GAAA,EAAA,CAAA,KAAA,EALA,CAKA,EAAA,GALM,CAKN,CAAA,EAAA,CAAA,KAAA,EAJJ,CAII,EAAA,GAJE,CAIF;AAAM,iBAFL,KAEK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EADN,CACM,EAAA,GADA,CACA,EAAA,GAAA,EAAA,CAAA,KAAA,EAAN,CAAM,EAAA,GAAA,CAAA,EAAA,GAAA,EAAA,CAAA,KAAA,EACN,CADM,EAAA,GACA,CADA,CAAA,EAAA,CAAA,KAAA,EAEV,CAFU,EAAA,GAEJ,CAFI;AACN,iBAGC,KAHD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EAIA,CAJA,EAAA,GAIM,CAJN,EAAA,GAAA,EAAA,CAAA,KAAA,EAKA,CALA,EAAA,GAKM,CALN,EAAA,GAAA,EAAA,CAAA,KAAA,EAMA,CANA,EAAA,GAMM,CANN,EAAA,GAAA,EAAA,CAAA,KAAA,EAOA,CAPA,EAAA,GAOM,CAPN,CAAA,EAAA,CAAA,KAAA,EAQJ,CARI,EAAA,GAQE,CARF;AAAM,iBAUL,KAVK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EAWN,CAXM,EAAA,GAWA,CAXA,EAAA,GAAA,EAAA,CAAA,KAAA,EAYN,CAZM,EAAA,GAYA,CAZA,EAAA,GAAA,EAAA,CAAA,KAAA,EAaN,CAbM,EAAA,GAaA,CAbA,EAAA,GAAA,EAAA,CAAA,KAAA,EAcN,CAdM,EAAA,GAcA,CAdA,EAAA,GAAA,EAAA,CAAA,KAAA,EAeN,CAfM,EAAA,GAeA,CAfA,CAAA,EAAA,CAAA,KAAA,EAgBV,CAhBU,EAAA,GAgBJ,CAhBI;AACV,iBAiBK,KAjBL,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EAkBI,CAlBJ,EAAA,GAkBU,CAlBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAmBI,CAnBJ,EAAA,GAmBU,CAnBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAoBI,CApBJ,EAAA,GAoBU,CApBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAqBI,CArBJ,EAAA,GAqBU,CArBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAsBI,CAtBJ,EAAA,GAsBU,CAtBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAuBI,CAvBJ,EAAA,GAuBU,CAvBV,CAAA,EAAA,CAAA,KAAA,EAwBA,CAxBA,EAAA,GAwBM,CAxBN;AAAM,iBA0BD,KA1BC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EA2BF,CA3BE,EAAA,GA2BI,CA3BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA4BF,CA5BE,EAAA,GA4BI,CA5BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA6BF,CA7BE,EAAA,GA6BI,CA7BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA8BF,CA9BE,EAAA,GA8BI,CA9BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA+BF,CA/BE,EAAA,GA+BI,CA/BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EAgCF,CAhCE,EAAA,GAgCI,CAhCJ,EAAA,GAAA,EAAA,CAAA,KAAA,EAiCF,CAjCE,EAAA,GAiCI,CAjCJ,CAAA,EAAA,CAAA,KAAA,EAkCN,CAlCM,EAAA,GAkCA,CAlCA"}

package/dist/piped-Bj0X7cQT.js

@@ -1,2 +0,0 @@
-import{pipe as e}from"./pipe-CtsfTnqv.js";function t(...t){return n=>e(n,...t)}export{t as piped};
-//# sourceMappingURL=piped-Bj0X7cQT.js.map

package/dist/piped-Bj0X7cQT.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"piped-Bj0X7cQT.js","names":[],"sources":["../src/piped.ts"],"sourcesContent":["import { pipe } from './pipe';\n\n/**\n * A dataLast version of `pipe` that could be used to provide more complex\n * computations to functions that accept a function as a param (like `map`,\n * `filter`, `groupBy`, etc.).\n *\n * The first function must be always annotated. Other functions are\n * automatically inferred.\n *\n * @signature\n *    P.piped(...ops)(data);\n * @example\n *    P.filter(\n *      [{ a: 1 }, { a: 2 }, { a: 3 }],\n *      P.piped(\n *        P.prop('a'),\n *        (x) => x % 2 === 0,\n *      ),\n *    ); // => [{ a: 2 }]\n * @category Function\n */\nexport function piped<A, B>(op1: (input: A) => B): (value: A) => B;\n\nexport function piped<A, B, C>(\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n): (value: A) => C;\n\nexport function piped<A, B, C, D>(\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n): (value: A) => D;\n\nexport function piped<A, B, C, D, E>(\n  op1: (input: A) => B,\n  op2: (input: B) => C,\n  op3: (input: C) => D,\n  op4: (input: D) => E,\n): (value: A) => E;\n\nexport function piped<A, B, C, D, E, F>(\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): (value: A) => F;\n\nexport function piped<A, B, C, D, E, F, G>(\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): (value: A) => G;\n\nexport function piped<A, B, C, D, E, F, G, H>(\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): (value: A) => H;\n\nexport function piped(\n  ...operations: ReadonlyArray<(input: unknown) => unknown>\n) {\n  return (value: unknown): unknown =>\n    pipe(\n      value,\n      // @ts-expect-error [ts2556] - We can't avoid this error because pipe is typed for users and this is an internal function\n      ...operations,\n    );\n}\n"],"mappings":"0CAqEA,SAAgB,EACd,GAAG,EACH,CACA,MAAQ,IACN,EACE,EAEA,GAAG,EACJ"}

package/dist/piped-Brc8b_TJ.d.cts

@@ -1,31 +0,0 @@
-//#region src/piped.d.ts
-/**
- * A dataLast version of `pipe` that could be used to provide more complex
- * computations to functions that accept a function as a param (like `map`,
- * `filter`, `groupBy`, etc.).
- *
- * The first function must be always annotated. Other functions are
- * automatically inferred.
- *
- * @signature
- *    P.piped(...ops)(data);
- * @example
- *    P.filter(
- *      [{ a: 1 }, { a: 2 }, { a: 3 }],
- *      P.piped(
- *        P.prop('a'),
- *        (x) => x % 2 === 0,
- *      ),
- *    ); // => [{ a: 2 }]
- * @category Function
- */
-declare function piped<A, B>(op1: (input: A) => B): (value: A) => B;
-declare function piped<A, B, C>(op1: (input: A) => B, op2: (input: B) => C): (value: A) => C;
-declare function piped<A, B, C, D>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D): (value: A) => D;
-declare function piped<A, B, C, D, E>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E): (value: A) => E;
-declare function piped<A, B, C, D, E, F>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F): (value: A) => F;
-declare function piped<A, B, C, D, E, F, G>(op1: (input: A) => B, op2: (input: B) => C, op3: (input: C) => D, op4: (input: D) => E, op5: (input: E) => F, op6: (input: F) => G): (value: A) => G;
-declare function piped<A, B, C, D, E, F, G, H>(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): (value: A) => H;
-//#endregion
-export { piped };
-//# sourceMappingURL=piped-Brc8b_TJ.d.cts.map

package/dist/piped-Brc8b_TJ.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"piped-Brc8b_TJ.d.cts","names":[],"sources":["../src/piped.ts"],"sourcesContent":[],"mappings":";;AAsBA;;;;;;;AAEA;;;;;;;;;AAKA;;;AACqB,iBARL,KAQK,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EARoB,CAQpB,EAAA,GAR0B,CAQ1B,CAAA,EAAA,CAAA,KAAA,EARsC,CAQtC,EAAA,GAR4C,CAQ5C;AACN,iBAPC,KAOD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EANA,CAMA,EAAA,GANM,CAMN,EAAA,GAAA,EAAA,CAAA,KAAA,EALA,CAKA,EAAA,GALM,CAKN,CAAA,EAAA,CAAA,KAAA,EAJJ,CAII,EAAA,GAJE,CAIF;AAAM,iBAFL,KAEK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EADN,CACM,EAAA,GADA,CACA,EAAA,GAAA,EAAA,CAAA,KAAA,EAAN,CAAM,EAAA,GAAA,CAAA,EAAA,GAAA,EAAA,CAAA,KAAA,EACN,CADM,EAAA,GACA,CADA,CAAA,EAAA,CAAA,KAAA,EAEV,CAFU,EAAA,GAEJ,CAFI;AACN,iBAGC,KAHD,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EAIA,CAJA,EAAA,GAIM,CAJN,EAAA,GAAA,EAAA,CAAA,KAAA,EAKA,CALA,EAAA,GAKM,CALN,EAAA,GAAA,EAAA,CAAA,KAAA,EAMA,CANA,EAAA,GAMM,CANN,EAAA,GAAA,EAAA,CAAA,KAAA,EAOA,CAPA,EAAA,GAOM,CAPN,CAAA,EAAA,CAAA,KAAA,EAQJ,CARI,EAAA,GAQE,CARF;AAAM,iBAUL,KAVK,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EAWN,CAXM,EAAA,GAWA,CAXA,EAAA,GAAA,EAAA,CAAA,KAAA,EAYN,CAZM,EAAA,GAYA,CAZA,EAAA,GAAA,EAAA,CAAA,KAAA,EAaN,CAbM,EAAA,GAaA,CAbA,EAAA,GAAA,EAAA,CAAA,KAAA,EAcN,CAdM,EAAA,GAcA,CAdA,EAAA,GAAA,EAAA,CAAA,KAAA,EAeN,CAfM,EAAA,GAeA,CAfA,CAAA,EAAA,CAAA,KAAA,EAgBV,CAhBU,EAAA,GAgBJ,CAhBI;AACV,iBAiBK,KAjBL,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EAkBI,CAlBJ,EAAA,GAkBU,CAlBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAmBI,CAnBJ,EAAA,GAmBU,CAnBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAoBI,CApBJ,EAAA,GAoBU,CApBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAqBI,CArBJ,EAAA,GAqBU,CArBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAsBI,CAtBJ,EAAA,GAsBU,CAtBV,EAAA,GAAA,EAAA,CAAA,KAAA,EAuBI,CAvBJ,EAAA,GAuBU,CAvBV,CAAA,EAAA,CAAA,KAAA,EAwBA,CAxBA,EAAA,GAwBM,CAxBN;AAAM,iBA0BD,KA1BC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,GAAA,EAAA,CAAA,KAAA,EA2BF,CA3BE,EAAA,GA2BI,CA3BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA4BF,CA5BE,EAAA,GA4BI,CA5BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA6BF,CA7BE,EAAA,GA6BI,CA7BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA8BF,CA9BE,EAAA,GA8BI,CA9BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EA+BF,CA/BE,EAAA,GA+BI,CA/BJ,EAAA,GAAA,EAAA,CAAA,KAAA,EAgCF,CAhCE,EAAA,GAgCI,CAhCJ,EAAA,GAAA,EAAA,CAAA,KAAA,EAiCF,CAjCE,EAAA,GAiCI,CAjCJ,CAAA,EAAA,CAAA,KAAA,EAkCN,CAlCM,EAAA,GAkCA,CAlCA"}

package/dist/piped-Dk4o0Pdm.cjs

@@ -1 +0,0 @@
-const e=require(`./pipe-DlFjc4Wf.cjs`);function t(...t){return n=>e.pipe(n,...t)}Object.defineProperty(exports,`piped`,{enumerable:!0,get:function(){return t}});

package/dist/product-BHRT4Aan.cjs

@@ -1 +0,0 @@
-const e=require(`./curry-BPVIsvo3.cjs`);function t(...t){return e.curry(n,t)}function n(e){let t=typeof e[0]==`bigint`?1n:1;for(let n of e)t*=n;return t}Object.defineProperty(exports,`product`,{enumerable:!0,get:function(){return t}});

package/dist/product-D3OVy5Sj.js

@@ -1,2 +0,0 @@
-import{curry as e}from"./curry-CzZjDrpv.js";function t(...t){return e(n,t)}function n(e){let t=typeof e[0]==`bigint`?1n:1;for(let n of e)t*=n;return t}export{t as product};
-//# sourceMappingURL=product-D3OVy5Sj.js.map

package/dist/product-D3OVy5Sj.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"product-D3OVy5Sj.js","names":[],"sources":["../src/product.ts"],"sourcesContent":["import type { IterableContainer } from './internal/types/iterable-container';\n\nimport { curry } from './curry';\n\ntype Product<T extends IterableContainer<bigint> | IterableContainer<number>>\n  // Empty arrays would always result in a product of (a non-bigint) 1\n  = T extends readonly []\n    ? 1\n    // Non-empty bigint arrays will always result in a bigint product.\n    : T extends readonly [bigint, ...ReadonlyArray<unknown>]\n      ? bigint\n      // But an empty bigint array would result in a non-bigint 1.\n      : T[number] extends bigint\n        ? 1 | bigint\n        // Non-bigint arrays are always handled correctly.\n        : number;\n\n/**\n * Compute the product of the numbers in the array, or return 1 for an empty\n * array.\n *\n * Works for both `number` and `bigint` arrays, but not arrays that contain both\n * types.\n *\n * IMPORTANT: The result for empty arrays would be 1 (`number`) regardless of\n * the type of the array; to avoid adding this to the return type for cases\n * where the array is known to be non-empty you can use `hasAtLeast` or\n * `isEmpty` to guard against this case.\n *\n * @param data - The array of numbers.\n * @signature\n *   P.product(data);\n * @example\n *   P.product([1, 2, 3]); // => 6\n *   P.product([1n, 2n, 3n]); // => 6n\n *   P.product([]); // => 1\n * @dataFirst\n * @category Number\n */\nexport function product<\n  T extends IterableContainer<bigint> | IterableContainer<number>,\n>(data: T): Product<T>;\n\n/**\n * Compute the product of the numbers in the array, or return 1 for an empty\n * array.\n *\n * Works for both `number` and `bigint` arrays, but not arrays that contain both\n * types.\n *\n * IMPORTANT: The result for empty arrays would be 1 (`number`) regardless of\n * the type of the array; to avoid adding this to the return type for cases\n * where the array is known to be non-empty you can use `hasAtLeast` or\n * `isEmpty` to guard against this case.\n *\n * @signature\n *   P.product()(data);\n * @example\n *   P.pipe([1, 2, 3], P.product()); // => 6\n *   P.pipe([1n, 2n, 3n], R.product()); // => 6n\n *   P.pipe([], P.product()); // => 1\n * @dataLast\n * @category Number\n */\nexport function product(): <\n  T extends IterableContainer<bigint> | IterableContainer<number>,\n>(\n  data: T,\n) => Product<T>;\n\nexport function product(...args: ReadonlyArray<unknown>): unknown {\n  return curry(productImplementation, args);\n}\n\nfunction productImplementation<\n  T extends IterableContainer<bigint> | IterableContainer<number>,\n>(data: T): T[number] {\n  let out = typeof data[0] === 'bigint' ? 1n : 1;\n  for (const value of data) {\n    // @ts-expect-error [ts2365] -- Typescript can't infer that all elements will be a number of the same type.\n    out *= value;\n  }\n  return out;\n}\n"],"mappings":"4CAsEA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAK,CAG3C,SAAS,EAEP,EAAoB,CACpB,IAAI,EAAM,OAAO,EAAK,IAAO,SAAW,GAAK,EAC7C,IAAK,IAAM,KAAS,EAElB,GAAO,EAET,OAAO"}

package/dist/product-DKaFnVZj.d.cts

@@ -1,52 +0,0 @@
-import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
-
-//#region src/product.d.ts
-type Product<T extends IterableContainer<bigint> | IterableContainer<number>> = T extends readonly [] ? 1 : T extends readonly [bigint, ...ReadonlyArray<unknown>] ? bigint : T[number] extends bigint ? 1 | bigint : number;
-/**
- * Compute the product of the numbers in the array, or return 1 for an empty
- * array.
- *
- * Works for both `number` and `bigint` arrays, but not arrays that contain both
- * types.
- *
- * IMPORTANT: The result for empty arrays would be 1 (`number`) regardless of
- * the type of the array; to avoid adding this to the return type for cases
- * where the array is known to be non-empty you can use `hasAtLeast` or
- * `isEmpty` to guard against this case.
- *
- * @param data - The array of numbers.
- * @signature
- *   P.product(data);
- * @example
- *   P.product([1, 2, 3]); // => 6
- *   P.product([1n, 2n, 3n]); // => 6n
- *   P.product([]); // => 1
- * @dataFirst
- * @category Number
- */
-declare function product<T extends IterableContainer<bigint> | IterableContainer<number>>(data: T): Product<T>;
-/**
- * Compute the product of the numbers in the array, or return 1 for an empty
- * array.
- *
- * Works for both `number` and `bigint` arrays, but not arrays that contain both
- * types.
- *
- * IMPORTANT: The result for empty arrays would be 1 (`number`) regardless of
- * the type of the array; to avoid adding this to the return type for cases
- * where the array is known to be non-empty you can use `hasAtLeast` or
- * `isEmpty` to guard against this case.
- *
- * @signature
- *   P.product()(data);
- * @example
- *   P.pipe([1, 2, 3], P.product()); // => 6
- *   P.pipe([1n, 2n, 3n], R.product()); // => 6n
- *   P.pipe([], P.product()); // => 1
- * @dataLast
- * @category Number
- */
-declare function product(): <T extends IterableContainer<bigint> | IterableContainer<number>>(data: T) => Product<T>;
-//#endregion
-export { product };
-//# sourceMappingURL=product-DKaFnVZj.d.cts.map

package/dist/product-DKaFnVZj.d.cts.map

@@ -1 +0,0 @@
-{"version":3,"file":"product-DKaFnVZj.d.cts","names":[],"sources":["../src/product.ts"],"sourcesContent":[],"mappings":";;;KAIK,kBAAkB,4BAA4B,6BAE/C,4BAGE,+BAA+B,mCAG7B;;AAZqE;;;;;;;;;AAuC7E;;;;;;;;AAyBA;;;;AAGQ,iBA5BQ,OA4BR,CAAA,UA3BI,iBA2BJ,CAAA,MAAA,CAAA,GA3BgC,iBA2BhC,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EA1BA,CA0BA,CAAA,EA1BI,OA0BJ,CA1BY,CA0BZ,CAAA;;;;;;;;;;;;;;;;;;;;;;iBAHQ,OAAA,CAAA,cACJ,4BAA4B,iCAEhC,MACH,QAAQ"}

package/dist/product-DSfUTpxQ.d.ts

@@ -1,52 +0,0 @@
-import { IterableContainer } from "./iterable-container-wtkYslN_.js";
-
-//#region src/product.d.ts
-type Product<T extends IterableContainer<bigint> | IterableContainer<number>> = T extends readonly [] ? 1 : T extends readonly [bigint, ...ReadonlyArray<unknown>] ? bigint : T[number] extends bigint ? 1 | bigint : number;
-/**
- * Compute the product of the numbers in the array, or return 1 for an empty
- * array.
- *
- * Works for both `number` and `bigint` arrays, but not arrays that contain both
- * types.
- *
- * IMPORTANT: The result for empty arrays would be 1 (`number`) regardless of
- * the type of the array; to avoid adding this to the return type for cases
- * where the array is known to be non-empty you can use `hasAtLeast` or
- * `isEmpty` to guard against this case.
- *
- * @param data - The array of numbers.
- * @signature
- *   P.product(data);
- * @example
- *   P.product([1, 2, 3]); // => 6
- *   P.product([1n, 2n, 3n]); // => 6n
- *   P.product([]); // => 1
- * @dataFirst
- * @category Number
- */
-declare function product<T extends IterableContainer<bigint> | IterableContainer<number>>(data: T): Product<T>;
-/**
- * Compute the product of the numbers in the array, or return 1 for an empty
- * array.
- *
- * Works for both `number` and `bigint` arrays, but not arrays that contain both
- * types.
- *
- * IMPORTANT: The result for empty arrays would be 1 (`number`) regardless of
- * the type of the array; to avoid adding this to the return type for cases
- * where the array is known to be non-empty you can use `hasAtLeast` or
- * `isEmpty` to guard against this case.
- *
- * @signature
- *   P.product()(data);
- * @example
- *   P.pipe([1, 2, 3], P.product()); // => 6
- *   P.pipe([1n, 2n, 3n], R.product()); // => 6n
- *   P.pipe([], P.product()); // => 1
- * @dataLast
- * @category Number
- */
-declare function product(): <T extends IterableContainer<bigint> | IterableContainer<number>>(data: T) => Product<T>;
-//#endregion
-export { product };
-//# sourceMappingURL=product-DSfUTpxQ.d.ts.map

package/dist/product-DSfUTpxQ.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"product-DSfUTpxQ.d.ts","names":[],"sources":["../src/product.ts"],"sourcesContent":[],"mappings":";;;KAIK,kBAAkB,4BAA4B,6BAE/C,4BAGE,+BAA+B,mCAG7B;;AAZqE;;;;;;;;;AAuC7E;;;;;;;;AAyBA;;;;AAGQ,iBA5BQ,OA4BR,CAAA,UA3BI,iBA2BJ,CAAA,MAAA,CAAA,GA3BgC,iBA2BhC,CAAA,MAAA,CAAA,CAAA,CAAA,IAAA,EA1BA,CA0BA,CAAA,EA1BI,OA0BJ,CA1BY,CA0BZ,CAAA;;;;;;;;;;;;;;;;;;;;;;iBAHQ,OAAA,CAAA,cACJ,4BAA4B,iCAEhC,MACH,QAAQ"}

package/dist/prop-1ZO514Bp.d.cts

@@ -1,88 +0,0 @@
-import { IntRangeInclusive } from "./int-range-inclusive-DZG3R2Xl.cjs";
-import { IterableContainer } from "./iterable-container-V5sa0V_H.cjs";
-import { TupleParts } from "./tuple-parts-BIyABPYv.cjs";
-import { ClampedIntegerSubtract } from "./clamped-integer-subtract-DId0tRjp.cjs";
-import { ArrayIndices, IsNumericLiteral, KeysOfUnion } from "type-fest";
-
-//#region src/internal/types/array-at.d.ts
-
-/**
- * The type for the I'th element in the tuple T. This type corrects some of the
- * issues with TypeScript's built-in tuple accessor inference `T[I]` for arrays
- * and tuples with fixed suffixes, and for primitive indices where we don't know
- * if the index is out of bounds.
- */
-type ArrayAt<T extends IterableContainer, I extends keyof T> = IsNumericLiteral<I> extends true ? I extends unknown ? [...TupleParts<T>['required'], ...TupleParts<T>['optional']] extends infer Prefix extends ReadonlyArray<unknown> ? HasIndex<Prefix, I> extends true ? T[I] : TupleParts<T>['item'] | (ClampedIntegerSubtract<I, Prefix['length']> extends infer SuffixIndex extends number ? HasIndex<TupleParts<T>['suffix'], SuffixIndex> extends true ? TupleParts<T>['suffix'][IntRangeInclusive<0, SuffixIndex>] : TupleParts<T>['suffix'][number] | undefined : never) : never : never : T[number] | undefined;
-type HasIndex<T extends ReadonlyArray<unknown>, I> = I extends ArrayIndices<T> ? true : false;
-//#endregion
-//#region src/internal/types/no-infer.d.ts
-type NoInfer<T> = T extends infer U ? U : never;
-//#endregion
-//#region src/prop.d.ts
-type KeysDeep<T, Path extends ReadonlyArray<unknown>> = KeysOfUnion<PropDeep<T, Path>>;
-type PropDeep<T, Path extends ReadonlyArray<unknown>> = Path extends readonly [infer Key, ...infer Rest] ? PropDeep<Prop<T, Key>, Rest> : T;
-type Prop<T, Key> = T extends unknown ? Key extends keyof T ? T extends ReadonlyArray<unknown> ? ArrayAt<T, Key> : T[Key] : undefined : never;
-type NonPropertyKey = object | null | undefined;
-/**
- * Gets the value of the given property from an object. Nested properties can
- * be accessed by providing a variadic array of keys that define the path from
- * the root to the desired property. Arrays can be accessed by using numeric
- * keys. Unions and optional properties are handled gracefully by returning
- * `undefined` early for any non-existing property on the path. Paths are
- * validated against the object type to provide stronger type safety, better
- * compile-time errors, and to enable autocompletion in IDEs.
- *
- * @param data - The object or array to access.
- * @param key - The key(s) for the property to extract.
- * @signature
- *   P.prop(data, ...keys);
- * @example
- *   P.prop({ foo: { bar: 'baz' } }, 'foo'); //=> { bar: 'baz' }
- *   P.prop({ foo: { bar: 'baz' } }, 'foo', 'bar'); //=> 'baz'
- *   P.prop(["cat", "dog"], 1); //=> 'dog'
- * @dataFirst
- * @category Object
- */
-declare function prop<T extends NonPropertyKey, Key extends KeysDeep<T, []>>(data: T, key: Key): NoInfer<Prop<T, Key>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>>(data: T, key0: Key0, key1: Key1): NoInfer<PropDeep<T, [Key0, Key1]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>>(data: T, key0: Key0, key1: Key1, key2: Key2): NoInfer<PropDeep<T, [Key0, Key1, Key2]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>, Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6, key7: Key7): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>, Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>, Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6, key7: Key7, key8: Key8): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>, Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>, Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>, Key9 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]>, AdditionalKeys extends ReadonlyArray<PropertyKey> = []>(data: T, key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6, key7: Key7, key8: Key8, key9: Key9, ...additionalKeys: AdditionalKeys): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8, Key9, ...AdditionalKeys]>>;
-/**
- * Gets the value of the given property from an object. Nested properties can
- * be accessed by providing a variadic array of keys that define the path from
- * the root to the desired property. Arrays can be accessed by using numeric
- * keys. Unions and optional properties are handled gracefully by returning
- * `undefined` early for any non-existing property on the path. Paths are
- * validated against the object type to provide stronger type safety, better
- * compile-time errors, and to enable autocompletion in IDEs.
- *
- * @param key - The key(s) for the property to extract.
- * @signature
- *   P.prop(...keys)(data);
- * @example
- *   P.pipe({ foo: { bar: 'baz' } }, P.prop('foo')); //=> { bar: 'baz' }
- *   P.pipe({ foo: { bar: 'baz' } }, P.prop('foo', 'bar')); //=> 'baz'
- *   P.pipe(["cat", "dog"], P.prop(1)); //=> 'dog'
- * @dataLast
- * @category Object
- */
-declare function prop<T extends NonPropertyKey, Key extends KeysOfUnion<T>>(key: Key): (data: T) => NoInfer<Prop<T, Key>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>>(key0: Key0, key1: Key1): (data: T) => NoInfer<PropDeep<T, [Key0, Key1]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>>(key0: Key0, key1: Key1, key2: Key2): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>>(key0: Key0, key1: Key1, key2: Key2, key3: Key3): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>>(key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>>(key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>>(key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>, Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>>(key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6, key7: Key7): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>, Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>, Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>>(key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6, key7: Key7, key8: Key8): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]>>;
-declare function prop<T extends NonPropertyKey, Key0 extends KeysDeep<T, []>, Key1 extends KeysDeep<T, [Key0]>, Key2 extends KeysDeep<T, [Key0, Key1]>, Key3 extends KeysDeep<T, [Key0, Key1, Key2]>, Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>, Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>, Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>, Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>, Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>, Key9 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]>, AdditionalKeys extends ReadonlyArray<PropertyKey> = []>(key0: Key0, key1: Key1, key2: Key2, key3: Key3, key4: Key4, key5: Key5, key6: Key6, key7: Key7, key8: Key8, key9: Key9, ...additionalKeys: AdditionalKeys): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8, Key9, ...AdditionalKeys]>>;
-declare function prop<K extends PropertyKey>(key: K): <T extends Partial<Record<K, unknown>>>(data: T) => T[K];
-//#endregion
-export { prop };
-//# sourceMappingURL=prop-1ZO514Bp.d.cts.map