rubico 2.3.0 → 2.3.2

package/dist/set.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/set.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/set.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/some.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/some.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 isPromise=e=>null!=e&&"function"==typeof e.then,__=Symbol.for("placeholder"),curry2ResolveArg0=(e,r)=>function(o){return e(o,r)},curry2ResolveArg1=(e,r)=>function(o){return e(r,o)},curry2=function(e,r,o){return r==__?curry2ResolveArg0(e,o):curry2ResolveArg1(e,r)},isArray=Array.isArray,objectValues=Object.values,SelfReferencingPromise=function(e){const r=e.then((e=>[e,r]));return r},promiseRace=Promise.race.bind(Promise),asyncArraySome=async function(e,r,o,t){const n=e.length;for(;++o<n;){const n=r(e[o]);if(isPromise(n))t.add(SelfReferencingPromise(n));else if(n)return!0}for(;t.size>0;){const[e,r]=await promiseRace(t);if(t.delete(r),e)return!0}return!1},arraySome=function(e,r){const o=e.length;let t=-1;for(;++t<o;){const o=r(e[t]);if(isPromise(o))return asyncArraySome(e,r,t,new Set([SelfReferencingPromise(o)]));if(o)return!0}return!1},asyncIteratorSome=async function(e,r,o,t=20){let n=e.next();for(isPromise(n)&&(n=await n);!n.done;){if(o.size>=t){const[e,r]=await promiseRace(o);if(o.delete(r),e)return!0}const s=r(n.value);if(isPromise(s))o.add(SelfReferencingPromise(s));else if(s)return!0;n=e.next(),isPromise(n)&&(n=await n)}for(;o.size>0;){const[e,r]=await promiseRace(o);if(o.delete(r),e)return!0}return!1},iteratorSome=function(e,r){for(const o of e){const t=r(o);if(isPromise(t))return asyncIteratorSome(e,r,new Set([SelfReferencingPromise(t)]));if(t)return!0}return!1},reducerAnySync=e=>function(r,o){return!!r||e(o)},reducerSome=e=>function(r,o){return!0===r?r:isPromise(r)?r.then(curry2(reducerAnySync(e),__,o)):!!r||e(o)},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,_some=function(e,r){return isArray(e)?arraySome(e,r):null==e?r(e):"function"==typeof e[symbolIterator]?iteratorSome(e[symbolIterator](),r):"function"==typeof e[symbolAsyncIterator]?asyncIteratorSome(e[symbolAsyncIterator](),r,new Set):"function"==typeof e.reduce?e.reduce(reducerSome(r),!1):e.constructor==Object?arraySome(objectValues(e),r):r(e)},some=function(...e){const r=e.pop();if(0==e.length)return curry2(_some,__,r);const o=e[0];return isPromise(o)?o.then(curry2(_some,__,r)):_some(o,r)};export default some;

package/dist/some.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/some.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/some.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/switchCase.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/switchCase.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 promiseAll=Promise.all.bind(Promise),isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const n=r.length;let o=-1;for(;++o<n;){const n=r[o];if(isPromise(n))return!0}return!1},thunkConditional=(r,n,o)=>r?n():o(),thunkifyArgs=(r,n)=>function(){return r(...n)},thunkify3=(r,n,o,t)=>function(){return r(n,o,t)},__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,o)=>function(t){return r(t,n,o)},curry3ResolveArg1=(r,n,o)=>function(t){return r(n,t,o)},curry3ResolveArg2=(r,n,o)=>function(t){return r(n,o,t)},curry3=function(r,n,o,t){return n==__?curry3ResolveArg0(r,o,t):o==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,o)},always=r=>function(){return r},arrayConditional=function(r,n,o){const t=r.length-1;for(;(o+=2)<t;){const t=r[o],e=r[o+1],u="function"==typeof t?t(...n):t;if(isPromise(u))return u.then(curry3(thunkConditional,__,"function"==typeof e?thunkifyArgs(e,n):always(e),thunkify3(arrayConditional,r,n,o)));if(u)return"function"==typeof e?e(...n):e}if(o==r.length)return;const e=r[t];return"function"==typeof e?e(...n):e},areAllValuesNonfunctions=function(r){const n=r.length;let o=-1;for(;++o<n;)if("function"==typeof r[o])return!1;return!0},thunkify2=(r,n,o)=>function(){return r(n,o)},nonfunctionsConditional=function(r,n){const o=r.length,t=o-1;for(;(n+=2)<t;){const o=r[n],t=r[n+1];if(isPromise(o))return o.then(curry3(thunkConditional,__,always(t),thunkify2(nonfunctionsConditional,r,n)));if(o)return t}if(n!=o)return r[n]},curryArgs3ResolveArgs0=(r,n,o)=>function(...t){return r(t,n,o)},curryArgs3ResolveArgs1=(r,n,o)=>function(...t){return r(n,t,o)},curryArgs3ResolveArgs2=(r,n,o)=>function(...t){return r(n,o,t)},curryArgs3=function(r,n,o,t){return n==__?curryArgs3ResolveArgs0(r,o,t):o==__?curryArgs3ResolveArgs1(r,n,t):curryArgs3ResolveArgs2(r,n,o)},switchCase=(...r)=>{const n=r.pop();return areAllValuesNonfunctions(n)?nonfunctionsConditional(n,-2):0==r.length?(o=arrayConditional,e=__,u=-2,(t=n)==__?curryArgs3ResolveArgs0(o,e,u):e==__?curryArgs3ResolveArgs1(o,t,u):curryArgs3ResolveArgs2(o,t,e)):areAnyValuesPromises(r)?promiseAll(r).then(curry3(arrayConditional,n,__,-2)):arrayConditional(n,r,-2);var o,t,e,u};export default switchCase;

package/dist/switchCase.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/switchCase.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/switchCase.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/tap.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/tap.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 isPromise=r=>null!=r&&"function"==typeof r.then,always=r=>function(){return r},thunkifyArgs=(r,n)=>function(){return r(...n)},thunkConditional=(r,n,e)=>r?n():e(),__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},curryArgs2ResolveArgs0=(r,n,e)=>function(...e){return r(e,n)},curryArgs2ResolveArgs1=(r,n,e)=>function(...e){return r(n,e)},curryArgs2=function(r,n,e){return n==__?curryArgs2ResolveArgs0(r,e):curryArgs2ResolveArgs1(r,n)},_tap=function(r,n){const e=r[0],t=n(...r);return isPromise(t)?t.then(always(e)):e},tap=function(...r){const n=r.pop();return 0==r.length?(e=_tap,u=n,(t=__)==__?curryArgs2ResolveArgs0(e,u):curryArgs2ResolveArgs1(e,t)):_tap(r,n);var e,t,u};tap.if=(r,n)=>function(...e){const t=r(...e);if(isPromise(t))return t.then((u=thunkConditional,o=__,s=thunkifyArgs(tap(n),e),c=always(e[0]),o==__?curry3ResolveArg0(u,s,c):s==__?curry3ResolveArg1(u,o,c):curry3ResolveArg2(u,o,s)));var u,o,s,c;if(t){const r=n(...e);if(isPromise(r))return r.then(always(e[0]))}return e[0]};export default tap;

package/dist/tap.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/tap.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/tap.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/thunkify.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/thunkify.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 isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},funcApply=(r,e)=>r(...e),thunkify=(r,...e)=>function(){return areAnyValuesPromises(e)?promiseAll(e).then((n=funcApply,u=__,(o=r)==__?curry2ResolveArg0(n,u):curry2ResolveArg1(n,o))):r(...e);var n,o,u};export default thunkify;

package/dist/thunkify.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/thunkify.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/thunkify.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/transform.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/transform.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 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,isBinary=ArrayBuffer.isView,callPropUnary=(r,e,n)=>r[e](n),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)},always=r=>function(){return r},noop=function(){},add=(r,e)=>r+e,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,curryArgs3ResolveArgs0=(r,e,n)=>function(...t){return r(t,e,n)},curryArgs3ResolveArgs1=(r,e,n)=>function(...t){return r(e,t,n)},curryArgs3ResolveArgs2=(r,e,n)=>function(...t){return r(e,n,t)},curryArgs3=function(r,e,n,t){return e==__?curryArgs3ResolveArgs0(r,n,t):n==__?curryArgs3ResolveArgs1(r,e,t):curryArgs3ResolveArgs2(r,e,n)},curry4ResolveArg0=(r,e,n,t)=>function(o){return r(o,e,n,t)},curry4ResolveArg1=(r,e,n,t)=>function(o){return r(e,o,n,t)},curry4ResolveArg2=(r,e,n,t)=>function(o){return r(e,n,o,t)},curry4ResolveArg3=(r,e,n,t)=>function(o){return r(e,n,t,o)},curry4=function(r,e,n,t,o){return e==__?curry4ResolveArg0(r,n,t,o):n==__?curry4ResolveArg1(r,e,t,o):t==__?curry4ResolveArg2(r,e,n,o):curry4ResolveArg3(r,e,n,t)},arrayReduceAsync=async function(r,e,n,t){const o=r.length;for(;++t<o;)n=e(n,r[t],t,r),isPromise(n)&&(n=await n);return n},arrayReduce=function(r,e,n){const t=r.length;let o=-1;for(void 0===n&&(n=r[++o]);++o<t;)if(n=e(n,r[o],o,r),isPromise(n))return n.then(curry4(arrayReduceAsync,r,e,__,o));return n},curry5ResolveArg0=(r,e,n,t,o)=>function(c){return r(c,e,n,t,o)},curry5ResolveArg1=(r,e,n,t,o)=>function(c){return r(e,c,n,t,o)},curry5ResolveArg2=(r,e,n,t,o)=>function(c){return r(e,n,c,t,o)},curry5ResolveArg3=(r,e,n,t,o)=>function(c){return r(e,n,t,c,o)},curry5ResolveArg4=(r,e,n,t,o)=>function(c){return r(e,n,t,o,c)},curry5=function(r,e,n,t,o,c){return e==__?curry5ResolveArg0(r,n,t,o,c):n==__?curry5ResolveArg1(r,e,t,o,c):t==__?curry5ResolveArg2(r,e,n,o,c):o==__?curry5ResolveArg3(r,e,n,t,c):curry5ResolveArg4(r,e,n,t,o)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,n,t,o){const c=t.length;for(;++o<c;){const c=t[o];n=e(n,r[c],c,r),isPromise(n)&&(n=await n)}return n},objectReduce=function(r,e,n){const t=objectKeys(r),o=t.length;let c=-1;for(void 0===n&&(n=r[t[++c]]);++c<o;){const o=t[c];if(n=e(n,r[o],o,r),isPromise(n))return n.then((u=objectReduceAsync,s=e,a=__,f=t,y=c,(i=r)==__?curry5ResolveArg0(u,s,a,f,y):s==__?curry5ResolveArg1(u,i,a,f,y):a==__?curry5ResolveArg2(u,i,s,f,y):f==__?curry5ResolveArg3(u,i,s,a,y):curry5ResolveArg4(u,i,s,a,f)))}var u,i,s,a,f,y;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)},objectAssign=Object.assign,_arrayExtend=function(r,e){const n=r.length,t=e.length;let o=-1;for(;++o<t;)r[n+o]=e[o];return r},arrayExtend=function(r,e){return isArray(e)||isBinary(e)?_arrayExtend(r,e):(r.push(e),r)},globalThisHasBuffer="function"==typeof Buffer,bufferAlloc=globalThisHasBuffer?Buffer.alloc:noop,_binaryExtend=function(r,e){const n=r.length,t=globalThisHasBuffer&&r.constructor==Buffer?bufferAlloc(n+e.length):new r.constructor(n+e.length);return t.set(r),t.set(e,n),t},binaryExtend=function(r,e){return isArray(e)||isBinary(e)?_binaryExtend(r,e):_binaryExtend(r,[e])},thunkify1=(r,e)=>function(){return r(e)},isNodeReadStream=r=>null!=r&&"function"==typeof r.pipe,__streamWrite=r=>function(e,n,t){return r.write(e,n,t),r},_streamExtendExecutor=(r,e)=>function(n,t){var o,c;e.on("data",__streamWrite(r)),e.on("end",(o=n,c=r,function(){return o(c)})),e.on("error",t)},_streamExtend=(r,e)=>new Promise(_streamExtendExecutor(r,e)),streamExtend=function(r,e){return null!=(n=e)&&"function"==typeof n.pipe?_streamExtend(r,e):(r.write(e),r);var n},setExtend=function(r,e){if(null!=e&&e.constructor==Set){for(const n of e)r.add(n);return r}return r.add(e)},callConcat=function(r,e){return r.concat(e)},identityTransform=function(r,e,n){const t=genericReduce(r,e(noop),null);return isPromise(t)?t.then((o=n,function(){return o})):n;var o},genericTransform=function(r,e,n){if(isArray(n))return genericReduce(r,e(arrayExtend),n);if(isBinary(n)){const t=genericReduce(r,e(arrayExtend),[]);return isPromise(t)?t.then(curry2(binaryExtend,n,__)):binaryExtend(n,t)}if(null==n)return identityTransform(r,e,n);const t=n.constructor;if("string"==typeof n||t==String){const t=genericReduce(r,e(arrayExtend),[n]);return isPromise(t)?t.then(curry3(callPropUnary,__,"join","")):t.join("")}return"function"==typeof n.concat?genericReduce(r,e(callConcat),n):"function"==typeof n.write?genericReduce(r,e(streamExtend),n):t==Set?genericReduce(r,e(setExtend),n):t==Object?genericReduce(r,e(objectAssign),n):identityTransform(r,e,n)},_transform=function(r,e,n){if("function"==typeof n){const t=n(r);return isPromise(t)?t.then(curry3(genericTransform,r,e,__)):genericTransform(r,e,t)}return isPromise(n)?n.then(curry3(genericTransform,r,e,__)):genericTransform(r,e,n)},transform=function(...r){return"function"==typeof r[0]?curry3(_transform,__,r[0],r[1]):isPromise(r[0])?r[0].then(curry3(_transform,__,r[1],r[2])):_transform(r[0],r[1],r[2])};export default transform;

package/dist/transform.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/transform.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/transform.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/tryCatch.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/tryCatch.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 isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry3ResolveArg0=(r,t,e)=>function(n){return r(n,t,e)},curry3ResolveArg1=(r,t,e)=>function(n){return r(t,n,e)},curry3ResolveArg2=(r,t,e)=>function(n){return r(t,e,n)},curry3=function(r,t,e,n){return t==__?curry3ResolveArg0(r,e,n):e==__?curry3ResolveArg1(r,t,n):curry3ResolveArg2(r,t,e)},catcherApply=function(r,t,e){return r(t,...e)},areAnyValuesPromises=function(r){const t=r.length;let e=-1;for(;++e<t;){const t=r[e];if(isPromise(t))return!0}return!1},_tryCatch=function(r,t,e){try{const n=r(...e);return isPromise(n)?n.catch(curry3(catcherApply,t,__,e)):n}catch(r){return t(r,...e)}},tryCatch=function(...r){if(r.length>2){const t=r.pop(),e=r.pop();return areAnyValuesPromises(r)?promiseAll(r).then(curry3(_tryCatch,e,t,__)):_tryCatch(e,t,r)}const t=r[0],e=r[1];return function(...r){return _tryCatch(t,e,r)}};export default tryCatch;

package/dist/tryCatch.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/tryCatch.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/tryCatch.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/append.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/append.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 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.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/append.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/append.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/callProp.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/callProp.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 callProp=(l,...o)=>function(r){return r[l](...o)};export default callProp;

package/dist/x/callProp.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/callProp.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/callProp.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/defaultsDeep.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/defaultsDeep.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,arrayDefaultsDeepFromArray=function(r,e){const t=e.length,c=r.slice();let o=-1;for(;++o<t;){const t=r[o],a=e[o];isArray(t)&&isArray(a)?c[o]=arrayDefaultsDeepFromArray(t,a):null==t?c[o]=a:null==a?c[o]=t:t.constructor==Object&&a.constructor==Object?c[o]=objectDefaultsDeepFromObject(t,a):c[o]=t}return c},objectDefaultsDeepFromObject=function(r,e){const t={...r};for(const c in e){const o=r[c],a=e[c];isArray(o)&&isArray(a)?t[c]=arrayDefaultsDeepFromArray(o,a):null==o?t[c]=a:null==a?t[c]=o:o.constructor==Object&&a.constructor==Object?t[c]=objectDefaultsDeepFromObject(o,a):t[c]=o}return t},defaultsDeep=r=>function(e){return isArray(e)&&isArray(r)?arrayDefaultsDeepFromArray(e,r):null==e||null==r?e:e.constructor==Object&&r.constructor==Object?objectDefaultsDeepFromObject(e,r):e};export default defaultsDeep;

package/dist/x/defaultsDeep.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/defaultsDeep.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/defaultsDeep.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/differenceWith.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/differenceWith.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,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},curry3ResolveArg0=(r,e,n)=>function(t){return r(t,e,n)},curry3ResolveArg1=(r,e,n)=>function(t){return r(e,t,n)},curry3ResolveArg2=(r,e,n)=>function(t){return r(e,n,t)},curry3=function(r,e,n,t){return e==__?curry3ResolveArg0(r,n,t):n==__?curry3ResolveArg1(r,e,t):curry3ResolveArg2(r,e,n)},thunkify2=(r,e,n)=>function(){return r(e,n)},thunkify5=(r,e,n,t,o,i)=>function(){return r(e,n,t,o,i)},thunkConditional=(r,e,n)=>r?e():n(),isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,SelfReferencingPromise=function(r){const e=r.then((r=>[r,e]));return e},promiseRace=Promise.race.bind(Promise),asyncArraySome=async function(r,e,n,t){const o=r.length;for(;++n<o;){const o=e(r[n]);if(isPromise(o))t.add(SelfReferencingPromise(o));else if(o)return!0}for(;t.size>0;){const[r,e]=await promiseRace(t);if(t.delete(e),r)return!0}return!1},arraySome=function(r,e){const n=r.length;let t=-1;for(;++t<n;){const n=e(r[t]);if(isPromise(n))return asyncArraySome(r,e,t,new Set([SelfReferencingPromise(n)]));if(n)return!0}return!1},arrayPush=function(r,e){return r.push(e),r},funcConcatSync=(r,e)=>function(...n){return e(r(...n))},noop=function(){},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,differenceWithArrayAsync=async function(r,e,n,t,o){const i=e.length;for(;++o<i;){const i=e[o];let c=arraySome(n,curry2(r,i,__));isPromise(c)&&(c=await c),c||t.push(i)}return t},differenceWithArray=function(r,e,n){const t=e.length,o=[];let i=-1;for(;++i<t;){const t=e[i],y=arraySome(n,curry2(r,t,__));if(isPromise(y))return y.then(funcConcatSync((c=thunkConditional,u=__,s=noop,f=thunkify2(arrayPush,o,t),u==__?curry3ResolveArg0(c,s,f):s==__?curry3ResolveArg1(c,u,f):curry3ResolveArg2(c,u,s)),thunkify5(differenceWithArrayAsync,r,e,n,o,i)));y||o.push(t)}var c,u,s,f;return o},differenceWith=(r,e)=>function(n){if(isArray(n))return differenceWithArray(r,e,n);throw new TypeError(`${n} is not an Array`)};export default differenceWith;

package/dist/x/differenceWith.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/differenceWith.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/differenceWith.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/filterOut.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')