@naturalcycles/js-lib 14.277.0 → 15.0.1

package/dist/number/number.util.js

@@ -1,15 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports._randomInt = _randomInt;
-exports._randomArrayItem = _randomArrayItem;
-exports._runLessOften = _runLessOften;
-exports._isBetween = _isBetween;
-exports._clamp = _clamp;
-exports._sortNumbers = _sortNumbers;
-exports._toFixed = _toFixed;
-exports._toPrecision = _toPrecision;
-exports._round = _round;
-function _randomInt(minIncl, maxIncl) {
+export function _randomInt(minIncl, maxIncl) {
     return Math.floor(Math.random() * (maxIncl - minIncl + 1) + minIncl);
 }
 /**
@@ -17,7 +6,7 @@ function _randomInt(minIncl, maxIncl) {
  * Should be used on non-empty arrays! (otherwise will return undefined,
  * which is not reflected in the output type)
  */
-function _randomArrayItem(array) {
+export function _randomArrayItem(array) {
     return array[_randomInt(0, array.length - 1)];
 }
 /**
@@ -29,7 +18,7 @@ function _randomArrayItem(array) {
  *   // this code will run only 10% of the time
  * }
  */
-function _runLessOften(percent) {
+export function _runLessOften(percent) {
     return Math.random() * 100 < percent;
 }
 // todo: _.random to support floats
@@ -43,7 +32,7 @@ function _runLessOften(percent) {
  * Also works with strings:
  * _isBetween('2020-01-03', '2020-01-01', '2020-01-05') // true
  */
-function _isBetween(x, min, max, incl = '[)') {
+export function _isBetween(x, min, max, incl = '[)') {
     if (incl === '[)') {
         return x >= min && x < max;
     }
@@ -55,7 +44,7 @@ function _isBetween(x, min, max, incl = '[)') {
     }
     return x > min && x < max;
 }
-function _clamp(x, minIncl, maxIncl) {
+export function _clamp(x, minIncl, maxIncl) {
     // eslint-disable-next-line unicorn/prefer-math-min-max
     return x <= minIncl ? minIncl : x >= maxIncl ? maxIncl : x;
 }
@@ -68,7 +57,7 @@ function _clamp(x, minIncl, maxIncl) {
  * _sortNumbers([1, 3, 2])
  * // [1, 2, 3]
  */
-function _sortNumbers(numbers, mutate = false, dir = 'asc') {
+export function _sortNumbers(numbers, mutate = false, dir = 'asc') {
     const mod = dir === 'desc' ? -1 : 1;
     return (mutate ? numbers : [...numbers]).sort((a, b) => (a - b) * mod);
 }
@@ -83,7 +72,7 @@ function _sortNumbers(numbers, mutate = false, dir = 'asc') {
  * _toFixed(1.10, 2)
  * // 1.1
  */
-function _toFixed(n, fractionDigits) {
+export function _toFixed(n, fractionDigits) {
     return Number(n.toFixed(fractionDigits));
 }
 /**
@@ -97,7 +86,7 @@ function _toFixed(n, fractionDigits) {
  * _toPrecision(1634.56, 2)
  * // 1600
  */
-function _toPrecision(n, precision) {
+export function _toPrecision(n, precision) {
     return Number(n.toPrecision(precision));
 }
 /**
@@ -111,7 +100,7 @@ function _toPrecision(n, precision) {
  * _round(1634.5678, 0.1) // 1634.6
  * _round(1634.5678, 0.01) // 1634.57
  */
-function _round(n, precisionUnit) {
+export function _round(n, precisionUnit) {
     if (precisionUnit >= 1) {
         return Math.round(n / precisionUnit) * precisionUnit;
     }

package/dist/object/deepEquals.js

@@ -1,9 +1,4 @@
-"use strict";
 // Heavily inspired by https://github.com/epoberezkin/fast-deep-equal
-Object.defineProperty(exports, "__esModule", { value: true });
-exports._deepEquals = _deepEquals;
-exports._deepJsonEquals = _deepJsonEquals;
-exports._jsonEquals = _jsonEquals;
 /**
  Returns true if a and b are deeply equal.
  
@@ -44,7 +39,7 @@ exports._jsonEquals = _jsonEquals;
  
  TLDR: _deepEquals should be useful in most of the cases, start there.
  */
-function _deepEquals(a, b) {
+export function _deepEquals(a, b) {
     if (a === b)
         return true;
     if (Number.isNaN(a)) {
@@ -108,7 +103,7 @@ function _deepEquals(a, b) {
  
  See _deepEquals docs for more details and comparison.
  */
-function _deepJsonEquals(a, b) {
+export function _deepJsonEquals(a, b) {
     if (a === b)
         return true;
     if (Number.isNaN(a)) {
@@ -170,6 +165,6 @@ function _deepJsonEquals(a, b) {
  * Simplest "deep equals" implementation, but also the slowest,
  * and not robust, in the sense that it depends on the order of object keys.
  */
-function _jsonEquals(a, b) {
+export function _jsonEquals(a, b) {
     return JSON.stringify(a) === JSON.stringify(b);
 }

package/dist/object/map2.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Map2 = void 0;
 /**
  * Like Map, but serializes to JSON as an object.
  *
@@ -8,7 +5,7 @@ exports.Map2 = void 0;
  *
  * @experimental
  */
-class Map2 extends Map {
+export class Map2 extends Map {
     /**
      * Convenience way to create Map2 from object.
      */
@@ -22,4 +19,3 @@ class Map2 extends Map {
         return Object.fromEntries(this);
     }
 }
-exports.Map2 = Map2;

package/dist/object/object.util.d.ts

@@ -1,5 +1,5 @@
-import type { AnyObject, KeyValueTuple, ObjectMapper, ObjectPredicate, Reviver, ValueOf } from '../types';
-import { SKIP } from '../types';
+import type { AnyObject, KeyValueTuple, ObjectMapper, ObjectPredicate, Reviver, ValueOf } from '../types.js';
+import { SKIP } from '../types.js';
 /**
  * Returns clone of `obj` with only `props` preserved.
  * Opposite of Omit.

package/dist/object/object.util.js

@@ -1,40 +1,10 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports._pick = _pick;
-exports._pickWithUndefined = _pickWithUndefined;
-exports._omit = _omit;
-exports._omitWithUndefined = _omitWithUndefined;
-exports._mask = _mask;
-exports._filterFalsyValues = _filterFalsyValues;
-exports._filterNullishValues = _filterNullishValues;
-exports._filterUndefinedValues = _filterUndefinedValues;
-exports._filterEmptyArrays = _filterEmptyArrays;
-exports._filterObject = _filterObject;
-exports._mapValues = _mapValues;
-exports._mapKeys = _mapKeys;
-exports._mapObject = _mapObject;
-exports._findKeyByValue = _findKeyByValue;
-exports._objectNullValuesToUndefined = _objectNullValuesToUndefined;
-exports._deepCopy = _deepCopy;
-exports._undefinedIfEmpty = _undefinedIfEmpty;
-exports._filterEmptyValues = _filterEmptyValues;
-exports._merge = _merge;
-exports._deepTrim = _deepTrim;
-exports._unset = _unset;
-exports._invert = _invert;
-exports._invertMap = _invertMap;
-exports._get = _get;
-exports._set = _set;
-exports._has = _has;
-exports._deepFreeze = _deepFreeze;
-exports._objectAssignExact = _objectAssignExact;
-const is_util_1 = require("../is.util");
-const types_1 = require("../types");
+import { _isEmpty, _isObject } from '../is.util.js';
+import { _objectEntries, SKIP } from '../types.js';
 /**
  * Returns clone of `obj` with only `props` preserved.
  * Opposite of Omit.
  */
-function _pick(obj, props, mutate = false) {
+export function _pick(obj, props, mutate = false) {
     if (mutate) {
         // Start as original object (mutable), DELETE properties that are not whitelisted
         for (const k of Object.keys(obj)) {
@@ -55,7 +25,7 @@ function _pick(obj, props, mutate = false) {
  * Sets all properties of an object except passed ones to `undefined`.
  * This is a more performant alternative to `_pick` that does picking/deleting.
  */
-function _pickWithUndefined(obj, props, mutate = false) {
+export function _pickWithUndefined(obj, props, mutate = false) {
     const r = mutate ? obj : { ...obj };
     for (const k of Object.keys(r)) {
         if (!props.includes(k)) {
@@ -68,7 +38,7 @@ function _pickWithUndefined(obj, props, mutate = false) {
  * Returns clone of `obj` with `props` omitted.
  * Opposite of Pick.
  */
-function _omit(obj, props, mutate = false) {
+export function _omit(obj, props, mutate = false) {
     if (mutate) {
         for (const k of props) {
             delete obj[k];
@@ -86,7 +56,7 @@ function _omit(obj, props, mutate = false) {
  * Sets all passed properties of an object to `undefined`.
  * This is a more performant alternative to `_omit` that does picking/deleting.
  */
-function _omitWithUndefined(obj, props, mutate = false) {
+export function _omitWithUndefined(obj, props, mutate = false) {
     const r = mutate ? obj : { ...obj };
     for (const k of props) {
         r[k] = undefined;
@@ -101,7 +71,7 @@ function _omitWithUndefined(obj, props, mutate = false) {
  *  'account.updated',
  * ])
  */
-function _mask(obj, props, mutate = false) {
+export function _mask(obj, props, mutate = false) {
     const r = mutate ? obj : _deepCopy(obj);
     for (const k of props) {
         _unset(r, k);
@@ -111,32 +81,32 @@ function _mask(obj, props, mutate = false) {
 /**
  * Removes "falsy" values from the object.
  */
-function _filterFalsyValues(obj, mutate = false) {
+export function _filterFalsyValues(obj, mutate = false) {
     return _filterObject(obj, (_k, v) => !!v, mutate);
 }
 /**
  * Removes values from the object that are `null` or `undefined`.
  */
-function _filterNullishValues(obj, mutate = false) {
+export function _filterNullishValues(obj, mutate = false) {
     return _filterObject(obj, (_k, v) => v !== undefined && v !== null, mutate);
 }
 /**
  * Removes values from the object that are `undefined`.
  * Only `undefined` values are removed. `null` values are kept!
  */
-function _filterUndefinedValues(obj, mutate = false) {
+export function _filterUndefinedValues(obj, mutate = false) {
     return _filterObject(obj, (_k, v) => v !== undefined, mutate);
 }
-function _filterEmptyArrays(obj, mutate = false) {
+export function _filterEmptyArrays(obj, mutate = false) {
     return _filterObject(obj, (_k, v) => !Array.isArray(v) || v.length > 0, mutate);
 }
 /**
  * Returns clone of `obj` without properties that does not pass `predicate`.
  * Allows filtering by both key and value.
  */
-function _filterObject(obj, predicate, mutate = false) {
+export function _filterObject(obj, predicate, mutate = false) {
     if (mutate) {
-        for (const [k, v] of (0, types_1._objectEntries)(obj)) {
+        for (const [k, v] of _objectEntries(obj)) {
             if (!predicate(k, v, obj)) {
                 delete obj[k];
             }
@@ -144,7 +114,7 @@ function _filterObject(obj, predicate, mutate = false) {
         return obj;
     }
     const r = {};
-    for (const [k, v] of (0, types_1._objectEntries)(obj)) {
+    for (const [k, v] of _objectEntries(obj)) {
         if (predicate(k, v, obj)) {
             r[k] = v;
         }
@@ -162,7 +132,7 @@ function _filterObject(obj, predicate, mutate = false) {
  *
  * To skip some key-value pairs - use _mapObject instead.
  */
-function _mapValues(obj, mapper, mutate = false) {
+export function _mapValues(obj, mapper, mutate = false) {
     const map = mutate ? obj : {};
     for (const [k, v] of Object.entries(obj)) {
         map[k] = mapper(k, v, obj);
@@ -177,7 +147,7 @@ function _mapValues(obj, mapper, mutate = false) {
  *
  * To skip some key-value pairs - use _mapObject instead.
  */
-function _mapKeys(obj, mapper) {
+export function _mapKeys(obj, mapper) {
     const map = {};
     for (const [k, v] of Object.entries(obj)) {
         map[mapper(k, v, obj)] = v;
@@ -200,40 +170,40 @@ function _mapKeys(obj, mapper) {
  *
  * Non-string keys are passed via String(...)
  */
-function _mapObject(obj, mapper) {
+export function _mapObject(obj, mapper) {
     const map = {};
     for (const [k, v] of Object.entries(obj)) {
         const r = mapper(k, v, obj);
-        if (r === types_1.SKIP)
+        if (r === SKIP)
             continue;
         map[r[0]] = r[1];
     }
     return map;
 }
-function _findKeyByValue(obj, v) {
+export function _findKeyByValue(obj, v) {
     return Object.entries(obj).find(([_, value]) => value === v)?.[0];
 }
-function _objectNullValuesToUndefined(obj, mutate = false) {
+export function _objectNullValuesToUndefined(obj, mutate = false) {
     return _mapValues(obj, (_k, v) => (v === null ? undefined : v), mutate);
 }
 /**
  * Deep copy object (by json parse/stringify, since it has unbeatable performance+simplicity combo).
  */
-function _deepCopy(o, reviver) {
+export function _deepCopy(o, reviver) {
     return JSON.parse(JSON.stringify(o), reviver);
 }
 /**
  * Returns `undefined` if it's empty (according to `_isEmpty()` specification),
  * otherwise returns the original object.
  */
-function _undefinedIfEmpty(obj) {
-    return (0, is_util_1._isEmpty)(obj) ? undefined : obj;
+export function _undefinedIfEmpty(obj) {
+    return _isEmpty(obj) ? undefined : obj;
 }
 /**
  * Filters the object by removing all key-value pairs where Value is Empty (according to _isEmpty() specification).
  */
-function _filterEmptyValues(obj, mutate = false) {
-    return _filterObject(obj, (_k, v) => !(0, is_util_1._isEmpty)(v), mutate);
+export function _filterEmptyValues(obj, mutate = false) {
+    return _filterObject(obj, (_k, v) => !_isEmpty(v), mutate);
 }
 /**
  * Recursively merges own and inherited enumerable properties of source
@@ -266,12 +236,12 @@ function _filterEmptyValues(obj, mutate = false) {
  *
  * Based on: https://gist.github.com/Salakar/1d7137de9cb8b704e48a
  */
-function _merge(target, ...sources) {
+export function _merge(target, ...sources) {
     sources.forEach(source => {
-        if (!(0, is_util_1._isObject)(source))
+        if (!_isObject(source))
             return;
         Object.keys(source).forEach(key => {
-            if ((0, is_util_1._isObject)(source[key])) {
+            if (_isObject(source[key])) {
                 ;
                 target[key] ||= {};
                 _merge(target[key], source[key]);
@@ -289,7 +259,7 @@ function _merge(target, ...sources) {
  * Doesn't touch object KEYS.
  * Mutates.
  */
-function _deepTrim(o) {
+export function _deepTrim(o) {
     if (!o)
         return o;
     if (typeof o === 'string') {
@@ -304,8 +274,8 @@ function _deepTrim(o) {
 }
 // from: https://github.com/jonschlinkert/unset-value
 // mutates obj
-function _unset(obj, prop) {
-    if (!(0, is_util_1._isObject)(obj)) {
+export function _unset(obj, prop) {
+    if (!_isObject(obj)) {
         return;
     }
     if (obj.hasOwnProperty(prop)) {
@@ -317,22 +287,22 @@ function _unset(obj, prop) {
     while (segs.length && segs[segs.length - 1].endsWith('\\')) {
         last = segs.pop().slice(0, -1) + '.' + last;
     }
-    while (segs.length && (0, is_util_1._isObject)(obj)) {
+    while (segs.length && _isObject(obj)) {
         const k = segs.shift();
         obj = obj[k];
     }
-    if (!(0, is_util_1._isObject)(obj))
+    if (!_isObject(obj))
         return;
     delete obj[last];
 }
-function _invert(o) {
+export function _invert(o) {
     const inv = {};
     Object.keys(o).forEach(k => {
         inv[o[k]] = k;
     });
     return inv;
 }
-function _invertMap(m) {
+export function _invertMap(m) {
     const inv = new Map();
     m.forEach((v, k) => inv.set(v, k));
     return inv;
@@ -347,7 +317,7 @@ function _invertMap(m) {
  * _get(obj, 'c[cc]') // 'cc'
  * _get(obj, 'unknown.path') // undefined
  */
-function _get(obj = {}, path = '') {
+export function _get(obj = {}, path = '') {
     return (path
         .replaceAll(/\[([^\]]+)]/g, '.$1')
         .split('.')
@@ -365,7 +335,7 @@ function _get(obj = {}, path = '') {
  *
  * Based on: https://stackoverflow.com/a/54733755/4919972
  */
-function _set(obj, path, value) {
+export function _set(obj, path, value) {
     // biome-ignore lint/style/useConsistentBuiltinInstantiation: ok
     if (!obj || Object(obj) !== obj || !path)
         return obj; // When obj is not an object
@@ -416,7 +386,7 @@ function _set(obj, path, value) {
  * _.has(other, 'a');
  * // => false
  */
-function _has(obj, path) {
+export function _has(obj, path) {
     const v = _get(obj, path);
     return v !== undefined && v !== null;
 }
@@ -425,7 +395,7 @@ function _has(obj, path) {
  *
  * Based on: https://github.com/substack/deep-freeze/blob/master/index.js
  */
-function _deepFreeze(o) {
+export function _deepFreeze(o) {
     Object.freeze(o);
     Object.getOwnPropertyNames(o).forEach(prop => {
         if (o.hasOwnProperty(prop) &&
@@ -453,7 +423,7 @@ function _deepFreeze(o) {
  *
  * To make mutation extra clear - function returns void (unlike Object.assign).
  */
-function _objectAssignExact(target, source) {
+export function _objectAssignExact(target, source) {
     Object.assign(target, source);
     for (const k of Object.keys(target)) {
         if (!(k in source)) {

package/dist/object/set2.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Set2 = void 0;
 /**
  * Like Set, but serializes to JSON as an array.
  *
@@ -8,7 +5,7 @@ exports.Set2 = void 0;
  *
  * @experimental
  */
-class Set2 extends Set {
+export class Set2 extends Set {
     toArray() {
         return [...this];
     }
@@ -16,4 +13,3 @@ class Set2 extends Set {
         return [...this];
     }
 }
-exports.Set2 = Set2;

package/dist/object/sortObject.d.ts

@@ -1,4 +1,4 @@
-import type { AnyObject } from '../index';
+import type { AnyObject } from '../index.js';
 /**
  * Returns new object with keys sorder in the given order.
  * All keys that are not listed in `keyOrder` go last.

package/dist/object/sortObject.js

@@ -1,12 +1,9 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports._sortObject = _sortObject;
 /**
  * Returns new object with keys sorder in the given order.
  * All keys that are not listed in `keyOrder` go last.
  * Does not mutate original object.
  */
-function _sortObject(obj, keyOrder) {
+export function _sortObject(obj, keyOrder) {
     const r = {};
     // First, go over ordered keys
     for (const k of keyOrder) {

package/dist/object/sortObjectDeep.js

@@ -1,10 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports._sortObjectDeep = _sortObjectDeep;
 /**
  * based on: https://github.com/IndigoUnited/js-deep-sort-object
  */
-function _sortObjectDeep(o) {
+export function _sortObjectDeep(o) {
     // array
     if (Array.isArray(o)) {
         return o.map(_sortObjectDeep);

package/dist/polyfill.js

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.polyfillDispose = polyfillDispose;
-function polyfillDispose() {
+export function polyfillDispose() {
     // @ts-expect-error polyfill
     Symbol.dispose ??= Symbol('Symbol.dispose');
     // @ts-expect-error polyfill

package/dist/promise/abortable.d.ts

@@ -1,4 +1,4 @@
-import type { AnyFunction } from '../types';
+import type { AnyFunction } from '../types.js';
 /**
  * Similar to AbortController and AbortSignal.
  * Similar to pDefer and Promise.

package/dist/promise/abortable.js

@@ -1,7 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Abortable = void 0;
-exports.abortable = abortable;
 /**
  * Similar to AbortController and AbortSignal.
  * Similar to pDefer and Promise.
@@ -13,7 +9,7 @@ exports.abortable = abortable;
  *
  * @experimental
  */
-class Abortable {
+export class Abortable {
     onAbort;
     constructor(onAbort) {
         this.onAbort = onAbort;
@@ -30,8 +26,7 @@ class Abortable {
         this.onAbort = undefined;
     }
 }
-exports.Abortable = Abortable;
 // convenience function
-function abortable(onAbort) {
+export function abortable(onAbort) {
     return new Abortable(onAbort);
 }

package/dist/promise/pDefer.js

@@ -1,11 +1,8 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pDefer = pDefer;
 /* eslint-disable @typescript-eslint/promise-function-async */
 /**
  * Returns DeferredPromise - a Promise that has .resolve() and .reject() methods.
  */
-function pDefer() {
+export function pDefer() {
     let resolve;
     let reject;
     const promise = new Promise((_resolve, _reject) => {

package/dist/promise/pDelay.d.ts

@@ -1,5 +1,5 @@
-import type { NumberOfMilliseconds, PromisableFunction } from '../types';
-import type { DeferredPromise } from './pDefer';
+import type { NumberOfMilliseconds, PromisableFunction } from '../types.js';
+import type { DeferredPromise } from './pDefer.js';
 /**
  * Promisified version of setTimeout.
  *

package/dist/promise/pDelay.js

@@ -1,15 +1,11 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pDelay = pDelay;
-exports.pDelayFn = pDelayFn;
-const pDefer_1 = require("./pDefer");
+import { pDefer } from './pDefer.js';
 /**
  * Promisified version of setTimeout.
  *
  * Can return a value.
  * If value is instanceof Error - rejects the Promise instead of resolving.
  */
-async function pDelay(ms = 0, value) {
+export async function pDelay(ms = 0, value) {
     return await new Promise((resolve, reject) => setTimeout(value instanceof Error ? reject : resolve, ms, value));
 }
 /* eslint-disable @typescript-eslint/promise-function-async */
@@ -22,8 +18,8 @@ async function pDelay(ms = 0, value) {
  *
  * On abort() - clears the Timeout and immediately resolves the Promise with void.
  */
-function pDelayFn(ms, fn) {
-    const p = (0, pDefer_1.pDefer)();
+export function pDelayFn(ms, fn) {
+    const p = pDefer();
     const timer = setTimeout(async () => {
         try {
             p.resolve(await fn());

package/dist/promise/pFilter.d.ts

@@ -1,2 +1,2 @@
-import type { AsyncPredicate } from '../types';
+import type { AsyncPredicate } from '../types.js';
 export declare function pFilter<T>(iterable: Iterable<T>, filterFn: AsyncPredicate<T>): Promise<T[]>;

package/dist/promise/pFilter.js

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pFilter = pFilter;
-async function pFilter(iterable, filterFn) {
+export async function pFilter(iterable, filterFn) {
     const items = [...iterable];
     const predicates = await Promise.all(items.map((item, i) => filterFn(item, i)));
     return items.filter((_item, i) => predicates[i]);

package/dist/promise/pHang.js

@@ -1,9 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.pHang = pHang;
 /**
  * Returns Promise that never resolves ("hanging").
  */
-async function pHang() {
+export async function pHang() {
     return await new Promise(() => void 0);
 }

package/dist/promise/pMap.d.ts

@@ -1,5 +1,5 @@
-import type { AbortableAsyncMapper, CommonLogger } from '..';
-import { ErrorMode } from '..';
+import type { AbortableAsyncMapper, CommonLogger } from '../index.js';
+import { ErrorMode } from '../index.js';
 export interface PMapOptions {
     /**
      * Number of concurrently pending promises returned by `mapper`.