@common.js/p-queue 7.3.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +5 -0
- package/dist/index.d.ts +87 -0
- package/dist/index.js +850 -0
- package/dist/lower-bound.d.ts +1 -0
- package/dist/lower-bound.js +27 -0
- package/dist/options.d.ts +102 -0
- package/dist/options.js +4 -0
- package/dist/priority-queue.d.ts +12 -0
- package/dist/priority-queue.js +123 -0
- package/dist/queue.d.ts +7 -0
- package/dist/queue.js +4 -0
- package/license +9 -0
- package/package.json +68 -0
- package/readme.md +518 -0
package/dist/index.js
ADDED
|
@@ -0,0 +1,850 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", {
|
|
3
|
+
value: true
|
|
4
|
+
});
|
|
5
|
+
function _export(target, all) {
|
|
6
|
+
for(var name in all)Object.defineProperty(target, name, {
|
|
7
|
+
enumerable: true,
|
|
8
|
+
get: all[name]
|
|
9
|
+
});
|
|
10
|
+
}
|
|
11
|
+
_export(exports, {
|
|
12
|
+
default: function() {
|
|
13
|
+
return PQueue;
|
|
14
|
+
},
|
|
15
|
+
AbortError: function() {
|
|
16
|
+
return AbortError;
|
|
17
|
+
}
|
|
18
|
+
});
|
|
19
|
+
var _eventemitter3 = /*#__PURE__*/ _interopRequireDefault(require("eventemitter3"));
|
|
20
|
+
var _pTimeout = /*#__PURE__*/ _interopRequireWildcard(require("p-timeout"));
|
|
21
|
+
var _priorityQueueJs = /*#__PURE__*/ _interopRequireDefault(require("./priority-queue.js"));
|
|
22
|
+
function _assertThisInitialized(self) {
|
|
23
|
+
if (self === void 0) {
|
|
24
|
+
throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
|
|
25
|
+
}
|
|
26
|
+
return self;
|
|
27
|
+
}
|
|
28
|
+
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
|
|
29
|
+
try {
|
|
30
|
+
var info = gen[key](arg);
|
|
31
|
+
var value = info.value;
|
|
32
|
+
} catch (error) {
|
|
33
|
+
reject(error);
|
|
34
|
+
return;
|
|
35
|
+
}
|
|
36
|
+
if (info.done) {
|
|
37
|
+
resolve(value);
|
|
38
|
+
} else {
|
|
39
|
+
Promise.resolve(value).then(_next, _throw);
|
|
40
|
+
}
|
|
41
|
+
}
|
|
42
|
+
function _asyncToGenerator(fn) {
|
|
43
|
+
return function() {
|
|
44
|
+
var self = this, args = arguments;
|
|
45
|
+
return new Promise(function(resolve, reject) {
|
|
46
|
+
var gen = fn.apply(self, args);
|
|
47
|
+
function _next(value) {
|
|
48
|
+
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
|
|
49
|
+
}
|
|
50
|
+
function _throw(err) {
|
|
51
|
+
asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
|
|
52
|
+
}
|
|
53
|
+
_next(undefined);
|
|
54
|
+
});
|
|
55
|
+
};
|
|
56
|
+
}
|
|
57
|
+
function _classCallCheck(instance, Constructor) {
|
|
58
|
+
if (!(instance instanceof Constructor)) {
|
|
59
|
+
throw new TypeError("Cannot call a class as a function");
|
|
60
|
+
}
|
|
61
|
+
}
|
|
62
|
+
function isNativeReflectConstruct() {
|
|
63
|
+
if (typeof Reflect === "undefined" || !Reflect.construct) return false;
|
|
64
|
+
if (Reflect.construct.sham) return false;
|
|
65
|
+
if (typeof Proxy === "function") return true;
|
|
66
|
+
try {
|
|
67
|
+
Date.prototype.toString.call(Reflect.construct(Date, [], function() {}));
|
|
68
|
+
return true;
|
|
69
|
+
} catch (e) {
|
|
70
|
+
return false;
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
function _construct(Parent, args, Class) {
|
|
74
|
+
if (isNativeReflectConstruct()) {
|
|
75
|
+
_construct = Reflect.construct;
|
|
76
|
+
} else {
|
|
77
|
+
_construct = function _construct(Parent, args, Class) {
|
|
78
|
+
var a = [
|
|
79
|
+
null
|
|
80
|
+
];
|
|
81
|
+
a.push.apply(a, args);
|
|
82
|
+
var Constructor = Function.bind.apply(Parent, a);
|
|
83
|
+
var instance = new Constructor();
|
|
84
|
+
if (Class) _setPrototypeOf(instance, Class.prototype);
|
|
85
|
+
return instance;
|
|
86
|
+
};
|
|
87
|
+
}
|
|
88
|
+
return _construct.apply(null, arguments);
|
|
89
|
+
}
|
|
90
|
+
function _defineProperties(target, props) {
|
|
91
|
+
for(var i = 0; i < props.length; i++){
|
|
92
|
+
var descriptor = props[i];
|
|
93
|
+
descriptor.enumerable = descriptor.enumerable || false;
|
|
94
|
+
descriptor.configurable = true;
|
|
95
|
+
if ("value" in descriptor) descriptor.writable = true;
|
|
96
|
+
Object.defineProperty(target, descriptor.key, descriptor);
|
|
97
|
+
}
|
|
98
|
+
}
|
|
99
|
+
function _createClass(Constructor, protoProps, staticProps) {
|
|
100
|
+
if (protoProps) _defineProperties(Constructor.prototype, protoProps);
|
|
101
|
+
if (staticProps) _defineProperties(Constructor, staticProps);
|
|
102
|
+
return Constructor;
|
|
103
|
+
}
|
|
104
|
+
function _defineProperty(obj, key, value) {
|
|
105
|
+
if (key in obj) {
|
|
106
|
+
Object.defineProperty(obj, key, {
|
|
107
|
+
value: value,
|
|
108
|
+
enumerable: true,
|
|
109
|
+
configurable: true,
|
|
110
|
+
writable: true
|
|
111
|
+
});
|
|
112
|
+
} else {
|
|
113
|
+
obj[key] = value;
|
|
114
|
+
}
|
|
115
|
+
return obj;
|
|
116
|
+
}
|
|
117
|
+
function _getPrototypeOf(o) {
|
|
118
|
+
_getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) {
|
|
119
|
+
return o.__proto__ || Object.getPrototypeOf(o);
|
|
120
|
+
};
|
|
121
|
+
return _getPrototypeOf(o);
|
|
122
|
+
}
|
|
123
|
+
function _inherits(subClass, superClass) {
|
|
124
|
+
if (typeof superClass !== "function" && superClass !== null) {
|
|
125
|
+
throw new TypeError("Super expression must either be null or a function");
|
|
126
|
+
}
|
|
127
|
+
subClass.prototype = Object.create(superClass && superClass.prototype, {
|
|
128
|
+
constructor: {
|
|
129
|
+
value: subClass,
|
|
130
|
+
writable: true,
|
|
131
|
+
configurable: true
|
|
132
|
+
}
|
|
133
|
+
});
|
|
134
|
+
if (superClass) _setPrototypeOf(subClass, superClass);
|
|
135
|
+
}
|
|
136
|
+
function _interopRequireDefault(obj) {
|
|
137
|
+
return obj && obj.__esModule ? obj : {
|
|
138
|
+
default: obj
|
|
139
|
+
};
|
|
140
|
+
}
|
|
141
|
+
function _getRequireWildcardCache(nodeInterop) {
|
|
142
|
+
if (typeof WeakMap !== "function") return null;
|
|
143
|
+
var cacheBabelInterop = new WeakMap();
|
|
144
|
+
var cacheNodeInterop = new WeakMap();
|
|
145
|
+
return (_getRequireWildcardCache = function(nodeInterop) {
|
|
146
|
+
return nodeInterop ? cacheNodeInterop : cacheBabelInterop;
|
|
147
|
+
})(nodeInterop);
|
|
148
|
+
}
|
|
149
|
+
function _interopRequireWildcard(obj, nodeInterop) {
|
|
150
|
+
if (!nodeInterop && obj && obj.__esModule) {
|
|
151
|
+
return obj;
|
|
152
|
+
}
|
|
153
|
+
if (obj === null || typeof obj !== "object" && typeof obj !== "function") {
|
|
154
|
+
return {
|
|
155
|
+
default: obj
|
|
156
|
+
};
|
|
157
|
+
}
|
|
158
|
+
var cache = _getRequireWildcardCache(nodeInterop);
|
|
159
|
+
if (cache && cache.has(obj)) {
|
|
160
|
+
return cache.get(obj);
|
|
161
|
+
}
|
|
162
|
+
var newObj = {};
|
|
163
|
+
var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor;
|
|
164
|
+
for(var key in obj){
|
|
165
|
+
if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) {
|
|
166
|
+
var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null;
|
|
167
|
+
if (desc && (desc.get || desc.set)) {
|
|
168
|
+
Object.defineProperty(newObj, key, desc);
|
|
169
|
+
} else {
|
|
170
|
+
newObj[key] = obj[key];
|
|
171
|
+
}
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
newObj.default = obj;
|
|
175
|
+
if (cache) {
|
|
176
|
+
cache.set(obj, newObj);
|
|
177
|
+
}
|
|
178
|
+
return newObj;
|
|
179
|
+
}
|
|
180
|
+
function _isNativeFunction(fn) {
|
|
181
|
+
return Function.toString.call(fn).indexOf("[native code]") !== -1;
|
|
182
|
+
}
|
|
183
|
+
function _objectSpread(target) {
|
|
184
|
+
for(var i = 1; i < arguments.length; i++){
|
|
185
|
+
var source = arguments[i] != null ? arguments[i] : {};
|
|
186
|
+
var ownKeys = Object.keys(source);
|
|
187
|
+
if (typeof Object.getOwnPropertySymbols === "function") {
|
|
188
|
+
ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function(sym) {
|
|
189
|
+
return Object.getOwnPropertyDescriptor(source, sym).enumerable;
|
|
190
|
+
}));
|
|
191
|
+
}
|
|
192
|
+
ownKeys.forEach(function(key) {
|
|
193
|
+
_defineProperty(target, key, source[key]);
|
|
194
|
+
});
|
|
195
|
+
}
|
|
196
|
+
return target;
|
|
197
|
+
}
|
|
198
|
+
function _possibleConstructorReturn(self, call) {
|
|
199
|
+
if (call && (_typeof(call) === "object" || typeof call === "function")) {
|
|
200
|
+
return call;
|
|
201
|
+
}
|
|
202
|
+
return _assertThisInitialized(self);
|
|
203
|
+
}
|
|
204
|
+
function _setPrototypeOf(o, p) {
|
|
205
|
+
_setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) {
|
|
206
|
+
o.__proto__ = p;
|
|
207
|
+
return o;
|
|
208
|
+
};
|
|
209
|
+
return _setPrototypeOf(o, p);
|
|
210
|
+
}
|
|
211
|
+
var _typeof = function(obj) {
|
|
212
|
+
"@swc/helpers - typeof";
|
|
213
|
+
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
214
|
+
};
|
|
215
|
+
function _wrapNativeSuper(Class) {
|
|
216
|
+
var _cache = typeof Map === "function" ? new Map() : undefined;
|
|
217
|
+
_wrapNativeSuper = function _wrapNativeSuper(Class) {
|
|
218
|
+
if (Class === null || !_isNativeFunction(Class)) return Class;
|
|
219
|
+
if (typeof Class !== "function") {
|
|
220
|
+
throw new TypeError("Super expression must either be null or a function");
|
|
221
|
+
}
|
|
222
|
+
if (typeof _cache !== "undefined") {
|
|
223
|
+
if (_cache.has(Class)) return _cache.get(Class);
|
|
224
|
+
_cache.set(Class, Wrapper);
|
|
225
|
+
}
|
|
226
|
+
function Wrapper() {
|
|
227
|
+
return _construct(Class, arguments, _getPrototypeOf(this).constructor);
|
|
228
|
+
}
|
|
229
|
+
Wrapper.prototype = Object.create(Class.prototype, {
|
|
230
|
+
constructor: {
|
|
231
|
+
value: Wrapper,
|
|
232
|
+
enumerable: false,
|
|
233
|
+
writable: true,
|
|
234
|
+
configurable: true
|
|
235
|
+
}
|
|
236
|
+
});
|
|
237
|
+
return _setPrototypeOf(Wrapper, Class);
|
|
238
|
+
};
|
|
239
|
+
return _wrapNativeSuper(Class);
|
|
240
|
+
}
|
|
241
|
+
function _isNativeReflectConstruct() {
|
|
242
|
+
if (typeof Reflect === "undefined" || !Reflect.construct) return false;
|
|
243
|
+
if (Reflect.construct.sham) return false;
|
|
244
|
+
if (typeof Proxy === "function") return true;
|
|
245
|
+
try {
|
|
246
|
+
Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function() {}));
|
|
247
|
+
return true;
|
|
248
|
+
} catch (e) {
|
|
249
|
+
return false;
|
|
250
|
+
}
|
|
251
|
+
}
|
|
252
|
+
function _createSuper(Derived) {
|
|
253
|
+
var hasNativeReflectConstruct = _isNativeReflectConstruct();
|
|
254
|
+
return function _createSuperInternal() {
|
|
255
|
+
var Super = _getPrototypeOf(Derived), result;
|
|
256
|
+
if (hasNativeReflectConstruct) {
|
|
257
|
+
var NewTarget = _getPrototypeOf(this).constructor;
|
|
258
|
+
result = Reflect.construct(Super, arguments, NewTarget);
|
|
259
|
+
} else {
|
|
260
|
+
result = Super.apply(this, arguments);
|
|
261
|
+
}
|
|
262
|
+
return _possibleConstructorReturn(this, result);
|
|
263
|
+
};
|
|
264
|
+
}
|
|
265
|
+
var __generator = (void 0) && (void 0).__generator || function(thisArg, body) {
|
|
266
|
+
var f, y, t, g, _ = {
|
|
267
|
+
label: 0,
|
|
268
|
+
sent: function() {
|
|
269
|
+
if (t[0] & 1) throw t[1];
|
|
270
|
+
return t[1];
|
|
271
|
+
},
|
|
272
|
+
trys: [],
|
|
273
|
+
ops: []
|
|
274
|
+
};
|
|
275
|
+
return g = {
|
|
276
|
+
next: verb(0),
|
|
277
|
+
"throw": verb(1),
|
|
278
|
+
"return": verb(2)
|
|
279
|
+
}, typeof Symbol === "function" && (g[Symbol.iterator] = function() {
|
|
280
|
+
return this;
|
|
281
|
+
}), g;
|
|
282
|
+
function verb(n) {
|
|
283
|
+
return function(v) {
|
|
284
|
+
return step([
|
|
285
|
+
n,
|
|
286
|
+
v
|
|
287
|
+
]);
|
|
288
|
+
};
|
|
289
|
+
}
|
|
290
|
+
function step(op) {
|
|
291
|
+
if (f) throw new TypeError("Generator is already executing.");
|
|
292
|
+
while(_)try {
|
|
293
|
+
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;
|
|
294
|
+
if (y = 0, t) op = [
|
|
295
|
+
op[0] & 2,
|
|
296
|
+
t.value
|
|
297
|
+
];
|
|
298
|
+
switch(op[0]){
|
|
299
|
+
case 0:
|
|
300
|
+
case 1:
|
|
301
|
+
t = op;
|
|
302
|
+
break;
|
|
303
|
+
case 4:
|
|
304
|
+
_.label++;
|
|
305
|
+
return {
|
|
306
|
+
value: op[1],
|
|
307
|
+
done: false
|
|
308
|
+
};
|
|
309
|
+
case 5:
|
|
310
|
+
_.label++;
|
|
311
|
+
y = op[1];
|
|
312
|
+
op = [
|
|
313
|
+
0
|
|
314
|
+
];
|
|
315
|
+
continue;
|
|
316
|
+
case 7:
|
|
317
|
+
op = _.ops.pop();
|
|
318
|
+
_.trys.pop();
|
|
319
|
+
continue;
|
|
320
|
+
default:
|
|
321
|
+
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
|
|
322
|
+
_ = 0;
|
|
323
|
+
continue;
|
|
324
|
+
}
|
|
325
|
+
if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
|
|
326
|
+
_.label = op[1];
|
|
327
|
+
break;
|
|
328
|
+
}
|
|
329
|
+
if (op[0] === 6 && _.label < t[1]) {
|
|
330
|
+
_.label = t[1];
|
|
331
|
+
t = op;
|
|
332
|
+
break;
|
|
333
|
+
}
|
|
334
|
+
if (t && _.label < t[2]) {
|
|
335
|
+
_.label = t[2];
|
|
336
|
+
_.ops.push(op);
|
|
337
|
+
break;
|
|
338
|
+
}
|
|
339
|
+
if (t[2]) _.ops.pop();
|
|
340
|
+
_.trys.pop();
|
|
341
|
+
continue;
|
|
342
|
+
}
|
|
343
|
+
op = body.call(thisArg, _);
|
|
344
|
+
} catch (e) {
|
|
345
|
+
op = [
|
|
346
|
+
6,
|
|
347
|
+
e
|
|
348
|
+
];
|
|
349
|
+
y = 0;
|
|
350
|
+
} finally{
|
|
351
|
+
f = t = 0;
|
|
352
|
+
}
|
|
353
|
+
if (op[0] & 5) throw op[1];
|
|
354
|
+
return {
|
|
355
|
+
value: op[0] ? op[1] : void 0,
|
|
356
|
+
done: true
|
|
357
|
+
};
|
|
358
|
+
}
|
|
359
|
+
};
|
|
360
|
+
var __classPrivateFieldSet = (void 0) && (void 0).__classPrivateFieldSet || function(receiver, state, value, kind, f) {
|
|
361
|
+
if (kind === "m") throw new TypeError("Private method is not writable");
|
|
362
|
+
if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
|
|
363
|
+
if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
|
|
364
|
+
return kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value), value;
|
|
365
|
+
};
|
|
366
|
+
var __classPrivateFieldGet = (void 0) && (void 0).__classPrivateFieldGet || function(receiver, state, kind, f) {
|
|
367
|
+
if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
|
|
368
|
+
if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
|
|
369
|
+
return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
|
|
370
|
+
};
|
|
371
|
+
var _PQueue_instances, _PQueue_carryoverConcurrencyCount, _PQueue_isIntervalIgnored, _PQueue_intervalCount, _PQueue_intervalCap, _PQueue_interval, _PQueue_intervalEnd, _PQueue_intervalId, _PQueue_timeoutId, _PQueue_queue, _PQueue_queueClass, _PQueue_pendingCount, _PQueue_concurrency, _PQueue_isPaused, _PQueue_throwOnTimeout, _PQueue_doesIntervalAllowAnother_get, _PQueue_doesConcurrentAllowAnother_get, _PQueue_next, _PQueue_emitEvents, _PQueue_onResumeInterval, _PQueue_isIntervalPaused_get, _PQueue_tryToStartAnother, _PQueue_initializeIntervalIfNeeded, _PQueue_onInterval, _PQueue_processQueue, _PQueue_onEvent;
|
|
372
|
+
var timeoutError = new _pTimeout.TimeoutError();
|
|
373
|
+
var AbortError = /*#__PURE__*/ function(Error1) {
|
|
374
|
+
"use strict";
|
|
375
|
+
_inherits(AbortError, Error1);
|
|
376
|
+
var _super = _createSuper(AbortError);
|
|
377
|
+
function AbortError() {
|
|
378
|
+
_classCallCheck(this, AbortError);
|
|
379
|
+
return _super.apply(this, arguments);
|
|
380
|
+
}
|
|
381
|
+
return AbortError;
|
|
382
|
+
}(_wrapNativeSuper(Error));
|
|
383
|
+
var PQueue = /*#__PURE__*/ function(EventEmitter) {
|
|
384
|
+
"use strict";
|
|
385
|
+
_inherits(PQueue, EventEmitter);
|
|
386
|
+
var _super = _createSuper(PQueue);
|
|
387
|
+
function PQueue(options) {
|
|
388
|
+
_classCallCheck(this, PQueue);
|
|
389
|
+
var _this;
|
|
390
|
+
var _a, _b, _c, _d;
|
|
391
|
+
_this = _super.call(this);
|
|
392
|
+
_PQueue_instances.add(_assertThisInitialized(_this));
|
|
393
|
+
_PQueue_carryoverConcurrencyCount.set(_assertThisInitialized(_this), void 0);
|
|
394
|
+
_PQueue_isIntervalIgnored.set(_assertThisInitialized(_this), void 0);
|
|
395
|
+
_PQueue_intervalCount.set(_assertThisInitialized(_this), 0);
|
|
396
|
+
_PQueue_intervalCap.set(_assertThisInitialized(_this), void 0);
|
|
397
|
+
_PQueue_interval.set(_assertThisInitialized(_this), void 0);
|
|
398
|
+
_PQueue_intervalEnd.set(_assertThisInitialized(_this), 0);
|
|
399
|
+
_PQueue_intervalId.set(_assertThisInitialized(_this), void 0);
|
|
400
|
+
_PQueue_timeoutId.set(_assertThisInitialized(_this), void 0);
|
|
401
|
+
_PQueue_queue.set(_assertThisInitialized(_this), void 0);
|
|
402
|
+
_PQueue_queueClass.set(_assertThisInitialized(_this), void 0);
|
|
403
|
+
_PQueue_pendingCount.set(_assertThisInitialized(_this), 0);
|
|
404
|
+
// The `!` is needed because of https://github.com/microsoft/TypeScript/issues/32194
|
|
405
|
+
_PQueue_concurrency.set(_assertThisInitialized(_this), void 0);
|
|
406
|
+
_PQueue_isPaused.set(_assertThisInitialized(_this), void 0);
|
|
407
|
+
_PQueue_throwOnTimeout.set(_assertThisInitialized(_this), void 0);
|
|
408
|
+
/**
|
|
409
|
+
Per-operation timeout in milliseconds. Operations fulfill once `timeout` elapses if they haven't already.
|
|
410
|
+
|
|
411
|
+
Applies to each future operation.
|
|
412
|
+
*/ Object.defineProperty(_assertThisInitialized(_this), "timeout", {
|
|
413
|
+
enumerable: true,
|
|
414
|
+
configurable: true,
|
|
415
|
+
writable: true,
|
|
416
|
+
value: void 0
|
|
417
|
+
});
|
|
418
|
+
// eslint-disable-next-line @typescript-eslint/consistent-type-assertions
|
|
419
|
+
options = _objectSpread({
|
|
420
|
+
carryoverConcurrencyCount: false,
|
|
421
|
+
intervalCap: Number.POSITIVE_INFINITY,
|
|
422
|
+
interval: 0,
|
|
423
|
+
concurrency: Number.POSITIVE_INFINITY,
|
|
424
|
+
autoStart: true,
|
|
425
|
+
queueClass: _priorityQueueJs.default
|
|
426
|
+
}, options);
|
|
427
|
+
if (!(typeof options.intervalCap === "number" && options.intervalCap >= 1)) {
|
|
428
|
+
throw new TypeError("Expected `intervalCap` to be a number from 1 and up, got `".concat((_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : "", "` (").concat(_typeof(options.intervalCap), ")"));
|
|
429
|
+
}
|
|
430
|
+
if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {
|
|
431
|
+
throw new TypeError("Expected `interval` to be a finite number >= 0, got `".concat((_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : "", "` (").concat(_typeof(options.interval), ")"));
|
|
432
|
+
}
|
|
433
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_carryoverConcurrencyCount, options.carryoverConcurrencyCount, "f");
|
|
434
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_isIntervalIgnored, options.intervalCap === Number.POSITIVE_INFINITY || options.interval === 0, "f");
|
|
435
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_intervalCap, options.intervalCap, "f");
|
|
436
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_interval, options.interval, "f");
|
|
437
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_queue, new options.queueClass(), "f");
|
|
438
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_queueClass, options.queueClass, "f");
|
|
439
|
+
_this.concurrency = options.concurrency;
|
|
440
|
+
_this.timeout = options.timeout;
|
|
441
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_throwOnTimeout, options.throwOnTimeout === true, "f");
|
|
442
|
+
__classPrivateFieldSet(_assertThisInitialized(_this), _PQueue_isPaused, options.autoStart === false, "f");
|
|
443
|
+
return _this;
|
|
444
|
+
}
|
|
445
|
+
_createClass(PQueue, [
|
|
446
|
+
{
|
|
447
|
+
key: "concurrency",
|
|
448
|
+
get: function get() {
|
|
449
|
+
return __classPrivateFieldGet(this, _PQueue_concurrency, "f");
|
|
450
|
+
},
|
|
451
|
+
set: function set(newConcurrency) {
|
|
452
|
+
if (!(typeof newConcurrency === "number" && newConcurrency >= 1)) {
|
|
453
|
+
throw new TypeError("Expected `concurrency` to be a number from 1 and up, got `".concat(newConcurrency, "` (").concat(typeof newConcurrency === "undefined" ? "undefined" : _typeof(newConcurrency), ")"));
|
|
454
|
+
}
|
|
455
|
+
__classPrivateFieldSet(this, _PQueue_concurrency, newConcurrency, "f");
|
|
456
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_processQueue).call(this);
|
|
457
|
+
}
|
|
458
|
+
},
|
|
459
|
+
{
|
|
460
|
+
key: "add",
|
|
461
|
+
value: /**
|
|
462
|
+
Adds a sync or async task to the queue. Always returns a promise.
|
|
463
|
+
*/ function add(fn) {
|
|
464
|
+
var options = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
|
|
465
|
+
var _this = this;
|
|
466
|
+
return _asyncToGenerator(function() {
|
|
467
|
+
return __generator(this, function(_state) {
|
|
468
|
+
return [
|
|
469
|
+
2,
|
|
470
|
+
new Promise(function(resolve, reject) {
|
|
471
|
+
var run = function() {
|
|
472
|
+
var _ref = _asyncToGenerator(function() {
|
|
473
|
+
var _a, _b, _c, operation, result, error;
|
|
474
|
+
return __generator(this, function(_state) {
|
|
475
|
+
switch(_state.label){
|
|
476
|
+
case 0:
|
|
477
|
+
__classPrivateFieldSet(_this, _PQueue_pendingCount, (_b = __classPrivateFieldGet(_this, _PQueue_pendingCount, "f"), _b++, _b), "f");
|
|
478
|
+
__classPrivateFieldSet(_this, _PQueue_intervalCount, (_c = __classPrivateFieldGet(_this, _PQueue_intervalCount, "f"), _c++, _c), "f");
|
|
479
|
+
_state.label = 1;
|
|
480
|
+
case 1:
|
|
481
|
+
_state.trys.push([
|
|
482
|
+
1,
|
|
483
|
+
3,
|
|
484
|
+
,
|
|
485
|
+
4
|
|
486
|
+
]);
|
|
487
|
+
if ((_a = options.signal) === null || _a === void 0 ? void 0 : _a.aborted) {
|
|
488
|
+
// TODO: Use ABORT_ERR code when targeting Node.js 16 (https://nodejs.org/docs/latest-v16.x/api/errors.html#abort_err)
|
|
489
|
+
reject(new AbortError("The task was aborted."));
|
|
490
|
+
return [
|
|
491
|
+
2
|
|
492
|
+
];
|
|
493
|
+
}
|
|
494
|
+
operation = _this.timeout === undefined && options.timeout === undefined ? fn({
|
|
495
|
+
signal: options.signal
|
|
496
|
+
}) : (0, _pTimeout.default)(Promise.resolve(fn({
|
|
497
|
+
signal: options.signal
|
|
498
|
+
})), options.timeout === undefined ? _this.timeout : options.timeout, function() {
|
|
499
|
+
if (options.throwOnTimeout === undefined ? __classPrivateFieldGet(_this, _PQueue_throwOnTimeout, "f") : options.throwOnTimeout) {
|
|
500
|
+
reject(timeoutError);
|
|
501
|
+
}
|
|
502
|
+
return undefined;
|
|
503
|
+
});
|
|
504
|
+
return [
|
|
505
|
+
4,
|
|
506
|
+
operation
|
|
507
|
+
];
|
|
508
|
+
case 2:
|
|
509
|
+
result = _state.sent();
|
|
510
|
+
resolve(result);
|
|
511
|
+
_this.emit("completed", result);
|
|
512
|
+
return [
|
|
513
|
+
3,
|
|
514
|
+
4
|
|
515
|
+
];
|
|
516
|
+
case 3:
|
|
517
|
+
error = _state.sent();
|
|
518
|
+
reject(error);
|
|
519
|
+
_this.emit("error", error);
|
|
520
|
+
return [
|
|
521
|
+
3,
|
|
522
|
+
4
|
|
523
|
+
];
|
|
524
|
+
case 4:
|
|
525
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_next).call(_this);
|
|
526
|
+
return [
|
|
527
|
+
2
|
|
528
|
+
];
|
|
529
|
+
}
|
|
530
|
+
});
|
|
531
|
+
});
|
|
532
|
+
return function run() {
|
|
533
|
+
return _ref.apply(this, arguments);
|
|
534
|
+
};
|
|
535
|
+
}();
|
|
536
|
+
__classPrivateFieldGet(_this, _PQueue_queue, "f").enqueue(run, options);
|
|
537
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_tryToStartAnother).call(_this);
|
|
538
|
+
_this.emit("add");
|
|
539
|
+
})
|
|
540
|
+
];
|
|
541
|
+
});
|
|
542
|
+
})();
|
|
543
|
+
}
|
|
544
|
+
},
|
|
545
|
+
{
|
|
546
|
+
key: "addAll",
|
|
547
|
+
value: /**
|
|
548
|
+
Same as `.add()`, but accepts an array of sync or async functions.
|
|
549
|
+
|
|
550
|
+
@returns A promise that resolves when all functions are resolved.
|
|
551
|
+
*/ function addAll(functions, options) {
|
|
552
|
+
var _this = this;
|
|
553
|
+
return _asyncToGenerator(function() {
|
|
554
|
+
return __generator(this, function(_state) {
|
|
555
|
+
return [
|
|
556
|
+
2,
|
|
557
|
+
Promise.all(functions.map(function() {
|
|
558
|
+
var _ref = _asyncToGenerator(function(function_) {
|
|
559
|
+
return __generator(this, function(_state) {
|
|
560
|
+
return [
|
|
561
|
+
2,
|
|
562
|
+
_this.add(function_, options)
|
|
563
|
+
];
|
|
564
|
+
});
|
|
565
|
+
});
|
|
566
|
+
return function(function_) {
|
|
567
|
+
return _ref.apply(this, arguments);
|
|
568
|
+
};
|
|
569
|
+
}()))
|
|
570
|
+
];
|
|
571
|
+
});
|
|
572
|
+
})();
|
|
573
|
+
}
|
|
574
|
+
},
|
|
575
|
+
{
|
|
576
|
+
/**
|
|
577
|
+
Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)
|
|
578
|
+
*/ key: "start",
|
|
579
|
+
value: function start() {
|
|
580
|
+
if (!__classPrivateFieldGet(this, _PQueue_isPaused, "f")) {
|
|
581
|
+
return this;
|
|
582
|
+
}
|
|
583
|
+
__classPrivateFieldSet(this, _PQueue_isPaused, false, "f");
|
|
584
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_processQueue).call(this);
|
|
585
|
+
return this;
|
|
586
|
+
}
|
|
587
|
+
},
|
|
588
|
+
{
|
|
589
|
+
/**
|
|
590
|
+
Put queue execution on hold.
|
|
591
|
+
*/ key: "pause",
|
|
592
|
+
value: function pause() {
|
|
593
|
+
__classPrivateFieldSet(this, _PQueue_isPaused, true, "f");
|
|
594
|
+
}
|
|
595
|
+
},
|
|
596
|
+
{
|
|
597
|
+
/**
|
|
598
|
+
Clear the queue.
|
|
599
|
+
*/ key: "clear",
|
|
600
|
+
value: function clear() {
|
|
601
|
+
__classPrivateFieldSet(this, _PQueue_queue, new (__classPrivateFieldGet(this, _PQueue_queueClass, "f"))(), "f");
|
|
602
|
+
}
|
|
603
|
+
},
|
|
604
|
+
{
|
|
605
|
+
key: "onEmpty",
|
|
606
|
+
value: /**
|
|
607
|
+
Can be called multiple times. Useful if you for example add additional items at a later time.
|
|
608
|
+
|
|
609
|
+
@returns A promise that settles when the queue becomes empty.
|
|
610
|
+
*/ function onEmpty() {
|
|
611
|
+
var _this = this;
|
|
612
|
+
return _asyncToGenerator(function() {
|
|
613
|
+
return __generator(this, function(_state) {
|
|
614
|
+
switch(_state.label){
|
|
615
|
+
case 0:
|
|
616
|
+
// Instantly resolve if the queue is empty
|
|
617
|
+
if (__classPrivateFieldGet(_this, _PQueue_queue, "f").size === 0) {
|
|
618
|
+
return [
|
|
619
|
+
2
|
|
620
|
+
];
|
|
621
|
+
}
|
|
622
|
+
return [
|
|
623
|
+
4,
|
|
624
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_onEvent).call(_this, "empty")
|
|
625
|
+
];
|
|
626
|
+
case 1:
|
|
627
|
+
_state.sent();
|
|
628
|
+
return [
|
|
629
|
+
2
|
|
630
|
+
];
|
|
631
|
+
}
|
|
632
|
+
});
|
|
633
|
+
})();
|
|
634
|
+
}
|
|
635
|
+
},
|
|
636
|
+
{
|
|
637
|
+
key: "onSizeLessThan",
|
|
638
|
+
value: /**
|
|
639
|
+
@returns A promise that settles when the queue size is less than the given limit: `queue.size < limit`.
|
|
640
|
+
|
|
641
|
+
If you want to avoid having the queue grow beyond a certain size you can `await queue.onSizeLessThan()` before adding a new item.
|
|
642
|
+
|
|
643
|
+
Note that this only limits the number of items waiting to start. There could still be up to `concurrency` jobs already running that this call does not include in its calculation.
|
|
644
|
+
*/ function onSizeLessThan(limit) {
|
|
645
|
+
var _this = this;
|
|
646
|
+
return _asyncToGenerator(function() {
|
|
647
|
+
return __generator(this, function(_state) {
|
|
648
|
+
switch(_state.label){
|
|
649
|
+
case 0:
|
|
650
|
+
// Instantly resolve if the queue is empty.
|
|
651
|
+
if (__classPrivateFieldGet(_this, _PQueue_queue, "f").size < limit) {
|
|
652
|
+
return [
|
|
653
|
+
2
|
|
654
|
+
];
|
|
655
|
+
}
|
|
656
|
+
return [
|
|
657
|
+
4,
|
|
658
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_onEvent).call(_this, "next", function() {
|
|
659
|
+
return __classPrivateFieldGet(_this, _PQueue_queue, "f").size < limit;
|
|
660
|
+
})
|
|
661
|
+
];
|
|
662
|
+
case 1:
|
|
663
|
+
_state.sent();
|
|
664
|
+
return [
|
|
665
|
+
2
|
|
666
|
+
];
|
|
667
|
+
}
|
|
668
|
+
});
|
|
669
|
+
})();
|
|
670
|
+
}
|
|
671
|
+
},
|
|
672
|
+
{
|
|
673
|
+
key: "onIdle",
|
|
674
|
+
value: /**
|
|
675
|
+
The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.
|
|
676
|
+
|
|
677
|
+
@returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.
|
|
678
|
+
*/ function onIdle() {
|
|
679
|
+
var _this = this;
|
|
680
|
+
return _asyncToGenerator(function() {
|
|
681
|
+
return __generator(this, function(_state) {
|
|
682
|
+
switch(_state.label){
|
|
683
|
+
case 0:
|
|
684
|
+
// Instantly resolve if none pending and if nothing else is queued
|
|
685
|
+
if (__classPrivateFieldGet(_this, _PQueue_pendingCount, "f") === 0 && __classPrivateFieldGet(_this, _PQueue_queue, "f").size === 0) {
|
|
686
|
+
return [
|
|
687
|
+
2
|
|
688
|
+
];
|
|
689
|
+
}
|
|
690
|
+
return [
|
|
691
|
+
4,
|
|
692
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_onEvent).call(_this, "idle")
|
|
693
|
+
];
|
|
694
|
+
case 1:
|
|
695
|
+
_state.sent();
|
|
696
|
+
return [
|
|
697
|
+
2
|
|
698
|
+
];
|
|
699
|
+
}
|
|
700
|
+
});
|
|
701
|
+
})();
|
|
702
|
+
}
|
|
703
|
+
},
|
|
704
|
+
{
|
|
705
|
+
key: "size",
|
|
706
|
+
get: /**
|
|
707
|
+
Size of the queue, the number of queued items waiting to run.
|
|
708
|
+
*/ function get() {
|
|
709
|
+
return __classPrivateFieldGet(this, _PQueue_queue, "f").size;
|
|
710
|
+
}
|
|
711
|
+
},
|
|
712
|
+
{
|
|
713
|
+
/**
|
|
714
|
+
Size of the queue, filtered by the given options.
|
|
715
|
+
|
|
716
|
+
For example, this can be used to find the number of items remaining in the queue with a specific priority level.
|
|
717
|
+
*/ key: "sizeBy",
|
|
718
|
+
value: function sizeBy(options) {
|
|
719
|
+
// eslint-disable-next-line unicorn/no-array-callback-reference
|
|
720
|
+
return __classPrivateFieldGet(this, _PQueue_queue, "f").filter(options).length;
|
|
721
|
+
}
|
|
722
|
+
},
|
|
723
|
+
{
|
|
724
|
+
key: "pending",
|
|
725
|
+
get: /**
|
|
726
|
+
Number of running items (no longer in the queue).
|
|
727
|
+
*/ function get() {
|
|
728
|
+
return __classPrivateFieldGet(this, _PQueue_pendingCount, "f");
|
|
729
|
+
}
|
|
730
|
+
},
|
|
731
|
+
{
|
|
732
|
+
key: "isPaused",
|
|
733
|
+
get: /**
|
|
734
|
+
Whether the queue is currently paused.
|
|
735
|
+
*/ function get() {
|
|
736
|
+
return __classPrivateFieldGet(this, _PQueue_isPaused, "f");
|
|
737
|
+
}
|
|
738
|
+
}
|
|
739
|
+
]);
|
|
740
|
+
return PQueue;
|
|
741
|
+
}(_eventemitter3.default);
|
|
742
|
+
_PQueue_carryoverConcurrencyCount = new WeakMap(), _PQueue_isIntervalIgnored = new WeakMap(), _PQueue_intervalCount = new WeakMap(), _PQueue_intervalCap = new WeakMap(), _PQueue_interval = new WeakMap(), _PQueue_intervalEnd = new WeakMap(), _PQueue_intervalId = new WeakMap(), _PQueue_timeoutId = new WeakMap(), _PQueue_queue = new WeakMap(), _PQueue_queueClass = new WeakMap(), _PQueue_pendingCount = new WeakMap(), _PQueue_concurrency = new WeakMap(), _PQueue_isPaused = new WeakMap(), _PQueue_throwOnTimeout = new WeakMap(), _PQueue_instances = new WeakSet(), _PQueue_doesIntervalAllowAnother_get = function _PQueue_doesIntervalAllowAnother_get() {
|
|
743
|
+
return __classPrivateFieldGet(this, _PQueue_isIntervalIgnored, "f") || __classPrivateFieldGet(this, _PQueue_intervalCount, "f") < __classPrivateFieldGet(this, _PQueue_intervalCap, "f");
|
|
744
|
+
}, _PQueue_doesConcurrentAllowAnother_get = function _PQueue_doesConcurrentAllowAnother_get() {
|
|
745
|
+
return __classPrivateFieldGet(this, _PQueue_pendingCount, "f") < __classPrivateFieldGet(this, _PQueue_concurrency, "f");
|
|
746
|
+
}, _PQueue_next = function _PQueue_next() {
|
|
747
|
+
var _a;
|
|
748
|
+
__classPrivateFieldSet(this, _PQueue_pendingCount, (_a = __classPrivateFieldGet(this, _PQueue_pendingCount, "f"), _a--, _a), "f");
|
|
749
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_tryToStartAnother).call(this);
|
|
750
|
+
this.emit("next");
|
|
751
|
+
}, _PQueue_emitEvents = function _PQueue_emitEvents() {
|
|
752
|
+
this.emit("empty");
|
|
753
|
+
if (__classPrivateFieldGet(this, _PQueue_pendingCount, "f") === 0) {
|
|
754
|
+
this.emit("idle");
|
|
755
|
+
}
|
|
756
|
+
}, _PQueue_onResumeInterval = function _PQueue_onResumeInterval() {
|
|
757
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_onInterval).call(this);
|
|
758
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_initializeIntervalIfNeeded).call(this);
|
|
759
|
+
__classPrivateFieldSet(this, _PQueue_timeoutId, undefined, "f");
|
|
760
|
+
}, _PQueue_isIntervalPaused_get = function _PQueue_isIntervalPaused_get() {
|
|
761
|
+
var _this = this;
|
|
762
|
+
var now = Date.now();
|
|
763
|
+
if (__classPrivateFieldGet(this, _PQueue_intervalId, "f") === undefined) {
|
|
764
|
+
var delay = __classPrivateFieldGet(this, _PQueue_intervalEnd, "f") - now;
|
|
765
|
+
if (delay < 0) {
|
|
766
|
+
// Act as the interval was done
|
|
767
|
+
// We don't need to resume it here because it will be resumed on line 160
|
|
768
|
+
__classPrivateFieldSet(this, _PQueue_intervalCount, __classPrivateFieldGet(this, _PQueue_carryoverConcurrencyCount, "f") ? __classPrivateFieldGet(this, _PQueue_pendingCount, "f") : 0, "f");
|
|
769
|
+
} else {
|
|
770
|
+
// Act as the interval is pending
|
|
771
|
+
if (__classPrivateFieldGet(this, _PQueue_timeoutId, "f") === undefined) {
|
|
772
|
+
__classPrivateFieldSet(this, _PQueue_timeoutId, setTimeout(function() {
|
|
773
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_onResumeInterval).call(_this);
|
|
774
|
+
}, delay), "f");
|
|
775
|
+
}
|
|
776
|
+
return true;
|
|
777
|
+
}
|
|
778
|
+
}
|
|
779
|
+
return false;
|
|
780
|
+
}, _PQueue_tryToStartAnother = function _PQueue_tryToStartAnother() {
|
|
781
|
+
if (__classPrivateFieldGet(this, _PQueue_queue, "f").size === 0) {
|
|
782
|
+
// We can clear the interval ("pause")
|
|
783
|
+
// Because we can redo it later ("resume")
|
|
784
|
+
if (__classPrivateFieldGet(this, _PQueue_intervalId, "f")) {
|
|
785
|
+
clearInterval(__classPrivateFieldGet(this, _PQueue_intervalId, "f"));
|
|
786
|
+
}
|
|
787
|
+
__classPrivateFieldSet(this, _PQueue_intervalId, undefined, "f");
|
|
788
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_emitEvents).call(this);
|
|
789
|
+
return false;
|
|
790
|
+
}
|
|
791
|
+
if (!__classPrivateFieldGet(this, _PQueue_isPaused, "f")) {
|
|
792
|
+
var canInitializeInterval = !__classPrivateFieldGet(this, _PQueue_instances, "a", _PQueue_isIntervalPaused_get);
|
|
793
|
+
if (__classPrivateFieldGet(this, _PQueue_instances, "a", _PQueue_doesIntervalAllowAnother_get) && __classPrivateFieldGet(this, _PQueue_instances, "a", _PQueue_doesConcurrentAllowAnother_get)) {
|
|
794
|
+
var job = __classPrivateFieldGet(this, _PQueue_queue, "f").dequeue();
|
|
795
|
+
if (!job) {
|
|
796
|
+
return false;
|
|
797
|
+
}
|
|
798
|
+
this.emit("active");
|
|
799
|
+
job();
|
|
800
|
+
if (canInitializeInterval) {
|
|
801
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_initializeIntervalIfNeeded).call(this);
|
|
802
|
+
}
|
|
803
|
+
return true;
|
|
804
|
+
}
|
|
805
|
+
}
|
|
806
|
+
return false;
|
|
807
|
+
}, _PQueue_initializeIntervalIfNeeded = function _PQueue_initializeIntervalIfNeeded() {
|
|
808
|
+
var _this = this;
|
|
809
|
+
if (__classPrivateFieldGet(this, _PQueue_isIntervalIgnored, "f") || __classPrivateFieldGet(this, _PQueue_intervalId, "f") !== undefined) {
|
|
810
|
+
return;
|
|
811
|
+
}
|
|
812
|
+
__classPrivateFieldSet(this, _PQueue_intervalId, setInterval(function() {
|
|
813
|
+
__classPrivateFieldGet(_this, _PQueue_instances, "m", _PQueue_onInterval).call(_this);
|
|
814
|
+
}, __classPrivateFieldGet(this, _PQueue_interval, "f")), "f");
|
|
815
|
+
__classPrivateFieldSet(this, _PQueue_intervalEnd, Date.now() + __classPrivateFieldGet(this, _PQueue_interval, "f"), "f");
|
|
816
|
+
}, _PQueue_onInterval = function _PQueue_onInterval() {
|
|
817
|
+
if (__classPrivateFieldGet(this, _PQueue_intervalCount, "f") === 0 && __classPrivateFieldGet(this, _PQueue_pendingCount, "f") === 0 && __classPrivateFieldGet(this, _PQueue_intervalId, "f")) {
|
|
818
|
+
clearInterval(__classPrivateFieldGet(this, _PQueue_intervalId, "f"));
|
|
819
|
+
__classPrivateFieldSet(this, _PQueue_intervalId, undefined, "f");
|
|
820
|
+
}
|
|
821
|
+
__classPrivateFieldSet(this, _PQueue_intervalCount, __classPrivateFieldGet(this, _PQueue_carryoverConcurrencyCount, "f") ? __classPrivateFieldGet(this, _PQueue_pendingCount, "f") : 0, "f");
|
|
822
|
+
__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_processQueue).call(this);
|
|
823
|
+
}, _PQueue_processQueue = function _PQueue_processQueue() {
|
|
824
|
+
// eslint-disable-next-line no-empty
|
|
825
|
+
while(__classPrivateFieldGet(this, _PQueue_instances, "m", _PQueue_tryToStartAnother).call(this)){}
|
|
826
|
+
}, _PQueue_onEvent = function() {
|
|
827
|
+
var __PQueue_onEvent = _asyncToGenerator(function(event, filter) {
|
|
828
|
+
var _this;
|
|
829
|
+
return __generator(this, function(_state) {
|
|
830
|
+
_this = this;
|
|
831
|
+
return [
|
|
832
|
+
2,
|
|
833
|
+
new Promise(function(resolve) {
|
|
834
|
+
var listener = function() {
|
|
835
|
+
if (filter && !filter()) {
|
|
836
|
+
return;
|
|
837
|
+
}
|
|
838
|
+
_this.off(event, listener);
|
|
839
|
+
resolve();
|
|
840
|
+
};
|
|
841
|
+
_this.on(event, listener);
|
|
842
|
+
})
|
|
843
|
+
];
|
|
844
|
+
});
|
|
845
|
+
});
|
|
846
|
+
function _PQueue_onEvent(event, filter) {
|
|
847
|
+
return __PQueue_onEvent.apply(this, arguments);
|
|
848
|
+
}
|
|
849
|
+
return _PQueue_onEvent;
|
|
850
|
+
}();
|