-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathllist.h
222 lines (199 loc) · 10.5 KB
/
llist.h
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
#ifndef ZAKAROUF__ZTYPES_TYPES__LLIST_H
#define ZAKAROUF__ZTYPES_TYPES__LLIST_H
#include "std/mem.h"
#define z__LinkType(TAG)\
struct _z__linkLs##TAG
#define z__Link(NEWTAG, T, ...)\
z__LinkType(NEWTAG) { \
T data; \
__VA_ARGS__; \
z__LinkType(NEWTAG) *_next; \
z__LinkType(NEWTAG) *_prev; \
}
#define z__LList(TAG, ...)\
struct { \
z__LinkType(TAG) *head; \
z__LinkType(TAG) *tail; \
z__LinkType(TAG) *cursor; \
\
__VA_ARGS__; /* Additialnal members for the the user*/\
}
/*
* How to Create a Linked list
* z__Link(<NewTagName>, <MainDataType>, <AdditionalMembers> );
* typedef z__Link(<NewTagName>, <MainDataType>, <AdditionalMembers> ); << Creates a typedef
* :Create a Link
* z__LList(<TagName>, <AdditionalMembers>) <Var>;
* typedef z__LList(<TagName>, <AdditionalMembers>) <newType>; << Creates a typedef
* Link list defination is complete;
*/
#define z__LList_new(zls, ...)\
{ \
(zls)->head = z__MALLOC(sizeof(*(zls)->head)); \
(zls)->head->_next = NULL; \
(zls)->head->_prev = NULL; \
(zls)->head->data = __VA_ARGS__; \
(zls)->cursor = (zls)->head; \
(zls)->tail = (zls)->head; \
}
#define z__LList_popHead(zls)\
{ \
if((zls)->head != NULL) { \
if(((zls)->head->_prev != NULL)) { \
(zls)->head = (zls)->head->_prev;\
z__FREE((zls)->head->_next); \
(zls)->head->_next = NULL; \
} \
} \
}
#define z__LList_popTail(zls)\
{ \
if ((zls)->tail != NULL) { \
if ((zls)->tail->_next) { \
(zls)->tail = (zls)->tail->_next; \
z__FREE((zls)->tail->_prev); \
(zls)->tail->_prev = NULL; \
} \
} \
}
#define z__LList_delete(zls)\
{ \
while((zls)->head->_prev != NULL)\
{ \
z__LList_popHead(zls); \
} \
z__FREE((zls)->head); \
(zls)->head = NULL; \
}
#define z__LList_pushHead(zls, D)\
{ \
(zls)->head->_next = z__MALLOC(sizeof( *(zls)->head->_next) ); \
(zls)->head->_next->_prev = (zls)->head; \
(zls)->head = (zls)->head->_next; \
\
(zls)->head->data = D; \
(zls)->head->_next = NULL; \
}
#define z__LList_pushTail(zls, D)\
{ \
(zls)->tail->_prev = z__MALLOC(sizeof( *(zls)->tail->_prev ) ); \
(zls)->tail->_prev->_next = (zls)->tail; \
(zls)->tail = (zls)->tail->_prev; \
(zls)->tail->_prev = NULL; \
\
(zls)->tail->data = D; \
}
#define z__LList_inext(zls, n)\
{ \
for(int i = 0; i < n && (zls)->cursor->_next != NULL; i++) \
{ \
(zls)->cursor = (zls)->cursor->_next; \
} \
}
#define z__LList_iprev(zls, n)\
{ \
for(int i = 0; i < n && (zls)->cursor->_prev != NULL; i++) \
{ \
(zls)->cursor = (zls)->cursor->_prev; \
} \
}
#define z__LList_setCursorHead(zls)\
{ \
(zls)->cursor = (zls)->head; \
}
#define z__LList_setCursorTail(zls)\
{ \
(zls)->cursor = (zls)->tail; \
}
#define z__LList_setCursorNext(zls)\
{ \
if((zls)->cursor->_next) { \
(zls)->cursor = (zls)->cursor->_next; \
} \
}
#define z__LList_setCursorPrev(zls)\
{ \
if((zls)->cursor->_prev) { \
(zls)->cursor = (zls)->cursor->_prev;\
} \
}
#define z__LList_pushCursor_next(zls, D)\
{ \
if((zls)->cursor) { \
(zls)->head->_next = (zls)->cursor->_next; \
(zls)->cursor->_next = z__MALLOC(sizeof(*(zls)->cursor->_next));\
(zls)->cursor->_next->data = D; \
(zls)->cursor->_next->_prev = (zls)->cursor; \
(zls)->cursor->_next->_next = (zls)->head->_next; \
(zls)->head->_next->_prev = (zls)->cursor->_next; \
(zls)->head->_next = NULL; \
} \
}
#define z__LList_pushCursor_prev(zls, D)\
{ \
if ((zls)->cursor) { \
(zls)->head->_next = (zls)->cursor->_prev; \
(zls)->cursor->_prev = z__MALLOC(sizeof(*(zls)->cursor->_prev)); \
(zls)->cursor->_prev->_next = (zls)->cursor; \
(zls)->cursor->_prev->_prev = (zls)->head->_next; \
(zls)->head->_next->_next = (zls)->cursor->_prev; \
(zls)->head->_next = NULL; \
} \
}
#define z__LList_cursorDel_setPrev(zls)\
{ \
if ((zls)->cursor->_prev != NULL) \
{ \
(zls)->head->_next = (zls)->cursor->_prev; \
\
(zls)->cursor->_prev->_next = (zls)->cursor->_next; \
(zls)->cursor->_next->_prev = (zls)->cursor->_prev; \
\
z__FREE((zls)->cursor); \
(zls)->cursor = (zls)->head->_next; \
(zls)->head->_next = NULL; \
} \
}
#define z__LList_cursorDel_setNext(zls)\
{ \
if ((zls)->cursor->_next != NULL) \
{ \
(zls)->head->_next = (zls)->cursor->_next; \
\
(zls)->cursor->_prev->_next = (zls)->cursor->_next; \
(zls)->cursor->_next->_prev = (zls)->cursor->_prev; \
\
z__FREE((zls)->cursor); \
(zls)->cursor = (zls)->head->_next; \
(zls)->head->_next = NULL; \
} \
}
#define z__LList_cursorDel(zls)\
{ \
if ((zls)->cursor->_prev) { \
(zls)->cursor->_prev->_next = (zls)->cursor->_next; \
} \
if ((zls)->cursor->_next) { \
(zls)->cursor->_next->_prev = (zls)->cursor->_prev; \
} \
z__FREE((zls)->cursor); \
(zls)->cursor = NULL; \
}
#define z__LList_cursorTakeOut(zls, var)\
{\
if ((zls)->cursor->_prev) { \
(zls)->cursor->_prev->_next = (zls)->cursor->_next; \
} \
if ((zls)->cursor->_next) { \
(zls)->cursor->_next->_prev = (zls)->cursor->_prev; \
} \
var = (zls)->cursor; \
(zls)->cursor = NULL; \
}
#define z__LList_getCursor(zls) (zls).cursor // Get Cursor
#define z__LList_getCursorData(zls) (zls).cursor->data // Get Data From Cursor
#define z__LList_getCursorMember(zls, member) (zls).cursor->member // Get Member Data from Cursor
#define z__LList_getMember(zls, member) (zls).member // Get Member Data from Cursor
#define z__LList_getHead(zls) (zls).head // Get Head
#define z__LList_getTail(zls) (zls).tail // Get Tail
#endif