#include <intrusive_list.hpp>
template<typename Pointer, typename Reference>
class std::intrusive_list_iterator< Pointer, Reference >
◆ iterator_category
template<typename Pointer , typename Reference >
◆ pointer
template<typename Pointer , typename Reference >
◆ reference
template<typename Pointer , typename Reference >
◆ intrusive_list_iterator() [1/2]
template<typename Pointer , typename Reference >
◆ intrusive_list_iterator() [2/2]
template<typename Pointer , typename Reference >
◆ node()
template<typename Pointer , typename Reference >
◆ operator!=()
template<typename Pointer , typename Reference >
110 return !(rhs == *
this);
◆ operator*()
template<typename Pointer , typename Reference >
◆ operator++() [1/2]
template<typename Pointer , typename Reference >
84 m_node =
static_cast<Pointer
>(m_node->next);
◆ operator++() [2/2]
template<typename Pointer , typename Reference >
intrusive_list_iterator()
Definition: intrusive_list.hpp:59
void copy(const T *first, const T *last, T *result)
Definition: algorithm.hpp:39
◆ operator--() [1/2]
template<typename Pointer , typename Reference >
89 m_node =
static_cast<Pointer
>(m_node->prev);
◆ operator--() [2/2]
template<typename Pointer , typename Reference >
intrusive_list_iterator()
Definition: intrusive_list.hpp:59
void copy(const T *first, const T *last, T *result)
Definition: algorithm.hpp:39
◆ operator->()
template<typename Pointer , typename Reference >
◆ operator==()
template<typename Pointer , typename Reference >
106 return rhs.m_node == m_node;
Die Dokumentation für diese Klasse wurde erzeugt aufgrund der Datei: