-
-
Notifications
You must be signed in to change notification settings - Fork 4.4k
/
Copy pathlist.c
80 lines (70 loc) · 1.33 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
#include "list.h"
#include <assert.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#define L List_T
/* Initial list */
L List_init(void)
{
L list;
list = (L)malloc(sizeof(L));
list->next = NULL;
return list;
}
/* Push an element into top of the list */
L List_push(L list, void *val)
{
L new_elem = (L)malloc(sizeof(L));
new_elem->val = val;
new_elem->next = list;
return new_elem;
}
/* Length of list */
int List_length(L list)
{
int n;
for (n = 0; list; list = list->next) n++;
return n - 1;
}
/* Convert list to array */
void **List_toArray(L list)
{
int i, n = List_length(list) + 1;
void **array = (void **)malloc((n + 1) * sizeof(*array));
for (i = 0; i < n; i++)
{
array[i] = list->val;
list = list->next;
}
array[i] = NULL;
return array;
}
/* Create and return a list */
L List_list(L list, void *val, ...)
{
va_list ap;
L *p = &list;
va_start(ap, val);
for (; val; val = va_arg(ap, void *))
{
*p = malloc(sizeof(L));
(*p)->val = val;
p = &(*p)->next;
}
*p = NULL;
va_end(ap);
return list;
}
/* Append 2 lists together */
L List_append(L list, L tail)
{
L *p = &list;
while ((*p)->next)
{
p = &(*p)->next;
}
*p = tail;
return list;
}