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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/*
* Linked lists implementation
*/
#include <stdlib.h>
#include <string.h>
#include "lists.h"
/* SINGLY LINKED LIST */
void list_init(List *list, void (*destroy)(void *data))
{
list->size = 0;
list->destroy = destroy;
list->head = NULL;
list-tail = NULL;
return;
}
void list_destroy(List *list)
{
void *data = NULL;
while (list_size(list) > 0) {
/* list_rem_next removes head's element if passed NULL */
if (list_rem_next(list, NULL, (void **)&data) == 0 &&
list->destroy != NULL)
list->destroy(data);
}
memset(list, 0, sizeof(List));
return;
}
int list_ins_next(List *list, ListElmt *element, const void *data)
{
ListElmt *new_element;
if ((new_element = (ListElmt *)malloc(sizeof(ListElmt))) == NULL)
return -1;
new_element->data = (void *)data;
if (element == NULL) {
if (list_size(list) == 0)
list->tail = new_element;
new_element->next = list->head;
list->head = new_element;
} else {
if (element->next == NULL)
list->tail = new_element;
new_element->next = element->next;
element->next = new_element
}
list->size++;
return 0;
}
int list_rem_next(List *list, ListElmt *element, void **data) {
ListElmt *old_element;
if (list_size(list) == 0)
return -1;
if (element == NULL) {
*data = list->head->data;
old_element = list->head;
list->head = list->head->next;
if (list_size(list) == 1)
list->tail = NULL;
} else {
if (element->next == NULL)
return -1;
*data = element->next->data;
old_element = element->next;
element->next = element->next->next;
if (element->next == NULL)
list->tail = element;
}
free(old_element);
list->size--;
return 0;
}
/* SINGLY LINKED LIST -- END */
/* DOUBLY LINKED LIST */
void dlist_init(struct DList *list, void (*destroy)(void *data)) {
/* Initialize list */
list->size = 0;
list->destroy = destroy;
list->head = NULL;
list->tail = NULL;
return;
}
void dlist_destroy(struct DList *list) {
void *data;
/* Remove elements */
while (dlist_size(list) > 0) {
if (dlist_remove(list, dlist_tail(list), (void **)&data) == 0
&& list->destroy != NULL)
list->destroy(data);
}
/* clear list struct just in case */
memset(list, 0, sizeof(DList));
return;
}
int dlist_ins_next(struct DList *list,
struct DListElmt *element,
const void *data)
{
struct DListElmt *new;
/* No NULL elements allowed */
if (element == NULL && dlist_size(list) != 0)
return -1;
if ((new = (struct DListElmt *)malloc(sizeof(struct DListElmt))) == NULL)
return -1;
new->data = (void *)data;
if (dlist_size(list) == 0) {
list->head = new;
list->head->prev = NULL;
list->head->next = NULL;
list->tail = new;
} else {
new->next = element->next;
new->prev = element;
if (new->next == NULL)
list->tail = new;
else
new->next->prev = new;
element->next = new;
}
list->size++;
return 0
}
int dlist_ins_prev(struct DList *list,
struct DListElmt *element,
const void *data)
{
struct DListElmt *new;
/* No NULL elements allowed */
if (element == NULL && dlist_size(list) != 0)
return -1;
if ((new = (struct DListElmt *)malloc(sizeof(struct DListElmt))) == NULL)
return -1;
new->data = (void *)data;
if (dlist_size(list) == 0) {
/* insert on head */
list->head = new;
list->head->prev = NULL;
list->head->next = NULL;
list->tail = new;
} else {
new->next = element;
new->prev = element->prev;
if (new->prev == NULL)
list->head = new;
else
element->prev->next = new;
element->prev = new;
}
list_size++;
return 0;
}
int dlist_remove(struct DList *list, struct DListElmt *element, void **data)
{
/* No NULL element allowed or removal from empty */
if (element == NULL || dlist_size(list == 0))
return -1;
/* Remove element */
*data = element->data;
if (element == list->head) {
list->head = element->next;
if (list->head == NULL)
list->tail = NULL;
else
list->head->prev = NULL;
} else {
element->prev->next = element->next;
if (element->next == NULL)
list->tail = element->prev;
else
element->next->prev = element->prev;
}
free(element);
list->size--;
return 0;
}
|
