react-dynamic-virtual-tree/dist/services/queueService.js

Library for visualizing nested lists with dynamically changing sizes.

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 };
    }
};
var queue = function () {
    var tasks = {};
    var doTasks = function () { return __awaiter(void 0, void 0, void 0, function () {
        var priorityArray, currentPriority, taskObj;
        return __generator(this, function (_a) {
            switch (_a.label) {
                case 0:
                    priorityArray = Object.keys(tasks)
                        .map(function (item) { return Number(item); })
                        .filter(function (item) { return tasks[item].length > 0; })
                        .sort(function (a, b) { return b - a; });
                    if (priorityArray.length === 0) {
                        return [2 /*return*/];
                    }
                    currentPriority = priorityArray[priorityArray.length - 1];
                    taskObj = tasks[currentPriority].splice(0, 1)[0];
                    return [4 /*yield*/, taskObj.task()];
                case 1:
                    _a.sent();
                    taskObj.readyCallback();
                    return [4 /*yield*/, doTasks()];
                case 2:
                    _a.sent();
                    return [2 /*return*/];
            }
        });
    }); };
    return {
        pushTask: function (taskId, task, priority) {
            if (priority === void 0) { priority = 0; }
            var executor = function (resolve, reject) {
                var taskObj = Object.values(tasks)
                    .flat(1)
                    .find(function (taskItem) { return taskItem.taskId === taskId; });
                if (taskObj) {
                    reject({
                        pushAnyway: function () {
                            return new Promise(function (resolve) {
                                tasks[priority].push({
                                    taskId: taskId,
                                    task: task,
                                    readyCallback: resolve,
                                });
                            });
                        },
                    });
                    return;
                }
                if (!tasks[priority]) {
                    tasks[priority] = [];
                }
                tasks[priority].push({
                    taskId: taskId,
                    task: task,
                    readyCallback: resolve,
                });
                Object.values(tasks).flat(1).length === 1 && doTasks();
            };
            return new Promise(executor);
        },
    };
};
export var queueObj = queue();