Inheritance diagram for ll::data::IntrusiveList< T, Node, Traits >:

Public Types
using	value_type = T
using	node_type = Node
using	size_type = std::size_t
using	reference = T&
using	const_reference = T const&
using	iterator = Iterator<false>
using	const_iterator = Iterator<true>
using	reverse_iterator = std::reverse_iterator<iterator>
using	const_reverse_iterator = std::reverse_iterator<const_iterator>

Public Member Functions
	IntrusiveList (IntrusiveList const &)=delete
IntrusiveList &	operator= (IntrusiveList const &)=delete
	IntrusiveList (IntrusiveList &&other) noexcept
IntrusiveList &	operator= (IntrusiveList &&other) noexcept
bool	empty () const noexcept
size_type	size () const noexcept
iterator	begin () noexcept
const_iterator	begin () const noexcept
const_iterator	cbegin () const noexcept
iterator	end () noexcept
const_iterator	end () const noexcept
const_iterator	cend () const noexcept
reverse_iterator	rbegin () noexcept
const_reverse_iterator	rbegin () const noexcept
reverse_iterator	rend () noexcept
const_reverse_iterator	rend () const noexcept
reference	front () noexcept
const_reference	front () const noexcept
reference	back () noexcept
const_reference	back () const noexcept
void	push_front (T &value) noexcept
void	push_back (T &value) noexcept
void	pop_front () noexcept
void	pop_back () noexcept
iterator	insert (const_iterator pos, T &value) noexcept
iterator	erase (const_iterator pos) noexcept
iterator	erase (const_iterator first, const_iterator last) noexcept
void	remove (T &value) noexcept
template<class Pred>
size_type	remove_if (Pred pred)
void	clear () noexcept
void	splice (const_iterator pos, IntrusiveList &other) noexcept
void	splice (const_iterator pos, T &value) noexcept
void	swap (IntrusiveList &other) noexcept

Static Public Member Functions
static iterator	iterator_to (T &value) noexcept
static const_iterator	iterator_to (T const &value) noexcept

The documentation for this class was generated from the following file:

Public Types

Public Member Functions