rubico 2.4.1 → 2.5.0

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.4.1
+ * rubico v2.5.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const EmptyMap=()=>new Map,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(u){return r(u,e,n,t,o)},curry5ResolveArg1=(r,e,n,t,o)=>function(u){return r(e,u,n,t,o)},curry5ResolveArg2=(r,e,n,t,o)=>function(u){return r(e,n,u,t,o)},curry5ResolveArg3=(r,e,n,t,o)=>function(u){return r(e,n,t,u,o)},curry5ResolveArg4=(r,e,n,t,o)=>function(u){return r(e,n,t,o,u)},curry5=function(r,e,n,t,o,u){return e==__?curry5ResolveArg0(r,n,t,o,u):n==__?curry5ResolveArg1(r,e,t,o,u):t==__?curry5ResolveArg2(r,e,n,o,u):o==__?curry5ResolveArg3(r,e,n,t,u):curry5ResolveArg4(r,e,n,t,o)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,n,t,o){const u=t.length;for(;++o<u;){const u=t[o];n=e(n,r[u],u,r),isPromise(n)&&(n=await n)}return n},objectReduce=function(r,e,n){const t=objectKeys(r),o=t.length;let u=-1;for(void 0===n&&(n=r[t[++u]]);++u<o;){const o=t[u];if(n=e(n,r[o],o,r),isPromise(n))return n.then((c=objectReduceAsync,i=e,y=__,a=t,f=u,(s=r)==__?curry5ResolveArg0(c,i,y,a,f):i==__?curry5ResolveArg1(c,s,y,a,f):y==__?curry5ResolveArg2(c,s,i,a,f):a==__?curry5ResolveArg3(c,s,i,y,f):curry5ResolveArg4(c,s,i,y,a)))}var c,s,i,y,a,f;return n},mapReduceAsync=async function(r,e,n,t){for(const[o,u]of t)n=e(n,u,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,u]of t)if(n=e(n,u,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])},group=function(r,e,n){const t=r.get(e);return null==t?r.set(e,[n]):t.push(n),r},groupByProperty=r=>function(e,n){return group(e,n[r],n)},groupByResolver=r=>function(e,n){const t=r(n);return isPromise(t)?t.then(curry3(group,e,__,n)):group(e,t,n)},groupBy=r=>{return reduce("function"==typeof r?(n=r,function(r,e){const t=n(e);return isPromise(t)?t.then(curry3(group,r,__,e)):group(r,t,e)}):(e=r,function(r,n){return group(r,n[e],n)}),EmptyMap);var e,n};export default groupBy;
+const EmptyMap=()=>new Map,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(curry5(objectReduceAsync,r,e,__,t,c))}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])},group=function(r,e,n){const t=r.get(e);return null==t?r.set(e,[n]):t.push(n),r},groupByProperty=r=>function(e,n){return group(e,n[r],n)},groupByResolver=r=>function(e,n){const t=r(n);return isPromise(t)?t.then(curry3(group,e,__,n)):group(e,t,n)},groupBy=r=>reduce("function"==typeof r?groupByResolver(r):groupByProperty(r),EmptyMap);export default groupBy;

package/dist/x/groupBy.js

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

package/dist/x/groupBy.min.js

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

package/dist/x/groupBy.mjs

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

package/dist/x/has.es.js

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

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

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

package/dist/x/has.js

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

package/dist/x/has.min.js

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

package/dist/x/has.mjs

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

package/dist/x/identity.es.js

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

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

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

package/dist/x/identity.js

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

package/dist/x/identity.min.js

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

package/dist/x/identity.mjs

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

package/dist/x/includes.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.4.1
+ * rubico v2.5.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isArray=Array.isArray,sameValueZero=function(n,r){return n===r||n!=n&&r!=r},objectIncludes=function(n,r){for(const u in n)if(e=r,t=n[u],e===t||e!=e&&t!=t)return!0;var e,t;return!1},includes=n=>function(r){return null!=r&&("function"==typeof r.includes?r.includes(n):r.constructor==Object&&objectIncludes(r,n))};export default includes;
+const isArray=Array.isArray,sameValueZero=function(n,e){return n===e||n!=n&&e!=e},objectIncludes=function(n,e){for(const r in n)if(sameValueZero(e,n[r]))return!0;return!1},includes=n=>function(e){return null!=e&&("function"==typeof e.includes?e.includes(n):e.constructor==Object&&objectIncludes(e,n))};export default includes;

package/dist/x/includes.js

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

package/dist/x/includes.min.js

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

package/dist/x/includes.mjs

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

package/dist/x/isDeepEqual.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.4.1
+ * rubico v2.5.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const __=Symbol.for("placeholder"),isArray=Array.isArray,isPromise=e=>null!=e&&"function"==typeof e.then,promiseAll=Promise.all.bind(Promise),spread2=e=>function([r,t]){return e(r,t)},curry2ResolveArg0=(e,r)=>function(t){return e(t,r)},curry2ResolveArg1=(e,r)=>function(t){return e(r,t)},curry2=function(e,r,t){return r==__?curry2ResolveArg0(e,t):curry2ResolveArg1(e,r)},objectKeysLength=e=>{let r=0;for(const t in e)r+=1;return r},symbolIterator=Symbol.iterator,sameValueZero=function(e,r){return e===r||e!=e&&r!=r},areIteratorsDeepEqual=function(e,r){let t=e.next(),n=r.next();if(t.done!=n.done)return!1;for(;!t.done;){if(!isDeepEqual(t.value,n.value))return!1;t=e.next(),n=r.next()}return n.done},areObjectsDeepEqual=function(e,r){if(objectKeysLength(e)!=objectKeysLength(r))return!1;for(const t in e)if(!isDeepEqual(e[t],r[t]))return!1;return!0},areArraysDeepEqual=function(e,r){const t=e.length;if(r.length!=t)return!1;let n=-1;for(;++n<t;)if(!isDeepEqual(e[n],r[n]))return!1;return!0},areValuesDeepEqual=function(e,r){const t=isArray(e),n=isArray(r);if(t||n)return t&&n&&areArraysDeepEqual(e,r);if(null==e||null==r)return sameValueZero(e,r);const u="string"==typeof e||e.constructor==String,o="string"==typeof r||r.constructor==String;if(u||o)return sameValueZero(e,r);const a="function"==typeof e[symbolIterator],s="function"==typeof r[symbolIterator];if(a||s)return a&&s&&areIteratorsDeepEqual(e[symbolIterator](),r[symbolIterator]());const l=e.constructor==Object,i=r.constructor==Object;return l||i?l&&i&&areObjectsDeepEqual(e,r):sameValueZero(e,r)},isDeepEqual=function(e,r){const t="function"==typeof e,n="function"==typeof r;return t&&n?function(t){const n=e(t),u=r(t),o=isPromise(n),a=isPromise(u);return o&&a?promiseAll([n,u]).then((s=areValuesDeepEqual,function([e,r]){return s(e,r)})):o?n.then(curry2(areValuesDeepEqual,__,u)):a?u.then(curry2(areValuesDeepEqual,n,__)):areValuesDeepEqual(n,u);var s}:t?function(t){const n=e(t);return isPromise(n)?n.then(curry2(areValuesDeepEqual,__,r)):areValuesDeepEqual(n,r)}:n?function(t){const n=r(t);return isPromise(n)?n.then(curry2(areValuesDeepEqual,e,__)):areValuesDeepEqual(e,n)}:areValuesDeepEqual(e,r)};export default isDeepEqual;
+const __=Symbol.for("placeholder"),isArray=Array.isArray,isPromise=e=>null!=e&&"function"==typeof e.then,promiseAll=Promise.all.bind(Promise),spread2=e=>function([r,t]){return e(r,t)},curry2ResolveArg0=(e,r)=>function(t){return e(t,r)},curry2ResolveArg1=(e,r)=>function(t){return e(r,t)},curry2=function(e,r,t){return r==__?curry2ResolveArg0(e,t):curry2ResolveArg1(e,r)},objectKeysLength=e=>{let r=0;for(const t in e)r+=1;return r},symbolIterator=Symbol.iterator,sameValueZero=function(e,r){return e===r||e!=e&&r!=r},areIteratorsDeepEqual=function(e,r){let t=e.next(),n=r.next();if(t.done!=n.done)return!1;for(;!t.done;){if(!isDeepEqual(t.value,n.value))return!1;t=e.next(),n=r.next()}return n.done},areObjectsDeepEqual=function(e,r){if(objectKeysLength(e)!=objectKeysLength(r))return!1;for(const t in e)if(!isDeepEqual(e[t],r[t]))return!1;return!0},areArraysDeepEqual=function(e,r){const t=e.length;if(r.length!=t)return!1;let n=-1;for(;++n<t;)if(!isDeepEqual(e[n],r[n]))return!1;return!0},areValuesDeepEqual=function(e,r){const t=isArray(e),n=isArray(r);if(t||n)return t&&n&&areArraysDeepEqual(e,r);if(null==e||null==r)return sameValueZero(e,r);const u="string"==typeof e||e.constructor==String,o="string"==typeof r||r.constructor==String;if(u||o)return sameValueZero(e,r);const a="function"==typeof e[symbolIterator],s="function"==typeof r[symbolIterator];if(a||s)return a&&s&&areIteratorsDeepEqual(e[symbolIterator](),r[symbolIterator]());const l=e.constructor==Object,i=r.constructor==Object;return l||i?l&&i&&areObjectsDeepEqual(e,r):sameValueZero(e,r)},isDeepEqual=function(e,r){const t="function"==typeof e,n="function"==typeof r;return t&&n?function(t){const n=e(t),u=r(t),o=isPromise(n),a=isPromise(u);return o&&a?promiseAll([n,u]).then(spread2(areValuesDeepEqual)):o?n.then(curry2(areValuesDeepEqual,__,u)):a?u.then(curry2(areValuesDeepEqual,n,__)):areValuesDeepEqual(n,u)}:t?function(t){const n=e(t);return isPromise(n)?n.then(curry2(areValuesDeepEqual,__,r)):areValuesDeepEqual(n,r)}:n?function(t){const n=r(t);return isPromise(n)?n.then(curry2(areValuesDeepEqual,e,__)):areValuesDeepEqual(e,n)}:areValuesDeepEqual(e,r)};export default isDeepEqual;

package/dist/x/isDeepEqual.js

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

package/dist/x/isDeepEqual.min.js

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

package/dist/x/isDeepEqual.mjs

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

package/dist/x/isEmpty.es.js

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

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

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

package/dist/x/isEmpty.js

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

package/dist/x/isEmpty.min.js

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

package/dist/x/isEmpty.mjs

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

package/dist/x/isEqual.es.js

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

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

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

package/dist/x/isEqual.js

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

package/dist/x/isEqual.min.js

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

package/dist/x/isEqual.mjs

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

package/dist/x/isFunction.es.js

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

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

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

package/dist/x/isFunction.js

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

package/dist/x/isFunction.min.js

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

package/dist/x/isFunction.mjs

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

package/dist/x/isIn.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.4.1
+ * rubico v2.5.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isArray=Array.isArray,sameValueZero=function(r,n){return r===n||r!=r&&n!=n},objectIncludes=function(r,n){for(const c in r)if(e=n,u=r[c],e===u||e!=e&&u!=u)return!0;var e,u;return!1},includes=r=>function(n){return null!=n&&("function"==typeof n.includes?n.includes(r):n.constructor==Object&&objectIncludes(n,r))},__=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)},_isIn=function(r,n){return null!=n&&(n.constructor==Set?n.has(r):n.constructor==Map?Array.from(n.values()).includes(r):includes(r)(n))},isIn=(...r)=>{const n=r.pop();return r.length>0?_isIn(r[0],n):(e=_isIn,c=n,(u=__)==__?curry2ResolveArg0(e,c):curry2ResolveArg1(e,u));var e,u,c};export default isIn;
+const isArray=Array.isArray,sameValueZero=function(r,n){return r===n||r!=r&&n!=n},objectIncludes=function(r,n){for(const e in r)if(sameValueZero(n,r[e]))return!0;return!1},includes=r=>function(n){return null!=n&&("function"==typeof n.includes?n.includes(r):n.constructor==Object&&objectIncludes(n,r))},__=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)},_isIn=function(r,n){return null!=n&&(n.constructor==Set?n.has(r):n.constructor==Map?Array.from(n.values()).includes(r):includes(r)(n))},isIn=(...r)=>{const n=r.pop();return r.length>0?_isIn(r[0],n):curry2(_isIn,__,n)};export default isIn;

package/dist/x/isIn.js

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

package/dist/x/isIn.min.js

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

package/dist/x/isIn.mjs

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

package/dist/x/isObject.es.js

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

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

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

package/dist/x/isObject.js

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

package/dist/x/isObject.min.js

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

package/dist/x/isObject.mjs

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

package/dist/x/isString.es.js

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

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

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

package/dist/x/isString.js

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

package/dist/x/isString.min.js

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

package/dist/x/isString.mjs

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

package/dist/x/keys.es.js

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

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

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

package/dist/x/keys.js

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

package/dist/x/keys.min.js

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

package/dist/x/keys.mjs

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

package/dist/x/last.es.js

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

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

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

package/dist/x/last.js

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

package/dist/x/last.min.js

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

package/dist/x/last.mjs

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

package/dist/x/maxBy.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.4.1
+ * rubico v2.5.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 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,u=r;for(;++o<n;)if(u=u[t[o]],null==u)return;return u},_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"string"==typeof r||"number"==typeof r||isArray(r)?curry3(_get,__,r,e):null!=(n=r)&&"function"==typeof n.then?r.then(curry3(_get,__,e,t)):_get(r,e,t);var c},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)},_maxBy=function(r,e){const t=r.length,n="string"==typeof(o=e)||"number"==typeof o||isArray(o)?curry3(_get,__,o,u):null!=(c=o)&&"function"==typeof c.then?o.then(curry3(_get,__,u,i)):_get(o,u,i);var o,u,i,c;let y=0,s=r[y];for(;++y<t;){const e=r[y];n(e)>n(s)&&(s=e)}return s},maxBy=function(...r){return r.length>1?_maxBy(...r):(e=_maxBy,t=__,n=r[0],t==__?curry2ResolveArg0(e,n):curry2ResolveArg1(e,t));var e,t,n};export default maxBy;
+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,u=r;for(;++o<n;)if(u=u[t[o]],null==u)return;return u},_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"string"==typeof r||"number"==typeof r||isArray(r)?curry3(_get,__,r,e):isPromise(r)?r.then(curry3(_get,__,e,t)):_get(r,e,t)},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)},_maxBy=function(r,e){const t=r.length,n=get(e);let o=0,u=r[o];for(;++o<t;){const e=r[o];n(e)>n(u)&&(u=e)}return u},maxBy=function(...r){return r.length>1?_maxBy(...r):curry2(_maxBy,__,r[0])};export default maxBy;

package/dist/x/maxBy.js

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