The class template slist is an intrusive container, that encapsulates a singly-linked list. More...

#include <slist.hpp>

Public Types
typedef ValueTraits	value_traits

typedef value_traits::pointer	pointer

typedef value_traits::const_pointer	const_pointer

typedef pointer_traits < pointer >::element_type	value_type

typedef pointer_traits < pointer >::reference	reference

typedef pointer_traits < const_pointer >::reference	const_reference

typedef pointer_traits < pointer >::difference_type	difference_type

typedef SizeType	size_type

typedef slist_iterator < value_traits, false >	iterator

typedef slist_iterator < value_traits, true >	const_iterator

typedef value_traits::node_traits	node_traits

typedef node_traits::node	node

typedef node_traits::node_ptr	node_ptr

typedef node_traits::const_node_ptr	const_node_ptr

typedef HeaderHolder	header_holder_type

typedef detail::if_c< linear, linear_slist_algorithms < node_traits > , circular_slist_algorithms < node_traits > >::type	node_algorithms

Public Member Functions
	slist_impl (const value_traits &v_traits=value_traits())
	Effects: constructs an empty list. More...

template<class Iterator >
	slist_impl (Iterator b, Iterator e, const value_traits &v_traits=value_traits())
	Requires: Dereferencing iterator must yield an lvalue of type value_type. More...

	slist_impl (BOOST_RV_REF(slist_impl) x)
	Effects: to-do More...

slist_impl &	operator= (BOOST_RV_REF(slist_impl) x)
	Effects: to-do More...

	~slist_impl ()
	Effects: If it's a safe-mode or auto-unlink value, the destructor does nothing (ie. More...

void	clear ()
	Effects: Erases all the elements of the container. More...

template<class Disposer >
void	clear_and_dispose (Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

void	push_front (reference value)
	Requires: value must be an lvalue. More...

void	push_back (reference value)
	Requires: value must be an lvalue. More...

void	pop_front ()
	Effects: Erases the first element of the list. More...

template<class Disposer >
void	pop_front_and_dispose (Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

reference	front ()
	Effects: Returns a reference to the first element of the list. More...

const_reference	front () const
	Effects: Returns a const_reference to the first element of the list. More...

reference	back ()
	Effects: Returns a reference to the last element of the list. More...

const_reference	back () const
	Effects: Returns a const_reference to the last element of the list. More...

iterator	begin ()
	Effects: Returns an iterator to the first element contained in the list. More...

const_iterator	begin () const
	Effects: Returns a const_iterator to the first element contained in the list. More...

const_iterator	cbegin () const
	Effects: Returns a const_iterator to the first element contained in the list. More...

iterator	end ()
	Effects: Returns an iterator to the end of the list. More...

const_iterator	end () const
	Effects: Returns a const_iterator to the end of the list. More...

const_iterator	cend () const
	Effects: Returns a const_iterator to the end of the list. More...

iterator	before_begin ()
	Effects: Returns an iterator that points to a position before the first element. More...

const_iterator	before_begin () const
	Effects: Returns an iterator that points to a position before the first element. More...

const_iterator	cbefore_begin () const
	Effects: Returns an iterator that points to a position before the first element. More...

iterator	last ()
	Effects: Returns an iterator to the last element contained in the list. More...

const_iterator	last () const
	Effects: Returns a const_iterator to the last element contained in the list. More...

const_iterator	clast () const
	Effects: Returns a const_iterator to the last element contained in the list. More...

size_type	size () const
	Effects: Returns the number of the elements contained in the list. More...

bool	empty () const
	Effects: Returns true if the list contains no elements. More...

void	swap (slist_impl &other)
	Effects: Swaps the elements of x and *this. More...

void	shift_backwards (size_type n=1)
	Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third... More...

void	shift_forward (size_type n=1)
	Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second... More...

template<class Cloner , class Disposer >
void	clone_from (const slist_impl &src, Cloner cloner, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

iterator	insert_after (const_iterator prev_p, reference value)
	Requires: value must be an lvalue and prev_p must point to an element contained by the list or to end(). More...

template<class Iterator >
void	insert_after (const_iterator prev_p, Iterator f, Iterator l)
	Requires: Dereferencing iterator must yield an lvalue of type value_type and prev_p must point to an element contained by the list or to the end node. More...

iterator	insert (const_iterator p, reference value)
	Requires: value must be an lvalue and p must point to an element contained by the list or to end(). More...

template<class Iterator >
void	insert (const_iterator p, Iterator b, Iterator e)
	Requires: Dereferencing iterator must yield an lvalue of type value_type and p must point to an element contained by the list or to the end node. More...

iterator	erase_after (const_iterator prev)
	Effects: Erases the element after the element pointed by prev of the list. More...

iterator	erase_after (const_iterator before_f, const_iterator l)
	Effects: Erases the range (before_f, l) from the list. More...

iterator	erase_after (const_iterator before_f, const_iterator l, size_type n)
	Effects: Erases the range (before_f, l) from the list. More...

iterator	erase (const_iterator i)
	Effects: Erases the element pointed by i of the list. More...

iterator	erase (const_iterator f, const_iterator l)
	Requires: f and l must be valid iterator to elements in *this. More...

iterator	erase (const_iterator f, const_iterator l, size_type n)
	Effects: Erases the range [f, l) from the list. More...

template<class Disposer >
iterator	erase_after_and_dispose (const_iterator prev, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

template<class Disposer >
iterator	erase_after_and_dispose (const_iterator before_f, const_iterator l, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

template<class Disposer >
iterator	erase_and_dispose (const_iterator i, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

template<class Disposer >
iterator	erase_and_dispose (iterator i, Disposer disposer)

template<class Disposer >
iterator	erase_and_dispose (const_iterator f, const_iterator l, Disposer disposer)
	Requires: f and l must be valid iterator to elements in *this. More...

template<class Iterator >
void	assign (Iterator b, Iterator e)
	Requires: Dereferencing iterator must yield an lvalue of type value_type. More...

template<class Iterator , class Disposer >
void	dispose_and_assign (Disposer disposer, Iterator b, Iterator e)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

void	splice_after (const_iterator prev, slist_impl &x, const_iterator *l=0)
	Requires: prev must point to an element contained by this list or to the before_begin() element More...

void	splice_after (const_iterator prev_pos, slist_impl &x, const_iterator prev_ele)
	Requires: prev must point to an element contained by this list or to the before_begin() element. More...

void	splice_after (const_iterator prev_pos, slist_impl &x, const_iterator before_f, const_iterator before_l)
	Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end(). More...

void	splice_after (const_iterator prev_pos, slist_impl &x, const_iterator before_f, const_iterator before_l, size_type n)
	Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end() and n == std::distance(before_f, before_l). More...

void	splice (const_iterator it, slist_impl &x, const_iterator *l=0)
	Requires: it is an iterator to an element in *this. More...

void	splice (const_iterator pos, slist_impl &x, const_iterator elem)
	Requires: it p must be a valid iterator of *this. More...

void	splice (const_iterator pos, slist_impl &x, const_iterator f, const_iterator l)
	Requires: pos must be a dereferenceable iterator in *this and f and f belong to x and f and f a valid range on x. More...

void	splice (const_iterator pos, slist_impl &x, const_iterator f, const_iterator l, size_type n)
	Requires: pos must be a dereferenceable iterator in *this and f and l belong to x and f and l a valid range on x. More...

template<class Predicate >
void	sort (Predicate p)
	Effects: This function sorts the list *this according to std::less<value_type>. More...

void	sort ()
	Requires: p must be a comparison function that induces a strict weak ordering and both this and x must be sorted according to that ordering The lists x and this must be distinct. More...

template<class Predicate >
void	merge (slist_impl &x, Predicate p, const_iterator *l=0)
	Requires: p must be a comparison function that induces a strict weak ordering and both this and x must be sorted according to that ordering The lists x and this must be distinct. More...

void	merge (slist_impl &x)
	Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. More...

void	reverse ()
	Effects: Reverses the order of elements in the list. More...

void	remove (const_reference value)
	Effects: Removes all the elements that compare equal to value. More...

template<class Disposer >
void	remove_and_dispose (const_reference value, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

template<class Pred >
void	remove_if (Pred pred)
	Effects: Removes all the elements for which a specified predicate is satisfied. More...

template<class Pred , class Disposer >
void	remove_and_dispose_if (Pred pred, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

void	unique ()
	Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. More...

template<class BinaryPredicate >
void	unique (BinaryPredicate pred)
	Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. More...

template<class Disposer >
void	unique_and_dispose (Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

template<class BinaryPredicate , class Disposer >
void	unique_and_dispose (BinaryPredicate pred, Disposer disposer)
	Requires: Disposer::operator()(pointer) shouldn't throw. More...

iterator	iterator_to (reference value)
	Requires: value must be a reference to a value inserted in a list. More...

const_iterator	iterator_to (const_reference value) const
	Requires: value must be a const reference to a value inserted in a list. More...

iterator	previous (iterator i)
	Returns: The iterator to the element before i in the list. More...

const_iterator	previous (const_iterator i) const
	Returns: The const_iterator to the element before i in the list. More...

iterator	previous (const_iterator prev_from, iterator i)
	Returns: The iterator to the element before i in the list, starting the search on element after prev_from. More...

const_iterator	previous (const_iterator prev_from, const_iterator i) const
	Returns: The const_iterator to the element before i in the list, starting the search on element after prev_from. More...

void	check () const
	Effects: Asserts the integrity of the container. More...

Static Public Member Functions
static slist_impl &	container_from_end_iterator (iterator end_iterator)
	Precondition: end_iterator must be a valid end iterator of slist. More...

static const slist_impl &	container_from_end_iterator (const_iterator end_iterator)
	Precondition: end_iterator must be a valid end const_iterator of slist. More...

static iterator	s_iterator_to (reference value)
	Requires: value must be a reference to a value inserted in a list. More...

static const_iterator	s_iterator_to (const_reference value)
	Requires: value must be a const reference to a value inserted in a list. More...

Static Public Attributes
static const bool	constant_time_size = 0 != (BoolFlags & slist_bool_flags::constant_time_size_pos)

static const bool	stateful_value_traits = detail::is_stateful_value_traits<value_traits>::value

static const bool	linear = 0 != (BoolFlags & slist_bool_flags::linear_pos)

static const bool	cache_last = 0 != (BoolFlags & slist_bool_flags::cache_last_pos)

static const bool	has_container_from_iterator

Detailed Description

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>
class boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >

The class template slist is an intrusive container, that encapsulates a singly-linked list.

You can use such a list to squeeze the last bit of performance from your application. Unfortunately, the little gains come with some huge drawbacks. A lot of member functions can't be implemented as efficiently as for standard containers. To overcome this limitation some other member functions with rather unusual semantics have to be introduced.

The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<>, linear<> and cache_last<>.

The iterators of slist are forward iterators. slist provides a static function called "previous" to compute the previous iterator of a given iterator. This function has linear complexity. To improve the usability esp. with the '*_after' functions, ++end() == begin() and previous(begin()) == end() are defined. An new special function "before_begin()" is defined, which returns an iterator that points one less the beginning of the list: ++before_begin() == begin()

Member Typedef Documentation

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef slist_iterator<value_traits, true> boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::const_iterator

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef node_traits::const_node_ptr boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::const_node_ptr

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef value_traits::const_pointer boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::const_pointer

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef pointer_traits<const_pointer>::reference boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::const_reference

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef pointer_traits<pointer>::difference_type boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::difference_type

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef HeaderHolder boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::header_holder_type

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef slist_iterator<value_traits, false> boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::iterator

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef node_traits::node boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::node

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef detail::if_c< linear , linear_slist_algorithms<node_traits> , circular_slist_algorithms<node_traits> >::type boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::node_algorithms

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef node_traits::node_ptr boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::node_ptr

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef value_traits::node_traits boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::node_traits

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef value_traits::pointer boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::pointer

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef pointer_traits<pointer>::reference boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::reference

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef SizeType boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::size_type

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef ValueTraits boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::value_traits

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

typedef pointer_traits<pointer>::element_type boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::value_type

Constructor & Destructor Documentation

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::slist_impl ( const value_traits & v_traits = value_traits() )

inlineexplicit

Effects: constructs an empty list.

Complexity: Constant

Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Iterator >

boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::slist_impl	(	Iterator	b,
		Iterator	e,
		const value_traits &	v_traits = `value_traits()`
	)

inline

Requires: Dereferencing iterator must yield an lvalue of type value_type.

Effects: Constructs a list equal to [b ,e).

Complexity: Linear in std::distance(b, e). No copy constructors are called.

Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::slist_impl ( BOOST_RV_REF(slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >) x )

inline

Effects: to-do

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::swap().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::~slist_impl ( )

inline

Effects: If it's a safe-mode or auto-unlink value, the destructor does nothing (ie.

no code is generated). Otherwise it detaches all elements from this. In this case the objects in the list are not deleted (i.e. no destructors are called), but the hooks according to the value_traits template parameter are set to their default value.

Complexity: Linear to the number of elements in the list, if it's a safe-mode or auto-unlink value. Otherwise constant.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear(), and boost::unit_test::framework::init().

Member Function Documentation

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Iterator >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::assign	(	Iterator	b,
		Iterator	e
	)

inline

Requires: Dereferencing iterator must yield an lvalue of type value_type.

Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Linear to the number of elements inserted plus linear to the elements contained in the list if it's a safe-mode or auto-unlink value. Linear to the number of elements inserted in the list otherwise.

Note: Invalidates the iterators (but not the references) to the erased elements.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

reference boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::back ( )

inline

Effects: Returns a reference to the last element of the list.

Throws: Nothing.

Complexity: Constant.

Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

References boost::BOOST_STATIC_ASSERT().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_reference boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::back ( ) const

inline

Effects: Returns a const_reference to the last element of the list.

Throws: Nothing.

Complexity: Constant.

Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

References boost::BOOST_STATIC_ASSERT().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::before_begin ( )

inline

Effects: Returns an iterator that points to a position before the first element.

Equivalent to "end()"

Throws: Nothing.

Complexity: Constant.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::before_begin ( ) const

inline

Effects: Returns an iterator that points to a position before the first element.

Equivalent to "end()"

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::begin ( void )

inline

Effects: Returns an iterator to the first element contained in the list.

Throws: Nothing.

Complexity: Constant.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clone_from(), boost::intrusive::operator<(), and boost::intrusive::operator==().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::begin ( void ) const

inline

Effects: Returns a const_iterator to the first element contained in the list.

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin ( ) const

inline

Effects: Returns an iterator that points to a position before the first element.

Equivalent to "end()"

Throws: Nothing.

Complexity: Constant.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::before_begin().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::assign(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clone_from(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::dispose_and_assign(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::slist_impl(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbegin ( ) const

inline

Effects: Returns a const_iterator to the first element contained in the list.

Throws: Nothing.

Complexity: Constant.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cend ( ) const

inline

Effects: Returns a const_iterator to the end of the list.

Throws: Nothing.

Complexity: Constant.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::end().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::check ( ) const

inline

Effects: Asserts the integrity of the container.

Complexity: Linear time.

Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

References boost::multiprecision::backends::p.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clast ( ) const

inline

Effects: Returns a const_iterator to the last element contained in the list.

Throws: Nothing.

Complexity: Constant.

Note: This function is present only if cached_last<> option is true.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear ( void )

inline

Effects: Erases all the elements of the container.

Throws: Nothing.

Complexity: Linear to the number of elements of the list. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

Note: Invalidates the iterators (but not the references) to the erased elements.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::assign(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::~slist_impl().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose ( Disposer disposer )

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Erases all the elements of the container Disposer::operator()(pointer) is called for the removed elements.

Throws: Nothing.

Complexity: Linear to the number of elements of the list.

Note: Invalidates the iterators to the erased elements.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::end(), boost::unit_test::framework::init(), and boost::it.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clone_from(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::dispose_and_assign().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Cloner , class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clone_from	(	const slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	src,
		Cloner	cloner,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Cloner should yield to nodes equivalent to the original nodes.

Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this.

If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

Complexity: Linear to erased plus inserted elements.

Throws: If cloner throws.

References boost::asio::b, boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::end(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

static slist_impl& boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::container_from_end_iterator ( iterator end_iterator )

inlinestatic

Precondition: end_iterator must be a valid end iterator of slist.

Effects: Returns a const reference to the slist associated to the end iterator

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

static const slist_impl& boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::container_from_end_iterator ( const_iterator end_iterator )

inlinestatic

Precondition: end_iterator must be a valid end const_iterator of slist.

Effects: Returns a const reference to the slist associated to the end iterator

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Iterator , class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::dispose_and_assign	(	Disposer	disposer,
		Iterator	b,
		Iterator	e
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Requires: Dereferencing iterator must yield an lvalue of type value_type.

Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called. Disposer::operator()(pointer) is called for the removed elements.

Throws: Nothing.

Complexity: Linear to the number of elements inserted plus linear to the elements contained in the list.

Note: Invalidates the iterators (but not the references) to the erased elements.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

bool boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::empty ( void ) const

inline

Effects: Returns true if the list contains no elements.

Throws: Nothing.

Complexity: Constant.

Note: Does not affect the validity of iterators and references.

References boost::geometry::unique().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::pop_front_and_dispose(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::push_front(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::reverse(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::end ( void )

inline

Effects: Returns an iterator to the end of the list.

Throws: Nothing.

Complexity: Constant.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cend(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clear_and_dispose(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clone_from(), boost::intrusive::operator<(), boost::intrusive::operator==(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::end ( void ) const

inline

Effects: Returns a const_iterator to the end of the list.

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase ( const_iterator i )

inline

Effects: Erases the element pointed by i of the list.

No destructors are called.

Returns: the first element remaining beyond the removed element, or end() if no such element exists.

Throws: Nothing.

Complexity: Linear to the elements before i.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase	(	const_iterator	f,
		const_iterator	l
	)

inline

Requires: f and l must be valid iterator to elements in *this.

Effects: Erases the range pointed by b and e. No destructors are called.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: Linear to the elements before l.

Note: Invalidates the iterators (but not the references) to the erased elements.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase	(	const_iterator	f,
		const_iterator	l,
		size_type	n
	)

inline

Effects: Erases the range [f, l) from the list.

n must be std::distance(f, l). No destructors are called.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: linear to the elements before f if link_mode is normal_link and constant_time_size is activated. Linear to the elements before l otherwise.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after ( const_iterator prev )

inline

Effects: Erases the element after the element pointed by prev of the list.

No destructors are called.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: Constant.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_if().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after	(	const_iterator	before_f,
		const_iterator	l
	)

inline

Effects: Erases the range (before_f, l) from the list.

No destructors are called.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: Linear to the number of erased elements if it's a safe-mode , auto-unlink value or constant-time size is activated. Constant time otherwise.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after	(	const_iterator	before_f,
		const_iterator	l,
		size_type	n
	)

inline

Effects: Erases the range (before_f, l) from the list.

n must be std::distance(before_f, l) - 1. No destructors are called.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: constant-time if link_mode is normal_link. Linear to the elements (l - before_f) otherwise.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::fusion::distance(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose	(	const_iterator	prev,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Erases the element after the element pointed by prev of the list. Disposer::operator()(pointer) is called for the removed element.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: Constant.

Note: Invalidates the iterators to the erased element.

References boost::unit_test::framework::init(), and boost::it.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_and_dispose_if(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose	(	const_iterator	before_f,
		const_iterator	l,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Erases the range (before_f, l) from the list. Disposer::operator()(pointer) is called for the removed elements.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: Lineal to the elements (l - before_f + 1).

Note: Invalidates the iterators to the erased element.

References boost::unit_test::framework::init().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose	(	const_iterator	i,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Erases the element pointed by i of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

Returns: the first element remaining beyond the removed element, or end() if no such element exists.

Throws: Nothing.

Complexity: Linear to the elements before i.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose	(	iterator	i,
		Disposer	disposer
	)

inline

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose	(	const_iterator	f,
		const_iterator	l,
		Disposer	disposer
	)

inline

Requires: f and l must be valid iterator to elements in *this.

Disposer::operator()(pointer) shouldn't throw.

Effects: Erases the range pointed by b and e. No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

Throws: Nothing.

Complexity: Linear to the number of erased elements plus linear to the elements before f.

Note: Invalidates the iterators (but not the references) to the erased elements.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

reference boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::front ( )

inline

Effects: Returns a reference to the first element of the list.

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_reference boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::front ( ) const

inline

Effects: Returns a const_reference to the first element of the list.

Throws: Nothing.

Complexity: Constant.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert	(	const_iterator	p,
		reference	value
	)

inline

Requires: value must be an lvalue and p must point to an element contained by the list or to end().

Effects: Inserts the value before the position pointed by p. No copy constructor is called.

Throws: Nothing.

Complexity: Linear to the number of elements before p. Constant-time if cache_last<> is true and p == end().

Note: Does not affect the validity of iterators and references.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Iterator >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert	(	const_iterator	p,
		Iterator	b,
		Iterator	e
	)

inline

Requires: Dereferencing iterator must yield an lvalue of type value_type and p must point to an element contained by the list or to the end node.

Effects: Inserts the pointed by b and e before the position p. No copy constructors are called.

Throws: Nothing.

Complexity: Linear to the number of elements inserted plus linear to the elements before b. Linear to the number of elements to insert if cache_last<> option is true and p == end().

Note: Does not affect the validity of iterators and references.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after	(	const_iterator	prev_p,
		reference	value
	)

inline

Requires: value must be an lvalue and prev_p must point to an element contained by the list or to end().

Effects: Inserts the value after the position pointed by prev_p. No copy constructor is called.

Returns: An iterator to the inserted element.

Throws: Nothing.

Complexity: Constant.

Note: Does not affect the validity of iterators and references.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::assign(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::clone_from(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::dispose_and_assign(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::slist_impl().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Iterator >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert_after	(	const_iterator	prev_p,
		Iterator	f,
		Iterator	l
	)

inline

Requires: Dereferencing iterator must yield an lvalue of type value_type and prev_p must point to an element contained by the list or to the end node.

Effects: Inserts the [f, l) after the position prev_p.

Throws: Nothing.

Complexity: Linear to the number of elements inserted.

Note: Does not affect the validity of iterators and references.

References count, and boost::n.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::iterator_to ( reference value )

inline

Requires: value must be a reference to a value inserted in a list.

Effects: This function returns a const_iterator pointing to the element

Throws: Nothing.

Complexity: Constant time.

Note: Iterators and references are not invalidated.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::iterator_to ( const_reference value ) const

inline

Requires: value must be a const reference to a value inserted in a list.

Effects: This function returns an iterator pointing to the element.

Throws: Nothing.

Complexity: Constant time.

Note: Iterators and references are not invalidated.

References boost::intrusive::pointer_traits< Ptr >::const_cast_from().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::last ( )

inline

Effects: Returns an iterator to the last element contained in the list.

Throws: Nothing.

Complexity: Constant.

Note: This function is present only if cached_last<> option is true.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::last ( ) const

inline

Effects: Returns a const_iterator to the last element contained in the list.

Throws: Nothing.

Complexity: Constant.

Note: This function is present only if cached_last<> option is true.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Predicate >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge	(	slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		Predicate	p,
		const_iterator *	l = `0`
	)

inline

Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

Returns: Nothing.

Throws: If the predicate throws. Basic guarantee.

Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

Note: Iterators and references are not invalidated.

Additional note: If optional "l" argument is passed, it is assigned to an iterator to the last transferred value or end() is x is empty.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::before_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cend(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::empty(), boost::n, boost::multiprecision::backends::p, and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge ( slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > & x )

inline

Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>.

The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

Throws: if std::less<value_type> throws. Basic guarantee.

Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

Note: Iterators and references are not invalidated

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

slist_impl& boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::operator= ( BOOST_RV_REF(slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >) x )

inline

Effects: to-do

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::swap().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::pop_front ( )

inline

Effects: Erases the first element of the list.

No destructors are called.

Throws: Nothing.

Complexity: Constant.

Note: Invalidates the iterators (but not the references) to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::pop_front_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::pop_front_and_dispose ( Disposer disposer )

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Erases the first element of the list. Disposer::operator()(pointer) is called for the removed element.

Throws: Nothing.

Complexity: Constant.

Note: Invalidates the iterators to the erased element.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::empty(), and boost::unit_test::framework::init().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::pop_front().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous ( iterator i )

inline

Returns: The iterator to the element before i in the list.

Returns the end-iterator, if either i is the begin-iterator or the list is empty.

Throws: Nothing.

Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_and_dispose(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::insert(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous ( const_iterator i ) const

inline

Returns: The const_iterator to the element before i in the list.

Returns the end-const_iterator, if either i is the begin-const_iterator or the list is empty.

Throws: Nothing.

Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbefore_begin(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous	(	const_iterator	prev_from,
		iterator	i
	)

inline

Returns: The iterator to the element before i in the list, starting the search on element after prev_from.

Returns the end-iterator, if either i is the begin-iterator or the list is empty.

Throws: Nothing.

Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous	(	const_iterator	prev_from,
		const_iterator	i
	)		const

inline

Returns: The const_iterator to the element before i in the list, starting the search on element after prev_from.

Returns the end-const_iterator, if either i is the begin-const_iterator or the list is empty.

Throws: Nothing.

Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::push_back ( reference value )

inline

Requires: value must be an lvalue.

Effects: Inserts the value in the back of the list. No copy constructors are called.

Throws: Nothing.

Complexity: Constant.

Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

References boost::BOOST_STATIC_ASSERT().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::push_front ( reference value )

inline

Requires: value must be an lvalue.

Effects: Inserts the value in the front of the list. No copy constructors are called.

Throws: Nothing.

Complexity: Constant.

Note: Does not affect the validity of iterators and references.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::empty().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove ( const_reference value )

inline

Effects: Removes all the elements that compare equal to value.

No destructors are called.

Throws: If std::equal_to<value_type> throws. Basic guarantee.

Complexity: Linear time. It performs exactly size() comparisons for equality.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid. This function is linear time: it performs exactly size() comparisons for equality.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_if(), and boost::program_options::value().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_and_dispose	(	const_reference	value,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Removes all the elements that compare equal to value. Disposer::operator()(pointer) is called for every removed element.

Throws: If std::equal_to<value_type> throws. Basic guarantee.

Complexity: Linear time. It performs exactly size() comparisons for equality.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_and_dispose_if().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Pred , class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_and_dispose_if	(	Pred	pred,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Removes all the elements for which a specified predicate is satisfied. Disposer::operator()(pointer) is called for every removed element.

Throws: If pred throws. Basic guarantee.

Complexity: Linear time. It performs exactly size() comparisons for equality.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose(), boost::range::stable_partition(), and boost::multiprecision::backends::this.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Pred >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_if ( Pred pred )

inline

Effects: Removes all the elements for which a specified predicate is satisfied.

No destructors are called.

Throws: If pred throws. Basic guarantee.

Complexity: Linear time. It performs exactly size() calls to the predicate.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after(), boost::range::stable_partition(), and boost::multiprecision::backends::this.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::reverse ( )

inline

Effects: Reverses the order of elements in the list.

Throws: Nothing.

Complexity: This function is linear to the contained elements.

Note: Iterators and references are not invalidated

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::empty().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

static iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::s_iterator_to ( reference value )

inlinestatic

Requires: value must be a reference to a value inserted in a list.

Effects: This function returns a const_iterator pointing to the element

Throws: Nothing.

Complexity: Constant time.

Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.

References boost::BOOST_STATIC_ASSERT().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

static const_iterator boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::s_iterator_to ( const_reference value )

inlinestatic

Requires: value must be a const reference to a value inserted in a list.

Effects: This function returns an iterator pointing to the element.

Throws: Nothing.

Complexity: Constant time.

Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.

References boost::BOOST_STATIC_ASSERT(), and boost::intrusive::pointer_traits< Ptr >::const_cast_from().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::shift_backwards ( size_type n = 1 )

inline

Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third...

the last element becomes the first one.

Throws: Nothing.

Complexity: Linear to the number of elements plus the number shifts.

Note: Iterators Does not affect the validity of iterators and references.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::shift_forward ( size_type n = 1 )

inline

Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second...

the first element becomes the last one.

Throws: Nothing.

Complexity: Linear to the number of elements plus the number shifts.

Note: Does not affect the validity of iterators and references.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

size_type boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::size ( void ) const

inline

Effects: Returns the number of the elements contained in the list.

Throws: Nothing.

Complexity: Linear to the number of elements contained in the list. if constant_time_size is false. Constant time otherwise.

Note: Does not affect the validity of iterators and references.

References count.

Referenced by boost::intrusive::operator==(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Predicate >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort ( Predicate p )

inline

Effects: This function sorts the list *this according to std::less<value_type>.

The sort is stable, that is, the relative order of equivalent elements is preserved.

Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the predicate throws. Basic guarantee.

Complexity: The number of comparisons is approximately N log N, where N is the list's size.

Note: Iterators and references are not invalidated

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort ( )

inline

Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or std::less<value_type> throws. Basic guarantee.

Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

Note: Iterators and references are not invalidated.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice	(	const_iterator	it,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator *	l = `0`
	)

inline

Requires: it is an iterator to an element in *this.

Effects: Transfers all the elements of list x to this list, before the the element pointed by it. No destructors or copy constructors are called.

Returns: Nothing.

Throws: Nothing.

Complexity: Linear to the elements contained in x plus linear to the elements before it. Linear to the elements before it if cache_last<> option is true. Constant-time if cache_last<> option is true and it == end().

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

Additional note: If the optional parameter "l" is provided, it will be assigned to the last spliced element or prev if x is empty. This iterator can be used as new "prev" iterator for a new splice_after call. that will splice new values after the previously spliced values.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice	(	const_iterator	pos,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator	elem
	)

inline

Requires: it p must be a valid iterator of *this.

elem must point to an element contained in list x.

Effects: Transfers the element elem, from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Linear to the elements before pos and before elem. Linear to the elements before elem if cache_last<> option is true and pos == end().

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice	(	const_iterator	pos,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator	f,
		const_iterator	l
	)

inline

Requires: pos must be a dereferenceable iterator in *this and f and f belong to x and f and f a valid range on x.

Effects: Transfers the range [f, l) from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Linear to the sum of elements before pos, f, and l plus linear to the number of elements transferred if constant_time_size is true. Linear to the sum of elements before f, and l plus linear to the number of elements transferred if constant_time_size is true if cache_last<> is true and pos == end()

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice	(	const_iterator	pos,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator	f,
		const_iterator	l,
		size_type	n
	)

inline

Requires: pos must be a dereferenceable iterator in *this and f and l belong to x and f and l a valid range on x.

n == std::distance(f, l).

Effects: Transfers the range [f, l) from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Linear to the sum of elements before pos, f, and l. Linear to the sum of elements before f and l if cache_last<> is true and pos == end().

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

References boost::n, boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after	(	const_iterator	prev,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator *	l = `0`
	)

inline

Requires: prev must point to an element contained by this list or to the before_begin() element

Effects: Transfers all the elements of list x to this list, after the the element pointed by prev. No destructors or copy constructors are called.

Returns: Nothing.

Throws: Nothing.

Complexity: In general, linear to the elements contained in x. Constant-time if cache_last<> option is true and also constant-time if linear<> option is true "this" is empty and "l" is not used.

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

Additional note: If the optional parameter "l" is provided, it will be assigned to the last spliced element or prev if x is empty. This iterator can be used as new "prev" iterator for a new splice_after call. that will splice new values after the previously spliced values.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::before_begin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cend(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::empty(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::end(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::previous(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::swap().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::merge(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after	(	const_iterator	prev_pos,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator	prev_ele
	)

inline

Requires: prev must point to an element contained by this list or to the before_begin() element.

prev_ele must point to an element contained in list x or must be x.before_begin().

Effects: Transfers the element after prev_ele, from list x to this list, after the element pointed by prev. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Constant.

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after	(	const_iterator	prev_pos,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator	before_f,
		const_iterator	before_l
	)

inline

Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end().

Effects: Transfers the range (before_f, before_l] from list x to this list, after the element pointed by prev_pos. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Linear to the number of elements transferred if constant_time_size is true. Constant-time otherwise.

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

References boost::fusion::distance(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after(), and boost::flyweights::x.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after	(	const_iterator	prev_pos,
		slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > &	x,
		const_iterator	before_f,
		const_iterator	before_l,
		size_type	n
	)

inline

Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end() and n == std::distance(before_f, before_l).

Effects: Transfers the range (before_f, before_l] from list x to this list, after the element pointed by p. No destructors or copy constructors are called.

Throws: Nothing.

Complexity: Constant time.

Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

References boost::fusion::distance(), and boost::flyweights::x.

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::swap ( slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder > & other )

inline

Effects: Swaps the elements of x and *this.

Throws: Nothing.

Complexity: Linear to the number of elements of both lists. Constant-time if linear<> and/or cache_last<> options are used.

Note: Does not affect the validity of iterators and references.

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::operator=(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::slist_impl(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::sort(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::splice_after(), and boost::intrusive::swap().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique ( void )

inline

Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.

No destructors are called.

Throws: If std::equal_to<value_type> throws. Basic guarantee.

Complexity: Linear time (size()-1) comparisons calls to pred()).

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class BinaryPredicate >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique ( BinaryPredicate pred )

inline

Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.

No destructors are called.

Throws: If the predicate throws. Basic guarantee.

Complexity: Linear time (size()-1) comparisons equality comparisons.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose ( Disposer disposer )

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

Throws: If std::equal_to<value_type> throws. Basic guarantee.

Complexity: Linear time (size()-1) comparisons equality comparisons.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique().

Referenced by boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique().

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

template<class BinaryPredicate , class Disposer >

void boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::unique_and_dispose	(	BinaryPredicate	pred,
		Disposer	disposer
	)

inline

Requires: Disposer::operator()(pointer) shouldn't throw.

Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

Throws: If the predicate throws. Basic guarantee.

Complexity: Linear time (size()-1) comparisons equality comparisons.

Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

References boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cbegin(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cend(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::erase_after_and_dispose().

Member Data Documentation

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const bool boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::cache_last = 0 != (BoolFlags & slist_bool_flags::cache_last_pos)

static

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const bool boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::constant_time_size = 0 != (BoolFlags & slist_bool_flags::constant_time_size_pos)

static

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const bool boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::has_container_from_iterator

static

Initial value:

=

detail::is_same< header_holder_type, detail::default_header_holder< node_traits > >::value

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const bool boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::linear = 0 != (BoolFlags & slist_bool_flags::linear_pos)

static

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>

const bool boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::stateful_value_traits = detail::is_stateful_value_traits<value_traits>::value

static

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

boost_1_57_0/boost/intrusive/slist.hpp

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Detailed Description

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder> class boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

template<class ValueTraits, class SizeType, std::size_t BoolFlags, typename HeaderHolder>
class boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >