rubico 2.7.9 → 2.8.0

package/dist/x/prepend.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):r.prepend=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=function(r){return"string"==typeof r||null!=r&&r.constructor==String},t=Array.isArray;return n=>function(o){if(t(o))return t(n)?[...n,...o]:[n,...o];if(r(o)){if(!r(n))throw new TypeError(`${n} is not a string`);return`${n}${o}`}throw new TypeError(`${o} is not an Array or string`)}}());
+!function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):r.prepend=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=function(r){return"string"==typeof r||null!=r&&r.constructor==String},t=Array.isArray;return n=>function(o){if(t(o))return t(n)?[...n,...o]:[n,...o];if(r(o)){if(!r(n))throw new TypeError(`${n} is not a string`);return`${n}${o}`}throw new TypeError(`${o} is not an Array or string`)}}());

package/dist/x/prepend.mjs

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

package/dist/x/size.es.js

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

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

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

package/dist/x/size.js

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

package/dist/x/size.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(e,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):e.size=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";return e=>"string"==typeof e?e.length:null==e?0:"number"==typeof e.length?e.length:"number"==typeof e.size?e.size:e.constructor==Object?(e=>{let t=0;for(const n in e)t+=1;return t})(e):1}());
+!function(e,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):e.size=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";return e=>"string"==typeof e?e.length:null==e?0:"number"==typeof e.length?e.length:"number"==typeof e.size?e.size:e.constructor==Object?(e=>{let t=0;for(const n in e)t+=1;return t})(e):1}());

package/dist/x/size.mjs

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

package/dist/x/trace.es.js

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

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

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

package/dist/x/trace.js

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

package/dist/x/trace.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.trace=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},r=(n,t,r)=>n?t():r(),e=Symbol.for("placeholder"),o=function(n,t,r,o){return t==e?((n,t,r)=>function(e){return n(e,t,r)})(n,r,o):r==e?((n,t,r)=>function(e){return n(t,e,r)})(n,t,o):((n,t,r)=>function(e){return n(t,r,e)})(n,t,r)},u=Array.isArray,c=function(t){if(u(t)){const r=t.length;let e=-1;for(;++e<r;){const r=t[e];if(n(r))return!0}return!1}for(const r in t){const e=t[r];if(n(e))return!0}return!1},i=Promise.all.bind(Promise),f=function(r,e){const o=r[0],u=e(...r);return n(u)?u.then(t(o)):o},s=function(...n){const t=n.pop();return 0==n.length?(r=f,u=t,(o=e)==e?((n,t)=>function(...r){return n(r,t)})(r,u):((n,t)=>function(...r){return n(t,r)})(r,o)):c(n)?i(n).then(function(n,t,r){return t==e?((n,t)=>function(r){return n(r,t)})(n,r):((n,t)=>function(r){return n(t,r)})(n,t)}(f,e,t)):f(n,t);var r,o,u},l=function(u,c,i){const f=u(...i);if(n(f))return f.then(o(r,e,((n,t)=>function(){return n(...t)})(s(c),i),t(i[0])));if(f){const r=c(...i);if(n(r))return r.then(t(i[0]))}return i[0]};s.if=function(...n){if(2==n.length)return t=l,r=n[0],u=n[1],f=e,r==e?((n,t,r)=>function(...e){return n(e,t,r)})(t,u,f):u==e?((n,t,r)=>function(...e){return n(t,e,r)})(t,r,f):((n,t,r)=>function(...e){return n(t,r,e)})(t,r,u);var t,r,u,f;const s=n.length,h=n[s-1],a=n[s-2],p=n.slice(0,-2);return c(p)?i(p).then(o(l,a,h,e)):l(a,h,n)};const h=console.log;return function(...t){const r=t[0];return"function"==typeof r?s((e=r,o=h,function(...t){const r=e(...t);return n(r)?r.then(o):o(r)})):s(h)(...t);var e,o}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.trace=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},r=(n,t,r)=>n?t():r(),e=Symbol.for("placeholder"),o=function(n,t,r,o){return t==e?((n,t,r)=>function(e){return n(e,t,r)})(n,r,o):r==e?((n,t,r)=>function(e){return n(t,e,r)})(n,t,o):((n,t,r)=>function(e){return n(t,r,e)})(n,t,r)},u=Array.isArray,c=function(t){if(u(t)){const r=t.length;let e=-1;for(;++e<r;){const r=t[e];if(n(r))return!0}return!1}for(const r in t){const e=t[r];if(n(e))return!0}return!1},i=Promise.all.bind(Promise),f=function(r,e){const o=r[0],u=e(...r);return n(u)?u.then(t(o)):o},s=function(...n){const t=n.pop();return 0==n.length?(r=f,u=t,(o=e)==e?((n,t)=>function(...r){return n(r,t)})(r,u):((n,t)=>function(...r){return n(t,r)})(r,o)):c(n)?i(n).then(function(n,t,r){return t==e?((n,t)=>function(r){return n(r,t)})(n,r):((n,t)=>function(r){return n(t,r)})(n,t)}(f,e,t)):f(n,t);var r,o,u},l=function(u,c,i){const f=u(...i);if(n(f))return f.then(o(r,e,((n,t)=>function(){return n(...t)})(s(c),i),t(i[0])));if(f){const r=c(...i);if(n(r))return r.then(t(i[0]))}return i[0]};s.if=function(...n){if(2==n.length)return t=l,r=n[0],u=n[1],f=e,r==e?((n,t,r)=>function(...e){return n(e,t,r)})(t,u,f):u==e?((n,t,r)=>function(...e){return n(t,e,r)})(t,r,f):((n,t,r)=>function(...e){return n(t,r,e)})(t,r,u);var t,r,u,f;const s=n.length,h=n[s-1],a=n[s-2],p=n.slice(0,-2);return c(p)?i(p).then(o(l,a,h,e)):l(a,h,n)};const h=console.log;return function(...t){const r=t[0];return"function"==typeof r?s((e=r,o=h,function(...t){const r=e(...t);return n(r)?r.then(o):o(r)})):s(h)(...t);var e,o}}());

package/dist/x/trace.mjs

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

package/dist/x/unionWith.es.js

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

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

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

package/dist/x/unionWith.js

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

package/dist/x/unionWith.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.unionWith=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=n=>null!=n&&"function"==typeof n.then,e=Promise.all.bind(Promise),o=Symbol.for("placeholder"),u=function(n,t,e,u){return t==o?((n,t,e)=>function(o){return n(o,t,e)})(n,e,u):e==o?((n,t,e)=>function(o){return n(t,o,e)})(n,t,u):((n,t,e)=>function(o){return n(t,e,o)})(n,t,e)},r=(n,t,e)=>function(){return n(t,e)},f=(n,t,e,o,u)=>function(){return n(t,e,o,u)},c=(n,t)=>function(...e){return t(n(...e))},i=(n,t,e)=>n[t](e),s=(n,t,e)=>n?t():e(),l=function(n,t){return n.push(t),n},h=n=>function(){return n},p=function(n,t,e){return t==o?((n,t)=>function(e){return n(e,t)})(n,e):((n,t)=>function(e){return n(t,e)})(n,t)},a=(n,t)=>t,y=n=>n,g=async function(n,o){const u=[];for await(const e of n){const n=o(e);t(n)&&u.push(n)}return 0==u.length?n:e(u).then(h(n))},b=Symbol.iterator,d=Symbol.asyncIterator,m=function(){},w=function(n,r,f){const c=n.length,s=[];let l=-1;for(;++l<c;){const e=f(r,n[l]);if(t(e))s.push(e);else if(e)return!0}return 0!=s.length&&e(s).then(u(i,o,"some",Boolean))},j=async function(n,e,o,u){const r=n.length;for(;++u<r;){const r=n[u],f=w(o,r,e);(t(f)?await f:f)||o.push(r)}return o};return i=>function(A){if(n(A))return function(n,e){const i=n.length,h=[];let p=-1;for(;++p<i;){const i=n[p],a=w(h,i,e);if(t(a))return a.then(c(u(s,o,m,r(l,h,i)),f(j,n,e,h,p)));a||h.push(i)}return h}(function(u){const r=u.length,f=[],i=[];let s=-1;for(;++s<r;){const e=u[s];if(n(e)){const n=e.length;let t=-1;for(;++t<n;)i.push(e[t])}else if(null==e)i.push(e);else if("function"==typeof e.then)f.push(e.then(p(l,i,o)));else if("function"==typeof e[b])for(const n of e)i.push(n);else if("function"==typeof e[d])f.push(g(e[d](),p(l,i,o)));else if("function"==typeof e.chain){const n=e.chain(y);t(n)?f.push(n.then(p(l,i,o))):i.push(n)}else if("function"==typeof e.flatMap){const n=e.flatMap(y);t(n)?f.push(n.then(p(l,i,o))):i.push(n)}else if("function"==typeof e.reduce){const n=e.reduce(c(a,p(l,i,o)),null);t(n)&&f.push(n)}else if(e.constructor==Object)for(const n in e)i.push(e[n]);else i.push(e)}return 0==f.length?i:e(f).then(h(i))}(A),i);throw new TypeError(`${A} is not an Array`)}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.unionWith=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=n=>null!=n&&"function"==typeof n.then,e=Promise.all.bind(Promise),o=Symbol.for("placeholder"),u=function(n,t,e,u){return t==o?((n,t,e)=>function(o){return n(o,t,e)})(n,e,u):e==o?((n,t,e)=>function(o){return n(t,o,e)})(n,t,u):((n,t,e)=>function(o){return n(t,e,o)})(n,t,e)},r=(n,t,e)=>function(){return n(t,e)},f=(n,t,e,o,u)=>function(){return n(t,e,o,u)},c=(n,t)=>function(...e){return t(n(...e))},i=(n,t,e)=>n[t](e),s=(n,t,e)=>n?t():e(),l=function(n,t){return n.push(t),n},h=n=>function(){return n},p=function(n,t,e){return t==o?((n,t)=>function(e){return n(e,t)})(n,e):((n,t)=>function(e){return n(t,e)})(n,t)},a=(n,t)=>t,y=n=>n,g=async function(n,o){const u=[];for await(const e of n){const n=o(e);t(n)&&u.push(n)}return 0==u.length?n:e(u).then(h(n))},b=Symbol.iterator,d=Symbol.asyncIterator,m=function(){},w=function(n,r,f){const c=n.length,s=[];let l=-1;for(;++l<c;){const e=f(r,n[l]);if(t(e))s.push(e);else if(e)return!0}return 0!=s.length&&e(s).then(u(i,o,"some",Boolean))},j=async function(n,e,o,u){const r=n.length;for(;++u<r;){const r=n[u],f=w(o,r,e);(t(f)?await f:f)||o.push(r)}return o};return i=>function(A){if(n(A))return function(n,e){const i=n.length,h=[];let p=-1;for(;++p<i;){const i=n[p],a=w(h,i,e);if(t(a))return a.then(c(u(s,o,m,r(l,h,i)),f(j,n,e,h,p)));a||h.push(i)}return h}(function(u){const r=u.length,f=[],i=[];let s=-1;for(;++s<r;){const e=u[s];if(n(e)){const n=e.length;let t=-1;for(;++t<n;)i.push(e[t])}else if(null==e)i.push(e);else if("function"==typeof e.then)f.push(e.then(p(l,i,o)));else if("function"==typeof e[b])for(const n of e)i.push(n);else if("function"==typeof e[d])f.push(g(e[d](),p(l,i,o)));else if("function"==typeof e.chain){const n=e.chain(y);t(n)?f.push(n.then(p(l,i,o))):i.push(n)}else if("function"==typeof e.flatMap){const n=e.flatMap(y);t(n)?f.push(n.then(p(l,i,o))):i.push(n)}else if("function"==typeof e.reduce){const n=e.reduce(c(a,p(l,i,o)),null);t(n)&&f.push(n)}else if(e.constructor==Object)for(const n in e)i.push(e[n]);else i.push(e)}return 0==f.length?i:e(f).then(h(i))}(A),i);throw new TypeError(`${A} is not an Array`)}}());

package/dist/x/unionWith.mjs

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

package/dist/x/uniq.es.js

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

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

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

package/dist/x/uniq.js

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

package/dist/x/uniq.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):r.uniq=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=Array.isArray;return t=>{if(!r(t))throw Error("uniq(arr): arr is not an array");return[...new Set(t)]}}());
+!function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):r.uniq=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=Array.isArray;return t=>{if(!r(t))throw Error("uniq(arr): arr is not an array");return[...new Set(t)]}}());

package/dist/x/uniq.mjs

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

package/dist/x/unless.es.js

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

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

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

package/dist/x/unless.js

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

package/dist/x/unless.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.unless=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=(n,t,e)=>n?t():e();return(e,o)=>function(u){const r=e(u);return(n=>null!=n&&"function"==typeof n.then)(r)?r.then((f=t,c=n,i=(n=>function(){return n})(u),l=((n,t)=>function(){return n(t)})(o,u),c==n?((n,t,e)=>function(o){return n(o,t,e)})(f,i,l):i==n?((n,t,e)=>function(o){return n(t,o,e)})(f,c,l):((n,t,e)=>function(o){return n(t,e,o)})(f,c,i))):r?u:o(u);var f,c,i,l}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.unless=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=(n,t,e)=>n?t():e();return(e,o)=>function(u){const r=e(u);return(n=>null!=n&&"function"==typeof n.then)(r)?r.then((f=t,c=n,i=(n=>function(){return n})(u),l=((n,t)=>function(){return n(t)})(o,u),c==n?((n,t,e)=>function(o){return n(o,t,e)})(f,i,l):i==n?((n,t,e)=>function(o){return n(t,o,e)})(f,c,l):((n,t,e)=>function(o){return n(t,e,o)})(f,c,i))):r?u:o(u);var f,c,i,l}}());

package/dist/x/unless.mjs

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

package/dist/x/values.es.js

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

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

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

package/dist/x/values.js

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

package/dist/x/values.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(e,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):e.values=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const e=Object.values;return t=>null==t?[]:"function"==typeof t.values?[...t.values()]:e(t)}());
+!function(e,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):e.values=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const e=Object.values;return t=>null==t?[]:"function"==typeof t.values?[...t.values()]:e(t)}());

package/dist/x/values.mjs

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

package/dist/x/when.es.js

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

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

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

package/dist/x/when.js

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

package/dist/x/when.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.when=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=(n,t,e)=>n?t():e();return(e,o)=>function(u){const r=e(u);return(n=>null!=n&&"function"==typeof n.then)(r)?r.then((f=t,c=n,i=((n,t)=>function(){return n(t)})(o,u),l=(n=>function(){return n})(u),c==n?((n,t,e)=>function(o){return n(o,t,e)})(f,i,l):i==n?((n,t,e)=>function(o){return n(t,o,e)})(f,c,l):((n,t,e)=>function(o){return n(t,e,o)})(f,c,i))):r?o(u):u;var f,c,i,l}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.when=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=(n,t,e)=>n?t():e();return(e,o)=>function(u){const r=e(u);return(n=>null!=n&&"function"==typeof n.then)(r)?r.then((f=t,c=n,i=((n,t)=>function(){return n(t)})(o,u),l=(n=>function(){return n})(u),c==n?((n,t,e)=>function(o){return n(o,t,e)})(f,i,l):i==n?((n,t,e)=>function(o){return n(t,o,e)})(f,c,l):((n,t,e)=>function(o){return n(t,e,o)})(f,c,i))):r?o(u):u;var f,c,i,l}}());

package/dist/x/when.mjs

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

package/es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.7.9
+ * rubico v2.8.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -1062,7 +1062,7 @@ const objectMapPool = function (o, concurrency, f) {
   return result
 }
 
-const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
+const _curryArity = (arity, func, context, args) => function curried(...curriedArgs) {
   const argsLength = args.length,
     curriedArgsLength = curriedArgs.length,
     nextArgs = []
@@ -1083,8 +1083,8 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
     }
     if (nextArgs.length == arity) {
       return numCurriedPlaceholders == 0
-        ? func(...nextArgs)
-        : curryArity(arity, func, nextArgs)
+        ? func.apply(context, nextArgs)
+        : curryArity(arity, func, context, nextArgs)
     }
   }
 
@@ -1096,26 +1096,26 @@ const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
     nextArgs.push(curriedArg)
     if (nextArgs.length == arity) {
       return numCurriedPlaceholders == 0
-        ? func(...nextArgs)
-        : curryArity(arity, func, nextArgs)
+        ? func.apply(context, nextArgs)
+        : curryArity(arity, func, context, nextArgs)
     }
   }
-  return curryArity(arity, func, nextArgs)
+  return curryArity(arity, func, context, nextArgs)
 }
 
-const curryArity = function (arity, func, args) {
+const curryArity = function (arity, func, context, args) {
   const argsLength = args.length
   if (argsLength < arity) {
-    return _curryArity(arity, func, args)
+    return _curryArity(arity, func, context, args)
   }
   let argsIndex = -1
   while (++argsIndex < argsLength) {
     const arg = args[argsIndex]
     if (arg == __) {
-      return _curryArity(arity, func, args)
+      return _curryArity(arity, func, context, args)
     }
   }
-  return func(...args)
+  return func.apply(context, args)
 }
 
 const spread2 = func => function spreading2([arg0, arg1]) {
@@ -1130,7 +1130,7 @@ const objectMapEntries = function (object, mapper) {
       mapping = mapper([key, value])
     if (isPromise(mapping)) {
       promises.push(mapping.then(
-        spread2(curryArity(3, objectSet, [result]))))
+        spread2(curryArity(3, objectSet, this, [result]))))
     } else {
       result[mapping[0]] = mapping[1]
     }
@@ -1146,7 +1146,7 @@ const mapMapEntriesForEachCallback = (
 ) => function callback(value, key) {
   const mapping = mapper([key, value])
   if (isPromise(mapping)) {
-    promises.push(mapping.then(spread2(curryArity(3, mapSet, [result]))))
+    promises.push(mapping.then(spread2(curryArity(3, mapSet, this, [result]))))
   } else {
     result.set(mapping[0], mapping[1])
   }
@@ -2455,21 +2455,21 @@ const SelfReferencingPromise = function (basePromise) {
 }
 
 const asyncArraySome = async function (
-  array, predicate, index, promisesInFlight,
+  array, predicate, index, promises,
 ) {
   const length = array.length
 
   while (++index < length) {
     const predication = predicate(array[index])
     if (isPromise(predication)) {
-      promisesInFlight.add(SelfReferencingPromise(predication))
+      promises.add(SelfReferencingPromise(predication))
     } else if (predication) {
       return true
     }
   }
-  while (promisesInFlight.size > 0) {
-    const [predication, promise] = await promiseRace(promisesInFlight)
-    promisesInFlight.delete(promise)
+  while (promises.size > 0) {
+    const [predication, promise] = await promiseRace(promises)
+    promises.delete(promise)
     if (predication) {
       return true
     }
@@ -2494,7 +2494,7 @@ const arraySome = function (array, predicate) {
 }
 
 const asyncIteratorSome = async function (
-  iterator, predicate, promisesInFlight, maxConcurrency = 20,
+  iterator, predicate, promises, maxConcurrency = 20,
 ) {
   let iteration = iterator.next()
   if (isPromise(iteration)) {
@@ -2502,16 +2502,16 @@ const asyncIteratorSome = async function (
   }
 
   while (!iteration.done) {
-    if (promisesInFlight.size >= maxConcurrency) {
-      const [predication, promise] = await promiseRace(promisesInFlight)
-      promisesInFlight.delete(promise)
+    if (promises.size >= maxConcurrency) {
+      const [predication, promise] = await promiseRace(promises)
+      promises.delete(promise)
       if (predication) {
         return true
       }
     }
     const predication = predicate(iteration.value)
     if (isPromise(predication)) {
-      promisesInFlight.add(SelfReferencingPromise(predication))
+      promises.add(SelfReferencingPromise(predication))
     } else if (predication) {
       return true
     }
@@ -2520,9 +2520,9 @@ const asyncIteratorSome = async function (
       iteration = await iteration
     }
   }
-  while (promisesInFlight.size > 0) {
-    const [predication, promise] = await promiseRace(promisesInFlight)
-    promisesInFlight.delete(promise)
+  while (promises.size > 0) {
+    const [predication, promise] = await promiseRace(promises)
+    promises.delete(promise)
     if (predication) {
       return true
     }
@@ -2621,13 +2621,13 @@ const iteratorEvery = function (iterator, predicate) {
 }
 
 const asyncIteratorEvery = async function (
-  asyncIterator, predicate, promisesInFlight, maxConcurrency = 20,
+  asyncIterator, predicate, promises, maxConcurrency = 20,
 ) {
   let iteration = await asyncIterator.next()
   while (!iteration.done) {
-    if (promisesInFlight.size >= maxConcurrency) {
-      const [predication, promise] = await promiseRace(promisesInFlight)
-      promisesInFlight.delete(promise)
+    if (promises.size >= maxConcurrency) {
+      const [predication, promise] = await promiseRace(promises)
+      promises.delete(promise)
       if (!predication) {
         return false
       }
@@ -2635,15 +2635,15 @@ const asyncIteratorEvery = async function (
 
     const predication = predicate(iteration.value)
     if (isPromise(predication)) {
-      promisesInFlight.add(SelfReferencingPromise(predication))
+      promises.add(SelfReferencingPromise(predication))
     } else if (!predication) {
       return false
     }
     iteration = await asyncIterator.next()
   }
-  while (promisesInFlight.size > 0) {
-    const [predication, promise] = await promiseRace(promisesInFlight)
-    promisesInFlight.delete(promise)
+  while (promises.size > 0) {
+    const [predication, promise] = await promiseRace(promises)
+    promises.delete(promise)
     if (!predication) {
       return false
     }
@@ -3285,10 +3285,14 @@ const thunkify = (func, ...args) => function thunk() {
   return func(...args)
 }
 
-const curry = (func, ...args) => curryArity(func.length, func, args)
+const curry = (func, ...args) => curryArity(func.length, func, this, args)
 
 curry.arity = function curryArity_(arity, func, ...args) {
-  return curryArity(arity, func, args)
+  return curryArity(arity, func, this, args)
+}
+
+curry.call = function call(func, context, ...args) {
+  return curryArity(func.length, func, context, args)
 }
 
 const rubico = {