-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_linked_list.c
203 lines (159 loc) · 5.96 KB
/
test_linked_list.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
//use "gcc -g -idirafter ../src/ test_linked_list.c ../src/linked_list.c" when compiling
//use "valgrind --leak-check=yes ./a.out" to check errors with memory
//it is supposed that all functions for a linked list must be tested here in various situations.
#include<linked_list.h>
int main(void)
{
//initializing new list
puts("Initializing first list");
List* list = init();
printf("Now list has %zu nodes\n", size(list));
//testing insertHead
insertHead(list, "my string", 10);
printf("Now list has %zu nodes\n", size(list));
traverse(list);
traverseData(list);
//testing insertHead
insertHead(list, "my new head string", 19);
puts(" ");
traverse(list);
//testing insertNext
insertNext(list, list->head, "Some words to store", 20);
puts(" ");
printf("Now list has %zu nodes\n", size(list));
traverse(list);
//testing nextNode
Node* ptr = nextNode(list->head); //pointer pointing to the next node after the head
//testing insertNext
insertNext(list, ptr, "Some more words to store", 26);
puts(" ");
printf("Now list has %zu nodes\n", size(list));
traverse(list);
traverseData(list);
puts(" ");
//testing insertAfterIndex
insertAfterIndex(list, 1, "Insert with index", 18);
printf("Now list has %zu nodes\n", size(list));
traverseData(list);
//testing removing elements
removeHead(list);
puts(" ");
printf("Now list has %zu nodes\n", size(list));
traverseData(list);
removeNodeAfterAddress(list, list->head);
puts(" ");
printf("Now list has %zu nodes\n", size(list));
traverseData(list);
removeNodeAfterAddress(list, list->head);
puts(" ");
printf("Now list has %zu nodes\n", size(list));
traverseData(list);
//testing data and dataAtIndex
printf("testing data() - %s\n", data(list, list->head));
printf("testing dataAtIndex() - %s\n", dataAtIndex(list, 1));
puts(" ");
//testing getHead and getTail
printf("Now list has %zu nodes\n", size(list));
printf("List head at - %p\n", getHead(list));
printf("List tail at - %p\n", getTail(list));
traverse(list);
puts(" ");
int rem = removeList(list);
if(!rem)
puts("removeList works for the first list");
puts("----------------------------------------\n");
//initializing new list
puts("Initializing second list");
List* list2 = init();
printf("Now list has %zu nodes\n", size(list2));
//testing removing an empty list
int rem2 = removeList(list2);
if(!rem2)
puts("removeList works for the second list");
puts("----------------------------------------\n");
//initializing new list
puts("Initializing third list");
List* list3 = init();
printf("Now list has %zu nodes\n", size(list3));
//testing traversing an empty list
traverse(list3);
traverseData(list3);
//testing insertNext in a wrong situation
insertNext(list3, list3->head, "Some words to store", 20);
traverseData(list3);
//testing insertAfterIndex in a wrong situation
insertAfterIndex(list3, 0, "Some string1", 13);
insertAfterIndex(list3, 1, "Some string2", 13);
traverseData(list3);
//testing removeNodeAfterAddress in a wrong situation
removeNodeAfterAddress(list3, list3->head);
removeNodeAfterAddress(list3, list3->tail);
//testing removeHead in a wrong situation
removeHead(list3);
//testing data and dataAtIndex in a wrong situation
if(data(list3, list3->head))
printf("testing data() - %s\n", data(list3, list3->head));
if(dataAtIndex(list3, 1))
printf("testing dataAtIndex() - %s\n", dataAtIndex(list3, 1));
int rem3 = removeList(list3);
if(!rem3)
puts("removeList works for the third list");
puts("----------------------------------------\n");
//initializing forth list
//testing node addresses in various situations
puts("Initializing forth list");
List* list4 = init();
insertHead(list4, "head1", 6);
insertHead(list4, "head2", 6);
insertHead(list4, "head3", 6);
printf("Now list has %zu nodes\n", size(list4));
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
removeHead(list4);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
removeHead(list4);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
insertAfterIndex(list4, 0, "tail", 5);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
removeNodeAfterAddress(list4, list4->head);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
insertNext(list4, list4->head, "tail", 5);
insertNext(list4, list4->head, "middle", 7);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
insertNext(list4, list4->head->next, "middle2", 8);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
removeNodeAfterAddress(list4, list4->head->next);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
insertNext(list4, list4->tail, "tail2", 6);
traverse(list4);
printf("List4 head at - %p\n", getHead(list4));
printf("List4 tail at - %p\n", getTail(list4));
puts("\n");
int rem4 = removeList(list4);
if(!rem4)
puts("removeList works for the forth list");
return 0;
}