@tsdotnet/queue 1.3.0 → 1.3.2
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/LICENSE +21 -21
- package/README.md +11 -12
- package/dist/cjs/LinkQueue.js +2 -17
- package/dist/cjs/LinkQueue.js.map +1 -1
- package/dist/cjs/Queue.js +6 -26
- package/dist/cjs/Queue.js.map +1 -1
- package/dist/cjs/QueueBase.js +0 -53
- package/dist/cjs/QueueBase.js.map +1 -1
- package/dist/cjs/index.js +12 -0
- package/dist/cjs/index.js.map +1 -0
- package/dist/esm/LinkQueue.js +6 -18
- package/dist/esm/LinkQueue.js.map +1 -1
- package/dist/esm/Queue.js +10 -27
- package/dist/esm/Queue.js.map +1 -1
- package/dist/esm/QueueBase.js +7 -57
- package/dist/esm/QueueBase.js.map +1 -1
- package/dist/esm/index.js +8 -0
- package/dist/esm/index.js.map +1 -0
- package/dist/{LinkQueue.d.ts → types/LinkQueue.d.ts} +1 -16
- package/dist/{Queue.d.ts → types/Queue.d.ts} +1 -13
- package/dist/types/QueueBase.d.ts +27 -0
- package/dist/types/index.d.ts +5 -0
- package/package.json +38 -66
- package/dist/QueueBase.d.ts +0 -106
- package/dist/umd/LinkQueue.js +0 -117
- package/dist/umd/LinkQueue.js.map +0 -1
- package/dist/umd/Queue.js +0 -175
- package/dist/umd/Queue.js.map +0 -1
- package/dist/umd/QueueBase.js +0 -139
- package/dist/umd/QueueBase.js.map +0 -1
- package/eslint.config.mjs +0 -23
package/LICENSE
CHANGED
|
@@ -1,21 +1,21 @@
|
|
|
1
|
-
MIT License
|
|
2
|
-
|
|
3
|
-
Copyright (c) 2021 electricessence (Oren F.)
|
|
4
|
-
|
|
5
|
-
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
-
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
-
in the Software without restriction, including without limitation the rights
|
|
8
|
-
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
-
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
-
furnished to do so, subject to the following conditions:
|
|
11
|
-
|
|
12
|
-
The above copyright notice and this permission notice shall be included in all
|
|
13
|
-
copies or substantial portions of the Software.
|
|
14
|
-
|
|
15
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
-
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
-
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
-
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
-
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
-
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
-
SOFTWARE.
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2021 electricessence (Oren F.)
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/README.md
CHANGED
|
@@ -1,12 +1,11 @@
|
|
|
1
|
-
#  tsdotnet / queue
|
|
2
|
-
|
|
3
|
-
[](https://github.com/tsdotnet/queue/blob/master/LICENSE)
|
|
4
|
-

|
|
5
|
-

|
|
1
|
+
#  tsdotnet / queue
|
|
2
|
+
|
|
3
|
+
[](https://github.com/tsdotnet/queue/blob/master/LICENSE)
|
|
4
|
+

|
|
5
|
+
[](https://www.npmjs.com/package/@tsdotnet/queue)
|
|
6
|
+
|
|
7
|
+
A simple and fast FIFO collection for enqueuing and dequeuing items.
|
|
8
|
+
|
|
9
|
+
## Docs
|
|
10
|
+
|
|
11
|
+
[tsdotnet.github.io/queue](https://tsdotnet.github.io/queue/)
|
package/dist/cjs/LinkQueue.js
CHANGED
|
@@ -5,13 +5,8 @@
|
|
|
5
5
|
*/
|
|
6
6
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
7
7
|
const tslib_1 = require("tslib");
|
|
8
|
-
const
|
|
9
|
-
|
|
10
|
-
* A `LinkQueue<T>` will have different performance characteristics than a Queue using an array as its storage.
|
|
11
|
-
* Most cases will be served well by `Queue<T>`.
|
|
12
|
-
* `LinkQueue<T>` may outperform `Queue<T>` within a capacity range above 50 and below 50,000.
|
|
13
|
-
*/
|
|
14
|
-
class LinkQueue extends QueueBase_1.default {
|
|
8
|
+
const QueueBase_js_1 = tslib_1.__importDefault(require("./QueueBase.js"));
|
|
9
|
+
class LinkQueue extends QueueBase_js_1.default {
|
|
15
10
|
constructor(initialEntries) {
|
|
16
11
|
super();
|
|
17
12
|
this._root = {};
|
|
@@ -19,16 +14,9 @@ class LinkQueue extends QueueBase_1.default {
|
|
|
19
14
|
if (initialEntries)
|
|
20
15
|
this.enqueueMultiple(initialEntries);
|
|
21
16
|
}
|
|
22
|
-
/**
|
|
23
|
-
* Returns the number of items currently in the queue.
|
|
24
|
-
* @returns {number}
|
|
25
|
-
*/
|
|
26
17
|
getCount() {
|
|
27
18
|
return this._count;
|
|
28
19
|
}
|
|
29
|
-
/**
|
|
30
|
-
* Dequeues entries into an array.
|
|
31
|
-
*/
|
|
32
20
|
dump(max = Infinity) {
|
|
33
21
|
if (!this.count)
|
|
34
22
|
return [];
|
|
@@ -52,9 +40,6 @@ class LinkQueue extends QueueBase_1.default {
|
|
|
52
40
|
this.incrementVersion();
|
|
53
41
|
return result;
|
|
54
42
|
}
|
|
55
|
-
/**
|
|
56
|
-
* Clears the list.
|
|
57
|
-
*/
|
|
58
43
|
clear() {
|
|
59
44
|
const count = this._count;
|
|
60
45
|
this._root.next = undefined;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"LinkQueue.js","sourceRoot":"","sources":["../../src/LinkQueue.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,
|
|
1
|
+
{"version":3,"file":"LinkQueue.js","sourceRoot":"","sources":["../../src/LinkQueue.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,0EAAuC;AAOvC,MAAqB,SACpB,SAAQ,sBAAY;IAMpB,YAAa,cAAmC;QAE/C,KAAK,EAAE,CAAC;QAND,UAAK,GAAY,EAAE,CAAC;QAEpB,WAAM,GAAW,CAAC,CAAC;QAK1B,IAAG,cAAc;YAAE,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;IACzD,CAAC;IAMD,QAAQ;QAEP,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAKD,IAAI,CAAE,MAAc,QAAQ;QAE3B,IAAG,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAExB,IAAG,QAAQ,CAAC,GAAG,CAAC,EAChB,CAAC;YACA,OAAM,CAAC,IAAG,EAAE,GAAG,EACf,CAAC;gBACA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBACpB,IAAG,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC;oBAAE,MAAM;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACF,CAAC;aAED,CAAC;YACA,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,OAAM,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAClC,CAAC;gBACA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YACf,CAAC;QACF,CAAC;QAED,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAExB,OAAO,MAAM,CAAC;IACf,CAAC;IAKD,KAAK;QAEJ,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,OAAO,KAAK,CAAC;IACd,CAAC;IAES,gBAAgB;QAEzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAC1B,OAAO,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3D,CAAC;IAES,aAAa;;QAEtB,OAAO,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,0CAAE,KAAK,CAAC;IAC/B,CAAC;IAEQ,CAAE,YAAY;QAEtB,IAAI,OAAiC,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAE9D,OAAM,IAAI,EACV,CAAC;YACA,OAAO,GAAG,IAAI,CAAC;YACf,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YACpB,MAAM,OAAO,CAAC,KAAK,CAAC;QACrB,CAAC;IACF,CAAC;IAES,gBAAgB,CAAE,KAAQ;QAEnC,MAAM,OAAO,GAAG,EAAC,KAAK,EAAE,KAAK,EAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAG,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;;YACxB,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,MAAM,EAAE,CAAC;IACf,CAAC;IAEO,oBAAoB,CAAE,CAA2B;QAExD,IAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;QACzB,IAAG,CAAC,CAAC,IAAI;YAAE,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;;YACzB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAG,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;QACxB,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AA/GD,4BA+GC"}
|
package/dist/cjs/Queue.js
CHANGED
|
@@ -1,22 +1,16 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
/*
|
|
3
|
-
* @author electricessence / https://github.com/electricessence/
|
|
4
|
-
* @license MIT
|
|
5
|
-
* Based Upon: http://referencesource.microsoft.com/#System/CompMod/system/collections/generic/queue.cs
|
|
6
|
-
*/
|
|
7
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
8
3
|
const tslib_1 = require("tslib");
|
|
9
|
-
|
|
10
|
-
const QueueBase_1 = tslib_1.__importDefault(require("./QueueBase"));
|
|
4
|
+
const QueueBase_js_1 = tslib_1.__importDefault(require("./QueueBase.js"));
|
|
11
5
|
const MINIMUM_GROW = 4;
|
|
12
6
|
const DEFAULT_CAPACITY = 4;
|
|
13
7
|
const SHRINK_THRESHOLD = 42;
|
|
14
|
-
class Queue extends
|
|
8
|
+
class Queue extends QueueBase_js_1.default {
|
|
15
9
|
constructor(initialEntries) {
|
|
16
10
|
super();
|
|
17
|
-
this._head = 0;
|
|
18
|
-
this._tail = 0;
|
|
19
|
-
this._size = 0;
|
|
11
|
+
this._head = 0;
|
|
12
|
+
this._tail = 0;
|
|
13
|
+
this._size = 0;
|
|
20
14
|
if (!initialEntries)
|
|
21
15
|
this._array = new Array(DEFAULT_CAPACITY);
|
|
22
16
|
else {
|
|
@@ -36,9 +30,6 @@ class Queue extends QueueBase_1.default {
|
|
|
36
30
|
_.incrementVersion();
|
|
37
31
|
return size;
|
|
38
32
|
}
|
|
39
|
-
/**
|
|
40
|
-
* Dequeues entries into an array.
|
|
41
|
-
*/
|
|
42
33
|
dump(max = Infinity) {
|
|
43
34
|
const _ = this;
|
|
44
35
|
const result = new Array(Math.min(max, _._size));
|
|
@@ -72,12 +63,10 @@ class Queue extends QueueBase_1.default {
|
|
|
72
63
|
this._tail = 0;
|
|
73
64
|
return this;
|
|
74
65
|
}
|
|
75
|
-
// Special case where we can simply extend or shrink the length of the array.
|
|
76
66
|
if (head < tail && capacity >= tail) {
|
|
77
67
|
array.length = capacity;
|
|
78
68
|
return this;
|
|
79
69
|
}
|
|
80
|
-
// We create a new array because modifying an existing one could be slow.
|
|
81
70
|
const newArray = new Array(capacity);
|
|
82
71
|
let i, n = 0;
|
|
83
72
|
if (head < tail) {
|
|
@@ -96,11 +85,6 @@ class Queue extends QueueBase_1.default {
|
|
|
96
85
|
_.incrementVersion();
|
|
97
86
|
return this;
|
|
98
87
|
}
|
|
99
|
-
/**
|
|
100
|
-
* Checks to see if the queue has entries an pulls an entry from the head of the queue and passes it to the out handler.
|
|
101
|
-
* @param out The 'out' handler that receives the value if it exists.
|
|
102
|
-
* @returns {boolean} True if a value was retrieved. False if not.
|
|
103
|
-
*/
|
|
104
88
|
tryDequeue(out) {
|
|
105
89
|
const _ = this;
|
|
106
90
|
if (super.tryDequeue(out)) {
|
|
@@ -110,10 +94,6 @@ class Queue extends QueueBase_1.default {
|
|
|
110
94
|
}
|
|
111
95
|
return false;
|
|
112
96
|
}
|
|
113
|
-
/**
|
|
114
|
-
* Trims excess items in the underlying array.
|
|
115
|
-
* @param {number} threshold
|
|
116
|
-
*/
|
|
117
97
|
trimExcess(threshold) {
|
|
118
98
|
const _ = this;
|
|
119
99
|
const size = _._size;
|
|
@@ -141,7 +121,7 @@ class Queue extends QueueBase_1.default {
|
|
|
141
121
|
return undefined;
|
|
142
122
|
const array = this._array, head = this._head;
|
|
143
123
|
const removed = array[head];
|
|
144
|
-
array[head] = undefined;
|
|
124
|
+
array[head] = undefined;
|
|
145
125
|
this._head = (head + 1) % array.length;
|
|
146
126
|
this._size--;
|
|
147
127
|
return removed;
|
package/dist/cjs/Queue.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../../src/Queue.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../../src/Queue.ts"],"names":[],"mappings":";;;AAQA,0EAAuC;AAEvC,MAAM,YAAY,GAAW,CAAC,CAAC;AAC/B,MAAM,gBAAgB,GAAW,CAAC,CAAC;AACnC,MAAM,gBAAgB,GAAW,EAAE,CAAC;AAEpC,MAAqB,KACpB,SAAQ,sBAAY;IAQpB,YAAa,cAAoB;QAEhC,KAAK,EAAE,CAAC;QANC,UAAK,GAAW,CAAC,CAAC;QAClB,UAAK,GAAW,CAAC,CAAC;QAClB,UAAK,GAAW,CAAC,CAAC;QAM3B,IAAG,CAAC,cAAc;YACjB,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;aAE3C,CAAC;YACA,IAAI,CAAC,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC9C,CAAC;IACF,CAAC;IAED,QAAQ;QAEP,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,KAAK;QAEJ,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;QAC/B,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAEpB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAEZ,CAAC,CAAC,gBAAgB,EAAE,CAAC;QAErB,OAAO,IAAI,CAAC;IACb,CAAC;IAKD,IAAI,CAAE,MAAc,QAAQ;QAE3B,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAEtD,IAAG,QAAQ,CAAC,GAAG,CAAC,EAChB,CAAC;YACA,IAAG,GAAG,KAAG,CAAC,EACV,CAAC;gBACA,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,OAAM,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK;oBAAE,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,gBAAgB,EAAG,CAAC;YAC7D,CAAC;QACF,CAAC;aAED,CAAC;YACA,OAAM,CAAC,CAAC,KAAK;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,EAAG,CAAC,CAAC;QACnD,CAAC;QAED,CAAC,CAAC,gBAAgB,EAAE,CAAC;QAErB,OAAO,MAAM,CAAC;IACf,CAAC;IAED,WAAW,CAAE,QAAgB;QAE5B,IAAG,KAAK,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,IAAG,QAAQ,GAAC,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC;QAEf,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3C,IAAG,QAAQ,IAAE,GAAG;YACf,OAAO,IAAI,CAAC;QAEb,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;QAErD,IAAG,CAAC,IAAI,EACR,CAAC;YACA,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACf,OAAO,IAAI,CAAC;QACb,CAAC;QAGD,IAAG,IAAI,GAAC,IAAI,IAAI,QAAQ,IAAE,IAAI,EAC9B,CAAC;YACA,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACxB,OAAO,IAAI,CAAC;QACb,CAAC;QAGD,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAI,QAAQ,CAAC,CAAC;QACxC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACb,IAAG,IAAI,GAAC,IAAI,EACZ,CAAC;YACA,KAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAC,IAAI,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACtD,CAAC;aAED,CAAC;YACA,KAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpD,KAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAC,IAAI,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACnD,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QACvB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,IAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEtC,CAAC,CAAC,gBAAgB,EAAE,CAAC;QAErB,OAAO,IAAI,CAAC;IACb,CAAC;IAOD,UAAU,CAAE,GAAuB;QAElC,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,IAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EACxB,CAAC;YACA,IAAG,CAAC,CAAC,KAAK,GAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAC,CAAC;gBAC3B,CAAC,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;YAChC,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAMD,UAAU,CAAE,SAAkB;QAE7B,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;QACrB,IAAG,IAAI,GAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAC,GAAG,CAAC,IAAI,CAAC,CAAC,SAAS,IAAI,SAAS,KAAG,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,SAAS,GAAC,IAAI,CAAC;YAC7G,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAES,gBAAgB,CAAE,IAAO;QAElC,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;QACrB,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC1B,IAAG,IAAI,KAAG,GAAG,EACb,CAAC;YACA,IAAI,WAAW,GAAG,GAAG,GAAC,CAAC,CAAC;YACxB,IAAG,WAAW,GAAC,GAAG,GAAG,YAAY;gBAChC,WAAW,GAAG,GAAG,GAAG,YAAY,CAAC;YAElC,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;YAC3B,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,GAAC,GAAG,CAAC;QACzB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACtB,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC;QACzB,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IACpB,CAAC;IAES,gBAAgB;QAEzB,IAAG,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,GAAG,SAAgB,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAC,KAAK,CAAC,MAAM,CAAC;QACrC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,OAAO,CAAC;IAChB,CAAC;IAES,aAAa;QAEtB,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;IAEQ,CAAE,YAAY;QAEtB,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,GAAW,CAAC,CAAC,KAAK,CAAC;QACvC,KAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAC,IAAI,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC;IACrD,CAAC;IAEO,WAAW,CAAE,KAAa;QAEjC,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QAC7B,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;CACD;AAlMD,wBAkMC"}
|
package/dist/cjs/QueueBase.js
CHANGED
|
@@ -7,35 +7,17 @@ Object.defineProperty(exports, "__esModule", { value: true });
|
|
|
7
7
|
const collection_base_1 = require("@tsdotnet/collection-base");
|
|
8
8
|
const exceptions_1 = require("@tsdotnet/exceptions");
|
|
9
9
|
class QueueBase extends collection_base_1.IterableCollectionBase {
|
|
10
|
-
/**
|
|
11
|
-
* The number of items currently in the queue.
|
|
12
|
-
* @returns {number}
|
|
13
|
-
*/
|
|
14
10
|
get count() {
|
|
15
11
|
return this.getCount();
|
|
16
12
|
}
|
|
17
|
-
/**
|
|
18
|
-
* Returns true if the queue is empty.
|
|
19
|
-
* @return {boolean}
|
|
20
|
-
*/
|
|
21
13
|
get isEmpty() {
|
|
22
14
|
return this.getCount() === 0;
|
|
23
15
|
}
|
|
24
|
-
/**
|
|
25
|
-
* Adds an item to the end of the queue.
|
|
26
|
-
* @param value
|
|
27
|
-
* @returns {this}
|
|
28
|
-
*/
|
|
29
16
|
enqueue(value) {
|
|
30
17
|
this._enqueueInternal(value);
|
|
31
18
|
this.incrementVersion();
|
|
32
19
|
return this;
|
|
33
20
|
}
|
|
34
|
-
/**
|
|
35
|
-
* Adds items to the end of the queue.
|
|
36
|
-
* @param {Iterable} values
|
|
37
|
-
* @returns {this}
|
|
38
|
-
*/
|
|
39
21
|
enqueueMultiple(values) {
|
|
40
22
|
if (!values)
|
|
41
23
|
return this;
|
|
@@ -48,20 +30,10 @@ class QueueBase extends collection_base_1.IterableCollectionBase {
|
|
|
48
30
|
this.incrementVersion();
|
|
49
31
|
return this;
|
|
50
32
|
}
|
|
51
|
-
/**
|
|
52
|
-
* Adds items to the end of the queue.
|
|
53
|
-
* @param values
|
|
54
|
-
* @returns {this}
|
|
55
|
-
*/
|
|
56
33
|
enqueueThese(...values) {
|
|
57
34
|
return this.enqueueMultiple(values);
|
|
58
35
|
}
|
|
59
|
-
/**
|
|
60
|
-
* Produces an iterable that dequeues items when iterated. Stops when empty.
|
|
61
|
-
* @return {Iterable}
|
|
62
|
-
*/
|
|
63
36
|
consumer() {
|
|
64
|
-
// eslint-disable-next-line @typescript-eslint/no-this-alias
|
|
65
37
|
const _ = this;
|
|
66
38
|
return {
|
|
67
39
|
*[Symbol.iterator]() {
|
|
@@ -71,12 +43,6 @@ class QueueBase extends collection_base_1.IterableCollectionBase {
|
|
|
71
43
|
}
|
|
72
44
|
};
|
|
73
45
|
}
|
|
74
|
-
/**
|
|
75
|
-
* Pulls an entry from the head of the queue and returns it.
|
|
76
|
-
* Returns undefined if the queue is already empty and throwIfEmpty is false.
|
|
77
|
-
* @throws {InvalidOperationException} If the queue is already empty and throwIfEmpty is true.
|
|
78
|
-
* @param throwIfEmpty
|
|
79
|
-
*/
|
|
80
46
|
dequeue(throwIfEmpty = false) {
|
|
81
47
|
if (throwIfEmpty && this.isEmpty)
|
|
82
48
|
throw new exceptions_1.InvalidOperationException('Cannot dequeue an empty queue.');
|
|
@@ -84,12 +50,6 @@ class QueueBase extends collection_base_1.IterableCollectionBase {
|
|
|
84
50
|
this.incrementVersion();
|
|
85
51
|
return item;
|
|
86
52
|
}
|
|
87
|
-
/**
|
|
88
|
-
* Checks to see if the queue has entries an pulls an entry from the head of the queue and passes it to the out handler.
|
|
89
|
-
* @throws {ArgumentNullException} If no out delegate was specified.
|
|
90
|
-
* @param out The 'out' handler that receives the value if it exists.
|
|
91
|
-
* @returns {boolean} True if a value was retrieved. False if not.
|
|
92
|
-
*/
|
|
93
53
|
tryDequeue(out) {
|
|
94
54
|
if (!out)
|
|
95
55
|
throw new exceptions_1.ArgumentNullException('out');
|
|
@@ -100,27 +60,14 @@ class QueueBase extends collection_base_1.IterableCollectionBase {
|
|
|
100
60
|
out(item);
|
|
101
61
|
return true;
|
|
102
62
|
}
|
|
103
|
-
/**
|
|
104
|
-
* Returns the entry at the head of the queue.
|
|
105
|
-
* Returns undefined if the queue is already empty and throwIfEmpty is false.
|
|
106
|
-
* @throws {InvalidOperationException} If the queue is already empty and throwIfEmpty is true.
|
|
107
|
-
* @param {boolean} throwIfEmpty
|
|
108
|
-
* @return {T | undefined}
|
|
109
|
-
*/
|
|
110
63
|
peek(throwIfEmpty = false) {
|
|
111
64
|
if (throwIfEmpty && this.isEmpty)
|
|
112
65
|
throw new exceptions_1.InvalidOperationException('Cannot call peek on an empty queue.');
|
|
113
66
|
return this._peekInternal();
|
|
114
67
|
}
|
|
115
|
-
/**
|
|
116
|
-
* Clears the list.
|
|
117
|
-
*/
|
|
118
68
|
dispose() {
|
|
119
69
|
this.clear();
|
|
120
70
|
}
|
|
121
|
-
/**
|
|
122
|
-
* Clears the list.
|
|
123
|
-
*/
|
|
124
71
|
recycle() {
|
|
125
72
|
this.clear();
|
|
126
73
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"QueueBase.js","sourceRoot":"","sources":["../../src/QueueBase.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,+DAAiE;AACjE,qDAAsF;AAEtF,MAA8B,SAC7B,SAAQ,wCAAyB;
|
|
1
|
+
{"version":3,"file":"QueueBase.js","sourceRoot":"","sources":["../../src/QueueBase.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,+DAAiE;AACjE,qDAAsF;AAEtF,MAA8B,SAC7B,SAAQ,wCAAyB;IAMjC,IAAI,KAAK;QAER,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IACxB,CAAC;IAMD,IAAI,OAAO;QAEV,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAG,CAAC,CAAC;IAC5B,CAAC;IAOD,OAAO,CAAE,KAAQ;QAEhB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACb,CAAC;IAOD,eAAe,CAAE,MAAmB;QAEnC,IAAG,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACxB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAI,MAAM,CAAC,IAAI,MAAM,EACrB,CAAC;YACA,SAAS,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,IAAG,SAAS;YAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtC,OAAO,IAAI,CAAC;IACb,CAAC;IAOD,YAAY,CAAE,GAAG,MAAW;QAE3B,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAMD,QAAQ;QAGP,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,OAAO;YACN,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAElB,OAAM,CAAC,CAAC,QAAQ,EAAE,EAClB,CAAC;oBACA,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACF,CAAC;SACD,CAAC;IACH,CAAC;IA8BD,OAAO,CAAE,eAAwB,KAAK;QAErC,IAAG,YAAY,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,sCAAyB,CAAC,gCAAgC,CAAC,CAAC;QACvG,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAG,CAAC;QACtC,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACb,CAAC;IAQD,UAAU,CAAE,GAA0B;QAErC,IAAG,CAAC,GAAG;YAAE,MAAM,IAAI,kCAAqB,CAAC,KAAK,CAAC,CAAC;QAChD,IAAG,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAG,CAAC;QACtC,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,GAAG,CAAC,IAAI,CAAC,CAAC;QACV,OAAO,IAAI,CAAC;IACb,CAAC;IA+BD,IAAI,CAAE,eAAwB,KAAK;QAElC,IAAG,YAAY,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,sCAAyB,CAAC,qCAAqC,CAAC,CAAC;QAC5G,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC;IAC7B,CAAC;IAiBD,OAAO;QAEN,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;IAKD,OAAO;QAEN,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;CAOD;AAxMD,4BAwMC"}
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.QueueBase = exports.LinkQueue = exports.Queue = void 0;
|
|
4
|
+
const tslib_1 = require("tslib");
|
|
5
|
+
const Queue_js_1 = tslib_1.__importDefault(require("./Queue.js"));
|
|
6
|
+
exports.Queue = Queue_js_1.default;
|
|
7
|
+
var LinkQueue_js_1 = require("./LinkQueue.js");
|
|
8
|
+
Object.defineProperty(exports, "LinkQueue", { enumerable: true, get: function () { return tslib_1.__importDefault(LinkQueue_js_1).default; } });
|
|
9
|
+
var QueueBase_js_1 = require("./QueueBase.js");
|
|
10
|
+
Object.defineProperty(exports, "QueueBase", { enumerable: true, get: function () { return tslib_1.__importDefault(QueueBase_js_1).default; } });
|
|
11
|
+
exports.default = Queue_js_1.default;
|
|
12
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;AAAA,kEAA+B;AACtB,gBADF,kBAAK,CACE;AACd,+CAAsD;AAA7C,kIAAA,OAAO,OAAa;AAC7B,+CAAsD;AAA7C,kIAAA,OAAO,OAAa;AAC7B,kBAAe,kBAAK,CAAC"}
|
package/dist/esm/LinkQueue.js
CHANGED
|
@@ -1,14 +1,10 @@
|
|
|
1
|
+
import QueueBase from './QueueBase.js';
|
|
2
|
+
|
|
1
3
|
/*!
|
|
2
4
|
* @author electricessence / https://github.com/electricessence/
|
|
3
5
|
* @license MIT
|
|
4
6
|
*/
|
|
5
|
-
|
|
6
|
-
/**
|
|
7
|
-
* A `LinkQueue<T>` will have different performance characteristics than a Queue using an array as its storage.
|
|
8
|
-
* Most cases will be served well by `Queue<T>`.
|
|
9
|
-
* `LinkQueue<T>` may outperform `Queue<T>` within a capacity range above 50 and below 50,000.
|
|
10
|
-
*/
|
|
11
|
-
export default class LinkQueue extends QueueBase {
|
|
7
|
+
class LinkQueue extends QueueBase {
|
|
12
8
|
_root = {};
|
|
13
9
|
_tail;
|
|
14
10
|
_count = 0;
|
|
@@ -17,16 +13,9 @@ export default class LinkQueue extends QueueBase {
|
|
|
17
13
|
if (initialEntries)
|
|
18
14
|
this.enqueueMultiple(initialEntries);
|
|
19
15
|
}
|
|
20
|
-
/**
|
|
21
|
-
* Returns the number of items currently in the queue.
|
|
22
|
-
* @returns {number}
|
|
23
|
-
*/
|
|
24
16
|
getCount() {
|
|
25
17
|
return this._count;
|
|
26
18
|
}
|
|
27
|
-
/**
|
|
28
|
-
* Dequeues entries into an array.
|
|
29
|
-
*/
|
|
30
19
|
dump(max = Infinity) {
|
|
31
20
|
if (!this.count)
|
|
32
21
|
return [];
|
|
@@ -50,9 +39,6 @@ export default class LinkQueue extends QueueBase {
|
|
|
50
39
|
this.incrementVersion();
|
|
51
40
|
return result;
|
|
52
41
|
}
|
|
53
|
-
/**
|
|
54
|
-
* Clears the list.
|
|
55
|
-
*/
|
|
56
42
|
clear() {
|
|
57
43
|
const count = this._count;
|
|
58
44
|
this._root.next = undefined;
|
|
@@ -100,4 +86,6 @@ export default class LinkQueue extends QueueBase {
|
|
|
100
86
|
return true;
|
|
101
87
|
}
|
|
102
88
|
}
|
|
103
|
-
|
|
89
|
+
|
|
90
|
+
export { LinkQueue as default };
|
|
91
|
+
//# sourceMappingURL=LinkQueue.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"LinkQueue.js","
|
|
1
|
+
{"version":3,"file":"LinkQueue.js","sources":["../../../src/LinkQueue.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAAA;;;AAGG;AASW,MAAO,SACpB,SAAQ,SAAY,CAAA;IAEZ,KAAK,GAAY,EAAE;AACnB,IAAA,KAAK;IACL,MAAM,GAAW,CAAC;AAE1B,IAAA,WAAA,CAAa,cAAmC,EAAA;AAE/C,QAAA,KAAK,EAAE;AACP,QAAA,IAAG,cAAc;AAAE,YAAA,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;IACxD;IAMA,QAAQ,GAAA;QAEP,OAAO,IAAI,CAAC,MAAM;IACnB;IAKA,IAAI,CAAE,MAAc,QAAQ,EAAA;QAE3B,IAAG,CAAC,IAAI,CAAC,KAAK;AAAE,YAAA,OAAO,EAAE;QACzB,MAAM,MAAM,GAAQ,EAAE;AACtB,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;AAEvB,QAAA,IAAG,QAAQ,CAAC,GAAG,CAAC,EAChB;AACC,YAAA,OAAM,CAAC,IAAG,EAAE,GAAG,EACf;AACC,gBAAA,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI;AACnB,gBAAA,IAAG,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC;oBAAE;AAClC,gBAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YACrB;QACD;aAEA;AACC,YAAA,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI;AACjB,YAAA,OAAM,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAClC;AACC,gBAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACpB,gBAAA,CAAC,GAAG,IAAI,CAAC,IAAI;YACd;QACD;QAEA,IAAI,CAAC,gBAAgB,EAAE;AAEvB,QAAA,OAAO,MAAM;IACd;IAKA,KAAK,GAAA;AAEJ,QAAA,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM;AACzB,QAAA,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,SAAS;AAC3B,QAAA,IAAI,CAAC,KAAK,GAAG,SAAS;AACtB,QAAA,IAAI,CAAC,MAAM,GAAG,CAAC;AACf,QAAA,OAAO,KAAK;IACb;IAEU,gBAAgB,GAAA;AAEzB,QAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI;AACzB,QAAA,OAAO,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,SAAS;IAC1D;IAEU,aAAa,GAAA;AAEtB,QAAA,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK;IAC9B;AAES,IAAA,CAAE,YAAY,GAAA;QAEtB,IAAI,OAAiC,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI;QAE7D,OAAM,IAAI,EACV;YACC,OAAO,GAAG,IAAI;AACd,YAAA,IAAI,GAAG,OAAO,CAAC,IAAI;YACnB,MAAM,OAAO,CAAC,KAAK;QACpB;IACD;AAEU,IAAA,gBAAgB,CAAE,KAAQ,EAAA;AAEnC,QAAA,MAAM,OAAO,GAAG,EAAC,KAAK,EAAE,KAAK,EAAC;AAC9B,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;AACvB,QAAA,IAAG,IAAI;AAAE,YAAA,IAAI,CAAC,IAAI,GAAG,OAAO;;AACvB,YAAA,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,OAAO;AAC9B,QAAA,IAAI,CAAC,KAAK,GAAG,OAAO;QACpB,IAAI,CAAC,MAAM,EAAE;IACd;AAEQ,IAAA,oBAAoB,CAAE,CAA2B,EAAA;AAExD,QAAA,IAAG,CAAC,CAAC;AAAE,YAAA,OAAO,KAAK;QACnB,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACxB,IAAG,CAAC,CAAC,IAAI;AAAE,YAAA,CAAC,CAAC,IAAI,GAAG,SAAS;;AACxB,YAAA,IAAI,CAAC,KAAK,GAAG,SAAS;AAC3B,QAAA,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM;AACzB,QAAA,IAAG,CAAC,KAAK;AAAE,YAAA,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC;AACzD,QAAA,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC;AACvB,QAAA,OAAO,IAAI;IACZ;AACA;;;;"}
|
package/dist/esm/Queue.js
CHANGED
|
@@ -1,18 +1,13 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
* @license MIT
|
|
4
|
-
* Based Upon: http://referencesource.microsoft.com/#System/CompMod/system/collections/generic/queue.cs
|
|
5
|
-
*/
|
|
6
|
-
/* eslint-disable @typescript-eslint/no-this-alias */
|
|
7
|
-
import QueueBase from './QueueBase';
|
|
1
|
+
import QueueBase from './QueueBase.js';
|
|
2
|
+
|
|
8
3
|
const MINIMUM_GROW = 4;
|
|
9
4
|
const DEFAULT_CAPACITY = 4;
|
|
10
5
|
const SHRINK_THRESHOLD = 42;
|
|
11
|
-
|
|
6
|
+
class Queue extends QueueBase {
|
|
12
7
|
_array;
|
|
13
|
-
_head = 0;
|
|
14
|
-
_tail = 0;
|
|
15
|
-
_size = 0;
|
|
8
|
+
_head = 0;
|
|
9
|
+
_tail = 0;
|
|
10
|
+
_size = 0;
|
|
16
11
|
constructor(initialEntries) {
|
|
17
12
|
super();
|
|
18
13
|
if (!initialEntries)
|
|
@@ -34,9 +29,6 @@ export default class Queue extends QueueBase {
|
|
|
34
29
|
_.incrementVersion();
|
|
35
30
|
return size;
|
|
36
31
|
}
|
|
37
|
-
/**
|
|
38
|
-
* Dequeues entries into an array.
|
|
39
|
-
*/
|
|
40
32
|
dump(max = Infinity) {
|
|
41
33
|
const _ = this;
|
|
42
34
|
const result = new Array(Math.min(max, _._size));
|
|
@@ -70,12 +62,10 @@ export default class Queue extends QueueBase {
|
|
|
70
62
|
this._tail = 0;
|
|
71
63
|
return this;
|
|
72
64
|
}
|
|
73
|
-
// Special case where we can simply extend or shrink the length of the array.
|
|
74
65
|
if (head < tail && capacity >= tail) {
|
|
75
66
|
array.length = capacity;
|
|
76
67
|
return this;
|
|
77
68
|
}
|
|
78
|
-
// We create a new array because modifying an existing one could be slow.
|
|
79
69
|
const newArray = new Array(capacity);
|
|
80
70
|
let i, n = 0;
|
|
81
71
|
if (head < tail) {
|
|
@@ -94,11 +84,6 @@ export default class Queue extends QueueBase {
|
|
|
94
84
|
_.incrementVersion();
|
|
95
85
|
return this;
|
|
96
86
|
}
|
|
97
|
-
/**
|
|
98
|
-
* Checks to see if the queue has entries an pulls an entry from the head of the queue and passes it to the out handler.
|
|
99
|
-
* @param out The 'out' handler that receives the value if it exists.
|
|
100
|
-
* @returns {boolean} True if a value was retrieved. False if not.
|
|
101
|
-
*/
|
|
102
87
|
tryDequeue(out) {
|
|
103
88
|
const _ = this;
|
|
104
89
|
if (super.tryDequeue(out)) {
|
|
@@ -108,10 +93,6 @@ export default class Queue extends QueueBase {
|
|
|
108
93
|
}
|
|
109
94
|
return false;
|
|
110
95
|
}
|
|
111
|
-
/**
|
|
112
|
-
* Trims excess items in the underlying array.
|
|
113
|
-
* @param {number} threshold
|
|
114
|
-
*/
|
|
115
96
|
trimExcess(threshold) {
|
|
116
97
|
const _ = this;
|
|
117
98
|
const size = _._size;
|
|
@@ -139,7 +120,7 @@ export default class Queue extends QueueBase {
|
|
|
139
120
|
return undefined;
|
|
140
121
|
const array = this._array, head = this._head;
|
|
141
122
|
const removed = array[head];
|
|
142
|
-
array[head] = undefined;
|
|
123
|
+
array[head] = undefined;
|
|
143
124
|
this._head = (head + 1) % array.length;
|
|
144
125
|
this._size--;
|
|
145
126
|
return removed;
|
|
@@ -158,4 +139,6 @@ export default class Queue extends QueueBase {
|
|
|
158
139
|
return _._size ? a[(_._head + index) % a.length] : undefined;
|
|
159
140
|
}
|
|
160
141
|
}
|
|
161
|
-
|
|
142
|
+
|
|
143
|
+
export { Queue as default };
|
|
144
|
+
//# sourceMappingURL=Queue.js.map
|
package/dist/esm/Queue.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"Queue.js","
|
|
1
|
+
{"version":3,"file":"Queue.js","sources":["../../../src/Queue.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAUA,MAAM,YAAY,GAAW,CAAC;AAC9B,MAAM,gBAAgB,GAAW,CAAC;AAClC,MAAM,gBAAgB,GAAW,EAAE;AAErB,MAAO,KACpB,SAAQ,SAAY,CAAA;AAGV,IAAA,MAAM;IACN,KAAK,GAAW,CAAC;IACjB,KAAK,GAAW,CAAC;IACjB,KAAK,GAAW,CAAC;AAE3B,IAAA,WAAA,CAAa,cAAoB,EAAA;AAEhC,QAAA,KAAK,EAAE;AAEP,QAAA,IAAG,CAAC,cAAc;YACjB,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,gBAAgB,CAAC;aAE1C;AACC,YAAA,IAAI,CAAC,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE;AACpC,YAAA,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;QAC7C;IACD;IAEA,QAAQ,GAAA;QAEP,OAAO,IAAI,CAAC,KAAK;IAClB;IAEA,KAAK,GAAA;QAEJ,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK;AAC9B,QAAA,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;AAEnB,QAAA,CAAC,CAAC,KAAK,GAAG,CAAC;AACX,QAAA,CAAC,CAAC,KAAK,GAAG,CAAC;AACX,QAAA,CAAC,CAAC,KAAK,GAAG,CAAC;QAEX,CAAC,CAAC,gBAAgB,EAAE;AAEpB,QAAA,OAAO,IAAI;IACZ;IAKA,IAAI,CAAE,MAAc,QAAQ,EAAA;QAE3B,MAAM,CAAC,GAAG,IAAI;AACd,QAAA,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAErD,QAAA,IAAG,QAAQ,CAAC,GAAG,CAAC,EAChB;AACC,YAAA,IAAG,GAAG,KAAG,CAAC,EACV;gBACC,IAAI,CAAC,GAAG,CAAC;AACT,gBAAA,OAAM,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK;oBAAE,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,gBAAgB,EAAG;YAC5D;QACD;aAEA;YACC,OAAM,CAAC,CAAC,KAAK;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,EAAG,CAAC;QAClD;QAEA,CAAC,CAAC,gBAAgB,EAAE;AAEpB,QAAA,OAAO,MAAM;IACd;AAEA,IAAA,WAAW,CAAE,QAAgB,EAAA;QAE5B,IAAG,KAAK,CAAC,QAAQ,CAAC;AAAE,YAAA,OAAO,IAAI;QAC/B,IAAG,QAAQ,GAAC,CAAC;YAAE,QAAQ,GAAG,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI;QAEd,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM;QAC1C,IAAG,QAAQ,IAAE,GAAG;AACf,YAAA,OAAO,IAAI;AAEZ,QAAA,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK;QAEpD,IAAG,CAAC,IAAI,EACR;AACC,YAAA,KAAK,CAAC,MAAM,GAAG,QAAQ;AACvB,YAAA,IAAI,CAAC,KAAK,GAAG,CAAC;AACd,YAAA,IAAI,CAAC,KAAK,GAAG,CAAC;AACd,YAAA,OAAO,IAAI;QACZ;QAGA,IAAG,IAAI,GAAC,IAAI,IAAI,QAAQ,IAAE,IAAI,EAC9B;AACC,YAAA,KAAK,CAAC,MAAM,GAAG,QAAQ;AACvB,YAAA,OAAO,IAAI;QACZ;AAGA,QAAA,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAI,QAAQ,CAAC;AACvC,QAAA,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;AACZ,QAAA,IAAG,IAAI,GAAC,IAAI,EACZ;YACC,KAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAC,IAAI,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE;QACrD;aAEA;YACC,KAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE;YACnD,KAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAC,IAAI,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE;QAClD;AAEA,QAAA,IAAI,CAAC,MAAM,GAAG,QAAQ;AACtB,QAAA,CAAC,CAAC,KAAK,GAAG,CAAC;AACX,QAAA,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,IAAE,QAAQ,IAAI,CAAC,GAAG,IAAI;QAErC,CAAC,CAAC,gBAAgB,EAAE;AAEpB,QAAA,OAAO,IAAI;IACZ;AAOA,IAAA,UAAU,CAAE,GAAuB,EAAA;QAElC,MAAM,CAAC,GAAG,IAAI;AACd,QAAA,IAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EACxB;YACC,IAAG,CAAC,CAAC,KAAK,GAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAC,CAAC;AAC3B,gBAAA,CAAC,CAAC,UAAU,CAAC,gBAAgB,CAAC;AAC/B,YAAA,OAAO,IAAI;QACZ;AACA,QAAA,OAAO,KAAK;IACb;AAMA,IAAA,UAAU,CAAE,SAAkB,EAAA;QAE7B,MAAM,CAAC,GAAG,IAAI;AACd,QAAA,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK;AACpB,QAAA,IAAG,IAAI,GAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAC,GAAG,CAAC,KAAK,CAAC,SAAS,IAAI,SAAS,KAAG,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,SAAS,GAAC,IAAI,CAAC;AAC7G,YAAA,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC;IACrB;AAEU,IAAA,gBAAgB,CAAE,IAAO,EAAA;QAElC,MAAM,CAAC,GAAG,IAAI;AACd,QAAA,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK;AACpB,QAAA,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM;AACzB,QAAA,IAAG,IAAI,KAAG,GAAG,EACb;AACC,YAAA,IAAI,WAAW,GAAG,GAAG,GAAC,CAAC;AACvB,YAAA,IAAG,WAAW,GAAC,GAAG,GAAG,YAAY;AAChC,gBAAA,WAAW,GAAG,GAAG,GAAG,YAAY;AAEjC,YAAA,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC;AAC1B,YAAA,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM;QACtB;AAEA,QAAA,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,GAAC,GAAG;AACxB,QAAA,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI;QACrB,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,IAAE,GAAG;AACxB,QAAA,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC;IACnB;IAEU,gBAAgB,GAAA;QAEzB,IAAG,CAAC,IAAI,CAAC,KAAK;AAAE,YAAA,OAAO,SAAS;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK;AAC5C,QAAA,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC;AAC3B,QAAA,KAAK,CAAC,IAAI,CAAC,GAAG,SAAgB;AAC9B,QAAA,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,IAAE,KAAK,CAAC,MAAM;QACpC,IAAI,CAAC,KAAK,EAAE;AACZ,QAAA,OAAO,OAAO;IACf;IAEU,aAAa,GAAA;QAEtB,MAAM,CAAC,GAAG,IAAI;AACd,QAAA,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS;IAC/C;AAES,IAAA,CAAE,YAAY,GAAA;QAEtB,MAAM,CAAC,GAAG,IAAI,EAAE,IAAI,GAAW,CAAC,CAAC,KAAK;QACtC,KAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAC,IAAI,EAAE,CAAC,EAAE;AAAE,YAAA,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAE;IACpD;AAEQ,IAAA,WAAW,CAAE,KAAa,EAAA;QAEjC,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM;QAC5B,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,IAAE,CAAC,CAAC,MAAM,CAAC,GAAG,SAAS;IAC3D;AACA;;;;"}
|