UNPKG

5.55 kBJavaScriptView Raw
1"use strict";
2var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
3 return new (P || (P = Promise))(function (resolve, reject) {
4 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
5 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
6 function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }
7 step((generator = generator.apply(thisArg, _arguments || [])).next());
8 });
9};
10var __generator = (this && this.__generator) || function (thisArg, body) {
11 var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
12 return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
13 function verb(n) { return function (v) { return step([n, v]); }; }
14 function step(op) {
15 if (f) throw new TypeError("Generator is already executing.");
16 while (_) try {
17 if (f = 1, y && (t = y[op[0] & 2 ? "return" : op[0] ? "throw" : "next"]) && !(t = t.call(y, op[1])).done) return t;
18 if (y = 0, t) op = [0, t.value];
19 switch (op[0]) {
20 case 0: case 1: t = op; break;
21 case 4: _.label++; return { value: op[1], done: false };
22 case 5: _.label++; y = op[1]; op = [0]; continue;
23 case 7: op = _.ops.pop(); _.trys.pop(); continue;
24 default:
25 if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
26 if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
27 if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
28 if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
29 if (t[2]) _.ops.pop();
30 _.trys.pop(); continue;
31 }
32 op = body.call(thisArg, _);
33 } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
34 if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
35 }
36};
37Object.defineProperty(exports, "__esModule", { value: true });
38var Queue = /** @class */ (function () {
39 function Queue(chrome) {
40 this.chrome = chrome;
41 this.flushCount = 0;
42 this.commandQueue = {
43 0: [],
44 };
45 }
46 Queue.prototype.end = function () {
47 return __awaiter(this, void 0, void 0, function () {
48 return __generator(this, function (_a) {
49 switch (_a.label) {
50 case 0:
51 this.lastWaitAll = this.waitAll();
52 return [4 /*yield*/, this.lastWaitAll];
53 case 1:
54 _a.sent();
55 return [4 /*yield*/, this.chrome.close()];
56 case 2:
57 _a.sent();
58 return [2 /*return*/];
59 }
60 });
61 });
62 };
63 Queue.prototype.enqueue = function (command) {
64 this.commandQueue[this.flushCount].push(command);
65 };
66 Queue.prototype.process = function (command) {
67 return __awaiter(this, void 0, void 0, function () {
68 var lastWaitAllTmp;
69 return __generator(this, function (_a) {
70 switch (_a.label) {
71 case 0:
72 if (!this.lastWaitAll) return [3 /*break*/, 2];
73 lastWaitAllTmp = this.lastWaitAll;
74 this.lastWaitAll = this.waitAll();
75 return [4 /*yield*/, lastWaitAllTmp];
76 case 1:
77 _a.sent();
78 return [3 /*break*/, 3];
79 case 2:
80 this.lastWaitAll = this.waitAll();
81 _a.label = 3;
82 case 3: return [4 /*yield*/, this.lastWaitAll];
83 case 4:
84 _a.sent();
85 return [2 /*return*/, this.chrome.process(command)];
86 }
87 });
88 });
89 };
90 Queue.prototype.waitAll = function () {
91 return __awaiter(this, void 0, void 0, function () {
92 var previousFlushCount, _i, _a, command;
93 return __generator(this, function (_b) {
94 switch (_b.label) {
95 case 0:
96 previousFlushCount = this.flushCount;
97 this.flushCount++;
98 this.commandQueue[this.flushCount] = [];
99 _i = 0, _a = this.commandQueue[previousFlushCount];
100 _b.label = 1;
101 case 1:
102 if (!(_i < _a.length)) return [3 /*break*/, 4];
103 command = _a[_i];
104 return [4 /*yield*/, this.chrome.process(command)];
105 case 2:
106 _b.sent();
107 _b.label = 3;
108 case 3:
109 _i++;
110 return [3 /*break*/, 1];
111 case 4: return [2 /*return*/];
112 }
113 });
114 });
115 };
116 return Queue;
117}());
118exports.default = Queue;
119//# sourceMappingURL=queue.js.map
\No newline at end of file