rubico 2.7.8 → 2.7.10
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/README.md +2 -2
- package/_internal/arrayForEach.js +1 -1
- package/_internal/arrayForEachSeries.js +1 -1
- package/_internal/arraySome.js +6 -6
- package/_internal/asyncIteratorEvery.js +10 -10
- package/_internal/asyncIteratorSome.js +9 -9
- package/_internal/objectForEach.js +1 -1
- package/_internal/objectForEachSeries.js +1 -1
- package/dist/Transducer.es.js +1 -1
- package/dist/Transducer.es.min.js +1 -1
- package/dist/Transducer.js +1 -1
- package/dist/Transducer.min.js +2 -2
- package/dist/Transducer.mjs +1 -1
- package/dist/__.es.js +1 -1
- package/dist/__.es.min.js +1 -1
- package/dist/__.js +1 -1
- package/dist/__.min.js +2 -2
- package/dist/__.mjs +1 -1
- package/dist/all.es.js +1 -1
- package/dist/all.es.min.js +1 -1
- package/dist/all.js +1 -1
- package/dist/all.min.js +2 -2
- package/dist/all.mjs +1 -1
- package/dist/always.es.js +1 -1
- package/dist/always.es.min.js +1 -1
- package/dist/always.js +1 -1
- package/dist/always.min.js +2 -2
- package/dist/always.mjs +1 -1
- package/dist/and.es.js +1 -1
- package/dist/and.es.min.js +1 -1
- package/dist/and.js +1 -1
- package/dist/and.min.js +2 -2
- package/dist/and.mjs +1 -1
- package/dist/assign.es.js +1 -1
- package/dist/assign.es.min.js +1 -1
- package/dist/assign.js +1 -1
- package/dist/assign.min.js +2 -2
- package/dist/assign.mjs +1 -1
- package/dist/compose.es.js +1 -1
- package/dist/compose.es.min.js +1 -1
- package/dist/compose.js +1 -1
- package/dist/compose.min.js +2 -2
- package/dist/compose.mjs +1 -1
- package/dist/curry.es.js +1 -1
- package/dist/curry.es.min.js +1 -1
- package/dist/curry.js +1 -1
- package/dist/curry.min.js +2 -2
- package/dist/curry.mjs +1 -1
- package/dist/eq.es.js +1 -1
- package/dist/eq.es.min.js +1 -1
- package/dist/eq.js +1 -1
- package/dist/eq.min.js +2 -2
- package/dist/eq.mjs +1 -1
- package/dist/every.es.js +9 -9
- package/dist/every.es.min.js +2 -2
- package/dist/every.js +9 -9
- package/dist/every.min.js +2 -2
- package/dist/every.mjs +9 -9
- package/dist/filter.es.js +1 -1
- package/dist/filter.es.min.js +1 -1
- package/dist/filter.js +1 -1
- package/dist/filter.min.js +2 -2
- package/dist/filter.mjs +1 -1
- package/dist/flatMap.es.js +1 -1
- package/dist/flatMap.es.min.js +2 -2
- package/dist/flatMap.js +1 -1
- package/dist/flatMap.min.js +2 -2
- package/dist/flatMap.mjs +1 -1
- package/dist/forEach.es.js +5 -5
- package/dist/forEach.es.min.js +2 -2
- package/dist/forEach.js +5 -5
- package/dist/forEach.min.js +2 -2
- package/dist/forEach.mjs +5 -5
- package/dist/get.es.js +1 -1
- package/dist/get.es.min.js +1 -1
- package/dist/get.js +1 -1
- package/dist/get.min.js +2 -2
- package/dist/get.mjs +1 -1
- package/dist/gt.es.js +1 -1
- package/dist/gt.es.min.js +1 -1
- package/dist/gt.js +1 -1
- package/dist/gt.min.js +2 -2
- package/dist/gt.mjs +1 -1
- package/dist/gte.es.js +1 -1
- package/dist/gte.es.min.js +1 -1
- package/dist/gte.js +1 -1
- package/dist/gte.min.js +2 -2
- package/dist/gte.mjs +1 -1
- package/dist/lt.es.js +1 -1
- package/dist/lt.es.min.js +1 -1
- package/dist/lt.js +1 -1
- package/dist/lt.min.js +2 -2
- package/dist/lt.mjs +1 -1
- package/dist/lte.es.js +1 -1
- package/dist/lte.es.min.js +1 -1
- package/dist/lte.js +1 -1
- package/dist/lte.min.js +2 -2
- package/dist/lte.mjs +1 -1
- package/dist/map.es.js +1 -1
- package/dist/map.es.min.js +2 -2
- package/dist/map.js +1 -1
- package/dist/map.min.js +2 -2
- package/dist/map.mjs +1 -1
- package/dist/not.es.js +1 -1
- package/dist/not.es.min.js +1 -1
- package/dist/not.js +1 -1
- package/dist/not.min.js +2 -2
- package/dist/not.mjs +1 -1
- package/dist/omit.es.js +1 -1
- package/dist/omit.es.min.js +1 -1
- package/dist/omit.js +1 -1
- package/dist/omit.min.js +2 -2
- package/dist/omit.mjs +1 -1
- package/dist/or.es.js +1 -1
- package/dist/or.es.min.js +1 -1
- package/dist/or.js +1 -1
- package/dist/or.min.js +2 -2
- package/dist/or.mjs +1 -1
- package/dist/pick.es.js +1 -1
- package/dist/pick.es.min.js +1 -1
- package/dist/pick.js +1 -1
- package/dist/pick.min.js +2 -2
- package/dist/pick.mjs +1 -1
- package/dist/pipe.es.js +1 -1
- package/dist/pipe.es.min.js +1 -1
- package/dist/pipe.js +1 -1
- package/dist/pipe.min.js +2 -2
- package/dist/pipe.mjs +1 -1
- package/dist/reduce.es.js +1 -1
- package/dist/reduce.es.min.js +1 -1
- package/dist/reduce.js +1 -1
- package/dist/reduce.min.js +2 -2
- package/dist/reduce.mjs +1 -1
- package/dist/rubico.es.js +26 -26
- package/dist/rubico.es.min.js +2 -2
- package/dist/rubico.global.js +26 -26
- package/dist/rubico.global.min.js +2 -2
- package/dist/rubico.js +26 -26
- package/dist/rubico.min.js +2 -2
- package/dist/rubico.mjs +26 -26
- package/dist/set.es.js +1 -1
- package/dist/set.es.min.js +1 -1
- package/dist/set.js +1 -1
- package/dist/set.min.js +2 -2
- package/dist/set.mjs +1 -1
- package/dist/some.es.js +14 -14
- package/dist/some.es.min.js +2 -2
- package/dist/some.js +14 -14
- package/dist/some.min.js +2 -2
- package/dist/some.mjs +14 -14
- package/dist/switchCase.es.js +1 -1
- package/dist/switchCase.es.min.js +1 -1
- package/dist/switchCase.js +1 -1
- package/dist/switchCase.min.js +2 -2
- package/dist/switchCase.mjs +1 -1
- package/dist/tap.es.js +1 -1
- package/dist/tap.es.min.js +1 -1
- package/dist/tap.js +1 -1
- package/dist/tap.min.js +2 -2
- package/dist/tap.mjs +1 -1
- package/dist/thunkify.es.js +1 -1
- package/dist/thunkify.es.min.js +1 -1
- package/dist/thunkify.js +1 -1
- package/dist/thunkify.min.js +2 -2
- package/dist/thunkify.mjs +1 -1
- package/dist/transform.es.js +1 -1
- package/dist/transform.es.min.js +1 -1
- package/dist/transform.js +1 -1
- package/dist/transform.min.js +2 -2
- package/dist/transform.mjs +1 -1
- package/dist/tryCatch.es.js +1 -1
- package/dist/tryCatch.es.min.js +1 -1
- package/dist/tryCatch.js +1 -1
- package/dist/tryCatch.min.js +2 -2
- package/dist/tryCatch.mjs +1 -1
- package/dist/x/append.es.js +1 -1
- package/dist/x/append.es.min.js +1 -1
- package/dist/x/append.js +1 -1
- package/dist/x/append.min.js +2 -2
- package/dist/x/append.mjs +1 -1
- package/dist/x/callProp.es.js +1 -1
- package/dist/x/callProp.es.min.js +1 -1
- package/dist/x/callProp.js +1 -1
- package/dist/x/callProp.min.js +2 -2
- package/dist/x/callProp.mjs +1 -1
- package/dist/x/defaultsDeep.es.js +1 -1
- package/dist/x/defaultsDeep.es.min.js +1 -1
- package/dist/x/defaultsDeep.js +1 -1
- package/dist/x/defaultsDeep.min.js +2 -2
- package/dist/x/defaultsDeep.mjs +1 -1
- package/dist/x/differenceWith.es.js +6 -6
- package/dist/x/differenceWith.es.min.js +2 -2
- package/dist/x/differenceWith.js +6 -6
- package/dist/x/differenceWith.min.js +2 -2
- package/dist/x/differenceWith.mjs +6 -6
- package/dist/x/filterOut.es.js +1 -1
- package/dist/x/filterOut.es.min.js +1 -1
- package/dist/x/filterOut.js +1 -1
- package/dist/x/filterOut.min.js +2 -2
- package/dist/x/filterOut.mjs +1 -1
- package/dist/x/find.es.js +1 -1
- package/dist/x/find.es.min.js +1 -1
- package/dist/x/find.js +1 -1
- package/dist/x/find.min.js +2 -2
- package/dist/x/find.mjs +1 -1
- package/dist/x/findIndex.es.js +1 -1
- package/dist/x/findIndex.es.min.js +1 -1
- package/dist/x/findIndex.js +1 -1
- package/dist/x/findIndex.min.js +2 -2
- package/dist/x/findIndex.mjs +1 -1
- package/dist/x/first.es.js +1 -1
- package/dist/x/first.es.min.js +1 -1
- package/dist/x/first.js +1 -1
- package/dist/x/first.min.js +2 -2
- package/dist/x/first.mjs +1 -1
- package/dist/x/flatten.es.js +1 -1
- package/dist/x/flatten.es.min.js +2 -2
- package/dist/x/flatten.js +1 -1
- package/dist/x/flatten.min.js +2 -2
- package/dist/x/flatten.mjs +1 -1
- package/dist/x/groupBy.es.js +1 -1
- package/dist/x/groupBy.es.min.js +1 -1
- package/dist/x/groupBy.js +1 -1
- package/dist/x/groupBy.min.js +2 -2
- package/dist/x/groupBy.mjs +1 -1
- package/dist/x/has.es.js +1 -1
- package/dist/x/has.es.min.js +1 -1
- package/dist/x/has.js +1 -1
- package/dist/x/has.min.js +2 -2
- package/dist/x/has.mjs +1 -1
- package/dist/x/identity.es.js +1 -1
- package/dist/x/identity.es.min.js +1 -1
- package/dist/x/identity.js +1 -1
- package/dist/x/identity.min.js +2 -2
- package/dist/x/identity.mjs +1 -1
- package/dist/x/includes.es.js +1 -1
- package/dist/x/includes.es.min.js +1 -1
- package/dist/x/includes.js +1 -1
- package/dist/x/includes.min.js +2 -2
- package/dist/x/includes.mjs +1 -1
- package/dist/x/isDeepEqual.es.js +1 -1
- package/dist/x/isDeepEqual.es.min.js +1 -1
- package/dist/x/isDeepEqual.js +1 -1
- package/dist/x/isDeepEqual.min.js +2 -2
- package/dist/x/isDeepEqual.mjs +1 -1
- package/dist/x/isEmpty.es.js +1 -1
- package/dist/x/isEmpty.es.min.js +1 -1
- package/dist/x/isEmpty.js +1 -1
- package/dist/x/isEmpty.min.js +2 -2
- package/dist/x/isEmpty.mjs +1 -1
- package/dist/x/isEqual.es.js +1 -1
- package/dist/x/isEqual.es.min.js +1 -1
- package/dist/x/isEqual.js +1 -1
- package/dist/x/isEqual.min.js +2 -2
- package/dist/x/isEqual.mjs +1 -1
- package/dist/x/isFunction.es.js +1 -1
- package/dist/x/isFunction.es.min.js +1 -1
- package/dist/x/isFunction.js +1 -1
- package/dist/x/isFunction.min.js +2 -2
- package/dist/x/isFunction.mjs +1 -1
- package/dist/x/isIn.es.js +1 -1
- package/dist/x/isIn.es.min.js +1 -1
- package/dist/x/isIn.js +1 -1
- package/dist/x/isIn.min.js +2 -2
- package/dist/x/isIn.mjs +1 -1
- package/dist/x/isObject.es.js +1 -1
- package/dist/x/isObject.es.min.js +1 -1
- package/dist/x/isObject.js +1 -1
- package/dist/x/isObject.min.js +2 -2
- package/dist/x/isObject.mjs +1 -1
- package/dist/x/isString.es.js +1 -1
- package/dist/x/isString.es.min.js +1 -1
- package/dist/x/isString.js +1 -1
- package/dist/x/isString.min.js +2 -2
- package/dist/x/isString.mjs +1 -1
- package/dist/x/keys.es.js +1 -1
- package/dist/x/keys.es.min.js +1 -1
- package/dist/x/keys.js +1 -1
- package/dist/x/keys.min.js +2 -2
- package/dist/x/keys.mjs +1 -1
- package/dist/x/last.es.js +1 -1
- package/dist/x/last.es.min.js +1 -1
- package/dist/x/last.js +1 -1
- package/dist/x/last.min.js +2 -2
- package/dist/x/last.mjs +1 -1
- package/dist/x/maxBy.es.js +1 -1
- package/dist/x/maxBy.es.min.js +1 -1
- package/dist/x/maxBy.js +1 -1
- package/dist/x/maxBy.min.js +2 -2
- package/dist/x/maxBy.mjs +1 -1
- package/dist/x/noop.es.js +1 -1
- package/dist/x/noop.es.min.js +1 -1
- package/dist/x/noop.js +1 -1
- package/dist/x/noop.min.js +2 -2
- package/dist/x/noop.mjs +1 -1
- package/dist/x/pluck.es.js +1 -1
- package/dist/x/pluck.es.min.js +2 -2
- package/dist/x/pluck.js +1 -1
- package/dist/x/pluck.min.js +2 -2
- package/dist/x/pluck.mjs +1 -1
- package/dist/x/prepend.es.js +1 -1
- package/dist/x/prepend.es.min.js +1 -1
- package/dist/x/prepend.js +1 -1
- package/dist/x/prepend.min.js +2 -2
- package/dist/x/prepend.mjs +1 -1
- package/dist/x/size.es.js +1 -1
- package/dist/x/size.es.min.js +1 -1
- package/dist/x/size.js +1 -1
- package/dist/x/size.min.js +2 -2
- package/dist/x/size.mjs +1 -1
- package/dist/x/trace.es.js +1 -1
- package/dist/x/trace.es.min.js +1 -1
- package/dist/x/trace.js +1 -1
- package/dist/x/trace.min.js +2 -2
- package/dist/x/trace.mjs +1 -1
- package/dist/x/unionWith.es.js +1 -1
- package/dist/x/unionWith.es.min.js +1 -1
- package/dist/x/unionWith.js +1 -1
- package/dist/x/unionWith.min.js +2 -2
- package/dist/x/unionWith.mjs +1 -1
- package/dist/x/uniq.es.js +1 -1
- package/dist/x/uniq.es.min.js +1 -1
- package/dist/x/uniq.js +1 -1
- package/dist/x/uniq.min.js +2 -2
- package/dist/x/uniq.mjs +1 -1
- package/dist/x/unless.es.js +1 -1
- package/dist/x/unless.es.min.js +1 -1
- package/dist/x/unless.js +1 -1
- package/dist/x/unless.min.js +2 -2
- package/dist/x/unless.mjs +1 -1
- package/dist/x/values.es.js +1 -1
- package/dist/x/values.es.min.js +1 -1
- package/dist/x/values.js +1 -1
- package/dist/x/values.min.js +2 -2
- package/dist/x/values.mjs +1 -1
- package/dist/x/when.es.js +1 -1
- package/dist/x/when.es.min.js +1 -1
- package/dist/x/when.js +1 -1
- package/dist/x/when.min.js +2 -2
- package/dist/x/when.mjs +1 -1
- package/es.js +26 -26
- package/index.js +26 -26
- package/package.json +2 -1
package/dist/set.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.set=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Array.isArray,e=/[.|[|\]]+/,o=function(n,t){const e=new Map,o=function(o){if(e.has(o))return e.get(o);const r=n(o);return e.set(o,r),e.size>t&&e.clear(),r};return o.cache=e,o}(function(n){const t=n.length-1,o="["==n[0],r="]"==n[t];return o&&r?n.slice(1,t).split(e):o?n.slice(1).split(e):r?n.slice(0,t).split(e):n.split(e)},500),r=function(n,e,r){if(!(n=>{if(null==n)return!1;const t=typeof n;return"object"==t||"function"==t})(n))return n;const i=(n=>t(n)?n:"string"==typeof n?o(n):[n])(r),u=i.length,c=u-1,f={...n};let s=f,l=-1;for(;++l<u;){const n=i[l];if(l==c)s[n]=e;else{const e=s[n],o=t(e)?e.slice():{...e};s[n]=o,s=o}}return f},i=Symbol.for("placeholder"),u=function(n,t,e,o){return t==i?((n,t,e)=>function(o){return n(o,t,e)})(n,e,o):e==i?((n,t,e)=>function(o){return n(t,o,e)})(n,t,o):((n,t,e)=>function(o){return n(t,e,o)})(n,t,e)},c=function(t,e,o){if("function"==typeof o){const c=o(t);return n(c)?c.then(u(r,t,i,e)):r(t,c,e)}return n(o)?o.then(u(r,t,i,e)):r(t,o,e)};return function(t,e,o){return null==o?u(c,i,t,e):n(t)?t.then(u(c,i,e,o)):c(t,e,o)}}());
|
package/dist/set.mjs
CHANGED
package/dist/some.es.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
@@ -41,21 +41,21 @@ const SelfReferencingPromise = function (basePromise) {
|
|
|
41
41
|
const promiseRace = Promise.race.bind(Promise)
|
|
42
42
|
|
|
43
43
|
const asyncArraySome = async function (
|
|
44
|
-
array, predicate, index,
|
|
44
|
+
array, predicate, index, promises,
|
|
45
45
|
) {
|
|
46
46
|
const length = array.length
|
|
47
47
|
|
|
48
48
|
while (++index < length) {
|
|
49
49
|
const predication = predicate(array[index])
|
|
50
50
|
if (isPromise(predication)) {
|
|
51
|
-
|
|
51
|
+
promises.add(SelfReferencingPromise(predication))
|
|
52
52
|
} else if (predication) {
|
|
53
53
|
return true
|
|
54
54
|
}
|
|
55
55
|
}
|
|
56
|
-
while (
|
|
57
|
-
const [predication, promise] = await promiseRace(
|
|
58
|
-
|
|
56
|
+
while (promises.size > 0) {
|
|
57
|
+
const [predication, promise] = await promiseRace(promises)
|
|
58
|
+
promises.delete(promise)
|
|
59
59
|
if (predication) {
|
|
60
60
|
return true
|
|
61
61
|
}
|
|
@@ -80,7 +80,7 @@ const arraySome = function (array, predicate) {
|
|
|
80
80
|
}
|
|
81
81
|
|
|
82
82
|
const asyncIteratorSome = async function (
|
|
83
|
-
iterator, predicate,
|
|
83
|
+
iterator, predicate, promises, maxConcurrency = 20,
|
|
84
84
|
) {
|
|
85
85
|
let iteration = iterator.next()
|
|
86
86
|
if (isPromise(iteration)) {
|
|
@@ -88,16 +88,16 @@ const asyncIteratorSome = async function (
|
|
|
88
88
|
}
|
|
89
89
|
|
|
90
90
|
while (!iteration.done) {
|
|
91
|
-
if (
|
|
92
|
-
const [predication, promise] = await promiseRace(
|
|
93
|
-
|
|
91
|
+
if (promises.size >= maxConcurrency) {
|
|
92
|
+
const [predication, promise] = await promiseRace(promises)
|
|
93
|
+
promises.delete(promise)
|
|
94
94
|
if (predication) {
|
|
95
95
|
return true
|
|
96
96
|
}
|
|
97
97
|
}
|
|
98
98
|
const predication = predicate(iteration.value)
|
|
99
99
|
if (isPromise(predication)) {
|
|
100
|
-
|
|
100
|
+
promises.add(SelfReferencingPromise(predication))
|
|
101
101
|
} else if (predication) {
|
|
102
102
|
return true
|
|
103
103
|
}
|
|
@@ -106,9 +106,9 @@ const asyncIteratorSome = async function (
|
|
|
106
106
|
iteration = await iteration
|
|
107
107
|
}
|
|
108
108
|
}
|
|
109
|
-
while (
|
|
110
|
-
const [predication, promise] = await promiseRace(
|
|
111
|
-
|
|
109
|
+
while (promises.size > 0) {
|
|
110
|
+
const [predication, promise] = await promiseRace(promises)
|
|
111
|
+
promises.delete(promise)
|
|
112
112
|
if (predication) {
|
|
113
113
|
return true
|
|
114
114
|
}
|
package/dist/some.es.min.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
|
-
const isPromise=e=>null!=e&&"function"==typeof e.then,__=Symbol.for("placeholder"),curry2ResolveArg0=(e,r)=>function(o){return e(o,r)},curry2ResolveArg1=(e,r)=>function(o){return e(r,o)},curry2=function(e,r,o){return r==__?curry2ResolveArg0(e,o):curry2ResolveArg1(e,r)},isArray=Array.isArray,objectValues=Object.values,SelfReferencingPromise=function(e){const r=e.then(
|
|
7
|
+
const isPromise=e=>null!=e&&"function"==typeof e.then,__=Symbol.for("placeholder"),curry2ResolveArg0=(e,r)=>function(o){return e(o,r)},curry2ResolveArg1=(e,r)=>function(o){return e(r,o)},curry2=function(e,r,o){return r==__?curry2ResolveArg0(e,o):curry2ResolveArg1(e,r)},isArray=Array.isArray,objectValues=Object.values,SelfReferencingPromise=function(e){const r=e.then(e=>[e,r]);return r},promiseRace=Promise.race.bind(Promise),asyncArraySome=async function(e,r,o,t){const n=e.length;for(;++o<n;){const n=r(e[o]);if(isPromise(n))t.add(SelfReferencingPromise(n));else if(n)return!0}for(;t.size>0;){const[e,r]=await promiseRace(t);if(t.delete(r),e)return!0}return!1},arraySome=function(e,r){const o=e.length;let t=-1;for(;++t<o;){const o=r(e[t]);if(isPromise(o))return asyncArraySome(e,r,t,new Set([SelfReferencingPromise(o)]));if(o)return!0}return!1},asyncIteratorSome=async function(e,r,o,t=20){let n=e.next();for(isPromise(n)&&(n=await n);!n.done;){if(o.size>=t){const[e,r]=await promiseRace(o);if(o.delete(r),e)return!0}const s=r(n.value);if(isPromise(s))o.add(SelfReferencingPromise(s));else if(s)return!0;n=e.next(),isPromise(n)&&(n=await n)}for(;o.size>0;){const[e,r]=await promiseRace(o);if(o.delete(r),e)return!0}return!1},iteratorSome=function(e,r){for(const o of e){const t=r(o);if(isPromise(t))return asyncIteratorSome(e,r,new Set([SelfReferencingPromise(t)]));if(t)return!0}return!1},reducerAnySync=e=>function(r,o){return!!r||e(o)},reducerSome=e=>function(r,o){return!0===r?r:isPromise(r)?r.then(curry2(reducerAnySync(e),__,o)):!!r||e(o)},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,_some=function(e,r){return isArray(e)?arraySome(e,r):null==e?r(e):"function"==typeof e[symbolIterator]?iteratorSome(e[symbolIterator](),r):"function"==typeof e[symbolAsyncIterator]?asyncIteratorSome(e[symbolAsyncIterator](),r,new Set):"function"==typeof e.reduce?e.reduce(reducerSome(r),!1):e.constructor==Object?arraySome(objectValues(e),r):r(e)},some=function(e,r){return"function"==typeof e?curry2(_some,__,e):isPromise(e)?e.then(curry2(_some,__,r)):_some(e,r)};export default some;
|
package/dist/some.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
@@ -47,21 +47,21 @@ const SelfReferencingPromise = function (basePromise) {
|
|
|
47
47
|
const promiseRace = Promise.race.bind(Promise)
|
|
48
48
|
|
|
49
49
|
const asyncArraySome = async function (
|
|
50
|
-
array, predicate, index,
|
|
50
|
+
array, predicate, index, promises,
|
|
51
51
|
) {
|
|
52
52
|
const length = array.length
|
|
53
53
|
|
|
54
54
|
while (++index < length) {
|
|
55
55
|
const predication = predicate(array[index])
|
|
56
56
|
if (isPromise(predication)) {
|
|
57
|
-
|
|
57
|
+
promises.add(SelfReferencingPromise(predication))
|
|
58
58
|
} else if (predication) {
|
|
59
59
|
return true
|
|
60
60
|
}
|
|
61
61
|
}
|
|
62
|
-
while (
|
|
63
|
-
const [predication, promise] = await promiseRace(
|
|
64
|
-
|
|
62
|
+
while (promises.size > 0) {
|
|
63
|
+
const [predication, promise] = await promiseRace(promises)
|
|
64
|
+
promises.delete(promise)
|
|
65
65
|
if (predication) {
|
|
66
66
|
return true
|
|
67
67
|
}
|
|
@@ -86,7 +86,7 @@ const arraySome = function (array, predicate) {
|
|
|
86
86
|
}
|
|
87
87
|
|
|
88
88
|
const asyncIteratorSome = async function (
|
|
89
|
-
iterator, predicate,
|
|
89
|
+
iterator, predicate, promises, maxConcurrency = 20,
|
|
90
90
|
) {
|
|
91
91
|
let iteration = iterator.next()
|
|
92
92
|
if (isPromise(iteration)) {
|
|
@@ -94,16 +94,16 @@ const asyncIteratorSome = async function (
|
|
|
94
94
|
}
|
|
95
95
|
|
|
96
96
|
while (!iteration.done) {
|
|
97
|
-
if (
|
|
98
|
-
const [predication, promise] = await promiseRace(
|
|
99
|
-
|
|
97
|
+
if (promises.size >= maxConcurrency) {
|
|
98
|
+
const [predication, promise] = await promiseRace(promises)
|
|
99
|
+
promises.delete(promise)
|
|
100
100
|
if (predication) {
|
|
101
101
|
return true
|
|
102
102
|
}
|
|
103
103
|
}
|
|
104
104
|
const predication = predicate(iteration.value)
|
|
105
105
|
if (isPromise(predication)) {
|
|
106
|
-
|
|
106
|
+
promises.add(SelfReferencingPromise(predication))
|
|
107
107
|
} else if (predication) {
|
|
108
108
|
return true
|
|
109
109
|
}
|
|
@@ -112,9 +112,9 @@ const asyncIteratorSome = async function (
|
|
|
112
112
|
iteration = await iteration
|
|
113
113
|
}
|
|
114
114
|
}
|
|
115
|
-
while (
|
|
116
|
-
const [predication, promise] = await promiseRace(
|
|
117
|
-
|
|
115
|
+
while (promises.size > 0) {
|
|
116
|
+
const [predication, promise] = await promiseRace(promises)
|
|
117
|
+
promises.delete(promise)
|
|
118
118
|
if (predication) {
|
|
119
119
|
return true
|
|
120
120
|
}
|
package/dist/some.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define((
|
|
8
|
+
!function(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define(()=>n):t.some=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=t=>null!=t&&"function"==typeof t.then,n=Symbol.for("placeholder"),e=function(t,e,r){return e==n?((t,n)=>function(e){return t(e,n)})(t,r):((t,n)=>function(e){return t(n,e)})(t,e)},r=Array.isArray,o=Object.values,u=function(t){const n=t.then(t=>[t,n]);return n},i=Promise.race.bind(Promise),f=async function(n,e,r,o){const f=n.length;for(;++r<f;){const i=e(n[r]);if(t(i))o.add(u(i));else if(i)return!0}for(;o.size>0;){const[t,n]=await i(o);if(o.delete(n),t)return!0}return!1},c=function(n,e){const r=n.length;let o=-1;for(;++o<r;){const r=e(n[o]);if(t(r))return f(n,e,o,new Set([u(r)]));if(r)return!0}return!1},s=async function(n,e,r,o=20){let f=n.next();for(t(f)&&(f=await f);!f.done;){if(r.size>=o){const[t,n]=await i(r);if(r.delete(n),t)return!0}const c=e(f.value);if(t(c))r.add(u(c));else if(c)return!0;f=n.next(),t(f)&&(f=await f)}for(;r.size>0;){const[t,n]=await i(r);if(r.delete(n),t)return!0}return!1},l=Symbol.iterator,a=Symbol.asyncIterator,d=function(i,f){return r(i)?c(i,f):null==i?f(i):"function"==typeof i[l]?function(n,e){for(const r of n){const o=e(r);if(t(o))return s(n,e,new Set([u(o)]));if(o)return!0}return!1}(i[l](),f):"function"==typeof i[a]?s(i[a](),f,new Set):"function"==typeof i.reduce?i.reduce((r=>function(o,u){return!0===o?o:t(o)?o.then(e((t=>function(n,e){return!!n||t(e)})(r),n,u)):!!o||r(u)})(f),!1):i.constructor==Object?c(o(i),f):f(i)};return function(r,o){return"function"==typeof r?e(d,n,r):t(r)?r.then(e(d,n,o)):d(r,o)}}());
|
package/dist/some.mjs
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
@@ -41,21 +41,21 @@ const SelfReferencingPromise = function (basePromise) {
|
|
|
41
41
|
const promiseRace = Promise.race.bind(Promise)
|
|
42
42
|
|
|
43
43
|
const asyncArraySome = async function (
|
|
44
|
-
array, predicate, index,
|
|
44
|
+
array, predicate, index, promises,
|
|
45
45
|
) {
|
|
46
46
|
const length = array.length
|
|
47
47
|
|
|
48
48
|
while (++index < length) {
|
|
49
49
|
const predication = predicate(array[index])
|
|
50
50
|
if (isPromise(predication)) {
|
|
51
|
-
|
|
51
|
+
promises.add(SelfReferencingPromise(predication))
|
|
52
52
|
} else if (predication) {
|
|
53
53
|
return true
|
|
54
54
|
}
|
|
55
55
|
}
|
|
56
|
-
while (
|
|
57
|
-
const [predication, promise] = await promiseRace(
|
|
58
|
-
|
|
56
|
+
while (promises.size > 0) {
|
|
57
|
+
const [predication, promise] = await promiseRace(promises)
|
|
58
|
+
promises.delete(promise)
|
|
59
59
|
if (predication) {
|
|
60
60
|
return true
|
|
61
61
|
}
|
|
@@ -80,7 +80,7 @@ const arraySome = function (array, predicate) {
|
|
|
80
80
|
}
|
|
81
81
|
|
|
82
82
|
const asyncIteratorSome = async function (
|
|
83
|
-
iterator, predicate,
|
|
83
|
+
iterator, predicate, promises, maxConcurrency = 20,
|
|
84
84
|
) {
|
|
85
85
|
let iteration = iterator.next()
|
|
86
86
|
if (isPromise(iteration)) {
|
|
@@ -88,16 +88,16 @@ const asyncIteratorSome = async function (
|
|
|
88
88
|
}
|
|
89
89
|
|
|
90
90
|
while (!iteration.done) {
|
|
91
|
-
if (
|
|
92
|
-
const [predication, promise] = await promiseRace(
|
|
93
|
-
|
|
91
|
+
if (promises.size >= maxConcurrency) {
|
|
92
|
+
const [predication, promise] = await promiseRace(promises)
|
|
93
|
+
promises.delete(promise)
|
|
94
94
|
if (predication) {
|
|
95
95
|
return true
|
|
96
96
|
}
|
|
97
97
|
}
|
|
98
98
|
const predication = predicate(iteration.value)
|
|
99
99
|
if (isPromise(predication)) {
|
|
100
|
-
|
|
100
|
+
promises.add(SelfReferencingPromise(predication))
|
|
101
101
|
} else if (predication) {
|
|
102
102
|
return true
|
|
103
103
|
}
|
|
@@ -106,9 +106,9 @@ const asyncIteratorSome = async function (
|
|
|
106
106
|
iteration = await iteration
|
|
107
107
|
}
|
|
108
108
|
}
|
|
109
|
-
while (
|
|
110
|
-
const [predication, promise] = await promiseRace(
|
|
111
|
-
|
|
109
|
+
while (promises.size > 0) {
|
|
110
|
+
const [predication, promise] = await promiseRace(promises)
|
|
111
|
+
promises.delete(promise)
|
|
112
112
|
if (predication) {
|
|
113
113
|
return true
|
|
114
114
|
}
|
package/dist/switchCase.es.js
CHANGED
package/dist/switchCase.js
CHANGED
package/dist/switchCase.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.switchCase=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Promise.all.bind(Promise),t=Array.isArray,r=n=>null!=n&&"function"==typeof n.then,o=(n,t,r)=>n?t():r(),e=(n,t)=>function(){return n(...t)},u=(n,t,r,o)=>function(){return n(t,r,o)},f=Symbol.for("placeholder"),i=function(n,t,r,o){return t==f?((n,t,r)=>function(o){return n(o,t,r)})(n,r,o):r==f?((n,t,r)=>function(o){return n(t,o,r)})(n,t,o):((n,t,r)=>function(o){return n(t,r,o)})(n,t,r)},c=n=>function(){return n},s=function(n,t,l){const h=n.length-1;for(;(l+=2)<h;){const h=n[l],p=n[l+1],y="function"==typeof h?h(...t):h;if(r(y))return y.then(i(o,f,"function"==typeof p?e(p,t):c(p),u(s,n,t,l)));if(y)return"function"==typeof p?p(...t):p}if(l==n.length)return;const p=n[h];return"function"==typeof p?p(...t):p},l=(n,t,r)=>function(){return n(t,r)},h=function(n,t){const e=n.length,u=e-1;for(;(t+=2)<u;){const e=n[t],u=n[t+1];if(r(e))return e.then(i(o,f,c(u),l(h,n,t)));if(e)return u}if(t!=e)return n[t]};return(...o)=>{const e=o.pop();return function(n){if(t(n)){const t=n.length;let r=-1;for(;++r<t;)if("function"==typeof n[r])return!1;return!0}for(const t in n)if("function"==typeof n[t])return!1;return!0}(e)?h(e,-2):0==o.length?(u=s,l=f,p=-2,(c=e)==f?((n,t,r)=>function(...o){return n(o,t,r)})(u,l,p):l==f?((n,t,r)=>function(...o){return n(t,o,r)})(u,c,p):((n,t,r)=>function(...o){return n(t,r,o)})(u,c,l)):function(n){if(t(n)){const t=n.length;let o=-1;for(;++o<t;){const t=n[o];if(r(t))return!0}return!1}for(const t in n){const o=n[t];if(r(o))return!0}return!1}(o)?n(o).then(i(s,e,f,-2)):s(e,o,-2);var u,c,l,p}}());
|
package/dist/switchCase.mjs
CHANGED
package/dist/tap.es.js
CHANGED
package/dist/tap.es.min.js
CHANGED
package/dist/tap.js
CHANGED
package/dist/tap.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.tap=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},r=(n,t,r)=>n?t():r(),e=Symbol.for("placeholder"),u=function(n,t,r,u){return t==e?((n,t,r)=>function(e){return n(e,t,r)})(n,r,u):r==e?((n,t,r)=>function(e){return n(t,e,r)})(n,t,u):((n,t,r)=>function(e){return n(t,r,e)})(n,t,r)},o=Array.isArray,i=function(t){if(o(t)){const r=t.length;let e=-1;for(;++e<r;){const r=t[e];if(n(r))return!0}return!1}for(const r in t){const e=t[r];if(n(e))return!0}return!1},f=Promise.all.bind(Promise),c=function(r,e){const u=r[0],o=e(...r);return n(o)?o.then(t(u)):u},s=function(...n){const t=n.pop();return 0==n.length?(r=c,o=t,(u=e)==e?((n,t)=>function(...r){return n(r,t)})(r,o):((n,t)=>function(...r){return n(t,r)})(r,u)):i(n)?f(n).then(function(n,t,r){return t==e?((n,t)=>function(r){return n(r,t)})(n,r):((n,t)=>function(r){return n(t,r)})(n,t)}(c,e,t)):c(n,t);var r,u,o},l=function(o,i,f){const c=o(...f);if(n(c))return c.then(u(r,e,((n,t)=>function(){return n(...t)})(s(i),f),t(f[0])));if(c){const r=i(...f);if(n(r))return r.then(t(f[0]))}return f[0]};return s.if=function(...n){if(2==n.length)return t=l,r=n[0],o=n[1],c=e,r==e?((n,t,r)=>function(...e){return n(e,t,r)})(t,o,c):o==e?((n,t,r)=>function(...e){return n(t,e,r)})(t,r,c):((n,t,r)=>function(...e){return n(t,r,e)})(t,r,o);var t,r,o,c;const s=n.length,h=n[s-1],a=n[s-2],p=n.slice(0,-2);return i(p)?f(p).then(u(l,a,h,e)):l(a,h,n)},s}());
|
package/dist/tap.mjs
CHANGED
package/dist/thunkify.es.js
CHANGED
package/dist/thunkify.es.min.js
CHANGED
package/dist/thunkify.js
CHANGED
package/dist/thunkify.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.thunkify=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=n=>null!=n&&"function"==typeof n.then,o=Promise.all.bind(Promise),e=Symbol.for("placeholder"),r=(n,t)=>n(...t);return(i,...f)=>function(){return function(o){if(n(o)){const n=o.length;let e=-1;for(;++e<n;){const n=o[e];if(t(n))return!0}return!1}for(const n in o){const e=o[n];if(t(e))return!0}return!1}(f)?o(f).then((u=r,l=e,(c=i)==e?((n,t)=>function(o){return n(o,t)})(u,l):((n,t)=>function(o){return n(t,o)})(u,c))):i(...f);var u,c,l}}());
|
package/dist/thunkify.mjs
CHANGED
package/dist/transform.es.js
CHANGED
package/dist/transform.es.min.js
CHANGED
package/dist/transform.js
CHANGED
package/dist/transform.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.transform=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Symbol.for("placeholder"),r=function(n,r,e,o){return r==t?((n,t,r)=>function(e){return n(e,t,r)})(n,e,o):e==t?((n,t,r)=>function(e){return n(t,e,r)})(n,r,o):((n,t,r)=>function(e){return n(t,r,e)})(n,r,e)},e=Array.isArray,o=ArrayBuffer.isView,u=(n,t,r)=>n[t](r),f=function(n,r,e){return r==t?((n,t)=>function(r){return n(r,t)})(n,e):((n,t)=>function(r){return n(t,r)})(n,r)},c=function(){},i=(Object.values,Object.prototype.toString,async function(t,r,e){let o=t.next();if(o.done)return e;for(;!o.done;)e=r(e,o.value),n(e)&&(e=await e),o=t.next();return e}),a=Symbol.iterator,s=Symbol.asyncIterator,l=function(n,r,e,o,u){return r==t?((n,t,r,e)=>function(o){return n(o,t,r,e)})(n,e,o,u):e==t?((n,t,r,e)=>function(o){return n(t,o,r,e)})(n,r,o,u):o==t?((n,t,r,e)=>function(o){return n(t,r,o,e)})(n,r,e,u):((n,t,r,e)=>function(o){return n(t,r,e,o)})(n,r,e,o)},y=async function(t,r,e,o){const u=t.length;for(;++o<u;)e=r(e,t[o],o,t),n(e)&&(e=await e);return e},d=function(n,r,e,o,u,f){return r==t?((n,t,r,e,o)=>function(u){return n(u,t,r,e,o)})(n,e,o,u,f):e==t?((n,t,r,e,o)=>function(u){return n(t,u,r,e,o)})(n,r,o,u,f):o==t?((n,t,r,e,o)=>function(u){return n(t,r,u,e,o)})(n,r,e,u,f):u==t?((n,t,r,e,o)=>function(u){return n(t,r,e,u,o)})(n,r,e,o,f):((n,t,r,e,o)=>function(u){return n(t,r,e,o,u)})(n,r,e,o,u)},h=Object.keys,p=async function(t,r,e,o,u){const f=o.length;for(;++u<f;){const f=o[u];e=r(e,t[f],f,t),n(e)&&(e=await e)}return e},v=async function(t,r,e,o){for(const[u,f]of o)e=r(e,f,u,t),n(e)&&(e=await e);return e},g=function(o,u,c){return e(o)?function(r,e,o){const u=r.length;let f=-1;for(void 0===o&&(o=r[++f]);++f<u;)if(o=e(o,r[f],f,r),n(o))return o.then(l(y,r,e,t,f));return o}(o,u,c):null==o?void 0===c?f(u,o,t):u(c,o):o.constructor==Map?function(r,e,o){const u=r.entries();if(void 0===o){const n=u.next();if(n.done)return o;o=n.value[1]}for(const[f,c]of u)if(o=e(o,c,f,r),n(o))return o.then(l(v,r,e,t,u));return o}(o,u,c):"function"==typeof o[a]?function(e,o,u){let f=e.next();if(f.done)return u;for(void 0===u&&(u=f.value,f=e.next());!f.done;){if(u=o(u,f.value),n(u))return u.then(r(i,e,o,t));f=e.next()}return u}(o[a](),u,c):"function"==typeof o[s]?async function(n,t,r){let e=await n.next();if(e.done)return r;for(void 0===r&&(r=e.value,e=await n.next());!e.done;)r=await t(r,e.value),e=await n.next();return r}(o[s](),u,c):"function"==typeof o.reduce?o.reduce(u,c):"function"==typeof o.chain?o.chain(f(u,c,t)):"function"==typeof o.flatMap?o.flatMap(f(u,c,t)):o.constructor==Object?function(r,e,o){const u=h(r),f=u.length;let c=-1;for(void 0===o&&(o=r[u[++c]]);++c<f;){const f=u[c];if(o=e(o,r[f],f,r),n(o))return o.then(d(p,r,e,t,u,c))}return o}(o,u,c):void 0===c?f(u,o,t):u(c,o)},w=Object.assign,b=function(n,t){return e(t)||o(t)?function(n,t){const r=n.length,e=t.length;let o=-1;for(;++o<e;)n[r+o]=t[o];return n}(n,t):(n.push(t),n)},j="function"==typeof Buffer,x=j?Buffer.alloc:c,m=function(n,t){const r=n.length,e=j&&n.constructor==Buffer?x(r+t.length):new n.constructor(r+t.length);return e.set(n),e.set(t,r),e},S=function(n,t){return e(t)||o(t)?m(n,t):m(n,[t])},O=function(n,t){return null!=(r=t)&&"function"==typeof r.pipe?((n,t)=>new Promise(((n,t)=>function(r,e){var o,u;t.on("data",(n=>function(t,r,e){return n.write(t,r,e),n})(n)),t.on("end",(o=r,u=n,function(){return o(u)})),t.on("error",e)})(n,t)))(n,t):(n.write(t),n);var r},B=function(n,t){if(null!=t&&t.constructor==Set){for(const r of t)n.add(r);return n}return n.add(t)},A=function(n,t){return n.concat(t)},M=function(t,r,e){const o=g(t,r(c),null);return n(o)?o.then((u=e,function(){return u})):e;var u},T=function(c,i,a){if(e(a))return g(c,i(b),a);if(o(a)){const r=g(c,i(b),[]);return n(r)?r.then(f(S,a,t)):S(a,r)}if(null==a)return M(c,i,a);const s=a.constructor;if("string"==typeof a||s==String){const e=g(c,i(b),[a]);return n(e)?e.then(r(u,t,"join","")):e.join("")}return"function"==typeof a.concat?g(c,i(A),a):"function"==typeof a.write?g(c,i(O),a):s==Set?g(c,i(B),a):s==Object?g(c,i(w),a):M(c,i,a)},k=function(e,o,u){if("function"==typeof u){const f=u(e);return n(f)?f.then(r(T,e,o,t)):T(e,o,f)}return n(u)?u.then(r(T,e,o,t)):T(e,o,u)};return function(...e){return"function"==typeof e[0]?r(k,t,e[0],e[1]):n(e[0])?e[0].then(r(k,t,e[1],e[2])):k(e[0],e[1],e[2])}}());
|
package/dist/transform.mjs
CHANGED
package/dist/tryCatch.es.js
CHANGED
package/dist/tryCatch.es.min.js
CHANGED
package/dist/tryCatch.js
CHANGED
package/dist/tryCatch.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.tryCatch=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Promise.all.bind(Promise),r=Symbol.for("placeholder"),o=function(n,t,o,e){return t==r?((n,t,r)=>function(o){return n(o,t,r)})(n,o,e):o==r?((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,o)},e=function(n,t,r){return n(t,...r)},u=Array.isArray,c=function(t,u,c){try{const i=t(...c);return n(i)?i.catch(o(e,u,r,c)):i}catch(n){return u(n,...c)}};return function(...e){if(e.length>2){const i=e.pop(),f=e.pop();return function(t){if(u(t)){const r=t.length;let o=-1;for(;++o<r;){const r=t[o];if(n(r))return!0}return!1}for(const r in t){const o=t[r];if(n(o))return!0}return!1}(e)?t(e).then(o(c,f,i,r)):c(f,i,e)}const i=e[0],f=e[1];return function(...n){return c(i,f,n)}}}());
|
package/dist/tryCatch.mjs
CHANGED
package/dist/x/append.es.js
CHANGED
package/dist/x/append.es.min.js
CHANGED
package/dist/x/append.js
CHANGED
package/dist/x/append.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.7.
|
|
2
|
+
* rubico v2.7.10
|
|
3
3
|
* https://github.com/a-synchronous/rubico
|
|
4
4
|
* (c) 2019-2026 Richard Tong
|
|
5
5
|
* rubico may be freely distributed under the MIT license.
|
|
6
6
|
*/
|
|
7
7
|
|
|
8
|
-
!function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((
|
|
8
|
+
!function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):r.append=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=function(r){return"string"==typeof r||null!=r&&r.constructor==String},t=Array.isArray;return n=>function(o){if(t(o))return t(n)?[...o,...n]:[...o,n];if(r(o)){if(!r(n))throw new TypeError(`${n} is not a string`);return`${o}${n}`}throw new TypeError(`${o} is not an Array or string`)}}());
|
package/dist/x/append.mjs
CHANGED
package/dist/x/callProp.es.js
CHANGED
package/dist/x/callProp.js
CHANGED