pepka 1.6.21 → 1.6.22

package/dist/bundle.cjs

@@ -57,16 +57,7 @@ function curry2(fn) {
     }
     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.
-    // Cannot use ts-toolbelt due to this error:
-    // Excessive stack depth comparing types 'GapsOf<?, L2>' and 'GapsOf<?, L2>'
-    return curry(fn);
-}
+const curry3 = (fn) => curry(fn);
 
 const length = (s) => s.length;
 const typed_arr_re = /^(.*?)(8|16|32|64)(Clamped)?Array$/;
@@ -257,9 +248,6 @@ const qoverProp = curry3((prop, pipe, data) => qassoc(prop, pipe(data[prop]), da
 // Aliases.
 const qpush = qappend;
 
-// TODO: possibly introduce a second argument limiting unfolding.
-const uncurry = (fn) => (...args) => qreduce(((fn, arg) => fn ? fn(arg) : fn), fn, args);
-
 // TODO: over, lensProp, reduceAsync, propsEq is up to 20x slow due to deep equals.
 const take = (argN) => (...args) => args[argN];
 const ifElse = curry((cond, pipeYes, pipeNo, s) => cond(s) ? pipeYes(s) : pipeNo(s));
@@ -277,6 +265,7 @@ const compose = ((...fns) => (...args) => {
     }
     return s;
 });
+/** @param fn AnyFunc @param context any */
 const bind = curry2((fn, context) => fn.bind(context));
 const nth = curry2((i, data) => data[i]);
 // FIXME: these types. Somewhere in curry2.
@@ -433,11 +422,12 @@ const prop = curry2(((key, o) => o[key])); // as PropGetter
 const propEq = curry3((key, value, o) => equals(o[key], value));
 /** @param key string @param o1 AnyObject @param o2 AnyObject @returns o₁[key] equals o₂[key] */
 const propsEq = curry3((key, o1, o2) => equals(o1[key], o2[key]));
-const pathOr = curry3((_default, path, o) => length(path)
+const _pathOr = (_default, path, o) => length(path)
     ? isNil(o)
         ? _default
-        : compose((k) => k in o ? pathOr(_default, slice(1, inf, path), o[k]) : _default, head)(path)
-    : o);
+        : compose((k) => k in o ? _pathOr(_default, slice(1, inf, path), o[k]) : _default, head)(path)
+    : o;
+const pathOr = curry3(_pathOr); // it's more performant due to recursion there.
 const path = pathOr(undef);
 const pathEq = curry3((_path, value, o) => equals(path(_path, o), value));
 const pathsEq = curry3((_path, o1, o2) => equals(path(_path, o1), path(_path, o2)));
@@ -556,6 +546,32 @@ const push = append;
 const some = any;
 const weakEq = eq;
 
+/** One promise waits for another. */
+const forEachSerial = (() => {
+    const pipe = async (fn, items, i) => {
+        if (i < items.length) {
+            await fn(items[i]);
+            await pipe(fn, items, ++i);
+        }
+    };
+    return curry2((fn, items) => pipe(fn, items, 0));
+})();
+/** Promise.all wrapper for functional pipelining. */
+const waitAll = (promises) => Promise.all(promises);
+/** Waits for a Promise that been generated by the first arg, then returns an untoched value. Types T.
+ * @param {AnyFunc<Promise>} fn - function to wait.
+ * @param {T} s - any value to tap and return back
+ * @returns {T}
+ */
+const waitTap = curry2(async (fn, s) => { await fn(s); return s; });
+/** Waits for all promises mapped by the 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, input, i) => ~i ? await pipe(fns, [await fns[i](...input)], --i) : head(input);
+    return (...fns) => (...input) => pipe(fns, input, fns.length - 1);
+})();
+
 const ecran = '\\';
 // TODO: make it splicy, not accumulatie by symbols.
 /** Supports ecrans: '\\{"json": {yes} \\}'
@@ -623,44 +639,22 @@ const debounce = (time, fn) => {
         queue.push(ff);
     }));
 };
-// export const debouncePrepared = 
 const throttle = (time, fn) => {
     let on = true;
+    let res;
     return (...args) => {
         if (on) {
             on = false;
             setTimeout(() => on = true, time);
-            return fn(...args);
+            res = fn(...args);
         }
+        return res;
     };
 };
 const wait = (time) => new Promise((ff) => setTimeout(ff, time));
 
-/** One promise waits for another. */
-const forEachSerial = (() => {
-    const pipe = async (fn, items, i) => {
-        if (i < items.length) {
-            await fn(items[i]);
-            await pipe(fn, items, ++i);
-        }
-    };
-    return curry2((fn, items) => pipe(fn, items, 0));
-})();
-/** Promise.all wrapper for functional pipelining. */
-const waitAll = (promises) => Promise.all(promises);
-/** Waits for a Promise that been generated by the first arg, then returns an untoched value. Types T.
- * @param {AnyFunc<Promise>} fn - function to wait.
- * @param {T} s - any value to tap and return back
- * @returns {T}
- */
-const waitTap = curry2(async (fn, s) => { await fn(s); return s; });
-/** Waits for all promises mapped by the 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, input, i) => ~i ? await pipe(fns, [await fns[i](...input)], --i) : head(input);
-    return (...fns) => (...input) => pipe(fns, input, fns.length - 1);
-})();
+// TODO: possibly introduce a second argument limiting unfolding.
+const uncurry = (fn) => (...args) => qreduce(((fn, arg) => fn ? fn(arg) : fn), fn, args);
 
 exports.F = F;
 exports.T = T;

package/dist/bundle.mjs

@@ -55,16 +55,7 @@ function curry2(fn) {
     }
     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.
-    // Cannot use ts-toolbelt due to this error:
-    // Excessive stack depth comparing types 'GapsOf<?, L2>' and 'GapsOf<?, L2>'
-    return curry(fn);
-}
+const curry3 = (fn) => curry(fn);
 
 const length = (s) => s.length;
 const typed_arr_re = /^(.*?)(8|16|32|64)(Clamped)?Array$/;
@@ -255,9 +246,6 @@ const qoverProp = curry3((prop, pipe, data) => qassoc(prop, pipe(data[prop]), da
 // Aliases.
 const qpush = qappend;
 
-// TODO: possibly introduce a second argument limiting unfolding.
-const uncurry = (fn) => (...args) => qreduce(((fn, arg) => fn ? fn(arg) : fn), fn, args);
-
 // TODO: over, lensProp, reduceAsync, propsEq is up to 20x slow due to deep equals.
 const take = (argN) => (...args) => args[argN];
 const ifElse = curry((cond, pipeYes, pipeNo, s) => cond(s) ? pipeYes(s) : pipeNo(s));
@@ -275,6 +263,7 @@ const compose = ((...fns) => (...args) => {
     }
     return s;
 });
+/** @param fn AnyFunc @param context any */
 const bind = curry2((fn, context) => fn.bind(context));
 const nth = curry2((i, data) => data[i]);
 // FIXME: these types. Somewhere in curry2.
@@ -431,11 +420,12 @@ const prop = curry2(((key, o) => o[key])); // as PropGetter
 const propEq = curry3((key, value, o) => equals(o[key], value));
 /** @param key string @param o1 AnyObject @param o2 AnyObject @returns o₁[key] equals o₂[key] */
 const propsEq = curry3((key, o1, o2) => equals(o1[key], o2[key]));
-const pathOr = curry3((_default, path, o) => length(path)
+const _pathOr = (_default, path, o) => length(path)
     ? isNil(o)
         ? _default
-        : compose((k) => k in o ? pathOr(_default, slice(1, inf, path), o[k]) : _default, head)(path)
-    : o);
+        : compose((k) => k in o ? _pathOr(_default, slice(1, inf, path), o[k]) : _default, head)(path)
+    : o;
+const pathOr = curry3(_pathOr); // it's more performant due to recursion there.
 const path = pathOr(undef);
 const pathEq = curry3((_path, value, o) => equals(path(_path, o), value));
 const pathsEq = curry3((_path, o1, o2) => equals(path(_path, o1), path(_path, o2)));
@@ -554,6 +544,32 @@ const push = append;
 const some = any;
 const weakEq = eq;
 
+/** One promise waits for another. */
+const forEachSerial = (() => {
+    const pipe = async (fn, items, i) => {
+        if (i < items.length) {
+            await fn(items[i]);
+            await pipe(fn, items, ++i);
+        }
+    };
+    return curry2((fn, items) => pipe(fn, items, 0));
+})();
+/** Promise.all wrapper for functional pipelining. */
+const waitAll = (promises) => Promise.all(promises);
+/** Waits for a Promise that been generated by the first arg, then returns an untoched value. Types T.
+ * @param {AnyFunc<Promise>} fn - function to wait.
+ * @param {T} s - any value to tap and return back
+ * @returns {T}
+ */
+const waitTap = curry2(async (fn, s) => { await fn(s); return s; });
+/** Waits for all promises mapped by the 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, input, i) => ~i ? await pipe(fns, [await fns[i](...input)], --i) : head(input);
+    return (...fns) => (...input) => pipe(fns, input, fns.length - 1);
+})();
+
 const ecran = '\\';
 // TODO: make it splicy, not accumulatie by symbols.
 /** Supports ecrans: '\\{"json": {yes} \\}'
@@ -621,43 +637,21 @@ const debounce = (time, fn) => {
         queue.push(ff);
     }));
 };
-// export const debouncePrepared = 
 const throttle = (time, fn) => {
     let on = true;
+    let res;
     return (...args) => {
         if (on) {
             on = false;
             setTimeout(() => on = true, time);
-            return fn(...args);
+            res = fn(...args);
         }
+        return res;
     };
 };
 const wait = (time) => new Promise((ff) => setTimeout(ff, time));
 
-/** One promise waits for another. */
-const forEachSerial = (() => {
-    const pipe = async (fn, items, i) => {
-        if (i < items.length) {
-            await fn(items[i]);
-            await pipe(fn, items, ++i);
-        }
-    };
-    return curry2((fn, items) => pipe(fn, items, 0));
-})();
-/** Promise.all wrapper for functional pipelining. */
-const waitAll = (promises) => Promise.all(promises);
-/** Waits for a Promise that been generated by the first arg, then returns an untoched value. Types T.
- * @param {AnyFunc<Promise>} fn - function to wait.
- * @param {T} s - any value to tap and return back
- * @returns {T}
- */
-const waitTap = curry2(async (fn, s) => { await fn(s); return s; });
-/** Waits for all promises mapped by the 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, input, i) => ~i ? await pipe(fns, [await fns[i](...input)], --i) : head(input);
-    return (...fns) => (...input) => pipe(fns, input, fns.length - 1);
-})();
+// TODO: possibly introduce a second argument limiting unfolding.
+const uncurry = (fn) => (...args) => qreduce(((fn, arg) => fn ? fn(arg) : fn), fn, args);
 
 export { F, T, __, add, all, allPass, always, any, anyPass, append, assoc, assocPath, bind, both, callFrom, callWith, clone, cloneShallow, complement, compose, composeAsync, concat, cond, curry, curry2, curry3, debounce, diff, divide, echo, empty, eq, equals, explore, filter, find, findIndex, flat, flatShallow, flatTo, flip, forEach, forEachAsync, forEachSerial, freeze, freezeShallow, fromPairs, genBy, getTmpl, gt, gte, head, identity, ifElse, includes, indexOf, intersection, isEmpty, isNil, join, keys, last, length, lt, lte, map, mapKeys, mapObj, memoize, mergeDeep, mergeDeepAdd, mergeDeepX, mergeShallow, mirror, multiply, noop, not, notf, nth, omit, once, overProp, path, pathEq, pathExists, pathOr, pathsEq, pick, pickBy, prepend, prop, propEq, propsEq, push, qappend, qassoc, qassocPath, qempty, qfilter, qfreeze, qfreezeShallow, qmap, qmapKeys, qmapObj, qmergeDeep, qmergeDeepAdd, qmergeDeepX, qmergeShallow, qomit, qoverProp, qprepend, qpush, qreduce, qreverse, qsort, range, reduce, reflect, replace, reverse, sizeof, slice, some, sort, split, startsWith, startsWithShallow, subtract, symbol, tail, take, tap, test, throttle, toLower, toPairs, toUpper, trim, type, typeIs, uncurry, uniq, uniqWith, values, wait, waitAll, waitTap, weakEq, when, zip, zipObj, zipWith };

package/package.json

@@ -41,7 +41,7 @@
     "prod": "npm run gentypes && npm run prod:es && npm run prod:cjs",
     "all": "npm run dev && npm run prod"
   },
-  "version": "1.6.21",
+  "version": "1.6.22",
   "devDependencies": {
     "@rollup/plugin-commonjs": "^29.0.0",
     "@rollup/plugin-node-resolve": "^16.0.3",

package/src/curry.ts

@@ -98,5 +98,5 @@ export type Curried3<A, B, C, R> =
   & ((a: Placeholder, b: B, c: Placeholder) => (a: A, c: C) => R)
   & ((a: A, b: Placeholder, c: Placeholder) => (b: B, c: C) => R)
 
-export declare const curry3: <Params extends [any, any, any], ReturnT, F = AnyFunc<ReturnT, Params>>(fn: F) =>
-  Curried3<Params[0], Params[1], Params[2], ReturnT>
+export const curry3 = <Params extends [any, any, any], ReturnT, F = AnyFunc<ReturnT, Params>>(fn: F):
+  Curried3<Params[0], Params[1], Params[2], ReturnT> => curry(fn as any)