rubico 2.7.9 → 2.8.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -2
- package/_internal/arraySome.js +6 -6
- package/_internal/asyncIteratorEvery.js +10 -10
- package/_internal/asyncIteratorSome.js +9 -9
- package/_internal/curryArity.js +14 -12
- package/_internal/mapMapEntries.js +1 -1
- package/_internal/objectMapEntries.js +1 -1
- package/curry.js +59 -3
- 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 +17 -13
- package/dist/curry.es.min.js +2 -2
- package/dist/curry.js +17 -13
- package/dist/curry.min.js +2 -2
- package/dist/curry.mjs +17 -13
- 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 +1 -1
- package/dist/forEach.es.min.js +1 -1
- package/dist/forEach.js +1 -1
- package/dist/forEach.min.js +2 -2
- package/dist/forEach.mjs +1 -1
- 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 +13 -13
- package/dist/map.es.min.js +2 -2
- package/dist/map.js +13 -13
- package/dist/map.min.js +2 -2
- package/dist/map.mjs +13 -13
- 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 +40 -36
- package/dist/rubico.es.min.js +2 -2
- package/dist/rubico.global.js +40 -36
- package/dist/rubico.global.min.js +2 -2
- package/dist/rubico.js +40 -36
- package/dist/rubico.min.js +2 -2
- package/dist/rubico.mjs +40 -36
- 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 +13 -13
- package/dist/x/pluck.es.min.js +2 -2
- package/dist/x/pluck.js +13 -13
- package/dist/x/pluck.min.js +2 -2
- package/dist/x/pluck.mjs +13 -13
- 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 +40 -36
- package/index.js +40 -36
- package/package.json +2 -1
package/dist/assign.mjs
CHANGED
package/dist/compose.es.js
CHANGED
package/dist/compose.es.min.js
CHANGED
package/dist/compose.js
CHANGED
package/dist/compose.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.compose=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=Promise.all.bind(Promise),e=(n,t)=>n(...t),o=Array.isArray,r=n=>null!=n&&"function"==typeof n.then,i=(n,t)=>function(...e){const o=n(...e);return r(o)?o.then(t):t(o)};return function(...u){if("function"==typeof u[0])return u.reduceRight(i);const c=u.pop().reduceRight(i);return 0==u.length?c:function(n){if(o(n)){const t=n.length;let e=-1;for(;++e<t;){const t=n[e];if(r(t))return!0}return!1}for(const t in n){const e=n[t];if(r(e))return!0}return!1}(u)?t(u).then((f=e,l=n,(s=c)==n?((n,t)=>function(e){return n(e,t)})(f,l):((n,t)=>function(e){return n(t,e)})(f,s))):c(...u);var f,s,l}}());
|
package/dist/compose.mjs
CHANGED
package/dist/curry.es.js
CHANGED
|
@@ -1,12 +1,12 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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
|
const __ = Symbol.for('placeholder')
|
|
8
8
|
|
|
9
|
-
const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
9
|
+
const _curryArity = (arity, func, context, args) => function curried(...curriedArgs) {
|
|
10
10
|
const argsLength = args.length,
|
|
11
11
|
curriedArgsLength = curriedArgs.length,
|
|
12
12
|
nextArgs = []
|
|
@@ -27,8 +27,8 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
|
27
27
|
}
|
|
28
28
|
if (nextArgs.length == arity) {
|
|
29
29
|
return numCurriedPlaceholders == 0
|
|
30
|
-
? func(
|
|
31
|
-
: curryArity(arity, func, nextArgs)
|
|
30
|
+
? func.apply(context, nextArgs)
|
|
31
|
+
: curryArity(arity, func, context, nextArgs)
|
|
32
32
|
}
|
|
33
33
|
}
|
|
34
34
|
|
|
@@ -40,32 +40,36 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
|
40
40
|
nextArgs.push(curriedArg)
|
|
41
41
|
if (nextArgs.length == arity) {
|
|
42
42
|
return numCurriedPlaceholders == 0
|
|
43
|
-
? func(
|
|
44
|
-
: curryArity(arity, func, nextArgs)
|
|
43
|
+
? func.apply(context, nextArgs)
|
|
44
|
+
: curryArity(arity, func, context, nextArgs)
|
|
45
45
|
}
|
|
46
46
|
}
|
|
47
|
-
return curryArity(arity, func, nextArgs)
|
|
47
|
+
return curryArity(arity, func, context, nextArgs)
|
|
48
48
|
}
|
|
49
49
|
|
|
50
|
-
const curryArity = function (arity, func, args) {
|
|
50
|
+
const curryArity = function (arity, func, context, args) {
|
|
51
51
|
const argsLength = args.length
|
|
52
52
|
if (argsLength < arity) {
|
|
53
|
-
return _curryArity(arity, func, args)
|
|
53
|
+
return _curryArity(arity, func, context, args)
|
|
54
54
|
}
|
|
55
55
|
let argsIndex = -1
|
|
56
56
|
while (++argsIndex < argsLength) {
|
|
57
57
|
const arg = args[argsIndex]
|
|
58
58
|
if (arg == __) {
|
|
59
|
-
return _curryArity(arity, func, args)
|
|
59
|
+
return _curryArity(arity, func, context, args)
|
|
60
60
|
}
|
|
61
61
|
}
|
|
62
|
-
return func(
|
|
62
|
+
return func.apply(context, args)
|
|
63
63
|
}
|
|
64
64
|
|
|
65
|
-
const curry = (func, ...args) => curryArity(func.length, func, args)
|
|
65
|
+
const curry = (func, ...args) => curryArity(func.length, func, this, args)
|
|
66
66
|
|
|
67
67
|
curry.arity = function curryArity_(arity, func, ...args) {
|
|
68
|
-
return curryArity(arity, func, args)
|
|
68
|
+
return curryArity(arity, func, this, args)
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
curry.call = function call(func, context, ...args) {
|
|
72
|
+
return curryArity(func.length, func, context, args)
|
|
69
73
|
}
|
|
70
74
|
|
|
71
75
|
export default curry
|
package/dist/curry.es.min.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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 __=Symbol.for("placeholder"),_curryArity=(r,t,u)=>function(...
|
|
7
|
+
const __=Symbol.for("placeholder"),_curryArity=(r,t,u,n)=>function(...y){const c=n.length,e=y.length,i=[];let l=-1,o=-1,f=0;for(;++l<c;){const c=n[l];if(c==__&&(o+=1)<e){const r=y[o];r==__&&(f+=1),i.push(r)}else i.push(c);if(i.length==r)return 0==f?t.apply(u,i):curryArity(r,t,u,i)}for(;++o<e;){const n=y[o];if(n==__&&(f+=1),i.push(n),i.length==r)return 0==f?t.apply(u,i):curryArity(r,t,u,i)}return curryArity(r,t,u,i)},curryArity=function(r,t,u,n){const y=n.length;if(y<r)return _curryArity(r,t,u,n);let c=-1;for(;++c<y;){if(n[c]==__)return _curryArity(r,t,u,n)}return t.apply(u,n)},curry=(r,...t)=>curryArity(r.length,r,this,t);curry.arity=function(r,t,...u){return curryArity(r,t,this,u)},curry.call=function(r,t,...u){return curryArity(r.length,r,t,u)};export default curry;
|
package/dist/curry.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.
|
|
@@ -12,7 +12,7 @@
|
|
|
12
12
|
}(typeof globalThis == 'object' ? globalThis : this, (function () { 'use strict'
|
|
13
13
|
const __ = Symbol.for('placeholder')
|
|
14
14
|
|
|
15
|
-
const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
15
|
+
const _curryArity = (arity, func, context, args) => function curried(...curriedArgs) {
|
|
16
16
|
const argsLength = args.length,
|
|
17
17
|
curriedArgsLength = curriedArgs.length,
|
|
18
18
|
nextArgs = []
|
|
@@ -33,8 +33,8 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
|
33
33
|
}
|
|
34
34
|
if (nextArgs.length == arity) {
|
|
35
35
|
return numCurriedPlaceholders == 0
|
|
36
|
-
? func(
|
|
37
|
-
: curryArity(arity, func, nextArgs)
|
|
36
|
+
? func.apply(context, nextArgs)
|
|
37
|
+
: curryArity(arity, func, context, nextArgs)
|
|
38
38
|
}
|
|
39
39
|
}
|
|
40
40
|
|
|
@@ -46,32 +46,36 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
|
46
46
|
nextArgs.push(curriedArg)
|
|
47
47
|
if (nextArgs.length == arity) {
|
|
48
48
|
return numCurriedPlaceholders == 0
|
|
49
|
-
? func(
|
|
50
|
-
: curryArity(arity, func, nextArgs)
|
|
49
|
+
? func.apply(context, nextArgs)
|
|
50
|
+
: curryArity(arity, func, context, nextArgs)
|
|
51
51
|
}
|
|
52
52
|
}
|
|
53
|
-
return curryArity(arity, func, nextArgs)
|
|
53
|
+
return curryArity(arity, func, context, nextArgs)
|
|
54
54
|
}
|
|
55
55
|
|
|
56
|
-
const curryArity = function (arity, func, args) {
|
|
56
|
+
const curryArity = function (arity, func, context, args) {
|
|
57
57
|
const argsLength = args.length
|
|
58
58
|
if (argsLength < arity) {
|
|
59
|
-
return _curryArity(arity, func, args)
|
|
59
|
+
return _curryArity(arity, func, context, args)
|
|
60
60
|
}
|
|
61
61
|
let argsIndex = -1
|
|
62
62
|
while (++argsIndex < argsLength) {
|
|
63
63
|
const arg = args[argsIndex]
|
|
64
64
|
if (arg == __) {
|
|
65
|
-
return _curryArity(arity, func, args)
|
|
65
|
+
return _curryArity(arity, func, context, args)
|
|
66
66
|
}
|
|
67
67
|
}
|
|
68
|
-
return func(
|
|
68
|
+
return func.apply(context, args)
|
|
69
69
|
}
|
|
70
70
|
|
|
71
|
-
const curry = (func, ...args) => curryArity(func.length, func, args)
|
|
71
|
+
const curry = (func, ...args) => curryArity(func.length, func, this, args)
|
|
72
72
|
|
|
73
73
|
curry.arity = function curryArity_(arity, func, ...args) {
|
|
74
|
-
return curryArity(arity, func, args)
|
|
74
|
+
return curryArity(arity, func, this, args)
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
curry.call = function call(func, context, ...args) {
|
|
78
|
+
return curryArity(func.length, func, context, args)
|
|
75
79
|
}
|
|
76
80
|
|
|
77
81
|
return curry
|
package/dist/curry.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.curry=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=Symbol.for("placeholder"),n=(n,o,r,l)=>function(...u){const f=l.length,i=u.length,c=[];let s=-1,h=-1,p=0;for(;++s<f;){const f=l[s];if(f==t&&(h+=1)<i){const n=u[h];n==t&&(p+=1),c.push(n)}else c.push(f);if(c.length==n)return 0==p?o.apply(r,c):e(n,o,r,c)}for(;++h<i;){const l=u[h];if(l==t&&(p+=1),c.push(l),c.length==n)return 0==p?o.apply(r,c):e(n,o,r,c)}return e(n,o,r,c)},e=function(e,o,r,l){const u=l.length;if(u<e)return n(e,o,r,l);let f=-1;for(;++f<u;){if(l[f]==t)return n(e,o,r,l)}return o.apply(r,l)},o=(t,...n)=>e(t.length,t,this,n);return o.arity=function(t,n,...o){return e(t,n,this,o)},o.call=function(t,n,...o){return e(t.length,t,n,o)},o}());
|
package/dist/curry.mjs
CHANGED
|
@@ -1,12 +1,12 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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
|
const __ = Symbol.for('placeholder')
|
|
8
8
|
|
|
9
|
-
const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
9
|
+
const _curryArity = (arity, func, context, args) => function curried(...curriedArgs) {
|
|
10
10
|
const argsLength = args.length,
|
|
11
11
|
curriedArgsLength = curriedArgs.length,
|
|
12
12
|
nextArgs = []
|
|
@@ -27,8 +27,8 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
|
27
27
|
}
|
|
28
28
|
if (nextArgs.length == arity) {
|
|
29
29
|
return numCurriedPlaceholders == 0
|
|
30
|
-
? func(
|
|
31
|
-
: curryArity(arity, func, nextArgs)
|
|
30
|
+
? func.apply(context, nextArgs)
|
|
31
|
+
: curryArity(arity, func, context, nextArgs)
|
|
32
32
|
}
|
|
33
33
|
}
|
|
34
34
|
|
|
@@ -40,32 +40,36 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
|
|
|
40
40
|
nextArgs.push(curriedArg)
|
|
41
41
|
if (nextArgs.length == arity) {
|
|
42
42
|
return numCurriedPlaceholders == 0
|
|
43
|
-
? func(
|
|
44
|
-
: curryArity(arity, func, nextArgs)
|
|
43
|
+
? func.apply(context, nextArgs)
|
|
44
|
+
: curryArity(arity, func, context, nextArgs)
|
|
45
45
|
}
|
|
46
46
|
}
|
|
47
|
-
return curryArity(arity, func, nextArgs)
|
|
47
|
+
return curryArity(arity, func, context, nextArgs)
|
|
48
48
|
}
|
|
49
49
|
|
|
50
|
-
const curryArity = function (arity, func, args) {
|
|
50
|
+
const curryArity = function (arity, func, context, args) {
|
|
51
51
|
const argsLength = args.length
|
|
52
52
|
if (argsLength < arity) {
|
|
53
|
-
return _curryArity(arity, func, args)
|
|
53
|
+
return _curryArity(arity, func, context, args)
|
|
54
54
|
}
|
|
55
55
|
let argsIndex = -1
|
|
56
56
|
while (++argsIndex < argsLength) {
|
|
57
57
|
const arg = args[argsIndex]
|
|
58
58
|
if (arg == __) {
|
|
59
|
-
return _curryArity(arity, func, args)
|
|
59
|
+
return _curryArity(arity, func, context, args)
|
|
60
60
|
}
|
|
61
61
|
}
|
|
62
|
-
return func(
|
|
62
|
+
return func.apply(context, args)
|
|
63
63
|
}
|
|
64
64
|
|
|
65
|
-
const curry = (func, ...args) => curryArity(func.length, func, args)
|
|
65
|
+
const curry = (func, ...args) => curryArity(func.length, func, this, args)
|
|
66
66
|
|
|
67
67
|
curry.arity = function curryArity_(arity, func, ...args) {
|
|
68
|
-
return curryArity(arity, func, args)
|
|
68
|
+
return curryArity(arity, func, this, args)
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
curry.call = function call(func, context, ...args) {
|
|
72
|
+
return curryArity(func.length, func, context, args)
|
|
69
73
|
}
|
|
70
74
|
|
|
71
75
|
export default curry
|
package/dist/eq.es.js
CHANGED
package/dist/eq.es.min.js
CHANGED
package/dist/eq.js
CHANGED
package/dist/eq.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.eq=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Array.isArray,e=function(e){if(t(e)){const t=e.length;let r=-1;for(;++r<t;){const t=e[r];if(n(t))return!0}return!1}for(const t in e){const r=e[t];if(n(r))return!0}return!1},r=Symbol.for("placeholder"),o=function(n,t,e,o,u){return t==r?((n,t,e,r)=>function(o){return n(o,t,e,r)})(n,e,o,u):e==r?((n,t,e,r)=>function(o){return n(t,o,e,r)})(n,t,o,u):o==r?((n,t,e,r)=>function(o){return n(t,e,o,r)})(n,t,e,u):((n,t,e,r)=>function(o){return n(t,e,r,o)})(n,t,e,o)},u=function(n,t,e,o,u){return t==r?((n,t,e,r)=>function(...o){return n(o,t,e,r)})(n,e,o,u):e==r?((n,t,e,r)=>function(...o){return n(t,o,e,r)})(n,t,o,u):o==r?((n,t,e,r)=>function(...o){return n(t,e,o,r)})(n,t,e,u):((n,t,e,r)=>function(...o){return n(t,e,r,o)})(n,t,e,o)},f=n=>function([t,e]){return n(t,e)},i=Promise.all.bind(Promise),c=function(t,e,r,o){const u=r(...t),c=o(...t);return n(u)||n(c)?i([u,c]).then(f(e)):e(u,c)},l=function(t,e,r,o){const u=r(...t);return n(u)||n(o)?i([u,o]).then(f(e)):e(u,o)},s=function(t,e,r,o){const u=o(...t);return n(r)||n(u)?i([r,u]).then(f(e)):e(r,u)};var h;return h=function(n,t){return n==t},function(...t){const p=t.pop(),y=t.pop(),a="function"==typeof y,b="function"==typeof p;return a&&b?0==t.length?u(c,r,h,y,p):e(t)?i(t).then(o(c,r,h,y,p)):c(t,h,y,p):a?0==t.length?u(l,r,h,y,p):e(t)?i(t).then(o(l,r,h,y,p)):l(t,h,y,p):b?0==t.length?u(s,r,h,y,p):e(t)?i(t).then(o(s,r,h,y,p)):s(t,h,y,p):n(y)||n(p)?i([y,p]).then(f(h)):h(y,p)}}());
|
package/dist/eq.mjs
CHANGED
package/dist/every.es.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.
|
|
@@ -106,13 +106,13 @@ const SelfReferencingPromise = function (basePromise) {
|
|
|
106
106
|
const promiseRace = Promise.race.bind(Promise)
|
|
107
107
|
|
|
108
108
|
const asyncIteratorEvery = async function (
|
|
109
|
-
asyncIterator, predicate,
|
|
109
|
+
asyncIterator, predicate, promises, maxConcurrency = 20,
|
|
110
110
|
) {
|
|
111
111
|
let iteration = await asyncIterator.next()
|
|
112
112
|
while (!iteration.done) {
|
|
113
|
-
if (
|
|
114
|
-
const [predication, promise] = await promiseRace(
|
|
115
|
-
|
|
113
|
+
if (promises.size >= maxConcurrency) {
|
|
114
|
+
const [predication, promise] = await promiseRace(promises)
|
|
115
|
+
promises.delete(promise)
|
|
116
116
|
if (!predication) {
|
|
117
117
|
return false
|
|
118
118
|
}
|
|
@@ -120,15 +120,15 @@ const asyncIteratorEvery = async function (
|
|
|
120
120
|
|
|
121
121
|
const predication = predicate(iteration.value)
|
|
122
122
|
if (isPromise(predication)) {
|
|
123
|
-
|
|
123
|
+
promises.add(SelfReferencingPromise(predication))
|
|
124
124
|
} else if (!predication) {
|
|
125
125
|
return false
|
|
126
126
|
}
|
|
127
127
|
iteration = await asyncIterator.next()
|
|
128
128
|
}
|
|
129
|
-
while (
|
|
130
|
-
const [predication, promise] = await promiseRace(
|
|
131
|
-
|
|
129
|
+
while (promises.size > 0) {
|
|
130
|
+
const [predication, promise] = await promiseRace(promises)
|
|
131
|
+
promises.delete(promise)
|
|
132
132
|
if (!predication) {
|
|
133
133
|
return false
|
|
134
134
|
}
|
package/dist/every.es.min.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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=r=>null!=r&&"function"==typeof r.then,__=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)},isArray=Array.isArray,curry3ResolveArg0=(r,e,t)=>function(n){return r(n,e,t)},curry3ResolveArg1=(r,e,t)=>function(n){return r(e,n,t)},curry3ResolveArg2=(r,e,t)=>function(n){return r(e,t,n)},curry3=function(r,e,t,n){return e==__?curry3ResolveArg0(r,t,n):t==__?curry3ResolveArg1(r,e,n):curry3ResolveArg2(r,e,t)},promiseAll=Promise.all.bind(Promise),callPropUnary=(r,e,t)=>r[e](t),arrayEvery=function(r,e){const t=r.length,n=[];let o=-1;for(;++o<t;){const t=e(r[o]);if(isPromise(t))n.push(t);else if(!t)return!1}return 0==n.length||promiseAll(n).then(curry3(callPropUnary,__,"every",Boolean))},iteratorEvery=function(r,e){const t=[];for(const n of r){const r=e(n);if(isPromise(r))t.push(r);else if(!r)return!1}return 0==t.length||promiseAll(t).then(curry3(callPropUnary,__,"every",Boolean))},SelfReferencingPromise=function(r){const e=r.then(
|
|
7
|
+
const isPromise=r=>null!=r&&"function"==typeof r.then,__=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)},isArray=Array.isArray,curry3ResolveArg0=(r,e,t)=>function(n){return r(n,e,t)},curry3ResolveArg1=(r,e,t)=>function(n){return r(e,n,t)},curry3ResolveArg2=(r,e,t)=>function(n){return r(e,t,n)},curry3=function(r,e,t,n){return e==__?curry3ResolveArg0(r,t,n):t==__?curry3ResolveArg1(r,e,n):curry3ResolveArg2(r,e,t)},promiseAll=Promise.all.bind(Promise),callPropUnary=(r,e,t)=>r[e](t),arrayEvery=function(r,e){const t=r.length,n=[];let o=-1;for(;++o<t;){const t=e(r[o]);if(isPromise(t))n.push(t);else if(!t)return!1}return 0==n.length||promiseAll(n).then(curry3(callPropUnary,__,"every",Boolean))},iteratorEvery=function(r,e){const t=[];for(const n of r){const r=e(n);if(isPromise(r))t.push(r);else if(!r)return!1}return 0==t.length||promiseAll(t).then(curry3(callPropUnary,__,"every",Boolean))},SelfReferencingPromise=function(r){const e=r.then(r=>[r,e]);return e},promiseRace=Promise.race.bind(Promise),asyncIteratorEvery=async function(r,e,t,n=20){let o=await r.next();for(;!o.done;){if(t.size>=n){const[r,e]=await promiseRace(t);if(t.delete(e),!r)return!1}const c=e(o.value);if(isPromise(c))t.add(SelfReferencingPromise(c));else if(!c)return!1;o=await r.next()}for(;t.size>0;){const[r,e]=await promiseRace(t);if(t.delete(e),!r)return!1}return!0},objectValues=Object.values,reducerAllSync=(r,e,t)=>!!e&&r(t),reducerEvery=r=>function(e,t){return!1!==e&&(isPromise(e)?e.then(curry3(reducerAllSync,r,__,t)):!!e&&r(t))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,_every=function(r,e){return isArray(r)?arrayEvery(r,e):null==r?e(r):"function"==typeof r[symbolIterator]?iteratorEvery(r[symbolIterator](),e):"function"==typeof r[symbolAsyncIterator]?asyncIteratorEvery(r[symbolAsyncIterator](),e,new Set):"function"==typeof r.reduce?r.reduce(reducerEvery(e),!0):r.constructor==Object?arrayEvery(objectValues(r),e):e(r)},every=function(r,e){return"function"==typeof r?curry2(_every,__,r):isPromise(r)?r.then(curry2(_every,__,e)):_every(r,e)};export default every;
|
package/dist/every.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.
|
|
@@ -112,13 +112,13 @@ const SelfReferencingPromise = function (basePromise) {
|
|
|
112
112
|
const promiseRace = Promise.race.bind(Promise)
|
|
113
113
|
|
|
114
114
|
const asyncIteratorEvery = async function (
|
|
115
|
-
asyncIterator, predicate,
|
|
115
|
+
asyncIterator, predicate, promises, maxConcurrency = 20,
|
|
116
116
|
) {
|
|
117
117
|
let iteration = await asyncIterator.next()
|
|
118
118
|
while (!iteration.done) {
|
|
119
|
-
if (
|
|
120
|
-
const [predication, promise] = await promiseRace(
|
|
121
|
-
|
|
119
|
+
if (promises.size >= maxConcurrency) {
|
|
120
|
+
const [predication, promise] = await promiseRace(promises)
|
|
121
|
+
promises.delete(promise)
|
|
122
122
|
if (!predication) {
|
|
123
123
|
return false
|
|
124
124
|
}
|
|
@@ -126,15 +126,15 @@ const asyncIteratorEvery = async function (
|
|
|
126
126
|
|
|
127
127
|
const predication = predicate(iteration.value)
|
|
128
128
|
if (isPromise(predication)) {
|
|
129
|
-
|
|
129
|
+
promises.add(SelfReferencingPromise(predication))
|
|
130
130
|
} else if (!predication) {
|
|
131
131
|
return false
|
|
132
132
|
}
|
|
133
133
|
iteration = await asyncIterator.next()
|
|
134
134
|
}
|
|
135
|
-
while (
|
|
136
|
-
const [predication, promise] = await promiseRace(
|
|
137
|
-
|
|
135
|
+
while (promises.size > 0) {
|
|
136
|
+
const [predication, promise] = await promiseRace(promises)
|
|
137
|
+
promises.delete(promise)
|
|
138
138
|
if (!predication) {
|
|
139
139
|
return false
|
|
140
140
|
}
|
package/dist/every.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.every=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Symbol.for("placeholder"),e=function(n,e,o){return e==t?((n,t)=>function(e){return n(e,t)})(n,o):((n,t)=>function(e){return n(t,e)})(n,e)},o=Array.isArray,r=function(n,e,o,r){return e==t?((n,t,e)=>function(o){return n(o,t,e)})(n,o,r):o==t?((n,t,e)=>function(o){return n(t,o,e)})(n,e,r):((n,t,e)=>function(o){return n(t,e,o)})(n,e,o)},u=Promise.all.bind(Promise),i=(n,t,e)=>n[t](e),f=function(e,o){const f=e.length,c=[];let s=-1;for(;++s<f;){const t=o(e[s]);if(n(t))c.push(t);else if(!t)return!1}return 0==c.length||u(c).then(r(i,t,"every",Boolean))},c=function(n){const t=n.then(n=>[n,t]);return t},s=Promise.race.bind(Promise),l=Object.values,a=(n,t,e)=>!!t&&n(e),y=Symbol.iterator,h=Symbol.asyncIterator,d=function(e,d){return o(e)?f(e,d):null==e?d(e):"function"==typeof e[y]?function(e,o){const f=[];for(const t of e){const e=o(t);if(n(e))f.push(e);else if(!e)return!1}return 0==f.length||u(f).then(r(i,t,"every",Boolean))}(e[y](),d):"function"==typeof e[h]?async function(t,e,o,r=20){let u=await t.next();for(;!u.done;){if(o.size>=r){const[n,t]=await s(o);if(o.delete(t),!n)return!1}const i=e(u.value);if(n(i))o.add(c(i));else if(!i)return!1;u=await t.next()}for(;o.size>0;){const[n,t]=await s(o);if(o.delete(t),!n)return!1}return!0}(e[h](),d,new Set):"function"==typeof e.reduce?e.reduce((e=>function(o,u){return!1!==o&&(n(o)?o.then(r(a,e,t,u)):!!o&&e(u))})(d),!0):e.constructor==Object?f(l(e),d):d(e)};return function(o,r){return"function"==typeof o?e(d,t,o):n(o)?o.then(e(d,t,r)):d(o,r)}}());
|
package/dist/every.mjs
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.
|
|
@@ -106,13 +106,13 @@ const SelfReferencingPromise = function (basePromise) {
|
|
|
106
106
|
const promiseRace = Promise.race.bind(Promise)
|
|
107
107
|
|
|
108
108
|
const asyncIteratorEvery = async function (
|
|
109
|
-
asyncIterator, predicate,
|
|
109
|
+
asyncIterator, predicate, promises, maxConcurrency = 20,
|
|
110
110
|
) {
|
|
111
111
|
let iteration = await asyncIterator.next()
|
|
112
112
|
while (!iteration.done) {
|
|
113
|
-
if (
|
|
114
|
-
const [predication, promise] = await promiseRace(
|
|
115
|
-
|
|
113
|
+
if (promises.size >= maxConcurrency) {
|
|
114
|
+
const [predication, promise] = await promiseRace(promises)
|
|
115
|
+
promises.delete(promise)
|
|
116
116
|
if (!predication) {
|
|
117
117
|
return false
|
|
118
118
|
}
|
|
@@ -120,15 +120,15 @@ const asyncIteratorEvery = async function (
|
|
|
120
120
|
|
|
121
121
|
const predication = predicate(iteration.value)
|
|
122
122
|
if (isPromise(predication)) {
|
|
123
|
-
|
|
123
|
+
promises.add(SelfReferencingPromise(predication))
|
|
124
124
|
} else if (!predication) {
|
|
125
125
|
return false
|
|
126
126
|
}
|
|
127
127
|
iteration = await asyncIterator.next()
|
|
128
128
|
}
|
|
129
|
-
while (
|
|
130
|
-
const [predication, promise] = await promiseRace(
|
|
131
|
-
|
|
129
|
+
while (promises.size > 0) {
|
|
130
|
+
const [predication, promise] = await promiseRace(promises)
|
|
131
|
+
promises.delete(promise)
|
|
132
132
|
if (!predication) {
|
|
133
133
|
return false
|
|
134
134
|
}
|
package/dist/filter.es.js
CHANGED
package/dist/filter.es.min.js
CHANGED
package/dist/filter.js
CHANGED
package/dist/filter.min.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* rubico v2.
|
|
2
|
+
* rubico v2.8.0
|
|
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.filter=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,e,o){return e==n?((n,t)=>function(e){return n(e,t)})(t,o):((n,t)=>function(e){return n(t,e)})(t,e)},e=Symbol.iterator,o=(n,t)=>({[e](){return this},next(){let e=n.next();for(;!e.done;){const{value:o}=e;if(t(o))return{value:o,done:!1};e=n.next()}return e}}),r=n=>null!=n&&"function"==typeof n.then,u=Symbol.asyncIterator,c=(n,t)=>({isAsyncIteratorDone:!1,[u](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:e,done:o}=await n.next();if(o)this.isAsyncIteratorDone=!0;else{const n=t(e);if(r(n)?await n:n)return{value:e,done:!1}}}return{value:void 0,done:!0}}}),i=Array.isArray,f=function(t,e,o,r,u){return e==n?((n,t,e,o)=>function(r){return n(r,t,e,o)})(t,o,r,u):o==n?((n,t,e,o)=>function(r){return n(t,r,e,o)})(t,e,r,u):r==n?((n,t,e,o)=>function(r){return n(t,e,r,o)})(t,e,o,u):((n,t,e,o)=>function(r){return n(t,e,o,r)})(t,e,o,r)},s=Promise.all.bind(Promise),l=function(n,t,e,o){const r=t.length;let u=n.length-1;for(;++o<r;)n[++u]=e(t[o],o,n);return n},h=function(n,t,e,o){const r=n.length;let u=-1;for(;++e<r;)o[++u]&&t.push(n[e]);return t},a=function(t,e){const o=t.length,u=[];let c=-1,i=-1;for(;++c<o;){const o=t[c],a=e(o,c,t);if(r(a))return s(l([a],t,e,c)).then(f(h,t,u,c-1,n));a&&(u[++i]=o)}return u},y=function(t,e,o,r){return e==n?((n,t,e)=>function(o){return n(o,t,e)})(t,o,r):o==n?((n,t,e)=>function(o){return n(t,o,e)})(t,e,r):((n,t,e)=>function(o){return n(t,e,o)})(t,e,o)},d=(n,t,e)=>n[t](e),p=n=>function(){return n},g=(n,t,e)=>n?t():e(),b=(n,t)=>function(){return n(t)},m=function(){},v=(n,t,e,o,r)=>function(){return n(t,e,o,r)},x=(n,t,e,o)=>n[t](e,o),S=function(n,t,e,o){o&&(n[t]=e)},j=function(t,l){return i(t)?a(t,l):null==t?t:"string"==typeof t||t.constructor==String?function(t,e){const o=a(t,e);return r(o)?o.then(y(d,n,"join","")):o.join("")}(t,l):t.constructor==Set?function(t,e){const o=new Set,u=o.add.bind(o),c=[];for(const i of t){const f=e(i,i,t);r(f)?c.push(f.then(y(g,n,b(u,i),m))):f&&o.add(i)}return 0==c.length?o:s(c).then(p(o))}(t,l):t.constructor==Map?function(t,e){const o=new Map,u=[];for(const[c,i]of t){const f=e(i,c,t);r(f)?u.push(f.then(y(g,n,v(x,o,"set",c,i),m))):f&&o.set(c,i)}return 0==u.length?o:s(u).then(p(o))}(t,l):"function"==typeof t.filter?t.filter(l):"function"==typeof t[e]?o(t[e](),l):"function"==typeof t[u]?c(t[u](),l):t.constructor==Object?function(t,e){const o={},u=[];for(const c in t){const i=t[c],s=e(i,c,t);r(s)?u.push(s.then(f(S,o,c,t[c],n))):s&&(o[c]=i)}return 0==u.length?o:s(u).then(p(o))}(t,l):t};return function(e,o){return"function"==typeof e?t(j,n,e):r(e)?e.then(t(j,n,o)):j(e,o)}}());
|
package/dist/filter.mjs
CHANGED
package/dist/flatMap.es.js
CHANGED