@naturalcycles/js-lib 14.198.0 → 14.200.0

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

@@ -1,4 +1,4 @@
-import type { FalsyValue, Mapper, Predicate, SortDirection, StringMap } from '../types';
+import { AbortablePredicate, FalsyValue, Mapper, Predicate, SortDirection, StringMap } from '../types';
 /**
  * Creates an array of elements split into groups the length of size. If collection can’t be split evenly, the
  * final chunk will be the remaining elements.
@@ -110,6 +110,10 @@ export declare function _takeWhile<T>(items: T[], predicate: Predicate<T>): T[];
 export declare function _takeRightWhile<T>(items: T[], predicate: Predicate<T>): T[];
 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.
+ */
+export declare function _count<T>(items: T[], predicate: AbortablePredicate<T>): number;
 export declare function _countBy<T>(items: T[], mapper: Mapper<T, any>): StringMap<number>;
 /**
  * @example
@@ -171,3 +175,4 @@ export declare function _maxBy<T>(array: T[], mapper: Mapper<T, number | undefin
 export declare function _minBy<T>(array: T[], mapper: Mapper<T, number | undefined>): T;
 export declare function _maxByOrUndefined<T>(array: T[], mapper: Mapper<T, number | undefined>): T | undefined;
 export declare function _minByOrUndefined<T>(array: T[], mapper: Mapper<T, number | undefined>): T | undefined;
+export declare function _zip<T1, T2>(array1: T1[], array2: T2[]): [T1, T2][];

package/dist/array/array.util.js

@@ -1,7 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports._minByOrUndefined = exports._maxByOrUndefined = exports._minBy = exports._maxBy = exports._max = exports._maxOrUndefined = exports._min = exports._minOrUndefined = exports._lastOrUndefined = exports._last = exports._shuffle = exports._mapToObject = exports._sumBy = exports._sum = exports._difference = exports._intersection = exports._countBy = exports._dropRightWhile = exports._dropWhile = exports._takeRightWhile = exports._takeWhile = exports._findLast = exports._sortDescBy = exports._sortBy = exports._groupBy = exports._mapBy = exports._by = exports._uniqBy = exports._pushUniqBy = exports._pushUniq = exports._uniq = exports._chunk = void 0;
+exports._zip = exports._minByOrUndefined = exports._maxByOrUndefined = exports._minBy = exports._maxBy = exports._max = exports._maxOrUndefined = exports._min = exports._minOrUndefined = exports._lastOrUndefined = exports._last = exports._shuffle = exports._mapToObject = exports._sumBy = exports._sum = exports._difference = exports._intersection = exports._countBy = exports._count = exports._dropRightWhile = exports._dropWhile = exports._takeRightWhile = exports._takeWhile = exports._findLast = exports._sortDescBy = exports._sortBy = exports._groupBy = exports._mapBy = exports._by = exports._uniqBy = exports._pushUniqBy = exports._pushUniq = exports._uniq = exports._chunk = void 0;
 const is_util_1 = require("../is.util");
+const types_1 = require("../types");
 /**
  * Creates an array of elements split into groups the length of size. If collection can’t be split evenly, the
  * final chunk will be the remaining elements.
@@ -200,6 +201,21 @@ function _dropRightWhile(items, predicate) {
         .reverse();
 }
 exports._dropRightWhile = _dropRightWhile;
+/**
+ * Counts how many items match the predicate.
+ */
+function _count(items, predicate) {
+    let count = 0;
+    for (const [i, item] of items.entries()) {
+        const r = predicate(item, i);
+        if (r === types_1.END)
+            break;
+        if (r)
+            count++;
+    }
+    return count;
+}
+exports._count = _count;
 function _countBy(items, mapper) {
     const map = {};
     items.forEach((item, index) => {
@@ -378,3 +394,12 @@ function _minByOrUndefined(array, mapper) {
     return minItem;
 }
 exports._minByOrUndefined = _minByOrUndefined;
+function _zip(array1, array2) {
+    const len = Math.min(array1.length, array2.length);
+    const res = [];
+    for (let i = 0; i < len; i++) {
+        res.push([array1[i], array2[i]]);
+    }
+    return res;
+}
+exports._zip = _zip;

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

@@ -1,4 +1,5 @@
 import { _isNotNullish } from '../is.util';
+import { END, } from '../types';
 /**
  * Creates an array of elements split into groups the length of size. If collection can’t be split evenly, the
  * final chunk will be the remaining elements.
@@ -182,6 +183,20 @@ export function _dropRightWhile(items, predicate) {
         .filter((v, index) => (proceed || (proceed = !predicate(v, index))))
         .reverse();
 }
+/**
+ * Counts how many items match the predicate.
+ */
+export function _count(items, predicate) {
+    let count = 0;
+    for (const [i, item] of items.entries()) {
+        const r = predicate(item, i);
+        if (r === END)
+            break;
+        if (r)
+            count++;
+    }
+    return count;
+}
 export function _countBy(items, mapper) {
     const map = {};
     items.forEach((item, index) => {
@@ -343,3 +358,11 @@ export function _minByOrUndefined(array, mapper) {
     });
     return minItem;
 }
+export function _zip(array1, array2) {
+    const len = Math.min(array1.length, array2.length);
+    const res = [];
+    for (let i = 0; i < len; i++) {
+        res.push([array1[i], array2[i]]);
+    }
+    return res;
+}

package/package.json

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

package/src/array/array.util.ts

@@ -1,5 +1,13 @@
 import { _isNotNullish } from '../is.util'
-import type { FalsyValue, Mapper, Predicate, SortDirection, StringMap } from '../types'
+import {
+  AbortablePredicate,
+  END,
+  FalsyValue,
+  Mapper,
+  Predicate,
+  SortDirection,
+  StringMap,
+} from '../types'
 
 /**
  * Creates an array of elements split into groups the length of size. If collection can’t be split evenly, the
@@ -216,6 +224,21 @@ export function _dropRightWhile<T>(items: T[], predicate: Predicate<T>): T[] {
     .reverse()
 }
 
+/**
+ * Counts how many items match the predicate.
+ */
+export function _count<T>(items: T[], predicate: AbortablePredicate<T>): number {
+  let count = 0
+
+  for (const [i, item] of items.entries()) {
+    const r = predicate(item, i)
+    if (r === END) break
+    if (r) count++
+  }
+
+  return count
+}
+
 export function _countBy<T>(items: T[], mapper: Mapper<T, any>): StringMap<number> {
   const map: StringMap<number> = {}
 
@@ -402,3 +425,14 @@ export function _minByOrUndefined<T>(
 
   return minItem
 }
+
+export function _zip<T1, T2>(array1: T1[], array2: T2[]): [T1, T2][] {
+  const len = Math.min(array1.length, array2.length)
+  const res: [T1, T2][] = []
+
+  for (let i = 0; i < len; i++) {
+    res.push([array1[i]!, array2[i]!])
+  }
+
+  return res
+}