#include <intrusive_slist.hpp>
◆ size_type
◆ intrusive_slist_base()
std::intrusive_slist_base::intrusive_slist_base |
( |
| ) |
|
◆ empty()
bool std::intrusive_slist_base::empty |
( |
| ) |
const |
|
inline |
intrusive_slist_node m_root
Definition: intrusive_slist.hpp:135
bool in_list() const
Definition: intrusive_slist.hpp:46
◆ link_after()
47 assert(!node->in_list());
48 node->next = prevNode->next;
49 prevNode->next = node;
◆ pop_front()
void std::intrusive_slist_base::pop_front |
( |
| ) |
|
|
inline |
intrusive_slist_node m_root
Definition: intrusive_slist.hpp:135
static void unlink_after(intrusive_slist_node *node)
Definition: intrusive_slist.cpp:51
◆ size()
36 const intrusive_slist_node* iter = &
m_root;
intrusive_slist_node m_root
Definition: intrusive_slist.hpp:135
intrusive_slist_node * next
Definition: intrusive_slist.hpp:51
int size_type
Definition: intrusive_slist.hpp:117
◆ unlink_after()
53 assert(node->in_list());
54 intrusive_slist_node* thisNode = node->next;
55 node->next = thisNode->next;
56 thisNode->next = thisNode;
◆ m_root
Die Dokumentation für diese Klasse wurde erzeugt aufgrund der Dateien: