4 CLASS(LinkedListNode, Object)
5 ATTRIB(LinkedListNode, ll_data, entity, NULL)
6 ATTRIB(LinkedListNode, ll_prev, LinkedListNode, NULL)
7 ATTRIB(LinkedListNode, ll_next, LinkedListNode, NULL)
8 ENDCLASS(LinkedListNode)
10 CLASS(LinkedList, Object)
11 ATTRIB(LinkedList, ll_head, LinkedListNode, NULL);
12 ATTRIB(LinkedList, ll_tail, LinkedListNode, NULL);
15 #define LL_NEW() NEW(LinkedList)
20 entity LL_PUSH(LinkedList this, entity e)
22 LinkedListNode n = NEW(LinkedListNode);
24 LinkedListNode tail = n.ll_prev = this.ll_tail;
25 this.ll_tail = (tail) ? tail.ll_next = n : this.ll_head = n;
32 entity LL_POP(LinkedList this)
34 if (!this.ll_tail) return NULL;
35 LinkedListNode n = this.ll_tail;
37 LinkedListNode prev = n.ll_prev;
38 if (prev) prev.ll_next = NULL;
39 else this.ll_head = this.ll_tail = NULL;
43 #define LL_EACH(list, cond, body) \
47 for (entity _it = list.ll_head; _it; (_it = _it.ll_next, ++i)) \
49 noref entity it = _it.ll_data; \