pepka 1.6.23 → 1.7.0

package/dist/bundle.cjs

@@ -136,9 +136,9 @@ const includes = curry2((s, ss) => {
     }
 });
 
-/* Then next fns seem to be excess due to their safe ver performance should be the same or better:
-* qflat, qpick, qslice, quniq, qflat, qflatShallow, qreduceAsync
-*/
+const { min } = Math;
+const z = 0;
+/* qflat, qflatShallow, qreduceAsync */
 const qappend = curry2((s, xs) => { xs.push(s); return xs; });
 const qassoc = curry3((prop, v, obj) => { obj[prop] = v; return obj; });
 const qreduce = curry3((fn, accum, arr) => arr.reduce(fn, accum));
@@ -254,6 +254,55 @@ const qomit = curry2((props, o) => qfilter((_, k) => !includes(k, props), o));
 /** @param prop string @param pipe (data[prop]): prop_value @param data any
  * @returns data with prop over pipe. */
 const qoverProp = curry3((prop, pipe, data) => qassoc(prop, pipe(data[prop]), data));
+/** Slower than pick() (dictionary mode) !
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
+const qpick = curry2((props, o) => {
+    for (const p in o)
+        if (!props.includes(p))
+            delete o[p];
+    return o;
+});
+const qslice = curry3((from, to, xs) => {
+    const right = (isNum(to) ? to : inf);
+    const window_width = min(right, length(xs)) - from;
+    if (isArray(xs)) {
+        xs = xs;
+        if (from > z)
+            for (let i = z; i < window_width; i++)
+                xs[i] = xs[from + i];
+        xs.length = window_width;
+        return xs;
+    }
+    else
+        return xs.slice(from, right); // strings are immutable.
+});
+/** Should be faster than .splice() 'cause does not make a new array. */
+const rmel = (index, xs) => {
+    const len = length(xs);
+    for (let i = index; i < len; i++)
+        xs[i] = xs[i + 1];
+    xs.length = len - 1;
+    return xs;
+};
+const seen = new Set();
+const quniq = (xs) => {
+    seen.clear();
+    let size = length(xs);
+    for (let i = z; i < size; i++) {
+        const x = xs[i];
+        if (seen.has(x)) {
+            rmel(i, xs);
+            size--;
+            i--;
+        }
+        else
+            seen.add(x);
+    }
+    return xs;
+};
 // Aliases.
 const qpush = qappend;
 
@@ -380,7 +429,12 @@ const diff = curry2((_xs1, _xs2) => {
     }
     return out;
 });
-const genBy = curry2((generator, length) => [...Array(length)].map((_, i) => generator(i)));
+const genBy = curry2((generator, length) => {
+    const a = new Array(length);
+    for (let i = 0; i < length; i++)
+        a[i] = generator(i);
+    return a;
+});
 const once = (fn) => {
     let done = false, cache;
     return function (...args) {
@@ -471,6 +525,11 @@ const freezeShallow = (o) => qfreezeShallow(clone(o));
  *  @param array T2[]
 */
 const reduce = curry3((reducer, accum, arr) => qreduce(reducer, clone(accum), arr));
+/**
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
 const pick = curry2((props, o) => {
     const out = {};
     for (const p of props)
@@ -554,6 +613,7 @@ const notf = complement;
 const push = append;
 const some = any;
 const weakEq = eq;
+const uniqBy = uniqWith;
 
 /** One promise waits for another. */
 const forEachSerial = (() => {
@@ -775,11 +835,14 @@ exports.qmergeDeepX = qmergeDeepX;
 exports.qmergeShallow = qmergeShallow;
 exports.qomit = qomit;
 exports.qoverProp = qoverProp;
+exports.qpick = qpick;
 exports.qprepend = qprepend;
 exports.qpush = qpush;
 exports.qreduce = qreduce;
 exports.qreverse = qreverse;
+exports.qslice = qslice;
 exports.qsort = qsort;
+exports.quniq = quniq;
 exports.range = range;
 exports.reduce = reduce;
 exports.reflect = reflect;
@@ -807,6 +870,7 @@ exports.type = type;
 exports.typeIs = typeIs;
 exports.uncurry = uncurry;
 exports.uniq = uniq;
+exports.uniqBy = uniqBy;
 exports.uniqWith = uniqWith;
 exports.values = values;
 exports.wait = wait;

package/dist/bundle.d.ts

@@ -1,7 +1,9 @@
 // Generated by dts-bundle-generator v9.5.1
 
 type AnyArgs = any[];
-type AnyArray<T = any> = T[] | readonly T[];
+type AnyArray<T = any> = T[] | readonly T[] | (ArrayBufferView & {
+	length: number;
+});
 type Split<S extends string> = S extends `${infer U}${infer V}` ? [
 	U,
 	...Split<V>
@@ -190,6 +192,19 @@ export declare const qomit: {
 /** @param prop string @param pipe (data[prop]): prop_value @param data any
  * @returns data with prop over pipe. */
 export declare const qoverProp: (...args: AnyArgs) => any;
+/** Slower than pick() (dictionary mode) !
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
+export declare const qpick: {
+	(a: Placeholder, b: AnyObject): (a: string[]) => AnyObject;
+	(a: string[], b: Placeholder): (b: AnyObject) => AnyObject;
+	(a: string[]): (b: AnyObject) => AnyObject;
+	(a: string[], b: AnyObject): AnyObject;
+};
+export declare const qslice: (...args: AnyArgs) => any;
+export declare const quniq: (xs: any[]) => any[];
 export declare const qpush: {
 	(a: Placeholder, b: any[]): (a: any) => any[];
 	(a: any, b: Placeholder): (b: any[]) => any[];
@@ -543,11 +558,16 @@ export declare const freezeShallow: <T extends AnyObject>(o: T) => Readonly<T>;
  *  @param array T2[]
 */
 export declare const reduce: (...args: AnyArgs) => any;
+/**
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
 export declare const pick: {
-	(a: Placeholder, b: AnyObject): (a: string[]) => {};
-	(a: string[], b: Placeholder): (b: AnyObject) => {};
-	(a: string[]): (b: AnyObject) => {};
-	(a: string[], b: AnyObject): {};
+	(a: Placeholder, b: AnyObject): (a: (string | number)[]) => {};
+	(a: (string | number)[], b: Placeholder): (b: AnyObject) => {};
+	(a: (string | number)[]): (b: AnyObject) => {};
+	(a: (string | number)[], b: AnyObject): {};
 };
 export declare const pickBy: {
 	(a: Placeholder, b: AnyObject): (a: Cond) => any;
@@ -715,6 +735,12 @@ export declare const weakEq: {
 	(a: any): (b: any) => boolean;
 	(a: any, b: any): boolean;
 };
+export declare const uniqBy: {
+	(a: Placeholder, b: any[]): (a: (x: any, y: any) => boolean) => any;
+	(a: (x: any, y: any) => boolean, b: Placeholder): (b: any[]) => any;
+	(a: (x: any, y: any) => boolean): (b: any[]) => any;
+	(a: (x: any, y: any) => boolean, b: any[]): any;
+};
 type StrTmpl = ((data: AnyObject) => string);
 /** Supports ecrans: '\\{"json": {yes} \\}'
   @returns getTmpl('one{meme}two')({meme: 42}) -> one42two */

package/dist/bundle.mjs

@@ -134,9 +134,9 @@ const includes = curry2((s, ss) => {
     }
 });
 
-/* Then next fns seem to be excess due to their safe ver performance should be the same or better:
-* qflat, qpick, qslice, quniq, qflat, qflatShallow, qreduceAsync
-*/
+const { min } = Math;
+const z = 0;
+/* qflat, qflatShallow, qreduceAsync */
 const qappend = curry2((s, xs) => { xs.push(s); return xs; });
 const qassoc = curry3((prop, v, obj) => { obj[prop] = v; return obj; });
 const qreduce = curry3((fn, accum, arr) => arr.reduce(fn, accum));
@@ -252,6 +252,55 @@ const qomit = curry2((props, o) => qfilter((_, k) => !includes(k, props), o));
 /** @param prop string @param pipe (data[prop]): prop_value @param data any
  * @returns data with prop over pipe. */
 const qoverProp = curry3((prop, pipe, data) => qassoc(prop, pipe(data[prop]), data));
+/** Slower than pick() (dictionary mode) !
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
+const qpick = curry2((props, o) => {
+    for (const p in o)
+        if (!props.includes(p))
+            delete o[p];
+    return o;
+});
+const qslice = curry3((from, to, xs) => {
+    const right = (isNum(to) ? to : inf);
+    const window_width = min(right, length(xs)) - from;
+    if (isArray(xs)) {
+        xs = xs;
+        if (from > z)
+            for (let i = z; i < window_width; i++)
+                xs[i] = xs[from + i];
+        xs.length = window_width;
+        return xs;
+    }
+    else
+        return xs.slice(from, right); // strings are immutable.
+});
+/** Should be faster than .splice() 'cause does not make a new array. */
+const rmel = (index, xs) => {
+    const len = length(xs);
+    for (let i = index; i < len; i++)
+        xs[i] = xs[i + 1];
+    xs.length = len - 1;
+    return xs;
+};
+const seen = new Set();
+const quniq = (xs) => {
+    seen.clear();
+    let size = length(xs);
+    for (let i = z; i < size; i++) {
+        const x = xs[i];
+        if (seen.has(x)) {
+            rmel(i, xs);
+            size--;
+            i--;
+        }
+        else
+            seen.add(x);
+    }
+    return xs;
+};
 // Aliases.
 const qpush = qappend;
 
@@ -378,7 +427,12 @@ const diff = curry2((_xs1, _xs2) => {
     }
     return out;
 });
-const genBy = curry2((generator, length) => [...Array(length)].map((_, i) => generator(i)));
+const genBy = curry2((generator, length) => {
+    const a = new Array(length);
+    for (let i = 0; i < length; i++)
+        a[i] = generator(i);
+    return a;
+});
 const once = (fn) => {
     let done = false, cache;
     return function (...args) {
@@ -469,6 +523,11 @@ const freezeShallow = (o) => qfreezeShallow(clone(o));
  *  @param array T2[]
 */
 const reduce = curry3((reducer, accum, arr) => qreduce(reducer, clone(accum), arr));
+/**
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
 const pick = curry2((props, o) => {
     const out = {};
     for (const p of props)
@@ -552,6 +611,7 @@ const notf = complement;
 const push = append;
 const some = any;
 const weakEq = eq;
+const uniqBy = uniqWith;
 
 /** One promise waits for another. */
 const forEachSerial = (() => {
@@ -663,4 +723,4 @@ const wait = (time) => new Promise((ff) => setTimeout(ff, time));
 // 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 };
+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, qpick, qprepend, qpush, qreduce, qreverse, qslice, qsort, quniq, 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, uniqBy, 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.23",
+  "version": "1.7.0",
   "devDependencies": {
     "@rollup/plugin-commonjs": "^29.0.0",
     "@rollup/plugin-node-resolve": "^16.0.3",

package/src/bench.ts

@@ -0,0 +1,33 @@
+import { qpick } from "./quick"
+import { genBy, identity, range } from "./safe"
+
+
+if(false) {
+  // genBy with [...Array(length)].map(...) performs @ average 53.193s/1e5, 303ms/1e4.
+  console.time('genBy') // now: 17s/1e5, 65ms/1e4
+  for(let i=0; i<1e5; i++) genBy(identity, i)
+  console.timeEnd('genBy')
+}
+
+// qpick:
+// if o = {1: 'yep', 4: 'yep', 'kakashka': 'noooo', 'anotherkakashka': 'nonono!'}:
+// w/  Set: with range(0, 5) -> 83ms; range(0, 50) -> 189ms.
+// w/o Set: with range(0, 5) -> 69ms; range(0, 50) -> 75ms.
+// if o is generated with 52+ leaset keys are not included in props (generator included!):
+// w/  Set: with range(0, 5) -> 998ms; range(0, 50) -> 1100ms.
+// w/o Set: with range(0, 5) -> 1000ms;  range(0, 50) -> 1065ms.
+// pick:
+// if o = {1: 'yep', 4: 'yep', 'kakashka': 'noooo', 'anotherkakashka': 'nonono!'}:
+// w/o Set: with range(0, 5) -> 18ms; range(0, 50) -> 40ms.
+// if o is generated with 52+ leaset keys are not included in props (generator included!):
+// w/o Set: with range(0, 5) -> 600ms;  range(0, 50) -> 647ms.
+for(let j=0; j<1e4; j+=1e3) {
+  console.time('qpick @'+j)
+  const props = range(0, 5)
+  for(let i=0; i<1e5; i++) {
+    const o = {1: 'yep', 4: 'yep', 'kakashka': 'noooo', 'anotherkakashka': 'nonono!'}
+    // for(const x of range(0, 50)) o['_'+x] = x
+    qpick(props, o)
+  }
+  console.timeEnd('qpick @'+j)
+}

package/src/internal.ts

@@ -1,7 +1,7 @@
 import { curry2 } from "./curry"
 import { AnyArray, StrLen } from "./internal_types"
 
-export const length = <T extends AnyArray | string>(s: T): T extends string ? StrLen<T> : T["length"] => s.length as any
+export const length = <T extends AnyArray | string>(s: T): T extends string ? StrLen<T> : T['length'] => s.length as any
 const typed_arr_re = /^(.*?)(8|16|32|64)(Clamped)?Array$/
 export const is_typed_arr = (t: string) => typed_arr_re.test(t)
 /** @param start string | any[] @param s string | any[] */

package/src/internal_types.ts

@@ -2,7 +2,7 @@ export type AnyArgs = any[]
 export type BasicType = 'String'|'Object'|'Number'|'Symbol'|'Array'|'Null'|'Undefined'
 export type TupleFn<ARG1=any, ARG2=any, Out=any> = (a: ARG1, b: ARG2) => Out
 export type IDArray = Uint8Array|Uint16Array|Uint32Array
-export type AnyArray<T=any> = T[] | readonly T[]
+export type AnyArray<T=any> = T[] | readonly T[] | (ArrayBufferView&{length: number})
 export type Split<S extends string> = S extends `${infer U}${infer V}` ? [U, ...Split<V>] : []
 export type IndexesOfArray<A> = Exclude<keyof A, keyof []>
 export type StrLen<S extends string, Acc extends 0[] = []> =

package/src/quick.ts

@@ -1,10 +1,10 @@
+import { includes, length, type } from "./common"
 import { curry2, curry3 } from "./curry"
-import { includes, type } from "./common"
-import { AnyObject, Reducer, AnyFunc } from "./types"
-import { isFunc, isArray, isObj, isNil } from "./utils"
-/* Then next fns seem to be excess due to their safe ver performance should be the same or better:
-* qflat, qpick, qslice, quniq, qflat, qflatShallow, qreduceAsync
-*/
+import { AnyFunc, AnyObject, Reducer } from "./types"
+import { inf, isArray, isFunc, isNil, isNum, isObj } from "./utils"
+const {min} = Math
+const z = 0
+/* qflat, qflatShallow, qreduceAsync */
 
 export const qappend = curry2((s: any, xs: any[]) => {xs.push(s); return xs})
 export const qassoc = curry3((prop: string, v: any, obj: AnyObject) => { obj[prop] = v; return obj })
@@ -132,6 +132,45 @@ export const qomit = curry2(
 export const qoverProp = curry3(
   (prop: string, pipe: AnyFunc, data: any) => qassoc(prop, pipe(data[prop]), data)
 )
+/** Slower than pick() (dictionary mode) !
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
+export const qpick = curry2((props: string[], o: AnyObject) => {
+  for(const p in o) if(!props.includes(p)) delete o[p]
+  return o
+})
+export const qslice = curry3(
+  (from: number, to: number, xs: any[] | string) => {
+    const right = (isNum(to)?to:inf) as number
+    const window_width = min(right, length(xs))-from
+    if(isArray(xs)) {
+      xs = xs as any[]
+      if(from>z) for(let i=z; i<window_width; i++) xs[i] = xs[from+i]
+      xs.length = window_width
+      return xs
+    } else return xs.slice(from, right) // strings are immutable.
+  }
+)
+/** Should be faster than .splice() 'cause does not make a new array. */
+const rmel = (index: number, xs: any[]) => {
+  const len = length(xs)
+  for(let i=index; i<len; i++) xs[i]=xs[i+1]
+  xs.length = len-1
+  return xs
+}
+const seen = new Set()
+export const quniq = (xs: any[]) => {
+  seen.clear()
+  let size = length(xs)
+  for(let i=z; i<size; i++) {
+    const x = xs[i]
+    if(seen.has(x)) {rmel(i, xs); size--; i--}
+    else seen.add(x)
+  }
+  return xs
+}
 
 // Aliases.
 export const qpush = qappend

package/src/safe.ts

@@ -198,7 +198,11 @@ export const genBy = curry2(
   (
     generator: (i: number) => any,
     length: number
-  ) => [...Array(length)].map((_, i) => generator(i))
+  ) => {
+    const a = new Array(length)
+    for(let i=0; i<length; i++) a[i] = generator(i)
+    return a
+  }
 )
 export const once = <Func extends AnyFunc>(fn: Func) => {
   let done = false, cache: ReturnType<Func>
@@ -314,8 +318,13 @@ export const reduce = curry3(
   <T = any>(reducer: Reducer<T>, accum: T, arr: any[]) =>
     qreduce(reducer, clone(accum), arr)
 )
+/**
+ *  @param props (string|number)[]
+ *  @param o AnyObject
+ *  @returns AnyObject
+*/
 export const pick = curry2(
-  (props: string[], o: AnyObject) => {
+  (props: (string|number)[], o: AnyObject) => {
     const out = {}
     for(const p of props) if(p in o) out[p] = o[p]
     return out
@@ -453,4 +462,5 @@ export const echo = identity
 export const notf = complement
 export const push = append
 export const some = any
-export const weakEq = eq
+export const weakEq = eq
+export const uniqBy = uniqWith