176 	SListElement<E> *m_head; //!< Pointer to first element.  variable
192 	SListPure() : m_head(nullptr), m_tail(nullptr) { }  in SListPure()
195 	SListPure(std::initializer_list<E> init) : m_head(nullptr), m_tail(nullptr) {  in SListPure()
200 	SListPure(const SListPure<E> &L) : m_head(nullptr), m_tail(nullptr) {  in SListPure()
208 	SListPure(SListPure<E> &&L) : m_head(L.m_head), m_tail(L.m_tail) {  in SListPure()
209 		L.m_head = L.m_tail = nullptr;  in SListPure()
222 	bool empty() const { return m_head == nullptr; }  in empty()
231 		for (SListElement<E> *pX = m_head; pX != nullptr; pX = pX->m_next)  in size()
241 		OGDF_ASSERT(m_head != nullptr);  in front()
242 		return m_head->m_x;  in front()
250 		OGDF_ASSERT(m_head != nullptr);  in front()
251 		return m_head->m_x;  in front()
278 		for(pX = m_head; pX != nullptr; pX = pX->m_next)  in get()
289 		for(pX = m_head; pX != nullptr; pX = pX->m_next)  in get()
302 		for(SListElement<E> *pX = m_head; pX != nullptr; pX = pX->m_next, ++p)  in pos()
318 	iterator begin() { return m_head; }  in begin()
324 	const_iterator begin() const { return m_head; }  in begin()
330 	const_iterator cbegin() const { return m_head; }  in cbegin()
369 		return (pX->m_next) ? pX->m_next : m_head;  in cyclicSucc()
379 		return (pX->m_next) ? pX->m_next : m_head;  in cyclicSucc()
401 		m_head = L.m_head;
403 		L.m_head = L.m_tail = nullptr;
410 		SListElement<E> *pX = m_head, *pY = L.m_head;
434 		m_head = new SListElement<E>(this, x, m_head);  in pushFront()
435 		if (m_tail == nullptr) m_tail = m_head;  in pushFront()
436 		return m_head;  in pushFront()
445 		m_head = new SListElement<E>(this, m_head, std::forward<Args>(args)...);  in emplaceFront()
446 		if (m_tail == nullptr) m_tail = m_head;  in emplaceFront()
447 		return m_head;  in emplaceFront()
453 		if (m_head == nullptr)  in pushBack()
454 			m_head = m_tail = pNew;  in pushBack()
467 		if (m_head == nullptr)  in emplaceBack()
468 			m_head = m_tail = pNew;  in emplaceBack()
498 		OGDF_ASSERT(m_head != nullptr);  in popFront()
499 		SListElement<E> *pX = m_head;  in popFront()
500 		if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr;  in popFront()
530 		if (m_head == nullptr) return;  in clear()
533 			for(SListElement<E> *pX = m_head; pX != nullptr; pX = pX->m_next)  in clear()
536 		OGDF_ALLOCATOR::deallocateList(sizeof(SListElement<E>),m_head,m_tail);  in clear()
538 		m_head = m_tail = nullptr;  in clear()
550 		OGDF_ASSERT(m_head != nullptr);  in moveFrontToFront()
553 		SListElement<E> *pX = m_head;  in moveFrontToFront()
554 		if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr;  in moveFrontToFront()
555 		pX->m_next = L2.m_head;  in moveFrontToFront()
556 		L2.m_head = pX;  in moveFrontToFront()
557 		if (L2.m_tail == nullptr) L2.m_tail = L2.m_head;  in moveFrontToFront()
559 		L2.m_head->m_list = &L2;  in moveFrontToFront()
564 		OGDF_ASSERT(m_head != nullptr);  in moveFrontToBack()
567 		SListElement<E> *pX = m_head;  in moveFrontToBack()
568 		if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr;  in moveFrontToBack()
570 		if (L2.m_head == nullptr)  in moveFrontToBack()
571 			L2.m_head = L2.m_tail = pX;  in moveFrontToBack()
583 		OGDF_ASSERT(m_head != nullptr);  in moveFrontToSucc()
588 		SListElement<E> *pX = m_head;  in moveFrontToSucc()
589 		if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr;  in moveFrontToSucc()
599 		if (m_head)  in conc()
600 			m_tail->m_next = L2.m_head;  in conc()
602 			m_head = L2.m_head;  in conc()
605 		reassignListRefs(L2.m_head);  in conc()
607 		L2.m_head = L2.m_tail = nullptr;  in conc()
613 		for(p = m_head; p; p = pNext) {  in reverse()
618 		std::swap(m_head,m_tail);  in reverse()
741 		for(SListElement<E> *pX = L.m_head; pX != nullptr; pX = pX->m_next)  in copy()
752 		for(auto e = start == nullptr ? m_head : start; e != nullptr; e = e->m_next) {
980 	if (m_head == m_tail) return;  in bucketSort()
983 	l = h = f.getBucket(m_head->m_x);  in bucketSort()
986 	for(pX = m_head->m_next; pX; pX = pX->m_next)  in bucketSort()
1000 	if (m_head == m_tail) return;  in bucketSort()
1005 	for (pX = m_head; pX; pX = pX->m_next) {  in bucketSort()
1020 				m_head = pX;  in bucketSort()
1042 	for (pX = m_head; pX; pX = pX->m_next)  in permute()
1051 	m_head = A[0];  in permute()