#include <intrusive_list.hpp>
◆ size_type
◆ intrusive_list_base()
std::intrusive_list_base::intrusive_list_base |
( |
| ) |
|
|
protected |
intrusive_list_node m_root
Definition: intrusive_list.hpp:143
◆ ~intrusive_list_base()
std::intrusive_list_base::~intrusive_list_base |
( |
| ) |
|
|
inlineprotected |
◆ empty()
bool std::intrusive_list_base::empty |
( |
| ) |
const |
|
inline |
intrusive_list_node m_root
Definition: intrusive_list.hpp:143
bool in_list() const
Definition: intrusive_list.hpp:46
◆ link()
48 assert(!node->in_list());
49 node->prev = nextNode->prev;
50 node->prev->next = node;
51 nextNode->prev = node;
52 node->next = nextNode;
◆ pop_back()
void std::intrusive_list_base::pop_back |
( |
| ) |
|
|
inline |
intrusive_list_node m_root
Definition: intrusive_list.hpp:143
static void unlink(intrusive_list_node *node)
Definition: intrusive_list.cpp:54
intrusive_list_node * prev
Definition: intrusive_list.hpp:49
◆ pop_front()
void std::intrusive_list_base::pop_front |
( |
| ) |
|
|
inline |
intrusive_list_node * next
Definition: intrusive_list.hpp:48
intrusive_list_node m_root
Definition: intrusive_list.hpp:143
static void unlink(intrusive_list_node *node)
Definition: intrusive_list.cpp:54
◆ size()
37 const intrusive_list_node* iter = &
m_root;
intrusive_list_node * next
Definition: intrusive_list.hpp:48
intrusive_list_node m_root
Definition: intrusive_list.hpp:143
int size_type
Definition: intrusive_list.hpp:120
◆ unlink()
56 assert(node->in_list());
57 node->prev->next = node->next;
58 node->next->prev = node->prev;
59 node->next = node->prev = node;
◆ m_root
Die Dokumentation für diese Klasse wurde erzeugt aufgrund der Dateien: