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
|
#ifndef ALGDS_LIST_H_
#define ALGDS_LIST_H_
#include <stdlib.h>
#include "type_alias.h"
#define LIST_DEF(T) \
struct T##List_node { \
T val; \
struct T##List_node *prev; \
struct T##List_node *next; \
}; \
typedef struct T##List_node T##ListNode; \
typedef T##ListNode *T##ListIter; \
typedef struct { \
T##ListNode *vhead; \
T##ListNode *vtail; \
size_t len; \
} T##List; \
void T##List_init(T##List *self); \
void T##List_free(T##List *self); \
void T##List_move(T##List *self); \
T##ListIter T##List_insert_before(T##List *self, T##ListIter iter, T val); \
T##ListIter T##List_insert_after(T##List *self, T##ListIter iter, T val); \
void T##List_remove(T##List *self, T##ListIter iter); \
T##ListIter T##List_begin(T##List *self); \
T##ListIter T##List_last(T##List *self); \
T##ListIter T##List_end(T##List *self); \
T##ListIter T##List_next(T##ListIter iter); \
T##ListIter T##List_prev(T##ListIter iter); \
size_t T##List_len(T##List *self); \
T##ListIter T##List_push_back(T##List *self, T val); \
T##ListIter T##List_push_front(T##List *self, T val); \
void T##List_pop_back(T##List *self); \
void T##List_pop_front(T##List *self); \
LIST_DEF(Int);
#define LIST_IMPL(T) \
void T##List_init(T##List *self) { \
self->vhead = malloc(sizeof(T##ListNode)); \
self->vtail = malloc(sizeof(T##ListNode)); \
self->vhead->next = self->vtail; \
self->vhead->prev = NULL; \
self->vtail->next = NULL; \
self->vtail->prev = self->vhead; \
self->len = 0; \
} \
void T##List_free(T##List *self) { \
T##ListIter cur = self->vhead; \
while (cur != NULL) { \
T##ListIter next = cur->next; \
free(cur); \
cur = next; \
} \
} \
void T##List_move(T##List *self) { \
T##List dup; \
dup.vhead = self->vhead; \
dup.vtail = self->vtail; \
dup.len = self->len; \
self->vhead = NULL; \
self->vtail = NULL; \
self->len = 0; \
} \
T##ListIter T##List_insert_before(T##List *self, T##ListIter iter, T val) { \
if (iter->prev == NULL) return NULL; \
T##ListIter newnode = malloc(sizeof(T##ListNode)); \
newnode->prev = iter->prev; \
newnode->next = iter; \
newnode->val = val; \
iter->prev->next = newnode; \
iter->prev = newnode; \
self->len++; \
return newnode; \
} \
T##ListIter T##List_insert_after(T##List *self, T##ListIter iter, T val) { \
if (iter->next == NULL) return NULL; \
T##ListIter newnode = malloc(sizeof(T##ListNode)); \
newnode->next = iter->next; \
newnode->prev= iter; \
newnode->val = val; \
iter->next->prev= newnode; \
iter->next = newnode; \
self->len++; \
return newnode; \
} \
void T##List_remove(T##List *self, T##ListIter iter) { \
if (iter->prev == NULL || iter->next == NULL) return; \
iter->prev->next = iter->next; \
iter->next->prev = iter->prev; \
free(iter); \
self->len--; \
} \
T##ListIter T##List_begin(T##List *self) { \
return self->vhead->next; \
} \
T##ListIter T##List_last(T##List *self) { \
if (self->vtail->prev == self->vhead) return NULL; \
return self->vtail->prev; \
} \
T##ListIter T##List_end(T##List *self) { \
return self->vtail; \
} \
T##ListIter T##List_next(T##ListIter iter) { \
if (iter == NULL) return NULL; \
return iter->next; \
} \
T##ListIter T##List_prev(T##ListIter iter) { \
if (iter == NULL) return NULL; \
if (iter->prev == NULL) return NULL; \
if (iter->prev->prev == NULL) return NULL; \
return iter->prev; \
} \
size_t T##List_len(T##List *self) { \
return self->len; \
} \
T##ListIter T##List_push_back(T##List *self, T val) { \
return T##List_insert_before(self, self->vtail, val); \
} \
T##ListIter T##List_push_front(T##List *self, T val) { \
return T##List_insert_after(self, self->vhead, val); \
} \
void T##List_pop_back(T##List *self) { \
T##List_remove(self, self->vtail->prev); \
} \
void T##List_pop_front(T##List *self) { \
T##List_remove(self, self->vhead->next); \
} \
#endif
|
