@calf/helios
Version:
Helios module of Calf framework.
121 lines (120 loc) • 5.53 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 (_) 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.Queue = void 0;
// Classes
var config_class_1 = require("../classes/config.class");
/**
* Queue utility
*/
var Queue = /** @class */ (function () {
/**
* Do not allow new instances
*/
function Queue() {
}
/**
* Enqueue function
* @param func
*/
Queue.enqueue = function (func) {
return __awaiter(this, void 0, void 0, function () {
var err_1;
var _this = this;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!(++this.activeCount > 1)) return [3 /*break*/, 2];
// Create new promise
return [4 /*yield*/, new Promise(function (resolve) { return _this.jobs.push(resolve); })];
case 1:
// Create new promise
_a.sent();
_a.label = 2;
case 2:
_a.trys.push([2, 4, 5, 7]);
return [4 /*yield*/, func()];
case 3:
// Execute function
return [2 /*return*/, _a.sent()];
case 4:
err_1 = _a.sent();
// Throw err
throw err_1;
case 5:
// Delay
return [4 /*yield*/, this.delay()];
case 6:
// Delay
_a.sent();
// Decrease active count
this.activeCount--;
// Shift queue if needed
if (this.jobs.length) {
// Execute next job
this.jobs.shift()();
}
return [7 /*endfinally*/];
case 7: return [2 /*return*/];
}
});
});
};
/**
* Delay execution
*/
Queue.delay = function () {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
// Check for Helios requests delay
if (!config_class_1.HeliosConfig.delayBetweenRequests) {
// Nothing to do
return [2 /*return*/];
}
// Set timeout to delay execution
return [2 /*return*/, new Promise(function (resolve) { return setTimeout(function () { return resolve(); }, config_class_1.HeliosConfig.delayBetweenRequests); })];
});
});
};
// Number of active jobs in queue
Queue.activeCount = 0;
// Jobs in queue
Queue.jobs = [];
return Queue;
}());
exports.Queue = Queue;