-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.cpp
305 lines (205 loc) · 4.1 KB
/
test.cpp
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
/*
* test.cpp
*
* Unit tests for MaxHeap class
*
* @author Juan Arias
*
*/
#include <iostream>
#include <string>
#include <cassert>
#include "maxheap.h"
/*
* Unit tests for constructors & assignment operator overload
*/
void constructorsAndAssignment() {
Heap<int>* heap = new MaxHeap<int>;
delete heap;
int testArr[10]{5, 2, 8, 3, 1, 9, 7, 6, 4, 0};
Heap<int>* heap1 = new MaxHeap<int>(testArr, 10);
Heap<int>* heap2 = new MaxHeap<int>(*heap1);
delete heap2;
heap2 = new MaxHeap<int>;
(*heap2) = (*heap1);
delete heap2, heap1;
}
/*
* Unit tests for contains
*/
void contains() {
std::string testArr[10]{ "GYRO", "CISCO", "POPS", "DISK", "BASE", "QUAVO",
"MONSTER", "JACKA", "ELON", "ACE" };
Heap<std::string>* heap = new MaxHeap<std::string>(testArr, 10);
for (std::string word : testArr) {
assert(heap->contains(word));
}
delete heap;
}
template<class T>
void addsert(Heap<T>* heap, const T& item) {
heap->add(item);
assert(heap->contains(item));
}
/*
* Unit test for add
*/
void add() {
Heap<char>* heap = new MaxHeap<char>();
for (char c('a'); c <= 'z'; ++c) {
addsert(heap, c);
}
delete heap;
}
template <class T>
void removesert(Heap<T>* heap, const T& item) {
heap->remove();
assert(!heap->contains(item));
}
/*
* Unit test for remove
*/
void remove() {
Heap<char>* heap = new MaxHeap<char>();
for (char c('a'); c <= 'z'; ++c) {
addsert(heap, c);
}
for (char c('z'); c >= 'a'; --c) {
removesert(heap, c);
}
delete heap;
}
/*
* Unit test for isEmpty
*/
void isEmpty() {
Heap<double>* heap = new MaxHeap<double>();
assert(heap->isEmpty());
for (double d(5.23); d <= 23.04; d += 2.40) {
addsert(heap, d);
}
for (double d(23.04); d >= 5.23; d -= 2.40) {
removesert(heap, d);
}
assert(heap->isEmpty());
delete heap;
}
/*
* Unit test for clear
*/
void clear() {
Heap<long>* heap = new MaxHeap<long>();
for (long l(250000); l <= 10000000; l += 250000) {
addsert(heap, l);
}
heap->clear();
assert(heap->isEmpty());
delete heap;
}
template <class T>
void peeksert(Heap<T>* heap, const T& item) {
assert(heap->peek() == item);
removesert(heap, item);
}
/*
* Unit test for peek
*/
void peek() {
std::string testArr[10] {"GYRO", "CISCO", "POPS", "DISK", "BASE", "QUAVO",
"MONSTER", "JACKA", "ELON", "ACE" };
Heap<std::string>* heap = new MaxHeap<std::string>(testArr, 10);
std::string peek("QUAVO");
peeksert(heap, peek);
peek = "POPS";
peeksert(heap, peek);
peek = "MONSTER";
peeksert(heap, peek);
peek = "JACKA";
peeksert(heap, peek);
peek = "GYRO";
peeksert(heap, peek);
peek = "ELON";
peeksert(heap, peek);
peek = "DISK";
peeksert(heap, peek);
peek = "CISCO";
peeksert(heap, peek);
peek = "BASE";
peeksert(heap, peek);
peek = "ACE";
peeksert(heap, peek);
delete heap;
}
/*
* Unit test for getNodes
*/
void getNodes() {
Heap<int>* heap = new MaxHeap<int>;
for (int i(1); i <= 50; ++i) {
addsert(heap, i);
assert(heap->getNodes() == i);
}
heap->clear();
assert(heap->getNodes() == 0);
delete heap;
}
/*
* Unit test for getHeight
*/
void getHeight() {
Heap<int>* heap = new MaxHeap<int>();
for (int i(0); i < 90; ++i) {
addsert(heap, i);
assert(heap->peek() == i);
}
assert(heap->getHeight() == 7);
}
/*
* Unit test for equality operator overloads
*/
void operators() {
Heap<int>* heap1 = new MaxHeap<int>;
for (int i(1); i <= 50; ++i) {
addsert(heap1, i);
}
Heap<int>* heap2 = new MaxHeap<int>(*heap1);
assert(*heap1 == *heap2);
heap1->remove();
assert(*heap1 != *heap2);
heap2->remove();
assert(*heap1 == *heap2);
delete heap2;
heap2 = new MaxHeap<int>;
for (int i(1); i <= 50; ++i) {
addsert(heap2, i);
}
assert(*heap1 != *heap2);
heap1->add(50);
assert(*heap1 == *heap2);
heap1->clear();
heap2->clear();
assert(*heap1 == *heap2);
delete heap1, heap2;
}
/*
* Runs all unit tests
*/
void runTests() {
constructorsAndAssignment();
contains();
add();
remove();
isEmpty();
clear();
peek();
getNodes();
getHeight();
operators();
}
/*
* Begins unit testing
*/
int main() {
runTests();
std::cout << "Success!" << std::endl;
}