data-structure-typed 1.34.8 → 1.35.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/.eslintrc.js +1 -0
- package/.github/ISSUE_TEMPLATE/bug_report.md +38 -0
- package/.github/ISSUE_TEMPLATE/custom.md +10 -0
- package/.github/ISSUE_TEMPLATE/feature_request.md +20 -0
- package/CHANGELOG.md +1 -1
- package/CONTRIBUTING.md +0 -0
- package/README.md +8 -8
- package/dist/data-structures/binary-tree/aa-tree.js +2 -5
- package/dist/data-structures/binary-tree/aa-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/abstract-binary-tree.js +280 -423
- package/dist/data-structures/binary-tree/abstract-binary-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/avl-tree.js +63 -89
- package/dist/data-structures/binary-tree/avl-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/b-tree.js +2 -5
- package/dist/data-structures/binary-tree/b-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/binary-indexed-tree.js +17 -22
- package/dist/data-structures/binary-tree/binary-indexed-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/binary-tree.js +11 -30
- package/dist/data-structures/binary-tree/binary-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/bst.js +127 -214
- package/dist/data-structures/binary-tree/bst.js.map +1 -1
- package/dist/data-structures/binary-tree/rb-tree.js +19 -43
- package/dist/data-structures/binary-tree/rb-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/segment-tree.js +80 -122
- package/dist/data-structures/binary-tree/segment-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/splay-tree.js +2 -5
- package/dist/data-structures/binary-tree/splay-tree.js.map +1 -1
- package/dist/data-structures/binary-tree/tree-multiset.js +147 -218
- package/dist/data-structures/binary-tree/tree-multiset.js.map +1 -1
- package/dist/data-structures/binary-tree/two-three-tree.js +2 -5
- package/dist/data-structures/binary-tree/two-three-tree.js.map +1 -1
- package/dist/data-structures/graph/abstract-graph.js +338 -572
- package/dist/data-structures/graph/abstract-graph.js.map +1 -1
- package/dist/data-structures/graph/directed-graph.js +145 -275
- package/dist/data-structures/graph/directed-graph.js.map +1 -1
- package/dist/data-structures/graph/map-graph.js +46 -87
- package/dist/data-structures/graph/map-graph.js.map +1 -1
- package/dist/data-structures/graph/undirected-graph.js +90 -179
- package/dist/data-structures/graph/undirected-graph.js.map +1 -1
- package/dist/data-structures/hash/coordinate-map.js +23 -45
- package/dist/data-structures/hash/coordinate-map.js.map +1 -1
- package/dist/data-structures/hash/coordinate-set.js +20 -42
- package/dist/data-structures/hash/coordinate-set.js.map +1 -1
- package/dist/data-structures/hash/hash-map.js +85 -247
- package/dist/data-structures/hash/hash-map.js.map +1 -1
- package/dist/data-structures/hash/hash-table.js +87 -128
- package/dist/data-structures/hash/hash-table.js.map +1 -1
- package/dist/data-structures/hash/pair.js +2 -5
- package/dist/data-structures/hash/pair.js.map +1 -1
- package/dist/data-structures/hash/tree-map.js +2 -5
- package/dist/data-structures/hash/tree-map.js.map +1 -1
- package/dist/data-structures/hash/tree-set.js +2 -5
- package/dist/data-structures/hash/tree-set.js.map +1 -1
- package/dist/data-structures/heap/heap.js +56 -80
- package/dist/data-structures/heap/heap.js.map +1 -1
- package/dist/data-structures/heap/max-heap.js +8 -26
- package/dist/data-structures/heap/max-heap.js.map +1 -1
- package/dist/data-structures/heap/min-heap.js +8 -26
- package/dist/data-structures/heap/min-heap.js.map +1 -1
- package/dist/data-structures/linked-list/doubly-linked-list.js +149 -218
- package/dist/data-structures/linked-list/doubly-linked-list.js.map +1 -1
- package/dist/data-structures/linked-list/singly-linked-list.js +119 -218
- package/dist/data-structures/linked-list/singly-linked-list.js.map +1 -1
- package/dist/data-structures/linked-list/skip-linked-list.js +50 -70
- package/dist/data-structures/linked-list/skip-linked-list.js.map +1 -1
- package/dist/data-structures/matrix/matrix.js +7 -8
- package/dist/data-structures/matrix/matrix.js.map +1 -1
- package/dist/data-structures/matrix/matrix2d.js +57 -70
- package/dist/data-structures/matrix/matrix2d.js.map +1 -1
- package/dist/data-structures/matrix/navigator.js +18 -37
- package/dist/data-structures/matrix/navigator.js.map +1 -1
- package/dist/data-structures/matrix/vector2d.js +63 -84
- package/dist/data-structures/matrix/vector2d.js.map +1 -1
- package/dist/data-structures/priority-queue/max-priority-queue.js +13 -41
- package/dist/data-structures/priority-queue/max-priority-queue.js.map +1 -1
- package/dist/data-structures/priority-queue/min-priority-queue.js +13 -41
- package/dist/data-structures/priority-queue/min-priority-queue.js.map +1 -1
- package/dist/data-structures/priority-queue/priority-queue.js +93 -139
- package/dist/data-structures/priority-queue/priority-queue.js.map +1 -1
- package/dist/data-structures/queue/deque.js +82 -128
- package/dist/data-structures/queue/deque.js.map +1 -1
- package/dist/data-structures/queue/queue.js +57 -157
- package/dist/data-structures/queue/queue.js.map +1 -1
- package/dist/data-structures/stack/stack.js +21 -22
- package/dist/data-structures/stack/stack.js.map +1 -1
- package/dist/data-structures/tree/tree.js +32 -45
- package/dist/data-structures/tree/tree.js.map +1 -1
- package/dist/data-structures/trie/trie.js +93 -200
- package/dist/data-structures/trie/trie.js.map +1 -1
- package/dist/types/data-structures/abstract-binary-tree.js.map +1 -1
- package/dist/utils/utils.js +22 -107
- package/dist/utils/utils.js.map +1 -1
- package/lib/data-structures/binary-tree/abstract-binary-tree.d.ts +79 -78
- package/lib/data-structures/binary-tree/abstract-binary-tree.js +61 -141
- package/lib/data-structures/binary-tree/avl-tree.d.ts +9 -0
- package/lib/data-structures/binary-tree/avl-tree.js +22 -0
- package/lib/data-structures/binary-tree/bst.d.ts +3 -3
- package/lib/data-structures/binary-tree/bst.js +12 -15
- package/lib/data-structures/binary-tree/tree-multiset.d.ts +16 -18
- package/lib/data-structures/binary-tree/tree-multiset.js +26 -36
- package/lib/data-structures/graph/abstract-graph.d.ts +2 -2
- package/lib/data-structures/graph/abstract-graph.js +5 -5
- package/lib/data-structures/priority-queue/priority-queue.d.ts +3 -3
- package/lib/data-structures/priority-queue/priority-queue.js +3 -3
- package/lib/interfaces/abstract-binary-tree.d.ts +1 -83
- package/lib/interfaces/abstract-graph.d.ts +2 -14
- package/lib/interfaces/avl-tree.d.ts +3 -4
- package/lib/interfaces/binary-tree.d.ts +4 -2
- package/lib/interfaces/bst.d.ts +2 -12
- package/lib/interfaces/directed-graph.d.ts +0 -9
- package/lib/interfaces/rb-tree.d.ts +2 -3
- package/lib/interfaces/tree-multiset.d.ts +5 -4
- package/lib/interfaces/undirected-graph.d.ts +0 -2
- package/lib/types/data-structures/abstract-binary-tree.js +0 -1
- package/package.json +7 -7
- package/src/data-structures/binary-tree/abstract-binary-tree.ts +151 -203
- package/src/data-structures/binary-tree/avl-tree.ts +29 -0
- package/src/data-structures/binary-tree/bst.ts +12 -15
- package/src/data-structures/binary-tree/tree-multiset.ts +27 -39
- package/src/data-structures/graph/abstract-graph.ts +5 -5
- package/src/data-structures/priority-queue/priority-queue.ts +3 -3
- package/src/interfaces/abstract-binary-tree.ts +2 -183
- package/src/interfaces/abstract-graph.ts +2 -26
- package/src/interfaces/avl-tree.ts +4 -21
- package/src/interfaces/binary-tree.ts +3 -2
- package/src/interfaces/bst.ts +2 -27
- package/src/interfaces/directed-graph.ts +1 -18
- package/src/interfaces/rb-tree.ts +2 -5
- package/src/interfaces/tree-multiset.ts +4 -4
- package/src/interfaces/undirected-graph.ts +1 -4
- package/src/types/data-structures/abstract-binary-tree.ts +0 -1
- package/test/integration/avl-tree.test.ts +24 -24
- package/test/integration/bst.test.ts +71 -71
- package/test/unit/data-structures/binary-tree/avl-tree.test.ts +4 -4
- package/test/unit/data-structures/binary-tree/binary-tree.test.ts +1 -9
- package/test/unit/data-structures/binary-tree/bst.test.ts +8 -8
- package/test/unit/data-structures/binary-tree/overall.test.ts +1 -1
- package/test/unit/data-structures/binary-tree/tree-multiset.test.ts +9 -9
- package/test/unit/data-structures/linked-list/doubly-linked-list.test.ts +1 -1
- package/test/unit/data-structures/priority-queue/priority-queue.test.ts +4 -4
- package/umd/bundle.min.js +1 -1
- package/umd/bundle.min.js.map +1 -1
|
@@ -1,94 +1,50 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
var __assign = (this && this.__assign) || function () {
|
|
3
|
-
__assign = Object.assign || function(t) {
|
|
4
|
-
for (var s, i = 1, n = arguments.length; i < n; i++) {
|
|
5
|
-
s = arguments[i];
|
|
6
|
-
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
|
|
7
|
-
t[p] = s[p];
|
|
8
|
-
}
|
|
9
|
-
return t;
|
|
10
|
-
};
|
|
11
|
-
return __assign.apply(this, arguments);
|
|
12
|
-
};
|
|
13
|
-
var __read = (this && this.__read) || function (o, n) {
|
|
14
|
-
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
15
|
-
if (!m) return o;
|
|
16
|
-
var i = m.call(o), r, ar = [], e;
|
|
17
|
-
try {
|
|
18
|
-
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
|
|
19
|
-
}
|
|
20
|
-
catch (error) { e = { error: error }; }
|
|
21
|
-
finally {
|
|
22
|
-
try {
|
|
23
|
-
if (r && !r.done && (m = i["return"])) m.call(i);
|
|
24
|
-
}
|
|
25
|
-
finally { if (e) throw e.error; }
|
|
26
|
-
}
|
|
27
|
-
return ar;
|
|
28
|
-
};
|
|
29
|
-
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
|
|
30
|
-
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
31
|
-
if (ar || !(i in from)) {
|
|
32
|
-
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
|
|
33
|
-
ar[i] = from[i];
|
|
34
|
-
}
|
|
35
|
-
}
|
|
36
|
-
return to.concat(ar || Array.prototype.slice.call(from));
|
|
37
|
-
};
|
|
38
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
39
3
|
exports.PriorityQueue = void 0;
|
|
40
|
-
|
|
41
|
-
|
|
4
|
+
class PriorityQueue {
|
|
5
|
+
constructor(options) {
|
|
42
6
|
this._nodes = [];
|
|
43
|
-
this._comparator =
|
|
44
|
-
|
|
7
|
+
this._comparator = (a, b) => {
|
|
8
|
+
const aKey = a, bKey = b;
|
|
45
9
|
return aKey - bKey;
|
|
46
10
|
};
|
|
47
|
-
|
|
11
|
+
const { nodes, comparator, isFix = true } = options;
|
|
48
12
|
this._comparator = comparator;
|
|
49
13
|
if (nodes && Array.isArray(nodes) && nodes.length > 0) {
|
|
50
|
-
this._nodes =
|
|
14
|
+
this._nodes = [...nodes];
|
|
51
15
|
isFix && this._fix();
|
|
52
16
|
}
|
|
53
17
|
}
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
get: function () {
|
|
63
|
-
return this.nodes.length;
|
|
64
|
-
},
|
|
65
|
-
enumerable: false,
|
|
66
|
-
configurable: true
|
|
67
|
-
});
|
|
68
|
-
PriorityQueue.heapify = function (options) {
|
|
69
|
-
var heap = new PriorityQueue(options);
|
|
18
|
+
get nodes() {
|
|
19
|
+
return this._nodes;
|
|
20
|
+
}
|
|
21
|
+
get size() {
|
|
22
|
+
return this.nodes.length;
|
|
23
|
+
}
|
|
24
|
+
static heapify(options) {
|
|
25
|
+
const heap = new PriorityQueue(options);
|
|
70
26
|
heap._fix();
|
|
71
27
|
return heap;
|
|
72
|
-
}
|
|
73
|
-
|
|
74
|
-
return new PriorityQueue(
|
|
75
|
-
}
|
|
76
|
-
|
|
28
|
+
}
|
|
29
|
+
static isPriorityQueueified(options) {
|
|
30
|
+
return new PriorityQueue(Object.assign(Object.assign({}, options), { isFix: false })).isValid();
|
|
31
|
+
}
|
|
32
|
+
getNodes() {
|
|
77
33
|
return this._nodes;
|
|
78
|
-
}
|
|
79
|
-
|
|
34
|
+
}
|
|
35
|
+
add(node) {
|
|
80
36
|
this.nodes.push(node);
|
|
81
37
|
this._heapifyUp(this.size - 1);
|
|
82
|
-
}
|
|
83
|
-
|
|
38
|
+
}
|
|
39
|
+
has(node) {
|
|
84
40
|
return this.nodes.includes(node);
|
|
85
|
-
}
|
|
86
|
-
|
|
41
|
+
}
|
|
42
|
+
peek() {
|
|
87
43
|
return this.size ? this.nodes[0] : null;
|
|
88
|
-
}
|
|
89
|
-
|
|
44
|
+
}
|
|
45
|
+
poll() {
|
|
90
46
|
var _a, _b;
|
|
91
|
-
|
|
47
|
+
let res = null;
|
|
92
48
|
if (this.size > 1) {
|
|
93
49
|
this._swap(0, this.nodes.length - 1);
|
|
94
50
|
res = (_a = this.nodes.pop()) !== null && _a !== void 0 ? _a : null;
|
|
@@ -98,30 +54,30 @@ var PriorityQueue = (function () {
|
|
|
98
54
|
res = (_b = this.nodes.pop()) !== null && _b !== void 0 ? _b : null;
|
|
99
55
|
}
|
|
100
56
|
return res;
|
|
101
|
-
}
|
|
102
|
-
|
|
57
|
+
}
|
|
58
|
+
leaf() {
|
|
103
59
|
var _a;
|
|
104
60
|
return (_a = this.nodes[this.size - 1]) !== null && _a !== void 0 ? _a : null;
|
|
105
|
-
}
|
|
106
|
-
|
|
61
|
+
}
|
|
62
|
+
isEmpty() {
|
|
107
63
|
return this.size === 0;
|
|
108
|
-
}
|
|
109
|
-
|
|
64
|
+
}
|
|
65
|
+
clear() {
|
|
110
66
|
this._setNodes([]);
|
|
111
|
-
}
|
|
112
|
-
|
|
113
|
-
return
|
|
114
|
-
}
|
|
115
|
-
|
|
67
|
+
}
|
|
68
|
+
toArray() {
|
|
69
|
+
return [...this.nodes];
|
|
70
|
+
}
|
|
71
|
+
clone() {
|
|
116
72
|
return new PriorityQueue({
|
|
117
73
|
nodes: this.nodes,
|
|
118
74
|
comparator: this._comparator
|
|
119
75
|
});
|
|
120
|
-
}
|
|
121
|
-
|
|
122
|
-
for (
|
|
123
|
-
|
|
124
|
-
|
|
76
|
+
}
|
|
77
|
+
isValid() {
|
|
78
|
+
for (let i = 0; i < this.nodes.length; i++) {
|
|
79
|
+
const leftChildIndex = this._getLeft(i);
|
|
80
|
+
const rightChildIndex = this._getRight(i);
|
|
125
81
|
if (this._isValidIndex(leftChildIndex) && !this._compare(leftChildIndex, i)) {
|
|
126
82
|
return false;
|
|
127
83
|
}
|
|
@@ -130,70 +86,69 @@ var PriorityQueue = (function () {
|
|
|
130
86
|
}
|
|
131
87
|
}
|
|
132
88
|
return true;
|
|
133
|
-
}
|
|
134
|
-
|
|
135
|
-
|
|
89
|
+
}
|
|
90
|
+
sort() {
|
|
91
|
+
const visitedNode = [];
|
|
136
92
|
while (this.size !== 0) {
|
|
137
|
-
|
|
93
|
+
const top = this.poll();
|
|
138
94
|
if (top)
|
|
139
95
|
visitedNode.push(top);
|
|
140
96
|
}
|
|
141
97
|
return visitedNode;
|
|
142
|
-
}
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
var traverse = function (cur) {
|
|
98
|
+
}
|
|
99
|
+
dfs(dfsMode) {
|
|
100
|
+
const visitedNode = [];
|
|
101
|
+
const traverse = (cur) => {
|
|
147
102
|
var _a, _b, _c;
|
|
148
|
-
|
|
149
|
-
|
|
103
|
+
const leftChildIndex = this._getLeft(cur);
|
|
104
|
+
const rightChildIndex = this._getRight(cur);
|
|
150
105
|
switch (dfsMode) {
|
|
151
106
|
case 'in':
|
|
152
|
-
|
|
153
|
-
visitedNode.push((_a =
|
|
154
|
-
|
|
107
|
+
this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
|
|
108
|
+
visitedNode.push((_a = this.nodes[cur]) !== null && _a !== void 0 ? _a : null);
|
|
109
|
+
this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
|
|
155
110
|
break;
|
|
156
111
|
case 'pre':
|
|
157
|
-
visitedNode.push((_b =
|
|
158
|
-
|
|
159
|
-
|
|
112
|
+
visitedNode.push((_b = this.nodes[cur]) !== null && _b !== void 0 ? _b : null);
|
|
113
|
+
this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
|
|
114
|
+
this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
|
|
160
115
|
break;
|
|
161
116
|
case 'post':
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
visitedNode.push((_c =
|
|
117
|
+
this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
|
|
118
|
+
this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
|
|
119
|
+
visitedNode.push((_c = this.nodes[cur]) !== null && _c !== void 0 ? _c : null);
|
|
165
120
|
break;
|
|
166
121
|
}
|
|
167
122
|
};
|
|
168
123
|
this._isValidIndex(0) && traverse(0);
|
|
169
124
|
return visitedNode;
|
|
170
|
-
}
|
|
171
|
-
|
|
125
|
+
}
|
|
126
|
+
_setNodes(value) {
|
|
172
127
|
this._nodes = value;
|
|
173
|
-
}
|
|
174
|
-
|
|
128
|
+
}
|
|
129
|
+
_compare(a, b) {
|
|
175
130
|
return this._comparator(this.nodes[a], this.nodes[b]) > 0;
|
|
176
|
-
}
|
|
177
|
-
|
|
178
|
-
|
|
131
|
+
}
|
|
132
|
+
_swap(a, b) {
|
|
133
|
+
const temp = this.nodes[a];
|
|
179
134
|
this.nodes[a] = this.nodes[b];
|
|
180
135
|
this.nodes[b] = temp;
|
|
181
|
-
}
|
|
182
|
-
|
|
136
|
+
}
|
|
137
|
+
_isValidIndex(index) {
|
|
183
138
|
return index > -1 && index < this.nodes.length;
|
|
184
|
-
}
|
|
185
|
-
|
|
139
|
+
}
|
|
140
|
+
_getParent(child) {
|
|
186
141
|
return Math.floor((child - 1) / 2);
|
|
187
|
-
}
|
|
188
|
-
|
|
142
|
+
}
|
|
143
|
+
_getLeft(parent) {
|
|
189
144
|
return 2 * parent + 1;
|
|
190
|
-
}
|
|
191
|
-
|
|
145
|
+
}
|
|
146
|
+
_getRight(parent) {
|
|
192
147
|
return 2 * parent + 2;
|
|
193
|
-
}
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
|
|
148
|
+
}
|
|
149
|
+
_getComparedChild(parent) {
|
|
150
|
+
let min = parent;
|
|
151
|
+
const left = this._getLeft(parent), right = this._getRight(parent);
|
|
197
152
|
if (left < this.size && this._compare(min, left)) {
|
|
198
153
|
min = left;
|
|
199
154
|
}
|
|
@@ -201,27 +156,26 @@ var PriorityQueue = (function () {
|
|
|
201
156
|
min = right;
|
|
202
157
|
}
|
|
203
158
|
return min;
|
|
204
|
-
}
|
|
205
|
-
|
|
159
|
+
}
|
|
160
|
+
_heapifyUp(start) {
|
|
206
161
|
while (start > 0 && this._compare(this._getParent(start), start)) {
|
|
207
|
-
|
|
162
|
+
const parent = this._getParent(start);
|
|
208
163
|
this._swap(start, parent);
|
|
209
164
|
start = parent;
|
|
210
165
|
}
|
|
211
|
-
}
|
|
212
|
-
|
|
213
|
-
|
|
166
|
+
}
|
|
167
|
+
_heapifyDown(start) {
|
|
168
|
+
let min = this._getComparedChild(start);
|
|
214
169
|
while (this._compare(start, min)) {
|
|
215
170
|
this._swap(min, start);
|
|
216
171
|
start = min;
|
|
217
172
|
min = this._getComparedChild(start);
|
|
218
173
|
}
|
|
219
|
-
}
|
|
220
|
-
|
|
221
|
-
for (
|
|
174
|
+
}
|
|
175
|
+
_fix() {
|
|
176
|
+
for (let i = Math.floor(this.size / 2); i > -1; i--)
|
|
222
177
|
this._heapifyDown(i);
|
|
223
|
-
}
|
|
224
|
-
|
|
225
|
-
}());
|
|
178
|
+
}
|
|
179
|
+
}
|
|
226
180
|
exports.PriorityQueue = PriorityQueue;
|
|
227
181
|
//# sourceMappingURL=priority-queue.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../../src/data-structures/priority-queue/priority-queue.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../../src/data-structures/priority-queue/priority-queue.ts"],"names":[],"mappings":";;;AASA,MAAa,aAAa;IAMxB,YAAY,OAAgC;QAWlC,WAAM,GAAQ,EAAE,CAAC;QAkNR,gBAAW,GAA+B,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE;YAC1E,MAAM,IAAI,GAAG,CAAsB,EACjC,IAAI,GAAG,CAAsB,CAAC;YAChC,OAAO,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC,CAAC;QAhOA,MAAM,EAAC,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG,IAAI,EAAC,GAAG,OAAO,CAAC;QAClD,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAE9B,IAAI,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YAErD,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;YACzB,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;SACtB;IACH,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IASD,MAAM,CAAC,OAAO,CAAI,OAAgC;QAChD,MAAM,IAAI,GAAG,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IASD,MAAM,CAAC,oBAAoB,CAAI,OAA+C;QAC5E,OAAO,IAAI,aAAa,iCAAK,OAAO,KAAE,KAAK,EAAE,KAAK,IAAE,CAAC,OAAO,EAAE,CAAC;IACjE,CAAC;IAKD,QAAQ;QACN,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAOD,GAAG,CAAC,IAAO;QACT,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IAQD,GAAG,CAAC,IAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAOD,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,CAAC;IAMD,IAAI;;QACF,IAAI,GAAG,GAAa,IAAI,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE;YACjB,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACrC,GAAG,GAAG,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SACtB;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;YAC1B,GAAG,GAAG,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;SAChC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAOD,IAAI;;QACF,OAAO,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,mCAAI,IAAI,CAAC;IAC3C,CAAC;IAQD,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IACzB,CAAC;IAKD,KAAK;QACH,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAMD,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAQD,KAAK;QACH,OAAO,IAAI,aAAa,CAAI;YAC1B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,UAAU,EAAE,IAAI,CAAC,WAAW;SAC7B,CAAC,CAAC;IACL,CAAC;IAOD,OAAO;QACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE;gBAC3E,OAAO,KAAK,CAAC;aACd;YACD,IAAI,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,CAAC,EAAE;gBAC7E,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAWD,IAAI;QACF,MAAM,WAAW,GAAQ,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;YACtB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACxB,IAAI,GAAG;gBAAE,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAChC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IASD,GAAG,CAAC,OAAqC;QACvC,MAAM,WAAW,GAAiB,EAAE,CAAC;QAErC,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,EAAE;;YAC/B,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC1C,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC5C,QAAQ,OAAO,EAAE;gBACf,KAAK,IAAI;oBACP,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC;oBAC/D,WAAW,CAAC,IAAI,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC,CAAC;oBAC1C,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,KAAK;oBACR,WAAW,CAAC,IAAI,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC,CAAC;oBAC1C,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC;oBAC/D,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,MAAM;oBACT,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC;oBAC/D,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC;oBACjE,WAAW,CAAC,IAAI,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC,CAAC;oBAC1C,MAAM;aACT;QACH,CAAC,CAAC;QAEF,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,WAAW,CAAC;IACrB,CAAC;IAES,SAAS,CAAC,KAAU;QAC5B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAgBS,QAAQ,CAAC,CAAS,EAAE,CAAS;QACrC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAOS,KAAK,CAAC,CAAS,EAAE,CAAS;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvB,CAAC;IAQS,aAAa,CAAC,KAAa;QACnC,OAAO,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IACjD,CAAC;IAOS,UAAU,CAAC,KAAa;QAChC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IAOS,QAAQ,CAAC,MAAc;QAC/B,OAAO,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAOS,SAAS,CAAC,MAAc;QAChC,OAAO,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAQS,iBAAiB,CAAC,MAAc;QACxC,IAAI,GAAG,GAAG,MAAM,CAAC;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAChC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAEjC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;YAChD,GAAG,GAAG,IAAI,CAAC;SACZ;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE;YAClD,GAAG,GAAG,KAAK,CAAC;SACb;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAOS,UAAU,CAAC,KAAa;QAChC,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE;YAChE,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAC1B,KAAK,GAAG,MAAM,CAAC;SAChB;IACH,CAAC;IAOS,YAAY,CAAC,KAAa;QAClC,IAAI,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE;YAChC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACvB,KAAK,GAAG,GAAG,CAAC;YACZ,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;SACrC;IACH,CAAC;IAMS,IAAI;QACZ,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;CAGF;AA7VD,sCA6VC"}
|
|
@@ -1,32 +1,12 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
var __extends = (this && this.__extends) || (function () {
|
|
3
|
-
var extendStatics = function (d, b) {
|
|
4
|
-
extendStatics = Object.setPrototypeOf ||
|
|
5
|
-
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
6
|
-
function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
|
|
7
|
-
return extendStatics(d, b);
|
|
8
|
-
};
|
|
9
|
-
return function (d, b) {
|
|
10
|
-
if (typeof b !== "function" && b !== null)
|
|
11
|
-
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
|
12
|
-
extendStatics(d, b);
|
|
13
|
-
function __() { this.constructor = d; }
|
|
14
|
-
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
15
|
-
};
|
|
16
|
-
})();
|
|
17
2
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
18
3
|
exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
function Deque() {
|
|
23
|
-
return _super !== null && _super.apply(this, arguments) || this;
|
|
24
|
-
}
|
|
25
|
-
return Deque;
|
|
26
|
-
}(linked_list_1.DoublyLinkedList));
|
|
4
|
+
const linked_list_1 = require("../linked-list");
|
|
5
|
+
class Deque extends linked_list_1.DoublyLinkedList {
|
|
6
|
+
}
|
|
27
7
|
exports.Deque = Deque;
|
|
28
|
-
|
|
29
|
-
|
|
8
|
+
class ObjectDeque {
|
|
9
|
+
constructor(capacity) {
|
|
30
10
|
this._nodes = {};
|
|
31
11
|
this._capacity = Number.MAX_SAFE_INTEGER;
|
|
32
12
|
this._first = -1;
|
|
@@ -35,53 +15,33 @@ var ObjectDeque = (function () {
|
|
|
35
15
|
if (capacity !== undefined)
|
|
36
16
|
this._capacity = capacity;
|
|
37
17
|
}
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
configurable: true
|
|
64
|
-
});
|
|
65
|
-
Object.defineProperty(ObjectDeque.prototype, "last", {
|
|
66
|
-
get: function () {
|
|
67
|
-
return this._last;
|
|
68
|
-
},
|
|
69
|
-
set: function (value) {
|
|
70
|
-
this._last = value;
|
|
71
|
-
},
|
|
72
|
-
enumerable: false,
|
|
73
|
-
configurable: true
|
|
74
|
-
});
|
|
75
|
-
Object.defineProperty(ObjectDeque.prototype, "size", {
|
|
76
|
-
get: function () {
|
|
77
|
-
return this._size;
|
|
78
|
-
},
|
|
79
|
-
enumerable: false,
|
|
80
|
-
configurable: true
|
|
81
|
-
});
|
|
82
|
-
ObjectDeque.prototype.addFirst = function (value) {
|
|
18
|
+
get nodes() {
|
|
19
|
+
return this._nodes;
|
|
20
|
+
}
|
|
21
|
+
get capacity() {
|
|
22
|
+
return this._capacity;
|
|
23
|
+
}
|
|
24
|
+
set capacity(value) {
|
|
25
|
+
this._capacity = value;
|
|
26
|
+
}
|
|
27
|
+
get first() {
|
|
28
|
+
return this._first;
|
|
29
|
+
}
|
|
30
|
+
set first(value) {
|
|
31
|
+
this._first = value;
|
|
32
|
+
}
|
|
33
|
+
get last() {
|
|
34
|
+
return this._last;
|
|
35
|
+
}
|
|
36
|
+
set last(value) {
|
|
37
|
+
this._last = value;
|
|
38
|
+
}
|
|
39
|
+
get size() {
|
|
40
|
+
return this._size;
|
|
41
|
+
}
|
|
42
|
+
addFirst(value) {
|
|
83
43
|
if (this._size === 0) {
|
|
84
|
-
|
|
44
|
+
const mid = Math.floor(this._capacity / 2);
|
|
85
45
|
this._first = mid;
|
|
86
46
|
this._last = mid;
|
|
87
47
|
}
|
|
@@ -90,10 +50,10 @@ var ObjectDeque = (function () {
|
|
|
90
50
|
}
|
|
91
51
|
this._nodes[this._first] = value;
|
|
92
52
|
this._size++;
|
|
93
|
-
}
|
|
94
|
-
|
|
53
|
+
}
|
|
54
|
+
addLast(value) {
|
|
95
55
|
if (this._size === 0) {
|
|
96
|
-
|
|
56
|
+
const mid = Math.floor(this._capacity / 2);
|
|
97
57
|
this._first = mid;
|
|
98
58
|
this._last = mid;
|
|
99
59
|
}
|
|
@@ -102,98 +62,92 @@ var ObjectDeque = (function () {
|
|
|
102
62
|
}
|
|
103
63
|
this._nodes[this._last] = value;
|
|
104
64
|
this._size++;
|
|
105
|
-
}
|
|
106
|
-
|
|
65
|
+
}
|
|
66
|
+
pollFirst() {
|
|
107
67
|
if (!this._size)
|
|
108
68
|
return;
|
|
109
|
-
|
|
69
|
+
const value = this.peekFirst();
|
|
110
70
|
delete this._nodes[this._first];
|
|
111
71
|
this._first++;
|
|
112
72
|
this._size--;
|
|
113
73
|
return value;
|
|
114
|
-
}
|
|
115
|
-
|
|
74
|
+
}
|
|
75
|
+
peekFirst() {
|
|
116
76
|
if (this._size)
|
|
117
77
|
return this._nodes[this._first];
|
|
118
|
-
}
|
|
119
|
-
|
|
78
|
+
}
|
|
79
|
+
pollLast() {
|
|
120
80
|
if (!this._size)
|
|
121
81
|
return;
|
|
122
|
-
|
|
82
|
+
const value = this.peekLast();
|
|
123
83
|
delete this._nodes[this._last];
|
|
124
84
|
this._last--;
|
|
125
85
|
this._size--;
|
|
126
86
|
return value;
|
|
127
|
-
}
|
|
128
|
-
|
|
87
|
+
}
|
|
88
|
+
peekLast() {
|
|
129
89
|
if (this._size)
|
|
130
90
|
return this._nodes[this._last];
|
|
131
|
-
}
|
|
132
|
-
|
|
91
|
+
}
|
|
92
|
+
get(index) {
|
|
133
93
|
return this._nodes[this._first + index] || null;
|
|
134
|
-
}
|
|
135
|
-
|
|
94
|
+
}
|
|
95
|
+
isEmpty() {
|
|
136
96
|
return this._size <= 0;
|
|
137
|
-
}
|
|
138
|
-
|
|
97
|
+
}
|
|
98
|
+
_seNodes(value) {
|
|
139
99
|
this._nodes = value;
|
|
140
|
-
}
|
|
141
|
-
|
|
100
|
+
}
|
|
101
|
+
_setSize(value) {
|
|
142
102
|
this._size = value;
|
|
143
|
-
}
|
|
144
|
-
|
|
145
|
-
}());
|
|
103
|
+
}
|
|
104
|
+
}
|
|
146
105
|
exports.ObjectDeque = ObjectDeque;
|
|
147
|
-
|
|
148
|
-
|
|
106
|
+
class ArrayDeque {
|
|
107
|
+
constructor() {
|
|
149
108
|
this._nodes = [];
|
|
150
109
|
}
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
enumerable: false,
|
|
156
|
-
configurable: true
|
|
157
|
-
});
|
|
158
|
-
ArrayDeque.prototype.addLast = function (value) {
|
|
110
|
+
get size() {
|
|
111
|
+
return this._nodes.length;
|
|
112
|
+
}
|
|
113
|
+
addLast(value) {
|
|
159
114
|
return this._nodes.push(value);
|
|
160
|
-
}
|
|
161
|
-
|
|
115
|
+
}
|
|
116
|
+
pollLast() {
|
|
162
117
|
var _a;
|
|
163
118
|
return (_a = this._nodes.pop()) !== null && _a !== void 0 ? _a : null;
|
|
164
|
-
}
|
|
165
|
-
|
|
119
|
+
}
|
|
120
|
+
pollFirst() {
|
|
166
121
|
var _a;
|
|
167
122
|
return (_a = this._nodes.shift()) !== null && _a !== void 0 ? _a : null;
|
|
168
|
-
}
|
|
169
|
-
|
|
123
|
+
}
|
|
124
|
+
addFirst(value) {
|
|
170
125
|
return this._nodes.unshift(value);
|
|
171
|
-
}
|
|
172
|
-
|
|
126
|
+
}
|
|
127
|
+
peekFirst() {
|
|
173
128
|
var _a;
|
|
174
129
|
return (_a = this._nodes[0]) !== null && _a !== void 0 ? _a : null;
|
|
175
|
-
}
|
|
176
|
-
|
|
130
|
+
}
|
|
131
|
+
peekLast() {
|
|
177
132
|
var _a;
|
|
178
133
|
return (_a = this._nodes[this._nodes.length - 1]) !== null && _a !== void 0 ? _a : null;
|
|
179
|
-
}
|
|
180
|
-
|
|
134
|
+
}
|
|
135
|
+
get(index) {
|
|
181
136
|
var _a;
|
|
182
137
|
return (_a = this._nodes[index]) !== null && _a !== void 0 ? _a : null;
|
|
183
|
-
}
|
|
184
|
-
|
|
138
|
+
}
|
|
139
|
+
set(index, value) {
|
|
185
140
|
return (this._nodes[index] = value);
|
|
186
|
-
}
|
|
187
|
-
|
|
141
|
+
}
|
|
142
|
+
insert(index, value) {
|
|
188
143
|
return this._nodes.splice(index, 0, value);
|
|
189
|
-
}
|
|
190
|
-
|
|
144
|
+
}
|
|
145
|
+
remove(index) {
|
|
191
146
|
return this._nodes.splice(index, 1);
|
|
192
|
-
}
|
|
193
|
-
|
|
147
|
+
}
|
|
148
|
+
isEmpty() {
|
|
194
149
|
return this._nodes.length === 0;
|
|
195
|
-
}
|
|
196
|
-
|
|
197
|
-
}());
|
|
150
|
+
}
|
|
151
|
+
}
|
|
198
152
|
exports.ArrayDeque = ArrayDeque;
|
|
199
153
|
//# sourceMappingURL=deque.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../../src/data-structures/queue/deque.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../../src/data-structures/queue/deque.ts"],"names":[],"mappings":";;;AAOA,gDAAgD;AAIhD,MAAa,KAAe,SAAQ,8BAAmB;CAAG;AAA1D,sBAA0D;AAK1D,MAAa,WAAW;IACtB,YAAY,QAAiB;QAIrB,WAAM,GAAuB,EAAE,CAAC;QAMhC,cAAS,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAUpC,WAAM,GAAG,CAAC,CAAC,CAAC;QAUZ,UAAK,GAAG,CAAC,CAAC,CAAC;QAUX,UAAK,GAAG,CAAC,CAAC;QAvChB,IAAI,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IACxD,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAID,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,IAAI,QAAQ,CAAC,KAAa;QACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,IAAI,CAAC,KAAa;QACpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAOD,QAAQ,CAAC,KAAQ;QACf,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAMD,OAAO,CAAC,KAAQ;QACd,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAMD,SAAS;QACP,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,SAAS;QACP,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAMD,QAAQ;QACN,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,QAAQ;QACN,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IASD,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC;IAClD,CAAC;IAMD,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAES,QAAQ,CAAC,KAAuB;QACxC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAES,QAAQ,CAAC,KAAa;QAC9B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AArJD,kCAqJC;AAID,MAAa,UAAU;IAAvB;QACY,WAAM,GAAQ,EAAE,CAAC;IA8H7B,CAAC;IA5HC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAWD,OAAO,CAAC,KAAQ;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAMD,QAAQ;;QACN,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;IACnC,CAAC;IAOD,SAAS;;QACP,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,mCAAI,IAAI,CAAC;IACrC,CAAC;IAYD,QAAQ,CAAC,KAAQ;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAOD,SAAS;;QACP,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,mCAAI,IAAI,CAAC;IAChC,CAAC;IAMD,QAAQ;;QACN,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,mCAAI,IAAI,CAAC;IACrD,CAAC;IAaD,GAAG,CAAC,KAAa;;QACf,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mCAAI,IAAI,CAAC;IACpC,CAAC;IAUD,GAAG,CAAC,KAAa,EAAE,KAAQ;QACzB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;IACtC,CAAC;IAYD,MAAM,CAAC,KAAa,EAAE,KAAQ;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAQD,MAAM,CAAC,KAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAOD,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;CACF;AA/HD,gCA+HC"}
|