@vinicunca/perkakas 1.7.1 → 1.8.0

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,2 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,31 @@
+//#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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1 @@
+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/piped.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2CBHJMXWcjs = require('./chunk-2CBHJMXW.cjs');require('./chunk-BO34ARLY.cjs');require('./chunk-N5JE6642.cjs');require('./chunk-MBGSSEZN.cjs');exports.piped = _chunk2CBHJMXWcjs.a;
+require(`./utility-evaluators-DqJcWENu.cjs`),require(`./pipe-DlFjc4Wf.cjs`);const e=require(`./piped-Dk4o0Pdm.cjs`);exports.piped=e.piped;

package/dist/piped.d.cts

@@ -1,29 +1,2 @@
-/**
- * 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;
-
-export { piped };
+import { piped } from "./piped-Brc8b_TJ.cjs";
+export { piped };

package/dist/piped.d.ts

@@ -1,29 +1,2 @@
-/**
- * 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;
-
-export { piped };
+import { piped } from "./piped-7IMVVz1U.js";
+export { piped };

package/dist/piped.js

@@ -1 +1 @@
-import{a}from"./chunk-N2NQKHB3.js";import"./chunk-QHBVEZSR.js";import"./chunk-EPU4K3DD.js";import"./chunk-EK7ODJWE.js";export{a as piped};
+import"./utility-evaluators-CnQVdcZv.js";import"./pipe-CtsfTnqv.js";import{piped as e}from"./piped-Bj0X7cQT.js";export{e as piped};

package/dist/product-BHRT4Aan.cjs

@@ -0,0 +1 @@
+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

@@ -0,0 +1,2 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,52 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,52 @@
+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

@@ -0,0 +1 @@
+{"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/product.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXY7YER5Ncjs = require('./chunk-XY7YER5N.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.product = _chunkXY7YER5Ncjs.a;
+require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./product-BHRT4Aan.cjs`);exports.product=e.product;

package/dist/product.d.cts

@@ -1,50 +1,3 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-
-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>;
-
-export { product };
+import "./iterable-container-V5sa0V_H.cjs";
+import { product } from "./product-DKaFnVZj.cjs";
+export { product };

package/dist/product.d.ts

@@ -1,50 +1,3 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-
-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>;
-
-export { product };
+import "./iterable-container-wtkYslN_.js";
+import { product } from "./product-DSfUTpxQ.js";
+export { product };

package/dist/product.js

@@ -1 +1 @@
-import{a}from"./chunk-5T6DY3SA.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as product};
+import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{product as e}from"./product-D3OVy5Sj.js";export{e as product};

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

@@ -0,0 +1,88 @@
+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

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

@@ -0,0 +1 @@
+{"version":3,"file":"prop-1ZO514Bp.d.cts","names":[],"sources":["../src/internal/types/array-at.ts","../src/internal/types/no-infer.ts","../src/prop.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;AAYA;;;;AAGqB,KAHT,OAGS,CAAA,UAHS,iBAGT,EAAA,UAAA,MAH4C,CAG5C,CAAA,GAAjB,gBAAiB,CAAA,CAAA,CAAA,SAAA,IAAA,GAEf,CAFe,SAAA,OAAA,GAAA,IAKR,UALT,CAKoB,CALpB,CAAA,CAAA,UAAA,CAAA,KAMS,UAJP,CAIkB,CAJlB,CAAA,CAAA,UAAA,CAAA,UAGkB,KAAA,gBAEe,aAFf,CAAA,OAAA,CAAA,GAIZ,QAJY,CAIH,MAJG,EAIK,CAJL,CAAA,SAAA,IAAA,GAKV,CALU,CAKR,CALQ,CAAA,GAOR,UAPQ,CAOG,CAPH,CAAA,CAAA,MAAA,CAAA,GAAA,CAUP,sBAVO,CAWN,CAXM,EAYN,MAZM,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,qBAAA,MAAA,GAyBN,QAzBM,CAyBG,UAzBH,CAyBc,CAzBd,CAAA,CAAA,QAAA,CAAA,EAyB4B,WAzB5B,CAAA,SAAA,IAAA,GA0BJ,UA1BI,CA0BO,CA1BP,CAAA,CAAA,QAAA,CAAA,CA0BoB,iBA1BpB,CAAA,CAAA,EA0ByC,WA1BzC,CAAA,CAAA,GA+BJ,UA/BI,CA+BO,CA/BP,CAAA,CAAA,QAAA,CAAA,CAAA,MAAA,CAAA,GAAA,SAAA,GAAA,KAAA,CAAA,GAAA,KAAA,GAAA,KAAA,GAuClB,CAvCkB,CAAA,MAAA,CAAA,GAAA,SAAA;KAyCnB,QAzCQ,CAAA,UAyCW,aAzCX,CAAA,OAAA,CAAA,EAAA,CAAA,CAAA,GAyCwC,CAzCxC,SAyCkD,YAzClD,CAyC+D,CAzC/D,CAAA,GAAA,IAAA,GAAA,KAAA;;;KCnBD,aAAa,oBAAoB;;;KCKxC,yBAAyB,0BAA0B,YACtD,SAAS,GAAG;KAIT,yBAAyB,0BAA0B,gDFCxD,GEGI,QFHQ,CEGC,IFHM,CEGD,CFHC,EEGE,GFHF,CAAA,EEGQ,IFHR,CAAA,GEMf,CFNe;KESd,IFTc,CAAA,CAAA,EAAA,GAAA,CAAA,GEWf,CFXe,SAAA,OAAA,GEeb,GFfa,SAAA,MEeK,CFfL,GEgBX,CFhBW,SEgBD,aFhBC,CAAA,OAAA,CAAA,GEiBT,OFjBS,CEiBD,CFjBC,EEiBE,GFjBF,CAAA,GEkBT,CFlBS,CEkBP,GFlBO,CAAA,GAAA,SAAA,GAAA,KAAA;KE8Bd,cAAA,GF9ByB,MAAA,GAAA,IAAA,GAAA,SAAA;;;;;;;;;;;;;;;;;;;;;AAiCH,iBEmBX,IFnBW,CAAA,UEmBI,cFnBJ,EAAA,YEmBgC,QFnBhC,CEmByC,CFnBzC,EAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EEoBnB,CFpBmB,EAAA,GAAA,EEqBpB,GFrBoB,CAAA,EEsBxB,OFtBwB,CEsBhB,IFtBgB,CEsBX,CFtBW,EEsBR,GFtBQ,CAAA,CAAA;AAAyB,iBEuBpC,IFvBoC,CAAA,UEwBxC,cFxBwC,EAAA,aEyBrC,QFzBqC,CEyB5B,CFzB4B,EAAA,EAAA,CAAA,EAAA,aE0BrC,QF1BqC,CE0B5B,CF1B4B,EAAA,CE0BxB,IF1BwB,CAAA,CAAA,CAAA,CAAA,IAAA,EE2B5C,CF3B4C,EAAA,IAAA,EE2BnC,IF3BmC,EAAA,IAAA,EE2BvB,IF3BuB,CAAA,EE2BhB,OF3BgB,CE2BR,QF3BQ,CE2BC,CF3BD,EAAA,CE2BK,IF3BL,EE2BW,IF3BX,CAAA,CAAA,CAAA;AAAlC,iBE4BF,IF5BE,CAAA,UE6BN,cF7BM,EAAA,aE8BH,QF9BG,CE8BM,CF9BN,EAAA,EAAA,CAAA,EAAA,aE+BH,QF/BG,CE+BM,CF/BN,EAAA,CE+BU,IF/BV,CAAA,CAAA,EAAA,aEgCH,QFhCG,CEgCM,CFhCN,EAAA,CEgCU,IFhCV,EEgCgB,IFhChB,CAAA,CAAA,CAAA,CAAA,IAAA,EEkCV,CFlCU,EAAA,IAAA,EEmCV,IFnCU,EAAA,IAAA,EEoCV,IFpCU,EAAA,IAAA,EEqCV,IFrCU,CAAA,EEsCf,OFtCe,CEsCP,QFtCO,CEsCE,CFtCF,EAAA,CEsCM,IFtCN,EEsCY,IFtCZ,EEsCkB,IFtClB,CAAA,CAAA,CAAA;AACa,iBEsCf,IFtCe,CAAA,UEuCnB,cFvCmB,EAAA,aEwChB,QFxCgB,CEwCP,CFxCO,EAAA,EAAA,CAAA,EAAA,aEyChB,QFzCgB,CEyCP,CFzCO,EAAA,CEyCH,IFzCG,CAAA,CAAA,EAAA,aE0ChB,QF1CgB,CE0CP,CF1CO,EAAA,CE0CH,IF1CG,EE0CG,IF1CH,CAAA,CAAA,EAAA,aE2ChB,QF3CgB,CE2CP,CF3CO,EAAA,CE2CH,IF3CG,EE2CG,IF3CH,EE2CS,IF3CT,CAAA,CAAA,CAAA,CAAA,IAAA,EE6CvB,CF7CuB,EAAA,IAAA,EE8CvB,IF9CuB,EAAA,IAAA,EE+CvB,IF/CuB,EAAA,IAAA,EEgDvB,IFhDuB,EAAA,IAAA,EEiDvB,IFjDuB,CAAA,EEkD5B,OFlD4B,CEkDpB,QFlDoB,CEkDX,CFlDW,EAAA,CEkDP,IFlDO,EEkDD,IFlDC,EEkDK,IFlDL,EEkDW,IFlDX,CAAA,CAAA,CAAA;AAAX,iBEmDJ,IFnDI,CAAA,UEoDR,cFpDQ,EAAA,aEqDL,QFrDK,CEqDI,CFrDJ,EAAA,EAAA,CAAA,EAAA,aEsDL,QFtDK,CEsDI,CFtDJ,EAAA,CEsDQ,IFtDR,CAAA,CAAA,EAAA,aEuDL,QFvDK,CEuDI,CFvDJ,EAAA,CEuDQ,IFvDR,EEuDc,IFvDd,CAAA,CAAA,EAAA,aEwDL,QFxDK,CEwDI,CFxDJ,EAAA,CEwDQ,IFxDR,EEwDc,IFxDd,EEwDoB,IFxDpB,CAAA,CAAA,EAAA,aEyDL,QFzDK,CEyDI,CFzDJ,EAAA,CEyDQ,IFzDR,EEyDc,IFzDd,EEyDoB,IFzDpB,EEyD0B,IFzD1B,CAAA,CAAA,CAAA,CAAA,IAAA,EE2DZ,CF3DY,EAAA,IAAA,EE4DZ,IF5DY,EAAA,IAAA,EE6DZ,IF7DY,EAAA,IAAA,EE8DZ,IF9DY,EAAA,IAAA,EE+DZ,IF/DY,EAAA,IAAA,EEgEZ,IFhEY,CAAA,EEiEjB,OFjEiB,CEiET,QFjES,CEiEA,CFjEA,EAAA,CEiEI,IFjEJ,EEiEU,IFjEV,EEiEgB,IFjEhB,EEiEsB,IFjEtB,EEiE4B,IFjE5B,CAAA,CAAA,CAAA;AAA6C,iBEkEjD,IFlEiD,CAAA,UEmErD,cFnEqD,EAAA,aEoElD,QFpEkD,CEoEzC,CFpEyC,EAAA,EAAA,CAAA,EAAA,aEqElD,QFrEkD,CEqEzC,CFrEyC,EAAA,CEqErC,IFrEqC,CAAA,CAAA,EAAA,aEsElD,QFtEkD,CEsEzC,CFtEyC,EAAA,CEsErC,IFtEqC,EEsE/B,IFtE+B,CAAA,CAAA,EAAA,aEuElD,QFvEkD,CEuEzC,CFvEyC,EAAA,CEuErC,IFvEqC,EEuE/B,IFvE+B,EEuEzB,IFvEyB,CAAA,CAAA,EAAA,aEwElD,QFxEkD,CEwEzC,CFxEyC,EAAA,CEwErC,IFxEqC,EEwE/B,IFxE+B,EEwEzB,IFxEyB,EEwEnB,IFxEmB,CAAA,CAAA,EAAA,aEyElD,QFzEkD,CEyEzC,CFzEyC,EAAA,CEyErC,IFzEqC,EEyE/B,IFzE+B,EEyEzB,IFzEyB,EEyEnB,IFzEmB,EEyEb,IFzEa,CAAA,CAAA,CAAA,CAAA,IAAA,EE2EzD,CF3EyD,EAAA,IAAA,EE4EzD,IF5EyD,EAAA,IAAA,EE6EzD,IF7EyD,EAAA,IAAA,EE8EzD,IF9EyD,EAAA,IAAA,EE+EzD,IF/EyD,EAAA,IAAA,EEgFzD,IFhFyD,EAAA,IAAA,EEiFzD,IFjFyD,CAAA,EEkF9D,OFlF8D,CEkFtD,QFlFsD,CEkF7C,CFlF6C,EAAA,CEkFzC,IFlFyC,EEkFnC,IFlFmC,EEkF7B,IFlF6B,EEkFvB,IFlFuB,EEkFjB,IFlFiB,EEkFX,IFlFW,CAAA,CAAA,CAAA;AAArB,iBEmF5B,IFnF4B,CAAA,UEoFhC,cFpFgC,EAAA,aEqF7B,QFrF6B,CEqFpB,CFrFoB,EAAA,EAAA,CAAA,EAAA,aEsF7B,QFtF6B,CEsFpB,CFtFoB,EAAA,CEsFhB,IFtFgB,CAAA,CAAA,EAAA,aEuF7B,QFvF6B,CEuFpB,CFvFoB,EAAA,CEuFhB,IFvFgB,EEuFV,IFvFU,CAAA,CAAA,EAAA,aEwF7B,QFxF6B,CEwFpB,CFxFoB,EAAA,CEwFhB,IFxFgB,EEwFV,IFxFU,EEwFJ,IFxFI,CAAA,CAAA,EAAA,aEyF7B,QFzF6B,CEyFpB,CFzFoB,EAAA,CEyFhB,IFzFgB,EEyFV,IFzFU,EEyFJ,IFzFI,EEyFE,IFzFF,CAAA,CAAA,EAAA,aE0F7B,QF1F6B,CE0FpB,CF1FoB,EAAA,CE0FhB,IF1FgB,EE0FV,IF1FU,EE0FJ,IF1FI,EE0FE,IF1FF,EE0FQ,IF1FR,CAAA,CAAA,EAAA,aE2F7B,QF3F6B,CE2FpB,CF3FoB,EAAA,CE2FhB,IF3FgB,EE2FV,IF3FU,EE2FJ,IF3FI,EE2FE,IF3FF,EE2FQ,IF3FR,EE2Fc,IF3Fd,CAAA,CAAA,CAAA,CAAA,IAAA,EE6FpC,CF7FoC,EAAA,IAAA,EE8FpC,IF9FoC,EAAA,IAAA,EE+FpC,IF/FoC,EAAA,IAAA,EEgGpC,IFhGoC,EAAA,IAAA,EEiGpC,IFjGoC,EAAA,IAAA,EEkGpC,IFlGoC,EAAA,IAAA,EEmGpC,IFnGoC,EAAA,IAAA,EEoGpC,IFpGoC,CAAA,EEqGzC,OFrGyC,CEqGjC,QFrGiC,CEqGxB,CFrGwB,EAAA,CEqGpB,IFrGoB,EEqGd,IFrGc,EEqGR,IFrGQ,EEqGF,IFrGE,EEqGI,IFrGJ,EEqGU,IFrGV,EEqGgB,IFrGhB,CAAA,CAAA,CAAA;AAKb,iBEiGf,IFjGe,CAAA,UEkGnB,cFlGmB,EAAA,aEmGhB,QFnGgB,CEmGP,CFnGO,EAAA,EAAA,CAAA,EAAA,aEoGhB,QFpGgB,CEoGP,CFpGO,EAAA,CEoGH,IFpGG,CAAA,CAAA,EAAA,aEqGhB,QFrGgB,CEqGP,CFrGO,EAAA,CEqGH,IFrGG,EEqGG,IFrGH,CAAA,CAAA,EAAA,aEsGhB,QFtGgB,CEsGP,CFtGO,EAAA,CEsGH,IFtGG,EEsGG,IFtGH,EEsGS,IFtGT,CAAA,CAAA,EAAA,aEuGhB,QFvGgB,CEuGP,CFvGO,EAAA,CEuGH,IFvGG,EEuGG,IFvGH,EEuGS,IFvGT,EEuGe,IFvGf,CAAA,CAAA,EAAA,aEwGhB,QFxGgB,CEwGP,CFxGO,EAAA,CEwGH,IFxGG,EEwGG,IFxGH,EEwGS,IFxGT,EEwGe,IFxGf,EEwGqB,IFxGrB,CAAA,CAAA,EAAA,aEyGhB,QFzGgB,CEyGP,CFzGO,EAAA,CEyGH,IFzGG,EEyGG,IFzGH,EEyGS,IFzGT,EEyGe,IFzGf,EEyGqB,IFzGrB,EEyG2B,IFzG3B,CAAA,CAAA,EAAA,aE0GhB,QF1GgB,CE0GP,CF1GO,EAAA,CE0GH,IF1GG,EE0GG,IF1GH,EE0GS,IF1GT,EE0Ge,IF1Gf,EE0GqB,IF1GrB,EE0G2B,IF1G3B,EE0GiC,IF1GjC,CAAA,CAAA,CAAA,CAAA,IAAA,EE4GvB,CF5GuB,EAAA,IAAA,EE6GvB,IF7GuB,EAAA,IAAA,EE8GvB,IF9GuB,EAAA,IAAA,EE+GvB,IF/GuB,EAAA,IAAA,EEgHvB,IFhHuB,EAAA,IAAA,EEiHvB,IFjHuB,EAAA,IAAA,EEkHvB,IFlHuB,EAAA,IAAA,EEmHvB,IFnHuB,EAAA,IAAA,EEoHvB,IFpHuB,CAAA,EEqH5B,OFrH4B,CEqHpB,QFrHoB,CEqHX,CFrHW,EAAA,CEqHP,IFrHO,EEqHD,IFrHC,EEqHK,IFrHL,EEqHW,IFrHX,EEqHiB,IFrHjB,EEqHuB,IFrHvB,EEqH6B,IFrH7B,EEqHmC,IFrHnC,CAAA,CAAA,CAAA;AAAX,iBEsHJ,IFtHI,CAAA,UEuHR,cFvHQ,EAAA,aEwHL,QFxHK,CEwHI,CFxHJ,EAAA,EAAA,CAAA,EAAA,aEyHL,QFzHK,CEyHI,CFzHJ,EAAA,CEyHQ,IFzHR,CAAA,CAAA,EAAA,aE0HL,QF1HK,CE0HI,CF1HJ,EAAA,CE0HQ,IF1HR,EE0Hc,IF1Hd,CAAA,CAAA,EAAA,aE2HL,QF3HK,CE2HI,CF3HJ,EAAA,CE2HQ,IF3HR,EE2Hc,IF3Hd,EE2HoB,IF3HpB,CAAA,CAAA,EAAA,aE4HL,QF5HK,CE4HI,CF5HJ,EAAA,CE4HQ,IF5HR,EE4Hc,IF5Hd,EE4HoB,IF5HpB,EE4H0B,IF5H1B,CAAA,CAAA,EAAA,aE6HL,QF7HK,CE6HI,CF7HJ,EAAA,CE6HQ,IF7HR,EE6Hc,IF7Hd,EE6HoB,IF7HpB,EE6H0B,IF7H1B,EE6HgC,IF7HhC,CAAA,CAAA,EAAA,aE8HL,QF9HK,CE8HI,CF9HJ,EAAA,CE8HQ,IF9HR,EE8Hc,IF9Hd,EE8HoB,IF9HpB,EE8H0B,IF9H1B,EE8HgC,IF9HhC,EE8HsC,IF9HtC,CAAA,CAAA,EAAA,aE+HL,QF/HK,CE+HI,CF/HJ,EAAA,CE+HQ,IF/HR,EE+Hc,IF/Hd,EE+HoB,IF/HpB,EE+H0B,IF/H1B,EE+HgC,IF/HhC,EE+HsC,IF/HtC,EE+H4C,IF/H5C,CAAA,CAAA,EAAA,aEgIL,QFhIK,CEgII,CFhIJ,EAAA,CEgIQ,IFhIR,EEgIc,IFhId,EEgIoB,IFhIpB,EEgI0B,IFhI1B,EEgIgC,IFhIhC,EEgIsC,IFhItC,EEgI4C,IFhI5C,EEgIkD,IFhIlD,CAAA,CAAA,CAAA,CAAA,IAAA,EEkIZ,CFlIY,EAAA,IAAA,EEmIZ,IFnIY,EAAA,IAAA,EEoIZ,IFpIY,EAAA,IAAA,EEqIZ,IFrIY,EAAA,IAAA,EEsIZ,IFtIY,EAAA,IAAA,EEuIZ,IFvIY,EAAA,IAAA,EEwIZ,IFxIY,EAAA,IAAA,EEyIZ,IFzIY,EAAA,IAAA,EE0IZ,IF1IY,EAAA,IAAA,EE2IZ,IF3IY,CAAA,EE4IjB,OF5IiB,CE4IT,QF5IS,CE4IA,CF5IA,EAAA,CE4II,IF5IJ,EE4IU,IF5IV,EE4IgB,IF5IhB,EE4IsB,IF5ItB,EE4I4B,IF5I5B,EE4IkC,IF5IlC,EE4IwC,IF5IxC,EE4I8C,IF5I9C,EE4IoD,IF5IpD,CAAA,CAAA,CAAA;AAQd,iBEqIU,IFrIV,CAAA,UEsIM,cFtIN,EAAA,aEuIS,QFvIT,CEuIkB,CFvIlB,EAAA,EAAA,CAAA,EAAA,aEwIS,QFxIT,CEwIkB,CFxIlB,EAAA,CEwIsB,IFxItB,CAAA,CAAA,EAAA,aEyIS,QFzIT,CEyIkB,CFzIlB,EAAA,CEyIsB,IFzItB,EEyI4B,IFzI5B,CAAA,CAAA,EAAA,aE0IS,QF1IT,CE0IkB,CF1IlB,EAAA,CE0IsB,IF1ItB,EE0I4B,IF1I5B,EE0IkC,IF1IlC,CAAA,CAAA,EAAA,aE2IS,QF3IT,CE2IkB,CF3IlB,EAAA,CE2IsB,IF3ItB,EE2I4B,IF3I5B,EE2IkC,IF3IlC,EE2IwC,IF3IxC,CAAA,CAAA,EAAA,aE4IS,QF5IT,CE4IkB,CF5IlB,EAAA,CE4IsB,IF5ItB,EE4I4B,IF5I5B,EE4IkC,IF5IlC,EE4IwC,IF5IxC,EE4I8C,IF5I9C,CAAA,CAAA,EAAA,aE6IS,QF7IT,CE6IkB,CF7IlB,EAAA,CE6IsB,IF7ItB,EE6I4B,IF7I5B,EE6IkC,IF7IlC,EE6IwC,IF7IxC,EE6I8C,IF7I9C,EE6IoD,IF7IpD,CAAA,CAAA,EAAA,aE8IS,QF9IT,CE8IkB,CF9IlB,EAAA,CE8IsB,IF9ItB,EE8I4B,IF9I5B,EE8IkC,IF9IlC,EE8IwC,IF9IxC,EE8I8C,IF9I9C,EE8IoD,IF9IpD,EE8I0D,IF9I1D,CAAA,CAAA,EAAA,aE+IS,QF/IT,CE+IkB,CF/IlB,EAAA,CE+IsB,IF/ItB,EE+I4B,IF/I5B,EE+IkC,IF/IlC,EE+IwC,IF/IxC,EE+I8C,IF/I9C,EE+IoD,IF/IpD,EE+I0D,IF/I1D,EE+IgE,IF/IhE,CAAA,CAAA,EAAA,aEgJS,QFhJT,CEiJF,CFjJE,EAAA,CEkJD,IFlJE,EEkJI,IFhJN,EEgJY,IFhJJ,EEgJU,IFhJC,EEgJK,IFhJwB,EEgJlB,IFhJyC,EEgJnC,IFhJsB,EEgJhB,IFhJ4B,EEgJtB,+BAE5B,cAAc,yBAE/B,SACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,YACA,yBACa,iBAClB,QACD,SACE,IAEE,MACA,IDjOM,ECkON,IDlOa,ECmOb,IDnOmB,ECoOnB,IDpOuC,ECqOvC,IDrOwC,ECsOxC,MACA,MACA,MACA,IApOD,EAAQ,GAqOJ,cArOI;;;;;;AAAsD;;;;;;;;;;;AAY9D;;;AASC,iBAwOU,IAxOV,CAAA,UAwOyB,cAxOzB,EAAA,YAwOqD,WAxOrD,CAwOiE,CAxOjE,CAAA,CAAA,CAAA,GAAA,EAyOC,GAzOD,CAAA,EAAA,CAAA,IAAA,EA0OI,CA1OJ,EAAA,GA0OU,OA1OV,CA0OkB,IA1OlB,CA0OuB,CA1OvB,EA0O0B,GA1O1B,CAAA,CAAA;AAAkB,iBA2OR,IA3OQ,CAAA,UA4OZ,cA5OY,EAAA,aA6OT,QA7OS,CA6OA,CA7OA,EAAA,EAAA,CAAA,EAAA,aA8OT,QA9OS,CA8OA,CA9OA,EAAA,CA8OI,IA9OJ,CAAA,CAAA,CAAA,CAAA,IAAA,EA+OhB,IA/OgB,EAAA,IAAA,EA+OJ,IA/OI,CAAA,EAAA,CAAA,IAAA,EA+OU,CA/OV,EAAA,GA+OgB,OA/OhB,CA+OwB,QA/OxB,CA+OiC,CA/OjC,EAAA,CA+OqC,IA/OrC,EA+O2C,IA/O3C,CAAA,CAAA,CAAA;AAChB,iBA+OQ,IA/OR,CAAA,UAgPI,cAhPJ,EAAA,aAiPO,QAjPP,CAiPgB,CAjPhB,EAAA,EAAA,CAAA,EAAA,aAkPO,QAlPP,CAkPgB,CAlPhB,EAAA,CAkPoB,IAlPpB,CAAA,CAAA,EAAA,aAmPO,QAnPP,CAmPgB,CAnPhB,EAAA,CAmPoB,IAnPpB,EAmP0B,IAnP1B,CAAA,CAAA,CAAA,CAAA,IAAA,EAqPA,IArPA,EAAA,IAAA,EAsPA,IAtPA,EAAA,IAAA,EAuPA,IAvPA,CAAA,EAAA,CAAA,IAAA,EAwPE,CAxPF,EAAA,GAwPQ,OAxPR,CAwPgB,QAxPhB,CAwPyB,CAxPzB,EAAA,CAwP6B,IAxP7B,EAwPmC,IAxPnC,EAwPyC,IAxPzC,CAAA,CAAA,CAAA;AAAU,iBAyPF,IAzPE,CAAA,UA0PN,cA1PM,EAAA,aA2PH,QA3PG,CA2PM,CA3PN,EAAA,EAAA,CAAA,EAAA,aA4PH,QA5PG,CA4PM,CA5PN,EAAA,CA4PU,IA5PV,CAAA,CAAA,EAAA,aA6PH,QA7PG,CA6PM,CA7PN,EAAA,CA6PU,IA7PV,EA6PgB,IA7PhB,CAAA,CAAA,EAAA,aA8PH,QA9PG,CA8PM,CA9PN,EAAA,CA8PU,IA9PV,EA8PgB,IA9PhB,EA8PsB,IA9PtB,CAAA,CAAA,CAAA,CAAA,IAAA,EAgQV,IAhQU,EAAA,IAAA,EAiQV,IAjQU,EAAA,IAAA,EAkQV,IAlQU,EAAA,IAAA,EAmQV,IAnQU,CAAA,EAAA,CAAA,IAAA,EAoQR,CApQQ,EAAA,GAoQF,OApQE,CAoQM,QApQN,CAoQe,CApQf,EAAA,CAoQmB,IApQnB,EAoQyB,IApQzB,EAoQ+B,IApQ/B,EAoQqC,IApQrC,CAAA,CAAA,CAAA;AACA,iBAoQF,IApQE,CAAA,UAqQN,cArQM,EAAA,aAsQH,QAtQG,CAsQM,CAtQN,EAAA,EAAA,CAAA,EAAA,aAuQH,QAvQG,CAuQM,CAvQN,EAAA,CAuQU,IAvQV,CAAA,CAAA,EAAA,aAwQH,QAxQG,CAwQM,CAxQN,EAAA,CAwQU,IAxQV,EAwQgB,IAxQhB,CAAA,CAAA,EAAA,aAyQH,QAzQG,CAyQM,CAzQN,EAAA,CAyQU,IAzQV,EAyQgB,IAzQhB,EAyQsB,IAzQtB,CAAA,CAAA,EAAA,aA0QH,QA1QG,CA0QM,CA1QN,EAAA,CA0QU,IA1QV,EA0QgB,IA1QhB,EA0QsB,IA1QtB,EA0Q4B,IA1Q5B,CAAA,CAAA,CAAA,CAAA,IAAA,EA4QV,IA5QU,EAAA,IAAA,EA6QV,IA7QU,EAAA,IAAA,EA8QV,IA9QU,EAAA,IAAA,EA+QV,IA/QU,EAAA,IAAA,EAgRV,IAhRU,CAAA,EAAA,CAAA,IAAA,EAiRR,CAjRQ,EAAA,GAiRF,OAjRE,CAiRM,QAjRN,CAiRe,CAjRf,EAAA,CAiRmB,IAjRnB,EAiRyB,IAjRzB,EAiR+B,IAjR/B,EAiRqC,IAjRrC,EAiR2C,IAjR3C,CAAA,CAAA,CAAA;AAAG,iBAkRL,IAlRK,CAAA,UAmRT,cAnRS,EAAA,aAoRN,QApRM,CAoRG,CApRH,EAAA,EAAA,CAAA,EAAA,aAqRN,QArRM,CAqRG,CArRH,EAAA,CAqRO,IArRP,CAAA,CAAA,EAAA,aAsRN,QAtRM,CAsRG,CAtRH,EAAA,CAsRO,IAtRP,EAsRa,IAtRb,CAAA,CAAA,EAAA,aAuRN,QAvRM,CAuRG,CAvRH,EAAA,CAuRO,IAvRP,EAuRa,IAvRb,EAuRmB,IAvRnB,CAAA,CAAA,EAAA,aAwRN,QAxRM,CAwRG,CAxRH,EAAA,CAwRO,IAxRP,EAwRa,IAxRb,EAwRmB,IAxRnB,EAwRyB,IAxRzB,CAAA,CAAA,EAAA,aAyRN,QAzRM,CAyRG,CAzRH,EAAA,CAyRO,IAzRP,EAyRa,IAzRb,EAyRmB,IAzRnB,EAyRyB,IAzRzB,EAyR+B,IAzR/B,CAAA,CAAA,CAAA,CAAA,IAAA,EA2Rb,IA3Ra,EAAA,IAAA,EA4Rb,IA5Ra,EAAA,IAAA,EA6Rb,IA7Ra,EAAA,IAAA,EA8Rb,IA9Ra,EAAA,IAAA,EA+Rb,IA/Ra,EAAA,IAAA,EAgSb,IAhSa,CAAA,EAAA,CAAA,IAAA,EAiSX,CAjSW,EAAA,GAiSL,OAjSK,CAiSG,QAjSH,CAiSY,CAjSZ,EAAA,CAiSgB,IAjShB,EAiSsB,IAjStB,EAiS4B,IAjS5B,EAiSkC,IAjSlC,EAiSwC,IAjSxC,EAiS8C,IAjS9C,CAAA,CAAA,CAAA;AAAX,iBAkSM,IAlSN,CAAA,UAmSE,cAnSF,EAAA,aAoSK,QApSL,CAoSc,CApSd,EAAA,EAAA,CAAA,EAAA,aAqSK,QArSL,CAqSc,CArSd,EAAA,CAqSkB,IArSlB,CAAA,CAAA,EAAA,aAsSK,QAtSL,CAsSc,CAtSd,EAAA,CAsSkB,IAtSlB,EAsSwB,IAtSxB,CAAA,CAAA,EAAA,aAuSK,QAvSL,CAuSc,CAvSd,EAAA,CAuSkB,IAvSlB,EAuSwB,IAvSxB,EAuS8B,IAvS9B,CAAA,CAAA,EAAA,aAwSK,QAxSL,CAwSc,CAxSd,EAAA,CAwSkB,IAxSlB,EAwSwB,IAxSxB,EAwS8B,IAxS9B,EAwSoC,IAxSpC,CAAA,CAAA,EAAA,aAySK,QAzSL,CAySc,CAzSd,EAAA,CAySkB,IAzSlB,EAySwB,IAzSxB,EAyS8B,IAzS9B,EAySoC,IAzSpC,EAyS0C,IAzS1C,CAAA,CAAA,EAAA,aA0SK,QA1SL,CA0Sc,CA1Sd,EAAA,CA0SkB,IA1SlB,EA0SwB,IA1SxB,EA0S8B,IA1S9B,EA0SoC,IA1SpC,EA0S0C,IA1S1C,EA0SgD,IA1ShD,CAAA,CAAA,CAAA,CAAA,IAAA,EA4SF,IA5SE,EAAA,IAAA,EA6SF,IA7SE,EAAA,IAAA,EA8SF,IA9SE,EAAA,IAAA,EA+SF,IA/SE,EAAA,IAAA,EAgTF,IAhTE,EAAA,IAAA,EAiTF,IAjTE,EAAA,IAAA,EAkTF,IAlTE,CAAA,EAAA,CAAA,IAAA,EAoTF,CApTE,EAAA,GAqTL,OArTK,CAqTG,QArTH,CAqTY,CArTZ,EAAA,CAqTgB,IArThB,EAqTsB,IArTtB,EAqT4B,IArT5B,EAqTkC,IArTlC,EAqTwC,IArTxC,EAqT8C,IArT9C,EAqToD,IArTpD,CAAA,CAAA,CAAA;AACA,iBAqTM,IArTN,CAAA,UAsTE,cAtTF,EAAA,aAuTK,QAvTL,CAuTc,CAvTd,EAAA,EAAA,CAAA,EAAA,aAwTK,QAxTL,CAwTc,CAxTd,EAAA,CAwTkB,IAxTlB,CAAA,CAAA,EAAA,aAyTK,QAzTL,CAyTc,CAzTd,EAAA,CAyTkB,IAzTlB,EAyTwB,IAzTxB,CAAA,CAAA,EAAA,aA0TK,QA1TL,CA0Tc,CA1Td,EAAA,CA0TkB,IA1TlB,EA0TwB,IA1TxB,EA0T8B,IA1T9B,CAAA,CAAA,EAAA,aA2TK,QA3TL,CA2Tc,CA3Td,EAAA,CA2TkB,IA3TlB,EA2TwB,IA3TxB,EA2T8B,IA3T9B,EA2ToC,IA3TpC,CAAA,CAAA,EAAA,aA4TK,QA5TL,CA4Tc,CA5Td,EAAA,CA4TkB,IA5TlB,EA4TwB,IA5TxB,EA4T8B,IA5T9B,EA4ToC,IA5TpC,EA4T0C,IA5T1C,CAAA,CAAA,EAAA,aA6TK,QA7TL,CA6Tc,CA7Td,EAAA,CA6TkB,IA7TlB,EA6TwB,IA7TxB,EA6T8B,IA7T9B,EA6ToC,IA7TpC,EA6T0C,IA7T1C,EA6TgD,IA7ThD,CAAA,CAAA,EAAA,aA8TK,QA9TL,CA8Tc,CA9Td,EAAA,CA8TkB,IA9TlB,EA8TwB,IA9TxB,EA8T8B,IA9T9B,EA8ToC,IA9TpC,EA8T0C,IA9T1C,EA8TgD,IA9ThD,EA8TsD,IA9TtD,CAAA,CAAA,CAAA,CAAA,IAAA,EAgUF,IAhUE,EAAA,IAAA,EAiUF,IAjUE,EAAA,IAAA,EAkUF,IAlUE,EAAA,IAAA,EAmUF,IAnUE,EAAA,IAAA,EAoUF,IApUE,EAAA,IAAA,EAqUF,IArUE,EAAA,IAAA,EAsUF,IAtUE,EAAA,IAAA,EAuUF,IAvUE,CAAA,EAAA,CAAA,IAAA,EAyUF,CAzUE,EAAA,GA0UL,OA1UK,CA0UG,QA1UH,CA0UY,CA1UZ,EAAA,CA0UgB,IA1UhB,EA0UsB,IA1UtB,EA0U4B,IA1U5B,EA0UkC,IA1UlC,EA0UwC,IA1UxC,EA0U8C,IA1U9C,EA0UoD,IA1UpD,EA0U0D,IA1U1D,CAAA,CAAA,CAAA;AAAE,iBA2UI,IA3UJ,CAAA,UA4UA,cA5UA,EAAA,aA6UG,QA7UH,CA6UY,CA7UZ,EAAA,EAAA,CAAA,EAAA,aA8UG,QA9UH,CA8UY,CA9UZ,EAAA,CA8UgB,IA9UhB,CAAA,CAAA,EAAA,aA+UG,QA/UH,CA+UY,CA/UZ,EAAA,CA+UgB,IA/UhB,EA+UsB,IA/UtB,CAAA,CAAA,EAAA,aAgVG,QAhVH,CAgVY,CAhVZ,EAAA,CAgVgB,IAhVhB,EAgVsB,IAhVtB,EAgV4B,IAhV5B,CAAA,CAAA,EAAA,aAiVG,QAjVH,CAiVY,CAjVZ,EAAA,CAiVgB,IAjVhB,EAiVsB,IAjVtB,EAiV4B,IAjV5B,EAiVkC,IAjVlC,CAAA,CAAA,EAAA,aAkVG,QAlVH,CAkVY,CAlVZ,EAAA,CAkVgB,IAlVhB,EAkVsB,IAlVtB,EAkV4B,IAlV5B,EAkVkC,IAlVlC,EAkVwC,IAlVxC,CAAA,CAAA,EAAA,aAmVG,QAnVH,CAmVY,CAnVZ,EAAA,CAmVgB,IAnVhB,EAmVsB,IAnVtB,EAmV4B,IAnV5B,EAmVkC,IAnVlC,EAmVwC,IAnVxC,EAmV8C,IAnV9C,CAAA,CAAA,EAAA,aAoVG,QApVH,CAoVY,CApVZ,EAAA,CAoVgB,IApVhB,EAoVsB,IApVtB,EAoV4B,IApV5B,EAoVkC,IApVlC,EAoVwC,IApVxC,EAoV8C,IApV9C,EAoVoD,IApVpD,CAAA,CAAA,EAAA,aAqVG,QArVH,CAqVY,CArVZ,EAAA,CAqVgB,IArVhB,EAqVsB,IArVtB,EAqV4B,IArV5B,EAqVkC,IArVlC,EAqVwC,IArVxC,EAqV8C,IArV9C,EAqVoD,IArVpD,EAqV0D,IArV1D,CAAA,CAAA,CAAA,CAAA,IAAA,EAuVJ,IAvVI,EAAA,IAAA,EAwVJ,IAxVI,EAAA,IAAA,EAyVJ,IAzVI,EAAA,IAAA,EA0VJ,IA1VI,EAAA,IAAA,EA2VJ,IA3VI,EAAA,IAAA,EA4VJ,IA5VI,EAAA,IAAA,EA6VJ,IA7VI,EAAA,IAAA,EA8VJ,IA9VI,EAAA,IAAA,EA+VJ,IA/VI,CAAA,EAAA,CAAA,IAAA,EAiWJ,CAjWI,EAAA,GAkWP,OAlWO,CAmWV,QAnWU,CAmWD,CAnWC,EAAA,CAmWG,IAnWH,EAmWS,IAnWT,EAmWe,IAnWf,EAmWqB,IAnWrB,EAmW2B,IAnW3B,EAmWiC,IAnWjC,EAmWuC,IAnWvC,EAmW6C,IAnW7C,EAmWmD,IAnWnD,CAAA,CAAA,CAAA;AAAG,iBAqWC,IArWD,CAAA,UAsWH,cAtWG,EAAA,aAuWA,QAvWA,CAuWS,CAvWT,EAAA,EAAA,CAAA,EAAA,aAwWA,QAxWA,CAwWS,CAxWT,EAAA,CAwWa,IAxWb,CAAA,CAAA,EAAA,aAyWA,QAzWA,CAyWS,CAzWT,EAAA,CAyWa,IAzWb,EAyWmB,IAzWnB,CAAA,CAAA,EAAA,aA0WA,QA1WA,CA0WS,CA1WT,EAAA,CA0Wa,IA1Wb,EA0WmB,IA1WnB,EA0WyB,IA1WzB,CAAA,CAAA,EAAA,aA2WA,QA3WA,CA2WS,CA3WT,EAAA,CA2Wa,IA3Wb,EA2WmB,IA3WnB,EA2WyB,IA3WzB,EA2W+B,IA3W/B,CAAA,CAAA,EAAA,aA4WA,QA5WA,CA4WS,CA5WT,EAAA,CA4Wa,IA5Wb,EA4WmB,IA5WnB,EA4WyB,IA5WzB,EA4W+B,IA5W/B,EA4WqC,IA5WrC,CAAA,CAAA,EAAA,aA6WA,QA7WA,CA6WS,CA7WT,EAAA,CA6Wa,IA7Wb,EA6WmB,IA7WnB,EA6WyB,IA7WzB,EA6W+B,IA7W/B,EA6WqC,IA7WrC,EA6W2C,IA7W3C,CAAA,CAAA,EAAA,aA8WA,QA9WA,CA8WS,CA9WT,EAAA,CA8Wa,IA9Wb,EA8WmB,IA9WnB,EA8WyB,IA9WzB,EA8W+B,IA9W/B,EA8WqC,IA9WrC,EA8W2C,IA9W3C,EA8WiD,IA9WjD,CAAA,CAAA,EAAA,aA+WA,QA/WA,CA+WS,CA/WT,EAAA,CA+Wa,IA/Wb,EA+WmB,IA/WnB,EA+WyB,IA/WzB,EA+W+B,IA/W/B,EA+WqC,IA/WrC,EA+W2C,IA/W3C,EA+WiD,IA/WjD,EA+WuD,IA/WvD,CAAA,CAAA,EAAA,aAgXA,QAhXA,CAiXX,CAjXW,EAAA,CAkXV,IAtWA,EAsWM,IAhVK,EAgVC,IAhVG,EAgVG,IAhVQ,EAgVF,IAhVuC,EAgVjC,IAhVwB,EAgVlB,IA/UjC,EA+UuC,IA9UxC,EA8U8C,IA7UrC,2BA+US,aA/UN,CA+UoB,WA/UpB,CAAA,GAAA,EAAA,CAAA,CAAA,IAAA,EAiVX,IAjVW,EAAA,IAAA,EAkVX,IAlVW,EAAA,IAAA,EAmVX,IAnVW,EAAA,IAAA,EAoVX,IApVW,EAAA,IAAA,EAqVX,IArVW,EAAA,IAAA,EAsVX,IAtVW,EAAA,IAAA,EAuVX,IAvVW,EAAA,IAAA,EAwVX,IAxVW,EAAA,IAAA,EAyVX,IAzVW,EAAA,IAAA,EA0VX,IA1VW,EAAA,GAAA,cAAA,EA2VE,cA3VF,CAAA,EAAA,CAAA,IAAA,EA6VX,CA7VW,EAAA,GA8Vd,OA9Vc,CA+VjB,QA/ViB,CAgWf,CAhWe,EAAA,CAkWb,IAlWK,EAmWL,IAnWH,EAoWG,IApWI,EAqWJ,IApWU,EAqWV,IArWc,EAsWd,IArWM,EAsWN,IArWkB,EAsWlB,IAtWS,EAuWT,IAtWkB,EAuWlB,IAvWsB,KAwWnB,cAxWM;AACE,iBA4WD,IA5WC,CAAA,UA4Wc,WA5Wd,CAAA,CAAA,GAAA,EA6WV,CA7WU,CAAA,EAAA,CAAA,UA8WH,OA9WG,CA8WK,MA9WL,CA8WY,CA9WZ,EAAA,OAAA,CAAA,CAAA,CAAA,CAAA,IAAA,EA8WgC,CA9WhC,EAAA,GA8WsC,CA9WtC,CA8WwC,CA9WxC,CAAA"}

package/dist/prop-BAo3Mk2v.js

@@ -0,0 +1,2 @@
+function e(e,...n){return typeof e==`string`||typeof e==`number`||typeof e==`symbol`?r=>t(r,e,...n):t(e,...n)}function t(e,...t){let n=e;for(let e of t){if(n==null)return;n=n[e]}return n}export{e as prop};
+//# sourceMappingURL=prop-BAo3Mk2v.js.map

package/dist/prop-BAo3Mk2v.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prop-BAo3Mk2v.js","names":["output: unknown"],"sources":["../src/prop.ts"],"sourcesContent":["import type { KeysOfUnion } from 'type-fest';\nimport type { ArrayAt } from './internal/types/array-at';\nimport type { NoInfer } from './internal/types/no-infer';\n\n// Computes all possible keys of `T` at `Path` spread over unions, allowing\n// keys from any of the results, not just those **shared** by all of them.\ntype KeysDeep<T, Path extends ReadonlyArray<unknown>> = KeysOfUnion<\n  PropDeep<T, Path>\n>;\n\n// Recursively run `Prop` over `Path` to extract the deeply nested type.\ntype PropDeep<T, Path extends ReadonlyArray<unknown>> = Path extends readonly [\n  infer Key,\n  ...infer Rest,\n]\n  ? PropDeep<Prop<T, Key>, Rest>\n  // Keys is a fixed tuple so we know we reach here only when we've reached\n  // the output object.\n  : T;\n\n// Expanding on the built-in `T[Key]` operator to support arrays and unions.\ntype Prop<T, Key>\n  // Distribute the union to support unions of keys.\n  = T extends unknown\n    // In a distributed union some of the union members might not be keys of a\n    // specific object within a union of objects, those cases don't contribute\n    // to the output type.\n    ? Key extends keyof T\n      ? T extends ReadonlyArray<unknown>\n        ? ArrayAt<T, Key>\n        : T[Key]\n      : undefined\n    : never;\n\n// Currying relies on us being able to differentiate between data-first and\n// data-last invocations at runtime, but because the function takes a variadic\n// array of keys we can't rely on it's shape or length to do that. Instead, we\n// can limit the types we accept for `data` so that looking at the first\n// parameter's type is enough to make the call. From a practical standpoint\n// this means we accept in any `object`, `null,` or `undefined`, and that we\n// don't accept `string`. All other types (`boolean` and `bigint`) don't\n// have properties, so are incompatible with our `key` parameters anyway.\ntype NonPropertyKey = object | null | undefined;\n\n/**\n * Gets the value of the given property from an object. Nested properties can\n * be accessed by providing a variadic array of keys that define the path from\n * the root to the desired property. Arrays can be accessed by using numeric\n * keys. Unions and optional properties are handled gracefully by returning\n * `undefined` early for any non-existing property on the path. Paths are\n * validated against the object type to provide stronger type safety, better\n * compile-time errors, and to enable autocompletion in IDEs.\n *\n * @param data - The object or array to access.\n * @param key - The key(s) for the property to extract.\n * @signature\n *   P.prop(data, ...keys);\n * @example\n *   P.prop({ foo: { bar: 'baz' } }, 'foo'); //=> { bar: 'baz' }\n *   P.prop({ foo: { bar: 'baz' } }, 'foo', 'bar'); //=> 'baz'\n *   P.prop([\"cat\", \"dog\"], 1); //=> 'dog'\n * @dataFirst\n * @category Object\n */\nexport function prop<T extends NonPropertyKey, Key extends KeysDeep<T, []>>(\n  data: T,\n  key: Key,\n): NoInfer<Prop<T, Key>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n>(data: T, key0: Key0, key1: Key1): NoInfer<PropDeep<T, [Key0, Key1]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n  Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n  key7: Key7,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n  Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>,\n  Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>,\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n  key7: Key7,\n  key8: Key8,\n): NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n  Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>,\n  Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>,\n  Key9 extends KeysDeep<\n    T,\n    [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]\n  >,\n  AdditionalKeys extends ReadonlyArray<PropertyKey> = [],\n>(\n  data: T,\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n  key7: Key7,\n  key8: Key8,\n  key9: Key9,\n  ...additionalKeys: AdditionalKeys\n): NoInfer<\n  PropDeep<\n    T,\n    [\n      Key0,\n      Key1,\n      Key2,\n      Key3,\n      Key4,\n      Key5,\n      Key6,\n      Key7,\n      Key8,\n      Key9,\n      ...AdditionalKeys,\n    ]\n  >\n>;\n\n/**\n * Gets the value of the given property from an object. Nested properties can\n * be accessed by providing a variadic array of keys that define the path from\n * the root to the desired property. Arrays can be accessed by using numeric\n * keys. Unions and optional properties are handled gracefully by returning\n * `undefined` early for any non-existing property on the path. Paths are\n * validated against the object type to provide stronger type safety, better\n * compile-time errors, and to enable autocompletion in IDEs.\n *\n * @param key - The key(s) for the property to extract.\n * @signature\n *   P.prop(...keys)(data);\n * @example\n *   P.pipe({ foo: { bar: 'baz' } }, P.prop('foo')); //=> { bar: 'baz' }\n *   P.pipe({ foo: { bar: 'baz' } }, P.prop('foo', 'bar')); //=> 'baz'\n *   P.pipe([\"cat\", \"dog\"], P.prop(1)); //=> 'dog'\n * @dataLast\n * @category Object\n */\nexport function prop<T extends NonPropertyKey, Key extends KeysOfUnion<T>>(\n  key: Key,\n): (data: T) => NoInfer<Prop<T, Key>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n>(key0: Key0, key1: Key1): (data: T) => NoInfer<PropDeep<T, [Key0, Key1]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n): (data: T) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n): (\n  data: T,\n) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n  Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n  key7: Key7,\n): (\n  data: T,\n) => NoInfer<PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n  Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>,\n  Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>,\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n  key7: Key7,\n  key8: Key8,\n): (\n  data: T,\n) => NoInfer<\n  PropDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]>\n>;\nexport function prop<\n  T extends NonPropertyKey,\n  Key0 extends KeysDeep<T, []>,\n  Key1 extends KeysDeep<T, [Key0]>,\n  Key2 extends KeysDeep<T, [Key0, Key1]>,\n  Key3 extends KeysDeep<T, [Key0, Key1, Key2]>,\n  Key4 extends KeysDeep<T, [Key0, Key1, Key2, Key3]>,\n  Key5 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4]>,\n  Key6 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5]>,\n  Key7 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6]>,\n  Key8 extends KeysDeep<T, [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7]>,\n  Key9 extends KeysDeep<\n    T,\n    [Key0, Key1, Key2, Key3, Key4, Key5, Key6, Key7, Key8]\n  >,\n  AdditionalKeys extends ReadonlyArray<PropertyKey> = [],\n>(\n  key0: Key0,\n  key1: Key1,\n  key2: Key2,\n  key3: Key3,\n  key4: Key4,\n  key5: Key5,\n  key6: Key6,\n  key7: Key7,\n  key8: Key8,\n  key9: Key9,\n  ...additionalKeys: AdditionalKeys\n): (\n  data: T,\n) => NoInfer<\n  PropDeep<\n    T,\n    [\n      Key0,\n      Key1,\n      Key2,\n      Key3,\n      Key4,\n      Key5,\n      Key6,\n      Key7,\n      Key8,\n      Key9,\n      ...AdditionalKeys,\n    ]\n  >\n>;\n\nexport function prop<K extends PropertyKey>(\n  key: K,\n): <T extends Partial<Record<K, unknown>>>(data: T) => T[K];\n\nexport function prop(\n  maybeData: NonPropertyKey | PropertyKey,\n  ...args: ReadonlyArray<PropertyKey>\n): unknown {\n  return typeof maybeData === 'string'\n    || typeof maybeData === 'number'\n    || typeof maybeData === 'symbol'\n    ? (data: NonPropertyKey) => propImplementation(data, maybeData, ...args)\n    : propImplementation(maybeData, ...args);\n}\n\nfunction propImplementation(\n  data: NonPropertyKey,\n  ...keys: ReadonlyArray<PropertyKey>\n): unknown {\n  let output: unknown = data;\n  for (const key of keys) {\n    if (output === undefined || output === null) {\n      return undefined;\n    }\n    // @ts-expect-error [ts7053] -- This is fine, the types are really dynamic\n    // here and TypeScript doesn't have a chance to infer them correctly.\n    output = output[key];\n  }\n  return output;\n}\n"],"mappings":"AAwbA,SAAgB,EACd,EACA,GAAG,EACM,CACT,OAAO,OAAO,GAAc,UACvB,OAAO,GAAc,UACrB,OAAO,GAAc,SACrB,GAAyB,EAAmB,EAAM,EAAW,GAAG,EAAK,CACtE,EAAmB,EAAW,GAAG,EAAK,CAG5C,SAAS,EACP,EACA,GAAG,EACM,CACT,IAAIA,EAAkB,EACtB,IAAK,IAAM,KAAO,EAAM,CACtB,GAAI,GAAmC,KACrC,OAIF,EAAS,EAAO,GAElB,OAAO"}