rubico 2.0.0 → 2.0.1

package/dist/x/when.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/when.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/when.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/when.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/when.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist-test.js

@@ -1,14 +1,36 @@
+const assert = require('assert')
 const findAllFilePaths = require('./_internal/findAllFilePaths')
 
 const distTest = async function main() {
   const filePaths = await findAllFilePaths(`${__dirname}/dist`)
+  filePaths.push(`${__dirname}/index.js`)
+  filePaths.push(`${__dirname}/es.js`)
+
   for (const path of filePaths) {
-    if (path.includes('.es') || path.endsWith('.mjs')) {
+    if (
+      path.includes('.es')
+      || path.endsWith('.mjs')
+      || path.includes('es.js')
+    ) {
       // TODO
-      continue
     }
-    console.log('Testing', path)
-    require(path)
+    else {
+      console.log('Testing', path)
+      const required = require(path)
+
+      if (
+        path.includes('rubico.js')
+        || path.includes('rubico.min.js')
+        || path.includes('index.js')
+      ) {
+        assert.equal(Object.keys(required).length, 31)
+      } else if (
+        path.includes('Transducer.js')
+        || path.includes('Transducer.min.js')
+      ) {
+        assert.equal(Object.keys(required).length, 5)
+      }
+    }
   }
 }
 

package/es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -2765,14 +2765,23 @@ curry.arity = function curryArity_(arity, func, ...args) {
 }
 
 const rubico = {
-  pipe, compose, tap,
-  switchCase, tryCatch,
+  pipe, compose,
+
+  tap, forEach,
+
+  switchCase,
+
+  tryCatch,
+
   all, assign, get, set, pick, omit,
-  map, filter, flatMap, forEach, reduce, transform,
+
+  map, filter, flatMap, reduce, transform,
+
   and, or, not, some, every,
+
   eq, gt, lt, gte, lte,
-  thunkify, always,
-  curry, __,
+
+  thunkify, always, curry, __,
 }
 
 export default rubico

package/index.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.0
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -2771,14 +2771,23 @@ curry.arity = function curryArity_(arity, func, ...args) {
 }
 
 const rubico = {
-  pipe, compose, tap,
-  switchCase, tryCatch,
+  pipe, compose,
+
+  tap, forEach,
+
+  switchCase,
+
+  tryCatch,
+
   all, assign, get, set, pick, omit,
-  map, filter, flatMap, forEach, reduce, transform,
+
+  map, filter, flatMap, reduce, transform,
+
   and, or, not, some, every,
+
   eq, gt, lt, gte, lte,
-  thunkify, always,
-  curry, __,
+
+  thunkify, always, curry, __,
 }
 
 return rubico

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rubico",
-  "version": "2.0.0",
+  "version": "2.0.1",
   "description": "[a]synchronous functional programming",
   "author": "Richard Tong",
   "license": "MIT",

package/rubico.js

@@ -44,14 +44,23 @@ const __ = require('./__')
  */
 
 const rubico = {
-  pipe, compose, tap,
-  switchCase, tryCatch,
+  pipe, compose,
+
+  tap, forEach,
+
+  switchCase,
+
+  tryCatch,
+
   all, assign, get, set, pick, omit,
-  map, filter, flatMap, forEach, reduce, transform,
+
+  map, filter, flatMap, reduce, transform,
+
   and, or, not, some, every,
+
   eq, gt, lt, gte, lte,
-  thunkify, always,
-  curry, __,
+
+  thunkify, always, curry, __,
 }
 
 module.exports = rubico

package/tmp.js

@@ -0,0 +1 @@
+require('.')

package/dist/__.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const __=Symbol.for("placeholder");export default __;

package/dist/all.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const n=r.length;let e=-1;for(;++e<n;){const n=r[e];if(isPromise(n))return!0}return!1},promiseAll=Promise.all.bind(Promise),isArray=Array.isArray,__=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)},curryArgs2ResolveArgs0=(r,n,e)=>function(...e){return r(e,n)},curryArgs2ResolveArgs1=(r,n,e)=>function(...e){return r(n,e)},curryArgs2=function(r,n,e){return n==__?curryArgs2ResolveArgs0(r,e):curryArgs2ResolveArgs1(r,n)},functionArrayAll=function(r,n){const e=r.length,t=Array(e);let o=-1,u=!1;for(;++o<e;){const e=r[o](...n);isPromise(e)&&(u=!0),t[o]=e}return u?promiseAll(t):t},funcConcat=(r,n)=>function(...e){const t=r(...e);return isPromise(t)?t.then(n):n(t)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},curry4ResolveArg0=(r,n,e,t)=>function(o){return r(o,n,e,t)},curry4ResolveArg1=(r,n,e,t)=>function(o){return r(n,o,e,t)},curry4ResolveArg2=(r,n,e,t)=>function(o){return r(n,e,o,t)},curry4ResolveArg3=(r,n,e,t)=>function(o){return r(n,e,t,o)},curry4=function(r,n,e,t,o){return n==__?curry4ResolveArg0(r,e,t,o):e==__?curry4ResolveArg1(r,n,t,o):t==__?curry4ResolveArg2(r,n,e,o):curry4ResolveArg3(r,n,e,t)},objectSet=function(r,n,e){return r[n]=e,r},asyncFunctionArrayAllSeries=async function(r,n,e,t){const o=r.length;for(;++t<o;){const o=r[t](...n);e[t]=isPromise(o)?await o:o}return e},functionArrayAllSeries=function(r,n){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o](...n);if(isPromise(e))return e.then(funcConcat(curry3(objectSet,t,o,__),(u=asyncFunctionArrayAllSeries,s=n,l=__,i=o,(c=r)==__?curry4ResolveArg0(u,s,l,i):s==__?curry4ResolveArg1(u,c,l,i):l==__?curry4ResolveArg2(u,c,s,i):curry4ResolveArg3(u,c,s,l))));t[o]=e}var u,c,s,l,i;return t},always=r=>function(){return r},functionObjectAll=function(r,n){const e={},t=[];for(const o in r){const u=r[o](...n);isPromise(u)?t.push(u.then(curry3(objectSet,e,o,__))):e[o]=u}return 0==t.length?e:promiseAll(t).then((o=e,function(){return o}));var o},all=function(...r){const n=r.pop();return 0==r.length?isArray(n)?curryArgs2(functionArrayAll,n,__):curryArgs2(functionObjectAll,n,__):areAnyValuesPromises(r)?isArray(n)?promiseAll(r).then(curry2(functionArrayAll,n,__)):promiseAll(r).then(curry2(functionObjectAll,n,__)):isArray(n)?functionArrayAll(n,r):functionObjectAll(n,r)};all.series=function(...r){const n=r.pop();return 0==r.length?curryArgs2(functionArrayAllSeries,n,__):areAnyValuesPromises(r)?promiseAll(r).then(curry2(functionArrayAllSeries,n,__)):functionArrayAllSeries(n,r)};export default all;

package/dist/always.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const always=a=>function(){return a};export default always;

package/dist/and.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const promiseAll=Promise.all.bind(Promise),isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},__=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)},curry3ResolveArg0=(r,e,n)=>function(t){return r(t,e,n)},curry3ResolveArg1=(r,e,n)=>function(t){return r(e,t,n)},curry3ResolveArg2=(r,e,n)=>function(t){return r(e,n,t)},curry3=function(r,e,n,t){return e==__?curry3ResolveArg0(r,n,t):n==__?curry3ResolveArg1(r,e,t):curry3ResolveArg2(r,e,n)},curryArgs2ResolveArgs0=(r,e,n)=>function(...n){return r(n,e)},curryArgs2ResolveArgs1=(r,e,n)=>function(...n){return r(e,n)},curryArgs2=function(r,e,n){return e==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,e)},thunkConditional=(r,e,n)=>r?e():n(),areAllValuesNonfunctions=function(r){const e=r.length;let n=-1;for(;++n<e;)if("function"==typeof r[n])return!1;return!0},thunkify2=(r,e,n)=>function(){return r(e,n)},thunkify3=(r,e,n,t)=>function(){return r(e,n,t)},always=r=>function(){return r},areAllValuesTruthy=function(r,e){const n=r.length;for(;++e<n;){const n=r[e];if(isPromise(n))return n.then(curry3(thunkConditional,__,thunkify2(areAllValuesTruthy,r,e),always(!1)));if(!n)return!1}return!0},asyncArePredicatesAllTruthy=async function(r,e,n){const t=e.length;for(;++n<t;){let t=e[n];if("function"==typeof t&&(t=t(...r)),isPromise(t)&&(t=await t),!t)return!1}return!0},areAllPredicatesTruthy=function(r,e){const n=e.length;let t=-1;for(;++t<n;){let n=e[t];if("function"==typeof n&&(n=n(...r)),isPromise(n))return n.then(curry3(thunkConditional,__,thunkify3(asyncArePredicatesAllTruthy,r,e,t),always(!1)));if(!n)return!1}return!0},and=function(...r){const e=r.pop();return areAllValuesNonfunctions(e)?areAllValuesTruthy(e,-1):0==r.length?(n=areAllPredicatesTruthy,u=e,(t=__)==__?curryArgs2ResolveArgs0(n,u):curryArgs2ResolveArgs1(n,t)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(areAllPredicatesTruthy,__,e)):areAllPredicatesTruthy(r,e);var n,t,u};export default and;

package/dist/assign.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,objectAssign=Object.assign,__=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)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},always=r=>function(){return r},promiseAll=Promise.all.bind(Promise),objectSet=function(r,n,e){return r[n]=e,r},functionObjectAll=function(r,n){const e={},t=[];for(const o in r){const u=r[o](...n);isPromise(u)?t.push(u.then(curry3(objectSet,e,o,__))):e[o]=u}return 0==t.length?e:promiseAll(t).then((o=e,function(){return o}));var o},_assign=function(r,n){const e=functionObjectAll(n,[r]);return isPromise(e)?e.then(curry3(objectAssign,{},r,__)):{...r,...e}},assign=function(r,n){return null==n?curry2(_assign,__,r):isPromise(r)?r.then(curry2(_assign,__,n)):_assign(r,n)};export default assign;

package/dist/compose.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const __=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)},promiseAll=Promise.all.bind(Promise),funcApply=(r,e)=>r(...e),isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},compose=function(...r){const e=r.pop().reduceRight(funcConcat);return 0==r.length?e:areAnyValuesPromises(r)?promiseAll(r).then((n=funcApply,t=__,(o=e)==__?curry2ResolveArg0(n,t):curry2ResolveArg1(n,o))):e(...r);var n,o,t};export default compose;

package/dist/curry.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const __=Symbol.for("placeholder"),_curryArity=(r,t,u)=>function(...n){const y=u.length,c=n.length,e=[];let i=-1,o=-1,f=0;for(;++i<y;){const y=u[i];if(y==__&&(o+=1)<c){const r=n[o];r==__&&(f+=1),e.push(r)}else e.push(y);if(e.length==r)return 0==f?t(...e):curryArity(r,t,e)}for(;++o<c;){const u=n[o];if(u==__&&(f+=1),e.push(u),e.length==r)return 0==f?t(...e):curryArity(r,t,e)}return curryArity(r,t,e)},curryArity=function(r,t,u){const n=u.length;if(n<r)return _curryArity(r,t,u);let y=-1;for(;++y<n;){if(u[y]==__)return _curryArity(r,t,u)}return t(...u)},curry=(r,...t)=>curryArity(r.length,r,t);curry.arity=function(r,t,...u){return curryArity(r,t,u)};export default curry;

package/dist/eq.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let o=-1;for(;++o<e;){const e=r[o];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,o,s)=>function(t){return r(t,e,o,s)},curry4ResolveArg1=(r,e,o,s)=>function(t){return r(e,t,o,s)},curry4ResolveArg2=(r,e,o,s)=>function(t){return r(e,o,t,s)},curry4ResolveArg3=(r,e,o,s)=>function(t){return r(e,o,s,t)},curry4=function(r,e,o,s,t){return e==__?curry4ResolveArg0(r,o,s,t):o==__?curry4ResolveArg1(r,e,s,t):s==__?curry4ResolveArg2(r,e,o,t):curry4ResolveArg3(r,e,o,s)},curryArgs4ResolveArgs0=(r,e,o,s)=>function(...t){return r(t,e,o,s)},curryArgs4ResolveArgs1=(r,e,o,s)=>function(...t){return r(e,t,o,s)},curryArgs4ResolveArgs2=(r,e,o,s)=>function(...t){return r(e,o,t,s)},curryArgs4ResolveArgs3=(r,e,o,s)=>function(...t){return r(e,o,s,t)},curryArgs4=function(r,e,o,s,t){return e==__?curryArgs4ResolveArgs0(r,o,s,t):o==__?curryArgs4ResolveArgs1(r,e,s,t):s==__?curryArgs4ResolveArgs2(r,e,o,t):curryArgs4ResolveArgs3(r,e,o,s)},spread2=r=>function([e,o]){return r(e,o)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,o,s){const t=o(...r),l=s(...r);return isPromise(t)||isPromise(l)?promiseAll([t,l]).then(spread2(e)):e(t,l)},leftResolverRightValueCompare=function(r,e,o,s){const t=o(...r);return isPromise(t)||isPromise(s)?promiseAll([t,s]).then(spread2(e)):e(t,s)},leftValueRightResolverCompare=function(r,e,o,s){const t=s(...r);return isPromise(o)||isPromise(t)?promiseAll([o,t]).then(spread2(e)):e(o,t)},ComparisonOperator=r=>function(...e){const o=e.pop(),s=e.pop(),t="function"==typeof s,l="function"==typeof o;return t&&l?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,s,o)):leftResolverRightResolverCompare(e,r,s,o):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,s,o)):leftResolverRightValueCompare(e,r,s,o):l?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,s,o)):leftValueRightResolverCompare(e,r,s,o):isPromise(s)||isPromise(o)?promiseAll([s,o]).then(spread2(r)):r(s,o)},equals=function(r,e){return r==e},eq=ComparisonOperator(equals);export default eq;

package/dist/every.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-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){const e=r.pop();if(0==r.length)return curry2(_every,__,e);const t=r[0];return isPromise(t)?t.then(curry2(_every,__,e)):_every(t,e)};export default every;

package/dist/filter.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const __=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(n){return r(n,t)},curry2ResolveArg1=(r,t)=>function(n){return r(t,n)},curry2=function(r,t,n){return t==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,t)},symbolIterator=Symbol.iterator,FilteringIterator=(r,t)=>({[symbolIterator](){return this},next(){let n=r.next();for(;!n.done;){const{value:e}=n;if(t(e))return{value:e,done:!1};n=r.next()}return n}}),isPromise=r=>null!=r&&"function"==typeof r.then,symbolAsyncIterator=Symbol.asyncIterator,FilteringAsyncIterator=(r,t)=>({isAsyncIteratorDone:!1,[symbolAsyncIterator](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:n,done:e}=await r.next();if(e)this.isAsyncIteratorDone=!0;else{const r=t(n);if(isPromise(r)?await r:r)return{value:n,done:!1}}}return{value:void 0,done:!0}}}),isArray=Array.isArray,curry4ResolveArg0=(r,t,n,e)=>function(o){return r(o,t,n,e)},curry4ResolveArg1=(r,t,n,e)=>function(o){return r(t,o,n,e)},curry4ResolveArg2=(r,t,n,e)=>function(o){return r(t,n,o,e)},curry4ResolveArg3=(r,t,n,e)=>function(o){return r(t,n,e,o)},curry4=function(r,t,n,e,o){return t==__?curry4ResolveArg0(r,n,e,o):n==__?curry4ResolveArg1(r,t,e,o):e==__?curry4ResolveArg2(r,t,n,o):curry4ResolveArg3(r,t,n,e)},promiseAll=Promise.all.bind(Promise),arrayExtendMap=function(r,t,n,e){const o=t.length;let i=r.length-1;for(;++e<o;)r[++i]=n(t[e],e,r);return r},arrayFilterByConditions=function(r,t,n,e){const o=r.length;let i=-1;for(;++n<o;)e[++i]&&t.push(r[n]);return t},arrayFilter=function(r,t){const n=r.length,e=[];let o=-1,i=-1;for(;++o<n;){const n=r[o],u=t(n,o,r);if(isPromise(u))return promiseAll(arrayExtendMap([u],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));u&&(e[++i]=n)}return e},curry3ResolveArg0=(r,t,n)=>function(e){return r(e,t,n)},curry3ResolveArg1=(r,t,n)=>function(e){return r(t,e,n)},curry3ResolveArg2=(r,t,n)=>function(e){return r(t,n,e)},curry3=function(r,t,n,e){return t==__?curry3ResolveArg0(r,n,e):n==__?curry3ResolveArg1(r,t,e):curry3ResolveArg2(r,t,n)},callPropUnary=(r,t,n)=>r[t](n),stringFilter=function(r,t){const n=arrayFilter(r,t);return isPromise(n)?n.then(curry3(callPropUnary,__,"join","")):n.join("")},always=r=>function(){return r},thunkConditional=(r,t,n)=>r?t():n(),thunkify1=(r,t)=>function(){return r(t)},noop=function(){},setFilter=function(r,t){const n=new Set,e=n.add.bind(n),o=[];for(const i of r){const u=t(i,i,r);isPromise(u)?o.push(u.then(curry3(thunkConditional,__,thunkify1(e,i),noop))):u&&n.add(i)}return 0==o.length?n:promiseAll(o).then(always(n))},thunkify4=(r,t,n,e,o)=>function(){return r(t,n,e,o)},callPropBinary=(r,t,n,e)=>r[t](n,e),mapFilter=function(r,t){const n=new Map,e=[];for(const[o,i]of r){const u=t(i,o,r);isPromise(u)?e.push(u.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,i),noop))):u&&n.set(o,i)}return 0==e.length?n:promiseAll(e).then(always(n))},objectSetIf=function(r,t,n,e){e&&(r[t]=n)},objectFilter=function(r,t){const n={},e=[];for(const o in r){const i=r[o],u=t(i,o,r);isPromise(u)?e.push(u.then(curry4(objectSetIf,n,o,r[o],__))):u&&(n[o]=i)}return 0==e.length?n:promiseAll(e).then(always(n))},_filter=function(r,t){return isArray(r)?arrayFilter(r,t):null==r?r:"string"==typeof r||r.constructor==String?stringFilter(r,t):r.constructor==Set?setFilter(r,t):r.constructor==Map?mapFilter(r,t):"function"==typeof r.filter?r.filter(t):"function"==typeof r[symbolIterator]?FilteringIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?FilteringAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectFilter(r,t):r},filter=function(...r){const t=r.pop();return 0==r.length?(n=_filter,o=t,(e=__)==__?curry2ResolveArg0(n,o):curry2ResolveArg1(n,e)):_filter(r[0],t);var n,e,o};export default filter;

package/dist/flatMap.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,objectValues=Object.values,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,__=Symbol.for("placeholder"),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)},iteratorReduceAsync=async function(r,e,t){let n=r.next();if(n.done)return t;for(;!n.done;)t=e(t,n.value),isPromise(t)&&(t=await t),n=r.next();return t},iteratorReduce=function(r,e,t){let n=r.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=r.next());!n.done;){if(t=e(t,n.value),isPromise(t))return t.then(curry3(iteratorReduceAsync,r,e,__));n=r.next()}return t},asyncIteratorReduce=async function(r,e,t){let n=await r.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=await r.next());!n.done;)t=await e(t,n.value),n=await r.next();return t},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,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)},curryArgs3ResolveArgs0=(r,e,t)=>function(...n){return r(n,e,t)},curryArgs3ResolveArgs1=(r,e,t)=>function(...n){return r(e,n,t)},curryArgs3ResolveArgs2=(r,e,t)=>function(...n){return r(e,t,n)},curryArgs3=function(r,e,t,n){return e==__?curryArgs3ResolveArgs0(r,t,n):t==__?curryArgs3ResolveArgs1(r,e,n):curryArgs3ResolveArgs2(r,e,t)},curry4ResolveArg0=(r,e,t,n)=>function(o){return r(o,e,t,n)},curry4ResolveArg1=(r,e,t,n)=>function(o){return r(e,o,t,n)},curry4ResolveArg2=(r,e,t,n)=>function(o){return r(e,t,o,n)},curry4ResolveArg3=(r,e,t,n)=>function(o){return r(e,t,n,o)},curry4=function(r,e,t,n,o){return e==__?curry4ResolveArg0(r,t,n,o):t==__?curry4ResolveArg1(r,e,n,o):n==__?curry4ResolveArg2(r,e,t,o):curry4ResolveArg3(r,e,t,n)},arrayReduceAsync=async function(r,e,t,n){const o=r.length;for(;++n<o;)t=e(t,r[n],n,r),isPromise(t)&&(t=await t);return t},arrayReduce=function(r,e,t){const n=r.length;let o=-1;for(void 0===t&&(t=r[++o]);++o<n;)if(t=e(t,r[o],o,r),isPromise(t))return t.then(curry4(arrayReduceAsync,r,e,__,o));return t},curry5ResolveArg0=(r,e,t,n,o)=>function(c){return r(c,e,t,n,o)},curry5ResolveArg1=(r,e,t,n,o)=>function(c){return r(e,c,t,n,o)},curry5ResolveArg2=(r,e,t,n,o)=>function(c){return r(e,t,c,n,o)},curry5ResolveArg3=(r,e,t,n,o)=>function(c){return r(e,t,n,c,o)},curry5ResolveArg4=(r,e,t,n,o)=>function(c){return r(e,t,n,o,c)},curry5=function(r,e,t,n,o,c){return e==__?curry5ResolveArg0(r,t,n,o,c):t==__?curry5ResolveArg1(r,e,n,o,c):n==__?curry5ResolveArg2(r,e,t,o,c):o==__?curry5ResolveArg3(r,e,t,n,c):curry5ResolveArg4(r,e,t,n,o)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,t,n,o){const c=n.length;for(;++o<c;){const c=n[o];t=e(t,r[c],c,r),isPromise(t)&&(t=await t)}return t},objectReduce=function(r,e,t){const n=objectKeys(r),o=n.length;let c=-1;for(void 0===t&&(t=r[n[++c]]);++c<o;){const o=n[c];if(t=e(t,r[o],o,r),isPromise(t))return t.then((s=objectReduceAsync,u=e,a=__,l=n,y=c,(i=r)==__?curry5ResolveArg0(s,u,a,l,y):u==__?curry5ResolveArg1(s,i,a,l,y):a==__?curry5ResolveArg2(s,i,u,l,y):l==__?curry5ResolveArg3(s,i,u,a,y):curry5ResolveArg4(s,i,u,a,l)))}var s,i,u,a,l,y;return t},mapReduceAsync=async function(r,e,t,n){for(const[o,c]of n)t=e(t,c,o,r),isPromise(t)&&(t=await t);return t},mapReduce=function(r,e,t){const n=r.entries();if(void 0===t){const r=n.next();if(r.done)return t;t=r.value[1]}for(const[o,c]of n)if(t=e(t,c,o,r),isPromise(t))return t.then(curry4(mapReduceAsync,r,e,__,n));return t},reducerConcat=(r,e)=>function(t,n){const o=r(t,n);return isPromise(o)?o.then(curry2(e,__,n)):e(o,n)},genericReduce=function(r,e,t){return isArray(r)?arrayReduce(r,e,t):null==r?void 0===t?curry2(e,r,__):e(t,r):r.constructor==Map?mapReduce(r,e,t):"function"==typeof r[symbolIterator]?iteratorReduce(r[symbolIterator](),e,t):"function"==typeof r[symbolAsyncIterator]?asyncIteratorReduce(r[symbolAsyncIterator](),e,t):"function"==typeof r.reduce?r.reduce(e,t):"function"==typeof r.chain?r.chain(curry2(e,t,__)):"function"==typeof r.flatMap?r.flatMap(curry2(e,t,__)):r.constructor==Object?objectReduce(r,e,t):void 0===t?curry2(e,r,__):e(t,r)},arrayPush=function(r,e){return r.push(e),r},FlatMappingIterator=function(r,e){let t=[],n=0;return{[symbolIterator](){return this},next(){if(n<t.length){const r=t[n];return n+=1,{value:r,done:!1}}const o=r.next();if(o.done)return o;const c=genericReduce(e(o.value),arrayPush,[]);return c.length>1&&(t=c,n=1),{value:c[0],done:!1}}}},promiseRace=Promise.race.bind(Promise),sleep=r=>new Promise((e=>{setTimeout(e,r)})),FlatMappingAsyncIterator=function(r,e){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 r.next();if(c)this.isAsyncIteratorDone=c;else{const r=e(o);if(isPromise(r)){const e=r.then(curry3(genericReduce,__,arrayPush,t)).then((()=>n.delete(e)));n.add(e)}else{const e=genericReduce(r,arrayPush,t);if(isPromise(e)){const r=e.then((()=>n.delete(r)));n.add(r)}}}}if(t.length>0)return{value:t.shift(),done:!1};n.size>0&&await promiseRace([sleep(1e3),...n])}return{value:void 0,done:!0}}}},always=r=>function(){return r},getArg1=(r,e)=>e,identity=r=>r,promiseAll=Promise.all.bind(Promise),funcConcatSync=(r,e)=>function(...t){return e(r(...t))},asyncIteratorForEach=async function(r,e){const t=[];for await(const n of r){const r=e(n);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},arrayFlatten=function(r){const e=r.length,t=[],n=[];let o=-1;for(;++o<e;){const e=r[o];if(isArray(e)){const r=e.length;let t=-1;for(;++t<r;)n.push(e[t])}else if(null==e)n.push(e);else if("function"==typeof e.then)t.push(e.then(curry2(arrayPush,n,__)));else if("function"==typeof e[symbolIterator])for(const r of e)n.push(r);else if("function"==typeof e[symbolAsyncIterator])t.push(asyncIteratorForEach(e[symbolAsyncIterator](),curry2(arrayPush,n,__)));else if("function"==typeof e.chain){const r=e.chain(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,n,__))):n.push(r)}else if("function"==typeof e.flatMap){const r=e.flatMap(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,n,__))):n.push(r)}else if("function"==typeof e.reduce){const r=e.reduce(funcConcatSync(getArg1,curry2(arrayPush,n,__)),null);isPromise(r)&&t.push(r)}else if(e.constructor==Object)for(const r in e)n.push(e[r]);else n.push(e)}return 0==t.length?n:promiseAll(t).then(always(n))},arrayMap=function(r,e){const t=r.length,n=Array(t);let o=-1,c=!1;for(;++o<t;){const t=e(r[o],o,r);isPromise(t)&&(c=!0),n[o]=t}return c?promiseAll(n):n},arrayFlatMap=function(r,e){const t=arrayMap(r,e);return isPromise(t)?t.then(arrayFlatten):arrayFlatten(t)},promiseObjectAllExecutor=r=>function(e){const t={};let n=0;for(const o in r){const c=r[o];isPromise(c)?(n+=1,c.then((r=>function(o){t[r]=o,n-=1,0==n&&e(t)})(o))):t[o]=c}0==n&&e(t)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),objectMap=function(r,e){const t={};let n=!1;for(const o in r){const c=e(r[o],o,r);isPromise(c)&&(n=!0),t[o]=c}return n?promiseObjectAll(t):t},objectAssign=Object.assign,objectFlatten=function(r){const e=[],t={},n=curry2(objectAssign,t,__),o=funcConcatSync(getArg1,n);for(const c in r){const s=r[c];if(null!=s)if("function"==typeof s[symbolIterator])for(const r of s)objectAssign(t,r);else if("function"==typeof s[symbolAsyncIterator])e.push(asyncIteratorForEach(s[symbolAsyncIterator](),n));else if("function"==typeof s.chain){const r=s.chain(identity);isPromise(r)?e.push(r.then(n)):objectAssign(t,r)}else if("function"==typeof s.flatMap){const r=s.flatMap(identity);isPromise(r)?e.push(r.then(n)):n(r)}else if("function"==typeof s.reduce){const r=s.reduce(o,null);isPromise(r)&&e.push(r)}else objectAssign(t,s)}return 0==e.length?t:promiseAll(e).then((()=>t))},objectFlatMap=function(r,e){const t=objectMap(r,e);return isPromise(t)?t.then(objectFlatten):objectFlatten(t)},callPropUnary=(r,e,t)=>r[e](t),setMap=function(r,e){const t=new Set,n=[];for(const o of r){const c=e(o,o,r);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(r){r.size;const e=[],t=new Set,n=(r,e)=>t.add(e),o=curry3(callPropUnary,t,"add",__);for(const c of r)if(isArray(c)){const r=c.length;let e=-1;for(;++e<r;)t.add(c[e])}else if(null==c)t.add(c);else if("function"==typeof c[symbolIterator])for(const r of c)t.add(r);else if("function"==typeof c[symbolAsyncIterator])e.push(asyncIteratorForEach(c[symbolAsyncIterator](),o));else if("function"==typeof c.chain){const r=c.chain(identity);isPromise(r)?e.push(r.then(o)):t.add(r)}else if("function"==typeof c.flatMap){const r=c.flatMap(identity);isPromise(r)?e.push(r.then(o)):t.add(r)}else if("function"==typeof c.reduce){const r=c.reduce(n,null);isPromise(r)&&e.push(r)}else if(c.constructor==Object)for(const r in c)t.add(c[r]);else t.add(c);return 0==e.length?t:promiseAll(e).then((()=>t))},setFlatMap=function(r,e){const t=setMap(r,e);return isPromise(t)?t.then(setFlatten):setFlatten(t)},funcConcat=(r,e)=>function(...t){const n=r(...t);return isPromise(n)?n.then(e):e(n)},arrayJoin=(r,e)=>r.join(e),arrayFlattenToString=funcConcat(arrayFlatten,curry2(arrayJoin,__,"")),stringFlatMap=function(r,e){const t=arrayMap(r,e);return isPromise(t)?t.then(arrayFlattenToString):arrayFlattenToString(t)},_flatMap=function(r,e){if(isArray(r))return arrayFlatMap(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);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)},flatMap=(...r)=>{const e=r.pop();if(0==r.length)return curry2(_flatMap,__,e);const t=r[0];return isPromise(t)?t.then(curry2(_flatMap,__,e)):_flatMap(r[0],e)};export default flatMap;

package/dist/forEach.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,o)=>function(t){return r(t,o)},curry2ResolveArg1=(r,o)=>function(t){return r(o,t)},curry2=function(r,o,t){return o==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,o)},isArray=Array.isArray,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),always=r=>function(){return r},arrayForEach=function(r,o){const t=r.length,n=[];let e=-1;for(;++e<t;){const t=o(r[e]);isPromise(t)&&n.push(t)}return 0==n.length?r:promiseAll(n).then(always(r))},objectForEach=function(r,o){const t=[];for(const n in r){const e=o(r[n]);isPromise(e)&&t.push(e)}return 0==t.length?r:promiseAll(t).then(always(r))},iteratorForEach=function(r,o){const t=[];for(const n of r){const r=o(n);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},asyncIteratorForEach=async function(r,o){const t=[];for await(const n of r){const r=o(n);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,_forEach=function(r,o){return isArray(r)?arrayForEach(r,o):null==r?r:"function"==typeof r.forEach?r.forEach(o):"function"==typeof r[symbolIterator]?iteratorForEach(r[symbolIterator](),o):"function"==typeof r[symbolAsyncIterator]?asyncIteratorForEach(r[symbolAsyncIterator](),o):r.constructor==Object?objectForEach(r,o):r},forEach=function(...r){const o=r.pop();if(0==r.length)return curry2(_forEach,__,o);const t=r[0];return isPromise(t)?t.then(curry2(_forEach,__,o)):_forEach(t,o)};export default forEach;

package/dist/get.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,__=Symbol.for("placeholder"),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)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const e=typeof r;return"object"==e||"function"==e},memoizeCappedUnary=function(r,e){const t=new Map,n=function(n){if(t.has(n))return t.get(n);const o=r(n);return t.set(n,o),t.size>e&&t.clear(),o};return n.cache=t,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],n="]"==r[e];return t&&n?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):n?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),n=t.length;let o=-1,i=r;for(;++o<n;)if(i=i[t[o]],null==i)return;return i},_get=function(r,e,t){const n=null==r?void 0:getByPath(r,e);return void 0===n?"function"==typeof t?t(r):t:n},get=function(r,e,t){return null!=(n=r)&&"function"==typeof n.then?r.then(curry3(_get,__,e,t)):isObject(r)&&!isArray(r)?_get(r,e,t):curry3(_get,__,r,e);var n};export default get;

package/dist/gt.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let o=-1;for(;++o<e;){const e=r[o];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,o,s)=>function(t){return r(t,e,o,s)},curry4ResolveArg1=(r,e,o,s)=>function(t){return r(e,t,o,s)},curry4ResolveArg2=(r,e,o,s)=>function(t){return r(e,o,t,s)},curry4ResolveArg3=(r,e,o,s)=>function(t){return r(e,o,s,t)},curry4=function(r,e,o,s,t){return e==__?curry4ResolveArg0(r,o,s,t):o==__?curry4ResolveArg1(r,e,s,t):s==__?curry4ResolveArg2(r,e,o,t):curry4ResolveArg3(r,e,o,s)},curryArgs4ResolveArgs0=(r,e,o,s)=>function(...t){return r(t,e,o,s)},curryArgs4ResolveArgs1=(r,e,o,s)=>function(...t){return r(e,t,o,s)},curryArgs4ResolveArgs2=(r,e,o,s)=>function(...t){return r(e,o,t,s)},curryArgs4ResolveArgs3=(r,e,o,s)=>function(...t){return r(e,o,s,t)},curryArgs4=function(r,e,o,s,t){return e==__?curryArgs4ResolveArgs0(r,o,s,t):o==__?curryArgs4ResolveArgs1(r,e,s,t):s==__?curryArgs4ResolveArgs2(r,e,o,t):curryArgs4ResolveArgs3(r,e,o,s)},spread2=r=>function([e,o]){return r(e,o)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,o,s){const t=o(...r),l=s(...r);return isPromise(t)||isPromise(l)?promiseAll([t,l]).then(spread2(e)):e(t,l)},leftResolverRightValueCompare=function(r,e,o,s){const t=o(...r);return isPromise(t)||isPromise(s)?promiseAll([t,s]).then(spread2(e)):e(t,s)},leftValueRightResolverCompare=function(r,e,o,s){const t=s(...r);return isPromise(o)||isPromise(t)?promiseAll([o,t]).then(spread2(e)):e(o,t)},ComparisonOperator=r=>function(...e){const o=e.pop(),s=e.pop(),t="function"==typeof s,l="function"==typeof o;return t&&l?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,s,o)):leftResolverRightResolverCompare(e,r,s,o):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,s,o)):leftResolverRightValueCompare(e,r,s,o):l?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,s,o)):leftValueRightResolverCompare(e,r,s,o):isPromise(s)||isPromise(o)?promiseAll([s,o]).then(spread2(r)):r(s,o)},greaterThan=(r,e)=>r>e,gt=ComparisonOperator(greaterThan);export default gt;

package/dist/gte.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let o=-1;for(;++o<e;){const e=r[o];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,o,s)=>function(t){return r(t,e,o,s)},curry4ResolveArg1=(r,e,o,s)=>function(t){return r(e,t,o,s)},curry4ResolveArg2=(r,e,o,s)=>function(t){return r(e,o,t,s)},curry4ResolveArg3=(r,e,o,s)=>function(t){return r(e,o,s,t)},curry4=function(r,e,o,s,t){return e==__?curry4ResolveArg0(r,o,s,t):o==__?curry4ResolveArg1(r,e,s,t):s==__?curry4ResolveArg2(r,e,o,t):curry4ResolveArg3(r,e,o,s)},curryArgs4ResolveArgs0=(r,e,o,s)=>function(...t){return r(t,e,o,s)},curryArgs4ResolveArgs1=(r,e,o,s)=>function(...t){return r(e,t,o,s)},curryArgs4ResolveArgs2=(r,e,o,s)=>function(...t){return r(e,o,t,s)},curryArgs4ResolveArgs3=(r,e,o,s)=>function(...t){return r(e,o,s,t)},curryArgs4=function(r,e,o,s,t){return e==__?curryArgs4ResolveArgs0(r,o,s,t):o==__?curryArgs4ResolveArgs1(r,e,s,t):s==__?curryArgs4ResolveArgs2(r,e,o,t):curryArgs4ResolveArgs3(r,e,o,s)},spread2=r=>function([e,o]){return r(e,o)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,o,s){const t=o(...r),l=s(...r);return isPromise(t)||isPromise(l)?promiseAll([t,l]).then(spread2(e)):e(t,l)},leftResolverRightValueCompare=function(r,e,o,s){const t=o(...r);return isPromise(t)||isPromise(s)?promiseAll([t,s]).then(spread2(e)):e(t,s)},leftValueRightResolverCompare=function(r,e,o,s){const t=s(...r);return isPromise(o)||isPromise(t)?promiseAll([o,t]).then(spread2(e)):e(o,t)},ComparisonOperator=r=>function(...e){const o=e.pop(),s=e.pop(),t="function"==typeof s,l="function"==typeof o;return t&&l?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,s,o)):leftResolverRightResolverCompare(e,r,s,o):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,s,o)):leftResolverRightValueCompare(e,r,s,o):l?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,s,o)):leftValueRightResolverCompare(e,r,s,o):isPromise(s)||isPromise(o)?promiseAll([s,o]).then(spread2(r)):r(s,o)},greaterThanOrEqual=(r,e)=>r>=e,gte=ComparisonOperator(greaterThanOrEqual);export default gte;

package/dist/lt.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(l){return r(l,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(l){return r(e,l,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(l){return r(e,s,l,o)},curry4ResolveArg3=(r,e,s,o)=>function(l){return r(e,s,o,l)},curry4=function(r,e,s,o,l){return e==__?curry4ResolveArg0(r,s,o,l):s==__?curry4ResolveArg1(r,e,o,l):o==__?curry4ResolveArg2(r,e,s,l):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...l){return r(l,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...l){return r(e,l,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...l){return r(e,s,l,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...l){return r(e,s,o,l)},curryArgs4=function(r,e,s,o,l){return e==__?curryArgs4ResolveArgs0(r,s,o,l):s==__?curryArgs4ResolveArgs1(r,e,o,l):o==__?curryArgs4ResolveArgs2(r,e,s,l):curryArgs4ResolveArgs3(r,e,s,o)},spread2=r=>function([e,s]){return r(e,s)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,s,o){const l=s(...r),t=o(...r);return isPromise(l)||isPromise(t)?promiseAll([l,t]).then(spread2(e)):e(l,t)},leftResolverRightValueCompare=function(r,e,s,o){const l=s(...r);return isPromise(l)||isPromise(o)?promiseAll([l,o]).then(spread2(e)):e(l,o)},leftValueRightResolverCompare=function(r,e,s,o){const l=o(...r);return isPromise(s)||isPromise(l)?promiseAll([s,l]).then(spread2(e)):e(s,l)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),l="function"==typeof o,t="function"==typeof s;return l&&t?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):l?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):t?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,o,s)):leftValueRightResolverCompare(e,r,o,s):isPromise(o)||isPromise(s)?promiseAll([o,s]).then(spread2(r)):r(o,s)},lessThan=(r,e)=>r<e,lt=ComparisonOperator(lessThan);export default lt;

package/dist/lte.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(l){return r(l,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(l){return r(e,l,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(l){return r(e,s,l,o)},curry4ResolveArg3=(r,e,s,o)=>function(l){return r(e,s,o,l)},curry4=function(r,e,s,o,l){return e==__?curry4ResolveArg0(r,s,o,l):s==__?curry4ResolveArg1(r,e,o,l):o==__?curry4ResolveArg2(r,e,s,l):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...l){return r(l,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...l){return r(e,l,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...l){return r(e,s,l,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...l){return r(e,s,o,l)},curryArgs4=function(r,e,s,o,l){return e==__?curryArgs4ResolveArgs0(r,s,o,l):s==__?curryArgs4ResolveArgs1(r,e,o,l):o==__?curryArgs4ResolveArgs2(r,e,s,l):curryArgs4ResolveArgs3(r,e,s,o)},spread2=r=>function([e,s]){return r(e,s)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,s,o){const l=s(...r),t=o(...r);return isPromise(l)||isPromise(t)?promiseAll([l,t]).then(spread2(e)):e(l,t)},leftResolverRightValueCompare=function(r,e,s,o){const l=s(...r);return isPromise(l)||isPromise(o)?promiseAll([l,o]).then(spread2(e)):e(l,o)},leftValueRightResolverCompare=function(r,e,s,o){const l=o(...r);return isPromise(s)||isPromise(l)?promiseAll([s,l]).then(spread2(e)):e(s,l)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),l="function"==typeof o,t="function"==typeof s;return l&&t?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):l?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):t?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,o,s)):leftValueRightResolverCompare(e,r,o,s):isPromise(o)||isPromise(s)?promiseAll([o,s]).then(spread2(r)):r(o,s)},lessThanOrEqual=(r,e)=>r<=e,lte=ComparisonOperator(lessThanOrEqual);export default lte;

package/dist/map.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,symbolIterator=Symbol.iterator,MappingIterator=(r,t)=>({toString:()=>"[object MappingIterator]",[symbolIterator](){return this},next(){const n=r.next();return n.done?n:{value:t(n.value),done:!1}}}),NextIteration=r=>({value:r,done:!1}),symbolAsyncIterator=Symbol.asyncIterator,MappingAsyncIterator=(r,t)=>({[symbolAsyncIterator](){return this},async next(){const n=await r.next();if(n.done)return n;const e=t(n.value);return isPromise(e)?e.then(NextIteration):{value:e,done:!1}}}),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(n){return r(n,t)},curry2ResolveArg1=(r,t)=>function(n){return r(t,n)},curry2=function(r,t,n){return t==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,t)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const t=typeof r;return"object"==t||"function"==t},promiseAll=Promise.all.bind(Promise),arrayMap=function(r,t){const n=r.length,e=Array(n);let o=-1,c=!1;for(;++o<n;){const n=t(r[o],o,r);isPromise(n)&&(c=!0),e[o]=n}return c?promiseAll(e):e},curry3ResolveArg0=(r,t,n)=>function(e){return r(e,t,n)},curry3ResolveArg1=(r,t,n)=>function(e){return r(t,e,n)},curry3ResolveArg2=(r,t,n)=>function(e){return r(t,n,e)},curry3=function(r,t,n,e){return t==__?curry3ResolveArg0(r,n,e):n==__?curry3ResolveArg1(r,t,e):curry3ResolveArg2(r,t,n)},callPropUnary=(r,t,n)=>r[t](n),stringMap=function(r,t){const n=arrayMap(r,t);return isPromise(n)?n.then(curry3(callPropUnary,__,"join","")):n.join("")},always=r=>function(){return r},setMap=function(r,t){const n=new Set,e=[];for(const o of r){const c=t(o,o,r);isPromise(c)?e.push(c.then(curry3(callPropUnary,n,"add",__))):n.add(c)}return 0==e.length?n:promiseAll(e).then(always(n))},curry4ResolveArg0=(r,t,n,e)=>function(o){return r(o,t,n,e)},curry4ResolveArg1=(r,t,n,e)=>function(o){return r(t,o,n,e)},curry4ResolveArg2=(r,t,n,e)=>function(o){return r(t,n,o,e)},curry4ResolveArg3=(r,t,n,e)=>function(o){return r(t,n,e,o)},curry4=function(r,t,n,e,o){return t==__?curry4ResolveArg0(r,n,e,o):n==__?curry4ResolveArg1(r,t,e,o):e==__?curry4ResolveArg2(r,t,n,o):curry4ResolveArg3(r,t,n,e)},callPropBinary=(r,t,n,e)=>r[t](n,e),mapMap=function(r,t){const n=new Map,e=[];for(const[o,c]of r){const s=t(c,o,r);isPromise(s)?e.push(s.then(curry4(callPropBinary,n,"set",o,__))):n.set(o,s)}return 0==e.length?n:promiseAll(e).then(always(n))},promiseObjectAllExecutor=r=>function(t){const n={};let e=0;for(const o in r){const c=r[o];isPromise(c)?(e+=1,c.then((r=>function(o){n[r]=o,e-=1,0==e&&t(n)})(o))):n[o]=c}0==e&&t(n)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),objectMap=function(r,t){const n={};let e=!1;for(const o in r){const c=t(r[o],o,r);isPromise(c)&&(e=!0),n[o]=c}return e?promiseObjectAll(n):n},funcConcat=(r,t)=>function(...n){const e=r(...n);return isPromise(e)?e.then(t):t(e)},objectSet=function(r,t,n){return r[t]=n,r},arrayMapSeriesAsync=async function(r,t,n,e){const o=r.length;for(;++e<o;){const o=t(r[e]);n[e]=isPromise(o)?await o:o}return n},arrayMapSeries=function(r,t){const n=r.length,e=Array(n);let o=-1;for(;++o<n;){const n=t(r[o]);if(isPromise(n))return n.then(funcConcat(curry3(objectSet,e,o,__),curry4(arrayMapSeriesAsync,r,t,__,o)));e[o]=n}return e},tapSync=r=>function(...t){return r(...t),t[0]},promiseRace=Promise.race.bind(Promise),arrayMapPoolAsync=async function(r,t,n,e,o,c){const s=r.length;for(;++o<s;){c.size>=n&&await promiseRace(c);const s=t(r[o]);if(isPromise(s)){const r=s.then(tapSync((()=>c.delete(r))));c.add(r),e[o]=r}else e[o]=s}return promiseAll(e)},arrayMapPool=function(r,t,n){const e=r.length,o=Array(e);let c=-1;for(;++c<e;){const e=t(r[c]);if(isPromise(e)){const s=new Set,a=e.then(tapSync((()=>s.delete(a))));return s.add(a),o[c]=a,arrayMapPoolAsync(r,t,n,o,c,s)}o[c]=e}return o},_curryArity=(r,t,n)=>function(...e){const o=n.length,c=e.length,s=[];let a=-1,i=-1,u=0;for(;++a<o;){const o=n[a];if(o==__&&(i+=1)<c){const r=e[i];r==__&&(u+=1),s.push(r)}else s.push(o);if(s.length==r)return 0==u?t(...s):curryArity(r,t,s)}for(;++i<c;){const n=e[i];if(n==__&&(u+=1),s.push(n),s.length==r)return 0==u?t(...s):curryArity(r,t,s)}return curryArity(r,t,s)},curryArity=function(r,t,n){const e=n.length;if(e<r)return _curryArity(r,t,n);let o=-1;for(;++o<e;){if(n[o]==__)return _curryArity(r,t,n)}return t(...n)},spread2=r=>function([t,n]){return r(t,n)},objectMapEntries=function(r,t){const n={},e=[];for(const o in r){const c=t([o,r[o]]);isPromise(c)?e.push(c.then(spread2(curryArity(3,objectSet,[n])))):n[c[0]]=c[1]}return 0==e.length?n:promiseAll(e).then(always(n))},mapSet=function(r,t,n){return r.set(t,n)},mapMapEntriesForEachCallback=(r,t,n)=>function(e,o){const c=r([o,e]);isPromise(c)?n.push(c.then(spread2(curryArity(3,mapSet,[t])))):t.set(c[0],c[1])},mapMapEntries=function(r,t){const n=new Map,e=[];return r.forEach(mapMapEntriesForEachCallback(t,n,e)),0==e.length?n:promiseAll(e).then(always(n))},_map=function(r,t){return isArray(r)?arrayMap(r,t):null==r?r:"function"==typeof r.then?r.then(t):"function"==typeof r.map?r.map(t):"string"==typeof r||r.constructor==String?stringMap(r,t):r.constructor==Set?setMap(r,t):r.constructor==Map?mapMap(r,t):"function"==typeof r[symbolIterator]?MappingIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?MappingAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectMap(r,t):t(r)},map=(...r)=>{const t=r.pop();if(0==r.length)return curry2(_map,__,t);const n=r[0];return isPromise(n)?n.then(curry2(_map,__,t)):_map(n,t)};map.entries=function(r){return function(t){if(null==t)throw new TypeError("value is not an Object or Map");if(t.constructor==Object)return objectMapEntries(t,r);if(t.constructor==Map)return mapMapEntries(t,r);throw new TypeError("value is not an Object or Map")}},map.series=r=>function(t){if(isArray(t))return arrayMapSeries(t,r);throw new TypeError(`${t} is not an Array`)},map.pool=(r,t)=>function(n){if(isArray(n))return arrayMapPool(n,t,r);throw new TypeError(`${n} is not an Array`)};export default map;

package/dist/not.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),__=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)},curryArgs2ResolveArgs0=(r,e,n)=>function(...n){return r(n,e)},curryArgs2ResolveArgs1=(r,e,n)=>function(...n){return r(e,n)},curryArgs2=function(r,e,n){return e==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,e)},negate=r=>!r,_not=function(r,e){const n=e(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const e=r.pop();return"function"==typeof e?0==r.length?(n=_not,s=e,(o=__)==__?curryArgs2ResolveArgs0(n,s):curryArgs2ResolveArgs1(n,o)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,e)):_not(r,e):!e;var n,o,s};export default not;

package/dist/omit.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,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 i=t[n];null!=c&&i in c&&delete c[i]},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):null!=(t=r)&&"function"==typeof t.then?r.then(curry2(_omit,__,e)):_omit(r,e);var t};export default omit;

package/dist/or.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const promiseAll=Promise.all.bind(Promise),isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const n=r.length;let e=-1;for(;++e<n;){const n=r[e];if(isPromise(n))return!0}return!1},__=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)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},curryArgs2ResolveArgs0=(r,n,e)=>function(...e){return r(e,n)},curryArgs2ResolveArgs1=(r,n,e)=>function(...e){return r(n,e)},curryArgs2=function(r,n,e){return n==__?curryArgs2ResolveArgs0(r,e):curryArgs2ResolveArgs1(r,n)},thunkConditional=(r,n,e)=>r?n():e(),areAllValuesNonfunctions=function(r){const n=r.length;let e=-1;for(;++e<n;)if("function"==typeof r[e])return!1;return!0},thunkify2=(r,n,e)=>function(){return r(n,e)},thunkify3=(r,n,e,t)=>function(){return r(n,e,t)},always=r=>function(){return r},areAnyNonfunctionsTruthy=function(r,n){const e=r.length;for(;++n<e;){const e=r[n];if(isPromise(e))return e.then(curry3(thunkConditional,__,always(!0),thunkify2(areAnyNonfunctionsTruthy,r,n)));if(e)return!0}return!1},asyncAreAnyPredicatesTruthy=async function(r,n,e){const t=n.length;for(;++e<t;){let t=n[e];if("function"==typeof t&&(t=t(...r)),isPromise(t)&&(t=await t),t)return!0}return!1},areAnyPredicatesTruthy=function(r,n){const e=n.length;let t=-1;for(;++t<e;){let e=n[t];if("function"==typeof e&&(e=e(...r)),isPromise(e))return e.then(curry3(thunkConditional,__,always(!0),thunkify3(asyncAreAnyPredicatesTruthy,r,n,t)));if(e)return!0}return!1},or=function(...r){const n=r.pop();return areAllValuesNonfunctions(n)?areAnyNonfunctionsTruthy(n,-1):0==r.length?(e=areAnyPredicatesTruthy,u=n,(t=__)==__?curryArgs2ResolveArgs0(e,u):curryArgs2ResolveArgs1(e,t)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(areAnyPredicatesTruthy,__,n)):areAnyPredicatesTruthy(r,n);var e,t,u};export default or;

package/dist/pick.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,memoizeCappedUnary=function(r,t){const e=new Map,n=function(n){if(e.has(n))return e.get(n);const i=r(n);return e.set(n,i),e.size>t&&e.clear(),i};return n.cache=e,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const t=r.length-1,e="["==r[0],n="]"==r[t];return e&&n?r.slice(1,t).split(pathDelimiters):e?r.slice(1).split(pathDelimiters):n?r.slice(0,t).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,t){const e=propertyPathToArray(t),n=e.length;let i=-1,o=r;for(;++i<n;)if(o=o[e[i]],null==o)return;return o},isObject=r=>{if(null==r)return!1;const t=typeof r;return"object"==t||"function"==t},setByPath=function(r,t,e){if(!isObject(r))return r;const n=propertyPathToArray(e),i=n.length,o=i-1,c={...r};let s=c,l=-1;for(;++l<i;){const r=n[l];if(l==o)s[r]=t;else{const t=s[r],e=isArray(t)?t.slice():{...t};s[r]=e,s=e}}return c},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(e){return r(e,t)},curry2ResolveArg1=(r,t)=>function(e){return r(t,e)},curry2=function(r,t,e){return t==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,t)},_pick=function(r,t){if(null==r)return r;const e=t.length;let n={},i=-1;for(;++i<e;){const e=t[i],o=getByPath(r,e);null!=o&&(n=setByPath(n,o,e))}return n},pick=function(r,t){return null==t?curry2(_pick,__,r):null!=(e=r)&&"function"==typeof e.then?r.then(curry2(_pick,__,t)):_pick(r,t);var e};export default pick;

package/dist/pipe.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},funcApply=(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)},pipe=function(...r){const e=r.pop().reduce(funcConcat);return 0==r.length?e:areAnyValuesPromises(r)?promiseAll(r).then((n=funcApply,t=__,(o=e)==__?curry2ResolveArg0(n,t):curry2ResolveArg1(n,o))):e(...r);var n,o,t};export default pipe;

package/dist/reduce.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v2.0.0
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=r=>null!=r&&"function"==typeof r.then,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,n)=>function(t){return r(t,e,n)},curry3ResolveArg1=(r,e,n)=>function(t){return r(e,t,n)},curry3ResolveArg2=(r,e,n)=>function(t){return r(e,n,t)},curry3=function(r,e,n,t){return e==__?curry3ResolveArg0(r,n,t):n==__?curry3ResolveArg1(r,e,t):curry3ResolveArg2(r,e,n)},isArray=Array.isArray,objectValues=Object.values,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,iteratorReduceAsync=async function(r,e,n){let t=r.next();if(t.done)return n;for(;!t.done;)n=e(n,t.value),isPromise(n)&&(n=await n),t=r.next();return n},iteratorReduce=function(r,e,n){let t=r.next();if(t.done)return n;for(void 0===n&&(n=t.value,t=r.next());!t.done;){if(n=e(n,t.value),isPromise(n))return n.then(curry3(iteratorReduceAsync,r,e,__));t=r.next()}return n},asyncIteratorReduce=async function(r,e,n){let t=await r.next();if(t.done)return n;for(void 0===n&&(n=t.value,t=await r.next());!t.done;)n=await e(n,t.value),t=await r.next();return n},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,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)},curryArgs3ResolveArgs0=(r,e,n)=>function(...t){return r(t,e,n)},curryArgs3ResolveArgs1=(r,e,n)=>function(...t){return r(e,t,n)},curryArgs3ResolveArgs2=(r,e,n)=>function(...t){return r(e,n,t)},curryArgs3=function(r,e,n,t){return e==__?curryArgs3ResolveArgs0(r,n,t):n==__?curryArgs3ResolveArgs1(r,e,t):curryArgs3ResolveArgs2(r,e,n)},curry4ResolveArg0=(r,e,n,t)=>function(o){return r(o,e,n,t)},curry4ResolveArg1=(r,e,n,t)=>function(o){return r(e,o,n,t)},curry4ResolveArg2=(r,e,n,t)=>function(o){return r(e,n,o,t)},curry4ResolveArg3=(r,e,n,t)=>function(o){return r(e,n,t,o)},curry4=function(r,e,n,t,o){return e==__?curry4ResolveArg0(r,n,t,o):n==__?curry4ResolveArg1(r,e,t,o):t==__?curry4ResolveArg2(r,e,n,o):curry4ResolveArg3(r,e,n,t)},arrayReduceAsync=async function(r,e,n,t){const o=r.length;for(;++t<o;)n=e(n,r[t],t,r),isPromise(n)&&(n=await n);return n},arrayReduce=function(r,e,n){const t=r.length;let o=-1;for(void 0===n&&(n=r[++o]);++o<t;)if(n=e(n,r[o],o,r),isPromise(n))return n.then(curry4(arrayReduceAsync,r,e,__,o));return n},curry5ResolveArg0=(r,e,n,t,o)=>function(c){return r(c,e,n,t,o)},curry5ResolveArg1=(r,e,n,t,o)=>function(c){return r(e,c,n,t,o)},curry5ResolveArg2=(r,e,n,t,o)=>function(c){return r(e,n,c,t,o)},curry5ResolveArg3=(r,e,n,t,o)=>function(c){return r(e,n,t,c,o)},curry5ResolveArg4=(r,e,n,t,o)=>function(c){return r(e,n,t,o,c)},curry5=function(r,e,n,t,o,c){return e==__?curry5ResolveArg0(r,n,t,o,c):n==__?curry5ResolveArg1(r,e,t,o,c):t==__?curry5ResolveArg2(r,e,n,o,c):o==__?curry5ResolveArg3(r,e,n,t,c):curry5ResolveArg4(r,e,n,t,o)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,n,t,o){const c=t.length;for(;++o<c;){const c=t[o];n=e(n,r[c],c,r),isPromise(n)&&(n=await n)}return n},objectReduce=function(r,e,n){const t=objectKeys(r),o=t.length;let c=-1;for(void 0===n&&(n=r[t[++c]]);++c<o;){const o=t[c];if(n=e(n,r[o],o,r),isPromise(n))return n.then((u=objectReduceAsync,i=e,y=__,a=t,f=c,(s=r)==__?curry5ResolveArg0(u,i,y,a,f):i==__?curry5ResolveArg1(u,s,y,a,f):y==__?curry5ResolveArg2(u,s,i,a,f):a==__?curry5ResolveArg3(u,s,i,y,f):curry5ResolveArg4(u,s,i,y,a)))}var u,s,i,y,a,f;return n},mapReduceAsync=async function(r,e,n,t){for(const[o,c]of t)n=e(n,c,o,r),isPromise(n)&&(n=await n);return n},mapReduce=function(r,e,n){const t=r.entries();if(void 0===n){const r=t.next();if(r.done)return n;n=r.value[1]}for(const[o,c]of t)if(n=e(n,c,o,r),isPromise(n))return n.then(curry4(mapReduceAsync,r,e,__,t));return n},reducerConcat=(r,e)=>function(n,t){const o=r(n,t);return isPromise(o)?o.then(curry2(e,__,t)):e(o,t)},genericReduce=function(r,e,n){return isArray(r)?arrayReduce(r,e,n):null==r?void 0===n?curry2(e,r,__):e(n,r):r.constructor==Map?mapReduce(r,e,n):"function"==typeof r[symbolIterator]?iteratorReduce(r[symbolIterator](),e,n):"function"==typeof r[symbolAsyncIterator]?asyncIteratorReduce(r[symbolAsyncIterator](),e,n):"function"==typeof r.reduce?r.reduce(e,n):"function"==typeof r.chain?r.chain(curry2(e,n,__)):"function"==typeof r.flatMap?r.flatMap(curry2(e,n,__)):r.constructor==Object?objectReduce(r,e,n):void 0===n?curry2(e,r,__):e(n,r)},_reduce=function(r,e,n){if("function"==typeof n){const t=n(r);return isPromise(t)?t.then(curry3(genericReduce,r,e,__)):genericReduce(r,e,t)}return isPromise(n)?n.then(curry3(genericReduce,r,e,__)):genericReduce(r,e,n)},reduce=function(...r){return"function"==typeof r[0]?curry3(_reduce,__,r[0],r[1]):isPromise(r[0])?r[0].then(curry3(_reduce,__,r[1],r[2])):_reduce(r[0],r[1],r[2])};export default reduce;