![]() |
Home | Libraries | People | FAQ | More |
boost::intrusive::slist
// In header: <boost/intrusive/slist.hpp> template<typename T, Options> class slist { public: // types typedef ; typedef ; typedef ; typedef pointer_traits< ; typedef pointer_traits< ; typedef pointer_traits< ; typedef pointer_traits< ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; typedef ; // construct/copy/destruct (); (); template<typename Iterator> (, , = ); (slist &&); slist & (slist &&); ~(); // public member functions () ; template<typename Disposer> () ; () ; () ; () ; template<typename Disposer> () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; () ; (slist &); ( = ) ; ( = ) ; template<typename Cloner, typename Disposer> (slist &, , ); template<typename Cloner, typename Disposer> (slist &&, , ); (, ) ; template<typename Iterator> (, , ) ; (, ) ; template<typename Iterator> (, , ) ; () ; (, ) ; (, , ) ; () ; (, ) ; (, , ) ; template<typename Disposer> (, ) ; template<typename Disposer> (, , ) ; template<typename Disposer> (, ) ; template<typename Disposer> (, , ) ; template<typename Iterator> (, ); template<typename Iterator, typename Disposer> (, , ); (, slist &, = ) ; (, slist &, ) ; (, slist &, , ) ; (, slist &, , , ) ; (, slist &, = ) ; (, slist &, ) ; (, slist &, , ) ; (, slist &, , , ) ; template<typename Predicate> (); (); template<typename Predicate> (slist &, , = ); (slist &); () ; () ; template<typename Disposer> (, ) ; template<typename Pred> (); template<typename Pred, typename Disposer> (, ); (); template<typename BinaryPredicate> (); template<typename Disposer> (); template<typename BinaryPredicate, typename Disposer> (, ); () ; () ; () ; () ; (, ) ; (, ) ; () ; // public static functions slist & () ; slist & () ; () ; () ; // private member functions (, slist &, , ); (, , ); (); (); (, ); (, ); (, ); (, ); // private static functions (slist *, slist *); (, , ); (, , ); slist & (); // public data members static constant_time_size; static stateful_value_traits; static linear; static cache_last; static has_container_from_iterator; };
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()
slist
public
construct/copy/destruct();
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).
( v_traits);
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<typename Iterator> ( b, e, v_traits = );
Requires: Dereferencing iterator must yield an lvalue of type value_type.
Effects: Constructs a list equal to [b ,e).
Complexity: Linear in 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).
(slist && x);
Effects: Constructs a container moving resources from another container. Internal value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.
Complexity: Constant.
Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of value traits throws.
slist & (slist && x);
Effects: Equivalent to swap
~();
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.
slist
public member functions() ;
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.
template<typename Disposer> ( disposer) ;
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.
( value) ;
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.
( value) ;
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.
() ;
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.
template<typename Disposer> ( disposer) ;
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.
() ;
Effects: Returns a reference to the first element of the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_reference to the first element of the list.
Throws: Nothing.
Complexity: Constant.
() ;
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.
() ;
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.
() ;
Effects: Returns an iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the first element contained in the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns an iterator to the end of the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns a const_iterator to the end of the list.
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"
Throws: Nothing.
Complexity: Constant.
() ;
Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"
Throws: Nothing.
Complexity: Constant.
() ;
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.
() ;
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.
() ;
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.
() ;
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.
() ;
Effects: Returns true if the list contains no elements.
Throws: Nothing.
Complexity: Constant.
Note: Does not affect the validity of iterators and references.
(slist & other);
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.
( n = ) ;
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.
( n = ) ;
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<typename Cloner, typename Disposer> (slist & src, cloner, disposer);
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.
template<typename Cloner, typename Disposer> (slist && src, cloner, disposer);
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()(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.
( prev_p, value) ;
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.
template<typename Iterator> ( prev_p, f, 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.
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.
( p, value) ;
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.
template<typename Iterator> ( p, b, 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.
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.
( prev) ;
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.
( before_f, l) ;
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.
( before_f, l, n) ;
Effects: Erases the range (before_f, l) from the list. n must be 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.
( i) ;
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.
( f, l) ;
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.
( f, l, n) ;
Effects: Erases the range [f, l) from the list. n must be 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.
template<typename Disposer> ( prev, disposer) ;
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.
template<typename Disposer> ( before_f, l, disposer) ;
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: Linear to the elements (l - before_f + 1).
Note: Invalidates the iterators to the erased element.
template<typename Disposer> ( i, disposer) ;
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.
template<typename Disposer> ( f, l, disposer) ;
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.
template<typename Iterator> ( b, e);
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.
template<typename Iterator, typename Disposer> ( disposer, b, e);
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.
( prev, slist & x, l = ) ;
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.
( prev_pos, slist & x, prev_ele) ;
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.
( prev_pos, slist & x, before_f, 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().
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.
( prev_pos, slist & x, before_f, before_l, 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 == 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.
( it, slist & x, l = ) ;
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.
( pos, slist & x, elem) ;
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.
( pos, slist & x, f, 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.
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.
( pos, slist & x, f, l, 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. n == 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.
template<typename Predicate> ( p);
Effects: This function sorts the list *this according to operator<. 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
();
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 operator< 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<typename Predicate> (slist & x, p, l = );
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.
(slist & x);
Effects: This function removes all of x's elements and inserts them in order into *this according to operator<. 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 operator< 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
() ;
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
( value) ;
Effects: Removes all the elements that compare equal to value. No destructors are called.
Throws: If operator== 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.
template<typename Disposer> ( value, disposer) ;
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 operator== 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.
template<typename Pred> ( pred);
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.
template<typename Pred, typename Disposer> ( pred, disposer);
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.
();
Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. No destructors are called.
Throws: If operator== 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.
template<typename BinaryPredicate> ( pred);
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.
template<typename Disposer> ( disposer);
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 operator== 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.
template<typename BinaryPredicate, typename Disposer> ( pred, disposer);
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.
( value) ;
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.
( value) ;
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.
( i) ;
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().
( i) ;
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().
( prev_from, i) ;
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().
( prev_from, i) ;
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().
() ;
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.
slist
public static functionsslist & ( end_iterator) ;
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.
slist & ( end_iterator) ;
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.
( value) ;
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.
( value) ;
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.
slist
private member functions( prev_pos_n, slist & x, before_f_n, before_l_n);
( prev_pos_n, first_n, before_l_n);
();
();
( n, );
( n, );
( n, );
( n, );