-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.c
70 lines (63 loc) · 1.71 KB
/
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
#include <stdlib.h>
#include <string.h>
#include "list.h"
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;
while(list_size(list) > 0){
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 = 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;
}