-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.c
132 lines (125 loc) · 2.27 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
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
#include <stdarg.h>
#include <stddef.h>
#include "assert.h"
#include "mem.h"
#include "list.h"
#define T List_T
/* ***********************************/
/* ALL function should call and */
/* assign the return to the original*/
/* list. */
/* ***********************************/
/*
* Push a new node in front of the list.
* Similar to the FILO
* */
T List_push(T list, void *x)
{
T p;
NEW(p);
p->first = x;
p->rest = list;
return p;
}
/*
* Need a NULL at last argument
* */
T List_list(void *x, ...)
{
va_list ap;
T list = NULL, p;
va_start(ap, x);
for (; x; x = va_arg(ap, void *)) {
NEW(p);
p->first = x;
p->rest = list;
list = p;
}
va_end(ap);
return list;
}
/*
* The Link itself also soft-copy,which means
* after appending to the list, tail should not
* call the functio List_free, because at the time
* free list, it will free the tail again.
* */
T List_append(T list, T tail)
{
T *p = &list;
while (*p)
p = &(*p)->rest;
*p = tail;
return list;
}
/*
* Hard copy of the Link itself,
* but the data field is just reference.
* */
T List_copy(T list)
{
T head, *p = &head;
for (; list; list = list->rest) {
NEW(*p);
(*p)->first = list->first;
p = &(*p)->rest;
}
*p = NULL;
return head;
}
T List_pop(T list, void **x)
{
if (list) {
T head = list->rest;
if (x){
*x = list->first;
}
FREE(list);
return head;
} else
return list;
}
T List_reverse(T list)
{
T head = NULL, next;
for (; list; list = next) {
next = list->rest;
list->rest = head;
head = list;
}
return head;
}
int List_length(T list)
{
int n;
for (n = 0; list; list = list->rest)
n++;
return n;
}
void List_free(T *list)
{
T next;
assert(list);
for (; *list; *list = next) {
next = (*list)->rest;
FREE(*list);
}
}
void List_map(T list,
void apply(void **x, void *cl), void *cl) {
assert(apply);
for (; list; list = list->rest) {
apply(&list->first, cl);
}
}
void **List_toArray(T list, void *end)
{
int i, n = List_length(list);
void **array = ALLOC((n + 1) * sizeof(*array));
for (i = 0; i < n; i++) {
array[i] = list->first;
list = list->rest;
}
array[i] = end;
return array;
}