rubico 1.9.6 → 2.0.0

package/dist/pick.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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,memoizeCappedUnary=function(t,e){const r=new Map,n=function(n){if(r.has(n))return r.get(n);const i=t(n);return r.set(n,i),r.size>e&&r.clear(),i};return n.cache=r,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(t){const e=t.length-1,r="["==t[0],n="]"==t[e];return r&&n?t.slice(1,e).split(pathDelimiters):r?t.slice(1).split(pathDelimiters):n?t.slice(0,e).split(pathDelimiters):t.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=t=>isArray(t)?t:"string"==typeof t?memoizedCappedParsePropertyPath(t):[t],getByPath=function(t,e){const r=propertyPathToArray(e),n=r.length;let i=-1,s=t;for(;++i<n;)if(s=s[r[i]],null==s)return;return s},isObject=t=>{if(null==t)return!1;const e=typeof t;return"object"==e||"function"==e},setByPath=function(t,e,r){if(!isObject(t))return t;const n=propertyPathToArray(r),i=n.length,s=i-1,a={...t};let o=a,p=-1;for(;++p<i;){const t=n[p];if(p==s)o[t]=e;else{const e=o[t],r=isArray(e)?e.slice():{...e};o[t]=r,o=r}}return a},pick=t=>function(e){if(null==e)return e;const r=t.length;let n={},i=-1;for(;++i<r;){const r=t[i],s=getByPath(e,r);null!=s&&(n=setByPath(n,s,r))}return n};export default pick;
+const isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,memoizeCappedUnary=function(r,t){const e=new Map,n=function(n){if(e.has(n))return e.get(n);const i=r(n);return e.set(n,i),e.size>t&&e.clear(),i};return n.cache=e,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const t=r.length-1,e="["==r[0],n="]"==r[t];return e&&n?r.slice(1,t).split(pathDelimiters):e?r.slice(1).split(pathDelimiters):n?r.slice(0,t).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,t){const e=propertyPathToArray(t),n=e.length;let i=-1,o=r;for(;++i<n;)if(o=o[e[i]],null==o)return;return o},isObject=r=>{if(null==r)return!1;const t=typeof r;return"object"==t||"function"==t},setByPath=function(r,t,e){if(!isObject(r))return r;const n=propertyPathToArray(e),i=n.length,o=i-1,c={...r};let s=c,l=-1;for(;++l<i;){const r=n[l];if(l==o)s[r]=t;else{const t=s[r],e=isArray(t)?t.slice():{...t};s[r]=e,s=e}}return c},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(e){return r(e,t)},curry2ResolveArg1=(r,t)=>function(e){return r(t,e)},curry2=function(r,t,e){return t==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,t)},_pick=function(r,t){if(null==r)return r;const e=t.length;let n={},i=-1;for(;++i<e;){const e=t[i],o=getByPath(r,e);null!=o&&(n=setByPath(n,o,e))}return n},pick=function(r,t){return null==t?curry2(_pick,__,r):null!=(e=r)&&"function"==typeof e.then?r.then(curry2(_pick,__,t)):_pick(r,t);var e};export default pick;

package/dist/pick.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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,6 +11,8 @@
   else (root.pick = pick) // Browser
 }(typeof globalThis == 'object' ? globalThis : this, (function () { 'use strict'
 
+const isPromise = value => value != null && typeof value.then == 'function'
+
 const isArray = Array.isArray
 
 const memoizeCappedUnary = function (func, cap) {
@@ -105,7 +107,30 @@ const setByPath = function (obj, value, path) {
   return result
 }
 
-const pick = keys => function picking(source) {
+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)
+}
+
+// _pick(source Object, keys Array<string>) -> result Object
+const _pick = function (source, keys) {
   if (source == null) {
     return source
   }
@@ -122,5 +147,15 @@ const pick = keys => function picking(source) {
   return result
 }
 
+const pick = function (arg0, arg1) {
+  if (arg1 == null) {
+    return curry2(_pick, __, arg0)
+  }
+  if (isPromise(arg0)) {
+    return arg0.then(curry2(_pick, __, arg1))
+  }
+  return _pick(arg0, arg1)
+}
+
 return pick
 }())))

package/dist/pick.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define((()=>n)):t.pick=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=Array.isArray,n=/[.|[|\]]+/,e=function(t,n){const e=new Map,o=function(o){if(e.has(o))return e.get(o);const r=t(o);return e.set(o,r),e.size>n&&e.clear(),r};return o.cache=e,o}((function(t){const e=t.length-1,o="["==t[0],r="]"==t[e];return o&&r?t.slice(1,e).split(n):o?t.slice(1).split(n):r?t.slice(0,e).split(n):t.split(n)}),500),o=n=>t(n)?n:"string"==typeof n?e(n):[n],r=function(t,n){const e=o(n),r=e.length;let i=-1,c=t;for(;++i<r;)if(c=c[e[i]],null==c)return;return c},i=function(n,e,r){if(!(t=>{if(null==t)return!1;const n=typeof t;return"object"==n||"function"==n})(n))return n;const i=o(r),c=i.length,l=c-1,s={...n};let u=s,f=-1;for(;++f<c;){const n=i[f];if(f==l)u[n]=e;else{const e=u[n],o=t(e)?e.slice():{...e};u[n]=o,u=o}}return s};return t=>function(n){if(null==n)return n;const e=t.length;let o={},c=-1;for(;++c<e;){const e=t[c],l=r(n,e);null!=l&&(o=i(o,l,e))}return o}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.pick=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=/[.|[|\]]+/,e=function(n,t){const e=new Map,r=function(r){if(e.has(r))return e.get(r);const o=n(r);return e.set(r,o),e.size>t&&e.clear(),o};return r.cache=e,r}((function(n){const e=n.length-1,r="["==n[0],o="]"==n[e];return r&&o?n.slice(1,e).split(t):r?n.slice(1).split(t):o?n.slice(0,e).split(t):n.split(t)}),500),r=t=>n(t)?t:"string"==typeof t?e(t):[t],o=function(n,t){const e=r(t),o=e.length;let u=-1,c=n;for(;++u<o;)if(c=c[e[u]],null==c)return;return c},u=function(t,e,o){if(!(n=>{if(null==n)return!1;const t=typeof n;return"object"==t||"function"==t})(t))return t;const u=r(o),c=u.length,i=c-1,l={...t};let f=l,s=-1;for(;++s<c;){const t=u[s];if(s==i)f[t]=e;else{const e=f[t],r=n(e)?e.slice():{...e};f[t]=r,f=r}}return l},c=Symbol.for("placeholder"),i=function(n,t,e){return t==c?((n,t)=>function(e){return n(e,t)})(n,e):((n,t)=>function(e){return n(t,e)})(n,t)},l=function(n,t){if(null==n)return n;const e=t.length;let r={},c=-1;for(;++c<e;){const e=t[c],i=o(n,e);null!=i&&(r=u(r,i,e))}return r};return function(n,t){return null==t?i(l,c,n):null!=(e=n)&&"function"==typeof e.then?n.then(i(l,c,t)):l(n,t);var e}}());

package/dist/pick.min.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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,memoizeCappedUnary=function(t,e){const r=new Map,n=function(n){if(r.has(n))return r.get(n);const i=t(n);return r.set(n,i),r.size>e&&r.clear(),i};return n.cache=r,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(t){const e=t.length-1,r="["==t[0],n="]"==t[e];return r&&n?t.slice(1,e).split(pathDelimiters):r?t.slice(1).split(pathDelimiters):n?t.slice(0,e).split(pathDelimiters):t.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=t=>isArray(t)?t:"string"==typeof t?memoizedCappedParsePropertyPath(t):[t],getByPath=function(t,e){const r=propertyPathToArray(e),n=r.length;let i=-1,s=t;for(;++i<n;)if(s=s[r[i]],null==s)return;return s},isObject=t=>{if(null==t)return!1;const e=typeof t;return"object"==e||"function"==e},setByPath=function(t,e,r){if(!isObject(t))return t;const n=propertyPathToArray(r),i=n.length,s=i-1,a={...t};let o=a,p=-1;for(;++p<i;){const t=n[p];if(p==s)o[t]=e;else{const e=o[t],r=isArray(e)?e.slice():{...e};o[t]=r,o=r}}return a},pick=t=>function(e){if(null==e)return e;const r=t.length;let n={},i=-1;for(;++i<r;){const r=t[i],s=getByPath(e,r);null!=s&&(n=setByPath(n,s,r))}return n};export default pick;
+const isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,memoizeCappedUnary=function(r,t){const e=new Map,n=function(n){if(e.has(n))return e.get(n);const i=r(n);return e.set(n,i),e.size>t&&e.clear(),i};return n.cache=e,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const t=r.length-1,e="["==r[0],n="]"==r[t];return e&&n?r.slice(1,t).split(pathDelimiters):e?r.slice(1).split(pathDelimiters):n?r.slice(0,t).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,t){const e=propertyPathToArray(t),n=e.length;let i=-1,o=r;for(;++i<n;)if(o=o[e[i]],null==o)return;return o},isObject=r=>{if(null==r)return!1;const t=typeof r;return"object"==t||"function"==t},setByPath=function(r,t,e){if(!isObject(r))return r;const n=propertyPathToArray(e),i=n.length,o=i-1,c={...r};let s=c,l=-1;for(;++l<i;){const r=n[l];if(l==o)s[r]=t;else{const t=s[r],e=isArray(t)?t.slice():{...t};s[r]=e,s=e}}return c},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(e){return r(e,t)},curry2ResolveArg1=(r,t)=>function(e){return r(t,e)},curry2=function(r,t,e){return t==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,t)},_pick=function(r,t){if(null==r)return r;const e=t.length;let n={},i=-1;for(;++i<e;){const e=t[i],o=getByPath(r,e);null!=o&&(n=setByPath(n,o,e))}return n},pick=function(r,t){return null==t?curry2(_pick,__,r):null!=(e=r)&&"function"==typeof e.then?r.then(curry2(_pick,__,t)):_pick(r,t);var e};export default pick;

package/dist/pick.mjs

@@ -1,10 +1,12 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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 isArray = Array.isArray
 
 const memoizeCappedUnary = function (func, cap) {
@@ -99,7 +101,30 @@ const setByPath = function (obj, value, path) {
   return result
 }
 
-const pick = keys => function picking(source) {
+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)
+}
+
+// _pick(source Object, keys Array<string>) -> result Object
+const _pick = function (source, keys) {
   if (source == null) {
     return source
   }
@@ -116,4 +141,14 @@ const pick = keys => function picking(source) {
   return result
 }
 
+const pick = function (arg0, arg1) {
+  if (arg1 == null) {
+    return curry2(_pick, __, arg0)
+  }
+  if (isPromise(arg0)) {
+    return arg0.then(curry2(_pick, __, arg1))
+  }
+  return _pick(arg0, arg1)
+}
+
 export default pick

package/dist/pipe.es.js

@@ -1,14 +1,26 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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 noop = function () {}
-
 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 funcConcat = (
   funcA, funcB,
 ) => function pipedFunction(...args) {
@@ -18,59 +30,43 @@ const funcConcat = (
     : funcB(intermediate)
 }
 
-const funcConcatSync = (
-  funcA, funcB,
-) => function pipedFunction(...args) {
-  return funcB(funcA(...args))
-}
-
-const objectProto = Object.prototype
-
-const nativeObjectToString = objectProto.toString
+const funcApply = (func, args) => func(...args)
 
-const objectToString = value => nativeObjectToString.call(value)
+const __ = Symbol.for('placeholder')
 
-const generatorFunctionTag = '[object GeneratorFunction]'
-
-const isGeneratorFunction = value => objectToString(value) == generatorFunctionTag
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
 
-const asyncGeneratorFunctionTag = '[object AsyncGeneratorFunction]'
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
 
-const isAsyncGeneratorFunction = value => objectToString(value) == asyncGeneratorFunctionTag
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
 
 const pipe = function (...args) {
   const funcs = args.pop()
+  const pipeline = funcs.reduce(funcConcat)
 
-  if (args.length > 0) {
-    return funcs.reduce(funcConcat)(...args)
+  if (args.length == 0) {
+    return pipeline
   }
 
-  let functionPipeline = noop,
-    functionComposition = noop
-  return function pipeline(...args) {
-    const firstArg = args[0]
-
-    if (
-      typeof firstArg == 'function'
-        && !isGeneratorFunction(firstArg)
-        && !isAsyncGeneratorFunction(firstArg)
-    ) {
-      if (functionComposition == noop) {
-        functionComposition = funcs.reduceRight(funcConcat)
-      }
-      return functionComposition(firstArg)
-    }
-
-    if (functionPipeline == noop) {
-      functionPipeline = funcs.reduce(funcConcat)
-    }
-    return functionPipeline(...args)
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry2(funcApply, pipeline, __))
   }
-}
 
-// funcs Array<function> -> pipeline function
-const pipeSync = funcs => funcs.reduce(funcConcatSync)
-
-pipe.sync = pipeSync
+  return pipeline(...args)
+}
 
 export default pipe

package/dist/pipe.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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 noop=function(){},isPromise=n=>null!=n&&"function"==typeof n.then,funcConcat=(n,t)=>function(...o){const e=n(...o);return null!=(c=e)&&"function"==typeof c.then?e.then(t):t(e);var c},funcConcatSync=(n,t)=>function(...o){return t(n(...o))},objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=n=>nativeObjectToString.call(n),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=n=>objectToString(n)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=n=>objectToString(n)==asyncGeneratorFunctionTag,pipe=function(...n){const t=n.pop();if(n.length>0)return t.reduce(funcConcat)(...n);let o=noop,e=noop;return function(...n){const c=n[0];return"function"!=typeof c||objectToString(c)==generatorFunctionTag||isAsyncGeneratorFunction(c)?(o==noop&&(o=t.reduce(funcConcat)),o(...n)):(e==noop&&(e=t.reduceRight(funcConcat)),e(c))}},pipeSync=n=>n.reduce(funcConcatSync);pipe.sync=pipeSync;export default pipe;
+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),funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},funcApply=(r,e)=>r(...e),__=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)},pipe=function(...r){const e=r.pop().reduce(funcConcat);return 0==r.length?e:areAnyValuesPromises(r)?promiseAll(r).then((n=funcApply,t=__,(o=e)==__?curry2ResolveArg0(n,t):curry2ResolveArg1(n,o))):e(...r);var n,o,t};export default pipe;

package/dist/pipe.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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,10 +11,22 @@
   else (root.pipe = pipe) // Browser
 }(typeof globalThis == 'object' ? globalThis : this, (function () { 'use strict'
 
-const noop = function () {}
-
 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 funcConcat = (
   funcA, funcB,
 ) => function pipedFunction(...args) {
@@ -24,60 +36,44 @@ const funcConcat = (
     : funcB(intermediate)
 }
 
-const funcConcatSync = (
-  funcA, funcB,
-) => function pipedFunction(...args) {
-  return funcB(funcA(...args))
-}
-
-const objectProto = Object.prototype
-
-const nativeObjectToString = objectProto.toString
+const funcApply = (func, args) => func(...args)
 
-const objectToString = value => nativeObjectToString.call(value)
+const __ = Symbol.for('placeholder')
 
-const generatorFunctionTag = '[object GeneratorFunction]'
-
-const isGeneratorFunction = value => objectToString(value) == generatorFunctionTag
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
 
-const asyncGeneratorFunctionTag = '[object AsyncGeneratorFunction]'
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
 
-const isAsyncGeneratorFunction = value => objectToString(value) == asyncGeneratorFunctionTag
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
 
 const pipe = function (...args) {
   const funcs = args.pop()
+  const pipeline = funcs.reduce(funcConcat)
 
-  if (args.length > 0) {
-    return funcs.reduce(funcConcat)(...args)
+  if (args.length == 0) {
+    return pipeline
   }
 
-  let functionPipeline = noop,
-    functionComposition = noop
-  return function pipeline(...args) {
-    const firstArg = args[0]
-
-    if (
-      typeof firstArg == 'function'
-        && !isGeneratorFunction(firstArg)
-        && !isAsyncGeneratorFunction(firstArg)
-    ) {
-      if (functionComposition == noop) {
-        functionComposition = funcs.reduceRight(funcConcat)
-      }
-      return functionComposition(firstArg)
-    }
-
-    if (functionPipeline == noop) {
-      functionPipeline = funcs.reduce(funcConcat)
-    }
-    return functionPipeline(...args)
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry2(funcApply, pipeline, __))
   }
-}
 
-// funcs Array<function> -> pipeline function
-const pipeSync = funcs => funcs.reduce(funcConcatSync)
-
-pipe.sync = pipeSync
+  return pipeline(...args)
+}
 
 return pipe
 }())))

package/dist/pipe.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define((()=>n)):t.pipe=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=function(){},n=(t,n)=>function(...e){const o=t(...e);return null!=(c=o)&&"function"==typeof c.then?o.then(n):n(o);var c},e=(t,n)=>function(...e){return n(t(...e))},o=Object.prototype.toString,c=t=>o.call(t),u=function(...e){const o=e.pop();if(e.length>0)return o.reduce(n)(...e);let u=t,r=t;return function(...e){const i=e[0];return"function"!=typeof i||"[object GeneratorFunction]"==c(i)||(t=>"[object AsyncGeneratorFunction]"==c(t))(i)?(u==t&&(u=o.reduce(n)),u(...e)):(r==t&&(r=o.reduceRight(n)),r(i))}};return u.sync=t=>t.reduce(e),u}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.pipe=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Promise.all.bind(Promise),e=(t,e)=>function(...o){const r=t(...o);return n(r)?r.then(e):e(r)},o=(n,t)=>n(...t),r=Symbol.for("placeholder");return function(...u){const i=u.pop().reduce(e);return 0==u.length?i:function(t){const e=t.length;let o=-1;for(;++o<e;){const e=t[o];if(n(e))return!0}return!1}(u)?t(u).then((c=o,l=r,(f=i)==r?((n,t)=>function(e){return n(e,t)})(c,l):((n,t)=>function(e){return n(t,e)})(c,f))):i(...u);var c,f,l}}());

package/dist/pipe.min.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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 noop=function(){},isPromise=n=>null!=n&&"function"==typeof n.then,funcConcat=(n,t)=>function(...o){const e=n(...o);return null!=(c=e)&&"function"==typeof c.then?e.then(t):t(e);var c},funcConcatSync=(n,t)=>function(...o){return t(n(...o))},objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=n=>nativeObjectToString.call(n),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=n=>objectToString(n)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=n=>objectToString(n)==asyncGeneratorFunctionTag,pipe=function(...n){const t=n.pop();if(n.length>0)return t.reduce(funcConcat)(...n);let o=noop,e=noop;return function(...n){const c=n[0];return"function"!=typeof c||objectToString(c)==generatorFunctionTag||isAsyncGeneratorFunction(c)?(o==noop&&(o=t.reduce(funcConcat)),o(...n)):(e==noop&&(e=t.reduceRight(funcConcat)),e(c))}},pipeSync=n=>n.reduce(funcConcatSync);pipe.sync=pipeSync;export default pipe;
+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),funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},funcApply=(r,e)=>r(...e),__=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)},pipe=function(...r){const e=r.pop().reduce(funcConcat);return 0==r.length?e:areAnyValuesPromises(r)?promiseAll(r).then((n=funcApply,t=__,(o=e)==__?curry2ResolveArg0(n,t):curry2ResolveArg1(n,o))):e(...r);var n,o,t};export default pipe;

package/dist/pipe.mjs

@@ -1,14 +1,26 @@
 /**
- * rubico v1.9.6
+ * rubico v2.0.0
  * 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 noop = function () {}
-
 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 funcConcat = (
   funcA, funcB,
 ) => function pipedFunction(...args) {
@@ -18,59 +30,43 @@ const funcConcat = (
     : funcB(intermediate)
 }
 
-const funcConcatSync = (
-  funcA, funcB,
-) => function pipedFunction(...args) {
-  return funcB(funcA(...args))
-}
-
-const objectProto = Object.prototype
-
-const nativeObjectToString = objectProto.toString
+const funcApply = (func, args) => func(...args)
 
-const objectToString = value => nativeObjectToString.call(value)
+const __ = Symbol.for('placeholder')
 
-const generatorFunctionTag = '[object GeneratorFunction]'
-
-const isGeneratorFunction = value => objectToString(value) == generatorFunctionTag
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
 
-const asyncGeneratorFunctionTag = '[object AsyncGeneratorFunction]'
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
 
-const isAsyncGeneratorFunction = value => objectToString(value) == asyncGeneratorFunctionTag
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
 
 const pipe = function (...args) {
   const funcs = args.pop()
+  const pipeline = funcs.reduce(funcConcat)
 
-  if (args.length > 0) {
-    return funcs.reduce(funcConcat)(...args)
+  if (args.length == 0) {
+    return pipeline
   }
 
-  let functionPipeline = noop,
-    functionComposition = noop
-  return function pipeline(...args) {
-    const firstArg = args[0]
-
-    if (
-      typeof firstArg == 'function'
-        && !isGeneratorFunction(firstArg)
-        && !isAsyncGeneratorFunction(firstArg)
-    ) {
-      if (functionComposition == noop) {
-        functionComposition = funcs.reduceRight(funcConcat)
-      }
-      return functionComposition(firstArg)
-    }
-
-    if (functionPipeline == noop) {
-      functionPipeline = funcs.reduce(funcConcat)
-    }
-    return functionPipeline(...args)
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry2(funcApply, pipeline, __))
   }
-}
 
-// funcs Array<function> -> pipeline function
-const pipeSync = funcs => funcs.reduce(funcConcatSync)
-
-pipe.sync = pipeSync
+  return pipeline(...args)
+}
 
 export default pipe