arayts
Version:
让 TypeScript 开发如丝般顺滑。ArayTS 提供了一套高效、优雅的算法工具集，包含常用的数据结构与算法实现，帮助开发者轻松构建可靠的应用程序。
270 lines (269 loc) • 11.7 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (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());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (g && (g = 0, op[0] && (_ = 0)), _) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.Async = void 0;
/**
* 异步工具函数集合
*/
var Async = /** @class */ (function () {
function Async() {
}
/**
* 重试函数：当异步操作失败时自动重试
* @param fn 需要重试的异步函数
* @param maxAttempts 最大重试次数
* @param delay 重试间隔(ms)
*/
Async.retry = function (fn, maxAttempts, delay) {
if (maxAttempts === void 0) { maxAttempts = 3; }
if (delay === void 0) { delay = 1000; }
return __awaiter(this, void 0, void 0, function () {
var lastError, attempt, error_1;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
attempt = 1;
_a.label = 1;
case 1:
if (!(attempt <= maxAttempts)) return [3 /*break*/, 7];
_a.label = 2;
case 2:
_a.trys.push([2, 4, , 6]);
return [4 /*yield*/, fn()];
case 3: return [2 /*return*/, _a.sent()];
case 4:
error_1 = _a.sent();
lastError = error_1;
if (attempt === maxAttempts)
return [3 /*break*/, 7];
return [4 /*yield*/, new Promise(function (resolve) { return setTimeout(resolve, delay); })];
case 5:
_a.sent();
return [3 /*break*/, 6];
case 6:
attempt++;
return [3 /*break*/, 1];
case 7: throw new Error("\u91CD\u8BD5".concat(maxAttempts, "\u6B21\u540E\u5931\u8D25: ").concat(lastError.message));
}
});
});
};
/**
* 超时控制：为异步操作添加超时限制
* @param promise 原始Promise
* @param timeout 超时时间(ms)
*/
Async.withTimeout = function (promise, timeout) {
return __awaiter(this, void 0, void 0, function () {
var timeoutPromise;
return __generator(this, function (_a) {
timeoutPromise = new Promise(function (_, reject) {
setTimeout(function () { return reject(new Error('操作超时')); }, timeout);
});
return [2 /*return*/, Promise.race([promise, timeoutPromise])];
});
});
};
/**
* 并发控制：限制并发请求数量
* @param tasks 任务数组
* @param limit 并发限制数
*/
Async.parallel = function (tasks, limit) {
if (limit === void 0) { limit = 3; }
return __awaiter(this, void 0, void 0, function () {
var results, executing, _loop_1, i;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
results = [];
executing = [];
_loop_1 = function (i) {
var task, p;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
task = tasks[i];
p = task().then(function (result) {
results[i] = result;
});
executing.push(p);
if (!(executing.length >= limit)) return [3 /*break*/, 2];
return [4 /*yield*/, Promise.race(executing)];
case 1:
_b.sent();
_b.label = 2;
case 2: return [2 /*return*/];
}
});
};
i = 0;
_a.label = 1;
case 1:
if (!(i < tasks.length)) return [3 /*break*/, 4];
return [5 /*yield**/, _loop_1(i)];
case 2:
_a.sent();
_a.label = 3;
case 3:
i++;
return [3 /*break*/, 1];
case 4: return [4 /*yield*/, Promise.all(executing)];
case 5:
_a.sent();
return [2 /*return*/, results];
}
});
});
};
/**
* 防抖函数：将多次调用合并为一次
* @param fn 需要防抖的函数
* @param wait 等待时间(ms)
*/
Async.debounce = function (fn, wait) {
if (wait === void 0) { wait = 300; }
var timeout;
var pendingPromise = null;
return function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
if (!pendingPromise) {
pendingPromise = new Promise(function (resolve, reject) {
var execute = function () {
fn.apply(void 0, args).then(resolve)
.catch(reject)
.finally(function () {
pendingPromise = null;
});
};
clearTimeout(timeout);
timeout = setTimeout(execute, wait);
});
}
return pendingPromise;
};
};
/**
* 节流函数：限制函数调用频率
* @param fn 需要节流的函数
* @param wait 等待时间(ms)
*/
Async.throttle = function (fn, wait) {
if (wait === void 0) { wait = 300; }
var lastCall = 0;
var lastPromise = null;
return function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
var now = Date.now();
if (!lastPromise || now - lastCall >= wait) {
lastCall = now;
lastPromise = fn.apply(void 0, args);
return lastPromise;
}
return lastPromise;
};
};
/**
* 缓存异步结果
* @param fn 异步函数
* @param ttl 缓存有效期(ms)
*/
Async.memoize = function (fn, ttl) {
if (ttl === void 0) { ttl = 5000; }
var cache = new Map();
return (function () {
var args = [];
for (var _i = 0; _i < arguments.length; _i++) {
args[_i] = arguments[_i];
}
var key = JSON.stringify(args);
var cached = cache.get(key);
var now = Date.now();
if (cached && now - cached.timestamp < ttl) {
return Promise.resolve(cached.value);
}
return fn.apply(void 0, args).then(function (value) {
cache.set(key, { value: value, timestamp: now });
return value;
});
});
};
/**
* 等待任务完成
* @param condition 条件判断函数
* @param options 配置选项
* @returns Promise<boolean>
*/
Async.waitUntil = function (condition, options) {
if (options === void 0) { options = {}; }
return __awaiter(this, void 0, void 0, function () {
var _a, timeout, _b, interval, _c, timeoutMessage, startTime, result;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_a = options.timeout, timeout = _a === void 0 ? 30000 : _a, _b = options.interval, interval = _b === void 0 ? 1000 : _b, _c = options.timeoutMessage, timeoutMessage = _c === void 0 ? '等待超时' : _c;
startTime = Date.now();
_d.label = 1;
case 1:
if (!true) return [3 /*break*/, 4];
return [4 /*yield*/, Promise.resolve(condition())];
case 2:
result = _d.sent();
if (result)
return [2 /*return*/, true];
if (Date.now() - startTime >= timeout) {
throw new Error(timeoutMessage);
}
return [4 /*yield*/, new Promise(function (resolve) { return setTimeout(resolve, interval); })];
case 3:
_d.sent();
return [3 /*break*/, 1];
case 4: return [2 /*return*/];
}
});
});
};
return Async;
}());
exports.Async = Async;