28         return next != this;  in IsLinked()
30     explicit SListNode(SListNode* p) noexcept : next {p}  in SListNode()
38         std::swap(next, rhs.next);  in Swap()
44     SListNode* next {this};
51         return m_head.next == nullptr;  in empty()
72         nd.next = std::exchange(m_head.next, &nd);  in PushFront()
80             auto node = m_head.next;  in PopFront()
81             m_head.next = std::exchange(node->next, node);  in PopFront()
100         return next != this && prev != this;  in IsLinked()
103     ListNode(ListNode* p, ListNode* n) noexcept : prev {p}, next {n}  in ListNode()
112     ListNode* next {this};
124             NodeType* x = rhs.m_head.next;  in List()
125             m_head.next = x;  in List()
129             y->next = &m_tail;  in List()
142             NodeType* x = rhs.m_head.next;
143             m_head.next = x;
147             y->next = &m_tail;
171         m_head.next->prev = &nd;  in PushFront()
173         nd.next = m_head.next;  in PushFront()
174         m_head.next = &nd;  in PushFront()
182         m_tail.prev->next = &nd;  in PushBack()
184         nd.next = &m_tail;  in PushBack()
194             auto node = static_cast<T*>(m_head.next);  in PopFront()
202         return empty() ? nullptr : static_cast<T*>(m_head.next);  in Front()
225         node.prev->next = node.next;  in Unlink()
226         node.next->prev = node.prev;  in Unlink()
227         node.next = node.prev = &node;  in Unlink()
235         m_tail.next = &m_head;  in Reset()
237         m_head.next = &m_tail;  in Reset()