pepka 0.12.3 → 0.13.0-b10

package/dist/bundle.dev.js

@@ -1,4 +1,4 @@
-const __ = (function Placeholder() { });
+const __ = Symbol('Placeholder');
 const countArgs = (s) => {
     let i = 0;
     for (const v of s)
@@ -37,10 +37,39 @@ const _curry = (fn, args, new_args) => {
 };
 const curry = ((fn) => ((...args) => fn.length > countArgs(args)
     ? _curry(fn, [], args)
-    : fn(...args)));
+    : fn(...args)));
+const endlessph = (fn) => {
+    function _endlessph(a) {
+        return a === __ ? fn : fn(a);
+    }
+    return _endlessph;
+};
+function curry2(fn) {
+    function curried2(a, b) {
+        const withPlaceholder1 = a === __;
+        const aln = arguments.length;
+        if (aln === 1 && withPlaceholder1)
+            throw new Error('Senseless placeholder usage.');
+        return arguments.length > 1
+            ? withPlaceholder1
+                ? endlessph((a) => fn(a, b))
+                : fn(a, b)
+            : (b) => fn(a, b);
+    }
+    return curried2;
+}
+function curry3(fn) {
+    // type p0 = Parameters<Func>[0]
+    // type p1 = Parameters<Func>[1]
+    // type p2 = Parameters<Func>[2]
+    // type ReturnT = ReturnType<Func>
+    // TODO: optimize.
+    return curry(fn);
+}
 
 const undef = undefined;
 const nul = null;
+const inf = Infinity;
 const to = (s) => typeof s;
 const isNull = (s) => s === nul;
 const isUndef = (s) => s === undef;
@@ -63,14 +92,14 @@ const type = (s) => {
         : caseMap[t[0]] + t.slice(1);
 };
 
-const qappend = curry((s, xs) => { xs.push(s); return xs; });
-const qassoc = curry((prop, v, obj) => {
+const qappend = curry2((s, xs) => { xs.push(s); return xs; });
+const qassoc = curry3((prop, v, obj) => {
     obj[prop] = v;
     return obj;
 });
-const qreduce = curry((fn, accum, arr) => arr.reduce(fn, accum));
+const qreduce = curry3((fn, accum, arr) => arr.reduce(fn, accum));
 // strategy is for arrays: 1->clean, 2->merge, 3->push.
-const mergeDeep$1 = curry((strategy, o1, o2) => {
+const mergeDeep$1 = curry3((strategy, o1, o2) => {
     for (let k in o2) {
         switch (type(o2[k])) {
             case 'Array':
@@ -110,7 +139,7 @@ const qmergeDeep = mergeDeep$1(1);
 const qmergeDeepX = mergeDeep$1(2);
 const qmergeDeepAdd = mergeDeep$1(3);
 /** qmapKeys({ a: 'b' }, { a: 44 }) -> { b: 44 } */
-const qmapKeys = curry((keyMap, o) => {
+const qmapKeys = curry2((keyMap, o) => {
     let k, mapped, newKey, newValue;
     for (k in keyMap) {
         mapped = keyMap[k];
@@ -124,7 +153,7 @@ const qmapKeys = curry((keyMap, o) => {
     }
     return o;
 });
-const qfilter = curry((cond, data) => {
+const qfilter = curry2((cond, data) => {
     const isArr = isArray(data);
     for (let k in data) {
         if (!cond(data[k], k)) {
@@ -140,10 +169,13 @@ const qfilter = curry((cond, data) => {
     return data;
 });
 /** @deprecated */
-const qindexOf = curry((x, xs) => xs.indexOf(x));
+const qindexOf = curry2((x, xs) => xs.indexOf(x));
+
+// TODO: possibly introduce a second argument limiting unfolding.
+const uncurry = (fn) => (...args) => qreduce(((fn, arg) => fn ? fn(arg) : fn), fn, args);
 
 // over, lensProp
-const equals = curry((a, b) => {
+const equals = curry2((a, b) => {
     const typea = type(a);
     if (typea === type(b) && (typea === 'Object' || typea == 'Array')) {
         if (isNull(a) || isNull(b)) {
@@ -165,16 +197,17 @@ const equals = curry((a, b) => {
     return a === b;
 });
 const ifElse = curry((cond, pipeYes, pipeNo, s) => cond(s) ? pipeYes(s) : pipeNo(s));
-const when = curry((cond, pipe, s) => ifElse(cond, pipe, identity, s));
-const compose = ((...fns) => (s = __) => {
+const when = curry3((cond, pipe, s) => ifElse(cond, pipe, identity, s));
+const compose = ((...fns) => (s = Symbol()) => {
     for (let i = length(fns) - 1; i > -1; i--) {
         s = s === __ ? fns[i]() : fns[i](s);
     }
     return s;
-}); // as F.Compose
-const bind = curry((fn, context) => fn.bind(context));
-const nth = curry((i, data) => data[i]);
-const includes = curry((s, ss) => {
+});
+const bind = curry2((fn, context) => fn.bind(context));
+const _nth = (i, data) => data[i];
+const nth = curry2(_nth);
+const includes = curry2((s, ss) => {
     if (isStr(ss)) {
         return ss.includes(s);
     }
@@ -187,11 +220,11 @@ const includes = curry((s, ss) => {
         return false;
     }
 });
-const slice = curry((from, to, o) => o.slice(from, (isNum(to) ? to : Infinity)));
+const slice = curry3((from, to, o) => o.slice(from, (isNum(to) ? to : inf)));
 const head = nth(0);
-const tail = slice(1, nul);
-const add = curry((n, m) => n + m);
-const subtract = curry((n, m) => m - n);
+const tail = slice(1, inf); // typeshit.
+const add = curry2((n, m) => n + m);
+const subtract = curry2((n, m) => m - n);
 const flip = (fn) => curry((b, a) => fn(a, b));
 const isNil = (s) => isNull(s) || isUndef(s);
 const length = (s) => s.length;
@@ -207,10 +240,10 @@ const complement = (fn) => (...args) => {
 const keys = (o) => Object.keys(o);
 const values = (o) => Object.values(o);
 const toPairs = (o) => Object.entries(o);
-const test = curry((re, s) => re.test(s));
-const tap = curry((fn, s) => { fn(s); return s; });
-const append = curry((s, xs) => [...xs, s]);
-const split = curry((s, xs) => xs.split(s));
+const test = curry2((re, s) => re.test(s));
+const tap = curry2((fn, s) => { fn(s); return s; });
+const append = curry2((s, xs) => [...xs, s]);
+const split = curry2((s, xs) => xs.split(s));
 const T = always(true);
 const F = always(false);
 const sizeof = (s) => {
@@ -223,10 +256,10 @@ const sizeof = (s) => {
     else
         return length(s);
 };
-const range = curry((from, to) => genBy(add(from), to - from));
+const range = curry2((from, to) => genBy(add(from), to - from));
 const uniq = (xs) => qreduce((accum, x) => includes(x, accum) ? accum : qappend(x, accum), [], xs);
-const intersection = curry((xs1, xs2) => xs1.filter(flip(includes)(xs2)));
-const genBy = curry((generator, length) => [...Array(length)].map((_, i) => generator(i)));
+const intersection = curry2((xs1, xs2) => xs1.filter(flip(includes)(xs2)));
+const genBy = curry2((generator, length) => [...Array(length)].map((_, i) => generator(i)));
 const once = (fn) => {
     let done = false, cache;
     return (...args) => {
@@ -240,50 +273,51 @@ const once = (fn) => {
     };
 };
 const reverse = (xs) => compose((ln) => reduce((nxs, _, i) => qappend(xs[ln - i], nxs), [], xs), add(-1), length)(xs);
-const gt = curry((a, b) => a > b);
-const lt = curry((a, b) => a < b);
-const gte = curry((a, b) => b >= a);
-const lte = curry((a, b) => b <= a);
-// : <U=any>(sortFn: (v: U)=>-1|1, xs: U[]) => U[] 
-const sort = curry((sortFn, xs) => xs.sort(sortFn));
-const find = curry((fn, s) => s.find(fn));
-const findIndex = curry((fn, s) => s.findIndex(fn));
-const indexOf = curry((x, xs) => findIndex(equals(x), xs));
+const gt = curry2((a, b) => a > b);
+const lt = curry2((a, b) => a < b);
+const gte = curry2((a, b) => b >= a);
+const lte = curry2((a, b) => b <= a);
+const sort = curry2((sortFn, xs) => xs.sort(sortFn));
+const find = curry2((fn, s) => s.find(fn));
+const findIndex = curry2((fn, s) => s.findIndex(fn));
+const indexOf = curry2((x, xs) => findIndex(equals(x), xs));
 const explore = (caption, level = 'log') => tap((v) => console[level](caption, v));
-const cond = curry((pairs, s) => {
+const cond = curry2((pairs, s) => {
     for (const [cond, fn] of pairs) {
         if (cond(s)) {
             return fn(s);
         }
     }
 });
-const assoc = curry((prop, v, obj) => ({
+const assoc = curry3((prop, v, obj) => ({
     ...obj,
     [prop]: v
 }));
-const assocPath = curry((_path, v, o) => compose((first) => assoc(first, length(_path) < 2
+const assocPath = curry3((_path, v, o) => compose((first) => assoc(first, length(_path) < 2
     ? v
-    : assocPath(slice(1, null, _path), v, isObj(o[first]) ? o[first] : {}), o), head)(_path));
-const all = curry((pred, xs) => xs.every(pred));
-const any = curry((pred, xs) => xs.some(pred));
-const allPass = curry((preds, x) => preds.every((pred) => pred(x)));
-const anyPass = curry((preds, x) => preds.some((pred) => pred(x)));
-const prop = curry((key, o) => o[key]);
-const propEq = curry((key, value, o) => equals(o[key], value));
-const propsEq = curry((key, o1, o2) => equals(o1[key], o2[key]));
-const pathOr = curry((_default, path, o) => ifElse(length, () => isNil(o)
+    : assocPath(slice(1, inf, _path), v, isObj(o[first]) ? o[first] : {}), o), head)(_path));
+const all = curry2((pred, xs) => xs.every(pred));
+const any = curry2((pred, xs) => xs.some(pred));
+const allPass = curry2((preds, x) => preds.every((pred) => pred(x)));
+const anyPass = curry2((preds, x) => preds.some((pred) => pred(x)));
+const prop = curry2((key, o) => o[key]);
+const propEq = curry3((key, value, o) => equals(o[key], value));
+const propsEq = curry3((key, o1, o2) => equals(o1[key], o2[key]));
+const pathOr = curry3((_default, path, o) => ifElse(length, () => isNil(o)
     ? _default
-    : compose(ifElse(isNil, always(_default), (o) => pathOr(_default, slice(1, nul, path), o)), flip(prop)(o), head)(path), always(o), path));
+    : compose(ifElse(isNil, always(_default), (o) => pathOr(_default, slice(1, inf, path), o)), flip(prop)(o), head)(path), always(o), path));
 const path = pathOr(undef);
-const pathEq = curry((_path, value, o) => equals(path(_path, o), value));
-const pathsEq = curry((_path, o1, o2) => equals(path(_path, o1), path(_path, o2)));
+const pathEq = curry3((_path, value, o) => equals(path(_path, o), value));
+const pathsEq = curry3((_path, o1, o2) => equals(path(_path, o1), path(_path, o2)));
 const typed_arr_re = /^(.*?)(8|16|32|64)(Clamped)?Array$/;
-const clone = (s) => {
+const clone = (s, shallow = false) => {
     const t = type(s);
     switch (t) {
         case 'Null': return s;
-        case 'Array': return map(clone, s);
+        case 'Array': return shallow ? [...s] : map(clone, s);
         case 'Object':
+            if (shallow)
+                return { ...s };
             const out = {};
             for (let k in s) {
                 out[k] = clone(s[k]);
@@ -295,12 +329,13 @@ const clone = (s) => {
         case 'Symbol':
             return s;
         default:
-            return typed_arr_re.test(t) ? map(clone, s) : s;
+            return typed_arr_re.test(t) ? s.constructor.from(s) : s;
     }
 };
-const reduce = curry((fn, accum, arr) => qreduce(fn, clone(accum), arr));
-const pickBy = curry((cond, o) => filter(cond, o));
-const pick = curry((props, o) => {
+const cloneShallow = (s) => clone(s, true);
+const reduce = curry3((fn, accum, arr) => qreduce(fn, clone(accum), arr));
+const pickBy = curry2((cond, o) => filter(cond, o));
+const pick = curry2((props, o) => {
     const out = {};
     for (const p of props) {
         if (p in o) {
@@ -309,13 +344,13 @@ const pick = curry((props, o) => {
     }
     return out;
 });
-const omit = curry((props, o) => filter((_, k) => !includes(k, props), o));
+const omit = curry2((props, o) => filter((_, k) => !includes(k, props), o));
 const fromPairs = (pairs) => reduce((o, pair) => assoc(...pair, o), {}, pairs);
-const concat = curry(((a, b) => a.concat(b)));
-const join = curry((delimeter, arr) => arr.join(delimeter));
-const map = curry((pipe, arr) => arr.map(pipe));
-const forEach = curry((pipe, arr) => arr.forEach(pipe));
-const both = curry((cond1, cond2, s) => cond2(s) && cond1(s));
+const concat = curry2(((a, b) => a.concat(b)));
+const join = curry2((delimeter, arr) => arr.join(delimeter));
+const map = curry2((pipe, arr) => arr.map(pipe));
+const forEach = curry2((pipe, arr) => arr.forEach(pipe));
+const both = curry3((cond1, cond2, s) => cond2(s) && cond1(s));
 const isEmpty = (s) => {
     switch (type(s)) {
         case 'String':
@@ -335,8 +370,8 @@ const empty = (s) => {
         default: return undef;
     }
 };
-const replace = curry((a, b, where) => where.replace(a, b));
-const filter = curry((cond, data) => isArray(data)
+const replace = curry3((a, b, where) => where.replace(a, b));
+const filter = curry2((cond, data) => isArray(data)
     ? data.filter(cond)
     : compose(fromPairs, filter(([k, v]) => cond(v, k)), toPairs)(data));
 const memoize = (fn) => {
@@ -344,13 +379,13 @@ const memoize = (fn) => {
     let cached = false;
     return () => cached ? cache : (cached = true, cache = fn());
 };
-const mergeShallow = curry((o1, o2) => Object.assign({}, o1, o2));
-const mergeDeep = curry((a, b) => qmergeDeep(clone(a), clone(b)));
-const mergeDeepX = curry((a, b) => qmergeDeepX(clone(a), clone(b)));
-const mergeDeepAdd = curry((a, b) => qmergeDeepAdd(clone(a), clone(b)));
-const overProp = curry((prop, pipe, data) => assoc(prop, pipe(data[prop]), data));
+const mergeShallow = curry2((o1, o2) => Object.assign({}, o1, o2));
+const mergeDeep = curry2((a, b) => qmergeDeep(clone(a), clone(b)));
+const mergeDeepX = curry2((a, b) => qmergeDeepX(clone(a), clone(b)));
+const mergeDeepAdd = curry2((a, b) => qmergeDeepAdd(clone(a), clone(b)));
+const overProp = curry3((prop, pipe, data) => assoc(prop, pipe(data[prop]), data));
 /** mapKeys({ a: 'b' }, { a: 44 }) -> { b: 44 } */
-const mapKeys = curry((keyMap, o) => qmapKeys(keyMap, Object.assign({}, o)));
+const mapKeys = curry2((keyMap, o) => qmapKeys(keyMap, Object.assign({}, o)));
 // ASYNCS
 /** One promise waits for another. */
 const forEachSerial = (() => {
@@ -360,12 +395,13 @@ const forEachSerial = (() => {
             await pipe(fn, items, ++i);
         }
     };
-    return curry((fn, items) => pipe(fn, items, 0));
+    return curry2((fn, items) => pipe(fn, items, 0));
 })();
 /** Promise.all wrapper for functional pipelining. */
 const waitAll = (promises) => Promise.all(promises);
+const waitTap = curry2(async (fn, s) => { await fn(s); return s; });
 /** Waits for all promises mapped by the fn. */
-const forEachAsync = curry((fn, items) => Promise.all(items.map(fn)));
+const forEachAsync = curry2((fn, items) => Promise.all(items.map(fn)));
 /** The same as compose, but waits for promises in chains and returns a Promise.  */
 const composeAsync = (() => {
     const pipe = async (fns, data, i) => ~i ? await pipe(fns, await fns[i](data), --i) : data;
@@ -422,6 +458,9 @@ var pepka = /*#__PURE__*/Object.freeze({
   __proto__: null,
   __: __,
   curry: curry,
+  curry2: curry2,
+  curry3: curry3,
+  uncurry: uncurry,
   toLower: toLower,
   toUpper: toUpper,
   type: type,
@@ -486,6 +525,7 @@ var pepka = /*#__PURE__*/Object.freeze({
   pathEq: pathEq,
   pathsEq: pathsEq,
   clone: clone,
+  cloneShallow: cloneShallow,
   reduce: reduce,
   pickBy: pickBy,
   pick: pick,
@@ -509,6 +549,7 @@ var pepka = /*#__PURE__*/Object.freeze({
   mapKeys: mapKeys,
   forEachSerial: forEachSerial,
   waitAll: waitAll,
+  waitTap: waitTap,
   forEachAsync: forEachAsync,
   composeAsync: composeAsync,
   mirror: mirror,

package/dist/bundle.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0});const e=function(){},r=r=>{let t=0;for(const s of r)s!==e&&t++;return t},t=(r,t)=>{const s=r.length,o=r.slice(),p=t.length;let n=p,c=0;for(;n&&c<s;c++)o[c]===e&&(o[c]=t[p-n],n--);for(c=s;n;c++,n--)o[c]=t[p-n];return o},s=(e,o,p)=>{const n=e.length-o.length-r(p);if(n<1)return e(...t(o,p));{const r=(...r)=>s(e,t(o,p),r);return r.$args_left=n,r}},o=e=>(...t)=>e.length>r(t)?s(e,[],t):e(...t),p=e=>typeof e,n=e=>null===e,c=e=>"number"==p(e),x=e=>Array.isArray(e),a=e=>"function"===p(e),l={u:"U",b:"B",n:"N",s:"S",f:"F"},i=e=>{const r=p(e);return"object"===r?n(e)?"Null":e.constructor.name:l[r[0]]+r.slice(1)},u=o(((e,r)=>(r.push(e),r))),f=o(((e,r,t)=>(t[e]=r,t))),d=o(((e,r,t)=>t.reduce(e,r))),h=o(((e,r,t)=>{for(let s in t)switch(i(t[s])){case"Array":if(e>1&&"Array"===i(r[s]))switch(e){case 2:const o=r[s],p=t[s];for(const r in p)o[r]?h(e,o[r],p[r]):o[r]=p[r];break;case 3:r[s].push(...t[s])}else r[s]=t[s];break;case"Object":if("Object"===i(r[s])){h(e,r[s],t[s]);break}default:r[s]=t[s]}return r})),m=h(1),g=h(2),y=h(3),b=o(((e,r)=>{let t,s,o,p;for(t in e)s=e[t],[o,p]=a(s)?s(r):[s,r[t]],r[o]=p,t!==o&&delete r[t];return r})),j=o(((e,r)=>{const t=x(r);for(let s in r)e(r[s],s)||(t?r.splice(s,1):delete r[s]);return r})),O=o(((e,r)=>r.indexOf(e))),w=o(((e,r)=>{const t=i(e);if(t===i(r)&&("Object"===t||"Array"==t)){if(n(e)||n(r))return e===r;if(e===r)return!0;for(const t of[e,r])for(const s in t)if(!(t===r&&s in e||t===e&&s in r&&w(e[s],r[s])))return!1;return!0}return e===r})),q=o(((e,r,t,s)=>e(s)?r(s):t(s))),A=o(((e,r,t)=>q(e,r,F,t))),E=(...r)=>(t=e)=>{for(let s=$(r)-1;s>-1;s--)t=t===e?r[s]():r[s](t);return t},k=o(((e,r)=>e.bind(r))),v=o(((e,r)=>r[e])),P=o(((e,r)=>{if((e=>"string"===p(e))(r))return r.includes(e);for(const t of r)if(w(t,e))return!0;return!1})),S=o(((e,r,t)=>t.slice(e,c(r)?r:1/0))),D=v(0),_=S(1,null),N=o(((e,r)=>e+r)),B=o(((e,r)=>r-e)),C=e=>o(((r,t)=>e(t,r))),U=e=>n(e)||(e=>void 0===e)(e),$=e=>e.length,z=e=>()=>e,F=e=>e,I=e=>!e,K=e=>(...r)=>{const t=e(...r);return a(t)&&t.$args_left?K(t):I(t)},L=e=>Object.entries(e),T=o(((e,r)=>e.test(r))),X=o(((e,r)=>(e(r),r))),M=o(((e,r)=>[...r,e])),G=o(((e,r)=>r.split(e))),H=z(!0),J=z(!1),Q=o(((e,r)=>V(N(e),r-e))),R=o(((e,r)=>e.filter(C(P)(r)))),V=o(((e,r)=>[...Array(r)].map(((r,t)=>e(t))))),W=o(((e,r)=>e>r)),Y=o(((e,r)=>e<r)),Z=o(((e,r)=>r>=e)),ee=o(((e,r)=>r<=e)),re=o(((e,r)=>r.sort(e))),te=o(((e,r)=>r.find(e))),se=o(((e,r)=>r.findIndex(e))),oe=o(((e,r)=>se(w(e),r))),pe=o(((e,r)=>{for(const[t,s]of e)if(t(r))return s(r)})),ne=o(((e,r,t)=>({...t,[e]:r}))),ce=o(((e,r,t)=>E((s=>{return ne(s,$(e)<2?r:ce(S(1,null,e),r,(o=t[s],n(o)||"object"!==p(o)?{}:t[s])),t);var o}),D)(e))),xe=o(((e,r)=>r.every(e))),ae=o(((e,r)=>r.some(e))),le=o(((e,r)=>e.every((e=>e(r))))),ie=o(((e,r)=>e.some((e=>e(r))))),ue=o(((e,r)=>r[e])),fe=o(((e,r,t)=>w(t[e],r))),de=o(((e,r,t)=>w(r[e],t[e]))),he=o(((e,r,t)=>q($,(()=>U(t)?e:E(q(U,z(e),(t=>he(e,S(1,null,r),t))),C(ue)(t),D)(r)),z(t),r))),me=he(undefined),ge=o(((e,r,t)=>w(me(e,t),r))),ye=o(((e,r,t)=>w(me(e,r),me(e,t)))),be=/^(.*?)(8|16|32|64)(Clamped)?Array$/,je=e=>{const r=i(e);switch(r){case"Null":return e;case"Array":return Pe(je,e);case"Object":const t={};for(let r in e)t[r]=je(e[r]);return t;case"String":case"Number":case"Boolean":case"Symbol":return e;default:return be.test(r)?Pe(je,e):e}},Oe=o(((e,r,t)=>d(e,je(r),t))),we=o(((e,r)=>Ne(e,r))),qe=o(((e,r)=>{const t={};for(const s of e)s in r&&(t[s]=r[s]);return t})),Ae=o(((e,r)=>Ne(((r,t)=>!P(t,e)),r))),Ee=e=>Oe(((e,r)=>ne(...r,e)),{},e),ke=o(((e,r)=>e.concat(r))),ve=o(((e,r)=>r.join(e))),Pe=o(((e,r)=>r.map(e))),Se=o(((e,r)=>r.forEach(e))),De=o(((e,r,t)=>r(t)&&e(t))),_e=o(((e,r,t)=>t.replace(e,r))),Ne=o(((e,r)=>x(r)?r.filter(e):E(Ee,Ne((([r,t])=>e(t,r))),L)(r))),Be=o(((e,r)=>Object.assign({},e,r))),Ce=o(((e,r)=>m(je(e),je(r)))),Ue=o(((e,r)=>g(je(e),je(r)))),$e=o(((e,r)=>y(je(e),je(r)))),ze=o(((e,r,t)=>ne(e,r(t[e]),t))),Fe=o(((e,r)=>b(e,Object.assign({},r)))),Ie=(()=>{const e=async(r,t,s)=>{s<t.length&&(await r(t[s]),await e(r,t,++s))};return o(((r,t)=>e(r,t,0)))})(),Ke=o(((e,r)=>Promise.all(r.map(e)))),Le=(()=>{const e=async(r,t,s)=>~s?await e(r,await r[s](t),--s):t;return(...r)=>t=>e(r,t,r.length-1)})(),Te=F,Xe=F,Me=F;exports.F=J,exports.T=H,exports.__=e,exports.add=N,exports.all=xe,exports.allPass=le,exports.always=z,exports.any=ae,exports.anyPass=ie,exports.append=M,exports.assoc=ne,exports.assocPath=ce,exports.bind=k,exports.both=De,exports.clone=je,exports.complement=K,exports.compose=E,exports.composeAsync=Le,exports.concat=ke,exports.cond=pe,exports.curry=o,exports.echo=Me,exports.empty=e=>{switch(i(e)){case"String":return"";case"Object":return{};case"Array":return[];default:return}},exports.equals=w,exports.explore=(e,r="log")=>X((t=>console[r](e,t))),exports.filter=Ne,exports.find=te,exports.findIndex=se,exports.flip=C,exports.forEach=Se,exports.forEachAsync=Ke,exports.forEachSerial=Ie,exports.fromPairs=Ee,exports.genBy=V,exports.getTmpl=e=>{const r=[],t=[],s=e.length;let o,p,n=0,c=0,x=!1;for(n=0;n<s;n++)switch(o=e[n],o){case"{":x=!0,c=n;break;case"}":x=!1,r.push(""),t.push(e.slice(c+1,n));break;default:x||(p=r.length-1,p<0&&(r.push(""),p++),r[p]+=o)}return e=>{const s=[],o=r.length-1;for(const p in r)n=+p,s.push(r[n]),n!==o&&s.push(me(t[n].split("."),e));return s.join("")}},exports.gt=W,exports.gte=Z,exports.head=D,exports.identity=F,exports.ifElse=q,exports.includes=P,exports.indexOf=oe,exports.intersection=R,exports.isEmpty=e=>{switch(i(e)){case"String":case"Array":return 0==$(e);case"Object":for(const r in e)return!1;return!0;default:return null}},exports.isNil=U,exports.join=ve,exports.keys=e=>Object.keys(e),exports.last=e=>e[$(e)-1],exports.length=$,exports.lt=Y,exports.lte=ee,exports.map=Pe,exports.mapKeys=Fe,exports.memoize=e=>{let r,t=!1;return()=>t?r:(t=!0,r=e())},exports.mergeDeep=Ce,exports.mergeDeepAdd=$e,exports.mergeDeepX=Ue,exports.mergeShallow=Be,exports.mirror=Te,exports.not=I,exports.nth=v,exports.omit=Ae,exports.once=e=>{let r,t=!1;return(...s)=>t?r:(t=!0,r=e(...s))},exports.overProp=ze,exports.path=me,exports.pathEq=ge,exports.pathOr=he,exports.pathsEq=ye,exports.pick=qe,exports.pickBy=we,exports.prop=ue,exports.propEq=fe,exports.propsEq=de,exports.qappend=u,exports.qassoc=f,exports.qfilter=j,exports.qindexOf=O,exports.qmapKeys=b,exports.qmergeDeep=m,exports.qmergeDeepAdd=y,exports.qmergeDeepX=g,exports.qreduce=d,exports.range=Q,exports.reduce=Oe,exports.reflect=Xe,exports.replace=_e,exports.reverse=e=>E((r=>Oe(((t,s,o)=>u(e[r-o],t)),[],e)),N(-1),$)(e),exports.sizeof=e=>{if("Object"===i(e)){let r=0;for(let t in e)r++;return r}return $(e)},exports.slice=S,exports.sort=re,exports.split=G,exports.subtract=B,exports.tail=_,exports.tap=X,exports.test=T,exports.toLower=e=>e.toLowerCase(),exports.toPairs=L,exports.toUpper=e=>e.toUpperCase(),exports.trim=e=>e.trim(),exports.type=i,exports.uniq=e=>d(((e,r)=>P(r,e)?e:u(r,e)),[],e),exports.values=e=>Object.values(e),exports.waitAll=e=>Promise.all(e),exports.when=A;
+"use strict";const e=Symbol("Placeholder"),r=r=>{let t=0;for(const s of r)s!==e&&t++;return t},t=(r,t)=>{const s=r.length,o=r.slice(),n=t.length;let p=n,c=0;for(;p&&c<s;c++)o[c]===e&&(o[c]=t[n-p],p--);for(c=s;p;c++,p--)o[c]=t[n-p];return o},s=(e,o,n)=>{const p=e.length-o.length-r(n);if(p<1)return e(...t(o,n));{const r=(...r)=>s(e,t(o,n),r);return r.$args_left=p,r}},o=e=>(...t)=>e.length>r(t)?s(e,[],t):e(...t),n=r=>function(t){return t===e?r:r(t)};function p(r){return function(t,s){const o=t===e,p=arguments.length;if(1===p&&o)throw new Error("Senseless placeholder usage.");return arguments.length>1?o?n((e=>r(e,s))):r(t,s):e=>r(t,e)}}function c(e){return o(e)}const a=void 0,x=1/0,l=e=>typeof e,i=e=>null===e,u=e=>"number"==l(e),f=e=>Array.isArray(e),h=e=>"function"===l(e),m={u:"U",b:"B",n:"N",s:"S",f:"F"},d=e=>{const r=l(e);return"object"===r?i(e)?"Null":e.constructor.name:m[r[0]]+r.slice(1)},y=p(((e,r)=>(r.push(e),r))),g=c(((e,r,t)=>(t[e]=r,t))),b=c(((e,r,t)=>t.reduce(e,r))),w=c(((e,r,t)=>{for(let s in t)switch(d(t[s])){case"Array":if(e>1&&"Array"===d(r[s]))switch(e){case 2:const o=r[s],n=t[s];for(const r in n)o[r]?w(e,o[r],n[r]):o[r]=n[r];break;case 3:r[s].push(...t[s])}else r[s]=t[s];break;case"Object":if("Object"===d(r[s])){w(e,r[s],t[s]);break}default:r[s]=t[s]}return r})),j=w(1),O=w(2),q=w(3),A=p(((e,r)=>{let t,s,o,n;for(t in e)s=e[t],[o,n]=h(s)?s(r):[s,r[t]],r[o]=n,t!==o&&delete r[t];return r})),E=p(((e,r)=>{const t=f(r);for(let s in r)e(r[s],s)||(t?r.splice(s,1):delete r[s]);return r})),S=p(((e,r)=>r.indexOf(e))),k=p(((e,r)=>{const t=d(e);if(t===d(r)&&("Object"===t||"Array"==t)){if(i(e)||i(r))return e===r;if(e===r)return!0;for(const t of[e,r])for(const s in t)if(!(t===r&&s in e||t===e&&s in r&&k(e[s],r[s])))return!1;return!0}return e===r})),P=o(((e,r,t,s)=>e(s)?r(s):t(s))),v=c(((e,r,t)=>P(e,r,X,t))),D=(...r)=>(t=Symbol())=>{for(let s=K(r)-1;s>-1;s--)t=t===e?r[s]():r[s](t);return t},N=p(((e,r)=>e.bind(r))),B=p(((e,r)=>r[e])),_=p(((e,r)=>{if((e=>"string"===l(e))(r))return r.includes(e);for(const t of r)if(k(t,e))return!0;return!1})),C=c(((e,r,t)=>t.slice(e,u(r)?r:x))),T=B(0),U=C(1,x),$=p(((e,r)=>e+r)),z=p(((e,r)=>r-e)),F=e=>o(((r,t)=>e(t,r))),I=e=>i(e)||(e=>e===a)(e),K=e=>e.length,L=e=>()=>e,X=e=>e,G=e=>!e,H=e=>(...r)=>{const t=e(...r);return h(t)&&t.$args_left?H(t):G(t)},J=e=>Object.entries(e),M=p(((e,r)=>e.test(r))),Q=p(((e,r)=>(e(r),r))),R=p(((e,r)=>[...r,e])),V=p(((e,r)=>r.split(e))),W=L(!0),Y=L(!1),Z=p(((e,r)=>re($(e),r-e))),ee=p(((e,r)=>e.filter(F(_)(r)))),re=p(((e,r)=>[...Array(r)].map(((r,t)=>e(t))))),te=p(((e,r)=>e>r)),se=p(((e,r)=>e<r)),oe=p(((e,r)=>r>=e)),ne=p(((e,r)=>r<=e)),pe=p(((e,r)=>r.sort(e))),ce=p(((e,r)=>r.find(e))),ae=p(((e,r)=>r.findIndex(e))),xe=p(((e,r)=>ae(k(e),r))),le=p(((e,r)=>{for(const[t,s]of e)if(t(r))return s(r)})),ie=c(((e,r,t)=>({...t,[e]:r}))),ue=c(((e,r,t)=>D((s=>{return ie(s,K(e)<2?r:ue(C(1,x,e),r,(o=t[s],i(o)||"object"!==l(o)?{}:t[s])),t);var o}),T)(e))),fe=p(((e,r)=>r.every(e))),he=p(((e,r)=>r.some(e))),me=p(((e,r)=>e.every((e=>e(r))))),de=p(((e,r)=>e.some((e=>e(r))))),ye=p(((e,r)=>r[e])),ge=c(((e,r,t)=>k(t[e],r))),be=c(((e,r,t)=>k(r[e],t[e]))),we=c(((e,r,t)=>P(K,(()=>I(t)?e:D(P(I,L(e),(t=>we(e,C(1,x,r),t))),F(ye)(t),T)(r)),L(t),r))),je=we(a),Oe=c(((e,r,t)=>k(je(e,t),r))),qe=c(((e,r,t)=>k(je(e,r),je(e,t)))),Ae=/^(.*?)(8|16|32|64)(Clamped)?Array$/,Ee=(e,r=!1)=>{const t=d(e);switch(t){case"Null":case"String":case"Number":case"Boolean":case"Symbol":return e;case"Array":return r?[...e]:_e(Ee,e);case"Object":if(r)return{...e};const s={};for(let r in e)s[r]=Ee(e[r]);return s;default:return Ae.test(t)?e.constructor.from(e):e}},Se=c(((e,r,t)=>b(e,Ee(r),t))),ke=p(((e,r)=>$e(e,r))),Pe=p(((e,r)=>{const t={};for(const s of e)s in r&&(t[s]=r[s]);return t})),ve=p(((e,r)=>$e(((r,t)=>!_(t,e)),r))),De=e=>Se(((e,r)=>ie(...r,e)),{},e),Ne=p(((e,r)=>e.concat(r))),Be=p(((e,r)=>r.join(e))),_e=p(((e,r)=>r.map(e))),Ce=p(((e,r)=>r.forEach(e))),Te=c(((e,r,t)=>r(t)&&e(t))),Ue=c(((e,r,t)=>t.replace(e,r))),$e=p(((e,r)=>f(r)?r.filter(e):D(De,$e((([r,t])=>e(t,r))),J)(r))),ze=p(((e,r)=>Object.assign({},e,r))),Fe=p(((e,r)=>j(Ee(e),Ee(r)))),Ie=p(((e,r)=>O(Ee(e),Ee(r)))),Ke=p(((e,r)=>q(Ee(e),Ee(r)))),Le=c(((e,r,t)=>ie(e,r(t[e]),t))),Xe=p(((e,r)=>A(e,Object.assign({},r)))),Ge=(()=>{const e=async(r,t,s)=>{s<t.length&&(await r(t[s]),await e(r,t,++s))};return p(((r,t)=>e(r,t,0)))})(),He=p((async(e,r)=>(await e(r),r))),Je=p(((e,r)=>Promise.all(r.map(e)))),Me=(()=>{const e=async(r,t,s)=>~s?await e(r,await r[s](t),--s):t;return(...r)=>t=>e(r,t,r.length-1)})(),Qe=X,Re=X,Ve=X;exports.F=Y,exports.T=W,exports.__=e,exports.add=$,exports.all=fe,exports.allPass=me,exports.always=L,exports.any=he,exports.anyPass=de,exports.append=R,exports.assoc=ie,exports.assocPath=ue,exports.bind=N,exports.both=Te,exports.clone=Ee,exports.cloneShallow=e=>Ee(e,!0),exports.complement=H,exports.compose=D,exports.composeAsync=Me,exports.concat=Ne,exports.cond=le,exports.curry=o,exports.curry2=p,exports.curry3=c,exports.echo=Ve,exports.empty=e=>{switch(d(e)){case"String":return"";case"Object":return{};case"Array":return[];default:return a}},exports.equals=k,exports.explore=(e,r="log")=>Q((t=>console[r](e,t))),exports.filter=$e,exports.find=ce,exports.findIndex=ae,exports.flip=F,exports.forEach=Ce,exports.forEachAsync=Je,exports.forEachSerial=Ge,exports.fromPairs=De,exports.genBy=re,exports.getTmpl=e=>{const r=[],t=[],s=e.length;let o,n,p=0,c=0,a=!1;for(p=0;p<s;p++)switch(o=e[p],o){case"{":a=!0,c=p;break;case"}":a=!1,r.push(""),t.push(e.slice(c+1,p));break;default:a||(n=r.length-1,n<0&&(r.push(""),n++),r[n]+=o)}return e=>{const s=[],o=r.length-1;for(const n in r)p=+n,s.push(r[p]),p!==o&&s.push(je(t[p].split("."),e));return s.join("")}},exports.gt=te,exports.gte=oe,exports.head=T,exports.identity=X,exports.ifElse=P,exports.includes=_,exports.indexOf=xe,exports.intersection=ee,exports.isEmpty=e=>{switch(d(e)){case"String":case"Array":return 0==K(e);case"Object":for(const r in e)return!1;return!0;default:return null}},exports.isNil=I,exports.join=Be,exports.keys=e=>Object.keys(e),exports.last=e=>e[K(e)-1],exports.length=K,exports.lt=se,exports.lte=ne,exports.map=_e,exports.mapKeys=Xe,exports.memoize=e=>{let r,t=!1;return()=>t?r:(t=!0,r=e())},exports.mergeDeep=Fe,exports.mergeDeepAdd=Ke,exports.mergeDeepX=Ie,exports.mergeShallow=ze,exports.mirror=Qe,exports.not=G,exports.nth=B,exports.omit=ve,exports.once=e=>{let r,t=!1;return(...s)=>t?r:(t=!0,r=e(...s))},exports.overProp=Le,exports.path=je,exports.pathEq=Oe,exports.pathOr=we,exports.pathsEq=qe,exports.pick=Pe,exports.pickBy=ke,exports.prop=ye,exports.propEq=ge,exports.propsEq=be,exports.qappend=y,exports.qassoc=g,exports.qfilter=E,exports.qindexOf=S,exports.qmapKeys=A,exports.qmergeDeep=j,exports.qmergeDeepAdd=q,exports.qmergeDeepX=O,exports.qreduce=b,exports.range=Z,exports.reduce=Se,exports.reflect=Re,exports.replace=Ue,exports.reverse=e=>D((r=>Se(((t,s,o)=>y(e[r-o],t)),[],e)),$(-1),K)(e),exports.sizeof=e=>{if("Object"===d(e)){let r=0;for(let t in e)r++;return r}return K(e)},exports.slice=C,exports.sort=pe,exports.split=V,exports.subtract=z,exports.tail=U,exports.tap=Q,exports.test=M,exports.toLower=e=>e.toLowerCase(),exports.toPairs=J,exports.toUpper=e=>e.toUpperCase(),exports.trim=e=>e.trim(),exports.type=d,exports.uncurry=e=>(...r)=>b(((e,r)=>e?e(r):e),e,r),exports.uniq=e=>b(((e,r)=>_(r,e)?e:y(r,e)),[],e),exports.values=e=>Object.values(e),exports.waitAll=e=>Promise.all(e),exports.waitTap=He,exports.when=v;

package/dist/es/curry.js

@@ -1,4 +1,4 @@
-export const __ = (function Placeholder() { });
+export const __ = Symbol('Placeholder');
 const countArgs = (s) => {
     let i = 0;
     for (const v of s)
@@ -38,3 +38,31 @@ const _curry = (fn, args, new_args) => {
 export const curry = ((fn) => ((...args) => fn.length > countArgs(args)
     ? _curry(fn, [], args)
     : fn(...args)));
+const endlessph = (fn) => {
+    function _endlessph(a) {
+        return a === __ ? fn : fn(a);
+    }
+    return _endlessph;
+};
+export function curry2(fn) {
+    function curried2(a, b) {
+        const withPlaceholder1 = a === __;
+        const aln = arguments.length;
+        if (aln === 1 && withPlaceholder1)
+            throw new Error('Senseless placeholder usage.');
+        return arguments.length > 1
+            ? withPlaceholder1
+                ? endlessph((a) => fn(a, b))
+                : fn(a, b)
+            : (b) => fn(a, b);
+    }
+    return curried2;
+}
+export function curry3(fn) {
+    // type p0 = Parameters<Func>[0]
+    // type p1 = Parameters<Func>[1]
+    // type p2 = Parameters<Func>[2]
+    // type ReturnT = ReturnType<Func>
+    // TODO: optimize.
+    return curry(fn);
+}

package/dist/es/index.js

@@ -1,4 +1,5 @@
 export * from './curry';
+export * from './uncurry';
 export * from './common';
 export * from './safe';
 export * from './quick';

package/dist/es/quick.js

@@ -1,14 +1,14 @@
-import { curry } from "./curry";
+import { curry2, curry3 } from "./curry";
 import { type } from "./common";
 import { isFunc, isArray } from "./utils";
-export const qappend = curry((s, xs) => { xs.push(s); return xs; });
-export const qassoc = curry((prop, v, obj) => {
+export const qappend = curry2((s, xs) => { xs.push(s); return xs; });
+export const qassoc = curry3((prop, v, obj) => {
     obj[prop] = v;
     return obj;
 });
-export const qreduce = curry((fn, accum, arr) => arr.reduce(fn, accum));
+export const qreduce = curry3((fn, accum, arr) => arr.reduce(fn, accum));
 // strategy is for arrays: 1->clean, 2->merge, 3->push.
-const mergeDeep = curry((strategy, o1, o2) => {
+const mergeDeep = curry3((strategy, o1, o2) => {
     for (let k in o2) {
         switch (type(o2[k])) {
             case 'Array':
@@ -49,7 +49,7 @@ export const qmergeDeep = mergeDeep(1);
 export const qmergeDeepX = mergeDeep(2);
 export const qmergeDeepAdd = mergeDeep(3);
 /** qmapKeys({ a: 'b' }, { a: 44 }) -> { b: 44 } */
-export const qmapKeys = curry((keyMap, o) => {
+export const qmapKeys = curry2((keyMap, o) => {
     let k, mapped, newKey, newValue;
     for (k in keyMap) {
         mapped = keyMap[k];
@@ -63,7 +63,7 @@ export const qmapKeys = curry((keyMap, o) => {
     }
     return o;
 });
-export const qfilter = curry((cond, data) => {
+export const qfilter = curry2((cond, data) => {
     const isArr = isArray(data);
     for (let k in data) {
         if (!cond(data[k], k)) {
@@ -79,4 +79,4 @@ export const qfilter = curry((cond, data) => {
     return data;
 });
 /** @deprecated */
-export const qindexOf = curry((x, xs) => xs.indexOf(x));
+export const qindexOf = curry2((x, xs) => xs.indexOf(x));