51     static void InsertAfter(LinkedList* cur, LinkedList* node) noexcept  in InsertAfter()  argument
53         node->next = cur->next;  in InsertAfter()
54         node->prev = cur;  in InsertAfter()
55         cur->next->prev = node;  in InsertAfter()
56         cur->next = node;  in InsertAfter()
59     static void InsertBefore(LinkedList* cur, LinkedList* node) noexcept  in InsertBefore()  argument
61         node->next = cur;  in InsertBefore()
62         node->prev = cur->prev;  in InsertBefore()
63         cur->prev->next = node;  in InsertBefore()
64         cur->prev = node;  in InsertBefore()
99     static LinkedList* Next(LinkedList* cur) noexcept  in Next()  argument
101         if (cur->Empty()) {  in Next()
105         LinkedList* next = cur->next;  in Next()
110     static T* Next(LinkedList* cur, LinkedList T::*member) noexcept  in Next()  argument
112         if (cur->Empty()) {  in Next()
116         LinkedList* next = cur->next;  in Next()
120     static LinkedList* RemoveNext(LinkedList* cur) noexcept  in RemoveNext()  argument
122         if (cur->Empty()) {  in RemoveNext()
126         LinkedList* next = cur->next;  in RemoveNext()
132     static T* RemoveNext(LinkedList* cur, LinkedList T::*member) noexcept  in RemoveNext()  argument
134         if (cur->Empty()) {  in RemoveNext()
138         LinkedList* next = cur->next;  in RemoveNext()
143     static LinkedList* RemovePrev(LinkedList* cur) noexcept  in RemovePrev()  argument
145         if (cur->Empty()) {  in RemovePrev()
149         LinkedList* prev = cur->prev;  in RemovePrev()
155     static T* RemovePrev(LinkedList* cur, LinkedList T::*member) noexcept  in RemovePrev()  argument
157         if (cur->Empty()) {  in RemovePrev()
161         LinkedList* prev = cur->prev;  in RemovePrev()