3 CLASS(LinkedListNode, Object)
4 ATTRIB(LinkedListNode, ll_data, entity);
5 ATTRIB(LinkedListNode, ll_prev, LinkedListNode);
6 ATTRIB(LinkedListNode, ll_next, LinkedListNode);
7 ENDCLASS(LinkedListNode)
9 CLASS(LinkedList, Object)
10 ATTRIB(LinkedList, ll_head, LinkedListNode);
11 ATTRIB(LinkedList, ll_tail, LinkedListNode);
14 #define LL_NEW() NEW(LinkedList)
16 #define LL_EMPTY(ll) (ll.ll_head == NULL)
21 entity LL_PUSH(LinkedList this, entity e)
24 LinkedListNode n = NEW(LinkedListNode);
26 LinkedListNode tail = n.ll_prev = this.ll_tail;
27 this.ll_tail = (tail) ? tail.ll_next = n : this.ll_head = n;
34 entity LL_POP(LinkedList this)
37 if (!this.ll_tail) return NULL;
38 LinkedListNode n = this.ll_tail;
40 LinkedListNode prev = n.ll_prev;
41 if (prev) (this.ll_tail = prev).ll_next = NULL;
42 else this.ll_head = this.ll_tail = NULL;
47 #define LL_CLEAR(...) EVAL_LL_CLEAR(OVERLOAD(LL_CLEAR, __VA_ARGS__))
48 #define EVAL_LL_CLEAR(...) __VA_ARGS__
49 #define LL_CLEAR_1(this) LL_CLEAR_2(this, LAMBDA())
50 #define LL_CLEAR_2(this, dtor) \
53 LinkedList _ll = this; \
57 entity it = LL_POP(_ll); \
64 #define LL_DELETE(...) EVAL_LL_DELETE(OVERLOAD(LL_DELETE, __VA_ARGS__))
65 #define EVAL_LL_DELETE(...) __VA_ARGS__
66 #define LL_DELETE_1(this) LL_DELETE_2(this, LAMBDA())
67 #define LL_DELETE_2(this, dtor) \
70 LL_CLEAR_2(this, dtor); \
75 #define LL_EACH(list, cond, body) \
79 for (entity _it = list.ll_head; _it; (_it = _it.ll_next, ++i)) \
81 ITER_CONST noref entity it = _it.ll_data; \