foreslash 0.2.2 → 0.2.4

package/CHANGELOG.md

@@ -1,5 +1,31 @@
 # Change Log
 
+## Version 0.2.4 - 2025-0
+
+Unstable version
+
+- Feat 🥥 Functions added: `retry` `parallel`
+- Other fixes and improvements
+
+不稳定版本
+
+- 功能 🥥 添加函数: `retry` `parallel`
+- 其他修复与优化
+
+## Version 0.2.3 - 2025-03-28
+
+Unstable version
+
+- Feat 🥥 Functions added: `defer`
+- Fix 🥕 Bug fixed: `debounce` doesn't apply the last callee's arguments
+- Other fixes and improvements
+
+不稳定版本
+
+- 功能 🥥 添加函数: `defer`
+- 修复 🥕 缺陷修复: `debounce` 没有传入最后一次获取的参数
+- 其他修复与优化
+
 ## Version 0.2.2 - 2025-03-18
 
 Unstable version

package/lib/index.cmn.cjs

@@ -67,11 +67,37 @@ function remove(arr, ...item) {
     return res;
 }
 
-function sleep(time = 1000) {
-    return new Promise((res) => {
-        setTimeout(res, time);
-    });
-}
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+/* global Reflect, Promise, SuppressedError, Symbol, Iterator */
+
+
+function __awaiter(thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+}
+
+typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+    var e = new Error(message);
+    return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+};
 
 const isArray = Array.isArray;
 
@@ -171,7 +197,7 @@ function isNumber(value) {
 }
 
 function isPrimitive(value) {
-    return value == null || (typeof value !== 'object' && typeof value !== 'function');
+    return value === undefined || value === null || (typeof value !== 'object' && typeof value !== 'function');
 }
 
 function isPromise(value) {
@@ -292,17 +318,37 @@ function tryit(fn) {
     };
 }
 
-const noop = function noop() { };
-
-function withResolvers(PromiseLike = Promise) {
-    let promise;
-    let resolve = noop;
-    let reject = noop;
-    promise = new PromiseLike((res, rej) => {
-        resolve = res;
-        reject = rej;
+function defer(asyncFunction, options) {
+    return __awaiter(this, void 0, void 0, function* () {
+        const queue = [];
+        const { rethrow = false } = options || {};
+        const defaultOption = { rethrow };
+        const cleanUp = (fn, options) => {
+            queue.push({ fn, opt: Object.assign(defaultOption, options) });
+            return queue.length - 1;
+        };
+        const cancelCleanUp = (fnOrIndex) => {
+            if (isInteger(fnOrIndex) && fnOrIndex > -1)
+                queue[fnOrIndex] = null;
+            else if (isFunction(fnOrIndex)) {
+                const i = queue.findIndex((item) => item && item.fn === fnOrIndex);
+                if (i > -1)
+                    queue[i] = null;
+            }
+        };
+        const [err, res] = yield tryit(asyncFunction)(cleanUp, cancelCleanUp);
+        for (const item of queue) {
+            if (!item)
+                continue;
+            const { fn, opt } = item;
+            const [cleanUpErr] = yield tryit(fn)(err);
+            if (cleanUpErr && opt.rethrow)
+                throw cleanUpErr;
+        }
+        if (err)
+            throw err;
+        return res;
     });
-    return { promise, resolve, reject };
 }
 
 function clamp(num, min, max, options) {
@@ -322,6 +368,96 @@ function clamp(num, min, max, options) {
     return num < min ? defaultMin : num > max ? defaultMax : num;
 }
 
+function parallel(args, fn, options) {
+    return __awaiter(this, void 0, void 0, function* () {
+        if (!args.length)
+            return [];
+        const { limit: _limit = 5 } = options || {};
+        const limit = clamp(Math.floor(_limit), 1, 100);
+        let current = 0;
+        const results = [];
+        const errors = [];
+        const asyncFn = tryit(fn);
+        const processor = () => __awaiter(this, void 0, void 0, function* () {
+            while (current < args.length) {
+                const index = current++;
+                const [err, result] = yield asyncFn(args[index]);
+                if (err)
+                    errors.push({ index, error: err });
+                else
+                    results[index] = result;
+            }
+        });
+        const tasks = [];
+        for (let i = 0; i < Math.min(args.length, limit); i++) {
+            tasks.push(processor());
+        }
+        yield Promise.all(tasks);
+        if (errors.length) {
+            throw new Error(`Parallel execution failed on index: ${errors.map((e) => e.index).join(', ')}`, { cause: errors });
+        }
+        return results;
+    });
+}
+
+function sleep(time = 1000) {
+    return new Promise((res) => {
+        setTimeout(res, time);
+    });
+}
+
+function retry(asyncFunction, option) {
+    return __awaiter(this, void 0, void 0, function* () {
+        let retryCounts = 0;
+        const times = isNumber(option === null || option === void 0 ? void 0 : option.times) ? option.times : 3;
+        const delay = isFunction(option === null || option === void 0 ? void 0 : option.delay)
+            ? option.delay
+            : isNumber(option === null || option === void 0 ? void 0 : option.delay)
+                ? () => option.delay
+                : null;
+        const gap = isFunction(option === null || option === void 0 ? void 0 : option.gap) ? option.gap : isNumber(option === null || option === void 0 ? void 0 : option.gap) ? () => option.gap : null;
+        let lastRunTime = 0;
+        const getDelayTime = !option || (!delay && !gap)
+            ? () => 0
+            : gap
+                ? (retryCounts) => {
+                    const time = gap(retryCounts);
+                    return time - Date.now() + lastRunTime;
+                }
+                : delay;
+        while (1) {
+            lastRunTime = Date.now();
+            const [err, res] = yield tryit(asyncFunction)((err) => {
+                throw { $$exit_retry: err };
+            });
+            if (!err)
+                return res;
+            retryCounts++;
+            if (err && err.$$exit_retry)
+                throw err.$$exit_retry;
+            if (retryCounts >= times)
+                throw err;
+            const delayTime = getDelayTime(retryCounts);
+            if (delayTime > 0)
+                yield sleep(delayTime);
+        }
+        throw new Error('retry failed');
+    });
+}
+
+const noop = function noop() { };
+
+function withResolvers(PromiseLike = Promise) {
+    let promise;
+    let resolve = noop;
+    let reject = noop;
+    promise = new PromiseLike((res, rej) => {
+        resolve = res;
+        reject = rej;
+    });
+    return { promise, resolve, reject };
+}
+
 const mimeMap = {
     application: {
         acrobat: ['pdf'],
@@ -1321,9 +1457,10 @@ function _curryMore(fn) {
 }
 
 function _throttle(fn, delay, options) {
-    var _a, _b;
+    var _a, _b, _c;
     const trailing = (_a = options === null || options === void 0 ? void 0 : options.trailing) !== null && _a !== void 0 ? _a : false;
-    const leading = (_b = options === null || options === void 0 ? void 0 : options.leading) !== null && _b !== void 0 ? _b : true;
+    const trailingRunLast = (_b = options === null || options === void 0 ? void 0 : options.trailingRunLast) !== null && _b !== void 0 ? _b : true;
+    const leading = (_c = options === null || options === void 0 ? void 0 : options.leading) !== null && _c !== void 0 ? _c : true;
     let timer = null;
     let lastTime = 0;
     const clearTimer = () => {
@@ -1343,6 +1480,9 @@ function _throttle(fn, delay, options) {
             lastTime = now;
             clearTimer();
         }
+        if (timeGap < 0 && trailing && trailingRunLast && timer) {
+            clearTimer();
+        }
         if (timeGap >= 0 && leading) {
             fn.apply(this, args);
         }
@@ -1360,7 +1500,7 @@ function debounce(fn, delay, options) {
     if (!isNumber(delay) || !isFinite(delay) || delay <= 0) {
         throw new Error('Invalid delay parameter');
     }
-    return _throttle(fn, delay, Object.assign({ trailing: true, leading: false }, options));
+    return _throttle(fn, delay, Object.assign({ trailing: true, leading: false, trailingRunLast: true }, options));
 }
 
 function _cloneArray(obj, map, cloner, ...args) {
@@ -1648,6 +1788,7 @@ exports.compose = compose;
 exports.curry = _curryMore;
 exports.debounce = debounce;
 exports.deepClone = deepClone;
+exports.defer = defer;
 exports.fastClone = fastClone;
 exports.getAcceptableExtByMIME = getAcceptableExtByMIME;
 exports.getAcceptableMIMEByExt = getAcceptableMIMEByExt;
@@ -1705,6 +1846,7 @@ exports.kebabCase = kebabCase;
 exports.memo = memo;
 exports.noop = noop;
 exports.not = not;
+exports.parallel = parallel;
 exports.pascalCase = pascalCase;
 exports.pass = pass;
 exports.passWith = passWith;
@@ -1717,6 +1859,7 @@ exports.randomIntFloor = randomIntFloor;
 exports.randomString = randomString;
 exports.range = range;
 exports.remove = remove;
+exports.retry = retry;
 exports.shuffle = shuffle;
 exports.sleep = sleep;
 exports.snakeCase = snakeCase;

package/lib/index.d.ts

@@ -77,6 +77,109 @@ declare function range<T = number>(start: number, end: number, options?: RangeOp
  */
 declare function remove<T>(arr: ArrayLike<T>, ...item: (T | ((val: T) => unknown))[]): T[];
 
+type DeferCallbackFunction = (error?: Error) => unknown;
+type DeferOption = {
+    rethrow: boolean;
+};
+/**
+ * 在传入的函数执行完毕后(或是抛出异常后), 执行*延迟操作*\
+ * 使用场景一般是处理“副作用”, 类似 `try {} finally {}` 结构但是更加灵活
+ * - 执行*延迟操作*的时机是函数执行完毕后(或是抛出异常后), 同时 `defer` 返回的 `Promise` 并未结束
+ *   - 这个设计是防止*延迟操作*与后续逻辑产生干扰
+ * - `defer` 返回的 `Promise` 会根据传入的函数是否正常处理/抛出异常而变化
+ *   - 传入的函数正常处理, 结果为 `1`, 那么 `defer` 将返回 `Promise {<fulfilled>: 1}`
+ *   - 传入的函数抛出异常, 内容为 `2`, 那么 `defer` 将返回 `Promise {<rejected>: 2}`
+ *
+ * *延迟操作*时抛出的错误不会正常抛出
+ * - 如果希望执行*延迟操作*时正常抛错, 您可以配置 `options.rethrow = true`
+ * @param asyncFunction 需要在执行完毕后做额外处理函数
+ * @param options.rethrow 执行*延迟操作*时是否正常抛错, 默认不抛错
+ * @returns 一个 `Promise` 会根据传入的函数是否正常处理/抛出异常而变化
+ * @example
+ * ```js
+ * // 一般用途
+ * defer((cleanUp) => {
+ *   cleanUp(() => console.log(2))
+ *   cleanUp(() => console.log(3))
+ *   console.log(1)
+ * }) // 依次输出 1 2 3
+ * // 可以动态取消计划好的延迟操作
+ * defer((cleanUp, cancelCleanUp) => {
+ *   const cleanUpId = cleanUp(() => console.log(123)) // 会返回一个数字作为 id
+ *   cleanUp(() => console.log(5))
+ *   cleanUp(() => console.log(6))
+ *   console.log(4)
+ *   cancelCleanUp(cleanUpId) // 可以用于取消指定的延迟操作
+ * }) // 依次输出 4 5 6
+ * ```
+ * @version 0.2.3
+ */
+declare function defer<T>(asyncFunction: (cleanUp: (fn: DeferCallbackFunction) => number, cancelCleanUp: (fnOrIndex: DeferCallbackFunction | number) => void) => T | Promise<T>, options?: Partial<DeferOption>): Promise<T>;
+
+/**
+ * 并发执行函数, 可以控制并发数
+ * @param args 要经由 `fn` 处理的数据
+ * @param fn 处理函数, 可以是异步函数
+ * @param options 配置项, 目前仅支持 `limit` 限制并发数, 默认为 `5`
+ * @returns 一个 `Promise`, 当所有数据都处理完成后, 会返回一个包含所有结果的数组\
+ * 如果有错误, 则会抛出一个 `Error` 对象, `Error.cause` 中包含所有错误信息(如果环境支持的话)
+ * @example
+ * ```js
+ * const fn = async (n) => { return n * 2 }
+ * parallel([1, 2, 3, 4, 5], fn, { limit: 2 }) // Promise<[2, 4, 6, 8, 10]>
+ * ```
+ * @since 0.2.4
+ */
+declare function parallel<Args, Res>(args: Args[], fn: (arg: Args) => Promise<Res>, options?: {
+    limit?: number;
+}): Promise<Res[]>;
+
+type RetryFunction<T> = (() => T | Promise<T>) | ((exitCallback: (err: any) => never) => T | Promise<T>);
+type RetryOption = {
+    times?: number;
+    delay?: number | ((retryCounts: number) => number);
+    gap?: number | ((retryCounts: number) => number);
+};
+/**
+ * 在传入的函数发生异常后重试\
+ * 使用场景一般是重试网络请求等情况
+ * - 可以设置两次重试之间的延迟(delay), 默认为无延迟
+ * - 也可以设置为两次重试之间的时间间隔(gap), 与延迟模式的区别见下文
+ * - 传入的函数接受一个 `exit` 回调函数, 调用这个回调函数会立即退出重试逻辑
+ *
+ * 延迟模式(delay)
+ * ``` text
+ * delay = 1000:
+ * |0s                  |1s                  |2s                  |3s
+ * |[400ms-]            |        [800ms------|---]                |    [第 3 次调用]
+ *         ^ 1000ms ++++|+++++++ ^               ^ 1000ms ++++++++|+++ ^
+ * ```
+ *
+ * 间隔模式(gap)
+ * ``` text
+ * gap = 1000:
+ * |0s                  |1s                  |2s
+ * |[400ms-]            |[800ms---------]    |[第 3 次调用]
+ * ^ 1000ms +++++++++++ ^ 1000ms +++++++++++ ^
+ * ```
+ *
+ * @param asyncFunction 需要处理的函数, 推荐是异步函数, 也可以是同步函数
+ * @param option 重试相关的配置, 具体配置见下
+ * @example
+ * ```js
+ * // 基本用法, 默认重试 3 次, 每次失败后会立即重新调用
+ * const res = await retry(() => fetch(url, params))
+ * // 重试 10 次
+ * const res = await retry(() => fetch(url, params), { times: 10 })
+ * // 延迟模式, 每次失败后会等待 1 秒再重新调用
+ * const res = await retry(() => fetch(url, params), { delay: 1000 })
+ * // 间隔模式, 每次失败后会在下 1 秒再重新调用
+ * const res = await retry(() => fetch(url, params), { gap: 1000 })
+ * ```
+ * @version 0.2.4
+ */
+declare function retry<T>(asyncFunction: RetryFunction<T>, option?: RetryOption): Promise<T>;
+
 /**
  * 延迟一定时间
  * @param time 延迟时间, 单位为毫秒(ms), 默认为 `1000` (即 1 秒)
@@ -729,7 +832,7 @@ declare function isWrapperBigInt(value: unknown): value is BigInt;
  * @param options 配置项, 可以配置默认值等
  * - `default` 默认值, 如果初始值不在范围内, 则返回默认值
  * - `defaultMin` 初始值小于最小值时返回该值, 覆盖 `default` 参数
- * - `defaultMax` 初始值大于最大值时返回该值
+ * - `defaultMax` 初始值大于最大值时返回该值, 覆盖 `default` 参数
  * @returns 返回一个在指定范围内的数字
  * @example
  * ```js
@@ -740,6 +843,7 @@ declare function isWrapperBigInt(value: unknown): value is BigInt;
  * clamp(15, 0, 10, { default: 6 }) // 6
  * clamp(-5, 0, 10, { default: 6 }) // 6
  * ```
+ * @version 0.2.2
  */
 declare function clamp(num: number, min: number, max: number, options?: {
     default?: number;
@@ -1320,6 +1424,8 @@ declare function _curryMore<Args extends Array<any>, Res>(fn: (...args: Args) =>
 interface ThrottleOptions {
     /** 节流时触发的最后一次调用是否执行, 默认为否 */
     trailing?: boolean;
+    /** 触发的最后一次调用是否使用最后一次的参数, 默认为是 */
+    trailingRunLast?: boolean;
     /** 第一次触发是否直接执行, 默认为是 */
     leading?: boolean;
 }
@@ -1386,7 +1492,7 @@ declare function deepClone<T>(obj: T, options?: Partial<CloneOptions>, map?: Map
 
 /**
  * 快速深拷贝
- * - 相对 `deepClone` 而言运行更快, 功能较为齐全
+ * - 功能较为齐全, 相对 `deepClone` 而言运行更快
  * - 支持处理的情况：循环引用、数组、`Date`、正则、`Set`、`Map`、`FormData`
  * - 对象上以 `Symbol` 为键的属性无法拷贝
  * - 无法拷贝的内容将视为原生数据类型, 直接复制(如函数、`Promise`、`WeakMap`、`WeakSet`)
@@ -1631,4 +1737,4 @@ declare function throttle<T extends any[]>(fn: (...args: T) => any, delay: numbe
     reset: () => void;
 };
 
-export { type CloneOptions, type CustomCloner, type RangeOptions, type TypedArray, _, acceptableFileName, acceptableFileType, camelCase, caseCamel, caseConvert, caseKebab, casePascal, caseSnake, clamp, compose, _curryMore as curry, debounce, deepClone, fastClone, getAcceptableExtByMIME, getAcceptableMIMEByExt, getGlobalThis, getTag, isArray, isArrayBuffer, isArrayLike, isBigInt, isBigInt64Array, isBigUint64Array, isBoolean, isBuffer, isDataView, isDate, isEmpty, isFile, isFloat32Array, isFloat64Array, isFormData, isFunction, isInt16Array, isInt32Array, isInt8Array, isInteger, isIterable, isMap, isNil, isNull, isNumber, isObject, isPlaceholder, isPrimitive, isPromise, isPromiseLike, isRegExp, isSet, isString, isSymbol, isTypedArray, isUint16Array, isUint32Array, isUint8Array, isUint8ClampedArray, isUndefined, isWeakMap, isWeakSet, isWrapperBigInt, isWrapperBoolean, isWrapperNumber, isWrapperObject, isWrapperString, isWrapperSymbol, kebabCase, memo, noop, not, pascalCase, pass, passWith, pipe, randomBase32String, randomChoice, randomHexString, randomInt, randomIntFloor, randomString, range, remove, shuffle, sleep, snakeCase, splitWords, throttle, titleCase, tryit, ulid, uuidNil, uuidV4, withResolvers };
+export { type CloneOptions, type CustomCloner, type RangeOptions, type TypedArray, _, acceptableFileName, acceptableFileType, camelCase, caseCamel, caseConvert, caseKebab, casePascal, caseSnake, clamp, compose, _curryMore as curry, debounce, deepClone, defer, fastClone, getAcceptableExtByMIME, getAcceptableMIMEByExt, getGlobalThis, getTag, isArray, isArrayBuffer, isArrayLike, isBigInt, isBigInt64Array, isBigUint64Array, isBoolean, isBuffer, isDataView, isDate, isEmpty, isFile, isFloat32Array, isFloat64Array, isFormData, isFunction, isInt16Array, isInt32Array, isInt8Array, isInteger, isIterable, isMap, isNil, isNull, isNumber, isObject, isPlaceholder, isPrimitive, isPromise, isPromiseLike, isRegExp, isSet, isString, isSymbol, isTypedArray, isUint16Array, isUint32Array, isUint8Array, isUint8ClampedArray, isUndefined, isWeakMap, isWeakSet, isWrapperBigInt, isWrapperBoolean, isWrapperNumber, isWrapperObject, isWrapperString, isWrapperSymbol, kebabCase, memo, noop, not, parallel, pascalCase, pass, passWith, pipe, randomBase32String, randomChoice, randomHexString, randomInt, randomIntFloor, randomString, range, remove, retry, shuffle, sleep, snakeCase, splitWords, throttle, titleCase, tryit, ulid, uuidNil, uuidV4, withResolvers };

package/lib/index.mjs

@@ -65,11 +65,37 @@ function remove(arr, ...item) {
     return res;
 }
 
-function sleep(time = 1000) {
-    return new Promise((res) => {
-        setTimeout(res, time);
-    });
-}
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+/* global Reflect, Promise, SuppressedError, Symbol, Iterator */
+
+
+function __awaiter(thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+}
+
+typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+    var e = new Error(message);
+    return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+};
 
 const isArray = Array.isArray;
 
@@ -169,7 +195,7 @@ function isNumber(value) {
 }
 
 function isPrimitive(value) {
-    return value == null || (typeof value !== 'object' && typeof value !== 'function');
+    return value === undefined || value === null || (typeof value !== 'object' && typeof value !== 'function');
 }
 
 function isPromise(value) {
@@ -290,17 +316,37 @@ function tryit(fn) {
     };
 }
 
-const noop = function noop() { };
-
-function withResolvers(PromiseLike = Promise) {
-    let promise;
-    let resolve = noop;
-    let reject = noop;
-    promise = new PromiseLike((res, rej) => {
-        resolve = res;
-        reject = rej;
+function defer(asyncFunction, options) {
+    return __awaiter(this, void 0, void 0, function* () {
+        const queue = [];
+        const { rethrow = false } = options || {};
+        const defaultOption = { rethrow };
+        const cleanUp = (fn, options) => {
+            queue.push({ fn, opt: Object.assign(defaultOption, options) });
+            return queue.length - 1;
+        };
+        const cancelCleanUp = (fnOrIndex) => {
+            if (isInteger(fnOrIndex) && fnOrIndex > -1)
+                queue[fnOrIndex] = null;
+            else if (isFunction(fnOrIndex)) {
+                const i = queue.findIndex((item) => item && item.fn === fnOrIndex);
+                if (i > -1)
+                    queue[i] = null;
+            }
+        };
+        const [err, res] = yield tryit(asyncFunction)(cleanUp, cancelCleanUp);
+        for (const item of queue) {
+            if (!item)
+                continue;
+            const { fn, opt } = item;
+            const [cleanUpErr] = yield tryit(fn)(err);
+            if (cleanUpErr && opt.rethrow)
+                throw cleanUpErr;
+        }
+        if (err)
+            throw err;
+        return res;
     });
-    return { promise, resolve, reject };
 }
 
 function clamp(num, min, max, options) {
@@ -320,6 +366,96 @@ function clamp(num, min, max, options) {
     return num < min ? defaultMin : num > max ? defaultMax : num;
 }
 
+function parallel(args, fn, options) {
+    return __awaiter(this, void 0, void 0, function* () {
+        if (!args.length)
+            return [];
+        const { limit: _limit = 5 } = options || {};
+        const limit = clamp(Math.floor(_limit), 1, 100);
+        let current = 0;
+        const results = [];
+        const errors = [];
+        const asyncFn = tryit(fn);
+        const processor = () => __awaiter(this, void 0, void 0, function* () {
+            while (current < args.length) {
+                const index = current++;
+                const [err, result] = yield asyncFn(args[index]);
+                if (err)
+                    errors.push({ index, error: err });
+                else
+                    results[index] = result;
+            }
+        });
+        const tasks = [];
+        for (let i = 0; i < Math.min(args.length, limit); i++) {
+            tasks.push(processor());
+        }
+        yield Promise.all(tasks);
+        if (errors.length) {
+            throw new Error(`Parallel execution failed on index: ${errors.map((e) => e.index).join(', ')}`, { cause: errors });
+        }
+        return results;
+    });
+}
+
+function sleep(time = 1000) {
+    return new Promise((res) => {
+        setTimeout(res, time);
+    });
+}
+
+function retry(asyncFunction, option) {
+    return __awaiter(this, void 0, void 0, function* () {
+        let retryCounts = 0;
+        const times = isNumber(option === null || option === void 0 ? void 0 : option.times) ? option.times : 3;
+        const delay = isFunction(option === null || option === void 0 ? void 0 : option.delay)
+            ? option.delay
+            : isNumber(option === null || option === void 0 ? void 0 : option.delay)
+                ? () => option.delay
+                : null;
+        const gap = isFunction(option === null || option === void 0 ? void 0 : option.gap) ? option.gap : isNumber(option === null || option === void 0 ? void 0 : option.gap) ? () => option.gap : null;
+        let lastRunTime = 0;
+        const getDelayTime = !option || (!delay && !gap)
+            ? () => 0
+            : gap
+                ? (retryCounts) => {
+                    const time = gap(retryCounts);
+                    return time - Date.now() + lastRunTime;
+                }
+                : delay;
+        while (1) {
+            lastRunTime = Date.now();
+            const [err, res] = yield tryit(asyncFunction)((err) => {
+                throw { $$exit_retry: err };
+            });
+            if (!err)
+                return res;
+            retryCounts++;
+            if (err && err.$$exit_retry)
+                throw err.$$exit_retry;
+            if (retryCounts >= times)
+                throw err;
+            const delayTime = getDelayTime(retryCounts);
+            if (delayTime > 0)
+                yield sleep(delayTime);
+        }
+        throw new Error('retry failed');
+    });
+}
+
+const noop = function noop() { };
+
+function withResolvers(PromiseLike = Promise) {
+    let promise;
+    let resolve = noop;
+    let reject = noop;
+    promise = new PromiseLike((res, rej) => {
+        resolve = res;
+        reject = rej;
+    });
+    return { promise, resolve, reject };
+}
+
 const mimeMap = {
     application: {
         acrobat: ['pdf'],
@@ -1319,9 +1455,10 @@ function _curryMore(fn) {
 }
 
 function _throttle(fn, delay, options) {
-    var _a, _b;
+    var _a, _b, _c;
     const trailing = (_a = options === null || options === void 0 ? void 0 : options.trailing) !== null && _a !== void 0 ? _a : false;
-    const leading = (_b = options === null || options === void 0 ? void 0 : options.leading) !== null && _b !== void 0 ? _b : true;
+    const trailingRunLast = (_b = options === null || options === void 0 ? void 0 : options.trailingRunLast) !== null && _b !== void 0 ? _b : true;
+    const leading = (_c = options === null || options === void 0 ? void 0 : options.leading) !== null && _c !== void 0 ? _c : true;
     let timer = null;
     let lastTime = 0;
     const clearTimer = () => {
@@ -1341,6 +1478,9 @@ function _throttle(fn, delay, options) {
             lastTime = now;
             clearTimer();
         }
+        if (timeGap < 0 && trailing && trailingRunLast && timer) {
+            clearTimer();
+        }
         if (timeGap >= 0 && leading) {
             fn.apply(this, args);
         }
@@ -1358,7 +1498,7 @@ function debounce(fn, delay, options) {
     if (!isNumber(delay) || !isFinite(delay) || delay <= 0) {
         throw new Error('Invalid delay parameter');
     }
-    return _throttle(fn, delay, Object.assign({ trailing: true, leading: false }, options));
+    return _throttle(fn, delay, Object.assign({ trailing: true, leading: false, trailingRunLast: true }, options));
 }
 
 function _cloneArray(obj, map, cloner, ...args) {
@@ -1632,4 +1772,4 @@ function throttle(fn, delay, options) {
     return _throttle(fn, delay, Object.assign({ trailing: false, leading: true }, options));
 }
 
-export { _, acceptableFileName, acceptableFileType, camelCase, caseCamel, caseConvert, caseKebab, casePascal, caseSnake, clamp, compose, _curryMore as curry, debounce, deepClone, fastClone, getAcceptableExtByMIME, getAcceptableMIMEByExt, getGlobalThis, getTag, isArray, isArrayBuffer, isArrayLike, isBigInt, isBigInt64Array, isBigUint64Array, isBoolean, isBuffer, isDataView, isDate, isEmpty, isFile, isFloat32Array, isFloat64Array, isFormData, isFunction, isInt16Array, isInt32Array, isInt8Array, isInteger, isIterable, isMap, isNil, isNull, isNumber, isObject, isPlaceholder, isPrimitive, isPromise, isPromiseLike, isRegExp, isSet, isString, isSymbol, isTypedArray, isUint16Array, isUint32Array, isUint8Array, isUint8ClampedArray, isUndefined, isWeakMap, isWeakSet, isWrapperBigInt, isWrapperBoolean, isWrapperNumber, isWrapperObject, isWrapperString, isWrapperSymbol, kebabCase, memo, noop, not, pascalCase, pass, passWith, pipe, randomBase32String, randomChoice, randomHexString, randomInt, randomIntFloor, randomString, range, remove, shuffle, sleep, snakeCase, splitWords, throttle, titleCase, tryit, ulid, uuidNil, uuidV4, withResolvers };
+export { _, acceptableFileName, acceptableFileType, camelCase, caseCamel, caseConvert, caseKebab, casePascal, caseSnake, clamp, compose, _curryMore as curry, debounce, deepClone, defer, fastClone, getAcceptableExtByMIME, getAcceptableMIMEByExt, getGlobalThis, getTag, isArray, isArrayBuffer, isArrayLike, isBigInt, isBigInt64Array, isBigUint64Array, isBoolean, isBuffer, isDataView, isDate, isEmpty, isFile, isFloat32Array, isFloat64Array, isFormData, isFunction, isInt16Array, isInt32Array, isInt8Array, isInteger, isIterable, isMap, isNil, isNull, isNumber, isObject, isPlaceholder, isPrimitive, isPromise, isPromiseLike, isRegExp, isSet, isString, isSymbol, isTypedArray, isUint16Array, isUint32Array, isUint8Array, isUint8ClampedArray, isUndefined, isWeakMap, isWeakSet, isWrapperBigInt, isWrapperBoolean, isWrapperNumber, isWrapperObject, isWrapperString, isWrapperSymbol, kebabCase, memo, noop, not, parallel, pascalCase, pass, passWith, pipe, randomBase32String, randomChoice, randomHexString, randomInt, randomIntFloor, randomString, range, remove, retry, shuffle, sleep, snakeCase, splitWords, throttle, titleCase, tryit, ulid, uuidNil, uuidV4, withResolvers };

package/lib/index.umd.js

@@ -71,11 +71,37 @@ See the Mulan PSL v2 for more details.
         return res;
     }
 
-    function sleep(time = 1000) {
-        return new Promise((res) => {
-            setTimeout(res, time);
-        });
-    }
+    /******************************************************************************
+    Copyright (c) Microsoft Corporation.
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+    REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+    AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+    INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+    LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+    OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+    PERFORMANCE OF THIS SOFTWARE.
+    ***************************************************************************** */
+    /* global Reflect, Promise, SuppressedError, Symbol, Iterator */
+
+
+    function __awaiter(thisArg, _arguments, P, generator) {
+        function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+        return new (P || (P = Promise))(function (resolve, reject) {
+            function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+            function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+            function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+            step((generator = generator.apply(thisArg, _arguments || [])).next());
+        });
+    }
+
+    typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+        var e = new Error(message);
+        return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+    };
 
     const isArray = Array.isArray;
 
@@ -175,7 +201,7 @@ See the Mulan PSL v2 for more details.
     }
 
     function isPrimitive(value) {
-        return value == null || (typeof value !== 'object' && typeof value !== 'function');
+        return value === undefined || value === null || (typeof value !== 'object' && typeof value !== 'function');
     }
 
     function isPromise(value) {
@@ -296,17 +322,37 @@ See the Mulan PSL v2 for more details.
         };
     }
 
-    const noop = function noop() { };
-
-    function withResolvers(PromiseLike = Promise) {
-        let promise;
-        let resolve = noop;
-        let reject = noop;
-        promise = new PromiseLike((res, rej) => {
-            resolve = res;
-            reject = rej;
+    function defer(asyncFunction, options) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const queue = [];
+            const { rethrow = false } = options || {};
+            const defaultOption = { rethrow };
+            const cleanUp = (fn, options) => {
+                queue.push({ fn, opt: Object.assign(defaultOption, options) });
+                return queue.length - 1;
+            };
+            const cancelCleanUp = (fnOrIndex) => {
+                if (isInteger(fnOrIndex) && fnOrIndex > -1)
+                    queue[fnOrIndex] = null;
+                else if (isFunction(fnOrIndex)) {
+                    const i = queue.findIndex((item) => item && item.fn === fnOrIndex);
+                    if (i > -1)
+                        queue[i] = null;
+                }
+            };
+            const [err, res] = yield tryit(asyncFunction)(cleanUp, cancelCleanUp);
+            for (const item of queue) {
+                if (!item)
+                    continue;
+                const { fn, opt } = item;
+                const [cleanUpErr] = yield tryit(fn)(err);
+                if (cleanUpErr && opt.rethrow)
+                    throw cleanUpErr;
+            }
+            if (err)
+                throw err;
+            return res;
         });
-        return { promise, resolve, reject };
     }
 
     function clamp(num, min, max, options) {
@@ -326,6 +372,96 @@ See the Mulan PSL v2 for more details.
         return num < min ? defaultMin : num > max ? defaultMax : num;
     }
 
+    function parallel(args, fn, options) {
+        return __awaiter(this, void 0, void 0, function* () {
+            if (!args.length)
+                return [];
+            const { limit: _limit = 5 } = options || {};
+            const limit = clamp(Math.floor(_limit), 1, 100);
+            let current = 0;
+            const results = [];
+            const errors = [];
+            const asyncFn = tryit(fn);
+            const processor = () => __awaiter(this, void 0, void 0, function* () {
+                while (current < args.length) {
+                    const index = current++;
+                    const [err, result] = yield asyncFn(args[index]);
+                    if (err)
+                        errors.push({ index, error: err });
+                    else
+                        results[index] = result;
+                }
+            });
+            const tasks = [];
+            for (let i = 0; i < Math.min(args.length, limit); i++) {
+                tasks.push(processor());
+            }
+            yield Promise.all(tasks);
+            if (errors.length) {
+                throw new Error(`Parallel execution failed on index: ${errors.map((e) => e.index).join(', ')}`, { cause: errors });
+            }
+            return results;
+        });
+    }
+
+    function sleep(time = 1000) {
+        return new Promise((res) => {
+            setTimeout(res, time);
+        });
+    }
+
+    function retry(asyncFunction, option) {
+        return __awaiter(this, void 0, void 0, function* () {
+            let retryCounts = 0;
+            const times = isNumber(option === null || option === void 0 ? void 0 : option.times) ? option.times : 3;
+            const delay = isFunction(option === null || option === void 0 ? void 0 : option.delay)
+                ? option.delay
+                : isNumber(option === null || option === void 0 ? void 0 : option.delay)
+                    ? () => option.delay
+                    : null;
+            const gap = isFunction(option === null || option === void 0 ? void 0 : option.gap) ? option.gap : isNumber(option === null || option === void 0 ? void 0 : option.gap) ? () => option.gap : null;
+            let lastRunTime = 0;
+            const getDelayTime = !option || (!delay && !gap)
+                ? () => 0
+                : gap
+                    ? (retryCounts) => {
+                        const time = gap(retryCounts);
+                        return time - Date.now() + lastRunTime;
+                    }
+                    : delay;
+            while (1) {
+                lastRunTime = Date.now();
+                const [err, res] = yield tryit(asyncFunction)((err) => {
+                    throw { $$exit_retry: err };
+                });
+                if (!err)
+                    return res;
+                retryCounts++;
+                if (err && err.$$exit_retry)
+                    throw err.$$exit_retry;
+                if (retryCounts >= times)
+                    throw err;
+                const delayTime = getDelayTime(retryCounts);
+                if (delayTime > 0)
+                    yield sleep(delayTime);
+            }
+            throw new Error('retry failed');
+        });
+    }
+
+    const noop = function noop() { };
+
+    function withResolvers(PromiseLike = Promise) {
+        let promise;
+        let resolve = noop;
+        let reject = noop;
+        promise = new PromiseLike((res, rej) => {
+            resolve = res;
+            reject = rej;
+        });
+        return { promise, resolve, reject };
+    }
+
     const mimeMap = {
         application: {
             acrobat: ['pdf'],
@@ -1325,9 +1461,10 @@ See the Mulan PSL v2 for more details.
     }
 
     function _throttle(fn, delay, options) {
-        var _a, _b;
+        var _a, _b, _c;
         const trailing = (_a = options === null || options === void 0 ? void 0 : options.trailing) !== null && _a !== void 0 ? _a : false;
-        const leading = (_b = options === null || options === void 0 ? void 0 : options.leading) !== null && _b !== void 0 ? _b : true;
+        const trailingRunLast = (_b = options === null || options === void 0 ? void 0 : options.trailingRunLast) !== null && _b !== void 0 ? _b : true;
+        const leading = (_c = options === null || options === void 0 ? void 0 : options.leading) !== null && _c !== void 0 ? _c : true;
         let timer = null;
         let lastTime = 0;
         const clearTimer = () => {
@@ -1347,6 +1484,9 @@ See the Mulan PSL v2 for more details.
                 lastTime = now;
                 clearTimer();
             }
+            if (timeGap < 0 && trailing && trailingRunLast && timer) {
+                clearTimer();
+            }
             if (timeGap >= 0 && leading) {
                 fn.apply(this, args);
             }
@@ -1364,7 +1504,7 @@ See the Mulan PSL v2 for more details.
         if (!isNumber(delay) || !isFinite(delay) || delay <= 0) {
             throw new Error('Invalid delay parameter');
         }
-        return _throttle(fn, delay, Object.assign({ trailing: true, leading: false }, options));
+        return _throttle(fn, delay, Object.assign({ trailing: true, leading: false, trailingRunLast: true }, options));
     }
 
     function _cloneArray(obj, map, cloner, ...args) {
@@ -1652,6 +1792,7 @@ See the Mulan PSL v2 for more details.
     exports.curry = _curryMore;
     exports.debounce = debounce;
     exports.deepClone = deepClone;
+    exports.defer = defer;
     exports.fastClone = fastClone;
     exports.getAcceptableExtByMIME = getAcceptableExtByMIME;
     exports.getAcceptableMIMEByExt = getAcceptableMIMEByExt;
@@ -1709,6 +1850,7 @@ See the Mulan PSL v2 for more details.
     exports.memo = memo;
     exports.noop = noop;
     exports.not = not;
+    exports.parallel = parallel;
     exports.pascalCase = pascalCase;
     exports.pass = pass;
     exports.passWith = passWith;
@@ -1721,6 +1863,7 @@ See the Mulan PSL v2 for more details.
     exports.randomString = randomString;
     exports.range = range;
     exports.remove = remove;
+    exports.retry = retry;
     exports.shuffle = shuffle;
     exports.sleep = sleep;
     exports.snakeCase = snakeCase;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "foreslash",
-  "version": "0.2.2",
+  "version": "0.2.4",
   "description": "Foreslash is a Javascript utilities lib which contains plenty of practical functions.",
   "author": "moushu",
   "license": "Mulan PSL v2",