rubico 2.7.7 → 2.7.9

package/dist/x/append.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isString=function(r){return"string"==typeof r||null!=r&&r.constructor==String},isArray=Array.isArray,append=r=>function(n){if(isArray(n))return isArray(r)?[...n,...r]:[...n,r];if(isString(n)){if(!isString(r))throw new TypeError(`${r} is not a string`);return`${n}${r}`}throw new TypeError(`${n} is not an Array or string`)};export default append;

package/dist/x/append.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/append.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/append.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/callProp.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const callProp=(l,...o)=>function(r){return r[l](...o)};export default callProp;

package/dist/x/callProp.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/callProp.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/callProp.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/defaultsDeep.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,__=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)};function arrayDefaultsDeepFromArray(r,e){const t=e.length,o=r.slice();let u=-1;for(;++u<t;){const t=r[u],n=e[u];isArray(t)&&isArray(n)?o[u]=arrayDefaultsDeepFromArray(t,n):null==t?o[u]=n:null==n?o[u]=t:t.constructor==Object&&n.constructor==Object?o[u]=objectDefaultsDeepFromObject(t,n):o[u]=t}return o}function objectDefaultsDeepFromObject(r,e){const t={...r};for(const o in e){const u=r[o],n=e[o];isArray(u)&&isArray(n)?t[o]=arrayDefaultsDeepFromArray(u,n):null==u?t[o]=n:null==n?t[o]=u:u.constructor==Object&&n.constructor==Object?t[o]=objectDefaultsDeepFromObject(u,n):t[o]=u}return t}function _defaultsDeep(r,e){return isArray(r)&&isArray(e)?arrayDefaultsDeepFromArray(r,e):null==r||null==e?r:r.constructor==Object&&e.constructor==Object?objectDefaultsDeepFromObject(r,e):r}function defaultsDeep(...r){if(1==r.length)return curry2(_defaultsDeep,__,r[0]);if(2==r.length)return _defaultsDeep(...r);throw new TypeError("Invalid number of arguments")}export default defaultsDeep;

package/dist/x/defaultsDeep.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/defaultsDeep.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/defaultsDeep.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/differenceWith.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const __=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)},thunkify2=(r,n,e)=>function(){return r(n,e)},thunkify5=(r,n,e,t,o,i)=>function(){return r(n,e,t,o,i)},thunkConditional=(r,n,e)=>r?n():e(),isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,SelfReferencingPromise=function(r){const n=r.then((r=>[r,n]));return n},promiseRace=Promise.race.bind(Promise),asyncArraySome=async function(r,n,e,t){const o=r.length;for(;++e<o;){const o=n(r[e]);if(isPromise(o))t.add(SelfReferencingPromise(o));else if(o)return!0}for(;t.size>0;){const[r,n]=await promiseRace(t);if(t.delete(n),r)return!0}return!1},arraySome=function(r,n){const e=r.length;let t=-1;for(;++t<e;){const e=n(r[t]);if(isPromise(e))return asyncArraySome(r,n,t,new Set([SelfReferencingPromise(e)]));if(e)return!0}return!1},arrayPush=function(r,n){return r.push(n),r},funcConcatSync=(r,n)=>function(...e){return n(r(...e))},noop=function(){},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,differenceWithArrayAsync=async function(r,n,e,t,o){const i=n.length;for(;++o<i;){const i=n[o];let c=arraySome(e,curry2(r,i,__));isPromise(c)&&(c=await c),c||t.push(i)}return t},differenceWithArray=function(r,n,e){const t=n.length,o=[];let i=-1;for(;++i<t;){const t=n[i],c=arraySome(e,curry2(r,t,__));if(isPromise(c))return c.then(funcConcatSync(curry3(thunkConditional,__,noop,thunkify2(arrayPush,o,t)),thunkify5(differenceWithArrayAsync,r,n,e,o,i)));c||o.push(t)}return o},differenceWith=(r,n)=>function(e){if(isArray(e))return differenceWithArray(r,n,e);throw new TypeError(`${e} is not an Array`)};export default differenceWith;

package/dist/x/differenceWith.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/differenceWith.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/differenceWith.mjs

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

package/dist/x/filterOut.es.js

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

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

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

package/dist/x/filterOut.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/filterOut.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/filterOut.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 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.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 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.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/find.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/find.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/findIndex.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 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(curry3(thunkConditional,__,always(t),thunkify3(findIndexAsync,r,n,t)));if(e)return t}return-1};export default findIndex;

package/dist/x/findIndex.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/findIndex.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/findIndex.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/first.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 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.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/first.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/first.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/flatten.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

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

package/dist/x/flatten.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/flatten.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/flatten.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/groupBy.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 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.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 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(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,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/groupBy.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/groupBy.mjs

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

package/dist/x/has.es.js

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