-
Notifications
You must be signed in to change notification settings - Fork 31.1k
Expand file tree
/
Copy pathDeque.test.js
More file actions
190 lines (141 loc) · 4.83 KB
/
Copy pathDeque.test.js
File metadata and controls
190 lines (141 loc) · 4.83 KB
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
import Deque from '../Deque';
describe('Deque', () => {
it('should create an empty deque', () => {
const deque = new Deque();
expect(deque).not.toBeNull();
expect(deque.isEmpty()).toBe(true);
expect(deque.size).toBe(0);
});
it('should peek at the front and back of an empty deque', () => {
const deque = new Deque();
expect(deque.peekFront()).toBeNull();
expect(deque.peekBack()).toBeNull();
});
it('should return null when removing from an empty deque', () => {
const deque = new Deque();
expect(deque.removeFront()).toBeNull();
expect(deque.removeBack()).toBeNull();
});
it('should add elements to the back and remove from the front (queue behaviour)', () => {
const deque = new Deque();
deque.addBack(1);
deque.addBack(2);
deque.addBack(3);
expect(deque.isEmpty()).toBe(false);
expect(deque.size).toBe(3);
expect(deque.peekFront()).toBe(1);
expect(deque.peekBack()).toBe(3);
expect(deque.removeFront()).toBe(1);
expect(deque.removeFront()).toBe(2);
expect(deque.removeFront()).toBe(3);
expect(deque.removeFront()).toBeNull();
expect(deque.isEmpty()).toBe(true);
});
it('should add elements to the front and remove from the back (reversed queue)', () => {
const deque = new Deque();
deque.addFront(1);
deque.addFront(2);
deque.addFront(3);
expect(deque.size).toBe(3);
expect(deque.peekFront()).toBe(3);
expect(deque.peekBack()).toBe(1);
expect(deque.removeBack()).toBe(1);
expect(deque.removeBack()).toBe(2);
expect(deque.removeBack()).toBe(3);
expect(deque.removeBack()).toBeNull();
expect(deque.isEmpty()).toBe(true);
});
it('should add elements to the front and remove from the front (stack behaviour)', () => {
const deque = new Deque();
deque.addFront('a');
deque.addFront('b');
deque.addFront('c');
expect(deque.peekFront()).toBe('c');
expect(deque.removeFront()).toBe('c');
expect(deque.removeFront()).toBe('b');
expect(deque.removeFront()).toBe('a');
expect(deque.isEmpty()).toBe(true);
});
it('should support mixed addFront and addBack operations', () => {
const deque = new Deque();
// Build: [3, 1, 2, 4]
deque.addBack(1);
deque.addBack(2);
deque.addFront(3);
deque.addBack(4);
expect(deque.size).toBe(4);
expect(deque.peekFront()).toBe(3);
expect(deque.peekBack()).toBe(4);
expect(deque.toArray()).toEqual([3, 1, 2, 4]);
});
it('should support mixed removeFront and removeBack operations', () => {
const deque = new Deque();
deque.addBack(1);
deque.addBack(2);
deque.addBack(3);
deque.addBack(4);
expect(deque.removeFront()).toBe(1);
expect(deque.removeBack()).toBe(4);
expect(deque.removeFront()).toBe(2);
expect(deque.removeBack()).toBe(3);
expect(deque.isEmpty()).toBe(true);
});
it('should handle a single element correctly', () => {
const deque = new Deque();
deque.addBack(42);
expect(deque.size).toBe(1);
expect(deque.peekFront()).toBe(42);
expect(deque.peekBack()).toBe(42);
expect(deque.removeFront()).toBe(42);
expect(deque.isEmpty()).toBe(true);
expect(deque.peekFront()).toBeNull();
expect(deque.peekBack()).toBeNull();
});
it('should handle object values', () => {
const deque = new Deque();
const obj1 = { key: 'value1' };
const obj2 = { key: 'value2' };
deque.addBack(obj1);
deque.addFront(obj2);
expect(deque.peekFront()).toEqual({ key: 'value2' });
expect(deque.peekBack()).toEqual({ key: 'value1' });
expect(deque.removeFront()).toEqual({ key: 'value2' });
expect(deque.removeFront()).toEqual({ key: 'value1' });
});
it('should convert to array correctly', () => {
const deque = new Deque();
expect(deque.toArray()).toEqual([]);
deque.addBack(1);
deque.addBack(2);
deque.addFront(0);
expect(deque.toArray()).toEqual([0, 1, 2]);
});
it('should convert to string correctly', () => {
const deque = new Deque();
deque.addBack(1);
deque.addBack(2);
deque.addBack(3);
expect(deque.toString()).toBe('1,2,3');
});
it('should convert to string with a custom callback', () => {
const deque = new Deque();
deque.addBack({ value: 1, key: 'test1' });
deque.addBack({ value: 2, key: 'test2' });
const toString = (value) => `${value.key}:${value.value}`;
expect(deque.toString(toString)).toBe('test1:1,test2:2');
});
it('should track size correctly after many operations', () => {
const deque = new Deque();
expect(deque.size).toBe(0);
deque.addBack(1);
expect(deque.size).toBe(1);
deque.addFront(0);
expect(deque.size).toBe(2);
deque.removeFront();
expect(deque.size).toBe(1);
deque.removeBack();
expect(deque.size).toBe(0);
deque.removeBack();
expect(deque.size).toBe(0);
});
});