forked from loiane/javascript-datastructures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdeque.spec.ts
204 lines (164 loc) · 5.21 KB
/
deque.spec.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
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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
import 'mocha';
import { expect } from 'chai';
import Deque from '../../../src/ts/data-structures/deque';
describe('Deque', () => {
let deque: Deque<number>;
beforeEach(() => {
deque = new Deque<number>();
});
it('starts empty', () => {
expect(deque.size()).to.equal(0);
expect(deque.isEmpty()).to.equal(true);
});
it('add elements in the back', () => {
deque.addBack(1);
expect(deque.size()).to.equal(1);
deque.addBack(2);
expect(deque.size()).to.equal(2);
deque.addBack(3);
expect(deque.size()).to.equal(3);
});
it('add elements in the front', () => {
deque.addFront(1);
expect(deque.size()).to.equal(1);
deque.addFront(2);
expect(deque.size()).to.equal(2);
deque.addFront(3);
expect(deque.size()).to.equal(3);
deque.removeFront();
deque.addFront(4);
expect(deque.size()).to.equal(3);
});
it('remove elements from the back', () => {
deque.addBack(1);
deque.addBack(2);
deque.addBack(3);
deque.addFront(0);
expect(deque.removeBack()).to.equal(3);
expect(deque.removeBack()).to.equal(2);
expect(deque.removeBack()).to.equal(1);
expect(deque.removeBack()).to.equal(0);
expect(deque.removeBack()).to.equal(undefined);
});
it('remove elements from the front', () => {
deque.addFront(1);
deque.addBack(2);
deque.addBack(3);
deque.addFront(0);
deque.addFront(-1);
deque.addFront(-2);
expect(deque.removeFront()).to.equal(-2);
expect(deque.removeFront()).to.equal(-1);
expect(deque.removeFront()).to.equal(0);
expect(deque.removeFront()).to.equal(1);
expect(deque.removeFront()).to.equal(2);
expect(deque.removeFront()).to.equal(3);
expect(deque.removeFront()).to.equal(undefined);
});
it('allows to peek at the front element in the deque without removing it', () => {
expect(deque.peekFront()).to.equal(undefined);
deque.addFront(1);
expect(deque.peekFront()).to.equal(1);
deque.addBack(2);
expect(deque.peekFront()).to.equal(1);
deque.addBack(3);
expect(deque.peekFront()).to.equal(1);
deque.addFront(0);
expect(deque.peekFront()).to.equal(0);
deque.addFront(-1);
expect(deque.peekFront()).to.equal(-1);
deque.addFront(-2);
expect(deque.peekFront()).to.equal(-2);
});
it('allows to peek at the last element in the deque without removing it', () => {
expect(deque.peekBack()).to.equal(undefined);
deque.addFront(1);
expect(deque.peekBack()).to.equal(1);
deque.addBack(2);
expect(deque.peekBack()).to.equal(2);
deque.addBack(3);
expect(deque.peekBack()).to.equal(3);
deque.addFront(0);
expect(deque.peekBack()).to.equal(3);
deque.addFront(-1);
expect(deque.peekBack()).to.equal(3);
deque.addFront(-2);
expect(deque.peekBack()).to.equal(3);
});
it('returns the correct size', () => {
expect(deque.size()).to.equal(0);
deque.addFront(1);
expect(deque.size()).to.equal(1);
deque.addBack(2);
expect(deque.size()).to.equal(2);
deque.addBack(3);
expect(deque.size()).to.equal(3);
deque.addFront(0);
expect(deque.size()).to.equal(4);
deque.addFront(-1);
expect(deque.size()).to.equal(5);
deque.addFront(-2);
expect(deque.size()).to.equal(6);
deque.clear();
expect(deque.size()).to.equal(0);
deque.addFront(1);
deque.addBack(2);
expect(deque.size()).to.equal(2);
deque.removeFront();
deque.removeBack();
expect(deque.size()).to.equal(0);
});
it('returns if it is empty', () => {
expect(deque.isEmpty()).to.equal(true);
deque.addFront(1);
expect(deque.isEmpty()).to.equal(false);
deque.addBack(2);
expect(deque.isEmpty()).to.equal(false);
deque.clear();
expect(deque.isEmpty()).to.equal(true);
deque.addFront(1);
deque.addBack(2);
expect(deque.isEmpty()).to.equal(false);
deque.removeFront();
expect(deque.isEmpty()).to.equal(false);
deque.removeBack();
expect(deque.isEmpty()).to.equal(true);
});
it('clears the queue', () => {
deque.clear();
expect(deque.isEmpty()).to.equal(true);
deque.addFront(1);
deque.addBack(2);
expect(deque.isEmpty()).to.equal(false);
deque.clear();
expect(deque.isEmpty()).to.equal(true);
});
it('returns toString primitive types', () => {
expect(deque.toString()).to.equal('');
deque.addFront(1);
expect(deque.toString()).to.equal('1');
deque.addBack(2);
expect(deque.toString()).to.equal('1,2');
deque.clear();
expect(deque.toString()).to.equal('');
const queueString = new Deque<string>();
queueString.addFront('el1');
expect(queueString.toString()).to.equal('el1');
queueString.addBack('el2');
expect(queueString.toString()).to.equal('el1,el2');
});
it('returns toString objects', () => {
class MyObj {
constructor(public el1: any, public el2: any) {}
toString() {
return `${this.el1.toString()}|${this.el2.toString()}`;
}
}
const dequeMyObj = new Deque<MyObj>();
expect(dequeMyObj.toString()).to.equal('');
dequeMyObj.addFront(new MyObj(1, 2));
expect(dequeMyObj.toString()).to.equal('1|2');
dequeMyObj.addBack(new MyObj(3, 4));
expect(dequeMyObj.toString()).to.equal('1|2,3|4');
});
});