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
|
#include <cgreen/cgreen.h>
#include <string.h>
#include "priority_queue.h"
/*
Implement the methods of the priority queue interface using a singly-linked list.
* `add(x)`
* `deleteMin()`
* `size()`
Analyze the running time of the `add(x)` and `deletMin()` operations based on this implementation.
*/
static void inspect(PriorityQueue *queue) {
Node *tmp = queue->head;
while(tmp) {
printf("%d\n", tmp->data);
tmp = tmp->next;
}
}
Describe(PriorityQueue);
BeforeEach(PriorityQueue){ }
AfterEach(PriorityQueue){ }
Ensure(PriorityQueue, returns_size) {
PriorityQueue *queue = initialize();
assert_that(size(queue), is_equal_to(0));
destroy(queue);
}
Ensure(PriorityQueue, adds_a_node) {
PriorityQueue *queue = initialize();
Node *node = create_node(1, 0);
add(queue, node);
assert_that(size(queue), is_equal_to(1));
destroy(queue);
}
Ensure(PriorityQueue, removes_the_node_with_the_lowest_priority){
PriorityQueue *queue = initialize();
Node *min = create_node(1, 100);
Node *mid = create_node(2, 200);
Node *max = create_node(3, 300);
add(queue, max);
add(queue, min);
add(queue, mid);
assert_that(size(queue), is_equal_to(3));
assert_that(delete_min(queue), is_equal_to(min));
assert_that(queue->head, is_equal_to(mid));
destroy(queue);
};
TestSuite *priority_queue_tests() {
TestSuite *suite = create_test_suite();
add_test_with_context(suite, PriorityQueue, returns_size);
add_test_with_context(suite, PriorityQueue, adds_a_node);
add_test_with_context(suite, PriorityQueue, removes_the_node_with_the_lowest_priority);
return suite;
}
int main(int argc, char **argv) {
TestSuite *suite = create_test_suite();
add_suite(suite, priority_queue_tests());
return run_test_suite(suite, create_text_reporter());
}
|
