typescript-ds-lib 0.2.5 → 0.2.6
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/package.json +1 -1
- package/dist/tests/binary-search-tree.test.d.ts +0 -1
- package/dist/tests/binary-search-tree.test.js +0 -163
- package/dist/tests/binary-search-tree.test.js.map +0 -1
- package/dist/tests/deque.test.d.ts +0 -1
- package/dist/tests/deque.test.js +0 -78
- package/dist/tests/deque.test.js.map +0 -1
- package/dist/tests/hash-table.test.d.ts +0 -1
- package/dist/tests/hash-table.test.js +0 -94
- package/dist/tests/hash-table.test.js.map +0 -1
- package/dist/tests/linked-list.test.d.ts +0 -1
- package/dist/tests/linked-list.test.js +0 -344
- package/dist/tests/linked-list.test.js.map +0 -1
- package/dist/tests/map.test.d.ts +0 -1
- package/dist/tests/map.test.js +0 -176
- package/dist/tests/map.test.js.map +0 -1
- package/dist/tests/matrix.test.d.ts +0 -1
- package/dist/tests/matrix.test.js +0 -278
- package/dist/tests/matrix.test.js.map +0 -1
- package/dist/tests/priority-queue.test.d.ts +0 -1
- package/dist/tests/priority-queue.test.js +0 -118
- package/dist/tests/priority-queue.test.js.map +0 -1
- package/dist/tests/queue.test.d.ts +0 -1
- package/dist/tests/queue.test.js +0 -48
- package/dist/tests/queue.test.js.map +0 -1
- package/dist/tests/red-black-tree.test.d.ts +0 -1
- package/dist/tests/red-black-tree.test.js +0 -167
- package/dist/tests/red-black-tree.test.js.map +0 -1
- package/dist/tests/set.test.d.ts +0 -1
- package/dist/tests/set.test.js +0 -119
- package/dist/tests/set.test.js.map +0 -1
- package/dist/tests/stack.test.d.ts +0 -1
- package/dist/tests/stack.test.js +0 -57
- package/dist/tests/stack.test.js.map +0 -1
|
@@ -1,278 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const matrix_1 = require("../lib/matrix");
|
|
4
|
-
describe('Matrix', () => {
|
|
5
|
-
let matrix;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
matrix = new matrix_1.Matrix(3, 3);
|
|
8
|
-
});
|
|
9
|
-
describe('constructor', () => {
|
|
10
|
-
it('should create an empty matrix of specified dimensions', () => {
|
|
11
|
-
expect(matrix.rows()).toBe(3);
|
|
12
|
-
expect(matrix.columns()).toBe(3);
|
|
13
|
-
expect(matrix.isEmpty()).toBe(false);
|
|
14
|
-
});
|
|
15
|
-
it('should create a matrix with zero dimensions', () => {
|
|
16
|
-
const emptyMatrix = new matrix_1.Matrix(0, 0);
|
|
17
|
-
expect(emptyMatrix.isEmpty()).toBe(true);
|
|
18
|
-
expect(emptyMatrix.size()).toBe(0);
|
|
19
|
-
});
|
|
20
|
-
});
|
|
21
|
-
describe('get/set operations', () => {
|
|
22
|
-
it('should set and get values correctly', () => {
|
|
23
|
-
matrix.set(0, 0, 1);
|
|
24
|
-
matrix.set(1, 1, 2);
|
|
25
|
-
matrix.set(2, 2, 3);
|
|
26
|
-
expect(matrix.get(0, 0)).toBe(1);
|
|
27
|
-
expect(matrix.get(1, 1)).toBe(2);
|
|
28
|
-
expect(matrix.get(2, 2)).toBe(3);
|
|
29
|
-
});
|
|
30
|
-
it('should return undefined for out of bounds access', () => {
|
|
31
|
-
expect(matrix.get(-1, 0)).toBeUndefined();
|
|
32
|
-
expect(matrix.get(0, -1)).toBeUndefined();
|
|
33
|
-
expect(matrix.get(3, 0)).toBeUndefined();
|
|
34
|
-
expect(matrix.get(0, 3)).toBeUndefined();
|
|
35
|
-
});
|
|
36
|
-
it('should ignore out of bounds set operations', () => {
|
|
37
|
-
matrix.set(-1, 0, 1);
|
|
38
|
-
matrix.set(0, -1, 1);
|
|
39
|
-
matrix.set(3, 0, 1);
|
|
40
|
-
matrix.set(0, 3, 1);
|
|
41
|
-
expect(matrix.toArray()).toEqual([
|
|
42
|
-
[undefined, undefined, undefined],
|
|
43
|
-
[undefined, undefined, undefined],
|
|
44
|
-
[undefined, undefined, undefined]
|
|
45
|
-
]);
|
|
46
|
-
});
|
|
47
|
-
});
|
|
48
|
-
describe('matrix operations', () => {
|
|
49
|
-
it('should fill matrix with a value', () => {
|
|
50
|
-
matrix.fill(5);
|
|
51
|
-
for (let i = 0; i < 3; i++) {
|
|
52
|
-
for (let j = 0; j < 3; j++) {
|
|
53
|
-
expect(matrix.get(i, j)).toBe(5);
|
|
54
|
-
}
|
|
55
|
-
}
|
|
56
|
-
});
|
|
57
|
-
it('should clear matrix', () => {
|
|
58
|
-
matrix.fill(5);
|
|
59
|
-
matrix.clear();
|
|
60
|
-
for (let i = 0; i < 3; i++) {
|
|
61
|
-
for (let j = 0; j < 3; j++) {
|
|
62
|
-
expect(matrix.get(i, j)).toBeUndefined();
|
|
63
|
-
}
|
|
64
|
-
}
|
|
65
|
-
});
|
|
66
|
-
it('should transpose matrix correctly', () => {
|
|
67
|
-
matrix.set(0, 1, 1);
|
|
68
|
-
matrix.set(1, 0, 2);
|
|
69
|
-
const transposed = matrix.transpose();
|
|
70
|
-
expect(transposed.get(1, 0)).toBe(1);
|
|
71
|
-
expect(transposed.get(0, 1)).toBe(2);
|
|
72
|
-
});
|
|
73
|
-
it('should add matrices correctly', () => {
|
|
74
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
75
|
-
matrix.fill(1);
|
|
76
|
-
other.fill(2);
|
|
77
|
-
const result = matrix.add(other);
|
|
78
|
-
for (let i = 0; i < 3; i++) {
|
|
79
|
-
for (let j = 0; j < 3; j++) {
|
|
80
|
-
expect(result.get(i, j)).toBe(3);
|
|
81
|
-
}
|
|
82
|
-
}
|
|
83
|
-
});
|
|
84
|
-
it('should throw error when adding matrices of different dimensions', () => {
|
|
85
|
-
const other = new matrix_1.Matrix(2, 3);
|
|
86
|
-
matrix.fill(1);
|
|
87
|
-
other.fill(2);
|
|
88
|
-
expect(() => matrix.add(other)).toThrow('Matrix dimensions must match for addition');
|
|
89
|
-
});
|
|
90
|
-
it('should subtract matrices correctly', () => {
|
|
91
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
92
|
-
matrix.fill(3);
|
|
93
|
-
other.fill(1);
|
|
94
|
-
const result = matrix.subtract(other);
|
|
95
|
-
for (let i = 0; i < 3; i++) {
|
|
96
|
-
for (let j = 0; j < 3; j++) {
|
|
97
|
-
expect(result.get(i, j)).toBe(2);
|
|
98
|
-
}
|
|
99
|
-
}
|
|
100
|
-
});
|
|
101
|
-
it('should throw error when subtracting matrices of different dimensions', () => {
|
|
102
|
-
const other = new matrix_1.Matrix(2, 3);
|
|
103
|
-
matrix.fill(1);
|
|
104
|
-
other.fill(2);
|
|
105
|
-
expect(() => matrix.subtract(other)).toThrow('Matrix dimensions must match for subtraction');
|
|
106
|
-
});
|
|
107
|
-
it('should multiply matrices correctly', () => {
|
|
108
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
109
|
-
matrix.fill(2);
|
|
110
|
-
other.fill(3);
|
|
111
|
-
const result = matrix.multiply(other);
|
|
112
|
-
for (let i = 0; i < 3; i++) {
|
|
113
|
-
for (let j = 0; j < 3; j++) {
|
|
114
|
-
expect(result.get(i, j)).toBe(18); // 2 * 3 * 3 (dot product)
|
|
115
|
-
}
|
|
116
|
-
}
|
|
117
|
-
});
|
|
118
|
-
it('should throw error when multiplying incompatible matrices', () => {
|
|
119
|
-
const other = new matrix_1.Matrix(2, 3);
|
|
120
|
-
matrix.fill(1);
|
|
121
|
-
other.fill(2);
|
|
122
|
-
expect(() => matrix.multiply(other)).toThrow('Matrix dimensions must be compatible for multiplication');
|
|
123
|
-
});
|
|
124
|
-
it('should multiply by scalar correctly', () => {
|
|
125
|
-
matrix.fill(2);
|
|
126
|
-
const result = matrix.scalarMultiply(3);
|
|
127
|
-
for (let i = 0; i < 3; i++) {
|
|
128
|
-
for (let j = 0; j < 3; j++) {
|
|
129
|
-
expect(result.get(i, j)).toBe(6);
|
|
130
|
-
}
|
|
131
|
-
}
|
|
132
|
-
});
|
|
133
|
-
});
|
|
134
|
-
describe('utility operations', () => {
|
|
135
|
-
it('should map values correctly', () => {
|
|
136
|
-
matrix.fill(1);
|
|
137
|
-
const result = matrix.map((value) => value * 2);
|
|
138
|
-
for (let i = 0; i < 3; i++) {
|
|
139
|
-
for (let j = 0; j < 3; j++) {
|
|
140
|
-
expect(result.get(i, j)).toBe(2);
|
|
141
|
-
}
|
|
142
|
-
}
|
|
143
|
-
});
|
|
144
|
-
it('should execute forEach correctly', () => {
|
|
145
|
-
matrix.fill(1);
|
|
146
|
-
let sum = 0;
|
|
147
|
-
matrix.forEach((value) => {
|
|
148
|
-
sum += value;
|
|
149
|
-
});
|
|
150
|
-
expect(sum).toBe(9);
|
|
151
|
-
});
|
|
152
|
-
it('should get/set rows correctly', () => {
|
|
153
|
-
matrix.setRow(0, [1, 2, 3]);
|
|
154
|
-
expect(matrix.getRow(0)).toEqual([1, 2, 3]);
|
|
155
|
-
});
|
|
156
|
-
it('should ignore invalid row operations', () => {
|
|
157
|
-
matrix.setRow(-1, [1, 2, 3]);
|
|
158
|
-
matrix.setRow(3, [1, 2, 3]);
|
|
159
|
-
matrix.setRow(0, [1, 2]); // Wrong length
|
|
160
|
-
expect(matrix.getRow(-1)).toEqual([]);
|
|
161
|
-
expect(matrix.getRow(3)).toEqual([]);
|
|
162
|
-
});
|
|
163
|
-
it('should get/set columns correctly', () => {
|
|
164
|
-
matrix.setColumn(0, [1, 2, 3]);
|
|
165
|
-
expect(matrix.getColumn(0)).toEqual([1, 2, 3]);
|
|
166
|
-
});
|
|
167
|
-
it('should ignore invalid column operations', () => {
|
|
168
|
-
matrix.setColumn(-1, [1, 2, 3]);
|
|
169
|
-
matrix.setColumn(3, [1, 2, 3]);
|
|
170
|
-
expect(matrix.getColumn(-1)).toEqual([]);
|
|
171
|
-
expect(matrix.getColumn(3)).toEqual([]);
|
|
172
|
-
});
|
|
173
|
-
it('should convert to array correctly', () => {
|
|
174
|
-
matrix.fill(1);
|
|
175
|
-
const arr = matrix.toArray();
|
|
176
|
-
expect(arr).toEqual([
|
|
177
|
-
[1, 1, 1],
|
|
178
|
-
[1, 1, 1],
|
|
179
|
-
[1, 1, 1]
|
|
180
|
-
]);
|
|
181
|
-
});
|
|
182
|
-
it('should clone matrix correctly', () => {
|
|
183
|
-
matrix.fill(1);
|
|
184
|
-
const clone = matrix.clone();
|
|
185
|
-
expect(clone.toArray()).toEqual(matrix.toArray());
|
|
186
|
-
// Verify deep copy
|
|
187
|
-
matrix.set(0, 0, 2);
|
|
188
|
-
expect(clone.get(0, 0)).toBe(1);
|
|
189
|
-
});
|
|
190
|
-
it('should calculate size correctly', () => {
|
|
191
|
-
expect(matrix.size()).toBe(9);
|
|
192
|
-
const matrix2 = new matrix_1.Matrix(2, 4);
|
|
193
|
-
expect(matrix2.size()).toBe(8);
|
|
194
|
-
});
|
|
195
|
-
it('should check if matrix is square', () => {
|
|
196
|
-
expect(matrix.isSquare()).toBe(true);
|
|
197
|
-
const rectMatrix = new matrix_1.Matrix(2, 3);
|
|
198
|
-
expect(rectMatrix.isSquare()).toBe(false);
|
|
199
|
-
});
|
|
200
|
-
it('should check if matrix is symmetric', () => {
|
|
201
|
-
matrix.set(0, 1, 2);
|
|
202
|
-
matrix.set(1, 0, 2);
|
|
203
|
-
matrix.set(0, 2, 3);
|
|
204
|
-
matrix.set(2, 0, 3);
|
|
205
|
-
matrix.set(1, 2, 4);
|
|
206
|
-
matrix.set(2, 1, 4);
|
|
207
|
-
expect(matrix.isSymmetric()).toBe(true);
|
|
208
|
-
matrix.set(0, 1, 5); // Make asymmetric
|
|
209
|
-
expect(matrix.isSymmetric()).toBe(false);
|
|
210
|
-
});
|
|
211
|
-
it('should swap rows correctly', () => {
|
|
212
|
-
matrix.setRow(0, [1, 2, 3]);
|
|
213
|
-
matrix.setRow(1, [4, 5, 6]);
|
|
214
|
-
matrix.swapRows(0, 1);
|
|
215
|
-
expect(matrix.getRow(0)).toEqual([4, 5, 6]);
|
|
216
|
-
expect(matrix.getRow(1)).toEqual([1, 2, 3]);
|
|
217
|
-
});
|
|
218
|
-
it('should swap columns correctly', () => {
|
|
219
|
-
matrix.setColumn(0, [1, 2, 3]);
|
|
220
|
-
matrix.setColumn(1, [4, 5, 6]);
|
|
221
|
-
matrix.swapColumns(0, 1);
|
|
222
|
-
expect(matrix.getColumn(0)).toEqual([4, 5, 6]);
|
|
223
|
-
expect(matrix.getColumn(1)).toEqual([1, 2, 3]);
|
|
224
|
-
});
|
|
225
|
-
it('should extract submatrix correctly', () => {
|
|
226
|
-
matrix.fill(1);
|
|
227
|
-
matrix.set(0, 0, 2);
|
|
228
|
-
matrix.set(0, 1, 3);
|
|
229
|
-
matrix.set(1, 0, 4);
|
|
230
|
-
matrix.set(1, 1, 5);
|
|
231
|
-
const sub = matrix.submatrix(0, 0, 1, 1);
|
|
232
|
-
expect(sub.rows()).toBe(2);
|
|
233
|
-
expect(sub.columns()).toBe(2);
|
|
234
|
-
expect(sub.get(0, 0)).toBe(2);
|
|
235
|
-
expect(sub.get(0, 1)).toBe(3);
|
|
236
|
-
expect(sub.get(1, 0)).toBe(4);
|
|
237
|
-
expect(sub.get(1, 1)).toBe(5);
|
|
238
|
-
});
|
|
239
|
-
it('should insert matrix correctly', () => {
|
|
240
|
-
const small = new matrix_1.Matrix(2, 2);
|
|
241
|
-
small.fill(5);
|
|
242
|
-
matrix.fill(1);
|
|
243
|
-
matrix.insertMatrix(small, 0, 0);
|
|
244
|
-
expect(matrix.get(0, 0)).toBe(5);
|
|
245
|
-
expect(matrix.get(0, 1)).toBe(5);
|
|
246
|
-
expect(matrix.get(1, 0)).toBe(5);
|
|
247
|
-
expect(matrix.get(1, 1)).toBe(5);
|
|
248
|
-
expect(matrix.get(2, 2)).toBe(1);
|
|
249
|
-
});
|
|
250
|
-
it('should get/set diagonal correctly', () => {
|
|
251
|
-
matrix.setDiagonal([1, 2, 3]);
|
|
252
|
-
expect(matrix.getDiagonal()).toEqual([1, 2, 3]);
|
|
253
|
-
});
|
|
254
|
-
it('should calculate trace correctly', () => {
|
|
255
|
-
matrix.setDiagonal([1, 2, 3]);
|
|
256
|
-
expect(matrix.trace()).toBe(6);
|
|
257
|
-
});
|
|
258
|
-
it('should check equality correctly', () => {
|
|
259
|
-
const other = new matrix_1.Matrix(3, 3);
|
|
260
|
-
matrix.fill(1);
|
|
261
|
-
other.fill(1);
|
|
262
|
-
expect(matrix.equals(other)).toBe(true);
|
|
263
|
-
other.set(0, 0, 2);
|
|
264
|
-
expect(matrix.equals(other)).toBe(false);
|
|
265
|
-
const different = new matrix_1.Matrix(2, 3);
|
|
266
|
-
expect(matrix.equals(different)).toBe(false);
|
|
267
|
-
});
|
|
268
|
-
it('should resize matrix correctly', () => {
|
|
269
|
-
matrix.fill(1);
|
|
270
|
-
matrix.resize(2, 4);
|
|
271
|
-
expect(matrix.rows()).toBe(2);
|
|
272
|
-
expect(matrix.columns()).toBe(4);
|
|
273
|
-
expect(matrix.get(0, 0)).toBe(1);
|
|
274
|
-
expect(matrix.get(0, 3)).toBeUndefined();
|
|
275
|
-
});
|
|
276
|
-
});
|
|
277
|
-
});
|
|
278
|
-
//# sourceMappingURL=matrix.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"matrix.test.js","sourceRoot":"","sources":["../../tests/matrix.test.ts"],"names":[],"mappings":";;AAAA,0CAAuC;AAEvC,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACtB,IAAI,MAAsB,CAAC;IAE3B,UAAU,CAAC,GAAG,EAAE;QACd,MAAM,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAC/D,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACrD,MAAM,WAAW,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEpB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YAC1D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;gBAC/B,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;gBACjC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;gBACjC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;aAClC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YACzE,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC;QACvF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC9E,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC;QAC/F,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,0BAA0B;gBAC/D,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACnE,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,yDAAyD,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBACvB,GAAG,IAAI,KAAK,CAAC;YACf,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe;YACzC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YACjD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBAClB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACV,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YAElD,mBAAmB;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,OAAO,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,UAAU,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAExC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB;YACvC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACpC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC5C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACxC,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAExC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEzC,MAAM,SAAS,GAAG,IAAI,eAAM,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
|
@@ -1,118 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const priority_queue_1 = require("../lib/priority-queue");
|
|
4
|
-
describe('PriorityQueue', () => {
|
|
5
|
-
let pq;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
pq = new priority_queue_1.PriorityQueue();
|
|
8
|
-
});
|
|
9
|
-
test('should create empty priority queue', () => {
|
|
10
|
-
expect(pq.isEmpty()).toBe(true);
|
|
11
|
-
expect(pq.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should push elements with priority', () => {
|
|
14
|
-
pq.push('low', 1);
|
|
15
|
-
pq.push('high', 3);
|
|
16
|
-
pq.push('medium', 2);
|
|
17
|
-
expect(pq.size()).toBe(3);
|
|
18
|
-
expect(pq.front()).toBe('high');
|
|
19
|
-
});
|
|
20
|
-
test('should maintain priority order when pushing', () => {
|
|
21
|
-
pq.push('third', 1);
|
|
22
|
-
pq.push('first', 3);
|
|
23
|
-
pq.push('second', 2);
|
|
24
|
-
expect(pq.pop()).toBe('first');
|
|
25
|
-
expect(pq.pop()).toBe('second');
|
|
26
|
-
expect(pq.pop()).toBe('third');
|
|
27
|
-
});
|
|
28
|
-
test('should pop elements in priority order', () => {
|
|
29
|
-
pq.push('low', 1);
|
|
30
|
-
pq.push('high', 3);
|
|
31
|
-
pq.push('medium', 2);
|
|
32
|
-
expect(pq.pop()).toBe('high');
|
|
33
|
-
expect(pq.size()).toBe(2);
|
|
34
|
-
expect(pq.pop()).toBe('medium');
|
|
35
|
-
expect(pq.pop()).toBe('low');
|
|
36
|
-
expect(pq.isEmpty()).toBe(true);
|
|
37
|
-
});
|
|
38
|
-
test('should return undefined when popping empty queue', () => {
|
|
39
|
-
expect(pq.pop()).toBeUndefined();
|
|
40
|
-
});
|
|
41
|
-
test('should return front element without removing it', () => {
|
|
42
|
-
pq.push('low', 1);
|
|
43
|
-
pq.push('high', 3);
|
|
44
|
-
expect(pq.front()).toBe('high');
|
|
45
|
-
expect(pq.size()).toBe(2);
|
|
46
|
-
});
|
|
47
|
-
test('should return undefined when checking front of empty queue', () => {
|
|
48
|
-
expect(pq.front()).toBeUndefined();
|
|
49
|
-
});
|
|
50
|
-
test('should clear all elements from queue', () => {
|
|
51
|
-
pq.push('low', 1);
|
|
52
|
-
pq.push('high', 3);
|
|
53
|
-
pq.push('medium', 2);
|
|
54
|
-
pq.clear();
|
|
55
|
-
expect(pq.isEmpty()).toBe(true);
|
|
56
|
-
expect(pq.size()).toBe(0);
|
|
57
|
-
});
|
|
58
|
-
test('should handle elements with same priority in FIFO order', () => {
|
|
59
|
-
pq.push('first', 1);
|
|
60
|
-
pq.push('second', 1);
|
|
61
|
-
pq.push('third', 1);
|
|
62
|
-
expect(pq.pop()).toBe('first');
|
|
63
|
-
expect(pq.pop()).toBe('second');
|
|
64
|
-
expect(pq.pop()).toBe('third');
|
|
65
|
-
});
|
|
66
|
-
test('should handle negative priorities', () => {
|
|
67
|
-
pq.push('lowest', -2);
|
|
68
|
-
pq.push('middle', 0);
|
|
69
|
-
pq.push('highest', 2);
|
|
70
|
-
expect(pq.pop()).toBe('highest');
|
|
71
|
-
expect(pq.pop()).toBe('middle');
|
|
72
|
-
expect(pq.pop()).toBe('lowest');
|
|
73
|
-
});
|
|
74
|
-
test('should handle mixed priority insertions', () => {
|
|
75
|
-
pq.push('medium1', 2);
|
|
76
|
-
pq.push('low1', 1);
|
|
77
|
-
pq.push('high', 3);
|
|
78
|
-
pq.push('medium2', 2);
|
|
79
|
-
pq.push('low2', 1);
|
|
80
|
-
expect(pq.pop()).toBe('high');
|
|
81
|
-
expect(pq.pop()).toBe('medium1');
|
|
82
|
-
expect(pq.pop()).toBe('medium2');
|
|
83
|
-
expect(pq.pop()).toBe('low1');
|
|
84
|
-
expect(pq.pop()).toBe('low2');
|
|
85
|
-
});
|
|
86
|
-
test('should maintain size correctly after operations', () => {
|
|
87
|
-
expect(pq.size()).toBe(0);
|
|
88
|
-
pq.push('a', 1);
|
|
89
|
-
expect(pq.size()).toBe(1);
|
|
90
|
-
pq.push('b', 2);
|
|
91
|
-
expect(pq.size()).toBe(2);
|
|
92
|
-
pq.pop();
|
|
93
|
-
expect(pq.size()).toBe(1);
|
|
94
|
-
pq.clear();
|
|
95
|
-
expect(pq.size()).toBe(0);
|
|
96
|
-
});
|
|
97
|
-
test('should handle pushing after clearing', () => {
|
|
98
|
-
pq.push('a', 1);
|
|
99
|
-
pq.push('b', 2);
|
|
100
|
-
pq.clear();
|
|
101
|
-
pq.push('c', 3);
|
|
102
|
-
expect(pq.size()).toBe(1);
|
|
103
|
-
expect(pq.front()).toBe('c');
|
|
104
|
-
});
|
|
105
|
-
test('should handle large number of elements', () => {
|
|
106
|
-
for (let i = 0; i < 1000; i++) {
|
|
107
|
-
pq.push(`item${i}`, Math.floor(Math.random() * 100));
|
|
108
|
-
}
|
|
109
|
-
let lastPriority = Infinity;
|
|
110
|
-
let count = 0;
|
|
111
|
-
while (!pq.isEmpty()) {
|
|
112
|
-
count++;
|
|
113
|
-
pq.pop();
|
|
114
|
-
}
|
|
115
|
-
expect(count).toBe(1000);
|
|
116
|
-
});
|
|
117
|
-
});
|
|
118
|
-
//# sourceMappingURL=priority-queue.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.test.js","sourceRoot":"","sources":["../../tests/priority-queue.test.ts"],"names":[],"mappings":";;AAAA,0DAAsD;AAEtD,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,EAAyB,CAAC;IAE9B,UAAU,CAAC,GAAG,EAAE;QACd,EAAE,GAAG,IAAI,8BAAa,EAAU,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpB,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACnE,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QACtB,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACtB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACtB,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChB,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChB,EAAE,CAAC,KAAK,EAAE,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,YAAY,GAAG,QAAQ,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;YACrB,KAAK,EAAE,CAAC;YACR,EAAE,CAAC,GAAG,EAAE,CAAC;QACX,CAAC;QACD,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
package/dist/tests/queue.test.js
DELETED
|
@@ -1,48 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const queue_1 = require("../lib/queue");
|
|
4
|
-
describe('Queue', () => {
|
|
5
|
-
let queue;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
queue = new queue_1.Queue();
|
|
8
|
-
});
|
|
9
|
-
test('should create empty queue', () => {
|
|
10
|
-
expect(queue.isEmpty()).toBe(true);
|
|
11
|
-
expect(queue.size()).toBe(0);
|
|
12
|
-
});
|
|
13
|
-
test('should push elements to queue', () => {
|
|
14
|
-
queue.push(1);
|
|
15
|
-
queue.push(2);
|
|
16
|
-
expect(queue.size()).toBe(2);
|
|
17
|
-
expect(queue.front()).toBe(1);
|
|
18
|
-
});
|
|
19
|
-
test('should pop elements from queue', () => {
|
|
20
|
-
queue.push(1);
|
|
21
|
-
queue.push(2);
|
|
22
|
-
expect(queue.pop()).toBe(1);
|
|
23
|
-
expect(queue.size()).toBe(1);
|
|
24
|
-
expect(queue.pop()).toBe(2);
|
|
25
|
-
expect(queue.isEmpty()).toBe(true);
|
|
26
|
-
});
|
|
27
|
-
test('should return undefined when popping empty queue', () => {
|
|
28
|
-
expect(queue.pop()).toBeUndefined();
|
|
29
|
-
});
|
|
30
|
-
test('should return front element without removing it', () => {
|
|
31
|
-
queue.push(1);
|
|
32
|
-
queue.push(2);
|
|
33
|
-
expect(queue.front()).toBe(1);
|
|
34
|
-
expect(queue.size()).toBe(2);
|
|
35
|
-
});
|
|
36
|
-
test('should return undefined when checking front of empty queue', () => {
|
|
37
|
-
expect(queue.front()).toBeUndefined();
|
|
38
|
-
});
|
|
39
|
-
test('should clear all elements from queue', () => {
|
|
40
|
-
queue.push(1);
|
|
41
|
-
queue.push(2);
|
|
42
|
-
queue.push(3);
|
|
43
|
-
queue.clear();
|
|
44
|
-
expect(queue.isEmpty()).toBe(true);
|
|
45
|
-
expect(queue.size()).toBe(0);
|
|
46
|
-
});
|
|
47
|
-
});
|
|
48
|
-
//# sourceMappingURL=queue.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"queue.test.js","sourceRoot":"","sources":["../../tests/queue.test.ts"],"names":[],"mappings":";;AAAA,wCAAqC;AAErC,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;IACrB,IAAI,KAAoB,CAAC;IAEzB,UAAU,CAAC,GAAG,EAAE;QACd,KAAK,GAAG,IAAI,aAAK,EAAU,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
export {};
|
|
@@ -1,167 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
const red_black_tree_1 = require("../lib/red-black-tree");
|
|
4
|
-
describe('RedBlackTree', () => {
|
|
5
|
-
let tree;
|
|
6
|
-
beforeEach(() => {
|
|
7
|
-
tree = new red_black_tree_1.RedBlackTree();
|
|
8
|
-
});
|
|
9
|
-
describe('Initialization', () => {
|
|
10
|
-
test('should start empty', () => {
|
|
11
|
-
expect(tree.isEmpty()).toBe(true);
|
|
12
|
-
expect(tree.size()).toBe(0);
|
|
13
|
-
});
|
|
14
|
-
test('should initialize with custom comparator', () => {
|
|
15
|
-
const reverseTree = new red_black_tree_1.RedBlackTree((a, b) => b < a);
|
|
16
|
-
reverseTree.insert(1, 1);
|
|
17
|
-
reverseTree.insert(2, 2);
|
|
18
|
-
const values = [];
|
|
19
|
-
reverseTree.forEach((_, value) => values.push(value));
|
|
20
|
-
expect(values).toEqual([2, 1]);
|
|
21
|
-
});
|
|
22
|
-
});
|
|
23
|
-
describe('Insertion', () => {
|
|
24
|
-
test('should insert values correctly', () => {
|
|
25
|
-
tree.insert(5, 5);
|
|
26
|
-
tree.insert(3, 3);
|
|
27
|
-
tree.insert(7, 7);
|
|
28
|
-
expect(tree.isEmpty()).toBe(false);
|
|
29
|
-
expect(tree.size()).toBe(3);
|
|
30
|
-
expect(tree.find(5)).toBe(5);
|
|
31
|
-
expect(tree.find(3)).toBe(3);
|
|
32
|
-
expect(tree.find(7)).toBe(7);
|
|
33
|
-
expect(tree.find(1)).toBeUndefined();
|
|
34
|
-
});
|
|
35
|
-
test('should handle duplicate inserts', () => {
|
|
36
|
-
tree.insert(5, 1);
|
|
37
|
-
tree.insert(5, 2);
|
|
38
|
-
tree.insert(5, 3);
|
|
39
|
-
expect(tree.size()).toBe(1);
|
|
40
|
-
expect(tree.find(5)).toBe(3);
|
|
41
|
-
});
|
|
42
|
-
test('should handle large number of insertions', () => {
|
|
43
|
-
const values = Array.from({ length: 1000 }, (_, i) => i);
|
|
44
|
-
values.forEach(v => tree.insert(v, v));
|
|
45
|
-
expect(tree.size()).toBe(1000);
|
|
46
|
-
// Verify some random values
|
|
47
|
-
expect(tree.find(42)).toBe(42);
|
|
48
|
-
expect(tree.find(999)).toBe(999);
|
|
49
|
-
expect(tree.find(500)).toBe(500);
|
|
50
|
-
});
|
|
51
|
-
});
|
|
52
|
-
describe('Removal', () => {
|
|
53
|
-
test('should remove values correctly', () => {
|
|
54
|
-
tree.insert(5, 5);
|
|
55
|
-
tree.insert(3, 3);
|
|
56
|
-
tree.insert(7, 7);
|
|
57
|
-
tree.insert(1, 1);
|
|
58
|
-
tree.insert(9, 9);
|
|
59
|
-
expect(tree.size()).toBe(5);
|
|
60
|
-
tree.remove(3);
|
|
61
|
-
expect(tree.find(3)).toBeUndefined();
|
|
62
|
-
expect(tree.size()).toBe(4);
|
|
63
|
-
tree.remove(5);
|
|
64
|
-
expect(tree.find(5)).toBeUndefined();
|
|
65
|
-
expect(tree.size()).toBe(3);
|
|
66
|
-
});
|
|
67
|
-
test('should handle removing non-existent values', () => {
|
|
68
|
-
tree.insert(5, 5);
|
|
69
|
-
tree.insert(3, 3);
|
|
70
|
-
const initialSize = tree.size();
|
|
71
|
-
tree.remove(7);
|
|
72
|
-
expect(tree.size()).toBe(initialSize);
|
|
73
|
-
});
|
|
74
|
-
test('should handle removing root node', () => {
|
|
75
|
-
tree.insert(5, 5);
|
|
76
|
-
tree.insert(3, 3);
|
|
77
|
-
tree.insert(7, 7);
|
|
78
|
-
tree.remove(5);
|
|
79
|
-
expect(tree.find(5)).toBeUndefined();
|
|
80
|
-
expect(tree.size()).toBe(2);
|
|
81
|
-
expect(tree.find(3)).toBe(3);
|
|
82
|
-
expect(tree.find(7)).toBe(7);
|
|
83
|
-
});
|
|
84
|
-
test('should handle removing all nodes sequentially', () => {
|
|
85
|
-
[5, 3, 7, 1, 9].forEach(v => tree.insert(v, v));
|
|
86
|
-
[5, 3, 7, 1, 9].forEach(v => {
|
|
87
|
-
tree.remove(v);
|
|
88
|
-
expect(tree.find(v)).toBeUndefined();
|
|
89
|
-
});
|
|
90
|
-
expect(tree.isEmpty()).toBe(true);
|
|
91
|
-
});
|
|
92
|
-
});
|
|
93
|
-
describe('Clear operation', () => {
|
|
94
|
-
test('should clear all nodes', () => {
|
|
95
|
-
tree.insert(5, 5);
|
|
96
|
-
tree.insert(3, 3);
|
|
97
|
-
tree.insert(7, 7);
|
|
98
|
-
expect(tree.isEmpty()).toBe(false);
|
|
99
|
-
tree.clear();
|
|
100
|
-
expect(tree.isEmpty()).toBe(true);
|
|
101
|
-
expect(tree.size()).toBe(0);
|
|
102
|
-
});
|
|
103
|
-
test('should handle clear on empty tree', () => {
|
|
104
|
-
tree.clear();
|
|
105
|
-
expect(tree.isEmpty()).toBe(true);
|
|
106
|
-
expect(tree.size()).toBe(0);
|
|
107
|
-
});
|
|
108
|
-
});
|
|
109
|
-
describe('Size management', () => {
|
|
110
|
-
test('should maintain correct size after operations', () => {
|
|
111
|
-
expect(tree.size()).toBe(0);
|
|
112
|
-
tree.insert(1, 1);
|
|
113
|
-
expect(tree.size()).toBe(1);
|
|
114
|
-
tree.insert(2, 2);
|
|
115
|
-
tree.insert(3, 3);
|
|
116
|
-
expect(tree.size()).toBe(3);
|
|
117
|
-
tree.remove(2);
|
|
118
|
-
expect(tree.size()).toBe(2);
|
|
119
|
-
tree.clear();
|
|
120
|
-
expect(tree.size()).toBe(0);
|
|
121
|
-
});
|
|
122
|
-
test('should handle rapid insertions and deletions', () => {
|
|
123
|
-
for (let i = 0; i < 100; i++) {
|
|
124
|
-
tree.insert(i, i);
|
|
125
|
-
}
|
|
126
|
-
expect(tree.size()).toBe(100);
|
|
127
|
-
for (let i = 0; i < 50; i++) {
|
|
128
|
-
tree.remove(i);
|
|
129
|
-
}
|
|
130
|
-
expect(tree.size()).toBe(50);
|
|
131
|
-
for (let i = 0; i < 25; i++) {
|
|
132
|
-
tree.insert(i, i);
|
|
133
|
-
}
|
|
134
|
-
expect(tree.size()).toBe(75);
|
|
135
|
-
});
|
|
136
|
-
});
|
|
137
|
-
describe('Iteration', () => {
|
|
138
|
-
test('should iterate through values in order using forEach', () => {
|
|
139
|
-
tree.insert(5, 50);
|
|
140
|
-
tree.insert(3, 30);
|
|
141
|
-
tree.insert(7, 70);
|
|
142
|
-
tree.insert(1, 10);
|
|
143
|
-
tree.insert(9, 90);
|
|
144
|
-
const keys = [];
|
|
145
|
-
const values = [];
|
|
146
|
-
tree.forEach((key, value) => {
|
|
147
|
-
keys.push(key);
|
|
148
|
-
values.push(value);
|
|
149
|
-
});
|
|
150
|
-
expect(keys).toEqual([1, 3, 5, 7, 9]);
|
|
151
|
-
expect(values).toEqual([10, 30, 50, 70, 90]);
|
|
152
|
-
});
|
|
153
|
-
test('should handle forEach on empty tree', () => {
|
|
154
|
-
const values = [];
|
|
155
|
-
tree.forEach((_, value) => values.push(value));
|
|
156
|
-
expect(values).toEqual([]);
|
|
157
|
-
});
|
|
158
|
-
test('should maintain order after multiple operations', () => {
|
|
159
|
-
const nums = [5, 3, 7, 1, 9, 2, 8, 4, 6];
|
|
160
|
-
nums.forEach(n => tree.insert(n, n * 10));
|
|
161
|
-
const values = [];
|
|
162
|
-
tree.forEach((_, value) => values.push(value));
|
|
163
|
-
expect(values).toEqual([10, 20, 30, 40, 50, 60, 70, 80, 90]);
|
|
164
|
-
});
|
|
165
|
-
});
|
|
166
|
-
});
|
|
167
|
-
//# sourceMappingURL=red-black-tree.test.js.map
|