@vinicunca/perkakas 1.12.0 → 1.13.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/add-prop.d.cts +1 -1
- package/dist/add-prop.d.ts +1 -1
- package/dist/add-prop.js +1 -1
- package/dist/add.js +1 -1
- package/dist/all-pass.js +1 -1
- package/dist/any-pass.js +1 -1
- package/dist/{array-required-prefix-DxzEAAwi.d.cts → array-required-prefix-BFDM7eSS.d.cts} +8 -8
- package/dist/{array-required-prefix-DxzEAAwi.d.cts.map → array-required-prefix-BFDM7eSS.d.cts.map} +1 -1
- package/dist/{array-required-prefix-CefHtaKs.d.ts → array-required-prefix-DwpaLy0D.d.ts} +8 -8
- package/dist/{array-required-prefix-CefHtaKs.d.ts.map → array-required-prefix-DwpaLy0D.d.ts.map} +1 -1
- package/dist/{binary-search-cutoff-index-yQ2qcJHb.js → binary-search-cutoff-index-CN25H71A.js} +1 -1
- package/dist/{binary-search-cutoff-index-yQ2qcJHb.js.map → binary-search-cutoff-index-CN25H71A.js.map} +1 -1
- package/dist/{bounded-partial-DBIIClPU.d.ts → bounded-partial-CPc1XU57.d.ts} +2 -2
- package/dist/{bounded-partial-DBIIClPU.d.ts.map → bounded-partial-CPc1XU57.d.ts.map} +1 -1
- package/dist/{bounded-partial-D6ouPlXl.d.cts → bounded-partial-CtOsGqxa.d.cts} +2 -2
- package/dist/{bounded-partial-D6ouPlXl.d.cts.map → bounded-partial-CtOsGqxa.d.cts.map} +1 -1
- package/dist/capitalize.cjs +1 -0
- package/dist/capitalize.d.cts +53 -0
- package/dist/capitalize.d.cts.map +1 -0
- package/dist/capitalize.d.ts +53 -0
- package/dist/capitalize.d.ts.map +1 -0
- package/dist/capitalize.js +2 -0
- package/dist/capitalize.js.map +1 -0
- package/dist/ceil.js +1 -1
- package/dist/chunk.d.cts +6 -6
- package/dist/chunk.d.ts +6 -6
- package/dist/chunk.js +1 -1
- package/dist/clamp.js +1 -1
- package/dist/{clamped-integer-subtract-sK2BlhSm.d.ts → clamped-integer-subtract-C-AIuFhk.d.ts} +1 -1
- package/dist/{clamped-integer-subtract-sK2BlhSm.d.ts.map → clamped-integer-subtract-C-AIuFhk.d.ts.map} +1 -1
- package/dist/{clamped-integer-subtract-oLs8msYu.d.cts → clamped-integer-subtract-DueGS_u_.d.cts} +1 -1
- package/dist/{clamped-integer-subtract-oLs8msYu.d.cts.map → clamped-integer-subtract-DueGS_u_.d.cts.map} +1 -1
- package/dist/clone.js +1 -1
- package/dist/{coerced-array-DS7cKtbA.d.cts → coerced-array-BKR9Bvsl.d.cts} +1 -1
- package/dist/{coerced-array-DS7cKtbA.d.cts.map → coerced-array-BKR9Bvsl.d.cts.map} +1 -1
- package/dist/{coerced-array-1Xs4p4iF.d.ts → coerced-array-BfTLxqLo.d.ts} +1 -1
- package/dist/{coerced-array-1Xs4p4iF.d.ts.map → coerced-array-BfTLxqLo.d.ts.map} +1 -1
- package/dist/concat.d.cts +1 -1
- package/dist/concat.d.ts +1 -1
- package/dist/concat.js +1 -1
- package/dist/{conditional-tssGt6Vy.d.cts → conditional-Br0uqqc9.d.cts} +1 -1
- package/dist/{conditional-tssGt6Vy.d.cts.map → conditional-Br0uqqc9.d.cts.map} +1 -1
- package/dist/{conditional-F_nq8vtA.d.ts → conditional-CDez6uXp.d.ts} +1 -1
- package/dist/{conditional-F_nq8vtA.d.ts.map → conditional-CDez6uXp.d.ts.map} +1 -1
- package/dist/{conditional-lp8ZHACd.js → conditional-WbmvQs8H.js} +1 -1
- package/dist/{conditional-lp8ZHACd.js.map → conditional-WbmvQs8H.js.map} +1 -1
- package/dist/conditional.d.cts +1 -1
- package/dist/conditional.d.ts +1 -1
- package/dist/conditional.js +1 -1
- package/dist/count-by.d.cts +1 -1
- package/dist/count-by.d.ts +1 -1
- package/dist/count-by.js +1 -1
- package/dist/{curry-d8_p_Jzt.d.ts → curry-CKDQ1osk.d.ts} +4 -2
- package/dist/curry-CKDQ1osk.d.ts.map +1 -0
- package/dist/{curry-BcQ8Up1_.js → curry-NmniqyJ0.js} +2 -2
- package/dist/curry-NmniqyJ0.js.map +1 -0
- package/dist/{curry-from-lazy-CYtJvyas.js → curry-from-lazy-PQ0BbG-7.js} +2 -2
- package/dist/{curry-from-lazy-CYtJvyas.js.map → curry-from-lazy-PQ0BbG-7.js.map} +1 -1
- package/dist/{curry-B20xQM_9.d.cts → curry-mh6BKSIA.d.cts} +4 -2
- package/dist/curry-mh6BKSIA.d.cts.map +1 -0
- package/dist/{curry-order-rules-cezUWcSx.d.cts → curry-order-rules-BoF09Dq2.d.cts} +1 -1
- package/dist/{curry-order-rules-cezUWcSx.d.cts.map → curry-order-rules-BoF09Dq2.d.cts.map} +1 -1
- package/dist/{curry-order-rules-BCcwbNxd.d.ts → curry-order-rules-CoO4bk5I.d.ts} +1 -1
- package/dist/{curry-order-rules-BCcwbNxd.d.ts.map → curry-order-rules-CoO4bk5I.d.ts.map} +1 -1
- package/dist/{curry-order-rules-C6bwcUwC.js → curry-order-rules-DwrF-_P1.js} +1 -1
- package/dist/{curry-order-rules-C6bwcUwC.js.map → curry-order-rules-DwrF-_P1.js.map} +1 -1
- package/dist/curry.d.cts +1 -1
- package/dist/curry.d.ts +1 -1
- package/dist/curry.js +1 -1
- package/dist/debounce.d.cts +5 -3
- package/dist/debounce.d.cts.map +1 -1
- package/dist/debounce.d.ts +5 -3
- package/dist/debounce.d.ts.map +1 -1
- package/dist/debounce.js.map +1 -1
- package/dist/{deduped-CXeQa-0F.d.cts → deduped-DdwAYzXs.d.cts} +3 -3
- package/dist/{deduped-CXeQa-0F.d.cts.map → deduped-DdwAYzXs.d.cts.map} +1 -1
- package/dist/{deduped-CL5-bmYU.d.ts → deduped-RY-1u-ns.d.ts} +3 -3
- package/dist/{deduped-CL5-bmYU.d.ts.map → deduped-RY-1u-ns.d.ts.map} +1 -1
- package/dist/difference-with.js +1 -1
- package/dist/difference.js +1 -1
- package/dist/dist-8XtUY3ad.cjs +114 -0
- package/dist/dist-Bd1vawFi.js +103 -0
- package/dist/dist-Bd1vawFi.js.map +1 -0
- package/dist/divide.js +1 -1
- package/dist/drop-first-by.d.cts +2 -2
- package/dist/drop-first-by.d.ts +2 -2
- package/dist/drop-first-by.js +1 -1
- package/dist/drop-last-while.d.cts +1 -1
- package/dist/drop-last-while.d.ts +1 -1
- package/dist/drop-last-while.js +1 -1
- package/dist/drop-last.d.cts +1 -1
- package/dist/drop-last.d.ts +1 -1
- package/dist/drop-last.js +1 -1
- package/dist/drop-while.d.cts +1 -1
- package/dist/drop-while.d.ts +1 -1
- package/dist/drop-while.js +1 -1
- package/dist/drop.d.cts +5 -5
- package/dist/drop.d.ts +5 -5
- package/dist/drop.js +1 -1
- package/dist/entries.d.cts +1 -1
- package/dist/entries.d.ts +1 -1
- package/dist/entries.js +1 -1
- package/dist/{enumerable-string-key-of-DMAkBhMk.d.ts → enumerable-string-key-of-CZQf3ld_.d.ts} +2 -2
- package/dist/{enumerable-string-key-of-DMAkBhMk.d.ts.map → enumerable-string-key-of-CZQf3ld_.d.ts.map} +1 -1
- package/dist/{enumerable-string-key-of-FUg082M_.d.cts → enumerable-string-key-of-DhcNc5iz.d.cts} +2 -2
- package/dist/{enumerable-string-key-of-FUg082M_.d.cts.map → enumerable-string-key-of-DhcNc5iz.d.cts.map} +1 -1
- package/dist/{enumerable-string-keyed-value-of-B2F2aTB7.d.ts → enumerable-string-keyed-value-of-CRlVAvdp.d.ts} +1 -1
- package/dist/{enumerable-string-keyed-value-of-B2F2aTB7.d.ts.map → enumerable-string-keyed-value-of-CRlVAvdp.d.ts.map} +1 -1
- package/dist/{enumerable-string-keyed-value-of-CEclDoqe.d.cts → enumerable-string-keyed-value-of-icm2q60J.d.cts} +1 -1
- package/dist/{enumerable-string-keyed-value-of-CEclDoqe.d.cts.map → enumerable-string-keyed-value-of-icm2q60J.d.cts.map} +1 -1
- package/dist/evolve.d.cts +1 -1
- package/dist/evolve.d.ts +1 -1
- package/dist/evolve.js +1 -1
- package/dist/filter.d.cts +2 -2
- package/dist/filter.d.ts +2 -2
- package/dist/filter.js +1 -1
- package/dist/filtered-array-C--8loav.d.cts +22 -0
- package/dist/filtered-array-C--8loav.d.cts.map +1 -0
- package/dist/filtered-array-wtIEwdU7.d.ts +22 -0
- package/dist/filtered-array-wtIEwdU7.d.ts.map +1 -0
- package/dist/find-index.js +1 -1
- package/dist/find-last-index.js +1 -1
- package/dist/find-last.js +1 -1
- package/dist/find.js +1 -1
- package/dist/first-by.d.cts +3 -3
- package/dist/first-by.d.ts +3 -3
- package/dist/first-by.js +1 -1
- package/dist/first.d.cts +1 -1
- package/dist/first.d.ts +1 -1
- package/dist/first.js +1 -1
- package/dist/flat-map.js +1 -1
- package/dist/flat.d.cts +1 -1
- package/dist/flat.d.ts +1 -1
- package/dist/flat.js +1 -1
- package/dist/floor.js +1 -1
- package/dist/for-each-obj.d.cts +2 -2
- package/dist/for-each-obj.d.ts +2 -2
- package/dist/for-each-obj.js +1 -1
- package/dist/for-each.d.cts +1 -1
- package/dist/for-each.d.ts +1 -1
- package/dist/for-each.js +1 -1
- package/dist/from-entries.d.cts +2 -2
- package/dist/from-entries.d.ts +2 -2
- package/dist/from-entries.js +1 -1
- package/dist/from-keys.d.cts +2 -2
- package/dist/from-keys.d.ts +2 -2
- package/dist/from-keys.js +1 -1
- package/dist/funnel.d.cts.map +1 -1
- package/dist/funnel.d.ts.map +1 -1
- package/dist/funnel.lodash-debounce-with-cached-value.test.cjs +1 -1
- package/dist/funnel.lodash-debounce-with-cached-value.test.js +1 -1
- package/dist/funnel.lodash-debounce-with-cached-value.test.js.map +1 -1
- package/dist/funnel.lodash-debounce.test.cjs +1 -1
- package/dist/funnel.lodash-debounce.test.js +1 -1
- package/dist/funnel.lodash-throttle-with-cached-value.test.cjs +1 -1
- package/dist/funnel.lodash-throttle-with-cached-value.test.js +1 -1
- package/dist/funnel.lodash-throttle-with-cached-value.test.js.map +1 -1
- package/dist/funnel.lodash-throttle.test.cjs +1 -1
- package/dist/funnel.lodash-throttle.test.js +1 -1
- package/dist/funnel.perkakas-debounce.test.cjs +1 -1
- package/dist/funnel.perkakas-debounce.test.js +1 -1
- package/dist/funnel.perkakas-debounce.test.js.map +1 -1
- package/dist/funnel.reference-batch.test.cjs +1 -1
- package/dist/funnel.reference-batch.test.js +1 -1
- package/dist/funnel.reference-batch.test.js.map +1 -1
- package/dist/funnel.test-d.cjs +1 -1
- package/dist/funnel.test-d.js +1 -1
- package/dist/funnel.test.cjs +1 -1
- package/dist/funnel.test.js +1 -1
- package/dist/funnel.test.js.map +1 -1
- package/dist/group-by-prop.d.cts +10 -10
- package/dist/group-by-prop.d.ts +10 -10
- package/dist/group-by-prop.js +1 -1
- package/dist/group-by-prop.js.map +1 -1
- package/dist/group-by.d.cts +2 -2
- package/dist/group-by.d.ts +2 -2
- package/dist/group-by.js +1 -1
- package/dist/has-at-least-Coy9sM-B.js +2 -0
- package/dist/{has-at-least-DyIhWZJH.js.map → has-at-least-Coy9sM-B.js.map} +1 -1
- package/dist/has-at-least.d.cts +2 -2
- package/dist/has-at-least.d.ts +2 -2
- package/dist/has-at-least.js +1 -1
- package/dist/has-sub-object.js +1 -1
- package/dist/{heap-bARaRULU.js → heap-BhpfhYWj.js} +2 -2
- package/dist/{heap-bARaRULU.js.map → heap-BhpfhYWj.js.map} +1 -1
- package/dist/index-by.d.cts +1 -1
- package/dist/index-by.d.ts +1 -1
- package/dist/index-by.js +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +12 -14
- package/dist/index.d.cts.map +1 -1
- package/dist/index.d.ts +12 -14
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +1 -1
- package/dist/index.js.map +1 -1
- package/dist/{int-range-inclusive-ClGdUant.d.ts → int-range-inclusive-BlGXX6Cz.d.ts} +1 -1
- package/dist/{int-range-inclusive-ClGdUant.d.ts.map → int-range-inclusive-BlGXX6Cz.d.ts.map} +1 -1
- package/dist/{int-range-inclusive-q-Jb7w6P.d.cts → int-range-inclusive-KocNpK0p.d.cts} +1 -1
- package/dist/{int-range-inclusive-q-Jb7w6P.d.cts.map → int-range-inclusive-KocNpK0p.d.cts.map} +1 -1
- package/dist/intersection-with.js +1 -1
- package/dist/intersection.js +1 -1
- package/dist/invert.d.cts +1 -1
- package/dist/invert.d.ts +1 -1
- package/dist/invert.js +1 -1
- package/dist/is-array.d.cts +1 -1
- package/dist/is-array.d.ts +1 -1
- package/dist/is-big-int.d.cts +1 -1
- package/dist/is-big-int.d.ts +1 -1
- package/dist/is-boolean.d.cts +1 -1
- package/dist/is-boolean.d.ts +1 -1
- package/dist/{is-bounded-record-BGclJjRX.d.ts → is-bounded-record-Bx4n8QB0.d.ts} +1 -1
- package/dist/{is-bounded-record-BGclJjRX.d.ts.map → is-bounded-record-Bx4n8QB0.d.ts.map} +1 -1
- package/dist/{is-bounded-record-D9YK_OC8.d.cts → is-bounded-record-DV6ZQk9H.d.cts} +1 -1
- package/dist/{is-bounded-record-D9YK_OC8.d.cts.map → is-bounded-record-DV6ZQk9H.d.cts.map} +1 -1
- package/dist/is-deep-equal.js +1 -1
- package/dist/is-empty.d.cts +1 -1
- package/dist/is-empty.d.ts +1 -1
- package/dist/{is-emptyish-CIxZzxxz.d.ts → is-emptyish-9tX94IVx.d.cts} +2 -3
- package/dist/is-emptyish-9tX94IVx.d.cts.map +1 -0
- package/dist/{is-emptyish-oX5mpcfW.d.cts → is-emptyish-DVFGJe-T.d.ts} +2 -3
- package/dist/is-emptyish-DVFGJe-T.d.ts.map +1 -0
- package/dist/is-emptyish.d.cts +1 -1
- package/dist/is-emptyish.d.ts +1 -1
- package/dist/is-emptyish.js.map +1 -1
- package/dist/is-emptyish.test-d.cjs +1 -1
- package/dist/is-emptyish.test-d.js +1 -1
- package/dist/is-emptyish.test.cjs +1 -1
- package/dist/is-emptyish.test.js +1 -1
- package/dist/is-function.d.cts +5 -2
- package/dist/is-function.d.cts.map +1 -1
- package/dist/is-function.d.ts +5 -2
- package/dist/is-function.d.ts.map +1 -1
- package/dist/is-function.js.map +1 -1
- package/dist/is-included-in.d.cts +2 -3
- package/dist/is-included-in.d.cts.map +1 -1
- package/dist/is-included-in.d.ts +2 -3
- package/dist/is-included-in.d.ts.map +1 -1
- package/dist/is-included-in.js.map +1 -1
- package/dist/is-nullish.d.cts +1 -1
- package/dist/is-nullish.d.ts +1 -1
- package/dist/is-number.d.cts +1 -1
- package/dist/is-number.d.ts +1 -1
- package/dist/is-object-type.d.cts +1 -1
- package/dist/is-object-type.d.ts +1 -1
- package/dist/is-plain-object.d.cts +1 -1
- package/dist/is-plain-object.d.ts +1 -1
- package/dist/is-shallow-equal.js +1 -1
- package/dist/is-strict-equal.js +1 -1
- package/dist/is-string.d.cts +1 -1
- package/dist/is-string.d.ts +1 -1
- package/dist/is-symbol.d.cts +1 -1
- package/dist/is-symbol.d.ts +1 -1
- package/dist/{iterable-container-OFsaw8WL.d.cts → iterable-container-1TN3AJ3s.d.cts} +1 -1
- package/dist/{iterable-container-OFsaw8WL.d.cts.map → iterable-container-1TN3AJ3s.d.cts.map} +1 -1
- package/dist/{iterable-container-BdjPuIjL.d.ts → iterable-container-Dv5vSKht.d.ts} +1 -1
- package/dist/iterable-container-Dv5vSKht.d.ts.map +1 -0
- package/dist/join.js +1 -1
- package/dist/keys.d.cts +3 -3
- package/dist/keys.d.ts +3 -3
- package/dist/keys.js +1 -1
- package/dist/last.d.cts +1 -1
- package/dist/last.d.ts +1 -1
- package/dist/last.js +1 -1
- package/dist/{lazy-data-last-impl-DW5TXWv8.js → lazy-data-last-impl-R05wr4K6.js} +1 -1
- package/dist/lazy-data-last-impl-R05wr4K6.js.map +1 -0
- package/dist/length.js +1 -1
- package/dist/{magic-string.es-BY9a6RR2.js → magic-string.es-94aXgwpn.js} +1 -1
- package/dist/{magic-string.es-BY9a6RR2.js.map → magic-string.es-94aXgwpn.js.map} +1 -1
- package/dist/map-keys.d.cts +3 -3
- package/dist/map-keys.d.ts +3 -3
- package/dist/map-keys.js +1 -1
- package/dist/map-to-obj.js +1 -1
- package/dist/map-values.d.cts +2 -2
- package/dist/map-values.d.ts +2 -2
- package/dist/map-values.js +1 -1
- package/dist/map-with-feedback.d.cts +2 -2
- package/dist/map-with-feedback.d.ts +2 -2
- package/dist/map-with-feedback.js +1 -1
- package/dist/map.d.cts +2 -2
- package/dist/map.d.ts +2 -2
- package/dist/map.js +1 -1
- package/dist/{mapped-LCblUtt3.d.ts → mapped-BbrC9t3s.d.ts} +2 -2
- package/dist/mapped-BbrC9t3s.d.ts.map +1 -0
- package/dist/{mapped-m3FRlUOA.d.cts → mapped-CkRNfTnY.d.cts} +2 -2
- package/dist/mapped-CkRNfTnY.d.cts.map +1 -0
- package/dist/mean-by.js +1 -1
- package/dist/{merge-all-CW8DGAy8.d.cts → merge-all-CISawx-J.d.cts} +4 -4
- package/dist/{merge-all-CW8DGAy8.d.cts.map → merge-all-CISawx-J.d.cts.map} +1 -1
- package/dist/{merge-all-B9JBhVzy.d.ts → merge-all-DJ6n7R1b.d.ts} +4 -4
- package/dist/{merge-all-B9JBhVzy.d.ts.map → merge-all-DJ6n7R1b.d.ts.map} +1 -1
- package/dist/merge-all.d.cts +1 -1
- package/dist/merge-all.d.ts +1 -1
- package/dist/merge-deep.js +1 -1
- package/dist/merge.js +1 -1
- package/dist/multiply.js +1 -1
- package/dist/{n-tuple-Bu1e7UH_.d.cts → n-tuple-BkMobYQ9.d.cts} +1 -1
- package/dist/{n-tuple-Bu1e7UH_.d.cts.map → n-tuple-BkMobYQ9.d.cts.map} +1 -1
- package/dist/{n-tuple-DoE0z7Kl.d.ts → n-tuple-zo5g_mSL.d.ts} +1 -1
- package/dist/{n-tuple-DoE0z7Kl.d.ts.map → n-tuple-zo5g_mSL.d.ts.map} +1 -1
- package/dist/{narrowed-to-j75i8Rl2.d.ts → narrowed-to-B7tkuY2k.d.ts} +1 -1
- package/dist/{narrowed-to-j75i8Rl2.d.ts.map → narrowed-to-B7tkuY2k.d.ts.map} +1 -1
- package/dist/{narrowed-to-Yf5qTOcD.d.cts → narrowed-to-D_6H-aZW.d.cts} +1 -1
- package/dist/{narrowed-to-Yf5qTOcD.d.cts.map → narrowed-to-D_6H-aZW.d.cts.map} +1 -1
- package/dist/{non-empty-array-DXkY7ynY.d.ts → non-empty-array-DHAKSw6t.d.ts} +1 -1
- package/dist/non-empty-array-DHAKSw6t.d.ts.map +1 -0
- package/dist/{non-empty-array-CFG7wGD-.d.cts → non-empty-array-NDjbHRjk.d.cts} +1 -1
- package/dist/non-empty-array-NDjbHRjk.d.cts.map +1 -0
- package/dist/{nth-by-Bs6FNGL-.js → nth-by-JP3-Htbo.js} +2 -2
- package/dist/{nth-by-Bs6FNGL-.js.map → nth-by-JP3-Htbo.js.map} +1 -1
- package/dist/nth-by.d.cts +3 -3
- package/dist/nth-by.d.ts +3 -3
- package/dist/nth-by.js +1 -1
- package/dist/obj-of.js +1 -1
- package/dist/omit-DI8DRDHj.d.ts +71 -0
- package/dist/omit-DI8DRDHj.d.ts.map +1 -0
- package/dist/omit-DQiCiWAg.d.cts +71 -0
- package/dist/omit-DQiCiWAg.d.cts.map +1 -0
- package/dist/omit-by.d.cts +3 -3
- package/dist/omit-by.d.ts +3 -3
- package/dist/omit-by.js +1 -1
- package/dist/omit.d.cts +2 -29
- package/dist/omit.d.ts +2 -29
- package/dist/omit.js +1 -1
- package/dist/omit.js.map +1 -1
- package/dist/only.d.cts +1 -1
- package/dist/only.d.ts +1 -1
- package/dist/only.js +1 -1
- package/dist/optional-options-with-defaults-BFaBSKkF.d.ts +12 -0
- package/dist/optional-options-with-defaults-BFaBSKkF.d.ts.map +1 -0
- package/dist/optional-options-with-defaults-BZVW8GfC.d.cts +12 -0
- package/dist/optional-options-with-defaults-BZVW8GfC.d.cts.map +1 -0
- package/dist/{partial-array-CoV_xxyQ.d.cts → partial-array-CQF5oggb.d.cts} +1 -1
- package/dist/partial-array-CQF5oggb.d.cts.map +1 -0
- package/dist/{partial-array-CeoXpbZU.d.ts → partial-array-DU-2Vkyx.d.ts} +1 -1
- package/dist/partial-array-DU-2Vkyx.d.ts.map +1 -0
- package/dist/partition-by-union-BztEpKVh.d.cts +20 -0
- package/dist/partition-by-union-BztEpKVh.d.cts.map +1 -0
- package/dist/partition-by-union-DnfiiEMU.d.ts +20 -0
- package/dist/partition-by-union-DnfiiEMU.d.ts.map +1 -0
- package/dist/partition.js +1 -1
- package/dist/path-or.js +1 -1
- package/dist/{perkakas-type-error-DmmsEmEF.d.ts → perkakas-type-error-B9ULNhW0.d.ts} +1 -1
- package/dist/{perkakas-type-error-DmmsEmEF.d.ts.map → perkakas-type-error-B9ULNhW0.d.ts.map} +1 -1
- package/dist/{perkakas-type-error-BERl_sWR.d.cts → perkakas-type-error-ClCCHBW1.d.cts} +1 -1
- package/dist/{perkakas-type-error-BERl_sWR.d.cts.map → perkakas-type-error-ClCCHBW1.d.cts.map} +1 -1
- package/dist/pick-by.d.cts +4 -4
- package/dist/pick-by.d.cts.map +1 -1
- package/dist/pick-by.d.ts +4 -4
- package/dist/pick-by.d.ts.map +1 -1
- package/dist/pick-by.js +1 -1
- package/dist/pick-by.js.map +1 -1
- package/dist/pick.d.cts +4 -15
- package/dist/pick.d.cts.map +1 -1
- package/dist/pick.d.ts +4 -15
- package/dist/pick.d.ts.map +1 -1
- package/dist/pick.js +1 -1
- package/dist/pick.js.map +1 -1
- package/dist/{pipe-BGazHnZ_.js → pipe-CZKusDA-.js} +2 -2
- package/dist/pipe-CZKusDA-.js.map +1 -0
- package/dist/pipe.d.cts +95 -23
- package/dist/pipe.d.cts.map +1 -1
- package/dist/pipe.d.ts +95 -23
- package/dist/pipe.d.ts.map +1 -1
- package/dist/pipe.js +1 -1
- package/dist/piped.js +1 -1
- package/dist/product.d.cts +2 -2
- package/dist/product.d.ts +2 -2
- package/dist/product.js +1 -1
- package/dist/product.js.map +1 -1
- package/dist/{prop-DulcbWGG.d.ts → prop-D-4cFXSd.d.cts} +5 -6
- package/dist/prop-D-4cFXSd.d.cts.map +1 -0
- package/dist/{prop-C3rYih5m.d.cts → prop-DL-oRBeN.d.ts} +5 -6
- package/dist/prop-DL-oRBeN.d.ts.map +1 -0
- package/dist/prop.d.cts +1 -1
- package/dist/prop.d.ts +1 -1
- package/dist/prop.js.map +1 -1
- package/dist/pull-object.d.cts +2 -2
- package/dist/pull-object.d.ts +2 -2
- package/dist/pull-object.js +1 -1
- package/dist/random-integer.d.cts +1 -1
- package/dist/random-integer.d.ts +1 -1
- package/dist/random-string.js +1 -1
- package/dist/range.js +1 -1
- package/dist/rank-by.d.cts +2 -2
- package/dist/rank-by.d.ts +2 -2
- package/dist/rank-by.js +1 -1
- package/dist/reduce.js +1 -1
- package/dist/{reordered-array-B2klHneX.d.ts → reordered-array-BWG6tVSK.d.ts} +2 -2
- package/dist/reordered-array-BWG6tVSK.d.ts.map +1 -0
- package/dist/{reordered-array-BsUBOnYh.d.cts → reordered-array-CmReuxDi.d.cts} +2 -2
- package/dist/reordered-array-CmReuxDi.d.cts.map +1 -0
- package/dist/reverse.js +1 -1
- package/dist/round.js +1 -1
- package/dist/sample.d.cts +5 -5
- package/dist/sample.d.ts +5 -5
- package/dist/sample.js +1 -1
- package/dist/set-path.d.cts +1 -1
- package/dist/set-path.d.ts +1 -1
- package/dist/set-path.js +1 -1
- package/dist/set.d.cts +1 -1
- package/dist/set.d.ts +1 -1
- package/dist/set.js +1 -1
- package/dist/shuffle.d.cts +2 -2
- package/dist/shuffle.d.ts +2 -2
- package/dist/shuffle.js +1 -1
- package/dist/sort-by.d.cts +4 -4
- package/dist/sort-by.d.ts +4 -4
- package/dist/sort-by.js +1 -1
- package/dist/sort.d.cts +2 -2
- package/dist/sort.d.ts +2 -2
- package/dist/sort.js +1 -1
- package/dist/sorted-index-by.js +1 -1
- package/dist/sorted-index-with.js +1 -1
- package/dist/sorted-index.js +1 -1
- package/dist/sorted-last-index-by.js +1 -1
- package/dist/sorted-last-index.js +1 -1
- package/dist/splice.js +1 -1
- package/dist/split-at.js +1 -1
- package/dist/split-when.js +1 -1
- package/dist/split.d.cts +8 -8
- package/dist/split.d.cts.map +1 -1
- package/dist/split.d.ts +8 -8
- package/dist/split.d.ts.map +1 -1
- package/dist/split.js.map +1 -1
- package/dist/strict-function-BBgKFNUw.d.ts +26 -0
- package/dist/strict-function-BBgKFNUw.d.ts.map +1 -0
- package/dist/strict-function-CPTwDgnZ.d.cts +26 -0
- package/dist/strict-function-CPTwDgnZ.d.cts.map +1 -0
- package/dist/subtract.js +1 -1
- package/dist/sum-by.d.cts +1 -1
- package/dist/sum-by.d.ts +1 -1
- package/dist/sum-by.js +1 -1
- package/dist/sum.d.cts +1 -1
- package/dist/sum.d.ts +1 -1
- package/dist/sum.js +1 -1
- package/dist/{swap-in-place-COm7qHj4.js → swap-in-place-C_jXKHuD.js} +1 -1
- package/dist/{swap-in-place-COm7qHj4.js.map → swap-in-place-C_jXKHuD.js.map} +1 -1
- package/dist/swap-indices.d.cts +1 -1
- package/dist/swap-indices.d.ts +1 -1
- package/dist/swap-indices.js +1 -1
- package/dist/swap-props.js +1 -1
- package/dist/take-first-by.d.cts +2 -2
- package/dist/take-first-by.d.ts +2 -2
- package/dist/take-first-by.js +1 -1
- package/dist/take-last-while.d.cts +1 -1
- package/dist/take-last-while.d.ts +1 -1
- package/dist/take-last-while.js +1 -1
- package/dist/take-last.d.cts +1 -1
- package/dist/take-last.d.ts +1 -1
- package/dist/take-last.js +1 -1
- package/dist/take-while.d.cts +1 -1
- package/dist/take-while.d.ts +1 -1
- package/dist/take-while.js +1 -1
- package/dist/take.d.cts +1 -1
- package/dist/take.d.ts +1 -1
- package/dist/take.js +1 -1
- package/dist/tap.js +1 -1
- package/dist/times.js +1 -1
- package/dist/to-camel-case.cjs +1 -1
- package/dist/to-camel-case.d.cts +72 -20
- package/dist/to-camel-case.d.cts.map +1 -1
- package/dist/to-camel-case.d.ts +72 -20
- package/dist/to-camel-case.d.ts.map +1 -1
- package/dist/to-camel-case.js +1 -1
- package/dist/to-camel-case.js.map +1 -1
- package/dist/to-kebab-case.cjs +1 -1
- package/dist/to-kebab-case.d.cts +48 -19
- package/dist/to-kebab-case.d.cts.map +1 -1
- package/dist/to-kebab-case.d.ts +48 -19
- package/dist/to-kebab-case.d.ts.map +1 -1
- package/dist/to-kebab-case.js +1 -1
- package/dist/to-kebab-case.js.map +1 -1
- package/dist/to-lower-case.cjs +1 -0
- package/dist/to-lower-case.d.cts +51 -0
- package/dist/to-lower-case.d.cts.map +1 -0
- package/dist/to-lower-case.d.ts +51 -0
- package/dist/to-lower-case.d.ts.map +1 -0
- package/dist/to-lower-case.js +2 -0
- package/dist/to-lower-case.js.map +1 -0
- package/dist/{to-single-vYpRavjM.js → to-single-BKYbBic-.js} +1 -1
- package/dist/to-single-BKYbBic-.js.map +1 -0
- package/dist/to-snake-case.cjs +1 -1
- package/dist/to-snake-case.d.cts +48 -19
- package/dist/to-snake-case.d.cts.map +1 -1
- package/dist/to-snake-case.d.ts +48 -19
- package/dist/to-snake-case.d.ts.map +1 -1
- package/dist/to-snake-case.js +1 -1
- package/dist/to-snake-case.js.map +1 -1
- package/dist/{to-string-Se4KcQka.d.cts → to-string-DkC3zRUJ.d.cts} +1 -1
- package/dist/to-string-DkC3zRUJ.d.cts.map +1 -0
- package/dist/{to-string-C6_OnZ6e.d.ts → to-string-YIFx2KS6.d.ts} +1 -1
- package/dist/to-string-YIFx2KS6.d.ts.map +1 -0
- package/dist/to-title-case.cjs +1 -0
- package/dist/to-title-case.d.cts +86 -0
- package/dist/to-title-case.d.cts.map +1 -0
- package/dist/to-title-case.d.ts +86 -0
- package/dist/to-title-case.d.ts.map +1 -0
- package/dist/to-title-case.js +2 -0
- package/dist/to-title-case.js.map +1 -0
- package/dist/to-upper-case.cjs +1 -0
- package/dist/to-upper-case.d.cts +51 -0
- package/dist/to-upper-case.d.cts.map +1 -0
- package/dist/to-upper-case.d.ts +51 -0
- package/dist/to-upper-case.d.ts.map +1 -0
- package/dist/to-upper-case.js +2 -0
- package/dist/to-upper-case.js.map +1 -0
- package/dist/{tuple-parts-Bhbm4jiu.d.ts → tuple-parts-BYI4o8Vk.d.ts} +8 -8
- package/dist/{tuple-parts-Bhbm4jiu.d.ts.map → tuple-parts-BYI4o8Vk.d.ts.map} +1 -1
- package/dist/{tuple-parts-BJQEORxn.d.cts → tuple-parts-CzQQupgi.d.cts} +8 -8
- package/dist/{tuple-parts-BJQEORxn.d.cts.map → tuple-parts-CzQQupgi.d.cts.map} +1 -1
- package/dist/uncapitalize.cjs +1 -0
- package/dist/uncapitalize.d.cts +51 -0
- package/dist/uncapitalize.d.cts.map +1 -0
- package/dist/uncapitalize.d.ts +51 -0
- package/dist/uncapitalize.d.ts.map +1 -0
- package/dist/uncapitalize.js +2 -0
- package/dist/uncapitalize.js.map +1 -0
- package/dist/unique-by.d.cts +2 -2
- package/dist/unique-by.d.ts +2 -2
- package/dist/unique-by.js +1 -1
- package/dist/unique-with.d.cts +2 -2
- package/dist/unique-with.d.ts +2 -2
- package/dist/unique-with.js +1 -1
- package/dist/unique.d.cts +2 -2
- package/dist/unique.d.ts +2 -2
- package/dist/unique.js +1 -1
- package/dist/{upsert-prop-__xTQQ07.d.ts → upsert-prop-0hwik6JJ.d.cts} +2 -3
- package/dist/{upsert-prop-__xTQQ07.d.ts.map → upsert-prop-0hwik6JJ.d.cts.map} +1 -1
- package/dist/{upsert-prop-P-aJDDII.d.cts → upsert-prop-_NpaZwm4.d.ts} +2 -3
- package/dist/upsert-prop-_NpaZwm4.d.ts.map +1 -0
- package/dist/{utility-evaluators-BwYLtB8b.js → utility-evaluators-Boc-TMbq.js} +1 -1
- package/dist/{utility-evaluators-BwYLtB8b.js.map → utility-evaluators-Boc-TMbq.js.map} +1 -1
- package/dist/values.d.cts +2 -2
- package/dist/values.d.ts +2 -2
- package/dist/values.js +1 -1
- package/dist/{with-precision-CWWiMmxZ.js → with-precision-CQ90Walk.js} +1 -1
- package/dist/{with-precision-CWWiMmxZ.js.map → with-precision-CQ90Walk.js.map} +1 -1
- package/dist/words-DQCM5umD.js +3 -0
- package/dist/words-DQCM5umD.js.map +1 -0
- package/dist/words-DRQKxzLU.cjs +2 -0
- package/dist/zip-with.d.cts +1 -1
- package/dist/zip-with.d.ts +1 -1
- package/dist/zip-with.js +1 -1
- package/dist/zip.d.cts +1 -1
- package/dist/zip.d.ts +1 -1
- package/dist/zip.js +1 -1
- package/package.json +4 -6
- package/dist/case.transform-CCMWrBmz.js +0 -2
- package/dist/case.transform-CCMWrBmz.js.map +0 -1
- package/dist/case.transform-FNx2XsC3.cjs +0 -1
- package/dist/case.types-BxuWJgN1.d.cts +0 -19
- package/dist/case.types-BxuWJgN1.d.cts.map +0 -1
- package/dist/case.types-CVfGg990.d.ts +0 -19
- package/dist/case.types-CVfGg990.d.ts.map +0 -1
- package/dist/curry-B20xQM_9.d.cts.map +0 -1
- package/dist/curry-BcQ8Up1_.js.map +0 -1
- package/dist/curry-d8_p_Jzt.d.ts.map +0 -1
- package/dist/dist-CUT1dnRU.js +0 -343
- package/dist/dist-CUT1dnRU.js.map +0 -1
- package/dist/dist-CiyBKPT6.cjs +0 -343
- package/dist/filtered-array-D_RqQ8tX.d.cts +0 -13
- package/dist/filtered-array-D_RqQ8tX.d.cts.map +0 -1
- package/dist/filtered-array-Yij-X3T4.d.ts +0 -13
- package/dist/filtered-array-Yij-X3T4.d.ts.map +0 -1
- package/dist/has-at-least-DyIhWZJH.js +0 -2
- package/dist/is-emptyish-CIxZzxxz.d.ts.map +0 -1
- package/dist/is-emptyish-oX5mpcfW.d.cts.map +0 -1
- package/dist/is-union-Bu19sEkP.d.ts +0 -8
- package/dist/is-union-Bu19sEkP.d.ts.map +0 -1
- package/dist/is-union-Dp9mCo1b.d.cts +0 -8
- package/dist/is-union-Dp9mCo1b.d.cts.map +0 -1
- package/dist/iterable-container-BdjPuIjL.d.ts.map +0 -1
- package/dist/lazy-data-last-impl-DW5TXWv8.js.map +0 -1
- package/dist/mapped-LCblUtt3.d.ts.map +0 -1
- package/dist/mapped-m3FRlUOA.d.cts.map +0 -1
- package/dist/no-infer-BIHbaQcD.d.ts +0 -5
- package/dist/no-infer-BIHbaQcD.d.ts.map +0 -1
- package/dist/no-infer-BVbyldno.d.cts +0 -5
- package/dist/no-infer-BVbyldno.d.cts.map +0 -1
- package/dist/non-empty-array-CFG7wGD-.d.cts.map +0 -1
- package/dist/non-empty-array-DXkY7ynY.d.ts.map +0 -1
- package/dist/omit.d.cts.map +0 -1
- package/dist/omit.d.ts.map +0 -1
- package/dist/partial-array-CeoXpbZU.d.ts.map +0 -1
- package/dist/partial-array-CoV_xxyQ.d.cts.map +0 -1
- package/dist/pipe-BGazHnZ_.js.map +0 -1
- package/dist/prop-C3rYih5m.d.cts.map +0 -1
- package/dist/prop-DulcbWGG.d.ts.map +0 -1
- package/dist/reordered-array-B2klHneX.d.ts.map +0 -1
- package/dist/reordered-array-BsUBOnYh.d.cts.map +0 -1
- package/dist/to-capital-case.cjs +0 -1
- package/dist/to-capital-case.d.cts +0 -31
- package/dist/to-capital-case.d.cts.map +0 -1
- package/dist/to-capital-case.d.ts +0 -31
- package/dist/to-capital-case.d.ts.map +0 -1
- package/dist/to-capital-case.js +0 -2
- package/dist/to-capital-case.js.map +0 -1
- package/dist/to-constant-case.cjs +0 -1
- package/dist/to-constant-case.d.cts +0 -31
- package/dist/to-constant-case.d.cts.map +0 -1
- package/dist/to-constant-case.d.ts +0 -31
- package/dist/to-constant-case.d.ts.map +0 -1
- package/dist/to-constant-case.js +0 -2
- package/dist/to-constant-case.js.map +0 -1
- package/dist/to-no-case.cjs +0 -1
- package/dist/to-no-case.d.cts +0 -31
- package/dist/to-no-case.d.cts.map +0 -1
- package/dist/to-no-case.d.ts +0 -31
- package/dist/to-no-case.d.ts.map +0 -1
- package/dist/to-no-case.js +0 -2
- package/dist/to-no-case.js.map +0 -1
- package/dist/to-pascal-case.cjs +0 -1
- package/dist/to-pascal-case.d.cts +0 -32
- package/dist/to-pascal-case.d.cts.map +0 -1
- package/dist/to-pascal-case.d.ts +0 -32
- package/dist/to-pascal-case.d.ts.map +0 -1
- package/dist/to-pascal-case.js +0 -2
- package/dist/to-pascal-case.js.map +0 -1
- package/dist/to-pascal-snake-case.cjs +0 -1
- package/dist/to-pascal-snake-case.d.cts +0 -31
- package/dist/to-pascal-snake-case.d.cts.map +0 -1
- package/dist/to-pascal-snake-case.d.ts +0 -31
- package/dist/to-pascal-snake-case.d.ts.map +0 -1
- package/dist/to-pascal-snake-case.js +0 -2
- package/dist/to-pascal-snake-case.js.map +0 -1
- package/dist/to-sentence-case.cjs +0 -1
- package/dist/to-sentence-case.d.cts +0 -31
- package/dist/to-sentence-case.d.cts.map +0 -1
- package/dist/to-sentence-case.d.ts +0 -31
- package/dist/to-sentence-case.d.ts.map +0 -1
- package/dist/to-sentence-case.js +0 -2
- package/dist/to-sentence-case.js.map +0 -1
- package/dist/to-single-vYpRavjM.js.map +0 -1
- package/dist/to-string-C6_OnZ6e.d.ts.map +0 -1
- package/dist/to-string-Se4KcQka.d.cts.map +0 -1
- package/dist/to-train-case.cjs +0 -1
- package/dist/to-train-case.d.cts +0 -31
- package/dist/to-train-case.d.cts.map +0 -1
- package/dist/to-train-case.d.ts +0 -31
- package/dist/to-train-case.d.ts.map +0 -1
- package/dist/to-train-case.js +0 -2
- package/dist/to-train-case.js.map +0 -1
- package/dist/upsert-prop-P-aJDDII.d.cts.map +0 -1
package/dist/{perkakas-type-error-BERl_sWR.d.cts.map → perkakas-type-error-ClCCHBW1.d.cts.map}
RENAMED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"perkakas-type-error-
|
|
1
|
+
{"version":3,"file":"perkakas-type-error-ClCCHBW1.d.cts","names":[],"sources":["../src/internal/types/perkakas-type-error.ts"],"sourcesContent":[],"mappings":";;;cAIM;UAEI,wBAAA;EAFJ,IAAA,CAAA,EAAA,OAAA;EAEI,QAAA,CAAA,EAAA,OAAA;AAQV;;;;AASuB,KATX,iBASW,CAAA,qBAAA,MAAA,EAAA,gBAAA,MAAA,GAAA,MAAA,EAAA,gBAHL,wBAGK,GAAA,CAAA,CAAA,CAAA,GAFnB,MAEmB,CADrB,OACqB,SAAA;EAAkB,IAAA,EAAA,KAAA,EAAA;CACvC,GAAA,CAAA,GAAA,OAF+C,mBAE/C,EAAA,qBADqB,YACrB,MADuC,OACvC,GAAA,EAAA,OAAA,SAAA;EAHE,QAAA,EAAA,KAAA,SAAA;CAAM,GAAA,QAAA,GAAA,KAAA,CAAA"}
|
package/dist/pick-by.d.cts
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
import { t as IsBoundedRecord } from "./is-bounded-record-
|
|
2
|
-
import { t as ToString } from "./to-string-
|
|
3
|
-
import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-
|
|
4
|
-
import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-
|
|
1
|
+
import { t as IsBoundedRecord } from "./is-bounded-record-DV6ZQk9H.cjs";
|
|
2
|
+
import { t as ToString } from "./to-string-DkC3zRUJ.cjs";
|
|
3
|
+
import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-DhcNc5iz.cjs";
|
|
4
|
+
import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-icm2q60J.cjs";
|
|
5
5
|
import { IsNever, Simplify } from "type-fest";
|
|
6
6
|
|
|
7
7
|
//#region src/pick-by.d.ts
|
package/dist/pick-by.d.cts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pick-by.d.cts","names":[],"sources":["../src/pick-by.ts"],"sourcesContent":[],"mappings":";;;;;;;KAUK,uBAAuB,oBACxB,
|
|
1
|
+
{"version":3,"file":"pick-by.d.cts","names":[],"sources":["../src/pick-by.ts"],"sourcesContent":[],"mappings":";;;;;;;KAUK,uBAAuB,oBACxB,SACA,gBAAgB,0CAGY,KAAK,SAAS,MAAM,SAAS,GAAG,IAXL,GAmBnD,MAbH,CAaU,qBAbO,CAae,CAbf,CAAA,EAamB,4BAbnB,CAagD,CAbhD,CAAA,CAAA,CAAA,GAAA,KAAA;KA2BjB,yBA3BuB,CAAA,CAAA,EAAA,CAAA,CAAA,GA2BW,CA3BX,SAAA,OAAA,GA4BxB,QA5BwB,CA6BxB,eA7BwB,CA6BR,CA7BQ,CAAA,SAAA,IAAA,GA8BpB,UA9BoB,CA8BT,CA9BS,EA8BN,CA9BM,CAAA,GA8BD,YA9BC,CA8BY,CA9BZ,EA8Be,CA9Bf,CAAA,GAmCpB,MAnCoB,CAoCpB,qBApCoB,CAoCE,CApCF,CAAA,EAqCpB,OArCoB,CAqCZ,4BArCY,CAqCiB,CArCjB,CAAA,EAqCqB,CArCrB,CAAA,CAAA,CAAA,GAAA,KAAA;KA2CvB,UAzCe,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAhB,MA2CoB,CA3CpB,IA2CyB,QA3CzB,CA4CA,WA5CA,CA4CY,CA5CZ,EA4Ce,CA5Cf,EA4CkB,CA5ClB,CAAA,SAAA,IAAA,GA4CoC,CA5CpC,GAAA,KAAA,CAAA,GA6CE,OA7CF,CA6CU,QA7CV,CA6CmB,CA7CnB,CAAA,CA6CsB,CA7CtB,CAAA,EA6C0B,CA7C1B,CAAA,EAG4B;KA+C3B,YA/CyC,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAT,MAiDb,CAjDa,IAiDR,QAjDQ,CAkDjC,aAlDiC,CAkDnB,CAlDmB,EAkDhB,CAlDgB,EAkDb,CAlDa,CAAA,SAAA,IAAA,GAkDK,CAlDL,GAAA,KAAA,CAAA,IAmD9B,OAnD8B,CAmDtB,OAnDsB,CAmDd,CAnDc,CAmDZ,CAnDY,CAAA,EAmDR,CAnDQ,CAAA,CAAA,SAAA,IAAA,GAyD/B,CAzD+B,SAyDrB,CAzDqB,CAyDnB,CAzDmB,CAAA,GA0D7B,CA1D6B,GAAA,KAAA,GA4D/B,OA5D+B,CA4DvB,CA5DuB,CA4DrB,CA5DqB,CAAA,EA4DjB,CA5DiB,CAAA,EAAwB;KAkExD,WAlE+C,CAAA,CAAA,EAAA,YAAA,MAkEhB,CAlEgB,EAAA,CAAA,CAAA,GAmEhD,CAnEgD,CAmE9C,GAnE8C,CAAA,SAmEnC,OAnEmC,CAmE3B,CAnE2B,CAmEzB,GAnEyB,CAAA,EAmErB,CAnEqB,CAAA,GAAA,IAAA,GAAA,KAAA;KA0E/C,aA1E2D,CAAA,CAAA,EAAA,YAAA,MA0E1B,CA1E0B,EAAA,CAAA,CAAA,GA2E5D,WA3E4D,CA2EhD,CA3EgD,EA2E7C,GA3E6C,EA2E1C,CA3E0C,CAAA,SAAA,IAAA,GAAA,KAAA,GA6E1D,OA7E0D,CA6ElD,OA7EkD,CA6E1C,CA7E0C,CA6ExC,GA7EwC,CAAA,EA6EpC,CA7EoC,CAAA,CAAA,SAAA,IAAA,GA8ExD,CA9EwD,SA8E9C,CA9E8C,CA8E5C,GA9E4C,CAAA,GAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;AAJpD;;;;;;;;;;;;;;;;;;AA2BA,iBA0FI,MA1FJ,CAAA,UAAA,MAAA,EAAA,UA4FA,4BA5FA,CA4F6B,CA5F7B,CAAA,CAAA,CAAA,IAAA,EA8FJ,CA9FI,EAAA,SAAA,EAAA,CAAA,KAAA,EAgGD,4BAhGC,CAgG4B,CAhG5B,CAAA,EAAA,GAAA,EAiGH,qBAjGG,CAiGmB,CAjGnB,CAAA,EAAA,IAAA,EAkGF,CAlGE,EAAA,GAAA,KAAA,IAmGI,CAnGJ,CAAA,EAoGT,yBApGS,CAoGiB,CApGjB,EAoGoB,CApGpB,CAAA;AAeP,iBAsFW,MAtFD,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAuFP,CAvFO,EAAA,SAAA,EAAA,CAAA,KAAA,EAyFJ,4BAzFI,CAyFyB,CAzFzB,CAAA,EAAA,GAAA,EA0FN,qBA1FM,CA0FgB,CA1FhB,CAAA,EAAA,IAAA,EA2FL,CA3FK,EAAA,GAAA,OAAA,CAAA,EA6FZ,iBA7FY,CA6FM,CA7FN,CAAA;;;;;;;;;;;;;;AAIF;;;;;;;;;;AASgB,iBAyGb,MAzGa,CAAA,UAAA,MAAA,EAAA,UA2GjB,4BA3GiB,CA2GY,CA3GZ,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EA8GlB,4BA9GkB,CA8GW,CA9GX,CAAA,EAAA,GAAA,EA+GpB,qBA/GoB,CA+GE,CA/GF,CAAA,EAAA,IAAA,EAgHnB,CAhHmB,EAAA,GAAA,KAAA,IAiHb,CAjHa,CAAA,EAAA,CAAA,IAAA,EAkHnB,CAlHmB,EAAA,GAkHb,yBAlHa,CAkHa,CAlHb,EAkHgB,CAlHhB,CAAA;AAAd,iBAmHC,MAnHD,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAqHJ,4BArHI,CAqHyB,CArHzB,CAAA,EAAA,GAAA,EAsHN,qBAtHM,CAsHgB,CAtHhB,CAAA,EAAA,IAAA,EAuHL,CAvHK,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EAyHL,CAzHK,EAAA,GAyHC,iBAzHD,CAyHmB,CAzHnB,CAAA"}
|
package/dist/pick-by.d.ts
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
import { t as IsBoundedRecord } from "./is-bounded-record-
|
|
2
|
-
import { t as ToString } from "./to-string-
|
|
3
|
-
import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-
|
|
4
|
-
import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-
|
|
1
|
+
import { t as IsBoundedRecord } from "./is-bounded-record-Bx4n8QB0.js";
|
|
2
|
+
import { t as ToString } from "./to-string-YIFx2KS6.js";
|
|
3
|
+
import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-CZQf3ld_.js";
|
|
4
|
+
import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-CRlVAvdp.js";
|
|
5
5
|
import { IsNever, Simplify } from "type-fest";
|
|
6
6
|
|
|
7
7
|
//#region src/pick-by.d.ts
|
package/dist/pick-by.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pick-by.d.ts","names":[],"sources":["../src/pick-by.ts"],"sourcesContent":[],"mappings":";;;;;;;KAUK,uBAAuB,oBACxB,
|
|
1
|
+
{"version":3,"file":"pick-by.d.ts","names":[],"sources":["../src/pick-by.ts"],"sourcesContent":[],"mappings":";;;;;;;KAUK,uBAAuB,oBACxB,SACA,gBAAgB,0CAGY,KAAK,SAAS,MAAM,SAAS,GAAG,IAXL,GAmBnD,MAbH,CAaU,qBAbO,CAae,CAbf,CAAA,EAamB,4BAbnB,CAagD,CAbhD,CAAA,CAAA,CAAA,GAAA,KAAA;KA2BjB,yBA3BuB,CAAA,CAAA,EAAA,CAAA,CAAA,GA2BW,CA3BX,SAAA,OAAA,GA4BxB,QA5BwB,CA6BxB,eA7BwB,CA6BR,CA7BQ,CAAA,SAAA,IAAA,GA8BpB,UA9BoB,CA8BT,CA9BS,EA8BN,CA9BM,CAAA,GA8BD,YA9BC,CA8BY,CA9BZ,EA8Be,CA9Bf,CAAA,GAmCpB,MAnCoB,CAoCpB,qBApCoB,CAoCE,CApCF,CAAA,EAqCpB,OArCoB,CAqCZ,4BArCY,CAqCiB,CArCjB,CAAA,EAqCqB,CArCrB,CAAA,CAAA,CAAA,GAAA,KAAA;KA2CvB,UAzCe,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAhB,MA2CoB,CA3CpB,IA2CyB,QA3CzB,CA4CA,WA5CA,CA4CY,CA5CZ,EA4Ce,CA5Cf,EA4CkB,CA5ClB,CAAA,SAAA,IAAA,GA4CoC,CA5CpC,GAAA,KAAA,CAAA,GA6CE,OA7CF,CA6CU,QA7CV,CA6CmB,CA7CnB,CAAA,CA6CsB,CA7CtB,CAAA,EA6C0B,CA7C1B,CAAA,EAG4B;KA+C3B,YA/CyC,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAT,MAiDb,CAjDa,IAiDR,QAjDQ,CAkDjC,aAlDiC,CAkDnB,CAlDmB,EAkDhB,CAlDgB,EAkDb,CAlDa,CAAA,SAAA,IAAA,GAkDK,CAlDL,GAAA,KAAA,CAAA,IAmD9B,OAnD8B,CAmDtB,OAnDsB,CAmDd,CAnDc,CAmDZ,CAnDY,CAAA,EAmDR,CAnDQ,CAAA,CAAA,SAAA,IAAA,GAyD/B,CAzD+B,SAyDrB,CAzDqB,CAyDnB,CAzDmB,CAAA,GA0D7B,CA1D6B,GAAA,KAAA,GA4D/B,OA5D+B,CA4DvB,CA5DuB,CA4DrB,CA5DqB,CAAA,EA4DjB,CA5DiB,CAAA,EAAwB;KAkExD,WAlE+C,CAAA,CAAA,EAAA,YAAA,MAkEhB,CAlEgB,EAAA,CAAA,CAAA,GAmEhD,CAnEgD,CAmE9C,GAnE8C,CAAA,SAmEnC,OAnEmC,CAmE3B,CAnE2B,CAmEzB,GAnEyB,CAAA,EAmErB,CAnEqB,CAAA,GAAA,IAAA,GAAA,KAAA;KA0E/C,aA1E2D,CAAA,CAAA,EAAA,YAAA,MA0E1B,CA1E0B,EAAA,CAAA,CAAA,GA2E5D,WA3E4D,CA2EhD,CA3EgD,EA2E7C,GA3E6C,EA2E1C,CA3E0C,CAAA,SAAA,IAAA,GAAA,KAAA,GA6E1D,OA7E0D,CA6ElD,OA7EkD,CA6E1C,CA7E0C,CA6ExC,GA7EwC,CAAA,EA6EpC,CA7EoC,CAAA,CAAA,SAAA,IAAA,GA8ExD,CA9EwD,SA8E9C,CA9E8C,CA8E5C,GA9E4C,CAAA,GAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;AAJpD;;;;;;;;;;;;;;;;;;AA2BA,iBA0FI,MA1FJ,CAAA,UAAA,MAAA,EAAA,UA4FA,4BA5FA,CA4F6B,CA5F7B,CAAA,CAAA,CAAA,IAAA,EA8FJ,CA9FI,EAAA,SAAA,EAAA,CAAA,KAAA,EAgGD,4BAhGC,CAgG4B,CAhG5B,CAAA,EAAA,GAAA,EAiGH,qBAjGG,CAiGmB,CAjGnB,CAAA,EAAA,IAAA,EAkGF,CAlGE,EAAA,GAAA,KAAA,IAmGI,CAnGJ,CAAA,EAoGT,yBApGS,CAoGiB,CApGjB,EAoGoB,CApGpB,CAAA;AAeP,iBAsFW,MAtFD,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAuFP,CAvFO,EAAA,SAAA,EAAA,CAAA,KAAA,EAyFJ,4BAzFI,CAyFyB,CAzFzB,CAAA,EAAA,GAAA,EA0FN,qBA1FM,CA0FgB,CA1FhB,CAAA,EAAA,IAAA,EA2FL,CA3FK,EAAA,GAAA,OAAA,CAAA,EA6FZ,iBA7FY,CA6FM,CA7FN,CAAA;;;;;;;;;;;;;;AAIF;;;;;;;;;;AASgB,iBAyGb,MAzGa,CAAA,UAAA,MAAA,EAAA,UA2GjB,4BA3GiB,CA2GY,CA3GZ,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EA8GlB,4BA9GkB,CA8GW,CA9GX,CAAA,EAAA,GAAA,EA+GpB,qBA/GoB,CA+GE,CA/GF,CAAA,EAAA,IAAA,EAgHnB,CAhHmB,EAAA,GAAA,KAAA,IAiHb,CAjHa,CAAA,EAAA,CAAA,IAAA,EAkHnB,CAlHmB,EAAA,GAkHb,yBAlHa,CAkHa,CAlHb,EAkHgB,CAlHhB,CAAA;AAAd,iBAmHC,MAnHD,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAqHJ,4BArHI,CAqHyB,CArHzB,CAAA,EAAA,GAAA,EAsHN,qBAtHM,CAsHgB,CAtHhB,CAAA,EAAA,IAAA,EAuHL,CAvHK,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EAyHL,CAzHK,EAAA,GAyHC,iBAzHD,CAyHmB,CAzHnB,CAAA"}
|
package/dist/pick-by.js
CHANGED
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import{t as e}from"./curry-
|
|
1
|
+
import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n={};for(let[r,i]of Object.entries(e))t(i,r,e)&&(n[r]=i);return n}export{t as pickBy};
|
|
2
2
|
//# sourceMappingURL=pick-by.js.map
|
package/dist/pick-by.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pick-by.js","names":["out: Partial<Record<string, unknown>>"],"sources":["../src/pick-by.ts"],"sourcesContent":["import type { IsNever, Simplify } from 'type-fest';\nimport type { EnumerableStringKeyOf } from './internal/types/enumerable-string-key-of';\nimport type { EnumerableStringKeyedValueOf } from './internal/types/enumerable-string-keyed-value-of';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport type { ToString } from './internal/types/to-string';\nimport { curry } from './curry';\n\n// When the predicate isn't a type-guard we don't know which properties would be\n// part of the output and which wouldn't so we can only safely downgrade the\n// whole object to a Partial of the input.\ntype EnumeratedPartial<T> = T extends unknown\n ? Simplify<\n
|
|
1
|
+
{"version":3,"file":"pick-by.js","names":["out: Partial<Record<string, unknown>>"],"sources":["../src/pick-by.ts"],"sourcesContent":["import type { IsNever, Simplify } from 'type-fest';\nimport type { EnumerableStringKeyOf } from './internal/types/enumerable-string-key-of';\nimport type { EnumerableStringKeyedValueOf } from './internal/types/enumerable-string-keyed-value-of';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport type { ToString } from './internal/types/to-string';\nimport { curry } from './curry';\n\n// When the predicate isn't a type-guard we don't know which properties would be\n// part of the output and which wouldn't so we can only safely downgrade the\n// whole object to a Partial of the input.\ntype EnumeratedPartial<T> = T extends unknown\n ? Simplify<\n IsBoundedRecord<T> extends true\n ? {\n // Object.entries returns keys as strings.\n -readonly [P in keyof T as ToString<P>]?: Required<T>[P];\n }\n // For unbounded records (a simple Record with primitive `string` or\n // `number` keys) the return type here could technically be T; but for\n // cases where the record is unbounded but is more complex (like\n // `symbol` keys) we want to \"reconstruct\" the record from just its\n // enumerable components (which are the ones accessible via\n // `Object.entries`).\n : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>\n >\n : never;\n\n// When the predicate is a type-guard we have more information to work with when\n// constructing the type of the output object. We can safely remove any property\n// which value would never come up true for the predicate, AND we can also\n// assume that properties that match the predicate perfectly would **always**\n// show up in the output object. Hence to build the output object we need to\n// build and merge 2 output objects: One for the properties which have a value\n// of at type that would always yield a `true` result from the predicate, these\n// are the \"matches\", which would not change the \"optionality\" of the input\n// object's props, and one for partial matches which would also make the props\n// optional (as they could have a value that would be filtered out).\ntype EnumeratedPartialNarrowed<T, S> = T extends unknown\n ? Simplify<\n IsBoundedRecord<T> extends true\n ? ExactProps<T, S> & PartialProps<T, S>\n // For unbounded records we need to \"reconstruct\" the record and\n // narrow the value types. Similar to the non-narrowed case, we need\n // to also ignore `symbol` keys and any values that are only relevant\n // to them.\n : Record<\n EnumerableStringKeyOf<T>,\n Extract<EnumerableStringKeyedValueOf<T>, S>\n >\n >\n : never;\n\n// The exact case, props here would always be part of the output object\ntype ExactProps<T, S> = {\n // Object.entries returns keys as strings.\n -readonly [P in keyof T as ToString<\n IsExactProp<T, P, S> extends true ? P : never\n >]: Extract<Required<T>[P], S>;\n};\n\n// The partial case, props here might be part of the output object, but might\n// not be, hence they are optional.\ntype PartialProps<T, S> = {\n // Object.entries returns keys as strings.\n -readonly [P in keyof T as ToString<\n IsPartialProp<T, P, S> extends true ? P : never\n >]?: IsNever<Extract<T[P], S>> extends true\n // If the result of extracting S from T[P] is never but S still extends\n // it, it means that T[P] is too wide and S can't be extracted from it:\n // e.g. if T[P] is `number` S is `1` then `Extract<number, 1> === never`.\n // For these cases we can return S directly as the type as it's already\n // very narrowed compared to T[P].\n ? S extends T[P]\n ? S\n : never\n : Extract<T[P], S>;\n};\n\n// If the input object's value type extends itself when the type-guard is\n// extracted from it we can safely assume that the predicate would always return\n// true for any value of that property.\ntype IsExactProp<T, P extends keyof T, S>\n = T[P] extends Extract<T[P], S> ? true : false;\n\n// ...and if the input object's value type isn't an exact match, but still has\n// some partial match (i.g. the extracted type-guard isn't completely disjoint)\n// then we can assume that the property can sometimes return true, and sometimes\n// false when passed to the predicate, hence it should be optional in the\n// output.\ntype IsPartialProp<T, P extends keyof T, S>\n = IsExactProp<T, P, S> extends true\n ? false\n : IsNever<Extract<T[P], S>> extends true\n ? S extends T[P]\n // If the result of extracting S from T[P] is never but S still\n // extends it, it means that T[P] is too wide and S can't be\n // extracted from it: e.g. if T[P] is `number` S is `1` then\n // `Extract<number, 1> === never`, but `1` extends `number`. We need\n // to handle these cases when we extract the value too (see above).\n ? true\n : false\n : true;\n\n/**\n * Iterates over the entries of `data` and reconstructs the object using only\n * entries that `predicate` accepts. Symbol keys are not passed to the predicate\n * and would be filtered out from the output object.\n *\n * See `omitBy` for a complementary function which starts with a shallow copy of\n * the input object and removes the entries that the predicate rejects. Because\n * it is subtractive symbol keys would be copied over to the output object.\n * See also `entries`, `filter`, and `fromEntries` which could be used to build\n * your own version of `pickBy` if you need more control (though the resulting\n * type might be less precise).\n *\n * @param data - The target object.\n * @param predicate - A function that takes the value, key, and the data itself\n * and returns true if the entry should be part of the output object, or `false`\n * to remove it. If the function is a type-guard on the value the output type\n * would be narrowed accordingly.\n * @returns A shallow copy of the input object with the rejected entries\n * removed.\n * @signature P.pickBy(data, predicate)\n * @example\n * P.pickBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {A: 3, B: 4}\n * @dataFirst\n * @category Object\n */\nexport function pickBy<\n T extends object,\n S extends EnumerableStringKeyedValueOf<T>,\n>(\n data: T,\n predicate: (\n value: EnumerableStringKeyedValueOf<T>,\n key: EnumerableStringKeyOf<T>,\n data: T,\n ) => value is S,\n): EnumeratedPartialNarrowed<T, S>;\nexport function pickBy<T extends object>(\n data: T,\n predicate: (\n value: EnumerableStringKeyedValueOf<T>,\n key: EnumerableStringKeyOf<T>,\n data: T,\n ) => boolean,\n): EnumeratedPartial<T>;\n\n/**\n * Iterates over the entries of `data` and reconstructs the object using only\n * entries that `predicate` accepts. Symbol keys are not passed to the predicate\n * and would be filtered out from the output object.\n *\n * See `omitBy` for a complementary function which starts with a shallow copy of\n * the input object and removes the entries that the predicate rejects. Because\n * it is subtractive symbol keys would be copied over to the output object.\n * See also `entries`, `filter`, and `fromEntries` which could be used to build\n * your own version of `pickBy` if you need more control (though the resulting\n * type might be less precise).\n *\n * @param predicate - A function that takes the value, key, and the data itself\n * and returns true if the entry should be part of the output object, or `false`\n * to remove it. If the function is a type-guard on the value the output type\n * would be narrowed accordingly.\n * @signature\n * P.pickBy(predicate)(data)\n * @example\n * P.pipe({a: 1, b: 2, A: 3, B: 4}, pickBy((val, key) => key.toUpperCase() === key)); // => {A: 3, B: 4}\n * @dataLast\n * @category Object\n */\nexport function pickBy<\n T extends object,\n S extends EnumerableStringKeyedValueOf<T>,\n>(\n predicate: (\n value: EnumerableStringKeyedValueOf<T>,\n key: EnumerableStringKeyOf<T>,\n data: T,\n ) => value is S,\n): (data: T) => EnumeratedPartialNarrowed<T, S>;\nexport function pickBy<T extends object>(\n predicate: (\n value: EnumerableStringKeyedValueOf<T>,\n key: EnumerableStringKeyOf<T>,\n data: T,\n ) => boolean,\n): (data: T) => EnumeratedPartial<T>;\n\nexport function pickBy(...args: ReadonlyArray<unknown>): unknown {\n return curry(pickByImplementation, args);\n}\n\nfunction pickByImplementation<T extends object>(\n data: T,\n predicate: (value: unknown, key: string, data: T) => boolean,\n): Record<string, unknown> {\n const out: Partial<Record<string, unknown>> = {};\n\n for (const [key, value] of Object.entries(data)) {\n if (predicate(value, key, data)) {\n out[key] = value;\n }\n }\n\n return out;\n}\n"],"mappings":"wCA6LA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EACyB,CACzB,IAAMA,EAAwC,EAAE,CAEhD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAK,CACzC,EAAU,EAAO,EAAK,EAAK,GAC7B,EAAI,GAAO,GAIf,OAAO"}
|
package/dist/pick.d.cts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { t as
|
|
2
|
-
import { t as
|
|
3
|
-
import {
|
|
1
|
+
import { t as TupleParts } from "./tuple-parts-CzQQupgi.cjs";
|
|
2
|
+
import { n as IsBounded, t as IsBoundedRecord } from "./is-bounded-record-DV6ZQk9H.cjs";
|
|
3
|
+
import { t as PartitionByUnion } from "./partition-by-union-BztEpKVh.cjs";
|
|
4
4
|
import { EmptyObject, IsNever, KeysOfUnion, Writable } from "type-fest";
|
|
5
5
|
|
|
6
6
|
//#region src/pick.d.ts
|
|
@@ -14,18 +14,7 @@ type PickFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = T extends un
|
|
|
14
14
|
* picked as-is, otherwise, the key might not be present in the keys array so it
|
|
15
15
|
* can only be picked optionally.
|
|
16
16
|
*/
|
|
17
|
-
type PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = Pick<T, Extract<
|
|
18
|
-
/**
|
|
19
|
-
* We split the fixed tuple item types into **singular** props (e.g., `"a"`),
|
|
20
|
-
* and unions of several props (e.g., `"a" | "b"`).
|
|
21
|
-
*
|
|
22
|
-
* We assume that T is a fixed tuple (no optional or rest elements), and that
|
|
23
|
-
* all elements in it are bounded (as defined by `IsBounded`).
|
|
24
|
-
*/
|
|
25
|
-
type ItemsByUnion<T, Singular = never, Union = never> = T extends readonly [infer Head, ...infer Rest] ? IsUnion<Head> extends true ? ItemsByUnion<Rest, Singular, Union | Head> : ItemsByUnion<Rest, Singular | Head, Union> : {
|
|
26
|
-
singular: Singular;
|
|
27
|
-
union: Union;
|
|
28
|
-
};
|
|
17
|
+
type PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = Pick<T, Extract<PartitionByUnion<TupleParts<Keys>['required']>['singular'] | PartitionByUnion<TupleParts<Keys>['suffix']>['singular'], keyof T>> & Partial<Pick<T, Extract<PartitionByUnion<TupleParts<Keys>['required']>['union'] | TupleParts<Keys>['optional'][number] | TupleParts<Keys>['item'] | PartitionByUnion<TupleParts<Keys>['suffix']>['union'], keyof T>>>;
|
|
29
18
|
/**
|
|
30
19
|
* The built-in `Pick` is weird when it comes to picking bounded keys from
|
|
31
20
|
* unbounded records. It reconstructs the output object regardless of the shape
|
package/dist/pick.d.cts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pick.d.cts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;;;;;KAOK,8BAA8B,cAAc,YAAY,OAEzD,oBACE,uBAOE,QAAQ,QAAQ,oBAAoB,mBAClC,cAIA,
|
|
1
|
+
{"version":3,"file":"pick.d.cts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;;;;;KAOK,8BAA8B,cAAc,YAAY,OAEzD,oBACE,uBAOE,QAAQ,QAAQ,oBAAoB,mBAClC,cAIA,SACA,gBAAgB,kBACZ,qBAAqB,GAAG,QACxB,cAAc,GAAG,QAAQ,oBAAoB;AArBI;;;;;;;;;KAmC1D,oBAtBG,CAAA,CAAA,EAAA,aAsBkC,aAtBlC,CAsBgD,WAtBhD,CAsB4D,CAtB5D,CAAA,CAAA,CAAA,GAwBJ,IAxBI,CAyBJ,CAzBI,EA4BJ,OA5BI,CA6BA,gBA7BA,CA6BiB,UA7BjB,CA6B4B,IA7B5B,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,UAAA,CAAA,GA8BA,gBA9BA,CA8BiB,UA9BjB,CA8B4B,IA9B5B,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,UAAA,CAAA,EAAA,MA+BI,CA/BJ,CAAA,CAAA,GAmCJ,OAnCI,CAoCJ,IApCI,CAqCF,CArCE,EAwCF,OAxCE,CAyCE,gBAzCF,CAyCmB,UAzCnB,CAyC8B,IAzC9B,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,OAAA,CAAA,GA2CE,UA3CF,CA2Ca,IA3Cb,CAAA,CAAA,UAAA,CAAA,CAAA,MAAA,CAAA,GA4CE,UA5CF,CA4Ca,IA5Cb,CAAA,CAAA,MAAA,CAAA,GA6CE,gBA7CF,CA6CmB,UA7CnB,CA6C8B,IA7C9B,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,OAAA,CAAA,EAAA,MA8CM,CA9CN,CAAA,CAAA,CAAA;;;;;;;;;;;;KA8DH,aAzDK,CAAA,CAAA,EAAA,aAAA,MAyD+B,CAzD/B,CAAA,GAyDoC,SAzDpC,CAyD8C,IAzD9C,CAAA,SAAA,IAAA,GAyDmE,OAzDnE,CAyD2E,IAzD3E,CAyDgF,CAzDhF,EAyDmF,IAzDnF,CAAA,CAAA,GAyD4F,IAzD5F,CAyDiG,CAzDjG,EAyDoG,IAzDpG,CAAA;;AAAQ;;;;;;;;;AAyBO,iBA4CT,IA5CS,CAAA,UAAA,MAAA,EAAA,mBA8CJ,aA9CI,CA8CU,WA9CV,CA8CsB,CA9CtB,CAAA,CAAA,CAAA,CAAA,IAAA,EA+CjB,IA/CiB,CAAA,EAAA,CAAA,IAAA,EA+CH,CA/CG,EAAA,GA+CG,aA/CH,CA+CiB,CA/CjB,EA+CoB,IA/CpB,CAAA;;;;;;;;;;;;AAcf,iBA8CM,IA9CN,CAAA,UAAA,MAAA,EAAA,mBAgDW,aAhDX,CAgDyB,WAhDzB,CAgDqC,CAhDrC,CAAA,CAAA,CAAA,CAAA,IAAA,EAiDF,CAjDE,EAAA,IAAA,EAiDO,IAjDP,CAAA,EAiDc,aAjDd,CAiD4B,CAjD5B,EAiD+B,IAjD/B,CAAA"}
|
package/dist/pick.d.ts
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { t as
|
|
2
|
-
import { t as
|
|
3
|
-
import {
|
|
1
|
+
import { t as TupleParts } from "./tuple-parts-BYI4o8Vk.js";
|
|
2
|
+
import { n as IsBounded, t as IsBoundedRecord } from "./is-bounded-record-Bx4n8QB0.js";
|
|
3
|
+
import { t as PartitionByUnion } from "./partition-by-union-DnfiiEMU.js";
|
|
4
4
|
import { EmptyObject, IsNever, KeysOfUnion, Writable } from "type-fest";
|
|
5
5
|
|
|
6
6
|
//#region src/pick.d.ts
|
|
@@ -14,18 +14,7 @@ type PickFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = T extends un
|
|
|
14
14
|
* picked as-is, otherwise, the key might not be present in the keys array so it
|
|
15
15
|
* can only be picked optionally.
|
|
16
16
|
*/
|
|
17
|
-
type PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = Pick<T, Extract<
|
|
18
|
-
/**
|
|
19
|
-
* We split the fixed tuple item types into **singular** props (e.g., `"a"`),
|
|
20
|
-
* and unions of several props (e.g., `"a" | "b"`).
|
|
21
|
-
*
|
|
22
|
-
* We assume that T is a fixed tuple (no optional or rest elements), and that
|
|
23
|
-
* all elements in it are bounded (as defined by `IsBounded`).
|
|
24
|
-
*/
|
|
25
|
-
type ItemsByUnion<T, Singular = never, Union = never> = T extends readonly [infer Head, ...infer Rest] ? IsUnion<Head> extends true ? ItemsByUnion<Rest, Singular, Union | Head> : ItemsByUnion<Rest, Singular | Head, Union> : {
|
|
26
|
-
singular: Singular;
|
|
27
|
-
union: Union;
|
|
28
|
-
};
|
|
17
|
+
type PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>> = Pick<T, Extract<PartitionByUnion<TupleParts<Keys>['required']>['singular'] | PartitionByUnion<TupleParts<Keys>['suffix']>['singular'], keyof T>> & Partial<Pick<T, Extract<PartitionByUnion<TupleParts<Keys>['required']>['union'] | TupleParts<Keys>['optional'][number] | TupleParts<Keys>['item'] | PartitionByUnion<TupleParts<Keys>['suffix']>['union'], keyof T>>>;
|
|
29
18
|
/**
|
|
30
19
|
* The built-in `Pick` is weird when it comes to picking bounded keys from
|
|
31
20
|
* unbounded records. It reconstructs the output object regardless of the shape
|
package/dist/pick.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pick.d.ts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;;;;;KAOK,8BAA8B,cAAc,YAAY,OAEzD,oBACE,uBAOE,QAAQ,QAAQ,oBAAoB,mBAClC,cAIA,
|
|
1
|
+
{"version":3,"file":"pick.d.ts","names":[],"sources":["../src/pick.ts"],"sourcesContent":[],"mappings":";;;;;;KAOK,8BAA8B,cAAc,YAAY,OAEzD,oBACE,uBAOE,QAAQ,QAAQ,oBAAoB,mBAClC,cAIA,SACA,gBAAgB,kBACZ,qBAAqB,GAAG,QACxB,cAAc,GAAG,QAAQ,oBAAoB;AArBI;;;;;;;;;KAmC1D,oBAtBG,CAAA,CAAA,EAAA,aAsBkC,aAtBlC,CAsBgD,WAtBhD,CAsB4D,CAtB5D,CAAA,CAAA,CAAA,GAwBJ,IAxBI,CAyBJ,CAzBI,EA4BJ,OA5BI,CA6BA,gBA7BA,CA6BiB,UA7BjB,CA6B4B,IA7B5B,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,UAAA,CAAA,GA8BA,gBA9BA,CA8BiB,UA9BjB,CA8B4B,IA9B5B,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,UAAA,CAAA,EAAA,MA+BI,CA/BJ,CAAA,CAAA,GAmCJ,OAnCI,CAoCJ,IApCI,CAqCF,CArCE,EAwCF,OAxCE,CAyCE,gBAzCF,CAyCmB,UAzCnB,CAyC8B,IAzC9B,CAAA,CAAA,UAAA,CAAA,CAAA,CAAA,OAAA,CAAA,GA2CE,UA3CF,CA2Ca,IA3Cb,CAAA,CAAA,UAAA,CAAA,CAAA,MAAA,CAAA,GA4CE,UA5CF,CA4Ca,IA5Cb,CAAA,CAAA,MAAA,CAAA,GA6CE,gBA7CF,CA6CmB,UA7CnB,CA6C8B,IA7C9B,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,OAAA,CAAA,EAAA,MA8CM,CA9CN,CAAA,CAAA,CAAA;;;;;;;;;;;;KA8DH,aAzDK,CAAA,CAAA,EAAA,aAAA,MAyD+B,CAzD/B,CAAA,GAyDoC,SAzDpC,CAyD8C,IAzD9C,CAAA,SAAA,IAAA,GAyDmE,OAzDnE,CAyD2E,IAzD3E,CAyDgF,CAzDhF,EAyDmF,IAzDnF,CAAA,CAAA,GAyD4F,IAzD5F,CAyDiG,CAzDjG,EAyDoG,IAzDpG,CAAA;;AAAQ;;;;;;;;;AAyBO,iBA4CT,IA5CS,CAAA,UAAA,MAAA,EAAA,mBA8CJ,aA9CI,CA8CU,WA9CV,CA8CsB,CA9CtB,CAAA,CAAA,CAAA,CAAA,IAAA,EA+CjB,IA/CiB,CAAA,EAAA,CAAA,IAAA,EA+CH,CA/CG,EAAA,GA+CG,aA/CH,CA+CiB,CA/CjB,EA+CoB,IA/CpB,CAAA;;;;;;;;;;;;AAcf,iBA8CM,IA9CN,CAAA,UAAA,MAAA,EAAA,mBAgDW,aAhDX,CAgDyB,WAhDzB,CAgDqC,CAhDrC,CAAA,CAAA,CAAA,CAAA,IAAA,EAiDF,CAjDE,EAAA,IAAA,EAiDO,IAjDP,CAAA,EAiDc,aAjDd,CAiD4B,CAjD5B,EAiD+B,IAjD/B,CAAA"}
|
package/dist/pick.js
CHANGED
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import{t as e}from"./curry-
|
|
1
|
+
import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n={};for(let r of t)r in e&&(n[r]=e[r]);return n}export{t as pick};
|
|
2
2
|
//# sourceMappingURL=pick.js.map
|
package/dist/pick.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pick.js","names":["out: Partial<Pick<T, Keys[number]>>"],"sources":["../src/pick.ts"],"sourcesContent":["import type { EmptyObject, IsNever, KeysOfUnion, Writable } from 'type-fest';\nimport type { IsBounded } from './internal/types/is-bounded';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport type {
|
|
1
|
+
{"version":3,"file":"pick.js","names":["out: Partial<Pick<T, Keys[number]>>"],"sources":["../src/pick.ts"],"sourcesContent":["import type { EmptyObject, IsNever, KeysOfUnion, Writable } from 'type-fest';\nimport type { IsBounded } from './internal/types/is-bounded';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport type { PartitionByUnion } from './internal/types/partition-by-union';\nimport type { TupleParts } from './internal/types/tuple-parts';\nimport { curry } from './curry';\n\ntype PickFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>>\n // Distribute unions for both object types and key arrays.\n = T extends unknown\n ? Keys extends unknown\n // When T is a union (or when Keys is empty) the picked props might\n // not exist in some of its sub-types, e.g.,\n // `pick(... as { a: string } | { b: number }, ['a'])`,\n // if we simply let the regular \"constructive\" logic run, the\n // resulting type would be `{}` which doesn't behave like an empty\n // object! instead, we want to use a more explicit *empty* type.\n ? IsNever<Extract<Keys[number], keyof T>> extends true\n ? EmptyObject\n // Remove `readonly` modifiers from picked props since we return a\n // new, mutable, object. We don't wrap the result with `Simplify` to\n // flatten it because `Writable` does the same thing implicitly.\n : Writable<\n IsBoundedRecord<T> extends true\n ? PickBoundedFromArray<T, Keys>\n : PickUnbounded<T, Extract<Keys[number], keyof T>>\n >\n : never\n : never;\n\n/**\n * Bounded records have bounded keys and result in a bounded output. The only\n * question left is whether to add the prop as-is, or make it optional. This\n * can be determined by the part of the keys array the prop is defined in, and\n * the way that element is defined: if the array contains a singular literal\n * key in either the required prefix or the suffix, we know that prop should be\n * picked as-is, otherwise, the key might not be present in the keys array so it\n * can only be picked optionally.\n */\ntype PickBoundedFromArray<T, Keys extends ReadonlyArray<KeysOfUnion<T>>>\n // Literal keys in the prefix/suffix are guaranteed present.\n = Pick<\n T,\n // When T is a union the keys need to be narrowed to just those that are\n // keys of the specific sub-type being built\n Extract<\n | PartitionByUnion<TupleParts<Keys>['required']>['singular']\n | PartitionByUnion<TupleParts<Keys>['suffix']>['singular'],\n keyof T\n >\n >\n // Union keys, optional elements, and rest elements are optional.\n & Partial<\n Pick<\n T,\n // When T is a union the keys need to be narrowed to just those that are\n // keys of the specific sub-type being built.\n Extract<\n | PartitionByUnion<TupleParts<Keys>['required']>['union']\n // TODO: the optional part of the keys array will always be empty because its impossible to provide the pick function with a tuple with optional elements; this is because optional elements are always implicitly `undefined` too; which breaks the constraint that all keys are keys of T (`undefined` is not a key of anything). We can lift this restriction by supporting `undefined` in the runtime and relaxing the type constraint to allow it, but this relaxed constraint enables a niche feature (optional tuple elements) at the expense of better type-safety for the more common cases of fixed tuples and arrays. Anyway... if we ever change it, this part of the output type will ensure the output is still correct:\n | TupleParts<Keys>['optional'][number]\n | TupleParts<Keys>['item']\n | PartitionByUnion<TupleParts<Keys>['suffix']>['union'],\n keyof T\n >\n >\n >;\n\n/**\n * The built-in `Pick` is weird when it comes to picking bounded keys from\n * unbounded records. It reconstructs the output object regardless of the shape\n * of the input: `Pick<Record<string, \"world\">, \"hello\">` results in the type\n * `{ hello: \"world\" }`, but you'd expect it to be optional because we don't\n * know if the record contains a `hello` prop or not!\n *\n * !Important: We assume T is unbounded and don't test for it!\n *\n * See: https://www.typescriptlang.org/play/?#code/PTAEE0HsFcHIBNQFMAeAHJBjALqAGqNpKAEZKigAGA3qABZIA2jkA-AFygBEA7pAE6N4XUAF9KAGlLRcAQ0ayAzgChsATwz5QAXlAAFAJaYA1gB4ASlgHxTi7PwMA7AOZTeAoVwB8bhs0jeANzKIBSgAHqsykA.\n */\ntype PickUnbounded<T, Keys extends keyof T> = IsBounded<Keys> extends true ? Partial<Pick<T, Keys>> : Pick<T, Keys>;\n\n/**\n * Creates an object composed of the picked `data` properties.\n *\n * @param keys - The property names.\n * @signature P.pick([prop1, prop2])(object)\n * @example\n * P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.pick(['a', 'd'])) // => { a: 1, d: 4 }\n * @dataLast\n * @category Object\n */\nexport function pick<\n T extends object,\n const Keys extends ReadonlyArray<KeysOfUnion<T>>,\n>(keys: Keys): (data: T) => PickFromArray<T, Keys>;\n\n/**\n * Creates an object composed of the picked `data` properties.\n *\n * @param data - The target object.\n * @param keys - The property names.\n * @signature P.pick(object, [prop1, prop2])\n * @example\n * P.pick({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { a: 1, d: 4 }\n * @dataFirst\n * @category Object\n */\nexport function pick<\n T extends object,\n const Keys extends ReadonlyArray<KeysOfUnion<T>>,\n>(data: T, keys: Keys): PickFromArray<T, Keys>;\n\nexport function pick(...args: ReadonlyArray<unknown>): unknown {\n return curry(pickImplementation, args);\n}\n\nfunction pickImplementation<\n T extends object,\n Keys extends ReadonlyArray<keyof T>,\n>(object: T, keys: Keys): PickFromArray<T, Keys> {\n const out: Partial<Pick<T, Keys[number]>> = {};\n for (const key of keys) {\n if (key in object) {\n out[key] = object[key];\n }\n }\n // @ts-expect-error [ts2322] - We build the type incrementally, there's no way to make typescript infer that we \"finished\" building the object and to treat it as such.\n return out;\n}\n"],"mappings":"wCAgHA,SAAgB,EAAK,GAAG,EAAuC,CAC7D,OAAO,EAAM,EAAoB,EAAK,CAGxC,SAAS,EAGP,EAAW,EAAoC,CAC/C,IAAMA,EAAsC,EAAE,CAC9C,IAAK,IAAM,KAAO,EACZ,KAAO,IACT,EAAI,GAAO,EAAO,IAItB,OAAO"}
|
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
import{t as e}from"./utility-evaluators-
|
|
2
|
-
//# sourceMappingURL=pipe-
|
|
1
|
+
import{t as e}from"./utility-evaluators-Boc-TMbq.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};
|
|
2
|
+
//# sourceMappingURL=pipe-CZKusDA-.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"pipe-CZKusDA-.js","names":["lazySequence: Array<PreparedLazyFunction>","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 PreparedLazyFunction = 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 LazyFunction = LazyDefinition & ((input: unknown) => unknown);\n\n/**\n * Performs left-to-right function composition, passing data through functions\n * in sequence. Each function receives the output of the previous function,\n * creating a readable top-to-bottom data flow that matches how the\n * transformation is executed. This enables converting deeply nested function\n * calls into clear, sequential steps without temporary variables.\n *\n * When consecutive functions with a `lazy` tag (e.g., `map`, `filter`, `take`,\n * `drop`, `forEach`, etc...) are used together, they process data item-by-item\n * rather than creating intermediate arrays. This enables early termination\n * when only partial results are needed, improving performance for large\n * datasets and expensive operations.\n *\n * Functions are only evaluated lazily when their data-last form is used\n * directly in the pipe. To disable lazy evaluation, use data-first calls via\n * arrow functions: `($) => map($, callback)` instead of `map(callback)`.\n *\n * Any function can be used in pipes, not just Remeda utilities. For creating\n * custom functions with currying and lazy evaluation support, see the `purry`\n * utility.\n *\n * A \"headless\" variant `piped` is available for creating reusable pipe\n * functions without initial data.\n *\n * IMPORTANT: During lazy evaluation, callbacks using the third parameter (the\n * input array) receive only items processed up to that point, not the complete\n * array.\n *\n * @param data - The input data.\n * @param functions - A sequence of functions that take one argument and\n * return a value.\n * @signature\n * P.pipe(data, ...functions);\n * @example\n * P.pipe([1, 2, 3], P.map(P.multiply(3))); //=> [3, 6, 9]\n *\n * // = Early termination with lazy evaluation =\n * P.pipe(\n * hugeArray,\n * P.map(expensiveComputation),\n * P.filter(complexPredicate),\n * // Only processes items until 2 results are found, then stops.\n * // Most of hugeArray never gets processed.\n * P.take(2),\n * );\n *\n * // = Custom logic within a pipe =\n * P.pipe(\n * input,\n * P.toLowerCase(),\n * normalize,\n * ($) => validate($, CONFIG),\n * P.split(\",\"),\n * P.unique(),\n * );\n *\n * // = Migrating nested transformations to pipes =\n * // Nested\n * const result = P.prop(\n * P.mapValues(P.groupByProp(users, \"department\"), P.length()),\n * \"engineering\",\n * );\n *\n * // Piped\n * const result = P.pipe(\n * users,\n * P.groupByProp(\"department\"),\n * P.mapValues(P.length()),\n * P.prop(\"engineering\"),\n * );\n *\n * // = Using the 3rd param of a callback =\n * // The following would print out `data` in its entirety for each value\n * // of `data`.\n * P.forEach([1, 2, 3, 4], (_item, _index, data) => {\n * console.log(data);\n * }); //=> \"[1, 2, 3, 4]\" logged 4 times\n *\n * // But with `pipe` data would only contain the items up to the current\n * // index\n * P.pipe([1, 2, 3, 4], P.forEach((_item, _index, data) => {\n * console.log(data);\n * })); //=> \"[1]\", \"[1, 2]\", \"[1, 2, 3]\", \"[1, 2, 3, 4]\"\n * @dataFirst\n * @category Function\n */\nexport function pipe<A>(data: A): A;\n\nexport function pipe<A, B>(data: A, funcA: (input: A) => B): B;\n\nexport function pipe<A, B, C>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n): C;\n\nexport function pipe<A, B, C, D>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n): D;\n\nexport function pipe<A, B, C, D, E>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n): E;\n\nexport function pipe<A, B, C, D, E, F>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n): F;\n\nexport function pipe<A, B, C, D, E, F, G>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n): G;\n\nexport function pipe<A, B, C, D, E, F, G, H>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n): H;\n\nexport function pipe<A, B, C, D, E, F, G, H, I>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n): I;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n): J;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n funcJ: (input: J) => K,\n): K;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n funcJ: (input: J) => K,\n funcK: (input: K) => L,\n): L;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n funcJ: (input: J) => K,\n funcK: (input: K) => L,\n funcL: (input: L) => M,\n): M;\n\nexport function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(\n data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n funcJ: (input: J) => K,\n funcK: (input: K) => L,\n funcL: (input: L) => M,\n funcM: (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 data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n funcJ: (input: J) => K,\n funcK: (input: K) => L,\n funcL: (input: L) => M,\n funcM: (input: M) => N,\n funcN: (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 data: A,\n funcA: (input: A) => B,\n funcB: (input: B) => C,\n funcC: (input: C) => D,\n funcD: (input: D) => E,\n funcE: (input: E) => F,\n funcF: (input: F) => G,\n funcG: (input: G) => H,\n funcH: (input: H) => I,\n funcI: (input: I) => J,\n funcJ: (input: J) => K,\n funcK: (input: K) => L,\n funcL: (input: L) => M,\n funcM: (input: M) => N,\n funcN: (input: N) => O,\n funcO: (input: O) => P,\n): P;\n\nexport function pipe(\n input: unknown,\n ...functions: ReadonlyArray<LazyFunction | ((value: any) => unknown)>\n): any {\n let output = input;\n\n const lazyFunctions = functions.map((op) =>\n 'lazy' in op ? prepareLazyFunction(op) : undefined);\n\n let functionIndex = 0;\n while (functionIndex < functions.length) {\n const lazyFunction = lazyFunctions[functionIndex];\n if (lazyFunction === undefined || !isIterable(output)) {\n const func = functions[functionIndex]!;\n output = func(output);\n functionIndex += 1;\n continue;\n }\n\n const lazySequence: Array<PreparedLazyFunction> = [];\n for (let index = functionIndex; index < functions.length; index++) {\n const lazyOp = lazyFunctions[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 functionIndex += lazySequence.length;\n }\n\n return output;\n}\n\nfunction processItem(\n item: unknown,\n accumulator: Array<unknown>,\n lazySequence: ReadonlyArray<PreparedLazyFunction>,\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 [functionsIndex, 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(functionsIndex + 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 if (lazyResult.hasNext) {\n accumulator.push(currentItem);\n }\n return isDone;\n}\n\nfunction prepareLazyFunction(func: LazyFunction): PreparedLazyFunction {\n const { lazy, lazyArgs } = func;\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":"qDA2RA,SAAgB,EACd,EACA,GAAG,EACE,CACL,IAAI,EAAS,EAEP,EAAgB,EAAU,IAAK,GACnC,SAAU,EAAK,EAAoB,EAAG,CAAG,IAAA,GAAU,CAEjD,EAAgB,EACpB,KAAO,EAAgB,EAAU,QAAQ,CAEvC,GADqB,EAAc,KACd,IAAA,IAAa,CAAC,EAAW,EAAO,CAAE,CACrD,IAAM,EAAO,EAAU,GACvB,EAAS,EAAK,EAAO,CACrB,GAAiB,EACjB,SAGF,IAAMA,EAA4C,EAAE,CACpD,IAAK,IAAI,EAAQ,EAAe,EAAQ,EAAU,OAAQ,IAAS,CACjE,IAAM,EAAS,EAAc,GAM7B,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,GAAiB,EAAa,OAGhC,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,EAAgB,KAAW,EAAa,SAAS,CAAE,CAC7D,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,EAAiB,EAAE,CACvC,CAEC,MAAO,GAGX,OAAO,EAET,EAAc,EAAW,KAE3B,GAAI,CAAC,EAAW,QACd,MAIE,EAAW,OACb,EAAS,IAMb,OAHI,EAAW,SACb,EAAY,KAAK,EAAY,CAExB,EAGT,SAAS,EAAoB,EAA0C,CACrE,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.d.cts
CHANGED
|
@@ -1,34 +1,106 @@
|
|
|
1
1
|
//#region src/pipe.d.ts
|
|
2
2
|
/**
|
|
3
|
-
*
|
|
3
|
+
* Performs left-to-right function composition, passing data through functions
|
|
4
|
+
* in sequence. Each function receives the output of the previous function,
|
|
5
|
+
* creating a readable top-to-bottom data flow that matches how the
|
|
6
|
+
* transformation is executed. This enables converting deeply nested function
|
|
7
|
+
* calls into clear, sequential steps without temporary variables.
|
|
4
8
|
*
|
|
5
|
-
*
|
|
6
|
-
*
|
|
7
|
-
*
|
|
9
|
+
* When consecutive functions with a `lazy` tag (e.g., `map`, `filter`, `take`,
|
|
10
|
+
* `drop`, `forEach`, etc...) are used together, they process data item-by-item
|
|
11
|
+
* rather than creating intermediate arrays. This enables early termination
|
|
12
|
+
* when only partial results are needed, improving performance for large
|
|
13
|
+
* datasets and expensive operations.
|
|
14
|
+
*
|
|
15
|
+
* Functions are only evaluated lazily when their data-last form is used
|
|
16
|
+
* directly in the pipe. To disable lazy evaluation, use data-first calls via
|
|
17
|
+
* arrow functions: `($) => map($, callback)` instead of `map(callback)`.
|
|
18
|
+
*
|
|
19
|
+
* Any function can be used in pipes, not just Remeda utilities. For creating
|
|
20
|
+
* custom functions with currying and lazy evaluation support, see the `purry`
|
|
21
|
+
* utility.
|
|
22
|
+
*
|
|
23
|
+
* A "headless" variant `piped` is available for creating reusable pipe
|
|
24
|
+
* functions without initial data.
|
|
25
|
+
*
|
|
26
|
+
* IMPORTANT: During lazy evaluation, callbacks using the third parameter (the
|
|
27
|
+
* input array) receive only items processed up to that point, not the complete
|
|
28
|
+
* array.
|
|
29
|
+
*
|
|
30
|
+
* @param data - The input data.
|
|
31
|
+
* @param functions - A sequence of functions that take one argument and
|
|
32
|
+
* return a value.
|
|
33
|
+
* @signature
|
|
34
|
+
* P.pipe(data, ...functions);
|
|
8
35
|
* @example
|
|
36
|
+
* P.pipe([1, 2, 3], P.map(P.multiply(3))); //=> [3, 6, 9]
|
|
37
|
+
*
|
|
38
|
+
* // = Early termination with lazy evaluation =
|
|
9
39
|
* P.pipe(
|
|
10
|
-
*
|
|
11
|
-
* P.map(
|
|
12
|
-
*
|
|
13
|
-
*
|
|
40
|
+
* hugeArray,
|
|
41
|
+
* P.map(expensiveComputation),
|
|
42
|
+
* P.filter(complexPredicate),
|
|
43
|
+
* // Only processes items until 2 results are found, then stops.
|
|
44
|
+
* // Most of hugeArray never gets processed.
|
|
45
|
+
* P.take(2),
|
|
46
|
+
* );
|
|
47
|
+
*
|
|
48
|
+
* // = Custom logic within a pipe =
|
|
49
|
+
* P.pipe(
|
|
50
|
+
* input,
|
|
51
|
+
* P.toLowerCase(),
|
|
52
|
+
* normalize,
|
|
53
|
+
* ($) => validate($, CONFIG),
|
|
54
|
+
* P.split(","),
|
|
55
|
+
* P.unique(),
|
|
56
|
+
* );
|
|
57
|
+
*
|
|
58
|
+
* // = Migrating nested transformations to pipes =
|
|
59
|
+
* // Nested
|
|
60
|
+
* const result = P.prop(
|
|
61
|
+
* P.mapValues(P.groupByProp(users, "department"), P.length()),
|
|
62
|
+
* "engineering",
|
|
63
|
+
* );
|
|
64
|
+
*
|
|
65
|
+
* // Piped
|
|
66
|
+
* const result = P.pipe(
|
|
67
|
+
* users,
|
|
68
|
+
* P.groupByProp("department"),
|
|
69
|
+
* P.mapValues(P.length()),
|
|
70
|
+
* P.prop("engineering"),
|
|
71
|
+
* );
|
|
72
|
+
*
|
|
73
|
+
* // = Using the 3rd param of a callback =
|
|
74
|
+
* // The following would print out `data` in its entirety for each value
|
|
75
|
+
* // of `data`.
|
|
76
|
+
* P.forEach([1, 2, 3, 4], (_item, _index, data) => {
|
|
77
|
+
* console.log(data);
|
|
78
|
+
* }); //=> "[1, 2, 3, 4]" logged 4 times
|
|
79
|
+
*
|
|
80
|
+
* // But with `pipe` data would only contain the items up to the current
|
|
81
|
+
* // index
|
|
82
|
+
* P.pipe([1, 2, 3, 4], P.forEach((_item, _index, data) => {
|
|
83
|
+
* console.log(data);
|
|
84
|
+
* })); //=> "[1]", "[1, 2]", "[1, 2, 3]", "[1, 2, 3, 4]"
|
|
14
85
|
* @dataFirst
|
|
15
86
|
* @category Function
|
|
16
87
|
*/
|
|
17
|
-
declare function pipe<A
|
|
18
|
-
declare function pipe<A, B
|
|
19
|
-
declare function pipe<A, B, C
|
|
20
|
-
declare function pipe<A, B, C, D
|
|
21
|
-
declare function pipe<A, B, C, D, E
|
|
22
|
-
declare function pipe<A, B, C, D, E, F
|
|
23
|
-
declare function pipe<A, B, C, D, E, F, G
|
|
24
|
-
declare function pipe<A, B, C, D, E, F, G, H
|
|
25
|
-
declare function pipe<A, B, C, D, E, F, G, H, I
|
|
26
|
-
declare function pipe<A, B, C, D, E, F, G, H, I, J
|
|
27
|
-
declare function pipe<A, B, C, D, E, F, G, H, I, J, K
|
|
28
|
-
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L
|
|
29
|
-
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M
|
|
30
|
-
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N
|
|
31
|
-
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O
|
|
88
|
+
declare function pipe<A>(data: A): A;
|
|
89
|
+
declare function pipe<A, B>(data: A, funcA: (input: A) => B): B;
|
|
90
|
+
declare function pipe<A, B, C>(data: A, funcA: (input: A) => B, funcB: (input: B) => C): C;
|
|
91
|
+
declare function pipe<A, B, C, D>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D): D;
|
|
92
|
+
declare function pipe<A, B, C, D, E>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E): E;
|
|
93
|
+
declare function pipe<A, B, C, D, E, F>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F): F;
|
|
94
|
+
declare function pipe<A, B, C, D, E, F, G>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G): G;
|
|
95
|
+
declare function pipe<A, B, C, D, E, F, G, H>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H): H;
|
|
96
|
+
declare function pipe<A, B, C, D, E, F, G, H, I>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I): I;
|
|
97
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J): J;
|
|
98
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J, K>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J, funcJ: (input: J) => K): K;
|
|
99
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J, funcJ: (input: J) => K, funcK: (input: K) => L): L;
|
|
100
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J, funcJ: (input: J) => K, funcK: (input: K) => L, funcL: (input: L) => M): M;
|
|
101
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J, funcJ: (input: J) => K, funcK: (input: K) => L, funcL: (input: L) => M, funcM: (input: M) => N): N;
|
|
102
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J, funcJ: (input: J) => K, funcK: (input: K) => L, funcL: (input: L) => M, funcM: (input: M) => N, funcN: (input: N) => O): O;
|
|
103
|
+
declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P>(data: A, funcA: (input: A) => B, funcB: (input: B) => C, funcC: (input: C) => D, funcD: (input: D) => E, funcE: (input: E) => F, funcF: (input: F) => G, funcG: (input: G) => H, funcH: (input: H) => I, funcI: (input: I) => J, funcJ: (input: J) => K, funcK: (input: K) => L, funcL: (input: L) => M, funcM: (input: M) => N, funcN: (input: N) => O, funcO: (input: O) => P): P;
|
|
32
104
|
//#endregion
|
|
33
105
|
export { pipe };
|
|
34
106
|
//# sourceMappingURL=pipe.d.cts.map
|
package/dist/pipe.d.cts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pipe.d.cts","names":[],"sources":["../src/pipe.ts"],"sourcesContent":[],"mappings":";;
|
|
1
|
+
{"version":3,"file":"pipe.d.cts","names":[],"sources":["../src/pipe.ts"],"sourcesContent":[],"mappings":";;AAwGA;AAEA;;;;;;AAEA;;;;;;;;AAMA;;;;;;;;;;AAOA;;;;;;;;;;;;AAQA;;;;;;;;;;;;;;AASA;;;;;;;;;;;;;;;;AAUA;;;;;;;;;;;;;;;;;;AAWgB,iBAvDA,IAuDI,CAAA,CAAA,CAAA,CAAA,IAAA,EAvDU,CAuDV,CAAA,EAvDc,CAuDd;AACZ,iBAtDQ,IAsDR,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAtDyB,CAsDzB,EAAA,KAAA,EAAA,CAAA,KAAA,EAtD2C,CAsD3C,EAAA,GAtDiD,CAsDjD,CAAA,EAtDqD,CAsDrD;AACS,iBArDD,IAqDC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EApDT,CAoDS,EAAA,KAAA,EAAA,CAAA,KAAA,EAnDA,CAmDA,EAAA,GAnDM,CAmDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAlDA,CAkDA,EAAA,GAlDM,CAkDN,CAAA,EAjDd,CAiDc;AAAM,iBA/CP,IA+CO,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EA9Cf,CA8Ce,EAAA,KAAA,EAAA,CAAA,KAAA,EA7CN,CA6CM,EAAA,GA7CA,CA6CA,EAAA,KAAA,EAAA,CAAA,KAAA,EA5CN,CA4CM,EAAA,GA5CA,CA4CA,EAAA,KAAA,EAAA,CAAA,KAAA,EA3CN,CA2CM,EAAA,GA3CA,CA2CA,CAAA,EA1CpB,CA0CoB;AACN,iBAzCD,IAyCC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAxCT,CAwCS,EAAA,KAAA,EAAA,CAAA,KAAA,EAvCA,CAuCA,EAAA,GAvCM,CAuCN,EAAA,KAAA,EAAA,CAAA,KAAA,EAtCA,CAsCA,EAAA,GAtCM,CAsCN,EAAA,KAAA,EAAA,CAAA,KAAA,EArCA,CAqCA,EAAA,GArCM,CAqCN,EAAA,KAAA,EAAA,CAAA,KAAA,EApCA,CAoCA,EAAA,GApCM,CAoCN,CAAA,EAnCd,CAmCc;AAAM,iBAjCP,IAiCO,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAhCf,CAgCe,EAAA,KAAA,EAAA,CAAA,KAAA,EA/BN,CA+BM,EAAA,GA/BA,CA+BA,EAAA,KAAA,EAAA,CAAA,KAAA,EA9BN,CA8BM,EAAA,GA9BA,CA8BA,EAAA,KAAA,EAAA,CAAA,KAAA,EA7BN,CA6BM,EAAA,GA7BA,CA6BA,EAAA,KAAA,EAAA,CAAA,KAAA,EA5BN,CA4BM,EAAA,GA5BA,CA4BA,EAAA,KAAA,EAAA,CAAA,KAAA,EA3BN,CA2BM,EAAA,GA3BA,CA2BA,CAAA,EA1BpB,CA0BoB;AACN,iBAzBD,IAyBC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAxBT,CAwBS,EAAA,KAAA,EAAA,CAAA,KAAA,EAvBA,CAuBA,EAAA,GAvBM,CAuBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAtBA,CAsBA,EAAA,GAtBM,CAsBN,EAAA,KAAA,EAAA,CAAA,KAAA,EArBA,CAqBA,EAAA,GArBM,CAqBN,EAAA,KAAA,EAAA,CAAA,KAAA,EApBA,CAoBA,EAAA,GApBM,CAoBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAnBA,CAmBA,EAAA,GAnBM,CAmBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAlBA,CAkBA,EAAA,GAlBM,CAkBN,CAAA,EAjBd,CAiBc;AAAM,iBAfP,IAeO,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAdf,CAce,EAAA,KAAA,EAAA,CAAA,KAAA,EAbN,CAaM,EAAA,GAbA,CAaA,EAAA,KAAA,EAAA,CAAA,KAAA,EAZN,CAYM,EAAA,GAZA,CAYA,EAAA,KAAA,EAAA,CAAA,KAAA,EAXN,CAWM,EAAA,GAXA,CAWA,EAAA,KAAA,EAAA,CAAA,KAAA,EAVN,CAUM,EAAA,GAVA,CAUA,EAAA,KAAA,EAAA,CAAA,KAAA,EATN,CASM,EAAA,GATA,CASA,EAAA,KAAA,EAAA,CAAA,KAAA,EARN,CAQM,EAAA,GARA,CAQA,EAAA,KAAA,EAAA,CAAA,KAAA,EAPN,CAOM,EAAA,GAPA,CAOA,CAAA,EANpB,CAMoB;AACN,iBALD,IAKC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAJT,CAIS,EAAA,KAAA,EAAA,CAAA,KAAA,EAHA,CAGA,EAAA,GAHM,CAGN,EAAA,KAAA,EAAA,CAAA,KAAA,EAFA,CAEA,EAAA,GAFM,CAEN,EAAA,KAAA,EAAA,CAAA,KAAA,EADA,CACA,EAAA,GADM,CACN,EAAA,KAAA,EAAA,CAAA,KAAA,EAAA,CAAA,EAAA,GAAM,CAAN,EAAA,KAAA,EAAA,CAAA,KAAA,EACA,CADA,EAAA,GACM,CADN,EAAA,KAAA,EAAA,CAAA,KAAA,EAEA,CAFA,EAAA,GAEM,CAFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAGA,CAHA,EAAA,GAGM,CAHN,EAAA,KAAA,EAAA,CAAA,KAAA,EAIA,CAJA,EAAA,GAIM,CAJN,CAAA,EAKd,CALc;AAAM,iBAOP,IAPO,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAQf,CARe,EAAA,KAAA,EAAA,CAAA,KAAA,EASN,CATM,EAAA,GASA,CATA,EAAA,KAAA,EAAA,CAAA,KAAA,EAUN,CAVM,EAAA,GAUA,CAVA,EAAA,KAAA,EAAA,CAAA,KAAA,EAWN,CAXM,EAAA,GAWA,CAXA,EAAA,KAAA,EAAA,CAAA,KAAA,EAYN,CAZM,EAAA,GAYA,CAZA,EAAA,KAAA,EAAA,CAAA,KAAA,EAaN,CAbM,EAAA,GAaA,CAbA,EAAA,KAAA,EAAA,CAAA,KAAA,EAcN,CAdM,EAAA,GAcA,CAdA,EAAA,KAAA,EAAA,CAAA,KAAA,EAeN,CAfM,EAAA,GAeA,CAfA,EAAA,KAAA,EAAA,CAAA,KAAA,EAgBN,CAhBM,EAAA,GAgBA,CAhBA,EAAA,KAAA,EAAA,CAAA,KAAA,EAiBN,CAjBM,EAAA,GAiBA,CAjBA,CAAA,EAkBpB,CAlBoB;AACN,iBAmBD,IAnBC,CAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,EAAA,CAAA,CAAA,CAAA,IAAA,EAoBT,CApBS,EAAA,KAAA,EAAA,CAAA,KAAA,EAqBA,CArBA,EAAA,GAqBM,CArBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAsBA,CAtBA,EAAA,GAsBM,CAtBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAuBA,CAvBA,EAAA,GAuBM,CAvBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAwBA,CAxBA,EAAA,GAwBM,CAxBN,EAAA,KAAA,EAAA,CAAA,KAAA,EAyBA,CAzBA,EAAA,GAyBM,CAzBN,EAAA,KAAA,EAAA,CAAA,KAAA,EA0BA,CA1BA,EAAA,GA0BM,CA1BN,EAAA,KAAA,EAAA,CAAA,KAAA,EA2BA,CA3BA,EAAA,GA2BM,CA3BN,EAAA,KAAA,EAAA,CAAA,KAAA,EA4BA,CA5BA,EAAA,GA4BM,CA5BN,EAAA,KAAA,EAAA,CAAA,KAAA,EA6BA,CA7BA,EAAA,GA6BM,CA7BN,EAAA,KAAA,EAAA,CAAA,KAAA,EA8BA,CA9BA,EAAA,GA8BM,CA9BN,CAAA,EA+Bd,CA/Bc;AAAM,iBAiCP,IAjCO,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,IAAA,EAkCf,CAlCe,EAAA,KAAA,EAAA,CAAA,KAAA,EAmCN,CAnCM,EAAA,GAmCA,CAnCA,EAAA,KAAA,EAAA,CAAA,KAAA,EAoCN,CApCM,EAAA,GAoCA,CApCA,EAAA,KAAA,EAAA,CAAA,KAAA,EAqCN,CArCM,EAAA,GAqCA,CArCA,EAAA,KAAA,EAAA,CAAA,KAAA,EAsCN,CAtCM,EAAA,GAsCA,CAtCA,EAAA,KAAA,EAAA,CAAA,KAAA,EAuCN,CAvCM,EAAA,GAuCA,CAvCA,EAAA,KAAA,EAAA,CAAA,KAAA,EAwCN,CAxCM,EAAA,GAwCA,CAxCA,EAAA,KAAA,EAAA,CAAA,KAAA,EAyCN,CAzCM,EAAA,GAyCA,CAzCA,EAAA,KAAA,EAAA,CAAA,KAAA,EA0CN,CA1CM,EAAA,GA0CA,CA1CA,EAAA,KAAA,EAAA,CAAA,KAAA,EA2CN,CA3CM,EAAA,GA2CA,CA3CA,EAAA,KAAA,EAAA,CAAA,KAAA,EA4CN,CA5CM,EAAA,GA4CA,CA5CA,EAAA,KAAA,EAAA,CAAA,KAAA,EA6CN,CA7CM,EAAA,GA6CA,CA7CA,CAAA,EA8CpB,CA9CoB;AACN,iBA+CD,IA/CC,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,IAAA,EAgDT,CAhDS,EAAA,KAAA,EAAA,CAAA,KAAA,EAiDA,CAjDA,EAAA,GAiDM,CAjDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAkDA,CAlDA,EAAA,GAkDM,CAlDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAmDA,CAnDA,EAAA,GAmDM,CAnDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAoDA,CApDA,EAAA,GAoDM,CApDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAqDA,CArDA,EAAA,GAqDM,CArDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAsDA,CAtDA,EAAA,GAsDM,CAtDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAuDA,CAvDA,EAAA,GAuDM,CAvDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAwDA,CAxDA,EAAA,GAwDM,CAxDN,EAAA,KAAA,EAAA,CAAA,KAAA,EAyDA,CAzDA,EAAA,GAyDM,CAzDN,EAAA,KAAA,EAAA,CAAA,KAAA,EA0DA,CA1DA,EAAA,GA0DM,CA1DN,EAAA,KAAA,EAAA,CAAA,KAAA,EA2DA,CA3DA,EAAA,GA2DM,CA3DN,EAAA,KAAA,EAAA,CAAA,KAAA,EA4DA,CA5DA,EAAA,GA4DM,CA5DN,CAAA,EA6Dd,CA7Dc;AAAM,iBA+DP,IA/DO,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,IAAA,EAgEf,CAhEe,EAAA,KAAA,EAAA,CAAA,KAAA,EAiEN,CAjEM,EAAA,GAiEA,CAjEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAkEN,CAlEM,EAAA,GAkEA,CAlEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAmEN,CAnEM,EAAA,GAmEA,CAnEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAoEN,CApEM,EAAA,GAoEA,CApEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAqEN,CArEM,EAAA,GAqEA,CArEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAsEN,CAtEM,EAAA,GAsEA,CAtEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAuEN,CAvEM,EAAA,GAuEA,CAvEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAwEN,CAxEM,EAAA,GAwEA,CAxEA,EAAA,KAAA,EAAA,CAAA,KAAA,EAyEN,CAzEM,EAAA,GAyEA,CAzEA,EAAA,KAAA,EAAA,CAAA,KAAA,EA0EN,CA1EM,EAAA,GA0EA,CA1EA,EAAA,KAAA,EAAA,CAAA,KAAA,EA2EN,CA3EM,EAAA,GA2EA,CA3EA,EAAA,KAAA,EAAA,CAAA,KAAA,EA4EN,CA5EM,EAAA,GA4EA,CA5EA,EAAA,KAAA,EAAA,CAAA,KAAA,EA6EN,CA7EM,EAAA,GA6EA,CA7EA,CAAA,EA8EpB,CA9EoB;AACN,iBA+ED,IA/EC,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,IAAA,EAgFT,CAhFS,EAAA,KAAA,EAAA,CAAA,KAAA,EAiFA,CAjFA,EAAA,GAiFM,CAjFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAkFA,CAlFA,EAAA,GAkFM,CAlFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAmFA,CAnFA,EAAA,GAmFM,CAnFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAoFA,CApFA,EAAA,GAoFM,CApFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAqFA,CArFA,EAAA,GAqFM,CArFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAsFA,CAtFA,EAAA,GAsFM,CAtFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAuFA,CAvFA,EAAA,GAuFM,CAvFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAwFA,CAxFA,EAAA,GAwFM,CAxFN,EAAA,KAAA,EAAA,CAAA,KAAA,EAyFA,CAzFA,EAAA,GAyFM,CAzFN,EAAA,KAAA,EAAA,CAAA,KAAA,EA0FA,CA1FA,EAAA,GA0FM,CA1FN,EAAA,KAAA,EAAA,CAAA,KAAA,EA2FA,CA3FA,EAAA,GA2FM,CA3FN,EAAA,KAAA,EAAA,CAAA,KAAA,EA4FA,CA5FA,EAAA,GA4FM,CA5FN,EAAA,KAAA,EAAA,CAAA,KAAA,EA6FA,CA7FA,EAAA,GA6FM,CA7FN,EAAA,KAAA,EAAA,CAAA,KAAA,EA8FA,CA9FA,EAAA,GA8FM,CA9FN,CAAA,EA+Fd,CA/Fc;AAAM,iBAiGP,IAjGO,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,IAAA,EAkGf,CAlGe,EAAA,KAAA,EAAA,CAAA,KAAA,EAmGN,CAnGM,EAAA,GAmGA,CAnGA,EAAA,KAAA,EAAA,CAAA,KAAA,EAoGN,CApGM,EAAA,GAoGA,CApGA,EAAA,KAAA,EAAA,CAAA,KAAA,EAqGN,CArGM,EAAA,GAqGA,CArGA,EAAA,KAAA,EAAA,CAAA,KAAA,EAsGN,CAtGM,EAAA,GAsGA,CAtGA,EAAA,KAAA,EAAA,CAAA,KAAA,EAuGN,CAvGM,EAAA,GAuGA,CAvGA,EAAA,KAAA,EAAA,CAAA,KAAA,EAwGN,CAxGM,EAAA,GAwGA,CAxGA,EAAA,KAAA,EAAA,CAAA,KAAA,EAyGN,CAzGM,EAAA,GAyGA,CAzGA,EAAA,KAAA,EAAA,CAAA,KAAA,EA0GN,CA1GM,EAAA,GA0GA,CA1GA,EAAA,KAAA,EAAA,CAAA,KAAA,EA2GN,CA3GM,EAAA,GA2GA,CA3GA,EAAA,KAAA,EAAA,CAAA,KAAA,EA4GN,CA5GM,EAAA,GA4GA,CA5GA,EAAA,KAAA,EAAA,CAAA,KAAA,EA6GN,CA7GM,EAAA,GA6GA,CA7GA,EAAA,KAAA,EAAA,CAAA,KAAA,EA8GN,CA9GM,EAAA,GA8GA,CA9GA,EAAA,KAAA,EAAA,CAAA,KAAA,EA+GN,CA/GM,EAAA,GA+GA,CA/GA,EAAA,KAAA,EAAA,CAAA,KAAA,EAgHN,CAhHM,EAAA,GAgHA,CAhHA,EAAA,KAAA,EAAA,CAAA,KAAA,EAiHN,CAjHM,EAAA,GAiHA,CAjHA,CAAA,EAkHpB,CAlHoB"}
|