rubico 1.9.7 → 2.0.1
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/.eslintignore +5 -0
- package/.eslintrc.js +3 -2
- package/.github/workflows/nodejs.yml +1 -1
- package/AggregateReducer.js +19 -0
- package/AggregateReducer.test.js +82 -0
- package/CHANGELOG.md +22 -1
- package/README.md +158 -81
- package/Transducer.js +75 -26
- package/Transducer.test.js +117 -0
- package/_internal/ComparisonOperator.js +68 -0
- package/_internal/File.js +41 -0
- package/_internal/FlatMappingAsyncIterator.js +4 -4
- package/_internal/FlatMappingIterator.js +1 -1
- package/_internal/TimeInLoopSuite.js +138 -0
- package/_internal/areAnyValuesPromises.js +23 -0
- package/_internal/{arrayAll.js → arrayEvery.js} +4 -4
- package/_internal/arrayExtend.js +3 -2
- package/_internal/arrayFilter.js +3 -4
- package/_internal/{arrayAny.js → arraySome.js} +8 -8
- package/_internal/{asyncIteratorAll.js → asyncIteratorEvery.js} +4 -4
- package/_internal/{asyncIteratorAny.js → asyncIteratorSome.js} +4 -4
- package/_internal/curry4.test.js +25 -0
- package/_internal/curry5.test.js +29 -0
- package/_internal/curryArgs2.js +43 -0
- package/_internal/curryArgs3.test.js +21 -0
- package/_internal/curryArgs4.js +65 -0
- package/_internal/curryArgs4.test.js +25 -0
- package/_internal/equals.js +13 -0
- package/_internal/findAllFilePaths.js +22 -0
- package/_internal/funcApply.js +2 -0
- package/_internal/funcCall.js +14 -0
- package/_internal/functionArrayAll.js +26 -0
- package/_internal/functionArrayAllSeries.js +55 -0
- package/_internal/functionObjectAll.js +32 -0
- package/_internal/genericReduce.js +4 -22
- package/_internal/genericTransform.js +15 -15
- package/_internal/improvedGenericTransform.js +93 -0
- package/_internal/{iteratorAll.js → iteratorEvery.js} +4 -4
- package/_internal/{iteratorAny.js → iteratorSome.js} +6 -6
- package/_internal/leftResolverRightResolverCompare.js +19 -0
- package/_internal/leftResolverRightValueCompare.js +16 -0
- package/_internal/leftValueRightResolverCompare.js +16 -0
- package/_internal/objectReduce.js +0 -1
- package/_internal/pathResolve.js +6 -0
- package/_internal/{reducerAll.js → reducerEvery.js} +4 -4
- package/_internal/reducerFlatMap.js +4 -4
- package/_internal/reducerFlatten.js +1 -1
- package/_internal/{reducerAny.js → reducerSome.js} +4 -4
- package/_internal/timeInLoop.js +37 -0
- package/_internal/timeInLoop.test.js +18 -0
- package/_internal/timeInLoopAsync.js +35 -0
- package/_internal/timeInLoopAsync.test.js +22 -0
- package/all.js +106 -40
- package/and.js +54 -36
- package/archive/{FlatMappingIteratorCool.js → FlatMappingIterator-2020-09-28.js} +1 -1
- package/archive/_Promise-2023-05-29.js +93 -0
- package/archive/arrayMap2-2023-05-29.js +73 -0
- package/archive/benchmarks-v1.9.7/all.js +34 -0
- package/archive/benchmarks-v1.9.7/and.js +24 -0
- package/archive/benchmarks-v1.9.7/assign.js +174 -0
- package/archive/benchmarks-v1.9.7/curry.js +55 -0
- package/archive/benchmarks-v1.9.7/eq.js +25 -0
- package/archive/benchmarks-v1.9.7/filter.js +1322 -0
- package/archive/benchmarks-v1.9.7/flatMap.js +48 -0
- package/archive/benchmarks-v1.9.7/get.js +44 -0
- package/archive/benchmarks-v1.9.7/gt.js +25 -0
- package/archive/benchmarks-v1.9.7/gte.js +25 -0
- package/archive/benchmarks-v1.9.7/lt.js +25 -0
- package/archive/benchmarks-v1.9.7/lte.js +25 -0
- package/archive/benchmarks-v1.9.7/map.js +892 -0
- package/archive/benchmarks-v1.9.7/omit.js +28 -0
- package/archive/benchmarks-v1.9.7/or.js +51 -0
- package/archive/benchmarks-v1.9.7/pick.js +24 -0
- package/archive/benchmarks-v1.9.7/pipe.js +152 -0
- package/archive/benchmarks-v1.9.7/reduce.js +739 -0
- package/archive/benchmarks-v1.9.7/switchCase.js +256 -0
- package/archive/benchmarks-v1.9.7/tap.js +90 -0
- package/archive/benchmarks-v1.9.7/transform.js +218 -0
- package/archive/benchmarks-v1.9.7/tryCatch.js +108 -0
- package/assign.js +18 -8
- package/bench +65 -0
- package/benchmark-output/v1.9.7 +268 -0
- package/benchmarks/all.async.js +43 -0
- package/benchmarks/all.js +42 -33
- package/benchmarks/always.js +15 -0
- package/benchmarks/and.async.js +25 -0
- package/benchmarks/and.js +20 -19
- package/benchmarks/assign.async.js +27 -0
- package/benchmarks/assign.js +20 -167
- package/benchmarks/curry.js +34 -54
- package/benchmarks/eq.async.js +23 -0
- package/benchmarks/eq.js +17 -19
- package/benchmarks/every.async.js +19 -0
- package/benchmarks/every.js +19 -0
- package/benchmarks/filter.async.js +32 -0
- package/benchmarks/filter.js +27 -1311
- package/benchmarks/flatMap.async.js +26 -0
- package/benchmarks/flatMap.js +26 -36
- package/benchmarks/get.async.js +19 -0
- package/benchmarks/get.js +27 -32
- package/benchmarks/gt.async.js +23 -0
- package/benchmarks/gt.js +17 -19
- package/benchmarks/gte.async.js +23 -0
- package/benchmarks/gte.js +17 -19
- package/benchmarks/lt.async.js +23 -0
- package/benchmarks/lt.js +17 -19
- package/benchmarks/lte.async.js +23 -0
- package/benchmarks/lte.js +17 -19
- package/benchmarks/map.async.js +43 -0
- package/benchmarks/map.js +24 -876
- package/benchmarks/misc/Promise.js +26 -0
- package/benchmarks/misc/isPromise.js +30 -0
- package/benchmarks/misc/promiseAll.js +36 -0
- package/benchmarks/not.js +23 -0
- package/benchmarks/omit.js +30 -20
- package/benchmarks/or.async.js +25 -0
- package/benchmarks/or.js +23 -49
- package/benchmarks/pick.js +30 -16
- package/benchmarks/pipe.async.js +47 -0
- package/benchmarks/pipe.js +46 -151
- package/benchmarks/reduce.async.js +32 -0
- package/benchmarks/reduce.js +27 -728
- package/benchmarks/set.async.js +19 -0
- package/benchmarks/set.js +41 -0
- package/benchmarks/some.async.js +19 -0
- package/benchmarks/some.js +19 -0
- package/benchmarks/switchCase.async.js +27 -0
- package/benchmarks/switchCase.js +55 -256
- package/benchmarks/tap.js +10 -85
- package/benchmarks/thunkify.js +15 -0
- package/benchmarks/transform.async.js +27 -0
- package/benchmarks/transform.js +28 -206
- package/benchmarks/tryCatch.async.js +25 -0
- package/benchmarks/tryCatch.js +24 -100
- package/build +472 -0
- package/compose.js +46 -0
- package/dist/Transducer.es.js +481 -0
- package/dist/Transducer.es.min.js +7 -0
- package/dist/Transducer.js +488 -0
- package/dist/Transducer.min.js +8 -0
- package/dist/Transducer.mjs +481 -0
- package/dist/__.es.js +2 -2
- package/dist/__.es.min.js +2 -2
- package/dist/__.js +2 -2
- package/dist/__.min.js +2 -2
- package/dist/__.mjs +2 -2
- package/dist/all.es.js +173 -92
- package/dist/all.es.min.js +3 -3
- package/dist/all.js +173 -92
- package/dist/all.min.js +3 -3
- package/dist/all.mjs +173 -92
- package/dist/always.es.js +2 -2
- package/dist/always.es.min.js +2 -2
- package/dist/always.js +2 -2
- package/dist/always.min.js +2 -2
- package/dist/always.mjs +2 -2
- package/dist/and.es.js +101 -32
- package/dist/and.es.min.js +3 -3
- package/dist/and.js +101 -32
- package/dist/and.min.js +3 -3
- package/dist/and.mjs +101 -32
- package/dist/assign.es.js +37 -10
- package/dist/assign.es.min.js +3 -3
- package/dist/assign.js +37 -10
- package/dist/assign.min.js +3 -3
- package/dist/assign.mjs +37 -10
- package/dist/compose.es.js +71 -0
- package/dist/compose.es.min.js +7 -0
- package/dist/compose.js +78 -0
- package/dist/compose.min.js +8 -0
- package/dist/compose.mjs +71 -0
- package/dist/curry.es.js +2 -2
- package/dist/curry.es.min.js +2 -2
- package/dist/curry.js +2 -2
- package/dist/curry.min.js +2 -2
- package/dist/curry.mjs +2 -2
- package/dist/eq.es.js +172 -49
- package/dist/eq.es.min.js +3 -3
- package/dist/eq.js +172 -49
- package/dist/eq.min.js +3 -3
- package/dist/eq.mjs +172 -49
- package/dist/every.es.js +194 -0
- package/dist/every.es.min.js +7 -0
- package/dist/every.js +201 -0
- package/dist/every.min.js +8 -0
- package/dist/every.mjs +194 -0
- package/dist/filter.es.js +14 -108
- package/dist/filter.es.min.js +3 -3
- package/dist/filter.js +14 -108
- package/dist/filter.min.js +3 -3
- package/dist/filter.mjs +14 -108
- package/dist/flatMap.es.js +27 -214
- package/dist/flatMap.es.min.js +3 -3
- package/dist/flatMap.js +27 -214
- package/dist/flatMap.min.js +3 -3
- package/dist/flatMap.mjs +27 -214
- package/dist/{x/forEach.es.js → forEach.es.js} +52 -70
- package/dist/forEach.es.min.js +7 -0
- package/dist/{x/forEach.js → forEach.js} +52 -70
- package/dist/forEach.min.js +8 -0
- package/dist/{x/forEach.mjs → forEach.mjs} +52 -70
- package/dist/get.es.js +60 -5
- package/dist/get.es.min.js +3 -3
- package/dist/get.js +60 -5
- package/dist/get.min.js +3 -3
- package/dist/get.mjs +60 -5
- package/dist/gt.es.js +171 -48
- package/dist/gt.es.min.js +3 -3
- package/dist/gt.js +171 -48
- package/dist/gt.min.js +3 -3
- package/dist/gt.mjs +171 -48
- package/dist/gte.es.js +171 -48
- package/dist/gte.es.min.js +3 -3
- package/dist/gte.js +171 -48
- package/dist/gte.min.js +3 -3
- package/dist/gte.mjs +171 -48
- package/dist/lt.es.js +171 -48
- package/dist/lt.es.min.js +3 -3
- package/dist/lt.js +171 -48
- package/dist/lt.min.js +3 -3
- package/dist/lt.mjs +171 -48
- package/dist/lte.es.js +171 -48
- package/dist/lte.es.min.js +3 -3
- package/dist/lte.js +171 -48
- package/dist/lte.min.js +3 -3
- package/dist/lte.mjs +171 -48
- package/dist/map.es.js +12 -101
- package/dist/map.es.min.js +3 -3
- package/dist/map.js +12 -101
- package/dist/map.min.js +3 -3
- package/dist/map.mjs +12 -101
- package/dist/not.es.js +75 -14
- package/dist/not.es.min.js +3 -3
- package/dist/not.js +75 -14
- package/dist/not.min.js +3 -3
- package/dist/not.mjs +75 -14
- package/dist/omit.es.js +7 -2
- package/dist/omit.es.min.js +3 -3
- package/dist/omit.js +7 -2
- package/dist/omit.min.js +3 -3
- package/dist/omit.mjs +7 -2
- package/dist/or.es.js +99 -31
- package/dist/or.es.min.js +3 -3
- package/dist/or.js +99 -31
- package/dist/or.min.js +3 -3
- package/dist/or.mjs +99 -31
- package/dist/pick.es.js +8 -3
- package/dist/pick.es.min.js +3 -3
- package/dist/pick.js +8 -3
- package/dist/pick.min.js +3 -3
- package/dist/pick.mjs +8 -3
- package/dist/pipe.es.js +42 -46
- package/dist/pipe.es.min.js +3 -3
- package/dist/pipe.js +42 -46
- package/dist/pipe.min.js +3 -3
- package/dist/pipe.mjs +42 -46
- package/dist/reduce.es.js +52 -94
- package/dist/reduce.es.min.js +3 -3
- package/dist/reduce.js +52 -94
- package/dist/reduce.min.js +3 -3
- package/dist/reduce.mjs +52 -94
- package/dist/rubico.es.js +762 -883
- package/dist/rubico.es.min.js +3 -3
- package/dist/rubico.global.js +2794 -0
- package/dist/rubico.global.min.js +8 -0
- package/dist/rubico.js +739 -869
- package/dist/rubico.min.js +3 -3
- package/dist/rubico.mjs +762 -883
- package/dist/set.es.js +18 -3
- package/dist/set.es.min.js +3 -3
- package/dist/set.js +18 -3
- package/dist/set.min.js +3 -3
- package/dist/set.mjs +18 -3
- package/dist/{any.js → some.es.js} +64 -54
- package/dist/some.es.min.js +7 -0
- package/dist/{any.mjs → some.js} +72 -48
- package/dist/some.min.js +8 -0
- package/dist/{any.es.js → some.mjs} +65 -48
- package/dist/switchCase.es.js +55 -5
- package/dist/switchCase.es.min.js +3 -3
- package/dist/switchCase.js +55 -5
- package/dist/switchCase.min.js +3 -3
- package/dist/switchCase.mjs +55 -5
- package/dist/tap.es.js +2 -9
- package/dist/tap.es.min.js +3 -3
- package/dist/tap.js +2 -9
- package/dist/tap.min.js +3 -3
- package/dist/tap.mjs +2 -9
- package/dist/thunkify.es.js +45 -2
- package/dist/thunkify.es.min.js +3 -3
- package/dist/thunkify.js +45 -2
- package/dist/thunkify.min.js +3 -3
- package/dist/thunkify.mjs +45 -2
- package/dist/transform.es.js +35 -71
- package/dist/transform.es.min.js +3 -3
- package/dist/transform.js +35 -71
- package/dist/transform.min.js +3 -3
- package/dist/transform.mjs +35 -71
- package/dist/tryCatch.es.js +33 -17
- package/dist/tryCatch.es.min.js +3 -3
- package/dist/tryCatch.js +33 -17
- package/dist/tryCatch.min.js +3 -3
- package/dist/tryCatch.mjs +33 -17
- package/dist/x/append.es.js +2 -2
- package/dist/x/append.es.min.js +2 -2
- package/dist/x/append.js +2 -2
- package/dist/x/append.min.js +2 -2
- package/dist/x/append.mjs +2 -2
- package/dist/x/callProp.es.js +2 -2
- package/dist/x/callProp.es.min.js +2 -2
- package/dist/x/callProp.js +2 -2
- package/dist/x/callProp.min.js +2 -2
- package/dist/x/callProp.mjs +2 -2
- package/dist/x/defaultsDeep.es.js +2 -2
- package/dist/x/defaultsDeep.es.min.js +2 -2
- package/dist/x/defaultsDeep.js +2 -2
- package/dist/x/defaultsDeep.min.js +2 -2
- package/dist/x/defaultsDeep.mjs +2 -2
- package/dist/x/differenceWith.es.js +7 -7
- package/dist/x/differenceWith.es.min.js +3 -3
- package/dist/x/differenceWith.js +7 -7
- package/dist/x/differenceWith.min.js +2 -2
- package/dist/x/differenceWith.mjs +7 -7
- package/dist/x/filterOut.es.js +60 -117
- package/dist/x/filterOut.es.min.js +3 -3
- package/dist/x/filterOut.js +60 -117
- package/dist/x/filterOut.min.js +3 -3
- package/dist/x/filterOut.mjs +60 -117
- package/dist/x/find.es.js +2 -2
- package/dist/x/find.es.min.js +2 -2
- package/dist/x/find.js +2 -2
- package/dist/x/find.min.js +2 -2
- package/dist/x/find.mjs +2 -2
- package/dist/x/findIndex.es.js +2 -2
- package/dist/x/findIndex.es.min.js +2 -2
- package/dist/x/findIndex.js +2 -2
- package/dist/x/findIndex.min.js +2 -2
- package/dist/x/findIndex.mjs +2 -2
- package/dist/x/first.es.js +2 -2
- package/dist/x/first.es.min.js +2 -2
- package/dist/x/first.js +2 -2
- package/dist/x/first.min.js +2 -2
- package/dist/x/first.mjs +2 -2
- package/dist/x/flatten.es.js +20 -207
- package/dist/x/flatten.es.min.js +3 -3
- package/dist/x/flatten.js +20 -207
- package/dist/x/flatten.min.js +3 -3
- package/dist/x/flatten.mjs +20 -207
- package/dist/x/groupBy.es.js +52 -94
- package/dist/x/groupBy.es.min.js +3 -3
- package/dist/x/groupBy.js +52 -94
- package/dist/x/groupBy.min.js +3 -3
- package/dist/x/groupBy.mjs +52 -94
- package/dist/x/has.es.js +2 -2
- package/dist/x/has.es.min.js +2 -2
- package/dist/x/has.js +2 -2
- package/dist/x/has.min.js +2 -2
- package/dist/x/has.mjs +2 -2
- package/dist/x/identity.es.js +2 -2
- package/dist/x/identity.es.min.js +2 -2
- package/dist/x/identity.js +2 -2
- package/dist/x/identity.min.js +2 -2
- package/dist/x/identity.mjs +2 -2
- package/dist/x/includes.es.js +2 -2
- package/dist/x/includes.es.min.js +2 -2
- package/dist/x/includes.js +2 -2
- package/dist/x/includes.min.js +2 -2
- package/dist/x/includes.mjs +2 -2
- package/dist/x/isDeepEqual.es.js +2 -2
- package/dist/x/isDeepEqual.es.min.js +2 -2
- package/dist/x/isDeepEqual.js +2 -2
- package/dist/x/isDeepEqual.min.js +2 -2
- package/dist/x/isDeepEqual.mjs +2 -2
- package/dist/x/isEmpty.es.js +2 -2
- package/dist/x/isEmpty.es.min.js +2 -2
- package/dist/x/isEmpty.js +2 -2
- package/dist/x/isEmpty.min.js +2 -2
- package/dist/x/isEmpty.mjs +2 -2
- package/dist/x/isEqual.es.js +2 -2
- package/dist/x/isEqual.es.min.js +2 -2
- package/dist/x/isEqual.js +2 -2
- package/dist/x/isEqual.min.js +2 -2
- package/dist/x/isEqual.mjs +2 -2
- package/dist/x/isFunction.es.js +2 -2
- package/dist/x/isFunction.es.min.js +2 -2
- package/dist/x/isFunction.js +2 -2
- package/dist/x/isFunction.min.js +2 -2
- package/dist/x/isFunction.mjs +2 -2
- package/dist/x/isIn.es.js +2 -2
- package/dist/x/isIn.es.min.js +2 -2
- package/dist/x/isIn.js +2 -2
- package/dist/x/isIn.min.js +2 -2
- package/dist/x/isIn.mjs +2 -2
- package/dist/x/isObject.es.js +2 -2
- package/dist/x/isObject.es.min.js +2 -2
- package/dist/x/isObject.js +2 -2
- package/dist/x/isObject.min.js +2 -2
- package/dist/x/isObject.mjs +2 -2
- package/dist/x/isString.es.js +2 -2
- package/dist/x/isString.es.min.js +2 -2
- package/dist/x/isString.js +2 -2
- package/dist/x/isString.min.js +2 -2
- package/dist/x/isString.mjs +2 -2
- package/dist/x/keys.es.js +2 -2
- package/dist/x/keys.es.min.js +2 -2
- package/dist/x/keys.js +2 -2
- package/dist/x/keys.min.js +2 -2
- package/dist/x/keys.mjs +2 -2
- package/dist/x/last.es.js +2 -2
- package/dist/x/last.es.min.js +2 -2
- package/dist/x/last.js +2 -2
- package/dist/x/last.min.js +2 -2
- package/dist/x/last.mjs +2 -2
- package/dist/x/maxBy.es.js +59 -6
- package/dist/x/maxBy.es.min.js +3 -3
- package/dist/x/maxBy.js +59 -6
- package/dist/x/maxBy.min.js +3 -3
- package/dist/x/maxBy.mjs +59 -6
- package/dist/x/noop.es.js +2 -2
- package/dist/x/noop.es.min.js +2 -2
- package/dist/x/noop.js +2 -2
- package/dist/x/noop.min.js +2 -2
- package/dist/x/noop.mjs +2 -2
- package/dist/x/pluck.es.js +32 -103
- package/dist/x/pluck.es.min.js +3 -3
- package/dist/x/pluck.js +32 -103
- package/dist/x/pluck.min.js +3 -3
- package/dist/x/pluck.mjs +32 -103
- package/dist/x/prepend.es.js +2 -2
- package/dist/x/prepend.es.min.js +2 -2
- package/dist/x/prepend.js +2 -2
- package/dist/x/prepend.min.js +2 -2
- package/dist/x/prepend.mjs +2 -2
- package/dist/x/size.es.js +2 -2
- package/dist/x/size.es.min.js +2 -2
- package/dist/x/size.js +2 -2
- package/dist/x/size.min.js +2 -2
- package/dist/x/size.mjs +2 -2
- package/dist/x/trace.es.js +2 -9
- package/dist/x/trace.es.min.js +3 -3
- package/dist/x/trace.js +2 -9
- package/dist/x/trace.min.js +3 -3
- package/dist/x/trace.mjs +2 -9
- package/dist/x/unionWith.es.js +2 -2
- package/dist/x/unionWith.es.min.js +2 -2
- package/dist/x/unionWith.js +2 -2
- package/dist/x/unionWith.min.js +2 -2
- package/dist/x/unionWith.mjs +2 -2
- package/dist/x/uniq.es.js +2 -2
- package/dist/x/uniq.es.min.js +2 -2
- package/dist/x/uniq.js +2 -2
- package/dist/x/uniq.min.js +2 -2
- package/dist/x/uniq.mjs +2 -2
- package/dist/x/unless.es.js +2 -2
- package/dist/x/unless.es.min.js +2 -2
- package/dist/x/unless.js +2 -2
- package/dist/x/unless.min.js +2 -2
- package/dist/x/unless.mjs +2 -2
- package/dist/x/values.es.js +2 -2
- package/dist/x/values.es.min.js +2 -2
- package/dist/x/values.js +2 -2
- package/dist/x/values.min.js +2 -2
- package/dist/x/values.mjs +2 -2
- package/dist/x/when.es.js +2 -2
- package/dist/x/when.es.min.js +2 -2
- package/dist/x/when.js +2 -2
- package/dist/x/when.min.js +2 -2
- package/dist/x/when.mjs +2 -2
- package/dist-test.js +31 -2042
- package/eq.js +21 -63
- package/es.js +739 -869
- package/every.js +94 -0
- package/filter.js +23 -91
- package/flatMap.js +75 -70
- package/forEach.js +82 -0
- package/get.js +23 -6
- package/global.js +6 -4
- package/gt.js +15 -58
- package/gte.js +14 -57
- package/index.js +739 -869
- package/lt.js +17 -60
- package/lte.js +14 -57
- package/map.js +9 -94
- package/memory-usage/reduce.js +2 -2
- package/not.js +27 -45
- package/omit.js +4 -0
- package/or.js +50 -33
- package/package.json +7 -7
- package/pick.js +5 -1
- package/pipe.js +13 -50
- package/reduce.js +42 -51
- package/rubico.js +22 -11
- package/set.js +43 -10
- package/some.js +105 -0
- package/switchCase.js +13 -3
- package/tap.js +0 -24
- package/test.js +847 -1096
- package/thunkify.js +9 -0
- package/tmp.js +1 -0
- package/transform.js +31 -16
- package/tryCatch.js +19 -15
- package/x/differenceWith.js +3 -3
- package/x/filterOut.test.js +6 -6
- package/x/flatten.js +1 -1
- package/x/flatten.test.js +0 -8
- package/x/index.js +0 -2
- package/x/pluck.js +18 -27
- package/x/pluck.test.js +3 -7
- package/x/timeInLoop.js +16 -25
- package/x/timeInLoop.test.js +8 -4
- package/any.js +0 -82
- package/dist/__.min.mjs +0 -7
- package/dist/all.min.mjs +0 -7
- package/dist/always.min.mjs +0 -7
- package/dist/and.min.mjs +0 -7
- package/dist/any.es.min.js +0 -7
- package/dist/any.min.js +0 -8
- package/dist/any.min.mjs +0 -7
- package/dist/assign.min.mjs +0 -7
- package/dist/curry.min.mjs +0 -7
- package/dist/eq.min.mjs +0 -7
- package/dist/filter.min.mjs +0 -7
- package/dist/flatMap.min.mjs +0 -7
- package/dist/fork.es.js +0 -159
- package/dist/fork.es.min.js +0 -7
- package/dist/fork.js +0 -166
- package/dist/fork.min.js +0 -8
- package/dist/fork.min.mjs +0 -7
- package/dist/fork.mjs +0 -159
- package/dist/get.min.mjs +0 -7
- package/dist/gt.min.mjs +0 -7
- package/dist/gte.min.mjs +0 -7
- package/dist/lt.min.mjs +0 -7
- package/dist/lte.min.mjs +0 -7
- package/dist/map.min.mjs +0 -7
- package/dist/not.min.mjs +0 -7
- package/dist/omit.min.mjs +0 -7
- package/dist/or.min.mjs +0 -7
- package/dist/pick.min.mjs +0 -7
- package/dist/pipe.min.mjs +0 -7
- package/dist/reduce.min.mjs +0 -7
- package/dist/rubico.min.mjs +0 -7
- package/dist/set.min.mjs +0 -7
- package/dist/switchCase.min.mjs +0 -7
- package/dist/tap.min.mjs +0 -7
- package/dist/thunkify.min.mjs +0 -7
- package/dist/transform.min.mjs +0 -7
- package/dist/tryCatch.min.mjs +0 -7
- package/dist/x/append.min.mjs +0 -7
- package/dist/x/callProp.min.mjs +0 -7
- package/dist/x/defaultsDeep.min.mjs +0 -7
- package/dist/x/differenceWith.min.mjs +0 -7
- package/dist/x/filterOut.min.mjs +0 -7
- package/dist/x/find.min.mjs +0 -7
- package/dist/x/findIndex.min.mjs +0 -7
- package/dist/x/first.min.mjs +0 -7
- package/dist/x/flatten.min.mjs +0 -7
- package/dist/x/forEach.es.min.js +0 -7
- package/dist/x/forEach.min.js +0 -8
- package/dist/x/forEach.min.mjs +0 -7
- package/dist/x/groupBy.min.mjs +0 -7
- package/dist/x/has.min.mjs +0 -7
- package/dist/x/identity.min.mjs +0 -7
- package/dist/x/includes.min.mjs +0 -7
- package/dist/x/isDeepEqual.min.mjs +0 -7
- package/dist/x/isEmpty.min.mjs +0 -7
- package/dist/x/isEqual.min.mjs +0 -7
- package/dist/x/isFunction.min.mjs +0 -7
- package/dist/x/isIn.min.mjs +0 -7
- package/dist/x/isObject.min.mjs +0 -7
- package/dist/x/isString.min.mjs +0 -7
- package/dist/x/keys.min.mjs +0 -7
- package/dist/x/last.min.mjs +0 -7
- package/dist/x/maxBy.min.mjs +0 -7
- package/dist/x/noop.min.mjs +0 -7
- package/dist/x/pluck.min.mjs +0 -7
- package/dist/x/prepend.min.mjs +0 -7
- package/dist/x/size.min.mjs +0 -7
- package/dist/x/trace.min.mjs +0 -7
- package/dist/x/unionWith.min.mjs +0 -7
- package/dist/x/uniq.min.mjs +0 -7
- package/dist/x/unless.min.mjs +0 -7
- package/dist/x/values.min.mjs +0 -7
- package/dist/x/when.min.mjs +0 -7
- package/distributor.js +0 -495
- package/fork.js +0 -101
- package/x/forEach.js +0 -93
- package/x/forEach.test.js +0 -218
- /package/{benchmarks → archive/benchmarks-v1.9.7}/any.js +0 -0
- /package/{x/forEach.benchmark.js → archive/benchmarks-v1.9.7/forEach.js} +0 -0
- /package/{benchmarks → archive/benchmarks-v1.9.7}/fork.js +0 -0
- /package/{benchmarks → archive/benchmarks-v1.9.7}/integration.js +0 -0
- /package/{benchmarks → archive/benchmarks-v1.9.7}/misc.js +0 -0
package/dist/flatMap.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isArray=Array.isArray,objectValues=Object.values,objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=e=>nativeObjectToString.call(e),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=e=>objectToString(e)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=e=>objectToString(e)==asyncGeneratorFunctionTag,__=Symbol.for("placeholder"),curry3ResolveArg0=(e,r,t)=>function(n){return e(n,r,t)},curry3ResolveArg1=(e,r,t)=>function(n){return e(r,n,t)},curry3ResolveArg2=(e,r,t)=>function(n){return e(r,t,n)},curry3=function(e,r,t,n){return r==__?curry3ResolveArg0(e,t,n):t==__?curry3ResolveArg1(e,r,n):curry3ResolveArg2(e,r,t)},isPromise=e=>null!=e&&"function"==typeof e.then,iteratorReduceAsync=async function(e,r,t){let n=e.next();if(n.done)return t;for(;!n.done;)t=r(t,n.value),isPromise(t)&&(t=await t),n=e.next();return t},iteratorReduce=function(e,r,t){let n=e.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=e.next());!n.done;){if(t=r(t,n.value),isPromise(t))return t.then(curry3(iteratorReduceAsync,e,r,__));n=e.next()}return t},asyncIteratorReduce=async function(e,r,t){let n=await e.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=await e.next());!n.done;)t=await r(t,n.value),n=await e.next();return t},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,curry2ResolveArg0=(e,r)=>function(t){return e(t,r)},curry2ResolveArg1=(e,r)=>function(t){return e(r,t)},curry2=function(e,r,t){return r==__?curry2ResolveArg0(e,t):curry2ResolveArg1(e,r)},curryArgs3ResolveArgs0=(e,r,t)=>function(...n){return e(n,r,t)},curryArgs3ResolveArgs1=(e,r,t)=>function(...n){return e(r,n,t)},curryArgs3ResolveArgs2=(e,r,t)=>function(...n){return e(r,t,n)},curryArgs3=function(e,r,t,n){return r==__?curryArgs3ResolveArgs0(e,t,n):t==__?curryArgs3ResolveArgs1(e,r,n):curryArgs3ResolveArgs2(e,r,t)},curry4ResolveArg0=(e,r,t,n)=>function(o){return e(o,r,t,n)},curry4ResolveArg1=(e,r,t,n)=>function(o){return e(r,o,t,n)},curry4ResolveArg2=(e,r,t,n)=>function(o){return e(r,t,o,n)},curry4ResolveArg3=(e,r,t,n)=>function(o){return e(r,t,n,o)},curry4=function(e,r,t,n,o){return r==__?curry4ResolveArg0(e,t,n,o):t==__?curry4ResolveArg1(e,r,n,o):n==__?curry4ResolveArg2(e,r,t,o):curry4ResolveArg3(e,r,t,n)},arrayReduceAsync=async function(e,r,t,n){const o=e.length;for(;++n<o;)t=r(t,e[n],n,e),isPromise(t)&&(t=await t);return t},arrayReduce=function(e,r,t){const n=e.length;let o=-1;for(void 0===t&&(t=e[++o]);++o<n;)if(t=r(t,e[o],o,e),isPromise(t))return t.then(curry4(arrayReduceAsync,e,r,__,o));return t},curry5ResolveArg0=(e,r,t,n,o)=>function(c){return e(c,r,t,n,o)},curry5ResolveArg1=(e,r,t,n,o)=>function(c){return e(r,c,t,n,o)},curry5ResolveArg2=(e,r,t,n,o)=>function(c){return e(r,t,c,n,o)},curry5ResolveArg3=(e,r,t,n,o)=>function(c){return e(r,t,n,c,o)},curry5ResolveArg4=(e,r,t,n,o)=>function(c){return e(r,t,n,o,c)},curry5=function(e,r,t,n,o,c){return r==__?curry5ResolveArg0(e,t,n,o,c):t==__?curry5ResolveArg1(e,r,n,o,c):n==__?curry5ResolveArg2(e,r,t,o,c):o==__?curry5ResolveArg3(e,r,t,n,c):curry5ResolveArg4(e,r,t,n,o)},objectKeys=Object.keys,objectGetFirstKey=function(e){for(const r in e)return r},objectReduceAsync=async function(e,r,t,n,o){const c=n.length;for(;++o<c;){const c=n[o];t=r(t,e[c],c,e),isPromise(t)&&(t=await t)}return t},objectReduce=function(e,r,t){const n=objectKeys(e),o=n.length;let c=-1;for(void 0===t&&(t=e[n[++c]]);++c<o;){const o=n[c];if(t=r(t,e[o],o,e),isPromise(t))return t.then((s=objectReduceAsync,a=r,u=__,l=n,f=c,(i=e)==__?curry5ResolveArg0(s,a,u,l,f):a==__?curry5ResolveArg1(s,i,u,l,f):u==__?curry5ResolveArg2(s,i,a,l,f):l==__?curry5ResolveArg3(s,i,a,u,f):curry5ResolveArg4(s,i,a,u,l)))}var s,i,a,u,l,f;return t},mapReduceAsync=async function(e,r,t,n){for(const[o,c]of n)t=r(t,c,o,e),isPromise(t)&&(t=await t);return t},mapReduce=function(e,r,t){const n=e.entries();if(void 0===t){const e=n.next();if(e.done)return t;t=e.value[1]}for(const[o,c]of n)if(t=r(t,c,o,e),isPromise(t))return t.then(curry4(mapReduceAsync,e,r,__,n));return t},funcConcatSync=(e,r)=>function(...t){return r(e(...t))},generatorFunctionReduce=(e,r,t)=>funcConcatSync(e,curry3(iteratorReduce,__,r,t)),asyncGeneratorFunctionReduce=(e,r,t)=>funcConcatSync(e,curry3(asyncIteratorReduce,__,r,t)),reducerConcat=(e,r)=>function(t,n){const o=e(t,n);return isPromise(o)?o.then(curry2(r,__,n)):r(o,n)},genericReduce=function(e,r,t){const n=e[0];return isArray(n)?arrayReduce(n,r,t):"function"==typeof n?isGeneratorFunction(n)?generatorFunctionReduce(n,r,t):isAsyncGeneratorFunction(n)?asyncGeneratorFunctionReduce(n,r,t):curryArgs3(genericReduce,__,1==e.length?reducerConcat(r,n):e.reduce(reducerConcat,r),t):null==n?void 0===t?curry2(r,n,__):r(t,n):n.constructor==Map?mapReduce(n,r,t):"function"==typeof n[symbolIterator]?iteratorReduce(n[symbolIterator](),r,t):"function"==typeof n[symbolAsyncIterator]?asyncIteratorReduce(n[symbolAsyncIterator](),r,t):"function"==typeof n.reduce?n.reduce(r,t):"function"==typeof n.chain?n.chain(curry2(r,t,__)):"function"==typeof n.flatMap?n.flatMap(curry2(r,t,__)):n.constructor==Object?objectReduce(n,r,t):void 0===t?curry2(r,n,__):r(t,n)},arrayPush=function(e,r){return e.push(r),e},FlatMappingIterator=function(e,r){let t=[],n=0;return{[symbolIterator](){return this},next(){if(n<t.length){const e=t[n];return n+=1,{value:e,done:!1}}const o=e.next();if(o.done)return o;const c=genericReduce([r(o.value)],arrayPush,[]);return c.length>1&&(t=c,n=1),{value:c[0],done:!1}}}},promiseRace=Promise.race.bind(Promise),sleep=e=>new Promise((r=>{setTimeout(r,e)})),FlatMappingAsyncIterator=function(e,r){const t=[],n=new Set;return{isAsyncIteratorDone:!1,[symbolAsyncIterator](){return this},toString:()=>"[object FlatMappingAsyncIterator]",async next(){for(;!this.isAsyncIteratorDone||t.length>0||n.size>0;){if(!this.isAsyncIteratorDone){const{value:o,done:c}=await e.next();if(c)this.isAsyncIteratorDone=c;else{const e=r(o);if(isPromise(e)){const r=e.then(curryArgs3(genericReduce,__,arrayPush,t)).then((()=>n.delete(r)));n.add(r)}else{const r=genericReduce([e],arrayPush,t);if(isPromise(r)){const e=r.then((()=>n.delete(e)));n.add(e)}}}}if(t.length>0)return{value:t.shift(),done:!1};n.size>0&&await promiseRace([sleep(1e3),...n])}return{value:void 0,done:!0}}}},isBinary=ArrayBuffer.isView,always=e=>function(){return e},getArg1=(e,r)=>r,identity=e=>e,promiseAll=Promise.all.bind(Promise),asyncIteratorForEach=async function(e,r){const t=[];for await(const n of e){const e=r(n);isPromise(e)&&t.push(e)}return 0==t.length?e:promiseAll(t).then(always(e))},arrayFlatten=function(e){const r=e.length,t=[],n=[];let o=-1;for(;++o<r;){const r=e[o];if(isArray(r)){const e=r.length;let t=-1;for(;++t<e;)n.push(r[t])}else if(null==r)n.push(r);else if("function"==typeof r.then)t.push(r.then(curry2(arrayPush,n,__)));else if("function"==typeof r[symbolIterator])for(const e of r)n.push(e);else if("function"==typeof r[symbolAsyncIterator])t.push(asyncIteratorForEach(r[symbolAsyncIterator](),curry2(arrayPush,n,__)));else if("function"==typeof r.chain){const e=r.chain(identity);isPromise(e)?t.push(e.then(curry2(arrayPush,n,__))):n.push(e)}else if("function"==typeof r.flatMap){const e=r.flatMap(identity);isPromise(e)?t.push(e.then(curry2(arrayPush,n,__))):n.push(e)}else if("function"==typeof r.reduce){const e=r.reduce(funcConcatSync(getArg1,curry2(arrayPush,n,__)),null);isPromise(e)&&t.push(e)}else if(r.constructor==Object)for(const e in r)n.push(r[e]);else n.push(r)}return 0==t.length?n:promiseAll(t).then(always(n))},arrayMap=function(e,r){const t=e.length,n=Array(t);let o=-1,c=!1;for(;++o<t;){const t=r(e[o],o,e);isPromise(t)&&(c=!0),n[o]=t}return c?promiseAll(n):n},arrayFlatMap=function(e,r){const t=arrayMap(e,r);return isPromise(t)?t.then(arrayFlatten):arrayFlatten(t)},promiseObjectAllExecutor=e=>function(r){const t={};let n=0;for(const o in e){const c=e[o];isPromise(c)?(n+=1,c.then((e=>function(o){t[e]=o,n-=1,0==n&&r(t)})(o))):t[o]=c}0==n&&r(t)},promiseObjectAll=e=>new Promise(promiseObjectAllExecutor(e)),objectMap=function(e,r){const t={};let n=!1;for(const o in e){const c=r(e[o],o,e);isPromise(c)&&(n=!0),t[o]=c}return n?promiseObjectAll(t):t},objectAssign=Object.assign,objectFlatten=function(e){const r=[],t={},n=curry2(objectAssign,t,__),o=funcConcatSync(getArg1,n);for(const c in e){const s=e[c];if(null!=s)if("function"==typeof s[symbolIterator])for(const e of s)objectAssign(t,e);else if("function"==typeof s[symbolAsyncIterator])r.push(asyncIteratorForEach(s[symbolAsyncIterator](),n));else if("function"==typeof s.chain){const e=s.chain(identity);isPromise(e)?r.push(e.then(n)):objectAssign(t,e)}else if("function"==typeof s.flatMap){const e=s.flatMap(identity);isPromise(e)?r.push(e.then(n)):n(e)}else if("function"==typeof s.reduce){const e=s.reduce(o,null);isPromise(e)&&r.push(e)}else objectAssign(t,s)}return 0==r.length?t:promiseAll(r).then((()=>t))},objectFlatMap=function(e,r){const t=objectMap(e,r);return isPromise(t)?t.then(objectFlatten):objectFlatten(t)},callPropUnary=(e,r,t)=>e[r](t),setMap=function(e,r){const t=new Set,n=[];for(const o of e){const c=r(o,o,e);isPromise(c)?n.push(c.then(curry3(callPropUnary,t,"add",__))):t.add(c)}return 0==n.length?t:promiseAll(n).then(always(t))},setFlatten=function(e){e.size;const r=[],t=new Set,n=(e,r)=>t.add(r),o=curry3(callPropUnary,t,"add",__);for(const c of e)if(isArray(c)){const e=c.length;let r=-1;for(;++r<e;)t.add(c[r])}else if(null==c)t.add(c);else if("function"==typeof c[symbolIterator])for(const e of c)t.add(e);else if("function"==typeof c[symbolAsyncIterator])r.push(asyncIteratorForEach(c[symbolAsyncIterator](),o));else if("function"==typeof c.chain){const e=c.chain(identity);isPromise(e)?r.push(e.then(o)):t.add(e)}else if("function"==typeof c.flatMap){const e=c.flatMap(identity);isPromise(e)?r.push(e.then(o)):t.add(e)}else if("function"==typeof c.reduce){const e=c.reduce(n,null);isPromise(e)&&r.push(e)}else if(c.constructor==Object)for(const e in c)t.add(c[e]);else t.add(c);return 0==r.length?t:promiseAll(r).then((()=>t))},setFlatMap=function(e,r){const t=setMap(e,r);return isPromise(t)?t.then(setFlatten):setFlatten(t)},funcConcat=(e,r)=>function(...t){const n=e(...t);return isPromise(n)?n.then(r):r(n)},arrayJoin=(e,r)=>e.join(r),arrayFlattenToString=funcConcat(arrayFlatten,curry2(arrayJoin,__,"")),stringFlatMap=function(e,r){const t=arrayMap(e,r);return isPromise(t)?t.then(arrayFlattenToString):arrayFlattenToString(t)},streamWrite=function(e,r,t,n){return e.write(r,t,n),e},streamFlatExtend=async function(e,r){const t=curry2(streamWrite,e,__),n=funcConcatSync(getArg1,t),o=[];if(isArray(r)){const t=r.length;let n=-1;for(;++n<t;)e.write(r[n])}else if(null==r)e.write(r);else if("function"==typeof r[symbolIterator])for(const t of r)e.write(t);else if("function"==typeof r[symbolAsyncIterator])o.push(asyncIteratorForEach(r[symbolAsyncIterator](),t));else if("function"==typeof r.chain){const n=r.chain(identity);isPromise(n)?o.push(n.then(t)):e.write(n)}else if("function"==typeof r.flatMap){const n=r.flatMap(identity);isPromise(n)?o.push(n.then(t)):e.write(n)}else if("function"==typeof r.reduce){const e=r.reduce(n,null);isPromise(e)&&o.push(e)}else if(r.constructor==Object)for(const t in r)e.write(r[t]);else e.write(r);return 0==o.length?e:promiseAll(o).then(always(e))},streamFlatMap=async function(e,r){const t=new Set;for await(const n of e){const o=r(n);if(isPromise(o)){const r=o.then(curry2(streamFlatExtend,e,__)).then((()=>t.delete(r)));t.add(r)}else{const r=streamFlatExtend(e,o);if(isPromise(r)){const e=r.then((()=>t.delete(e)));t.add(e)}}}return await promiseAll(t),e},globalThisHasBuffer="function"==typeof Buffer,noop=function(){},bufferAlloc=globalThisHasBuffer?Buffer.alloc:noop,_binaryExtend=function(e,r){const t=e.length,n=globalThisHasBuffer&&e.constructor==Buffer?bufferAlloc(t+r.length):new e.constructor(t+r.length);return n.set(e),n.set(r,t),n},binaryExtend=function(e,r){return isArray(r)||isBinary(r)?_binaryExtend(e,r):_binaryExtend(e,[r])},arrayJoinToBinary=function(e,r){const t=e.length;let n=-1,o=r;for(;++n<t;)o=binaryExtend(o,e[n]);return o},arrayFlattenToBinary=function(e,r){const t=arrayFlatten(e);return isPromise(t)?t.then(curry2(arrayJoinToBinary,__,r)):arrayJoinToBinary(t,r)},binaryFlatMap=function(e,r){const t=arrayMap(e,r),n=globalThisHasBuffer&&e.constructor==Buffer?bufferAlloc(0):new e.constructor(0);return isPromise(t)?t.then(curry2(arrayFlattenToBinary,__,n)):arrayFlattenToBinary(t,n)},reducerFlatMap=(e,r)=>function(t,n){const o=r(n);return isPromise(o)?o.then(curryArgs3(genericReduce,__,e,t)):genericReduce([o],e,t)},generatorFunctionFlatMap=(e,r)=>function*(...t){yield*FlatMappingIterator(e(...t),r)},asyncGeneratorFunctionFlatMap=(e,r)=>async function*(...t){yield*FlatMappingAsyncIterator(e(...t),r)},flatMap=e=>function(r){if(isArray(r))return arrayFlatMap(r,e);if("function"==typeof r)return isGeneratorFunction(r)?generatorFunctionFlatMap(r,e):isAsyncGeneratorFunction(r)?asyncGeneratorFunctionFlatMap(r,e):reducerFlatMap(r,e);if(isBinary(r))return binaryFlatMap(r,e);if(null==r)return e(r);if("function"==typeof r.then)return r.then(e);if("function"==typeof r.next)return symbolIterator in r?FlatMappingIterator(r,e):FlatMappingAsyncIterator(r,e);if("function"==typeof r.chain)return r.chain(e);if("function"==typeof r.flatMap)return r.flatMap(e);if("function"==typeof r[symbolAsyncIterator]&&"function"==typeof r.write)return streamFlatMap(r,e);const t=r.constructor;return t==Object?objectFlatMap(r,e):t==Set?setFlatMap(r,e):"string"==typeof r||t==String?stringFlatMap(r,e):e(r)};export default flatMap;
|
package/dist/fork.es.js
DELETED
|
@@ -1,159 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
|
|
8
|
-
const isArray = Array.isArray
|
|
9
|
-
|
|
10
|
-
const isPromise = value => value != null && typeof value.then == 'function'
|
|
11
|
-
|
|
12
|
-
const promiseAll = Promise.all.bind(Promise)
|
|
13
|
-
|
|
14
|
-
const funcAll = funcs => function allFuncs(...args) {
|
|
15
|
-
const funcsLength = funcs.length,
|
|
16
|
-
result = Array(funcsLength)
|
|
17
|
-
let funcsIndex = -1, isAsync = false
|
|
18
|
-
while (++funcsIndex < funcsLength) {
|
|
19
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
20
|
-
if (isPromise(resultItem)) {
|
|
21
|
-
isAsync = true
|
|
22
|
-
}
|
|
23
|
-
result[funcsIndex] = resultItem
|
|
24
|
-
}
|
|
25
|
-
return isAsync ? promiseAll(result) : result
|
|
26
|
-
}
|
|
27
|
-
|
|
28
|
-
const always = value => function getter() { return value }
|
|
29
|
-
|
|
30
|
-
const __ = Symbol.for('placeholder')
|
|
31
|
-
|
|
32
|
-
// argument resolver for curry3
|
|
33
|
-
const curry3ResolveArg0 = (
|
|
34
|
-
baseFunc, arg1, arg2,
|
|
35
|
-
) => function arg0Resolver(arg0) {
|
|
36
|
-
return baseFunc(arg0, arg1, arg2)
|
|
37
|
-
}
|
|
38
|
-
|
|
39
|
-
// argument resolver for curry3
|
|
40
|
-
const curry3ResolveArg1 = (
|
|
41
|
-
baseFunc, arg0, arg2,
|
|
42
|
-
) => function arg1Resolver(arg1) {
|
|
43
|
-
return baseFunc(arg0, arg1, arg2)
|
|
44
|
-
}
|
|
45
|
-
|
|
46
|
-
// argument resolver for curry3
|
|
47
|
-
const curry3ResolveArg2 = (
|
|
48
|
-
baseFunc, arg0, arg1,
|
|
49
|
-
) => function arg2Resolver(arg2) {
|
|
50
|
-
return baseFunc(arg0, arg1, arg2)
|
|
51
|
-
}
|
|
52
|
-
|
|
53
|
-
const curry3 = function (baseFunc, arg0, arg1, arg2) {
|
|
54
|
-
if (arg0 == __) {
|
|
55
|
-
return curry3ResolveArg0(baseFunc, arg1, arg2)
|
|
56
|
-
}
|
|
57
|
-
if (arg1 == __) {
|
|
58
|
-
return curry3ResolveArg1(baseFunc, arg0, arg2)
|
|
59
|
-
}
|
|
60
|
-
return curry3ResolveArg2(baseFunc, arg0, arg1)
|
|
61
|
-
}
|
|
62
|
-
|
|
63
|
-
const objectSet = function (object, property, value) {
|
|
64
|
-
object[property] = value
|
|
65
|
-
return object
|
|
66
|
-
}
|
|
67
|
-
|
|
68
|
-
const funcObjectAll = funcs => function objectAllFuncs(...args) {
|
|
69
|
-
const result = {}, promises = []
|
|
70
|
-
for (const key in funcs) {
|
|
71
|
-
const resultItem = funcs[key](...args)
|
|
72
|
-
if (isPromise(resultItem)) {
|
|
73
|
-
promises.push(resultItem.then(curry3(objectSet, result, key, __)))
|
|
74
|
-
} else {
|
|
75
|
-
result[key] = resultItem
|
|
76
|
-
}
|
|
77
|
-
}
|
|
78
|
-
return promises.length == 0 ? result : promiseAll(promises).then(always(result))
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
const funcConcat = (
|
|
82
|
-
funcA, funcB,
|
|
83
|
-
) => function pipedFunction(...args) {
|
|
84
|
-
const intermediate = funcA(...args)
|
|
85
|
-
return isPromise(intermediate)
|
|
86
|
-
? intermediate.then(funcB)
|
|
87
|
-
: funcB(intermediate)
|
|
88
|
-
}
|
|
89
|
-
|
|
90
|
-
// argument resolver for curry4
|
|
91
|
-
const curry4ResolveArg0 = (
|
|
92
|
-
baseFunc, arg1, arg2, arg3,
|
|
93
|
-
) => function arg0Resolver(arg0) {
|
|
94
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
95
|
-
}
|
|
96
|
-
|
|
97
|
-
// argument resolver for curry4
|
|
98
|
-
const curry4ResolveArg1 = (
|
|
99
|
-
baseFunc, arg0, arg2, arg3,
|
|
100
|
-
) => function arg1Resolver(arg1) {
|
|
101
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
102
|
-
}
|
|
103
|
-
|
|
104
|
-
// argument resolver for curry4
|
|
105
|
-
const curry4ResolveArg2 = (
|
|
106
|
-
baseFunc, arg0, arg1, arg3,
|
|
107
|
-
) => function arg2Resolver(arg2) {
|
|
108
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
109
|
-
}
|
|
110
|
-
|
|
111
|
-
// argument resolver for curry4
|
|
112
|
-
const curry4ResolveArg3 = (
|
|
113
|
-
baseFunc, arg0, arg1, arg2,
|
|
114
|
-
) => function arg3Resolver(arg3) {
|
|
115
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
116
|
-
}
|
|
117
|
-
|
|
118
|
-
const curry4 = function (baseFunc, arg0, arg1, arg2, arg3) {
|
|
119
|
-
if (arg0 == __) {
|
|
120
|
-
return curry4ResolveArg0(baseFunc, arg1, arg2, arg3)
|
|
121
|
-
}
|
|
122
|
-
if (arg1 == __) {
|
|
123
|
-
return curry4ResolveArg1(baseFunc, arg0, arg2, arg3)
|
|
124
|
-
}
|
|
125
|
-
if (arg2 == __) {
|
|
126
|
-
return curry4ResolveArg2(baseFunc, arg0, arg1, arg3)
|
|
127
|
-
}
|
|
128
|
-
return curry4ResolveArg3(baseFunc, arg0, arg1, arg2)
|
|
129
|
-
}
|
|
130
|
-
|
|
131
|
-
const asyncFuncAllSeries = async function (funcs, args, result, funcsIndex) {
|
|
132
|
-
const funcsLength = funcs.length
|
|
133
|
-
while (++funcsIndex < funcsLength) {
|
|
134
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
135
|
-
result[funcsIndex] = isPromise(resultItem) ? await resultItem : resultItem
|
|
136
|
-
}
|
|
137
|
-
return result
|
|
138
|
-
}
|
|
139
|
-
|
|
140
|
-
const funcAllSeries = funcs => function allFuncsSeries(...args) {
|
|
141
|
-
const funcsLength = funcs.length, result = []
|
|
142
|
-
let funcsIndex = -1
|
|
143
|
-
while (++funcsIndex < funcsLength) {
|
|
144
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
145
|
-
if (isPromise(resultItem)) {
|
|
146
|
-
return resultItem.then(funcConcat(
|
|
147
|
-
curry3(objectSet, result, funcsIndex, __),
|
|
148
|
-
curry4(asyncFuncAllSeries, funcs, args, __, funcsIndex)))
|
|
149
|
-
}
|
|
150
|
-
result[funcsIndex] = resultItem
|
|
151
|
-
}
|
|
152
|
-
return result
|
|
153
|
-
}
|
|
154
|
-
|
|
155
|
-
const fork = funcs => isArray(funcs) ? funcAll(funcs) : funcObjectAll(funcs)
|
|
156
|
-
|
|
157
|
-
fork.series = funcs => isArray(funcs) ? funcAllSeries(funcs) : funcObjectAll(funcs)
|
|
158
|
-
|
|
159
|
-
export default fork
|
package/dist/fork.es.min.js
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),funcAll=r=>function(...e){const n=r.length,o=Array(n);let c=-1,t=!1;for(;++c<n;){const n=r[c](...e);isPromise(n)&&(t=!0),o[c]=n}return t?promiseAll(o):o},always=r=>function(){return r},__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,n)=>function(o){return r(o,e,n)},curry3ResolveArg1=(r,e,n)=>function(o){return r(e,o,n)},curry3ResolveArg2=(r,e,n)=>function(o){return r(e,n,o)},curry3=function(r,e,n,o){return e==__?curry3ResolveArg0(r,n,o):n==__?curry3ResolveArg1(r,e,o):curry3ResolveArg2(r,e,n)},objectSet=function(r,e,n){return r[e]=n,r},funcObjectAll=r=>function(...e){const n={},o=[];for(const c in r){const t=r[c](...e);isPromise(t)?o.push(t.then(curry3(objectSet,n,c,__))):n[c]=t}return 0==o.length?n:promiseAll(o).then((c=n,function(){return c}));var c},funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},curry4ResolveArg0=(r,e,n,o)=>function(c){return r(c,e,n,o)},curry4ResolveArg1=(r,e,n,o)=>function(c){return r(e,c,n,o)},curry4ResolveArg2=(r,e,n,o)=>function(c){return r(e,n,c,o)},curry4ResolveArg3=(r,e,n,o)=>function(c){return r(e,n,o,c)},curry4=function(r,e,n,o,c){return e==__?curry4ResolveArg0(r,n,o,c):n==__?curry4ResolveArg1(r,e,o,c):o==__?curry4ResolveArg2(r,e,n,c):curry4ResolveArg3(r,e,n,o)},asyncFuncAllSeries=async function(r,e,n,o){const c=r.length;for(;++o<c;){const c=r[o](...e);n[o]=isPromise(c)?await c:c}return n},funcAllSeries=r=>function(...e){const n=r.length,o=[];let c=-1;for(;++c<n;){const n=r[c](...e);if(isPromise(n))return n.then(funcConcat(curry3(objectSet,o,c,__),(t=asyncFuncAllSeries,s=e,l=__,i=c,(u=r)==__?curry4ResolveArg0(t,s,l,i):s==__?curry4ResolveArg1(t,u,l,i):l==__?curry4ResolveArg2(t,u,s,i):curry4ResolveArg3(t,u,s,l))));o[c]=n}var t,u,s,l,i;return o},fork=r=>isArray(r)?funcAll(r):funcObjectAll(r);fork.series=r=>isArray(r)?funcAllSeries(r):funcObjectAll(r);export default fork;
|
package/dist/fork.js
DELETED
|
@@ -1,166 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
|
|
8
|
-
(function (root, fork) {
|
|
9
|
-
if (typeof module == 'object') (module.exports = fork) // CommonJS
|
|
10
|
-
else if (typeof define == 'function') define(() => fork) // AMD
|
|
11
|
-
else (root.fork = fork) // Browser
|
|
12
|
-
}(typeof globalThis == 'object' ? globalThis : this, (function () { 'use strict'
|
|
13
|
-
|
|
14
|
-
const isArray = Array.isArray
|
|
15
|
-
|
|
16
|
-
const isPromise = value => value != null && typeof value.then == 'function'
|
|
17
|
-
|
|
18
|
-
const promiseAll = Promise.all.bind(Promise)
|
|
19
|
-
|
|
20
|
-
const funcAll = funcs => function allFuncs(...args) {
|
|
21
|
-
const funcsLength = funcs.length,
|
|
22
|
-
result = Array(funcsLength)
|
|
23
|
-
let funcsIndex = -1, isAsync = false
|
|
24
|
-
while (++funcsIndex < funcsLength) {
|
|
25
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
26
|
-
if (isPromise(resultItem)) {
|
|
27
|
-
isAsync = true
|
|
28
|
-
}
|
|
29
|
-
result[funcsIndex] = resultItem
|
|
30
|
-
}
|
|
31
|
-
return isAsync ? promiseAll(result) : result
|
|
32
|
-
}
|
|
33
|
-
|
|
34
|
-
const always = value => function getter() { return value }
|
|
35
|
-
|
|
36
|
-
const __ = Symbol.for('placeholder')
|
|
37
|
-
|
|
38
|
-
// argument resolver for curry3
|
|
39
|
-
const curry3ResolveArg0 = (
|
|
40
|
-
baseFunc, arg1, arg2,
|
|
41
|
-
) => function arg0Resolver(arg0) {
|
|
42
|
-
return baseFunc(arg0, arg1, arg2)
|
|
43
|
-
}
|
|
44
|
-
|
|
45
|
-
// argument resolver for curry3
|
|
46
|
-
const curry3ResolveArg1 = (
|
|
47
|
-
baseFunc, arg0, arg2,
|
|
48
|
-
) => function arg1Resolver(arg1) {
|
|
49
|
-
return baseFunc(arg0, arg1, arg2)
|
|
50
|
-
}
|
|
51
|
-
|
|
52
|
-
// argument resolver for curry3
|
|
53
|
-
const curry3ResolveArg2 = (
|
|
54
|
-
baseFunc, arg0, arg1,
|
|
55
|
-
) => function arg2Resolver(arg2) {
|
|
56
|
-
return baseFunc(arg0, arg1, arg2)
|
|
57
|
-
}
|
|
58
|
-
|
|
59
|
-
const curry3 = function (baseFunc, arg0, arg1, arg2) {
|
|
60
|
-
if (arg0 == __) {
|
|
61
|
-
return curry3ResolveArg0(baseFunc, arg1, arg2)
|
|
62
|
-
}
|
|
63
|
-
if (arg1 == __) {
|
|
64
|
-
return curry3ResolveArg1(baseFunc, arg0, arg2)
|
|
65
|
-
}
|
|
66
|
-
return curry3ResolveArg2(baseFunc, arg0, arg1)
|
|
67
|
-
}
|
|
68
|
-
|
|
69
|
-
const objectSet = function (object, property, value) {
|
|
70
|
-
object[property] = value
|
|
71
|
-
return object
|
|
72
|
-
}
|
|
73
|
-
|
|
74
|
-
const funcObjectAll = funcs => function objectAllFuncs(...args) {
|
|
75
|
-
const result = {}, promises = []
|
|
76
|
-
for (const key in funcs) {
|
|
77
|
-
const resultItem = funcs[key](...args)
|
|
78
|
-
if (isPromise(resultItem)) {
|
|
79
|
-
promises.push(resultItem.then(curry3(objectSet, result, key, __)))
|
|
80
|
-
} else {
|
|
81
|
-
result[key] = resultItem
|
|
82
|
-
}
|
|
83
|
-
}
|
|
84
|
-
return promises.length == 0 ? result : promiseAll(promises).then(always(result))
|
|
85
|
-
}
|
|
86
|
-
|
|
87
|
-
const funcConcat = (
|
|
88
|
-
funcA, funcB,
|
|
89
|
-
) => function pipedFunction(...args) {
|
|
90
|
-
const intermediate = funcA(...args)
|
|
91
|
-
return isPromise(intermediate)
|
|
92
|
-
? intermediate.then(funcB)
|
|
93
|
-
: funcB(intermediate)
|
|
94
|
-
}
|
|
95
|
-
|
|
96
|
-
// argument resolver for curry4
|
|
97
|
-
const curry4ResolveArg0 = (
|
|
98
|
-
baseFunc, arg1, arg2, arg3,
|
|
99
|
-
) => function arg0Resolver(arg0) {
|
|
100
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
101
|
-
}
|
|
102
|
-
|
|
103
|
-
// argument resolver for curry4
|
|
104
|
-
const curry4ResolveArg1 = (
|
|
105
|
-
baseFunc, arg0, arg2, arg3,
|
|
106
|
-
) => function arg1Resolver(arg1) {
|
|
107
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
108
|
-
}
|
|
109
|
-
|
|
110
|
-
// argument resolver for curry4
|
|
111
|
-
const curry4ResolveArg2 = (
|
|
112
|
-
baseFunc, arg0, arg1, arg3,
|
|
113
|
-
) => function arg2Resolver(arg2) {
|
|
114
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
115
|
-
}
|
|
116
|
-
|
|
117
|
-
// argument resolver for curry4
|
|
118
|
-
const curry4ResolveArg3 = (
|
|
119
|
-
baseFunc, arg0, arg1, arg2,
|
|
120
|
-
) => function arg3Resolver(arg3) {
|
|
121
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
122
|
-
}
|
|
123
|
-
|
|
124
|
-
const curry4 = function (baseFunc, arg0, arg1, arg2, arg3) {
|
|
125
|
-
if (arg0 == __) {
|
|
126
|
-
return curry4ResolveArg0(baseFunc, arg1, arg2, arg3)
|
|
127
|
-
}
|
|
128
|
-
if (arg1 == __) {
|
|
129
|
-
return curry4ResolveArg1(baseFunc, arg0, arg2, arg3)
|
|
130
|
-
}
|
|
131
|
-
if (arg2 == __) {
|
|
132
|
-
return curry4ResolveArg2(baseFunc, arg0, arg1, arg3)
|
|
133
|
-
}
|
|
134
|
-
return curry4ResolveArg3(baseFunc, arg0, arg1, arg2)
|
|
135
|
-
}
|
|
136
|
-
|
|
137
|
-
const asyncFuncAllSeries = async function (funcs, args, result, funcsIndex) {
|
|
138
|
-
const funcsLength = funcs.length
|
|
139
|
-
while (++funcsIndex < funcsLength) {
|
|
140
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
141
|
-
result[funcsIndex] = isPromise(resultItem) ? await resultItem : resultItem
|
|
142
|
-
}
|
|
143
|
-
return result
|
|
144
|
-
}
|
|
145
|
-
|
|
146
|
-
const funcAllSeries = funcs => function allFuncsSeries(...args) {
|
|
147
|
-
const funcsLength = funcs.length, result = []
|
|
148
|
-
let funcsIndex = -1
|
|
149
|
-
while (++funcsIndex < funcsLength) {
|
|
150
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
151
|
-
if (isPromise(resultItem)) {
|
|
152
|
-
return resultItem.then(funcConcat(
|
|
153
|
-
curry3(objectSet, result, funcsIndex, __),
|
|
154
|
-
curry4(asyncFuncAllSeries, funcs, args, __, funcsIndex)))
|
|
155
|
-
}
|
|
156
|
-
result[funcsIndex] = resultItem
|
|
157
|
-
}
|
|
158
|
-
return result
|
|
159
|
-
}
|
|
160
|
-
|
|
161
|
-
const fork = funcs => isArray(funcs) ? funcAll(funcs) : funcObjectAll(funcs)
|
|
162
|
-
|
|
163
|
-
fork.series = funcs => isArray(funcs) ? funcAllSeries(funcs) : funcObjectAll(funcs)
|
|
164
|
-
|
|
165
|
-
return fork
|
|
166
|
-
}())))
|
package/dist/fork.min.js
DELETED
|
@@ -1,8 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.fork=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=n=>null!=n&&"function"==typeof n.then,r=Promise.all.bind(Promise),o=Symbol.for("placeholder"),e=function(n,t,r,e){return t==o?((n,t,r)=>function(o){return n(o,t,r)})(n,r,e):r==o?((n,t,r)=>function(o){return n(t,o,r)})(n,t,e):((n,t,r)=>function(o){return n(t,r,o)})(n,t,r)},u=function(n,t,r){return n[t]=r,n},c=n=>function(...c){const i={},f=[];for(const r in n){const s=n[r](...c);t(s)?f.push(s.then(e(u,i,r,o))):i[r]=s}return 0==f.length?i:r(f).then((s=i,function(){return s}));var s},i=(n,r)=>function(...o){const e=n(...o);return t(e)?e.then(r):r(e)},f=async function(n,r,o,e){const u=n.length;for(;++e<u;){const u=n[e](...r);o[e]=t(u)?await u:u}return o},s=o=>n(o)?(n=>function(...o){const e=n.length,u=Array(e);let c=-1,i=!1;for(;++c<e;){const r=n[c](...o);t(r)&&(i=!0),u[c]=r}return i?r(u):u})(o):c(o);return s.series=r=>n(r)?(n=>function(...r){const c=n.length,s=[];let l=-1;for(;++l<c;){const c=n[l](...r);if(t(c))return c.then(i(e(u,s,l,o),(h=f,y=r,p=o,b=l,(a=n)==o?((n,t,r,o)=>function(e){return n(e,t,r,o)})(h,y,p,b):y==o?((n,t,r,o)=>function(e){return n(t,e,r,o)})(h,a,p,b):p==o?((n,t,r,o)=>function(e){return n(t,r,e,o)})(h,a,y,b):((n,t,r,o)=>function(e){return n(t,r,o,e)})(h,a,y,p))));s[l]=c}var h,a,y,p,b;return s})(r):c(r),s}());
|
package/dist/fork.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),funcAll=r=>function(...e){const n=r.length,o=Array(n);let c=-1,t=!1;for(;++c<n;){const n=r[c](...e);isPromise(n)&&(t=!0),o[c]=n}return t?promiseAll(o):o},always=r=>function(){return r},__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,n)=>function(o){return r(o,e,n)},curry3ResolveArg1=(r,e,n)=>function(o){return r(e,o,n)},curry3ResolveArg2=(r,e,n)=>function(o){return r(e,n,o)},curry3=function(r,e,n,o){return e==__?curry3ResolveArg0(r,n,o):n==__?curry3ResolveArg1(r,e,o):curry3ResolveArg2(r,e,n)},objectSet=function(r,e,n){return r[e]=n,r},funcObjectAll=r=>function(...e){const n={},o=[];for(const c in r){const t=r[c](...e);isPromise(t)?o.push(t.then(curry3(objectSet,n,c,__))):n[c]=t}return 0==o.length?n:promiseAll(o).then((c=n,function(){return c}));var c},funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},curry4ResolveArg0=(r,e,n,o)=>function(c){return r(c,e,n,o)},curry4ResolveArg1=(r,e,n,o)=>function(c){return r(e,c,n,o)},curry4ResolveArg2=(r,e,n,o)=>function(c){return r(e,n,c,o)},curry4ResolveArg3=(r,e,n,o)=>function(c){return r(e,n,o,c)},curry4=function(r,e,n,o,c){return e==__?curry4ResolveArg0(r,n,o,c):n==__?curry4ResolveArg1(r,e,o,c):o==__?curry4ResolveArg2(r,e,n,c):curry4ResolveArg3(r,e,n,o)},asyncFuncAllSeries=async function(r,e,n,o){const c=r.length;for(;++o<c;){const c=r[o](...e);n[o]=isPromise(c)?await c:c}return n},funcAllSeries=r=>function(...e){const n=r.length,o=[];let c=-1;for(;++c<n;){const n=r[c](...e);if(isPromise(n))return n.then(funcConcat(curry3(objectSet,o,c,__),(t=asyncFuncAllSeries,s=e,l=__,i=c,(u=r)==__?curry4ResolveArg0(t,s,l,i):s==__?curry4ResolveArg1(t,u,l,i):l==__?curry4ResolveArg2(t,u,s,i):curry4ResolveArg3(t,u,s,l))));o[c]=n}var t,u,s,l,i;return o},fork=r=>isArray(r)?funcAll(r):funcObjectAll(r);fork.series=r=>isArray(r)?funcAllSeries(r):funcObjectAll(r);export default fork;
|
package/dist/fork.mjs
DELETED
|
@@ -1,159 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
|
|
8
|
-
const isArray = Array.isArray
|
|
9
|
-
|
|
10
|
-
const isPromise = value => value != null && typeof value.then == 'function'
|
|
11
|
-
|
|
12
|
-
const promiseAll = Promise.all.bind(Promise)
|
|
13
|
-
|
|
14
|
-
const funcAll = funcs => function allFuncs(...args) {
|
|
15
|
-
const funcsLength = funcs.length,
|
|
16
|
-
result = Array(funcsLength)
|
|
17
|
-
let funcsIndex = -1, isAsync = false
|
|
18
|
-
while (++funcsIndex < funcsLength) {
|
|
19
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
20
|
-
if (isPromise(resultItem)) {
|
|
21
|
-
isAsync = true
|
|
22
|
-
}
|
|
23
|
-
result[funcsIndex] = resultItem
|
|
24
|
-
}
|
|
25
|
-
return isAsync ? promiseAll(result) : result
|
|
26
|
-
}
|
|
27
|
-
|
|
28
|
-
const always = value => function getter() { return value }
|
|
29
|
-
|
|
30
|
-
const __ = Symbol.for('placeholder')
|
|
31
|
-
|
|
32
|
-
// argument resolver for curry3
|
|
33
|
-
const curry3ResolveArg0 = (
|
|
34
|
-
baseFunc, arg1, arg2,
|
|
35
|
-
) => function arg0Resolver(arg0) {
|
|
36
|
-
return baseFunc(arg0, arg1, arg2)
|
|
37
|
-
}
|
|
38
|
-
|
|
39
|
-
// argument resolver for curry3
|
|
40
|
-
const curry3ResolveArg1 = (
|
|
41
|
-
baseFunc, arg0, arg2,
|
|
42
|
-
) => function arg1Resolver(arg1) {
|
|
43
|
-
return baseFunc(arg0, arg1, arg2)
|
|
44
|
-
}
|
|
45
|
-
|
|
46
|
-
// argument resolver for curry3
|
|
47
|
-
const curry3ResolveArg2 = (
|
|
48
|
-
baseFunc, arg0, arg1,
|
|
49
|
-
) => function arg2Resolver(arg2) {
|
|
50
|
-
return baseFunc(arg0, arg1, arg2)
|
|
51
|
-
}
|
|
52
|
-
|
|
53
|
-
const curry3 = function (baseFunc, arg0, arg1, arg2) {
|
|
54
|
-
if (arg0 == __) {
|
|
55
|
-
return curry3ResolveArg0(baseFunc, arg1, arg2)
|
|
56
|
-
}
|
|
57
|
-
if (arg1 == __) {
|
|
58
|
-
return curry3ResolveArg1(baseFunc, arg0, arg2)
|
|
59
|
-
}
|
|
60
|
-
return curry3ResolveArg2(baseFunc, arg0, arg1)
|
|
61
|
-
}
|
|
62
|
-
|
|
63
|
-
const objectSet = function (object, property, value) {
|
|
64
|
-
object[property] = value
|
|
65
|
-
return object
|
|
66
|
-
}
|
|
67
|
-
|
|
68
|
-
const funcObjectAll = funcs => function objectAllFuncs(...args) {
|
|
69
|
-
const result = {}, promises = []
|
|
70
|
-
for (const key in funcs) {
|
|
71
|
-
const resultItem = funcs[key](...args)
|
|
72
|
-
if (isPromise(resultItem)) {
|
|
73
|
-
promises.push(resultItem.then(curry3(objectSet, result, key, __)))
|
|
74
|
-
} else {
|
|
75
|
-
result[key] = resultItem
|
|
76
|
-
}
|
|
77
|
-
}
|
|
78
|
-
return promises.length == 0 ? result : promiseAll(promises).then(always(result))
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
const funcConcat = (
|
|
82
|
-
funcA, funcB,
|
|
83
|
-
) => function pipedFunction(...args) {
|
|
84
|
-
const intermediate = funcA(...args)
|
|
85
|
-
return isPromise(intermediate)
|
|
86
|
-
? intermediate.then(funcB)
|
|
87
|
-
: funcB(intermediate)
|
|
88
|
-
}
|
|
89
|
-
|
|
90
|
-
// argument resolver for curry4
|
|
91
|
-
const curry4ResolveArg0 = (
|
|
92
|
-
baseFunc, arg1, arg2, arg3,
|
|
93
|
-
) => function arg0Resolver(arg0) {
|
|
94
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
95
|
-
}
|
|
96
|
-
|
|
97
|
-
// argument resolver for curry4
|
|
98
|
-
const curry4ResolveArg1 = (
|
|
99
|
-
baseFunc, arg0, arg2, arg3,
|
|
100
|
-
) => function arg1Resolver(arg1) {
|
|
101
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
102
|
-
}
|
|
103
|
-
|
|
104
|
-
// argument resolver for curry4
|
|
105
|
-
const curry4ResolveArg2 = (
|
|
106
|
-
baseFunc, arg0, arg1, arg3,
|
|
107
|
-
) => function arg2Resolver(arg2) {
|
|
108
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
109
|
-
}
|
|
110
|
-
|
|
111
|
-
// argument resolver for curry4
|
|
112
|
-
const curry4ResolveArg3 = (
|
|
113
|
-
baseFunc, arg0, arg1, arg2,
|
|
114
|
-
) => function arg3Resolver(arg3) {
|
|
115
|
-
return baseFunc(arg0, arg1, arg2, arg3)
|
|
116
|
-
}
|
|
117
|
-
|
|
118
|
-
const curry4 = function (baseFunc, arg0, arg1, arg2, arg3) {
|
|
119
|
-
if (arg0 == __) {
|
|
120
|
-
return curry4ResolveArg0(baseFunc, arg1, arg2, arg3)
|
|
121
|
-
}
|
|
122
|
-
if (arg1 == __) {
|
|
123
|
-
return curry4ResolveArg1(baseFunc, arg0, arg2, arg3)
|
|
124
|
-
}
|
|
125
|
-
if (arg2 == __) {
|
|
126
|
-
return curry4ResolveArg2(baseFunc, arg0, arg1, arg3)
|
|
127
|
-
}
|
|
128
|
-
return curry4ResolveArg3(baseFunc, arg0, arg1, arg2)
|
|
129
|
-
}
|
|
130
|
-
|
|
131
|
-
const asyncFuncAllSeries = async function (funcs, args, result, funcsIndex) {
|
|
132
|
-
const funcsLength = funcs.length
|
|
133
|
-
while (++funcsIndex < funcsLength) {
|
|
134
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
135
|
-
result[funcsIndex] = isPromise(resultItem) ? await resultItem : resultItem
|
|
136
|
-
}
|
|
137
|
-
return result
|
|
138
|
-
}
|
|
139
|
-
|
|
140
|
-
const funcAllSeries = funcs => function allFuncsSeries(...args) {
|
|
141
|
-
const funcsLength = funcs.length, result = []
|
|
142
|
-
let funcsIndex = -1
|
|
143
|
-
while (++funcsIndex < funcsLength) {
|
|
144
|
-
const resultItem = funcs[funcsIndex](...args)
|
|
145
|
-
if (isPromise(resultItem)) {
|
|
146
|
-
return resultItem.then(funcConcat(
|
|
147
|
-
curry3(objectSet, result, funcsIndex, __),
|
|
148
|
-
curry4(asyncFuncAllSeries, funcs, args, __, funcsIndex)))
|
|
149
|
-
}
|
|
150
|
-
result[funcsIndex] = resultItem
|
|
151
|
-
}
|
|
152
|
-
return result
|
|
153
|
-
}
|
|
154
|
-
|
|
155
|
-
const fork = funcs => isArray(funcs) ? funcAll(funcs) : funcObjectAll(funcs)
|
|
156
|
-
|
|
157
|
-
fork.series = funcs => isArray(funcs) ? funcAllSeries(funcs) : funcObjectAll(funcs)
|
|
158
|
-
|
|
159
|
-
export default fork
|
package/dist/get.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isArray=Array.isArray,memoizeCappedUnary=function(t,e){const r=new Map,i=function(i){if(r.has(i))return r.get(i);const a=t(i);return r.set(i,a),r.size>e&&r.clear(),a};return i.cache=r,i},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(t){const e=t.length-1,r="["==t[0],i="]"==t[e];return r&&i?t.slice(1,e).split(pathDelimiters):r?t.slice(1).split(pathDelimiters):i?t.slice(0,e).split(pathDelimiters):t.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=t=>isArray(t)?t:"string"==typeof t?memoizedCappedParsePropertyPath(t):[t],getByPath=function(t,e){const r=propertyPathToArray(e),i=r.length;let a=-1,n=t;for(;++a<i;)if(n=n[r[a]],null==n)return;return n},get=(t,e)=>function(r){const i=null==r?void 0:getByPath(r,t);return void 0===i?"function"==typeof e?e(r):e:i};export default get;
|
package/dist/gt.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const spread2=r=>function([n,e]){return r(n,e)},isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),greaterThan=(r,n)=>r>n,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},always=r=>function(){return r},gt=function(r,n){const e="function"==typeof r,t="function"==typeof n;return e&&t?function(e){const t=r(e),o=n(e),u=isPromise(t),c=isPromise(o);return u&&c?promiseAll([t,o]).then((i=greaterThan,function([r,n]){return i(r,n)})):u?t.then(curry2(greaterThan,__,o)):c?o.then(curry2(greaterThan,t,__)):t>o;var i}:e?function(e){const t=r(e);return isPromise(t)?t.then(curry2(greaterThan,__,n)):t>n}:t?function(e){const t=n(e);return isPromise(t)?t.then(curry2(greaterThan,r,__)):r>t}:r>n};export default gt;
|
package/dist/gte.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const spread2=r=>function([e,n]){return r(e,n)},isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),greaterThanOrEqual=(r,e)=>r>=e,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},always=r=>function(){return r},gte=function(r,e){const n="function"==typeof r,t="function"==typeof e;return n&&t?function(n){const t=r(n),u=e(n),o=isPromise(t),c=isPromise(u);return o&&c?promiseAll([t,u]).then((i=greaterThanOrEqual,function([r,e]){return i(r,e)})):o?t.then(curry2(greaterThanOrEqual,__,u)):c?u.then(curry2(greaterThanOrEqual,t,__)):t>=u;var i}:n?function(n){const t=r(n);return isPromise(t)?t.then(curry2(greaterThanOrEqual,__,e)):t>=e}:t?function(n){const t=e(n);return isPromise(t)?t.then(curry2(greaterThanOrEqual,r,__)):r>=t}:r>=e};export default gte;
|
package/dist/lt.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const spread2=r=>function([n,e]){return r(n,e)},isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),lessThan=(r,n)=>r<n,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},always=r=>function(){return r},lt=function(r,n){const e="function"==typeof r,t="function"==typeof n;return e&&t?function(e){const t=r(e),o=n(e),s=isPromise(t),u=isPromise(o);return s&&u?promiseAll([t,o]).then((c=lessThan,function([r,n]){return c(r,n)})):s?t.then(curry2(lessThan,__,o)):u?o.then(curry2(lessThan,t,__)):t<o;var c}:e?function(e){const t=r(e);return isPromise(t)?t.then(curry2(lessThan,__,n)):t<n}:t?function(e){const t=n(e);return isPromise(t)?t.then(curry2(lessThan,r,__)):r<t}:r<n};export default lt;
|
package/dist/lte.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const spread2=r=>function([n,e]){return r(n,e)},isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),lessThanOrEqual=(r,n)=>r<=n,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},always=r=>function(){return r},lte=function(r,n){const e="function"==typeof r,t="function"==typeof n;return e&&t?function(e){const t=r(e),u=n(e),o=isPromise(t),s=isPromise(u);return o&&s?promiseAll([t,u]).then((l=lessThanOrEqual,function([r,n]){return l(r,n)})):o?t.then(curry2(lessThanOrEqual,__,u)):s?u.then(curry2(lessThanOrEqual,t,__)):t<=u;var l}:e?function(e){const t=r(e);return isPromise(t)?t.then(curry2(lessThanOrEqual,__,n)):t<=n}:t?function(e){const t=n(e);return isPromise(t)?t.then(curry2(lessThanOrEqual,r,__)):r<=t}:r<=n};export default lte;
|
package/dist/map.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const symbolIterator=Symbol.iterator,MappingIterator=(r,n)=>({toString:()=>"[object MappingIterator]",[symbolIterator](){return this},next(){const t=r.next();return t.done?t:{value:n(t.value),done:!1}}}),NextIteration=r=>({value:r,done:!1}),isPromise=r=>null!=r&&"function"==typeof r.then,symbolAsyncIterator=Symbol.asyncIterator,MappingAsyncIterator=(r,n)=>({[symbolAsyncIterator](){return this},async next(){const t=await r.next();if(t.done)return t;const e=n(t.value);return isPromise(e)?e.then(NextIteration):{value:e,done:!1}}}),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(t){return r(t,n)},curry2ResolveArg1=(r,n)=>function(t){return r(n,t)},curry2=function(r,n,t){return n==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,n)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const n=typeof r;return"object"==n||"function"==n},objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=r=>nativeObjectToString.call(r),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=r=>objectToString(r)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=r=>objectToString(r)==asyncGeneratorFunctionTag,promiseAll=Promise.all.bind(Promise),arrayMap=function(r,n){const t=r.length,e=Array(t);let o=-1,c=!1;for(;++o<t;){const t=n(r[o],o,r);isPromise(t)&&(c=!0),e[o]=t}return c?promiseAll(e):e},generatorFunctionMap=(r,n)=>function*(...t){for(const e of r(...t))yield n(e)},asyncGeneratorFunctionMap=function(r,n){return async function*(...t){for await(const e of r(...t))yield n(e)}},reducerMap=(r,n)=>function(t,e){const o=n(e);return isPromise(o)?o.then(curry2(r,t,__)):r(t,o)},curry3ResolveArg0=(r,n,t)=>function(e){return r(e,n,t)},curry3ResolveArg1=(r,n,t)=>function(e){return r(n,e,t)},curry3ResolveArg2=(r,n,t)=>function(e){return r(n,t,e)},curry3=function(r,n,t,e){return n==__?curry3ResolveArg0(r,t,e):t==__?curry3ResolveArg1(r,n,e):curry3ResolveArg2(r,n,t)},callPropUnary=(r,n,t)=>r[n](t),stringMap=function(r,n){const t=arrayMap(r,n);return isPromise(t)?t.then(curry3(callPropUnary,__,"join","")):t.join("")},always=r=>function(){return r},setMap=function(r,n){const t=new Set,e=[];for(const o of r){const c=n(o,o,r);isPromise(c)?e.push(c.then(curry3(callPropUnary,t,"add",__))):t.add(c)}return 0==e.length?t:promiseAll(e).then(always(t))},curry4ResolveArg0=(r,n,t,e)=>function(o){return r(o,n,t,e)},curry4ResolveArg1=(r,n,t,e)=>function(o){return r(n,o,t,e)},curry4ResolveArg2=(r,n,t,e)=>function(o){return r(n,t,o,e)},curry4ResolveArg3=(r,n,t,e)=>function(o){return r(n,t,e,o)},curry4=function(r,n,t,e,o){return n==__?curry4ResolveArg0(r,t,e,o):t==__?curry4ResolveArg1(r,n,e,o):e==__?curry4ResolveArg2(r,n,t,o):curry4ResolveArg3(r,n,t,e)},callPropBinary=(r,n,t,e)=>r[n](t,e),mapMap=function(r,n){const t=new Map,e=[];for(const[o,c]of r){const a=n(c,o,r);isPromise(a)?e.push(a.then(curry4(callPropBinary,t,"set",o,__))):t.set(o,a)}return 0==e.length?t:promiseAll(e).then(always(t))},promiseObjectAllExecutor=r=>function(n){const t={};let e=0;for(const o in r){const c=r[o];isPromise(c)?(e+=1,c.then((r=>function(o){t[r]=o,e-=1,0==e&&n(t)})(o))):t[o]=c}0==e&&n(t)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),objectMap=function(r,n){const t={};let e=!1;for(const o in r){const c=n(r[o],o,r);isPromise(c)&&(e=!0),t[o]=c}return e?promiseObjectAll(t):t},funcConcat=(r,n)=>function(...t){const e=r(...t);return isPromise(e)?e.then(n):n(e)},objectSet=function(r,n,t){return r[n]=t,r},arrayMapSeriesAsync=async function(r,n,t,e){const o=r.length;for(;++e<o;){const o=n(r[e]);t[e]=isPromise(o)?await o:o}return t},arrayMapSeries=function(r,n){const t=r.length,e=Array(t);let o=-1;for(;++o<t;){const t=n(r[o]);if(isPromise(t))return t.then(funcConcat(curry3(objectSet,e,o,__),curry4(arrayMapSeriesAsync,r,n,__,o)));e[o]=t}return e},tapSync=r=>function(...n){return r(...n),n[0]},promiseRace=Promise.race.bind(Promise),arrayMapPoolAsync=async function(r,n,t,e,o,c){const a=r.length;for(;++o<a;){c.size>=t&&await promiseRace(c);const a=n(r[o]);if(isPromise(a)){const r=a.then(tapSync((()=>c.delete(r))));c.add(r),e[o]=r}else e[o]=a}return promiseAll(e)},arrayMapPool=function(r,n,t){const e=r.length,o=Array(e);let c=-1;for(;++c<e;){const e=n(r[c]);if(isPromise(e)){const a=new Set,s=e.then(tapSync((()=>a.delete(s))));return a.add(s),o[c]=s,arrayMapPoolAsync(r,n,t,o,c,a)}o[c]=e}return o},arrayMapWithIndex=function(r,n){const t=r.length,e=Array(t);let o=-1,c=!1;for(;++o<t;){const t=n(r[o],o,r);isPromise(t)&&(c=!0),e[o]=t}return c?promiseAll(e):e},hasOwnProperty=Object.prototype.hasOwnProperty,hasOwn=(r,n)=>hasOwnProperty.call(r,n),objectMapOwn=function(r,n){const t={};let e=!1;for(const o in r)if(hasOwn(r,o)){const c=n(r[o]);isPromise(c)&&(e=!0),t[o]=c}return e?promiseObjectAll(t):t},_curryArity=(r,n,t)=>function(...e){const o=t.length,c=e.length,a=[];let s=-1,i=-1,u=0;for(;++s<o;){const o=t[s];if(o==__&&(i+=1)<c){const r=e[i];r==__&&(u+=1),a.push(r)}else a.push(o);if(a.length==r)return 0==u?n(...a):curryArity(r,n,a)}for(;++i<c;){const t=e[i];if(t==__&&(u+=1),a.push(t),a.length==r)return 0==u?n(...a):curryArity(r,n,a)}return curryArity(r,n,a)},curryArity=function(r,n,t){const e=t.length;if(e<r)return _curryArity(r,n,t);let o=-1;for(;++o<e;){if(t[o]==__)return _curryArity(r,n,t)}return n(...t)},spread2=r=>function([n,t]){return r(n,t)},objectMapEntries=function(r,n){const t={},e=[];for(const o in r){const c=n([o,r[o]]);isPromise(c)?e.push(c.then(spread2(curryArity(3,objectSet,[t])))):t[c[0]]=c[1]}return 0==e.length?t:promiseAll(e).then(always(t))},mapSet=function(r,n,t){return r.set(n,t)},mapMapEntriesForEachCallback=(r,n,t)=>function(e,o){const c=r([o,e]);isPromise(c)?t.push(c.then(spread2(curryArity(3,mapSet,[n])))):n.set(c[0],c[1])},mapMapEntries=function(r,n){const t=new Map,e=[];return r.forEach(mapMapEntriesForEachCallback(n,t,e)),0==e.length?t:promiseAll(e).then(always(t))},_map=function(r,n){return isArray(r)?arrayMap(r,n):"function"==typeof r?isGeneratorFunction(r)?generatorFunctionMap(r,n):isAsyncGeneratorFunction(r)?asyncGeneratorFunctionMap(r,n):reducerMap(r,n):null==r?r:"function"==typeof r.then?r.then(n):"function"==typeof r.map?r.map(n):"string"==typeof r||r.constructor==String?stringMap(r,n):r.constructor==Set?setMap(r,n):r.constructor==Map?mapMap(r,n):"function"==typeof r[symbolIterator]?MappingIterator(r[symbolIterator](),n):"function"==typeof r[symbolAsyncIterator]?MappingAsyncIterator(r[symbolAsyncIterator](),n):r.constructor==Object?objectMap(r,n):n(r)},map=(...r)=>{const n=r.pop();return r.length>0?_map(r[0],n):curry2(_map,__,n)};map.entries=function(r){return function(n){if(null==n)throw new TypeError("value is not an Object or Map");if(n.constructor==Object)return objectMapEntries(n,r);if(n.constructor==Map)return mapMapEntries(n,r);throw new TypeError("value is not an Object or Map")}},map.series=r=>function(n){if(isArray(n))return arrayMapSeries(n,r);throw new TypeError(`${n} is not an Array`)},map.pool=(r,n)=>function(t){if(isArray(t))return arrayMapPool(t,n,r);throw new TypeError(`${t} is not an Array`)},map.withIndex=r=>function(n){if(isArray(n))return arrayMapWithIndex(n,r);throw new TypeError(`${n} is not an Array`)},map.own=r=>function(n){if(isObject(n)&&!isArray(n))return objectMapOwn(n,r);throw new TypeError(`${n} is not an Object`)};export default map;
|
package/dist/not.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isPromise=n=>null!=n&&"function"==typeof n.then,_not=n=>!n,not=function(n){return"function"==typeof n?function(t){const o=n(t);return isPromise(o)?o.then(_not):!o}:!n},notSync=n=>function(...t){return!n(...t)};not.sync=notSync;export default not;
|
package/dist/omit.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isArray=Array.isArray,memoizeCappedUnary=function(r,e){const t=new Map,o=function(o){if(t.has(o))return t.get(o);const n=r(o);return t.set(o,n),t.size>e&&t.clear(),n};return o.cache=t,o},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],o="]"==r[e];return t&&o?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):o?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),o=t.length;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;return c},deleteByPath=function(r,e){if(null==r)return;const t=propertyPathToArray(e),o=t.length-1;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;const p=t[n];null!=c&&p in c&&delete c[p]},objectCopyDeep=function(r){const e={};for(const t in r){const o=r[t];isArray(o)?e[t]=arrayCopyDeep(o):null!=o&&o.constructor==Object?e[t]=objectCopyDeep(o):e[t]=o}return e},arrayCopyDeep=function(r){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o];isArray(e)?t[o]=arrayCopyDeep(e):null!=e&&e.constructor==Object?t[o]=objectCopyDeep(e):t[o]=e}return t},copyDeep=function(r){return isArray(r)?arrayCopyDeep(r):null==r?r:r.constructor==Object?objectCopyDeep(r):r},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(t){return r(t,e)},curry2ResolveArg1=(r,e)=>function(t){return r(e,t)},curry2=function(r,e,t){return e==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,e)},_omit=function(r,e){const t=e.length,o=isArray(n=r)?arrayCopyDeep(n):null==n?n:n.constructor==Object?objectCopyDeep(n):n;var n;let c=-1;for(;++c<t;)deleteByPath(o,e[c]);return o},omit=function(r,e){return null==e?curry2(_omit,__,r):_omit(r,e)};export default omit;
|
package/dist/or.min.mjs
DELETED
|
@@ -1,7 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* rubico v1.9.7
|
|
3
|
-
* https://github.com/a-synchronous/rubico
|
|
4
|
-
* (c) 2019-2021 Richard Tong
|
|
5
|
-
* rubico may be freely distributed under the MIT license.
|
|
6
|
-
*/
|
|
7
|
-
const isPromise=n=>null!=n&&"function"==typeof n.then,__=Symbol.for("placeholder"),curry3ResolveArg0=(n,r,t)=>function(e){return n(e,r,t)},curry3ResolveArg1=(n,r,t)=>function(e){return n(r,e,t)},curry3ResolveArg2=(n,r,t)=>function(e){return n(r,t,e)},curry3=function(n,r,t,e){return r==__?curry3ResolveArg0(n,t,e):t==__?curry3ResolveArg1(n,r,e):curry3ResolveArg2(n,r,t)},thunkConditional=(n,r,t)=>n?r():t(),areAllValuesNonfunctions=function(n){const r=n.length;let t=-1;for(;++t<r;)if("function"==typeof n[t])return!1;return!0},thunkify2=(n,r,t)=>function(){return n(r,t)},thunkify3=(n,r,t,e)=>function(){return n(r,t,e)},always=n=>function(){return n},areAnyNonfunctionsTruthy=function(n,r){const t=n.length;for(;++r<t;){let t=n[r];if(isPromise(t))return t.then(curry3(thunkConditional,__,always(!0),thunkify2(areAnyNonfunctionsTruthy,n,r)));if(t)return!0}return!1},asyncAreAnyPredicatesTruthy=async function(n,r,t){const e=n.length;for(;++t<e;){let e=n[t];if("function"==typeof e&&(e=e(r)),console.log("hey - or",e),isPromise(e)&&(e=await e),e)return!0}return!1},or=n=>areAllValuesNonfunctions(n)?areAnyNonfunctionsTruthy(n,-1):function(r){const t=n.length;let e=-1;for(;++e<t;){let t=n[e];if("function"==typeof t&&(t=t(r)),isPromise(t))return t.then(curry3(thunkConditional,__,always(!0),thunkify3(asyncAreAnyPredicatesTruthy,n,r,e)));if(t)return!0}return!1};export default or;
|