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
|
#ifndef ALGDS_LIST_H_
#define ALGDS_LIST_H_
#include <stdlib.h>
#include "type_alias.h"
#define LIST_DEF_AS(T, A) \
struct A##_node { \
T val; \
struct A##_node *prev; \
struct A##_node *next; \
}; \
typedef struct A##_node A##Node_; \
typedef A##Node_ *A##Iter; \
typedef struct { \
A##Node_ *vhead; \
A##Node_ *vtail; \
size_t len; \
} A; \
void A##_init(A *self); \
A A##_create(); \
void A##_free(A *self); \
A A##_move(A *self); \
A##Iter A##_insert_before(A *self, A##Iter iter, T val); \
A##Iter A##_insert_after(A *self, A##Iter iter, T val); \
void A##_remove(A *self, A##Iter iter); \
A##Iter A##_begin(A *self); \
A##Iter A##_last(A *self); \
A##Iter A##_end(A *self); \
A##Iter A##_next(A##Iter iter); \
A##Iter A##_prev(A##Iter iter); \
size_t A##_len(A *self); \
A##Iter A##_push_back(A *self, T val); \
A##Iter A##_push_front(A *self, T val); \
void A##_pop_back(A *self); \
void A##_pop_front(A *self);
#define LIST_DEF(T) LIST_DEF_AS(T, T##List)
LIST_DEF(Int);
LIST_DEF(Bool);
LIST_DEF(Long);
LIST_DEF(Char);
LIST_DEF(UInt);
LIST_DEF(ULong);
LIST_DEF(Double);
LIST_DEF(Float);
LIST_DEF(String);
LIST_DEF(VoidPtr);
#define LIST_IMPL_AS(T, A) \
void A##_init(A *self) { \
self->vhead = malloc(sizeof(A##Node_)); \
self->vtail = malloc(sizeof(A##Node_)); \
self->vhead->next = self->vtail; \
self->vhead->prev = NULL; \
self->vtail->next = NULL; \
self->vtail->prev = self->vhead; \
self->len = 0; \
} \
A A##_create() { \
A self; \
A##_init(&self); \
return self; \
} \
void A##_free(A *self) { \
A##Iter cur = self->vhead; \
while (cur != NULL) { \
A##Iter next = cur->next; \
free(cur); \
cur = next; \
} \
} \
A A##_move(A *self) { \
A dup; \
dup.vhead = self->vhead; \
dup.vtail = self->vtail; \
dup.len = self->len; \
self->vhead = NULL; \
self->vtail = NULL; \
self->len = 0; \
return dup; \
} \
A##Iter A##_insert_before(A *self, A##Iter iter, T val) { \
if (iter->prev == NULL) return NULL; \
A##Iter newnode = malloc(sizeof(A##Node_)); \
newnode->prev = iter->prev; \
newnode->next = iter; \
newnode->val = val; \
iter->prev->next = newnode; \
iter->prev = newnode; \
self->len++; \
return newnode; \
} \
A##Iter A##_insert_after(A *self, A##Iter iter, T val) { \
if (iter->next == NULL) return NULL; \
A##Iter newnode = malloc(sizeof(A##Node_)); \
newnode->next = iter->next; \
newnode->prev= iter; \
newnode->val = val; \
iter->next->prev= newnode; \
iter->next = newnode; \
self->len++; \
return newnode; \
} \
void A##_remove(A *self, A##Iter iter) { \
if (iter->prev == NULL || iter->next == NULL) return; \
iter->prev->next = iter->next; \
iter->next->prev = iter->prev; \
free(iter); \
self->len--; \
} \
A##Iter A##_begin(A *self) { \
return self->vhead->next; \
} \
A##Iter A##_last(A *self) { \
if (self->vtail->prev == self->vhead) return NULL; \
return self->vtail->prev; \
} \
A##Iter A##_end(A *self) { \
return self->vtail; \
} \
A##Iter A##_next(A##Iter iter) { \
if (iter == NULL) return NULL; \
return iter->next; \
} \
A##Iter A##_prev(A##Iter iter) { \
if (iter == NULL) return NULL; \
if (iter->prev == NULL) return NULL; \
if (iter->prev->prev == NULL) return NULL; \
return iter->prev; \
} \
size_t A##_len(A *self) { \
return self->len; \
} \
A##Iter A##_push_back(A *self, T val) { \
return A##_insert_before(self, self->vtail, val); \
} \
A##Iter A##_push_front(A *self, T val) { \
return A##_insert_after(self, self->vhead, val); \
} \
void A##_pop_back(A *self) { \
A##_remove(self, self->vtail->prev); \
} \
void A##_pop_front(A *self) { \
A##_remove(self, self->vhead->next); \
}
#define LIST_IMPL(T) LIST_IMPL_AS(T, T##List)
#endif
|
