-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTests_Heap.cpp
More file actions
207 lines (198 loc) · 4.8 KB
/
Tests_Heap.cpp
File metadata and controls
207 lines (198 loc) · 4.8 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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
#include "stdafx.h"
#include <stdio.h>
#include "Heap.h"
#include<iostream>
#include <ctime>
bool Test1() {//checking insert() and is_empty()
bool ok = 1;
Heap<int> H;
ok = ok && H.is_empty();
H.insert(1);
ok = ok && !H.is_empty();
if (!ok)
std::cout << "Test1 wasn't passed" << std::endl;
return ok;
}
bool Test2() {//checking insert() and get_min()
bool ok = 1;
Heap<int> H;
ok = ok && H.is_empty();
H.insert(11);
ok = ok && H.get_min() == 11;
ok = ok && !H.is_empty();
H.insert(1);
ok = ok && H.get_min() == 1;
ok = ok && !H.is_empty();
H.insert(2);
ok = ok && H.get_min() == 1;
ok = ok && !H.is_empty();
H.insert(9);
ok = ok && !H.is_empty();
ok = ok && H.get_min() == 1;
if (!ok)
std::cout << "Test2 wasn't passed" << std::endl;
return ok;
}
bool Test3() {//checking insert() and extract_min()
bool ok = 1;
Heap<int> H;
H.insert(12);
H.insert(3);
H.insert(5);
H.insert(1);
H.insert(13);
H.insert(9);
ok = ok && H.extract_min() == 1;
ok = ok && H.extract_min() == 3;
H.insert(7);
ok = ok && H.extract_min() == 5;
ok = ok && H.extract_min() == 7;
ok = ok && H.extract_min() == 9;
H.insert(9);
ok = ok && H.extract_min() == 9;
ok = ok && H.extract_min() == 12;
ok = ok && H.extract_min() == 13;
if (!ok)
std::cout << "Test3 wasn't passed" << std::endl;
return ok;
}
bool Test4() {//checking insert(), extract_min() and is_empty()
Heap<int> H;
bool ok = 1;
ok = ok && H.is_empty();
H.insert(9);
ok = ok && !H.is_empty();
H.insert(1);
ok = ok && !H.is_empty();
H.insert(13);
ok = ok && !H.is_empty();
H.insert(5);
ok = ok && !H.is_empty();
H.insert(12);
ok = ok && !H.is_empty();
H.insert(3);
ok = ok && !H.is_empty();
H.insert(7);
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 1;
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 3;
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 5;
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 7;
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 9;
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 12;
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 13;
ok = ok && H.is_empty();
if (!ok)
std::cout << "Test4 wasn't passed" << std::endl;
return ok;
}
bool Test5() {
Heap<char> H;
bool ok = 1;
ok = ok && H.is_empty();
H.insert('b');
ok = ok && !H.is_empty();
H.insert('a');
ok = ok && !H.is_empty();
H.insert('z');
ok = ok && !H.is_empty();
H.insert('s');
ok = ok && !H.is_empty();
H.insert('c');
ok = ok && !H.is_empty();
H.insert('d');
ok = ok && !H.is_empty();
H.insert('g');
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 'a';
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 'b';
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 'c';
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 'd';
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 'g';
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 's';
ok = ok && !H.is_empty();
ok = ok && H.extract_min() == 'z';
ok = ok && H.is_empty();
if (!ok)
std::cout << "Test5 wasn't passed" << std::endl;
return ok;
}
bool Test6() {//checking insert() and extract_min()
bool ok = 1;
Heap<int> H;
H.insert(21);
H.insert(3);
H.insert(1);
H.insert(11);
H.insert(13);
H.insert(9);
ok = ok && H.extract_min() == 1;
ok = ok && H.extract_min() == 3;
H.insert(7);
ok = ok && H.extract_min() == 7;
ok = ok && H.extract_min() == 9;
ok = ok && H.extract_min() == 11;
H.insert(3);
H.insert(5);
ok = ok && H.extract_min() == 3;
ok = ok && H.extract_min() == 5;
ok = ok && H.extract_min() == 13;
ok = ok && H.extract_min() == 21;
if (!ok)
std::cout << "Test6 wasn't passed" << std::endl;
return ok;
}
bool Test7() {//checking insert() and extract_min() big test
double start_time = clock();
Heap<int> H;
bool ok = 1;
for (int i = 0; i < 100000; ++i) {
H.insert(i);
}
for (int i = 0; i < 100000; ++i) {
ok = ok && H.extract_min() == i;
}
long double end_time = clock();
long double time = end_time - start_time; //time spent on the test
std::cout << "Test7: " << time / 1000 << " seconds" << std::endl;
if (!ok)
std::cout << "Test7 wasn't passed" << std::endl;
return ok;
}
bool Test8() {//checking insert() and extract_min() big test
double start_time = clock();
Heap<int> H;
bool ok = 1;
for (int i = 0; i < 1000000; ++i) {
H.insert(i);
}
for (int i = 0; i < 1000000; ++i) {
ok = ok && H.extract_min() == i;
}
long double end_time = clock();
long double time = end_time - start_time; //time spent on the test
std::cout << "Test8: " << time / 1000 << " seconds" << std::endl;
if (!ok)
std::cout << "Test8 wasn't passed" << std::endl;
return ok;
}
int main() {
bool ok = 1;
ok = Test1() && Test2() && Test3() && Test4() && Test5() && Test6() && Test7() && Test8();
if (ok)
std::cout << "OK" << std::endl;
else
std::cout << "FAILED" << std::endl;
return 0;
};