25     LinkedList() : prev(this), next(this)  in LinkedList()
29     LinkedList(LinkedList* prev, LinkedList* next) : prev(prev), next(next)  in LinkedList()  argument
53         node->next = cur->next;  in InsertAfter()
55         cur->next->prev = node;  in InsertAfter()
56         cur->next = node;  in InsertAfter()
61         node->next = cur;  in InsertBefore()
63         cur->prev->next = node;  in InsertBefore()
69         node.prev->next = node.next;  in Delete()
70         node.next->prev = node.prev;  in Delete()
71         node.next = &node;  in Delete()
77         node->prev->next = node->next;  in Delete()
78         node->next->prev = node->prev;  in Delete()
79         node->next = node;  in Delete()
105         LinkedList* next = cur->next;  in Next()  local
106         return next;  in Next()
116         LinkedList* next = cur->next;  in Next()  local
117         return ContainerOf<T>(next, member);  in Next()
126         LinkedList* next = cur->next;  in RemoveNext()  local
127         Delete(next);  in RemoveNext()
128         return next;  in RemoveNext()
138         LinkedList* next = cur->next;  in RemoveNext()  local
139         Delete(next);  in RemoveNext()
140         return ContainerOf<T>(next, member);  in RemoveNext()
274         return next == this;  in Empty()
279         return prev == nullptr && next == nullptr;  in Null()
284         return (next != nullptr && next != this);  in InList()
289     LinkedList* next;  variable