rubico 2.0.1 → 2.2.0

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

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

package/dist/x/prepend.js

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

package/dist/x/prepend.min.js

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

package/dist/x/prepend.mjs

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

package/dist/x/size.es.js

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

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

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

package/dist/x/size.js

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

package/dist/x/size.min.js

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

package/dist/x/size.mjs

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

package/dist/x/trace.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.1
+ * rubico v2.2.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -59,12 +59,42 @@ const curry3 = function (baseFunc, arg0, arg1, arg2) {
   return curry3ResolveArg2(baseFunc, arg0, arg1)
 }
 
-const tap = func => function tapping(...args) {
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
+}
+
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// _tap(args Array, func function) -> Promise|any
+const _tap = function (args, func) {
   const result = args[0],
     call = func(...args)
   return isPromise(call) ? call.then(always(result)) : result
 }
 
+const tap = function (...args) {
+  const func = args.pop()
+  if (args.length == 0) {
+    return curryArgs2(_tap, __, func)
+  }
+  return _tap(args, func)
+}
+
 tap.if = (predicate, func) => function tappingIf(...args) {
   const predication = predicate(...args)
   if (isPromise(predication)) {

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.0.1
+ * rubico v2.2.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isPromise=r=>null!=r&&"function"==typeof r.then,funcConcat=(r,n)=>function(...o){const t=r(...o);return isPromise(t)?t.then(n):n(t)},always=r=>function(){return r},thunkifyArgs=(r,n)=>function(){return r(...n)},thunkConditional=(r,n,o)=>r?n():o(),__=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)},tap=r=>function(...n){const o=n[0],t=r(...n);return isPromise(t)?t.then(always(o)):o};tap.if=(r,n)=>function(...o){const t=r(...o);if(isPromise(t))return t.then((e=thunkConditional,u=__,c=thunkifyArgs(tap(n),o),s=always(o[0]),u==__?curry3ResolveArg0(e,c,s):c==__?curry3ResolveArg1(e,u,s):curry3ResolveArg2(e,u,c)));var e,u,c,s;if(t){const r=n(...o);if(isPromise(r))return r.then(always(o[0]))}return o[0]};const consoleLog=console.log,trace=function(...r){const n=r[0];return"function"==typeof n?tap((o=n,t=consoleLog,function(...r){const n=o(...r);return isPromise(n)?n.then(t):t(n)})):tap(consoleLog)(...r);var o,t};export default trace;
+const isPromise=r=>null!=r&&"function"==typeof r.then,funcConcat=(r,n)=>function(...e){const o=r(...e);return isPromise(o)?o.then(n):n(o)},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(o){return r(o,n,e)},curry3ResolveArg1=(r,n,e)=>function(o){return r(n,o,e)},curry3ResolveArg2=(r,n,e)=>function(o){return r(n,e,o)},curry3=function(r,n,e,o){return n==__?curry3ResolveArg0(r,e,o):e==__?curry3ResolveArg1(r,n,o):curry3ResolveArg2(r,n,e)},curryArgs2ResolveArgs0=(r,n,e)=>function(...e){return r(e,n)},curryArgs2ResolveArgs1=(r,n,e)=>function(...e){return r(n,e)},curryArgs2=function(r,n,e){return n==__?curryArgs2ResolveArgs0(r,e):curryArgs2ResolveArgs1(r,n)},_tap=function(r,n){const e=r[0],o=n(...r);return isPromise(o)?o.then(always(e)):e},tap=function(...r){const n=r.pop();return 0==r.length?(e=_tap,t=n,(o=__)==__?curryArgs2ResolveArgs0(e,t):curryArgs2ResolveArgs1(e,o)):_tap(r,n);var e,o,t};tap.if=(r,n)=>function(...e){const o=r(...e);if(isPromise(o))return o.then((t=thunkConditional,s=__,u=thunkifyArgs(tap(n),e),c=always(e[0]),s==__?curry3ResolveArg0(t,u,c):u==__?curry3ResolveArg1(t,s,c):curry3ResolveArg2(t,s,u)));var t,s,u,c;if(o){const r=n(...e);if(isPromise(r))return r.then(always(e[0]))}return e[0]};const consoleLog=console.log,trace=function(...r){const n=r[0];return"function"==typeof n?tap((e=n,o=consoleLog,function(...r){const n=e(...r);return isPromise(n)?n.then(o):o(n)})):tap(consoleLog)(...r);var e,o};export default trace;

package/dist/x/trace.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.1
+ * rubico v2.2.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -65,12 +65,42 @@ const curry3 = function (baseFunc, arg0, arg1, arg2) {
   return curry3ResolveArg2(baseFunc, arg0, arg1)
 }
 
-const tap = func => function tapping(...args) {
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
+}
+
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// _tap(args Array, func function) -> Promise|any
+const _tap = function (args, func) {
   const result = args[0],
     call = func(...args)
   return isPromise(call) ? call.then(always(result)) : result
 }
 
+const tap = function (...args) {
+  const func = args.pop()
+  if (args.length == 0) {
+    return curryArgs2(_tap, __, func)
+  }
+  return _tap(args, func)
+}
+
 tap.if = (predicate, func) => function tappingIf(...args) {
   const predication = predicate(...args)
   if (isPromise(predication)) {

package/dist/x/trace.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.0.1
+ * rubico v2.2.0
  * https://github.com/a-synchronous/rubico
  * (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.trace=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},o=(n,t,o)=>n?t():o(),e=Symbol.for("placeholder"),r=o=>function(...e){const r=e[0],u=o(...e);return n(u)?u.then(t(r)):r};r.if=(u,c)=>function(...f){const i=u(...f);if(n(i))return i.then((s=o,l=e,h=((n,t)=>function(){return n(...t)})(r(c),f),p=t(f[0]),l==e?((n,t,o)=>function(e){return n(e,t,o)})(s,h,p):h==e?((n,t,o)=>function(e){return n(t,e,o)})(s,l,p):((n,t,o)=>function(e){return n(t,o,e)})(s,l,h)));var s,l,h,p;if(i){const o=c(...f);if(n(o))return o.then(t(f[0]))}return f[0]};const u=console.log;return function(...t){const o=t[0];return"function"==typeof o?r((e=o,c=u,function(...t){const o=e(...t);return n(o)?o.then(c):c(o)})):r(u)(...t);var e,c}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.trace=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=n=>function(){return n},o=(n,t,o)=>n?t():o(),e=Symbol.for("placeholder"),r=function(o,e){const r=o[0],u=e(...o);return n(u)?u.then(t(r)):r},u=function(...n){const t=n.pop();return 0==n.length?(o=r,c=t,(u=e)==e?((n,t,o)=>function(...o){return n(o,t)})(o,c):((n,t,o)=>function(...o){return n(t,o)})(o,u)):r(n,t);var o,u,c};u.if=(r,c)=>function(...f){const i=r(...f);if(n(i))return i.then((s=o,l=e,h=((n,t)=>function(){return n(...t)})(u(c),f),p=t(f[0]),l==e?((n,t,o)=>function(e){return n(e,t,o)})(s,h,p):h==e?((n,t,o)=>function(e){return n(t,e,o)})(s,l,p):((n,t,o)=>function(e){return n(t,o,e)})(s,l,h)));var s,l,h,p;if(i){const o=c(...f);if(n(o))return o.then(t(f[0]))}return f[0]};const c=console.log;return function(...t){const o=t[0];return"function"==typeof o?u((e=o,r=c,function(...t){const o=e(...t);return n(o)?o.then(r):r(o)})):u(c)(...t);var e,r}}());

package/dist/x/trace.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.1
+ * rubico v2.2.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -59,12 +59,42 @@ const curry3 = function (baseFunc, arg0, arg1, arg2) {
   return curry3ResolveArg2(baseFunc, arg0, arg1)
 }
 
-const tap = func => function tapping(...args) {
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
+}
+
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// _tap(args Array, func function) -> Promise|any
+const _tap = function (args, func) {
   const result = args[0],
     call = func(...args)
   return isPromise(call) ? call.then(always(result)) : result
 }
 
+const tap = function (...args) {
+  const func = args.pop()
+  if (args.length == 0) {
+    return curryArgs2(_tap, __, func)
+  }
+  return _tap(args, func)
+}
+
 tap.if = (predicate, func) => function tappingIf(...args) {
   const predication = predicate(...args)
   if (isPromise(predication)) {

package/dist/x/unionWith.es.js

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

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

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

package/dist/x/unionWith.js

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

package/dist/x/unionWith.min.js

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

package/dist/x/unionWith.mjs

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

package/dist/x/uniq.es.js

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

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

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

package/dist/x/uniq.js

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

package/dist/x/uniq.min.js

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

package/dist/x/uniq.mjs

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

package/dist/x/unless.es.js

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

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

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

package/dist/x/unless.js

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

package/dist/x/unless.min.js

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

package/dist/x/unless.mjs

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

package/dist/x/values.es.js

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

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

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

package/dist/x/values.js

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

package/dist/x/values.min.js

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

package/dist/x/values.mjs

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

package/dist/x/when.es.js

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

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

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

package/dist/x/when.js

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

package/dist/x/when.min.js

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

package/dist/x/when.mjs

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

package/es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.0.1
+ * rubico v2.2.0
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -125,12 +125,42 @@ const curry3 = function (baseFunc, arg0, arg1, arg2) {
   return curry3ResolveArg2(baseFunc, arg0, arg1)
 }
 
-const tap = func => function tapping(...args) {
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
+}
+
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// _tap(args Array, func function) -> Promise|any
+const _tap = function (args, func) {
   const result = args[0],
     call = func(...args)
   return isPromise(call) ? call.then(always(result)) : result
 }
 
+const tap = function (...args) {
+  const func = args.pop()
+  if (args.length == 0) {
+    return curryArgs2(_tap, __, func)
+  }
+  return _tap(args, func)
+}
+
 tap.if = (predicate, func) => function tappingIf(...args) {
   const predication = predicate(...args)
   if (isPromise(predication)) {
@@ -148,27 +178,6 @@ tap.if = (predicate, func) => function tappingIf(...args) {
 
 const isArray = Array.isArray
 
-// argument resolver for curryArgs2
-const curryArgs2ResolveArgs0 = (
-  baseFunc, arg1, arg2,
-) => function args0Resolver(...args) {
-  return baseFunc(args, arg1)
-}
-
-// argument resolver for curryArgs2
-const curryArgs2ResolveArgs1 = (
-  baseFunc, arg0, arg2,
-) => function arg1Resolver(...args) {
-  return baseFunc(arg0, args)
-}
-
-const curryArgs2 = function (baseFunc, arg0, arg1) {
-  if (arg0 == __) {
-    return curryArgs2ResolveArgs0(baseFunc, arg1)
-  }
-  return curryArgs2ResolveArgs1(baseFunc, arg0)
-}
-
 const functionArrayAll = function (funcs, args) {
   const funcsLength = funcs.length,
     result = Array(funcsLength)
@@ -1447,43 +1456,45 @@ const callConcat = function (object, values) {
   return object.concat(values)
 }
 
-const identityTransform = function (collection, transducer, result) {
+const identityTransform = function (collection, transducer, accum) {
   const nil = genericReduce(collection, transducer(noop), null)
-  return isPromise(nil) ? nil.then(always(result)) : result
+  return isPromise(nil) ? nil.then(always(accum)) : accum
 }
 
-const genericTransform = function (collection, transducer, result) {
-  if (isArray(result)) {
-    return genericReduce(collection, transducer(arrayExtend), result)
+const genericTransform = function (collection, transducer, accum) {
+  if (isArray(accum)) {
+    return genericReduce(collection, transducer(arrayExtend), accum)
   }
-  if (isBinary(result)) {
+  if (isBinary(accum)) {
     const intermediateArray = genericReduce(collection, transducer(arrayExtend), [])
     return isPromise(intermediateArray)
-      ? intermediateArray.then(curry2(binaryExtend, result, __))
-      : binaryExtend(result, intermediateArray)
+      ? intermediateArray.then(curry2(binaryExtend, accum, __))
+      : binaryExtend(accum, intermediateArray)
   }
-  if (result == null) {
-    return identityTransform(collection, transducer, result)
+  if (accum == null) {
+    return identityTransform(collection, transducer, accum)
   }
 
-  const resultConstructor = result.constructor
-  if (typeof result == 'string' || resultConstructor == String) {
-    // TODO: use array + join over adding
-    return genericReduce(collection, transducer(add), result)
+  const constructor = accum.constructor
+  if (typeof accum == 'string' || constructor == String) {
+    const result = genericReduce(collection, transducer(arrayExtend), [accum])
+    return isPromise(result)
+      ? result.then(curry3(callPropUnary, __, 'join', ''))
+      : result.join('')
   }
-  if (typeof result.concat == 'function') {
-    return genericReduce(collection, transducer(callConcat), result)
+  if (typeof accum.concat == 'function') {
+    return genericReduce(collection, transducer(callConcat), accum)
   }
-  if (typeof result.write == 'function') {
-    return genericReduce(collection, transducer(streamExtend), result)
+  if (typeof accum.write == 'function') {
+    return genericReduce(collection, transducer(streamExtend), accum)
   }
-  if (resultConstructor == Set) {
-    return genericReduce(collection, transducer(setExtend), result)
+  if (constructor == Set) {
+    return genericReduce(collection, transducer(setExtend), accum)
   }
-  if (resultConstructor == Object) {
-    return genericReduce(collection, transducer(objectAssign), result)
+  if (constructor == Object) {
+    return genericReduce(collection, transducer(objectAssign), accum)
   }
-  return identityTransform(collection, transducer, result)
+  return identityTransform(collection, transducer, accum)
 }
 
 // _transform(collection any, transducer function, initialValue function|any) -> Promise