@naturalcycles/js-lib 14.216.0 → 14.218.0

package/dist/array/array.util.d.ts

@@ -115,8 +115,13 @@ export declare function _dropWhile<T>(items: T[], predicate: Predicate<T>): T[];
 export declare function _dropRightWhile<T>(items: T[], predicate: Predicate<T>): T[];
 /**
  * Counts how many items match the predicate.
+ *
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
+ */
+export declare function _count<T>(items: T[], predicate: AbortablePredicate<T>, limit?: number): number;
+/**
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
  */
-export declare function _count<T>(items: T[], predicate: AbortablePredicate<T>): number;
 export declare function _countBy<T>(items: T[], mapper: Mapper<T, any>): StringMap<number>;
 /**
  * Returns an intersection between 2 arrays.

package/dist/array/array.util.js

@@ -42,10 +42,10 @@ exports._uniq = _uniq;
  * a = _uniq([...a, item])
  */
 function _pushUniq(a, ...items) {
-    items.forEach(item => {
+    for (const item of items) {
         if (!a.includes(item))
             a.push(item);
-    });
+    }
     return a;
 }
 exports._pushUniq = _pushUniq;
@@ -206,23 +206,33 @@ function _dropRightWhile(items, predicate) {
 exports._dropRightWhile = _dropRightWhile;
 /**
  * Counts how many items match the predicate.
+ *
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
  */
-function _count(items, predicate) {
+function _count(items, predicate, limit) {
+    if (limit === 0)
+        return 0;
     let count = 0;
     for (const [i, item] of items.entries()) {
         const r = predicate(item, i);
         if (r === types_1.END)
             break;
-        if (r)
+        if (r) {
             count++;
+            if (limit && count >= limit)
+                break;
+        }
     }
     return count;
 }
 exports._count = _count;
+/**
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
+ */
 function _countBy(items, mapper) {
     const map = {};
-    items.forEach((item, index) => {
-        const key = mapper(item, index);
+    items.forEach((item, i) => {
+        const key = mapper(item, i);
         map[key] = (map[key] || 0) + 1;
     });
     return map;
@@ -296,12 +306,12 @@ exports._sumBy = _sumBy;
  */
 function _mapToObject(array, mapper) {
     const m = {};
-    array.forEach(item => {
+    for (const item of array) {
         const r = mapper(item);
         if (!r)
-            return; // filtering
+            continue; // filtering
         m[r[0]] = r[1];
-    });
+    }
     return m;
 }
 exports._mapToObject = _mapToObject;
@@ -400,13 +410,13 @@ function _maxByOrUndefined(array, mapper) {
         return;
     let maxItem;
     let max;
-    array.forEach((item, i) => {
+    for (const [i, item] of array.entries()) {
         const v = mapper(item, i);
         if (v !== undefined && (max === undefined || v > max)) {
             maxItem = item;
             max = v;
         }
-    });
+    }
     return maxItem;
 }
 exports._maxByOrUndefined = _maxByOrUndefined;
@@ -415,13 +425,13 @@ function _minByOrUndefined(array, mapper) {
         return;
     let minItem;
     let min;
-    array.forEach((item, i) => {
+    for (const [i, item] of array.entries()) {
         const v = mapper(item, i);
         if (v !== undefined && (min === undefined || v < min)) {
             minItem = item;
             min = v;
         }
-    });
+    }
     return minItem;
 }
 exports._minByOrUndefined = _minByOrUndefined;

package/dist/form.util.js

@@ -9,7 +9,9 @@ exports.formDataToObject = exports.objectToFormData = void 0;
  */
 function objectToFormData(obj = {}) {
     const fd = new FormData();
-    Object.entries(obj).forEach(([k, v]) => fd.append(k, v));
+    for (const [k, v] of Object.entries(obj)) {
+        fd.append(k, v);
+    }
     return fd;
 }
 exports.objectToFormData = objectToFormData;

package/dist/http/fetcher.js

@@ -48,7 +48,7 @@ class Fetcher {
         }
         this.cfg = this.normalizeCfg(cfg);
         // Dynamically create all helper methods
-        http_model_1.HTTP_METHODS.forEach(method => {
+        for (const method of http_model_1.HTTP_METHODS) {
             const m = method.toLowerCase();
             this[`${m}Void`] = async (url, opt) => {
                 return await this.fetch({
@@ -77,7 +77,7 @@ class Fetcher {
                     ...opt,
                 });
             };
-        });
+        }
     }
     /**
      * Add BeforeRequest hook at the end of the hooks list.

package/dist/math/math.util.js

@@ -58,14 +58,14 @@ exports._percentile = _percentile;
 function _percentiles(values, pcs) {
     const r = {};
     const sorted = (0, number_util_1._sortNumbers)(values);
-    pcs.forEach(pc => {
+    for (const pc of pcs) {
         // Floating pos in the range of [0; length - 1]
         const pos = ((values.length - 1) * pc) / 100;
         const dec = pos % 1;
         const floorPos = Math.floor(pos);
         const ceilPos = Math.ceil(pos);
         r[pc] = _averageWeighted([sorted[floorPos], sorted[ceilPos]], [1 - dec, dec]);
-    });
+    }
     return r;
 }
 exports._percentiles = _percentiles;

package/dist/object/object.util.js

@@ -402,8 +402,11 @@ exports._deepFreeze = _deepFreeze;
  */
 function _objectAssignExact(target, source) {
     Object.assign(target, source);
-    Object.keys(target)
-        .filter(k => !(k in source))
-        .forEach(k => delete target[k]);
+    for (const k of Object.keys(target)) {
+        if (!(k in source)) {
+            // consider setting it to undefined maybe?
+            delete target[k];
+        }
+    }
 }
 exports._objectAssignExact = _objectAssignExact;

package/dist/string/leven.d.ts

@@ -2,5 +2,8 @@
  * Modified version of: https://github.com/sindresorhus/leven/
  *
  * Returns a Levenshtein distance between first and second word.
+ *
+ * `limit` optional parameter can be used to limit the distance calculation
+ * and skip unnecessary iterations when limit is reached.
  */
-export declare function _leven(first: string, second: string): number;
+export declare function _leven(first: string, second: string, limit?: number): number;

package/dist/string/leven.js

@@ -8,9 +8,12 @@ const characterCodeCache = [];
  * Modified version of: https://github.com/sindresorhus/leven/
  *
  * Returns a Levenshtein distance between first and second word.
+ *
+ * `limit` optional parameter can be used to limit the distance calculation
+ * and skip unnecessary iterations when limit is reached.
  */
-function _leven(first, second) {
-    if (first === second) {
+function _leven(first, second, limit) {
+    if (first === second || limit === 0) {
         return 0;
     }
     const swap = first;
@@ -40,6 +43,8 @@ function _leven(first, second) {
     firstLength -= start;
     secondLength -= start;
     if (firstLength === 0) {
+        if (limit && secondLength >= limit)
+            return limit;
         return secondLength;
     }
     let bCharacterCode;
@@ -56,6 +61,8 @@ function _leven(first, second) {
         bCharacterCode = second.charCodeAt(start + index2);
         temporary = index2++;
         result = index2;
+        if (limit && result >= limit)
+            return limit; // exit early on limit
         for (index = 0; index < firstLength; index++) {
             temporary2 = bCharacterCode === characterCodeCache[index] ? temporary : temporary + 1;
             temporary = array[index];

package/dist-esm/array/array.util.js

@@ -37,10 +37,10 @@ export function _uniq(a) {
  * a = _uniq([...a, item])
  */
 export function _pushUniq(a, ...items) {
-    items.forEach(item => {
+    for (const item of items) {
         if (!a.includes(item))
             a.push(item);
-    });
+    }
     return a;
 }
 /**
@@ -188,22 +188,32 @@ export function _dropRightWhile(items, predicate) {
 }
 /**
  * Counts how many items match the predicate.
+ *
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
  */
-export function _count(items, predicate) {
+export function _count(items, predicate, limit) {
+    if (limit === 0)
+        return 0;
     let count = 0;
     for (const [i, item] of items.entries()) {
         const r = predicate(item, i);
         if (r === END)
             break;
-        if (r)
+        if (r) {
             count++;
+            if (limit && count >= limit)
+                break;
+        }
     }
     return count;
 }
+/**
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
+ */
 export function _countBy(items, mapper) {
     const map = {};
-    items.forEach((item, index) => {
-        const key = mapper(item, index);
+    items.forEach((item, i) => {
+        const key = mapper(item, i);
         map[key] = (map[key] || 0) + 1;
     });
     return map;
@@ -271,12 +281,12 @@ export function _sumBy(items, mapper) {
  */
 export function _mapToObject(array, mapper) {
     const m = {};
-    array.forEach(item => {
+    for (const item of array) {
         const r = mapper(item);
         if (!r)
-            return; // filtering
+            continue; // filtering
         m[r[0]] = r[1];
-    });
+    }
     return m;
 }
 /**
@@ -364,13 +374,13 @@ export function _maxByOrUndefined(array, mapper) {
         return;
     let maxItem;
     let max;
-    array.forEach((item, i) => {
+    for (const [i, item] of array.entries()) {
         const v = mapper(item, i);
         if (v !== undefined && (max === undefined || v > max)) {
             maxItem = item;
             max = v;
         }
-    });
+    }
     return maxItem;
 }
 export function _minByOrUndefined(array, mapper) {
@@ -378,13 +388,13 @@ export function _minByOrUndefined(array, mapper) {
         return;
     let minItem;
     let min;
-    array.forEach((item, i) => {
+    for (const [i, item] of array.entries()) {
         const v = mapper(item, i);
         if (v !== undefined && (min === undefined || v < min)) {
             minItem = item;
             min = v;
         }
-    });
+    }
     return minItem;
 }
 export function _zip(array1, array2) {

package/dist-esm/form.util.js

@@ -6,7 +6,9 @@
  */
 export function objectToFormData(obj = {}) {
     const fd = new FormData();
-    Object.entries(obj).forEach(([k, v]) => fd.append(k, v));
+    for (const [k, v] of Object.entries(obj)) {
+        fd.append(k, v);
+    }
     return fd;
 }
 export function formDataToObject(formData) {

package/dist-esm/http/fetcher.js

@@ -38,7 +38,7 @@ export class Fetcher {
         }
         this.cfg = this.normalizeCfg(cfg);
         // Dynamically create all helper methods
-        HTTP_METHODS.forEach(method => {
+        for (const method of HTTP_METHODS) {
             const m = method.toLowerCase();
             this[`${m}Void`] = async (url, opt) => {
                 return await this.fetch(Object.assign({ url,
@@ -55,7 +55,7 @@ export class Fetcher {
                 return await this.fetch(Object.assign({ url,
                     method, responseType: 'json' }, opt));
             };
-        });
+        }
     }
     /**
      * Add BeforeRequest hook at the end of the hooks list.

package/dist-esm/math/math.util.js

@@ -51,14 +51,14 @@ export function _percentile(values, pc) {
 export function _percentiles(values, pcs) {
     const r = {};
     const sorted = _sortNumbers(values);
-    pcs.forEach(pc => {
+    for (const pc of pcs) {
         // Floating pos in the range of [0; length - 1]
         const pos = ((values.length - 1) * pc) / 100;
         const dec = pos % 1;
         const floorPos = Math.floor(pos);
         const ceilPos = Math.ceil(pos);
         r[pc] = _averageWeighted([sorted[floorPos], sorted[ceilPos]], [1 - dec, dec]);
-    });
+    }
     return r;
 }
 /**

package/dist-esm/object/object.util.js

@@ -376,7 +376,10 @@ export function _deepFreeze(o) {
  */
 export function _objectAssignExact(target, source) {
     Object.assign(target, source);
-    Object.keys(target)
-        .filter(k => !(k in source))
-        .forEach(k => delete target[k]);
+    for (const k of Object.keys(target)) {
+        if (!(k in source)) {
+            // consider setting it to undefined maybe?
+            delete target[k];
+        }
+    }
 }

package/dist-esm/string/leven.js

@@ -5,9 +5,12 @@ const characterCodeCache = [];
  * Modified version of: https://github.com/sindresorhus/leven/
  *
  * Returns a Levenshtein distance between first and second word.
+ *
+ * `limit` optional parameter can be used to limit the distance calculation
+ * and skip unnecessary iterations when limit is reached.
  */
-export function _leven(first, second) {
-    if (first === second) {
+export function _leven(first, second, limit) {
+    if (first === second || limit === 0) {
         return 0;
     }
     const swap = first;
@@ -37,6 +40,8 @@ export function _leven(first, second) {
     firstLength -= start;
     secondLength -= start;
     if (firstLength === 0) {
+        if (limit && secondLength >= limit)
+            return limit;
         return secondLength;
     }
     let bCharacterCode;
@@ -53,6 +58,8 @@ export function _leven(first, second) {
         bCharacterCode = second.charCodeAt(start + index2);
         temporary = index2++;
         result = index2;
+        if (limit && result >= limit)
+            return limit; // exit early on limit
         for (index = 0; index < firstLength; index++) {
             temporary2 = bCharacterCode === characterCodeCache[index] ? temporary : temporary + 1;
             temporary = array[index];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@naturalcycles/js-lib",
-  "version": "14.216.0",
+  "version": "14.218.0",
   "scripts": {
     "prepare": "husky",
     "build-prod": "build-prod-esm-cjs",

package/src/array/array.util.ts

@@ -48,9 +48,9 @@ export function _uniq<T>(a: readonly T[]): T[] {
  * a = _uniq([...a, item])
  */
 export function _pushUniq<T>(a: T[], ...items: T[]): T[] {
-  items.forEach(item => {
+  for (const item of items) {
     if (!a.includes(item)) a.push(item)
-  })
+  }
   return a
 }
 
@@ -229,24 +229,33 @@ export function _dropRightWhile<T>(items: T[], predicate: Predicate<T>): T[] {
 
 /**
  * Counts how many items match the predicate.
+ *
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
  */
-export function _count<T>(items: T[], predicate: AbortablePredicate<T>): number {
+export function _count<T>(items: T[], predicate: AbortablePredicate<T>, limit?: number): number {
+  if (limit === 0) return 0
   let count = 0
 
   for (const [i, item] of items.entries()) {
     const r = predicate(item, i)
     if (r === END) break
-    if (r) count++
+    if (r) {
+      count++
+      if (limit && count >= limit) break
+    }
   }
 
   return count
 }
 
+/**
+ * `limit` allows to exit early when limit count is reached, skipping further iterations (perf optimization).
+ */
 export function _countBy<T>(items: T[], mapper: Mapper<T, any>): StringMap<number> {
   const map: StringMap<number> = {}
 
-  items.forEach((item, index) => {
-    const key = mapper(item, index)
+  items.forEach((item, i) => {
+    const key = mapper(item, i)
     map[key] = (map[key] || 0) + 1
   })
 
@@ -326,12 +335,12 @@ export function _mapToObject<T, V>(
 ): StringMap<V> {
   const m: StringMap<V> = {}
 
-  array.forEach(item => {
+  for (const item of array) {
     const r = mapper(item)
-    if (!r) return // filtering
+    if (!r) continue // filtering
 
     m[r[0]] = r[1]
-  })
+  }
 
   return m
 }
@@ -428,13 +437,14 @@ export function _maxByOrUndefined<T>(
   if (!array.length) return
   let maxItem: T | undefined
   let max: number | string | undefined
-  array.forEach((item, i) => {
+
+  for (const [i, item] of array.entries()) {
     const v = mapper(item, i)
     if (v !== undefined && (max === undefined || v > max)) {
       maxItem = item
       max = v
     }
-  })
+  }
 
   return maxItem
 }
@@ -446,13 +456,14 @@ export function _minByOrUndefined<T>(
   if (!array.length) return
   let minItem: T | undefined
   let min: number | string | undefined
-  array.forEach((item, i) => {
+
+  for (const [i, item] of array.entries()) {
     const v = mapper(item, i)
     if (v !== undefined && (min === undefined || v < min)) {
       minItem = item
       min = v
     }
-  })
+  }
 
   return minItem
 }

package/src/form.util.ts

@@ -8,7 +8,9 @@ import type { AnyObject } from './types'
  */
 export function objectToFormData(obj: AnyObject = {}): FormData {
   const fd = new FormData()
-  Object.entries(obj).forEach(([k, v]) => fd.append(k, v))
+  for (const [k, v] of Object.entries(obj)) {
+    fd.append(k, v)
+  }
   return fd
 }
 

package/src/http/fetcher.ts

@@ -82,7 +82,7 @@ export class Fetcher {
     this.cfg = this.normalizeCfg(cfg)
 
     // Dynamically create all helper methods
-    HTTP_METHODS.forEach(method => {
+    for (const method of HTTP_METHODS) {
       const m = method.toLowerCase()
 
       // responseType=void
@@ -114,7 +114,7 @@ export class Fetcher {
           ...opt,
         })
       }
-    })
+    }
   }
 
   /**

package/src/math/math.util.ts

@@ -62,7 +62,7 @@ export function _percentiles(values: number[], pcs: number[]): Record<number, nu
 
   const sorted = _sortNumbers(values)
 
-  pcs.forEach(pc => {
+  for (const pc of pcs) {
     // Floating pos in the range of [0; length - 1]
     const pos = ((values.length - 1) * pc) / 100
     const dec = pos % 1
@@ -70,7 +70,7 @@ export function _percentiles(values: number[], pcs: number[]): Record<number, nu
     const ceilPos = Math.ceil(pos)
 
     r[pc] = _averageWeighted([sorted[floorPos]!, sorted[ceilPos]!], [1 - dec, dec])
-  })
+  }
 
   return r
 }

package/src/object/object.util.ts

@@ -440,7 +440,11 @@ export function _deepFreeze(o: any): void {
  */
 export function _objectAssignExact<T extends AnyObject>(target: T, source: T): void {
   Object.assign(target, source)
-  Object.keys(target)
-    .filter(k => !(k in source))
-    .forEach(k => delete target[k])
+
+  for (const k of Object.keys(target)) {
+    if (!(k in source)) {
+      // consider setting it to undefined maybe?
+      delete target[k]
+    }
+  }
 }

package/src/string/leven.ts

@@ -7,9 +7,12 @@ const characterCodeCache: number[] = []
  * Modified version of: https://github.com/sindresorhus/leven/
  *
  * Returns a Levenshtein distance between first and second word.
+ *
+ * `limit` optional parameter can be used to limit the distance calculation
+ * and skip unnecessary iterations when limit is reached.
  */
-export function _leven(first: string, second: string): number {
-  if (first === second) {
+export function _leven(first: string, second: string, limit?: number): number {
+  if (first === second || limit === 0) {
     return 0
   }
 
@@ -47,6 +50,7 @@ export function _leven(first: string, second: string): number {
   secondLength -= start
 
   if (firstLength === 0) {
+    if (limit && secondLength >= limit) return limit
     return secondLength
   }
 
@@ -66,6 +70,7 @@ export function _leven(first: string, second: string): number {
     bCharacterCode = second.charCodeAt(start + index2)
     temporary = index2++
     result = index2
+    if (limit && result >= limit) return limit // exit early on limit
 
     for (index = 0; index < firstLength; index++) {
       temporary2 = bCharacterCode === characterCodeCache[index] ? temporary : temporary + 1