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
|
#include "singly_linked_list.h"
#include <cgreen/cgreen.h>
Describe(SinglyLinkedList);
BeforeEach(SinglyLinkedList){ }
AfterEach(SinglyLinkedList){ }
Ensure(SinglyLinkedList, when_getting_head) {
Node *head = initialize(100);
assert_that(get(head, 0), is_equal_to(head));
free(head);
}
Ensure(SinglyLinkedList, when_getting_mid) {
Node *head = initialize(100);
Node *mid = add(head, 200);
add(head, 300);
assert_that(get(head, 1), is_equal_to(mid));
assert_that(get(head, 1)->data, is_equal_to(200));
free(head);
}
Ensure(SinglyLinkedList, when_getting_tail) {
Node *head = initialize(100);
add(head, 200);
Node *tail = add(head, 300);
assert_that(get(head, 2), is_equal_to(tail));
free(head);
}
Ensure(SinglyLinkedList, when_getting_from_empty_list) {
assert_that(get(NULL, 2), is_equal_to(NULL));
}
Ensure(SinglyLinkedList, when_getting_negative_index) {
Node *head = initialize(100);
assert_that(get(head, -1), is_equal_to(NULL));
free(head);
}
Ensure(SinglyLinkedList, when_getting_index_out_of_range) {
Node *head = initialize(100);
assert_that(get(head, 1), is_equal_to(NULL));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_head) {
Node *head = initialize(100);
add(head, 200);
add(head, 300);
swap(&head, 0, 1);
assert_that(get(head, 0), is_non_null);
assert_that(get(head, 0)->data, is_equal_to(200));
assert_that(get(head, 1), is_non_null);
assert_that(get(head, 1)->data, is_equal_to(100));
assert_that(get(head, 2), is_non_null);
assert_that(get(head, 2)->data, is_equal_to(300));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_y_head) {
Node *head = initialize(100);
add(head, 200);
add(head, 300);
swap(&head, 1, 0);
assert_that(get(head, 0), is_non_null);
assert_that(get(head, 0)->data, is_equal_to(200));
assert_that(get(head, 1), is_non_null);
assert_that(get(head, 1)->data, is_equal_to(100));
assert_that(get(head, 2), is_non_null);
assert_that(get(head, 2)->data, is_equal_to(300));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_mid) {
Node *head = initialize(100);
add(head, 200);
add(head, 300);
add(head, 400);
swap(&head, 1, 2);
assert_that(get(head, 0)->data, is_equal_to(100));
assert_that(get(head, 1)->data, is_equal_to(300));
assert_that(get(head, 2)->data, is_equal_to(200));
assert_that(get(head, 3)->data, is_equal_to(400));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_y_mid) {
Node *head = initialize(100);
add(head, 200);
add(head, 300);
add(head, 400);
swap(&head, 2, 1);
assert_that(get(head, 0)->data, is_equal_to(100));
assert_that(get(head, 1)->data, is_equal_to(300));
assert_that(get(head, 2)->data, is_equal_to(200));
assert_that(get(head, 3)->data, is_equal_to(400));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_tail) {
Node *head = initialize(100);
add(head, 200);
add(head, 300);
swap(&head, 1, 2);
assert_that(get(head, 0), is_non_null);
assert_that(get(head, 0)->data, is_equal_to(100));
assert_that(get(head, 1), is_non_null);
assert_that(get(head, 1)->data, is_equal_to(300));
assert_that(get(head, 2), is_non_null);
assert_that(get(head, 2)->data, is_equal_to(200));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_index_out_of_range) {
Node *head = initialize(100);
add(head, 200);
add(head, 300);
swap(&head, 1, 3);
assert_that(get(head, 0)->data, is_equal_to(100));
assert_that(get(head, 1)->data, is_equal_to(200));
assert_that(get(head, 2)->data, is_equal_to(300));
free(head);
}
Ensure(SinglyLinkedList, when_swapping_self) {
Node *head = initialize(100);
swap(&head, 0, 0);
assert_that(get(head, 0), is_non_null);
assert_that(get(head, 0)->data, is_equal_to(100));
free(head);
}
TestSuite *swap_singly_linked_list_tests() {
TestSuite *suite = create_test_suite();
add_test_with_context(suite, SinglyLinkedList, when_getting_head);
add_test_with_context(suite, SinglyLinkedList, when_getting_mid);
add_test_with_context(suite, SinglyLinkedList, when_getting_tail);
add_test_with_context(suite, SinglyLinkedList, when_getting_from_empty_list);
add_test_with_context(suite, SinglyLinkedList, when_getting_negative_index);
add_test_with_context(suite, SinglyLinkedList, when_getting_index_out_of_range);
add_test_with_context(suite, SinglyLinkedList, when_swapping_head);
add_test_with_context(suite, SinglyLinkedList, when_swapping_y_head);
add_test_with_context(suite, SinglyLinkedList, when_swapping_mid);
add_test_with_context(suite, SinglyLinkedList, when_swapping_y_mid);
add_test_with_context(suite, SinglyLinkedList, when_swapping_tail);
add_test_with_context(suite, SinglyLinkedList, when_swapping_index_out_of_range);
add_test_with_context(suite, SinglyLinkedList, when_swapping_self);
return suite;
}
int main(int argc, char **argv) {
TestSuite *suite = create_test_suite();
add_suite(suite, swap_singly_linked_list_tests());
return run_test_suite(suite, create_text_reporter());
}
|
