/
test.c
210 lines (188 loc) · 5.53 KB
/
test.c
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
#include <stdio.h>
#include "heap.h"
#define ANSI_COLOR_RED "\x1b[31m"
#define ANSI_COLOR_GREEN "\x1b[32m"
#define ANSI_COLOR_YELLOW "\x1b[33m"
#define ANSI_COLOR_BLUE "\x1b[34m"
#define ANSI_COLOR_MAGENTA "\x1b[35m"
#define ANSI_COLOR_CYAN "\x1b[36m"
#define ANSI_COLOR_RESET "\x1b[0m"
void printFailed(char *toPrint);
void printPassed(void);
void testSort(void);
void testNewHeap(void);
void runTests(void);
void testFindLargestChild(void);
Heap setupUnorderedHeap();
Node nodeAt(Node *nodes, int i);
void testDelete(void);
void testInsert(void);
int main(void) {
runTests();
return 0;
}
void runTests(void) {
testNewHeap();
testFindLargestChild();
testDelete();
testInsert();
testSort();
}
void testDelete(void) {
printf("Running delete test\n");
Heap heap = setupUnorderedHeap();
makeMaxHeap(heap);
deleteFromHeap(heap, 4);
if (!isMaxHeap(heap) || heap->numNodes != 9) {
printFailed("Not a max heap after deleting 4");
}
printPassed();
}
void testInsert(void) {
printf("Running insert test\n");
Heap heap = setupUnorderedHeap();
makeMaxHeap(heap);
deleteFromHeap(heap, 4);
insertIntoHeap(heap, newNode(14));
if (!isMaxHeap(heap) || heap->numNodes != 10) {
printFailed("Not a max heap after deleting 4 and inserting 14");
return;
}
deleteFromHeap(heap, 1);
insertIntoHeap(heap, newNode(5));
if (!isMaxHeap(heap) || heap->numNodes != 10) {
printFailed("Not a max heap after reinserting 4");
return;
}
printPassed();
}
void testSort(void) {
printf("Running heapSort test\n");
Node nodes[10] = { newNode(10), newNode(1), newNode(7), newNode(4), newNode(3), newNode(6), newNode(9), newNode(2), newNode(5), newNode(8) };
Heap heap = newHeap(10, nodes);
Node *sortedNodes = heapSort(heap);
for(int i = 0; i<10; i++) {
int expected = i + 1;
if(nodeAt(sortedNodes, i)->data != expected) {
char message[50];
sprintf(message, "expected data=%d, got data=%d", expected, (*(sortedNodes + i))->data);
printFailed(message);
return;
}
}
printPassed();
}
void testNewHeap(void) {
printf("Running newHeap test\n");
Node nodes[10] = { newNode(1), newNode(2), newNode(3), newNode(4), newNode(5), newNode(6), newNode(7), newNode(8), newNode(9), newNode(10) };
Heap heap = newHeap(10, nodes);
Node *sortedNodes = getNodes(heap);
for(int i = 0; i<10; i++) {
int expected = i + 1;
if(nodeAt(sortedNodes, i)->data != expected) {
char message[50];
sprintf(message, "expected data=%d, got data=%d", expected, (*(sortedNodes + i))->data);
printFailed(message);
return;
}
}
printPassed();
}
void testFindLargestChild() {
printf("Running test: Find largest child\n");
Heap heap = setupUnorderedHeap();
int node;
int expected;
int actual;
char buffer[59];
// Test value 10
node = 1;
expected = NONE;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
// Test value 7
node = 3;
expected = 7;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
// Test value 9
node = 7;
expected = NONE;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
// Test value 1
node = 2;
expected = 4;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
// Test value 8
node = 10;
expected = NONE;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
// Test value 8
node = 9;
expected = NONE;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
// Test value 8
node = 6;
expected = NONE;
actual = findLargestChild(heap,node);
if (actual != expected) {
sprintf(buffer, "findLargestChild: expected=%d, got=%d for node=%d",expected, actual, node);
printFailed(buffer);
return;
}
printPassed();
}
Node nodeAt(Node *nodes, int i) {
return *(nodes + i);
}
void printFailed(char *message) {
printf(ANSI_COLOR_RED "FAILED: " ANSI_COLOR_RESET);
printf(ANSI_COLOR_RED "%s" ANSI_COLOR_RESET, message);
printf("\n");
}
void printPassed() {
printf(ANSI_COLOR_GREEN "PASSED\n" ANSI_COLOR_RESET);
}
Heap setupUnorderedHeap() {
Node nodes[10] = {
/*1*/ newNode(10),
/*2*/ newNode(1),
/*3*/ newNode(7),
/*4*/ newNode(4),
/*5*/ newNode(3),
/*6*/ newNode(6),
/*7*/ newNode(9),
/*8*/ newNode(2),
/*9*/ newNode(5),
/*10*/ newNode(8)
};
return newHeap(10, nodes);
}