rubico 2.6.1 → 2.6.2

package/dist/rubico.mjs

@@ -1,17 +1,29 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
+const isArray = Array.isArray
+
 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 (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }
@@ -228,14 +240,58 @@ tap.if = function (...args) {
   return _tapIf(predicate, f, args)
 }
 
-const isArray = Array.isArray
+const areAllValuesNonfunctions = function (values) {
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      if (typeof values[index] == 'function') {
+        return false
+      }
+    }
+    return true
+  }
+
+  for (const key in values) {
+    if (typeof values[key] == 'function') {
+      return false
+    }
+  }
+  return true
+}
+
+const promiseObjectAllExecutor = object => function executor(resolve) {
+  const result = {}
+  let numPromises = 0
+  for (const key in object) {
+    const value = object[key]
+    if (isPromise(value)) {
+      numPromises += 1
+      value.then((key => function (res) {
+        result[key] = res
+        numPromises -= 1
+        if (numPromises == 0) {
+          resolve(result)
+        }
+      })(key))
+    } else {
+      result[key] = value
+    }
+  }
+  if (numPromises == 0) {
+    resolve(result)
+  }
+}
+
+const promiseObjectAll = object => new Promise(promiseObjectAllExecutor(object))
 
 const functionArrayAll = function (funcs, args) {
   const funcsLength = funcs.length,
     result = Array(funcsLength)
   let funcsIndex = -1, isAsync = false
   while (++funcsIndex < funcsLength) {
-    const resultItem = funcs[funcsIndex](...args)
+    const f = funcs[funcsIndex]
+    const resultItem = typeof f == 'function' ? f(...args) : f
     if (isPromise(resultItem)) {
       isAsync = true
     }
@@ -317,7 +373,8 @@ const functionArrayAllSeries = function (funcs, args) {
 const functionObjectAll = function (funcs, args) {
   const result = {}, promises = []
   for (const key in funcs) {
-    const resultItem = funcs[key](...args)
+    const f = funcs[key]
+    const resultItem = typeof f == 'function' ? f(...args) : f
     if (isPromise(resultItem)) {
       promises.push(resultItem.then(curry3(objectSet, result, key, __)))
     } else {
@@ -327,7 +384,48 @@ const functionObjectAll = function (funcs, args) {
   return promises.length == 0 ? result : promiseAll(promises).then(always(result))
 }
 
+const _allValues = function (values) {
+  if (isArray(values)) {
+    return areAnyValuesPromises(values)
+      ? promiseAll(values)
+      : values
+  }
+  return areAnyValuesPromises(values)
+    ? promiseObjectAll(values)
+    : values
+}
+
 const all = function (...args) {
+  if (args.length == 1) {
+    const resolversOrValues = args[0]
+    if (isPromise(resolversOrValues)) {
+      return resolversOrValues.then(_allValues)
+    }
+    if (areAllValuesNonfunctions(resolversOrValues)) {
+      return _allValues(resolversOrValues)
+    }
+    return isArray(resolversOrValues)
+      ? curryArgs2(functionArrayAll, resolversOrValues, __)
+      : curryArgs2(functionObjectAll, resolversOrValues, __)
+  }
+
+  const resolversOrValues = args[args.length - 1]
+  const argValues = args.slice(0, -1)
+
+  if (areAnyValuesPromises(argValues)) {
+    return isArray(resolversOrValues)
+      ? promiseAll(argValues)
+        .then(curry2(functionArrayAll, resolversOrValues, __))
+      : promiseAll(argValues)
+        .then(curry2(functionObjectAll, resolversOrValues, __))
+  }
+
+  return isArray(resolversOrValues)
+    ? functionArrayAll(resolversOrValues, argValues)
+    : functionObjectAll(resolversOrValues, argValues)
+
+  /*
+  ////////////////////////////////////////////////////////////////
   const funcs = args.pop()
   if (args.length == 0) {
     return isArray(funcs)
@@ -344,6 +442,7 @@ const all = function (...args) {
   return isArray(funcs)
     ? functionArrayAll(funcs, args)
     : functionObjectAll(funcs, args)
+  */
 }
 
 all.series = function allSeries(...args) {
@@ -454,17 +553,6 @@ const arrayConditional = function (array, args, funcsIndex) {
     : defaultResolverOrValue
 }
 
-const areAllValuesNonfunctions = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    if (typeof values[index] == 'function') {
-      return false
-    }
-  }
-  return true
-}
-
 const thunkify2 = (func, arg0, arg1) => function thunk() {
   return func(arg0, arg1)
 }
@@ -613,31 +701,6 @@ const mapMap = function (value, mapper) {
     : promiseAll(promises).then(always(result))
 }
 
-const promiseObjectAllExecutor = object => function executor(resolve) {
-  const result = {}
-  let numPromises = 0
-  for (const key in object) {
-    const value = object[key]
-    if (isPromise(value)) {
-      numPromises += 1
-      value.then((key => function (res) {
-        result[key] = res
-        numPromises -= 1
-        if (numPromises == 0) {
-          resolve(result)
-        }
-      })(key))
-    } else {
-      result[key] = value
-    }
-  }
-  if (numPromises == 0) {
-    resolve(result)
-  }
-}
-
-const promiseObjectAll = object => new Promise(promiseObjectAllExecutor(object))
-
 const objectMap = function (object, mapper) {
   const result = {}
   let isAsync = false

package/dist/set.es.js

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

package/dist/set.es.min.js

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

package/dist/set.js

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

package/dist/set.min.js

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

package/dist/set.mjs

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

package/dist/some.es.js

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

package/dist/some.es.min.js

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

package/dist/some.js

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

package/dist/some.min.js

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

package/dist/some.mjs

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

package/dist/switchCase.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -7,13 +7,25 @@
 
 const promiseAll = Promise.all.bind(Promise)
 
+const isArray = Array.isArray
+
 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 (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }
@@ -109,10 +121,19 @@ const arrayConditional = function (array, args, funcsIndex) {
 }
 
 const areAllValuesNonfunctions = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    if (typeof values[index] == 'function') {
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      if (typeof values[index] == 'function') {
+        return false
+      }
+    }
+    return true
+  }
+
+  for (const key in values) {
+    if (typeof values[key] == 'function') {
       return false
     }
   }

package/dist/switchCase.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const promiseAll=Promise.all.bind(Promise),isPromise=n=>null!=n&&"function"==typeof n.then,areAnyValuesPromises=function(n){const r=n.length;let t=-1;for(;++t<r;){const r=n[t];if(isPromise(r))return!0}return!1},thunkConditional=(n,r,t)=>n?r():t(),thunkifyArgs=(n,r)=>function(){return n(...r)},thunkify3=(n,r,t,o)=>function(){return n(r,t,o)},__=Symbol.for("placeholder"),curry3ResolveArg0=(n,r,t)=>function(o){return n(o,r,t)},curry3ResolveArg1=(n,r,t)=>function(o){return n(r,o,t)},curry3ResolveArg2=(n,r,t)=>function(o){return n(r,t,o)},curry3=function(n,r,t,o){return r==__?curry3ResolveArg0(n,t,o):t==__?curry3ResolveArg1(n,r,o):curry3ResolveArg2(n,r,t)},always=n=>function(){return n},arrayConditional=function(n,r,t){const o=n.length-1;for(;(t+=2)<o;){const o=n[t],e=n[t+1],u="function"==typeof o?o(...r):o;if(isPromise(u))return u.then(curry3(thunkConditional,__,"function"==typeof e?thunkifyArgs(e,r):always(e),thunkify3(arrayConditional,n,r,t)));if(u)return"function"==typeof e?e(...r):e}if(t==n.length)return;const e=n[o];return"function"==typeof e?e(...r):e},areAllValuesNonfunctions=function(n){const r=n.length;let t=-1;for(;++t<r;)if("function"==typeof n[t])return!1;return!0},thunkify2=(n,r,t)=>function(){return n(r,t)},nonfunctionsConditional=function(n,r){const t=n.length,o=t-1;for(;(r+=2)<o;){const t=n[r],o=n[r+1];if(isPromise(t))return t.then(curry3(thunkConditional,__,always(o),thunkify2(nonfunctionsConditional,n,r)));if(t)return o}if(r!=t)return n[r]},curryArgs3ResolveArgs0=(n,r,t)=>function(...o){return n(o,r,t)},curryArgs3ResolveArgs1=(n,r,t)=>function(...o){return n(r,o,t)},curryArgs3ResolveArgs2=(n,r,t)=>function(...o){return n(r,t,o)},curryArgs3=function(n,r,t,o){return r==__?curryArgs3ResolveArgs0(n,t,o):t==__?curryArgs3ResolveArgs1(n,r,o):curryArgs3ResolveArgs2(n,r,t)},switchCase=(...n)=>{const r=n.pop();return areAllValuesNonfunctions(r)?nonfunctionsConditional(r,-2):0==n.length?curryArgs3(arrayConditional,r,__,-2):areAnyValuesPromises(n)?promiseAll(n).then(curry3(arrayConditional,r,__,-2)):arrayConditional(r,n,-2)};export default switchCase;
+const promiseAll=Promise.all.bind(Promise),isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){if(isArray(r)){const n=r.length;let t=-1;for(;++t<n;){const n=r[t];if(isPromise(n))return!0}return!1}for(const n in r){const t=r[n];if(isPromise(t))return!0}return!1},thunkConditional=(r,n,t)=>r?n():t(),thunkifyArgs=(r,n)=>function(){return r(...n)},thunkify3=(r,n,t,o)=>function(){return r(n,t,o)},__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,t)=>function(o){return r(o,n,t)},curry3ResolveArg1=(r,n,t)=>function(o){return r(n,o,t)},curry3ResolveArg2=(r,n,t)=>function(o){return r(n,t,o)},curry3=function(r,n,t,o){return n==__?curry3ResolveArg0(r,t,o):t==__?curry3ResolveArg1(r,n,o):curry3ResolveArg2(r,n,t)},always=r=>function(){return r},arrayConditional=function(r,n,t){const o=r.length-1;for(;(t+=2)<o;){const o=r[t],e=r[t+1],i="function"==typeof o?o(...n):o;if(isPromise(i))return i.then(curry3(thunkConditional,__,"function"==typeof e?thunkifyArgs(e,n):always(e),thunkify3(arrayConditional,r,n,t)));if(i)return"function"==typeof e?e(...n):e}if(t==r.length)return;const e=r[o];return"function"==typeof e?e(...n):e},areAllValuesNonfunctions=function(r){if(isArray(r)){const n=r.length;let t=-1;for(;++t<n;)if("function"==typeof r[t])return!1;return!0}for(const n in r)if("function"==typeof r[n])return!1;return!0},thunkify2=(r,n,t)=>function(){return r(n,t)},nonfunctionsConditional=function(r,n){const t=r.length,o=t-1;for(;(n+=2)<o;){const t=r[n],o=r[n+1];if(isPromise(t))return t.then(curry3(thunkConditional,__,always(o),thunkify2(nonfunctionsConditional,r,n)));if(t)return o}if(n!=t)return r[n]},curryArgs3ResolveArgs0=(r,n,t)=>function(...o){return r(o,n,t)},curryArgs3ResolveArgs1=(r,n,t)=>function(...o){return r(n,o,t)},curryArgs3ResolveArgs2=(r,n,t)=>function(...o){return r(n,t,o)},curryArgs3=function(r,n,t,o){return n==__?curryArgs3ResolveArgs0(r,t,o):t==__?curryArgs3ResolveArgs1(r,n,o):curryArgs3ResolveArgs2(r,n,t)},switchCase=(...r)=>{const n=r.pop();return areAllValuesNonfunctions(n)?nonfunctionsConditional(n,-2):0==r.length?curryArgs3(arrayConditional,n,__,-2):areAnyValuesPromises(r)?promiseAll(r).then(curry3(arrayConditional,n,__,-2)):arrayConditional(n,r,-2)};export default switchCase;

package/dist/switchCase.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -13,13 +13,25 @@
 
 const promiseAll = Promise.all.bind(Promise)
 
+const isArray = Array.isArray
+
 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 (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }
@@ -115,10 +127,19 @@ const arrayConditional = function (array, args, funcsIndex) {
 }
 
 const areAllValuesNonfunctions = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    if (typeof values[index] == 'function') {
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      if (typeof values[index] == 'function') {
+        return false
+      }
+    }
+    return true
+  }
+
+  for (const key in values) {
+    if (typeof values[key] == 'function') {
       return false
     }
   }

package/dist/switchCase.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 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=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}}());
+!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=Array.isArray,r=n=>null!=n&&"function"==typeof n.then,o=(n,t,r)=>n?t():r(),e=(n,t)=>function(){return n(...t)},u=(n,t,r,o)=>function(){return n(t,r,o)},f=Symbol.for("placeholder"),i=function(n,t,r,o){return t==f?((n,t,r)=>function(o){return n(o,t,r)})(n,r,o):r==f?((n,t,r)=>function(o){return n(t,o,r)})(n,t,o):((n,t,r)=>function(o){return n(t,r,o)})(n,t,r)},c=n=>function(){return n},s=function(n,t,l){const h=n.length-1;for(;(l+=2)<h;){const h=n[l],p=n[l+1],y="function"==typeof h?h(...t):h;if(r(y))return y.then(i(o,f,"function"==typeof p?e(p,t):c(p),u(s,n,t,l)));if(y)return"function"==typeof p?p(...t):p}if(l==n.length)return;const p=n[h];return"function"==typeof p?p(...t):p},l=(n,t,r)=>function(){return n(t,r)},h=function(n,t){const e=n.length,u=e-1;for(;(t+=2)<u;){const e=n[t],u=n[t+1];if(r(e))return e.then(i(o,f,c(u),l(h,n,t)));if(e)return u}if(t!=e)return n[t]};return(...o)=>{const e=o.pop();return function(n){if(t(n)){const t=n.length;let r=-1;for(;++r<t;)if("function"==typeof n[r])return!1;return!0}for(const t in n)if("function"==typeof n[t])return!1;return!0}(e)?h(e,-2):0==o.length?(u=s,l=f,p=-2,(c=e)==f?((n,t,r)=>function(...o){return n(o,t,r)})(u,l,p):l==f?((n,t,r)=>function(...o){return n(t,o,r)})(u,c,p):((n,t,r)=>function(...o){return n(t,r,o)})(u,c,l)):function(n){if(t(n)){const t=n.length;let o=-1;for(;++o<t;){const t=n[o];if(r(t))return!0}return!1}for(const t in n){const o=n[t];if(r(o))return!0}return!1}(o)?n(o).then(i(s,e,f,-2)):s(e,o,-2);var u,c,l,p}}());

package/dist/switchCase.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -7,13 +7,25 @@
 
 const promiseAll = Promise.all.bind(Promise)
 
+const isArray = Array.isArray
+
 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 (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }
@@ -109,10 +121,19 @@ const arrayConditional = function (array, args, funcsIndex) {
 }
 
 const areAllValuesNonfunctions = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    if (typeof values[index] == 'function') {
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      if (typeof values[index] == 'function') {
+        return false
+      }
+    }
+    return true
+  }
+
+  for (const key in values) {
+    if (typeof values[key] == 'function') {
       return false
     }
   }

package/dist/tap.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -122,11 +122,23 @@ const curryArgs3 = function (baseFunc, arg0, arg1, arg2) {
   return curryArgs3ResolveArgs2(baseFunc, arg0, arg1)
 }
 
+const isArray = Array.isArray
+
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/tap.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (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,e)=>function(){return r(...e)},thunkConditional=(r,e,n)=>r?e():n(),__=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)},curryArgs2ResolveArgs0=(r,e,n)=>function(...n){return r(n,e)},curryArgs2ResolveArgs1=(r,e,n)=>function(...n){return r(e,n)},curryArgs2=function(r,e,n){return e==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,e)},curryArgs3ResolveArgs0=(r,e,n)=>function(...t){return r(t,e,n)},curryArgs3ResolveArgs1=(r,e,n)=>function(...t){return r(e,t,n)},curryArgs3ResolveArgs2=(r,e,n)=>function(...t){return r(e,n,t)},curryArgs3=function(r,e,n,t){return e==__?curryArgs3ResolveArgs0(r,n,t):n==__?curryArgs3ResolveArgs1(r,e,t):curryArgs3ResolveArgs2(r,e,n)},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),_tap=function(r,e){const n=r[0],t=e(...r);return isPromise(t)?t.then(always(n)):n},tap=function(...r){const e=r.pop();return 0==r.length?curryArgs2(_tap,__,e):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_tap,__,e)):_tap(r,e)},_tapIf=function(r,e,n){const t=r(...n);if(isPromise(t))return t.then(curry3(thunkConditional,__,thunkifyArgs(tap(e),n),always(n[0])));if(t){const r=e(...n);if(isPromise(r))return r.then(always(n[0]))}return n[0]};tap.if=function(...r){if(2==r.length)return curryArgs3(_tapIf,r[0],r[1],__);const e=r.length,n=r[e-1],t=r[e-2],u=r.slice(0,-2);return areAnyValuesPromises(u)?promiseAll(u).then(curry3(_tapIf,t,n,__)):_tapIf(t,n,r)};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"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},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)},curryArgs3ResolveArgs0=(r,n,e)=>function(...t){return r(t,n,e)},curryArgs3ResolveArgs1=(r,n,e)=>function(...t){return r(n,t,e)},curryArgs3ResolveArgs2=(r,n,e)=>function(...t){return r(n,e,t)},curryArgs3=function(r,n,e,t){return n==__?curryArgs3ResolveArgs0(r,e,t):e==__?curryArgs3ResolveArgs1(r,n,t):curryArgs3ResolveArgs2(r,n,e)},isArray=Array.isArray,areAnyValuesPromises=function(r){if(isArray(r)){const n=r.length;let e=-1;for(;++e<n;){const n=r[e];if(isPromise(n))return!0}return!1}for(const n in r){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),_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?curryArgs2(_tap,__,n):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_tap,__,n)):_tap(r,n)},_tapIf=function(r,n,e){const t=r(...e);if(isPromise(t))return t.then(curry3(thunkConditional,__,thunkifyArgs(tap(n),e),always(e[0])));if(t){const r=n(...e);if(isPromise(r))return r.then(always(e[0]))}return e[0]};tap.if=function(...r){if(2==r.length)return curryArgs3(_tapIf,r[0],r[1],__);const n=r.length,e=r[n-1],t=r[n-2],s=r.slice(0,-2);return areAnyValuesPromises(s)?promiseAll(s).then(curry3(_tapIf,t,e,__)):_tapIf(t,e,r)};export default tap;

package/dist/tap.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -128,11 +128,23 @@ const curryArgs3 = function (baseFunc, arg0, arg1, arg2) {
   return curryArgs3ResolveArgs2(baseFunc, arg0, arg1)
 }
 
+const isArray = Array.isArray
+
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/tap.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 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},r=(n,t,r)=>n?t():r(),e=Symbol.for("placeholder"),u=function(n,t,r,u){return t==e?((n,t,r)=>function(e){return n(e,t,r)})(n,r,u):r==e?((n,t,r)=>function(e){return n(t,e,r)})(n,t,u):((n,t,r)=>function(e){return n(t,r,e)})(n,t,r)},o=function(t){const r=t.length;let e=-1;for(;++e<r;){const r=t[e];if(n(r))return!0}return!1},i=Promise.all.bind(Promise),f=function(r,e){const u=r[0],o=e(...r);return n(o)?o.then(t(u)):u},c=function(...n){const t=n.pop();return 0==n.length?(r=f,c=t,(u=e)==e?((n,t)=>function(...r){return n(r,t)})(r,c):((n,t)=>function(...r){return n(t,r)})(r,u)):o(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,u,c},l=function(o,i,f){const l=o(...f);if(n(l))return l.then(u(r,e,((n,t)=>function(){return n(...t)})(c(i),f),t(f[0])));if(l){const r=i(...f);if(n(r))return r.then(t(f[0]))}return f[0]};return c.if=function(...n){if(2==n.length)return t=l,r=n[0],f=n[1],c=e,r==e?((n,t,r)=>function(...e){return n(e,t,r)})(t,f,c):f==e?((n,t,r)=>function(...e){return n(t,e,r)})(t,r,c):((n,t,r)=>function(...e){return n(t,r,e)})(t,r,f);var t,r,f,c;const s=n.length,h=n[s-1],p=n[s-2],a=n.slice(0,-2);return o(a)?i(a).then(u(l,p,h,e)):l(p,h,n)},c}());
+!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},r=(n,t,r)=>n?t():r(),e=Symbol.for("placeholder"),u=function(n,t,r,u){return t==e?((n,t,r)=>function(e){return n(e,t,r)})(n,r,u):r==e?((n,t,r)=>function(e){return n(t,e,r)})(n,t,u):((n,t,r)=>function(e){return n(t,r,e)})(n,t,r)},o=Array.isArray,i=function(t){if(o(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},f=Promise.all.bind(Promise),c=function(r,e){const u=r[0],o=e(...r);return n(o)?o.then(t(u)):u},s=function(...n){const t=n.pop();return 0==n.length?(r=c,o=t,(u=e)==e?((n,t)=>function(...r){return n(r,t)})(r,o):((n,t)=>function(...r){return n(t,r)})(r,u)):i(n)?f(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)}(c,e,t)):c(n,t);var r,u,o},l=function(o,i,f){const c=o(...f);if(n(c))return c.then(u(r,e,((n,t)=>function(){return n(...t)})(s(i),f),t(f[0])));if(c){const r=i(...f);if(n(r))return r.then(t(f[0]))}return f[0]};return s.if=function(...n){if(2==n.length)return t=l,r=n[0],o=n[1],c=e,r==e?((n,t,r)=>function(...e){return n(e,t,r)})(t,o,c):o==e?((n,t,r)=>function(...e){return n(t,e,r)})(t,r,c):((n,t,r)=>function(...e){return n(t,r,e)})(t,r,o);var t,r,o,c;const s=n.length,h=n[s-1],a=n[s-2],p=n.slice(0,-2);return i(p)?f(p).then(u(l,a,h,e)):l(a,h,n)},s}());

package/dist/tap.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.1
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -122,11 +122,23 @@ const curryArgs3 = function (baseFunc, arg0, arg1, arg2) {
   return curryArgs3ResolveArgs2(baseFunc, arg0, arg1)
 }
 
+const isArray = Array.isArray
+
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }