-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueue.test.ts
123 lines (108 loc) · 3.06 KB
/
queue.test.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
import { expect, test } from 'vitest'
import { Queue } from './queue'
test('initializes with a size of 0', () => {
const queue = new Queue<number>();
expect(queue.size).toBe(0);
});
test('pushes an item to the queue', () => {
const queue = new Queue<number>();
queue.push(1);
expect(queue.size).toBe(1);
});
test('pushes an item to the queue and pop it', () => {
const queue = new Queue<number>();
queue.push(1);
expect(queue.size).toBe(1);
const item = queue.pop();
expect(item).toBe(1);
expect(queue.size).toBe(0);
});
test('pops the correct item from the queue', () => {
const queue = new Queue<number>();
queue.push(1);
queue.push(2);
const item = queue.pop();
expect(item).toBe(1);
expect(queue.size).toBe(1);
});
test('returns undefined when popping from an empty queue', () => {
const queue = new Queue<number>();
const item = queue.pop();
expect(item).toBeUndefined();
});
test('correctly alternates between push and pop operations', () => {
const queue = new Queue<number>();
queue.push(1);
queue.push(2);
expect(queue.pop()).toBe(1);
queue.push(3);
expect(queue.pop()).toBe(2);
expect(queue.pop()).toBe(3);
expect(queue.size).toBe(0);
});
test('maintains correct size with multiple operations', () => {
const queue = new Queue<number>();
queue.push(1);
queue.push(2);
queue.pop();
queue.push(3);
queue.pop();
expect(queue.size).toBe(1);
});
test('alternate push and pop', () => {
const queue = new Queue<number>()
queue.push(1);
queue.push(2);
expect(queue.pop()).toBe(1);
queue.push(3);
queue.push(4);
queue.push(5);
queue.push(6);
expect(queue.size).toBe(5);
expect(queue.pop()).toBe(2);
expect(queue.pop()).toBe(3);
expect(queue.pop()).toBe(4);
expect(queue.pop()).toBe(5);
queue.push(7);
expect(queue.pop()).toBe(6);
queue.push(8);
expect(queue.size).toBe(2);
expect(queue.pop()).toBe(7);
expect(queue.pop()).toBe(8);
})
test('size remains 0 after popping the only element', () => {
const queue = new Queue<number>();
queue.push(1);
queue.pop();
expect(queue.size).toBe(0);
});
test('size does not go negative after excessive pops', () => {
const queue = new Queue<number>();
queue.pop();
queue.pop();
queue.pop();
expect(queue.size).toBe(0);
});
test('handles types other than numbers', () => {
const queue = new Queue<string>();
queue.push('hello');
queue.push('world');
expect(queue.pop()).toBe('hello');
expect(queue.pop()).toBe('world');
expect(queue.size).toBe(0);
});
test('get first n items', () => {
const queue = new Queue<number>();
queue.push(1);
queue.push(2);
queue.push(3);
expect(queue.pop()).toBe(1);
queue.push(4);
queue.push(5);
queue.push(6);
expect(queue.first(3)).toEqual([2, 3, 4]);
expect(queue.first(5)).toEqual([2, 3, 4, 5, 6]);
expect(queue.first(10)).toEqual([2, 3, 4, 5, 6]);
expect(queue.first(0)).toEqual([]);
expect(queue.first(-1)).toEqual([]);
});