rubico 1.9.7 → 2.0.1

package/dist/{any.es.js → some.mjs}

@@ -1,10 +1,34 @@
 /**
- * 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 = value => value != null && typeof value.then == 'function'
+
+const __ = Symbol.for('placeholder')
+
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
+
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
+
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
+
 const isArray = Array.isArray
 
 const objectValues = Object.values
@@ -14,11 +38,9 @@ const SelfReferencingPromise = function (basePromise) {
   return promise
 }
 
-const isPromise = value => value != null && typeof value.then == 'function'
-
 const promiseRace = Promise.race.bind(Promise)
 
-const asyncArrayAny = async function (
+const asyncArraySome = async function (
   array, predicate, index, promisesInFlight,
 ) {
   const length = array.length
@@ -41,13 +63,13 @@ const asyncArrayAny = async function (
   return false
 }
 
-const arrayAny = function (array, predicate) {
+const arraySome = function (array, predicate) {
   const length = array.length
   let index = -1
   while (++index < length) {
     const predication = predicate(array[index])
     if (isPromise(predication)) {
-      return asyncArrayAny(
+      return asyncArraySome(
         array, predicate, index, new Set([SelfReferencingPromise(predication)]))
     }
     if (predication) {
@@ -57,7 +79,7 @@ const arrayAny = function (array, predicate) {
   return false
 }
 
-const asyncIteratorAny = async function (
+const asyncIteratorSome = async function (
   iterator, predicate, promisesInFlight, maxConcurrency = 20,
 ) {
   let iteration = iterator.next()
@@ -94,11 +116,11 @@ const asyncIteratorAny = async function (
   return false
 }
 
-const iteratorAny = function (iterator, predicate) {
+const iteratorSome = function (iterator, predicate) {
   for (const item of iterator) {
     const predication = predicate(item)
     if (isPromise(predication)) {
-      return asyncIteratorAny(
+      return asyncIteratorSome(
         iterator, predicate, new Set([SelfReferencingPromise(predication)]))
     }
     if (predication) {
@@ -112,29 +134,7 @@ const reducerAnySync = predicate => function anyReducer(result, item) {
   return result ? true : predicate(item)
 }
 
-const __ = Symbol.for('placeholder')
-
-// argument resolver for curry2
-const curry2ResolveArg0 = (
-  baseFunc, arg1,
-) => function arg0Resolver(arg0) {
-  return baseFunc(arg0, arg1)
-}
-
-// argument resolver for curry2
-const curry2ResolveArg1 = (
-  baseFunc, arg0,
-) => function arg1Resolver(arg1) {
-  return baseFunc(arg0, arg1)
-}
-
-const curry2 = function (baseFunc, arg0, arg1) {
-  return arg0 == __
-    ? curry2ResolveArg0(baseFunc, arg1)
-    : curry2ResolveArg1(baseFunc, arg0)
-}
-
-const reducerAny = predicate => function anyReducer(result, item) {
+const reducerSome = predicate => function anyReducer(result, item) {
   return result === true ? result
     : isPromise(result) ? result.then(curry2(reducerAnySync(predicate), __, item))
     : result ? true : predicate(item)
@@ -144,26 +144,43 @@ const symbolIterator = Symbol.iterator
 
 const symbolAsyncIterator = Symbol.asyncIterator
 
-const any = predicate => function anyTruthy(value) {
-  if (isArray(value)) {
-    return arrayAny(value, predicate)
+// _some(collection Array|Iterable|AsyncIterable|{ reduce: function }|Object, predicate function) -> Promise|boolean
+const _some = function (collection, predicate) {
+  if (isArray(collection)) {
+    return arraySome(collection, predicate)
   }
-  if (value == null) {
-    return predicate(value)
+  if (collection == null) {
+    return predicate(collection)
   }
-  if (typeof value[symbolIterator] == 'function') {
-    return iteratorAny(value[symbolIterator](), predicate)
+  if (typeof collection[symbolIterator] == 'function') {
+    return iteratorSome(collection[symbolIterator](), predicate)
   }
-  if (typeof value[symbolAsyncIterator] == 'function') {
-    return asyncIteratorAny(value[symbolAsyncIterator](), predicate, new Set())
+  if (typeof collection[symbolAsyncIterator] == 'function') {
+    return asyncIteratorSome(
+      collection[symbolAsyncIterator](), predicate, new Set()
+    )
   }
-  if (typeof value.reduce == 'function') {
-    return value.reduce(reducerAny(predicate), false)
+  if (typeof collection.reduce == 'function') {
+    return collection.reduce(reducerSome(predicate), false)
   }
-  if (value.constructor == Object) {
-    return arrayAny(objectValues(value), predicate)
+  if (collection.constructor == Object) {
+    return arraySome(objectValues(collection), predicate)
   }
-  return predicate(value)
+  return predicate(collection)
+}
+
+const some = function (...args) {
+  const predicate = args.pop()
+  if (args.length == 0) {
+    return curry2(_some, __, predicate)
+  }
+
+  const collection = args[0]
+  if (isPromise(collection)) {
+    return collection.then(curry2(_some, __, predicate))
+  }
+
+  return _some(collection, predicate)
 }
 
-export default any
+export default some

package/dist/switchCase.es.js

@@ -1,12 +1,26 @@
 /**
- * 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 promiseAll = Promise.all.bind(Promise)
+
 const isPromise = value => value != null && typeof value.then == 'function'
 
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
+    }
+  }
+  return false
+}
+
 const thunkConditional = (
   conditionalExpression, thunkOnTruthy, thunkOnFalsy,
 ) => conditionalExpression ? thunkOnTruthy() : thunkOnFalsy()
@@ -134,13 +148,49 @@ const nonfunctionsConditional = function (array, index) {
   return array[index]
 }
 
-const switchCase = values => {
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1, arg2)
+}
+
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args, arg2)
+}
+
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs2 = (
+  baseFunc, arg0, arg1,
+) => function arg2Resolver(...args) {
+  return baseFunc(arg0, arg1, args)
+}
+
+const curryArgs3 = function (baseFunc, arg0, arg1, arg2) {
+  if (arg0 == __) {
+    return curryArgs3ResolveArgs0(baseFunc, arg1, arg2)
+  }
+  if (arg1 == __) {
+    return curryArgs3ResolveArgs1(baseFunc, arg0, arg2)
+  }
+  return curryArgs3ResolveArgs2(baseFunc, arg0, arg1)
+}
+
+const switchCase = (...args) => {
+  const values = args.pop()
   if (areAllValuesNonfunctions(values)) {
     return nonfunctionsConditional(values, -2)
   }
-  return function switchingCases(...args) {
-    return arrayConditional(values, args, -2)
+  if (args.length == 0) {
+    return curryArgs3(arrayConditional, values, __, -2)
+  }
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry3(arrayConditional, values, __, -2))
   }
+  return arrayConditional(values, args, -2)
 }
 
 export default switchCase

package/dist/switchCase.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=n=>null!=n&&"function"==typeof n.then,thunkConditional=(n,t,r)=>n?t():r(),thunkifyArgs=(n,t)=>function(){return n(...t)},thunkify3=(n,t,r,o)=>function(){return n(t,r,o)},__=Symbol.for("placeholder"),curry3ResolveArg0=(n,t,r)=>function(o){return n(o,t,r)},curry3ResolveArg1=(n,t,r)=>function(o){return n(t,o,r)},curry3ResolveArg2=(n,t,r)=>function(o){return n(t,r,o)},curry3=function(n,t,r,o){return t==__?curry3ResolveArg0(n,r,o):r==__?curry3ResolveArg1(n,t,o):curry3ResolveArg2(n,t,r)},always=n=>function(){return n},arrayConditional=function(n,t,r){const o=n.length-1;for(;(r+=2)<o;){const o=n[r],u=n[r+1],i="function"==typeof o?o(...t):o;if(isPromise(i))return i.then(curry3(thunkConditional,__,"function"==typeof u?thunkifyArgs(u,t):always(u),thunkify3(arrayConditional,n,t,r)));if(i)return"function"==typeof u?u(...t):u}if(r==n.length)return;const u=n[o];return"function"==typeof u?u(...t):u},areAllValuesNonfunctions=function(n){const t=n.length;let r=-1;for(;++r<t;)if("function"==typeof n[r])return!1;return!0},thunkify2=(n,t,r)=>function(){return n(t,r)},nonfunctionsConditional=function(n,t){const r=n.length,o=r-1;for(;(t+=2)<o;){const r=n[t],o=n[t+1];if(isPromise(r))return r.then(curry3(thunkConditional,__,always(o),thunkify2(nonfunctionsConditional,n,t)));if(r)return o}if(t!=r)return n[t]},switchCase=n=>areAllValuesNonfunctions(n)?nonfunctionsConditional(n,-2):function(...t){return arrayConditional(n,t,-2)};export default switchCase;
+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 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.
  */
 
@@ -11,8 +11,22 @@
   else (root.switchCase = switchCase) // Browser
 }(typeof globalThis == 'object' ? globalThis : this, (function () { 'use strict'
 
+const promiseAll = Promise.all.bind(Promise)
+
 const isPromise = value => value != null && typeof value.then == 'function'
 
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
+    }
+  }
+  return false
+}
+
 const thunkConditional = (
   conditionalExpression, thunkOnTruthy, thunkOnFalsy,
 ) => conditionalExpression ? thunkOnTruthy() : thunkOnFalsy()
@@ -140,13 +154,49 @@ const nonfunctionsConditional = function (array, index) {
   return array[index]
 }
 
-const switchCase = values => {
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1, arg2)
+}
+
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args, arg2)
+}
+
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs2 = (
+  baseFunc, arg0, arg1,
+) => function arg2Resolver(...args) {
+  return baseFunc(arg0, arg1, args)
+}
+
+const curryArgs3 = function (baseFunc, arg0, arg1, arg2) {
+  if (arg0 == __) {
+    return curryArgs3ResolveArgs0(baseFunc, arg1, arg2)
+  }
+  if (arg1 == __) {
+    return curryArgs3ResolveArgs1(baseFunc, arg0, arg2)
+  }
+  return curryArgs3ResolveArgs2(baseFunc, arg0, arg1)
+}
+
+const switchCase = (...args) => {
+  const values = args.pop()
   if (areAllValuesNonfunctions(values)) {
     return nonfunctionsConditional(values, -2)
   }
-  return function switchingCases(...args) {
-    return arrayConditional(values, args, -2)
+  if (args.length == 0) {
+    return curryArgs3(arrayConditional, values, __, -2)
+  }
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry3(arrayConditional, values, __, -2))
   }
+  return arrayConditional(values, args, -2)
 }
 
 return switchCase

package/dist/switchCase.min.js

@@ -1,8 +1,8 @@
 /**
- * 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.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.switchCase=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=(n,t,o)=>n?t():o(),o=(n,t)=>function(){return n(...t)},e=(n,t,o,e)=>function(){return n(t,o,e)},r=Symbol.for("placeholder"),u=function(n,t,o,e){return t==r?((n,t,o)=>function(e){return n(e,t,o)})(n,o,e):o==r?((n,t,o)=>function(e){return n(t,e,o)})(n,t,e):((n,t,o)=>function(e){return n(t,o,e)})(n,t,o)},f=n=>function(){return n},i=function(c,l,s){const h=c.length-1;for(;(s+=2)<h;){const h=c[s],p=c[s+1],y="function"==typeof h?h(...l):h;if(n(y))return y.then(u(t,r,"function"==typeof p?o(p,l):f(p),e(i,c,l,s)));if(y)return"function"==typeof p?p(...l):p}if(s==c.length)return;const p=c[h];return"function"==typeof p?p(...l):p},c=(n,t,o)=>function(){return n(t,o)},l=function(o,e){const i=o.length,s=i-1;for(;(e+=2)<s;){const i=o[e],s=o[e+1];if(n(i))return i.then(u(t,r,f(s),c(l,o,e)));if(i)return s}if(e!=i)return o[e]};return n=>function(n){const t=n.length;let o=-1;for(;++o<t;)if("function"==typeof n[o])return!1;return!0}(n)?l(n,-2):function(...t){return i(n,t,-2)}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.switchCase=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Promise.all.bind(Promise),t=n=>null!=n&&"function"==typeof n.then,e=(n,t,e)=>n?t():e(),o=(n,t)=>function(){return n(...t)},r=(n,t,e,o)=>function(){return n(t,e,o)},u=Symbol.for("placeholder"),f=function(n,t,e,o){return t==u?((n,t,e)=>function(o){return n(o,t,e)})(n,e,o):e==u?((n,t,e)=>function(o){return n(t,o,e)})(n,t,o):((n,t,e)=>function(o){return n(t,e,o)})(n,t,e)},i=n=>function(){return n},c=function(n,l,s){const h=n.length-1;for(;(s+=2)<h;){const h=n[s],p=n[s+1],y="function"==typeof h?h(...l):h;if(t(y))return y.then(f(e,u,"function"==typeof p?o(p,l):i(p),r(c,n,l,s)));if(y)return"function"==typeof p?p(...l):p}if(s==n.length)return;const p=n[h];return"function"==typeof p?p(...l):p},l=(n,t,e)=>function(){return n(t,e)},s=function(n,o){const r=n.length,c=r-1;for(;(o+=2)<c;){const r=n[o],c=n[o+1];if(t(r))return r.then(f(e,u,i(c),l(s,n,o)));if(r)return c}if(o!=r)return n[o]};return(...e)=>{const o=e.pop();return function(n){const t=n.length;let e=-1;for(;++e<t;)if("function"==typeof n[e])return!1;return!0}(o)?s(o,-2):0==e.length?(r=c,l=u,h=-2,(i=o)==u?((n,t,e)=>function(...o){return n(o,t,e)})(r,l,h):l==u?((n,t,e)=>function(...o){return n(t,o,e)})(r,i,h):((n,t,e)=>function(...o){return n(t,e,o)})(r,i,l)):function(n){const e=n.length;let o=-1;for(;++o<e;){const e=n[o];if(t(e))return!0}return!1}(e)?n(e).then(f(c,o,u,-2)):c(o,e,-2);var r,i,l,h}}());

package/dist/switchCase.mjs

@@ -1,12 +1,26 @@
 /**
- * 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 promiseAll = Promise.all.bind(Promise)
+
 const isPromise = value => value != null && typeof value.then == 'function'
 
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
+    }
+  }
+  return false
+}
+
 const thunkConditional = (
   conditionalExpression, thunkOnTruthy, thunkOnFalsy,
 ) => conditionalExpression ? thunkOnTruthy() : thunkOnFalsy()
@@ -134,13 +148,49 @@ const nonfunctionsConditional = function (array, index) {
   return array[index]
 }
 
-const switchCase = values => {
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1, arg2)
+}
+
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args, arg2)
+}
+
+// argument resolver for curryArgs3
+const curryArgs3ResolveArgs2 = (
+  baseFunc, arg0, arg1,
+) => function arg2Resolver(...args) {
+  return baseFunc(arg0, arg1, args)
+}
+
+const curryArgs3 = function (baseFunc, arg0, arg1, arg2) {
+  if (arg0 == __) {
+    return curryArgs3ResolveArgs0(baseFunc, arg1, arg2)
+  }
+  if (arg1 == __) {
+    return curryArgs3ResolveArgs1(baseFunc, arg0, arg2)
+  }
+  return curryArgs3ResolveArgs2(baseFunc, arg0, arg1)
+}
+
+const switchCase = (...args) => {
+  const values = args.pop()
   if (areAllValuesNonfunctions(values)) {
     return nonfunctionsConditional(values, -2)
   }
-  return function switchingCases(...args) {
-    return arrayConditional(values, args, -2)
+  if (args.length == 0) {
+    return curryArgs3(arrayConditional, values, __, -2)
+  }
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry3(arrayConditional, values, __, -2))
   }
+  return arrayConditional(values, args, -2)
 }
 
 export default switchCase

package/dist/tap.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.
  */
 
@@ -9,11 +9,6 @@ const isPromise = value => value != null && typeof value.then == 'function'
 
 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)
 }
@@ -61,8 +56,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/tap.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},tapSync=r=>function(...n){return r(...n),n[0]},thunkifyArgs=(r,n)=>function(){return r(...n)},thunkConditional=(r,n,t)=>r?n():t(),__=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)},tap=r=>function(...n){const t=n[0],e=r(...n);return isPromise(e)?e.then(always(t)):t};tap.sync=tapSync,tap.if=(r,n)=>function(...t){const e=r(...t);if(isPromise(e))return e.then((u=thunkConditional,o=__,c=thunkifyArgs(tap(n),t),i=always(t[0]),o==__?curry3ResolveArg0(u,c,i):c==__?curry3ResolveArg1(u,o,i):curry3ResolveArg2(u,o,c)));var u,o,c,i;if(e){const r=n(...t);if(isPromise(r))return r.then(always(t[0]))}return t[0]};export default tap;
+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)},tap=r=>function(...n){const e=n[0],t=r(...n);return isPromise(t)?t.then(always(e)):e};tap.if=(r,n)=>function(...e){const t=r(...e);if(isPromise(t))return t.then((o=thunkConditional,u=__,i=thunkifyArgs(tap(n),e),s=always(e[0]),u==__?curry3ResolveArg0(o,i,s):i==__?curry3ResolveArg1(o,u,s):curry3ResolveArg2(o,u,i)));var o,u,i,s;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 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.
  */
 
@@ -15,11 +15,6 @@ const isPromise = value => value != null && typeof value.then == 'function'
 
 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)
 }
@@ -67,8 +62,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/tap.min.js

@@ -1,8 +1,8 @@
 /**
- * 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.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.tap=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},e=(n,t,e)=>n?t():e(),o=Symbol.for("placeholder"),r=e=>function(...o){const r=o[0],u=e(...o);return n(u)?u.then(t(r)):r};return r.sync=n=>function(...t){return n(...t),t[0]},r.if=(u,f)=>function(...i){const c=u(...i);if(n(c))return c.then((l=e,s=o,h=((n,t)=>function(){return n(...t)})(r(f),i),p=t(i[0]),s==o?((n,t,e)=>function(o){return n(o,t,e)})(l,h,p):h==o?((n,t,e)=>function(o){return n(t,o,e)})(l,s,p):((n,t,e)=>function(o){return n(t,e,o)})(l,s,h)));var l,s,h,p;if(c){const e=f(...i);if(n(e))return e.then(t(i[0]))}return i[0]},r}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.tap=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},e=(n,t,e)=>n?t():e(),o=Symbol.for("placeholder"),r=e=>function(...o){const r=o[0],u=e(...o);return n(u)?u.then(t(r)):r};return r.if=(u,f)=>function(...i){const c=u(...i);if(n(c))return c.then((l=e,s=o,h=((n,t)=>function(){return n(...t)})(r(f),i),p=t(i[0]),s==o?((n,t,e)=>function(o){return n(o,t,e)})(l,h,p):h==o?((n,t,e)=>function(o){return n(t,o,e)})(l,s,p):((n,t,e)=>function(o){return n(t,e,o)})(l,s,h)));var l,s,h,p;if(c){const e=f(...i);if(n(e))return e.then(t(i[0]))}return i[0]},r}());

package/dist/tap.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.
  */
 
@@ -9,11 +9,6 @@ const isPromise = value => value != null && typeof value.then == 'function'
 
 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)
 }
@@ -61,8 +56,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/thunkify.es.js

@@ -1,11 +1,54 @@
 /**
- * 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 = value => value != null && typeof value.then == 'function'
+
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
+    }
+  }
+  return false
+}
+
+const promiseAll = Promise.all.bind(Promise)
+
+const __ = Symbol.for('placeholder')
+
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
+
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
+
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
+
+const funcApply = (func, args) => func(...args)
+
 const thunkify = (func, ...args) => function thunk() {
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry2(funcApply, func, __))
+  }
   return func(...args)
 }
 

package/dist/thunkify.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 thunkify=(t,...n)=>function(){return t(...n)};export default thunkify;
+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;