-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.c
101 lines (90 loc) · 1.63 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
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
#include"list.h"
struct list* list_create(void *data)
{
struct list *l = malloc(sizeof(struct list));
l->next = NULL;
l->data = data;
return l;
}
struct list* list_init(void *data)
{
struct list *l = malloc(sizeof(struct list));
l->data = NULL;
l->next = list_create(data);
return l;
}
int list_is_empty(struct list *list)
{
return list->next == NULL;
}
size_t list_len(struct list *list)
{
size_t count = 0;
while(list->next)
{
list = list->next;
count++;
}
return count;
}
void list_push_front(struct list *list, struct list *elm)
{
elm->next = list->next;
list->next = elm;
}
struct list* list_pop_front(struct list *list)
{
struct list *l = list->next;
if(l)
list->next = l->next;
return l;
}
void list_push_back(struct list *list, struct list *elm)
{
while(list->next)
list = list->next;
list->next = elm;
}
void list_print_int(struct list *list)
{
if(!list_is_empty(list))
{
list = list->next;
printf("%d", *((int*) list->data));
while(list->next)
{
if(!list->next->data)
printf(" -> None");
else
printf(" -> %d", *((int*) list->next->data));
list = list->next;
}
printf("\n");
}
}
void list_delete(struct list *list)
{
struct list *l = list;
while(list)
{
l = list->next;
free(list);
list = l;
}
}
void* list_get(struct list *l, size_t n)
{
for(size_t i = 0; i < n + 1 && l; i++)
l = l->next;
return l->data;
}
struct list* list_copy(struct list *list)
{
struct list *l = list_create(NULL);
while(list->next)
{
list = list->next;
list_push_back(l, list_create(list->data));
}
return l;
}