rubico 2.3.0 → 2.3.2

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 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 s=r.length-1;for(;++e<o;)r[++s]=n(t[e],e,r);return r},arrayFilterByConditions=function(r,t,n,e){const o=r.length;let s=-1;for(;++n<o;)e[++s]&&t.push(r[n]);return t},arrayFilter=function(r,t){const n=r.length,e=[];let o=-1,s=-1;for(;++o<n;){const n=r[o],i=t(n,o,r);if(isPromise(i))return promiseAll(arrayExtendMap([i],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));i&&(e[++s]=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 s of r){const i=t(s,s,r);isPromise(i)?o.push(i.then(curry3(thunkConditional,__,thunkify1(e,s),noop))):i&&n.add(s)}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,s]of r){const i=t(s,o,r);isPromise(i)?e.push(i.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,s),noop))):i&&n.set(o,s)}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 s=r[o],i=t(s,o,r);isPromise(i)?e.push(i.then(curry4(objectSetIf,n,o,r[o],__))):i&&(n[o]=s)}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?curry2(_filter,__,t):_filter(r[0],t)},areAnyValuesPromises=function(r){const t=r.length;let n=-1;for(;++n<t;){const t=r[n];if(isPromise(t))return!0}return!1},curryArgs2ResolveArgs0=(r,t,n)=>function(...n){return r(n,t)},curryArgs2ResolveArgs1=(r,t,n)=>function(...n){return r(t,n)},curryArgs2=function(r,t,n){return t==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,t)},negate=r=>!r,_not=function(r,t){const n=t(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const t=r.pop();return"function"==typeof t?0==r.length?(n=_not,o=t,(e=__)==__?curryArgs2ResolveArgs0(n,o):curryArgs2ResolveArgs1(n,e)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,t)):_not(r,t):!t;var n,e,o},filterOut=r=>filter(not(r));export default filterOut;

package/dist/x/filterOut.js

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

package/dist/x/filterOut.min.js

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

package/dist/x/filterOut.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const __ = Symbol.for('placeholder')

package/dist/x/find.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,objectValues=Object.values,isPromise=r=>null!=r&&"function"==typeof r.then,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,t)=>function(o){return r(o,n,t)},curry3ResolveArg1=(r,n,t)=>function(o){return r(n,o,t)},curry3ResolveArg2=(r,n,t)=>function(o){return r(n,t,o)},curry3=function(r,n,t,o){return n==__?curry3ResolveArg0(r,t,o):t==__?curry3ResolveArg1(r,n,o):curry3ResolveArg2(r,n,t)},thunkify3=(r,n,t,o)=>function(){return r(n,t,o)},thunkConditional=(r,n,t)=>r?n():t(),always=r=>function(){return r},arrayFindAsync=async function(r,n,t){const o=r.length;for(;++t<o;){const o=r[t];let e=n(o);if(isPromise(e)&&(e=await e),e)return o}},arrayFind=function(r,n){const t=r.length;let o=-1;for(;++o<t;){const t=r[o],e=n(t);if(isPromise(e))return e.then(curry3(thunkConditional,__,always(t),thunkify3(arrayFindAsync,r,n,o)));if(e)return t}},thunkify2=(r,n,t)=>function(){return r(n,t)},iteratorFindAsync=async function(r,n){let t=r.next();for(;!t.done;){const o=t.value;let e=n(o);if(isPromise(e)&&(e=await e),e)return o;t=r.next()}},iteratorFind=function(r,n){let t=r.next();for(;!t.done;){const o=t.value,e=n(o);if(isPromise(e))return e.then(curry3(thunkConditional,__,always(o),thunkify2(iteratorFindAsync,r,n)));if(e)return o;t=r.next()}},asyncIteratorFind=async function(r,n){let t=await r.next();for(;!t.done;){const o=t.value;let e=n(o);if(isPromise(e)&&(e=await e),e)return o;t=await r.next()}},find=r=>function(n){return isArray(n)?arrayFind(n,r):null!=n?"function"==typeof n[symbolIterator]?iteratorFind(n[symbolIterator](),r):"function"==typeof n[symbolAsyncIterator]?asyncIteratorFind(n[symbolAsyncIterator](),r):"function"==typeof n.find?n.find(r):n.constructor==Object?arrayFind(objectValues(n),r):void 0:void 0};export default find;

package/dist/x/find.js

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

package/dist/x/find.min.js

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

package/dist/x/find.mjs

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

package/dist/x/findIndex.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,thunkConditional=(r,n,e)=>r?n():e(),__=Symbol.for("placeholder"),always=r=>function(){return r},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)},thunkify3=(r,n,e,t)=>function(){return r(n,e,t)},findIndexAsync=async function(r,n,e){const t=n.length;for(;++e<t;){let t=r(n[e]);if(isPromise(t)&&(t=await t),t)return e}return-1},findIndex=r=>function(n){const e=n.length;let t=-1;for(;++t<e;){const e=r(n[t]);if(isPromise(e))return e.then((o=thunkConditional,u=__,i=always(t),c=thunkify3(findIndexAsync,r,n,t),u==__?curry3ResolveArg0(o,i,c):i==__?curry3ResolveArg1(o,u,c):curry3ResolveArg2(o,u,i)));if(e)return t}var o,u,i,c;return-1};export default findIndex;

package/dist/x/findIndex.js

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

package/dist/x/findIndex.min.js

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

package/dist/x/findIndex.mjs

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

package/dist/x/first.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const first=t=>null==t?void 0:t[0];export default first;

package/dist/x/first.js

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

package/dist/x/first.min.js

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

package/dist/x/first.mjs

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

package/dist/x/flatten.es.js

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

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

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

package/dist/x/flatten.js

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

package/dist/x/flatten.min.js

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

package/dist/x/flatten.mjs

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

package/dist/x/groupBy.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 // () => Map<>

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (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;

package/dist/x/groupBy.js

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

package/dist/x/groupBy.min.js

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

package/dist/x/groupBy.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 // () => Map<>

package/dist/x/has.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 // (object Object, key string) -> boolean

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const objectHas=function(t,n){return null!=t[n]},has=t=>function(n){return null!=n&&("function"==typeof n.has?n.has(t):n.constructor==Object&&objectHas(n,t))};export default has;

package/dist/x/has.js

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

package/dist/x/has.min.js

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

package/dist/x/has.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 // (object Object, key string) -> boolean

package/dist/x/identity.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const identity=t=>t;export default identity;

package/dist/x/identity.js

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

package/dist/x/identity.min.js

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

package/dist/x/identity.mjs

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

package/dist/x/includes.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (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.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (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;

package/dist/x/includes.js

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

package/dist/x/includes.min.js

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

package/dist/x/includes.mjs

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

package/dist/x/isDeepEqual.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const __ = Symbol.for('placeholder')

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (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;

package/dist/x/isDeepEqual.js

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

package/dist/x/isDeepEqual.min.js

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

package/dist/x/isDeepEqual.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const __ = Symbol.for('placeholder')

package/dist/x/isEmpty.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.3.0
+ * rubico v2.3.2
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2023 Richard Tong
+ * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const objectKeysLength=t=>{let e=0;for(const n in t)e+=1;return e},isEmpty=t=>"string"==typeof t?0==t.length:null==t||("number"==typeof t.length?0==t.length:"number"==typeof t.size?0==t.size:t.constructor==Object&&0==objectKeysLength(t));export default isEmpty;

package/dist/x/isEmpty.js

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