rubico 1.9.7 → 2.0.1

package/dist/x/trace.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
@@ -18,11 +18,6 @@ const funcConcat = (
 
 const always = value => function getter() { return value }
 
-const tapSync = func => function tapping(...args) {
-  func(...args)
-  return args[0]
-}
-
 const thunkifyArgs = (func, args) => function thunk() {
   return func(...args)
 }
@@ -70,8 +65,6 @@ const tap = func => function tapping(...args) {
   return isPromise(call) ? call.then(always(result)) : result
 }
 
-tap.sync = tapSync
-
 tap.if = (predicate, func) => function tappingIf(...args) {
   const predication = predicate(...args)
   if (isPromise(predication)) {

package/dist/x/unionWith.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,t)=>function(e){return r(e,n,t)},curry3ResolveArg1=(r,n,t)=>function(e){return r(n,e,t)},curry3ResolveArg2=(r,n,t)=>function(e){return r(n,t,e)},curry3=function(r,n,t,e){return n==__?curry3ResolveArg0(r,t,e):t==__?curry3ResolveArg1(r,n,e):curry3ResolveArg2(r,n,t)},thunkify2=(r,n,t)=>function(){return r(n,t)},thunkify4=(r,n,t,e,o)=>function(){return r(n,t,e,o)},funcConcatSync=(r,n)=>function(...t){return n(r(...t))},callPropUnary=(r,n,t)=>r[n](t),thunkConditional=(r,n,t)=>r?n():t(),arrayPush=function(r,n){return r.push(n),r},always=r=>function(){return r},curry2ResolveArg0=(r,n)=>function(t){return r(t,n)},curry2ResolveArg1=(r,n)=>function(t){return r(n,t)},curry2=function(r,n,t){return n==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,n)},getArg1=(r,n)=>n,identity=r=>r,asyncIteratorForEach=async function(r,n){const t=[];for await(const e of r){const r=n(e);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,arrayFlatten=function(r){const n=r.length,t=[],e=[];let o=-1;for(;++o<n;){const n=r[o];if(isArray(n)){const r=n.length;let t=-1;for(;++t<r;)e.push(n[t])}else if(null==n)e.push(n);else if("function"==typeof n.then)t.push(n.then(curry2(arrayPush,e,__)));else if("function"==typeof n[symbolIterator])for(const r of n)e.push(r);else if("function"==typeof n[symbolAsyncIterator])t.push(asyncIteratorForEach(n[symbolAsyncIterator](),curry2(arrayPush,e,__)));else if("function"==typeof n.chain){const r=n.chain(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,e,__))):e.push(r)}else if("function"==typeof n.flatMap){const r=n.flatMap(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,e,__))):e.push(r)}else if("function"==typeof n.reduce){const r=n.reduce(funcConcatSync(getArg1,curry2(arrayPush,e,__)),null);isPromise(r)&&t.push(r)}else if(n.constructor==Object)for(const r in n)e.push(n[r]);else e.push(n)}return 0==t.length?e:promiseAll(t).then(always(e))},noop=function(){},arrayIncludesWith=function(r,n,t){const e=r.length,o=[];let s=-1;for(;++s<e;){const e=t(n,r[s]);if(isPromise(e))o.push(e);else if(e)return!0}return 0!=o.length&&promiseAll(o).then(curry3(callPropUnary,__,"some",Boolean))},arrayUniqWithAsync=async function(r,n,t,e){const o=r.length;for(;++e<o;){const o=r[e],s=arrayIncludesWith(t,o,n);(isPromise(s)?await s:s)||t.push(o)}return t},arrayUniqWith=function(r,n){const t=r.length,e=[];let o=-1;for(;++o<t;){const t=r[o],s=arrayIncludesWith(e,t,n);if(isPromise(s))return s.then(funcConcatSync(curry3(thunkConditional,__,noop,thunkify2(arrayPush,e,t)),thunkify4(arrayUniqWithAsync,r,n,e,o)));s||e.push(t)}return e},unionWith=r=>function(n){if(isArray(n))return arrayUniqWith(arrayFlatten(n),r);throw new TypeError(`${n} is not an Array`)};export default unionWith;

package/dist/x/unionWith.js

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

package/dist/x/unionWith.min.js

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

package/dist/x/unionWith.mjs

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

package/dist/x/uniq.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,uniq=r=>{if(!isArray(r))throw Error("uniq(arr): arr is not an array");return[...new Set(r)]};export default uniq;

package/dist/x/uniq.js

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

package/dist/x/uniq.min.js

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

package/dist/x/uniq.mjs

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

package/dist/x/unless.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 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},__=Symbol.for("placeholder"),thunkify1=(r,n)=>function(){return r(n)},curry3ResolveArg0=(r,n,e)=>function(u){return r(u,n,e)},curry3ResolveArg1=(r,n,e)=>function(u){return r(n,u,e)},curry3ResolveArg2=(r,n,e)=>function(u){return r(n,e,u)},curry3=function(r,n,e,u){return n==__?curry3ResolveArg0(r,e,u):e==__?curry3ResolveArg1(r,n,u):curry3ResolveArg2(r,n,e)},thunkConditional=(r,n,e)=>r?n():e(),unless=(r,n)=>function(e){const u=r(e);return isPromise(u)?u.then((o=thunkConditional,t=__,c=always(e),l=thunkify1(n,e),t==__?curry3ResolveArg0(o,c,l):c==__?curry3ResolveArg1(o,t,l):curry3ResolveArg2(o,t,c))):u?e:n(e);var o,t,c,l};export default unless;

package/dist/x/unless.js

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

package/dist/x/unless.min.js

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

package/dist/x/unless.mjs

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

package/dist/x/values.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const objectValues=Object.values,values=e=>null==e?[]:"function"==typeof e.values?[...e.values()]:objectValues(e);export default values;

package/dist/x/values.js

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

package/dist/x/values.min.js

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

package/dist/x/values.mjs

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

package/dist/x/when.es.js

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

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

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.1
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 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},__=Symbol.for("placeholder"),thunkify1=(r,n)=>function(){return r(n)},curry3ResolveArg0=(r,n,e)=>function(u){return r(u,n,e)},curry3ResolveArg1=(r,n,e)=>function(u){return r(n,u,e)},curry3ResolveArg2=(r,n,e)=>function(u){return r(n,e,u)},curry3=function(r,n,e,u){return n==__?curry3ResolveArg0(r,e,u):e==__?curry3ResolveArg1(r,n,u):curry3ResolveArg2(r,n,e)},thunkConditional=(r,n,e)=>r?n():e(),when=(r,n)=>function(e){const u=r(e);return isPromise(u)?u.then((o=thunkConditional,t=__,c=thunkify1(n,e),l=always(e),t==__?curry3ResolveArg0(o,c,l):c==__?curry3ResolveArg1(o,t,l):curry3ResolveArg2(o,t,c))):u?n(e):e;var o,t,c,l};export default when;

package/dist/x/when.js

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

package/dist/x/when.min.js

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

package/dist/x/when.mjs

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