Public Types¶

typedef _Alloc allocator_type
typedef _List_const_iterator< _Tp > const_iterator
typedef _Tp_alloc_type::const_pointer const_pointer
typedef _Tp_alloc_type::const_reference const_reference
typedef std::reverse_iterator< const_iterator > const_reverse_iterator
typedef ptrdiff_t difference_type
typedef _List_iterator< _Tp > iterator
typedef _Tp_alloc_type::pointer pointer
typedef _Tp_alloc_type::reference reference
typedef std::reverse_iterator< iterator > reverse_iterator
typedef size_t size_type
typedef _Tp value_type

Public Member Functions¶

list () noexcept(is_nothrow_default_constructible< _Node_alloc_type >::value)
list (const allocator_type &__a) noexcept
list (size_type __n)
list (size_type __n, const value_type &__value, const allocator_type &__a=allocator_type())
list (const list &__x)
list (list &&__x) noexcept
list (initializer_list< value_type > __l, const allocator_type &__a=allocator_type())
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> list (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())
void assign (size_type __n, const value_type &__val)
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void assign (_InputIterator __first, _InputIterator __last)
void assign (initializer_list< value_type > __l)
reference back () noexcept
const_reference back () const noexcept
iterator begin () noexcept
const_iterator begin () const noexcept
const_iterator cbegin () const noexcept
const_iterator cend () const noexcept
void clear () noexcept
const_reverse_iterator crbegin () const noexcept
const_reverse_iterator crend () const noexcept
template<typename... _Args> iterator emplace (const_iterator __position, _Args &&... __args)
template<typename... _Args> void emplace_back (_Args &&... __args)
template<typename... _Args> void emplace_front (_Args &&... __args)
bool empty () const noexcept
iterator end () noexcept
const_iterator end () const noexcept
iterator erase (const_iterator __position) noexcept
iterator erase (const_iterator __first, const_iterator __last) noexcept
reference front () noexcept
const_reference front () const noexcept
allocator_type get_allocator () const noexcept
iterator insert (const_iterator __position, const value_type &__x)
iterator insert (const_iterator __position, value_type &&__x)
iterator insert (const_iterator __p, initializer_list< value_type > __l)
iterator insert (const_iterator __position, size_type __n, const value_type &__x)
template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> iterator insert (const_iterator __position, _InputIterator __first, _InputIterator __last)
size_type max_size () const noexcept
void merge (list &&__x)
void merge (list &__x)
template<typename _StrictWeakOrdering > void merge (list &&__x, _StrictWeakOrdering __comp)
template<typename _StrictWeakOrdering > void merge (list &__x, _StrictWeakOrdering __comp)
list & operator= (const list &__x)
list & operator= (list &&__x)
list & operator= (initializer_list< value_type > __l)
void pop_back () noexcept
void pop_front () noexcept
void push_back (const value_type &__x)
void push_back (value_type &&__x)
void push_front (const value_type &__x)
void push_front (value_type &&__x)
reverse_iterator rbegin () noexcept
const_reverse_iterator rbegin () const noexcept
void remove (const _Tp &__value)
template<typename _Predicate > void remove_if (_Predicate)
reverse_iterator rend () noexcept
const_reverse_iterator rend () const noexcept
void resize (size_type __new_size)
void resize (size_type __new_size, const value_type &__x)
void reverse () noexcept
size_type size () const noexcept
void sort ()
template<typename _StrictWeakOrdering > void sort (_StrictWeakOrdering)
void splice (const_iterator __position, list &&__x) noexcept
void splice (const_iterator __position, list &__x) noexcept
void splice (const_iterator __position, list &&__x, const_iterator __i) noexcept
void splice (const_iterator __position, list &__x, const_iterator __i) noexcept
void splice (const_iterator __position, list &&__x, const_iterator __first, const_iterator __last) noexcept
void splice (const_iterator __position, list &__x, const_iterator __first, const_iterator __last) noexcept
void swap (list &__x)
void unique ()
template<typename _BinaryPredicate > void unique (_BinaryPredicate)

Protected Types¶

typedef _List_node< _Tp > _Node

Protected Member Functions¶

template<typename _Integer > void _M_assign_dispatch (_Integer __n, _Integer __val, __true_type)
template<typename _InputIterator > void _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
void _M_check_equal_allocators (list &__x) noexcept
void _M_clear () noexcept
template<typename... _Args> _Node * _M_create_node (_Args &&... __args)
void _M_dec_size (size_t)
void _M_default_append (size_type __n)
void _M_default_initialize (size_type __n)
size_t _M_distance (const void *, const void *) const
void _M_erase (iterator __position) noexcept
void _M_fill_assign (size_type __n, const value_type &__val)
void _M_fill_initialize (size_type __n, const value_type &__x)
_List_node< _Tp > * _M_get_node ()
_Node_alloc_type & _M_get_Node_allocator () noexcept
const _Node_alloc_type & _M_get_Node_allocator () const noexcept
size_t _M_get_size () const
_Tp_alloc_type _M_get_Tp_allocator () const noexcept
void _M_inc_size (size_t)
void _M_init () noexcept
template<typename _Integer > void _M_initialize_dispatch (_Integer __n, _Integer __x, __true_type)
template<typename _InputIterator > void _M_initialize_dispatch (_InputIterator __first, _InputIterator __last, __false_type)
template<typename... _Args> void _M_insert (iterator __position, _Args &&... __args)
size_t _M_node_count () const
void _M_put_node (_List_node< _Tp > *__p) noexcept
void _M_set_size (size_t)
void _M_transfer (iterator __position, iterator __first, iterator __last)

Static Protected Member Functions¶

static size_t _S_distance (const __detail::_List_node_base *__first, const __detail::_List_node_base *__last)

Protected Attributes¶

_List_impl _M_impl

template<typename _Tp, typename _Alloc = std::allocator<_Tp>>¶

class std::list< _Tp, _Alloc >" A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence.

Template Parameters:

Meets the requirements of a container, a reversible container, and a sequence, including the optional sequence requirements with the exception of at and operator[].

This is a doubly linked list. Traversal up and down the list requires linear time, but adding and removing elements (or nodes) is done in constant time, regardless of where the change takes place. Unlike std::vector and std::deque, random-access iterators are not provided, so subscripting ( [] ) access is not allowed. For algorithms which only need sequential access, this lack makes no difference.

Also unlike the other standard containers, std::list provides specialized algorithms unique to linked lists, such as splicing, sorting, and in-place reversal.

A couple points on memory allocation for list<Tp>:

First, we never actually allocate a Tp, we allocate List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure that after elements from list<X,Alloc1> are spliced into list<X,Alloc2>, destroying the memory of the second list is a valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.

Second, a list conceptually represented as

A <---> B <---> C <---> D

is actually circular; a link exists between A and D. The list class holds (as its only data member) a private list::iterator pointing to D, not to A! To get to the head of the list, we start at the tail and move forward by one. When this member iterator's next/previous pointers refer to itself, the list is empty.

Definition at line 507 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list () [inline], [noexcept]¶

Creates a list with no elements.

Definition at line 593 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list (const allocator_type & __a) [inline], [explicit], [noexcept]¶

Creates a list with no elements.

Parameters:

Definition at line 604 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list (size_type __n) [inline], [explicit]¶

Creates a list with default constructed elements.

Parameters:

This constructor fills the list with __n default constructed elements.

Definition at line 616 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list (size_type __n, const value_type & __value, const allocator_type & __a = allocator_type()) [inline]¶

Creates a list with copies of an exemplar element.

Parameters:

This constructor fills the list with __n copies of __value.

Definition at line 628 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list (const list< _Tp, _Alloc > & __x) [inline]¶

List copy constructor.

Parameters:

The newly-created list uses a copy of the allocation object used by __x.

Definition at line 655 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list (list< _Tp, _Alloc > && __x) [inline], [noexcept]¶

List move constructor.

Parameters:

The newly-created list contains the exact contents of __x. The contents of __x are a valid, but unspecified list.

Definition at line 667 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> std::list< _Tp, _Alloc >::list (initializer_list< value_type > __l, const allocator_type & __a = allocator_type()) [inline]¶

Builds a list from an initializer_list.

Parameters:

Create a list consisting of copies of the elements in the initializer_list __l. This is linear in __l.size().

Definition at line 678 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> std::list< _Tp, _Alloc >::list (_InputIterator __first, _InputIterator __last, const allocator_type & __a = allocator_type()) [inline]¶

Builds a list from a range.

Parameters:

Create a list consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).

Definition at line 697 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename... _Args> _Node* std::list< _Tp, _Alloc >::_M_create_node (_Args &&... __args) [inline], [protected]¶

Parameters:

Allocates space for a new node and constructs a copy of __args in it.

Definition at line 569 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::assign (size_type __n, const value_type & __val) [inline]¶

Assigns a given value to a list.

Parameters:

This function fills a list with __n copies of the given value. Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. Old data may be lost.

Definition at line 775 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void std::list< _Tp, _Alloc >::assign (_InputIterator __first, _InputIterator __last) [inline]¶

Assigns a range to a list.

Parameters:

This function fills a list with copies of the elements in the range [__first,__last).

Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. Old data may be lost.

Definition at line 794 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::assign (initializer_list< value_type > __l) [inline]¶

Assigns an initializer_list to a list.

Parameters:

Replace the contents of the list with copies of the elements in the initializer_list __l. This is linear in __l.size().

Definition at line 816 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference std::list< _Tp, _Alloc >::back () [inline], [noexcept]¶

Returns a read/write reference to the data at the last element of the list.

Definition at line 1016 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference std::list< _Tp, _Alloc >::back () const [inline], [noexcept]¶

Returns a read-only (constant) reference to the data at the last element of the list.

Definition at line 1028 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::list< _Tp, _Alloc >::begin () [inline], [noexcept]¶

Returns a read/write iterator that points to the first element in the list. Iteration is done in ordinary element order.

Definition at line 831 of file stl_list.h.

Referenced by std::list< __inp, __rebind_inp >::insert(), std::list< __inp, __rebind_inp >::list(), std::list< __inp, __rebind_inp >::merge(), std::list< __inp, __rebind_inp >::operator=(), std::operator==(), std::list< __inp, __rebind_inp >::sort(), and std::list< __inp, __rebind_inp >::splice().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::list< _Tp, _Alloc >::begin () const [inline], [noexcept]¶

Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order.

Definition at line 840 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::list< _Tp, _Alloc >::cbegin () const [inline], [noexcept]¶

Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order.

Definition at line 904 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::list< _Tp, _Alloc >::cend () const [inline], [noexcept]¶

Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order.

Definition at line 913 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::clear () [inline], [noexcept]¶

Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1366 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::list< _Tp, _Alloc >::crbegin () const [inline], [noexcept]¶

Returns a read-only (constant) reverse iterator that points to the last element in the list. Iteration is done in reverse element order.

Definition at line 922 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::list< _Tp, _Alloc >::crend () const [inline], [noexcept]¶

Returns a read-only (constant) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order.

Definition at line 931 of file stl_list.h.

template<typename _Tp , typename _Alloc > template<typename... _Args> list< _Tp, _Alloc >::iterator list::emplace (const_iterator __position, _Args &&... __args)¶

Constructs object in list before specified iterator.

Parameters:

Returns:

This function will insert an object of type T constructed with T(std::forward<Args>(args)...) before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.

Definition at line 88 of file list.tcc.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> bool std::list< _Tp, _Alloc >::empty () const [inline], [noexcept]¶

Returns true if the list is empty. (Thus begin() would equal end().)

Definition at line 941 of file stl_list.h.

Referenced by std::list< __inp, __rebind_inp >::insert(), std::list< __inp, __rebind_inp >::sort(), and std::list< __inp, __rebind_inp >::splice().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::list< _Tp, _Alloc >::end () [inline], [noexcept]¶

Returns a read/write iterator that points one past the last element in the list. Iteration is done in ordinary element order.

Definition at line 849 of file stl_list.h.

Referenced by std::list< __inp, __rebind_inp >::list(), std::list< __inp, __rebind_inp >::merge(), std::list< __inp, __rebind_inp >::operator=(), std::operator==(), and std::list< __inp, __rebind_inp >::splice().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_iterator std::list< _Tp, _Alloc >::end () const [inline], [noexcept]¶

Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order.

Definition at line 858 of file stl_list.h.

template<typename _Tp , typename _Alloc > list< _Tp, _Alloc >::iterator list::erase (const_iterator __position) [noexcept]¶

Remove element at given position.

Parameters:

Returns:

This function will erase the element at the given position and thus shorten the list by one.

Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 150 of file list.tcc.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::list< _Tp, _Alloc >::erase (const_iterator __first, const_iterator __last) [inline], [noexcept]¶

Remove a range of elements.

Parameters:

Returns:

This function will erase the elements in the range [first,last) and shorten the list accordingly.

This operation is linear time in the size of the range and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 1324 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reference std::list< _Tp, _Alloc >::front () [inline], [noexcept]¶

Returns a read/write reference to the data at the first element of the list.

Definition at line 1000 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reference std::list< _Tp, _Alloc >::front () const [inline], [noexcept]¶

Returns a read-only (constant) reference to the data at the first element of the list.

Definition at line 1008 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> allocator_type std::list< _Tp, _Alloc >::get_allocator () const [inline], [noexcept]¶

Get a copy of the memory allocation object.

Definition at line 822 of file stl_list.h.

template<typename _Tp , typename _Alloc > list< _Tp, _Alloc >::iterator list::insert (const_iterator __position, const value_type & __x)¶

Inserts given value into list before specified iterator.

Parameters:

Returns:

This function will insert a copy of the given value before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.

Definition at line 101 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::insert().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::list< _Tp, _Alloc >::insert (const_iterator __position, value_type && __x) [inline]¶

Inserts given rvalue into list before specified iterator.

Parameters:

Returns:

This function will insert a copy of the given rvalue before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.

Definition at line 1176 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> iterator std::list< _Tp, _Alloc >::insert (const_iterator __p, initializer_list< value_type > __l) [inline]¶

Inserts the contents of an initializer_list into list before specified const_iterator.

Parameters:

Returns:

This function will insert copies of the data in the initializer_list l into the list before the location specified by p.

This operation is linear in the number of elements inserted and does not invalidate iterators and references.

Definition at line 1195 of file stl_list.h.

template<typename _Tp , typename _Alloc > list< _Tp, _Alloc >::iterator list::insert (const_iterator __position, size_type __n, const value_type & __x)¶

Inserts a number of copies of given data into the list.

Parameters:

Returns:

This function will insert a specified number of copies of the given data before the location specified by position.

This operation is linear in the number of elements inserted and does not invalidate iterators and references.

Definition at line 116 of file list.tcc.

template<typename _Tp , typename _Alloc > template<typename _InputIterator , typename > list< _Tp, _Alloc >::iterator list::insert (const_iterator __position, _InputIterator __first, _InputIterator __last)¶

Inserts a range into the list.

Parameters:

Returns:

This function will insert copies of the data in the range [first,last) into the list before the location specified by position.

This operation is linear in the number of elements inserted and does not invalidate iterators and references.

Definition at line 132 of file list.tcc.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type std::list< _Tp, _Alloc >::max_size () const [inline], [noexcept]¶

Returns the size() of the largest possible list.

Definition at line 951 of file stl_list.h.

template<typename _Tp , typename _Alloc > void list::merge (list< _Tp, _Alloc > && __x)¶

Merge sorted lists.

Parameters:

Assumes that both __x and this list are sorted according to operator<(). Merges elements of __x into this list in sorted order, leaving __x empty when complete. Elements in this list precede elements in __x that are equal.

Definition at line 332 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::sort().

template<typename _Tp , typename _Alloc > template<typename _StrictWeakOrdering > void list::merge (list< _Tp, _Alloc > && __x, _StrictWeakOrdering __comp)¶

Merge sorted lists according to comparison function.

Template Parameters:

Parameters:

Assumes that both __x and this list are sorted according to StrictWeakOrdering. Merges elements of __x into this list in sorted order, leaving __x empty when complete. Elements in this list precede elements in __x that are equivalent according to StrictWeakOrdering().

Definition at line 369 of file list.tcc.

template<typename _Tp , typename _Alloc > list< _Tp, _Alloc > & list::operator= (const list< _Tp, _Alloc > & __x)¶

List assignment operator. No explicit dtor needed as the _Base dtor takes care of things. The _Base dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Parameters:

All the elements of __x are copied, but unlike the copy constructor, the allocator object is not copied.

Definition at line 229 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::resize().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> list& std::list< _Tp, _Alloc >::operator= (list< _Tp, _Alloc > && __x) [inline]¶

List move assignment operator.

Parameters:

The contents of __x are moved into this list (without copying). __x is a valid, but unspecified list

Definition at line 740 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> list& std::list< _Tp, _Alloc >::operator= (initializer_list< value_type > __l) [inline]¶

List initializer list assignment operator.

Parameters:

Replace the contents of the list with copies of the elements in the initializer_list __l. This is linear in l.size().

Definition at line 757 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::pop_back () [inline], [noexcept]¶

Removes last element. This is a typical stack operation. It shrinks the list by one. Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed.

Note that no data is returned, and if the last element's data is needed, it should be retrieved before pop_back() is called.

Definition at line 1114 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::pop_front () [inline], [noexcept]¶

Removes first element. This is a typical stack operation. It shrinks the list by one. Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed.

Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called.

Definition at line 1074 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::push_back (const value_type & __x) [inline]¶

Add data to the end of the list.

Parameters:

This is a typical stack operation. The function creates an element at the end of the list and assigns the given data to it. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.

Definition at line 1088 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::push_front (const value_type & __x) [inline]¶

Add data to the front of the list.

Parameters:

This is a typical stack operation. The function creates an element at the front of the list and assigns the given data to it. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.

Definition at line 1047 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reverse_iterator std::list< _Tp, _Alloc >::rbegin () [inline], [noexcept]¶

Returns a read/write reverse iterator that points to the last element in the list. Iteration is done in reverse element order.

Definition at line 867 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::list< _Tp, _Alloc >::rbegin () const [inline], [noexcept]¶

Returns a read-only (constant) reverse iterator that points to the last element in the list. Iteration is done in reverse element order.

Definition at line 876 of file stl_list.h.

template<typename _Tp, typename _Alloc > void list::remove (const _Tp & __value)¶

Remove all elements equal to value.

Parameters:

Removes every element in the list equal to value. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 283 of file list.tcc.

template<typename _Tp , typename _Alloc > template<typename _Predicate > void list::remove_if (_Predicate __pred)¶

Remove all elements satisfying a predicate.

Template Parameters:

Removes every element in the list for which the predicate returns true. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 442 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::sort().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> reverse_iterator std::list< _Tp, _Alloc >::rend () [inline], [noexcept]¶

Returns a read/write reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order.

Definition at line 885 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> const_reverse_iterator std::list< _Tp, _Alloc >::rend () const [inline], [noexcept]¶

Returns a read-only (constant) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order.

Definition at line 894 of file stl_list.h.

template<typename _Tp , typename _Alloc > void list::resize (size_type __new_size)¶

Resizes the list to the specified number of elements.

Parameters:

This function will resize the list to the specified number of elements. If the number is smaller than the list's current size the list is truncated, otherwise default constructed elements are appended.

Definition at line 183 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::resize().

template<typename _Tp , typename _Alloc > void list::resize (size_type __new_size, const value_type & __x)¶

Resizes the list to the specified number of elements.

Parameters:

This function will resize the list to the specified number of elements. If the number is smaller than the list's current size the list is truncated, otherwise the list is extended and new elements are populated with given data.

Definition at line 198 of file list.tcc.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::reverse () [inline], [noexcept]¶

Reverse the elements in list. Reverse the order of elements in the list in linear time.

Definition at line 1650 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> size_type std::list< _Tp, _Alloc >::size () const [inline], [noexcept]¶

Returns the number of elements in the list.

Definition at line 946 of file stl_list.h.

template<typename _Tp , typename _Alloc > void list::sort ()¶

Sort the elements. Sorts the elements of this list in NlogN time. Equivalent elements remain in list order.

Definition at line 404 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::merge(), and std::list< __inp, __rebind_inp >::unique().

template<typename _Tp , typename _Alloc > template<typename _StrictWeakOrdering > void list::sort (_StrictWeakOrdering __comp)¶

Sort the elements according to comparison function. Sorts the elements of this list in NlogN time. Equivalent elements remain in list order.

Definition at line 481 of file list.tcc.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::splice (const_iterator __position, list< _Tp, _Alloc > && __x) [inline], [noexcept]¶

Insert contents of another list.

Parameters:

The elements of __x are inserted in constant time in front of the element referenced by __position. __x becomes an empty list.

Requires this != __x.

Definition at line 1386 of file stl_list.h.

Referenced by std::list< __inp, __rebind_inp >::sort().

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::splice (const_iterator __position, list< _Tp, _Alloc > && __x, const_iterator __i) [inline], [noexcept]¶

Insert element from another list.

Parameters:

Removes the element in list __x referenced by __i and inserts it into the current list before __position.

Definition at line 1421 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::splice (const_iterator __position, list< _Tp, _Alloc > & __x, const_iterator __i) [inline], [noexcept]¶

Insert element from another list.

Parameters:

Removes the element in list __x referenced by __i and inserts it into the current list before __position.

Definition at line 1463 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::splice (const_iterator __position, list< _Tp, _Alloc > && __x, const_iterator __first, const_iterator __last) [inline], [noexcept]¶

Insert range from another list.

Parameters:

Removes elements in the range [__first,__last) and inserts them before __position in constant time.

Undefined if __position is in [__first,__last).

Definition at line 1482 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::splice (const_iterator __position, list< _Tp, _Alloc > & __x, const_iterator __first, const_iterator __last) [inline], [noexcept]¶

Insert range from another list.

Parameters:

Removes elements in the range [__first,__last) and inserts them before __position in constant time.

Undefined if __position is in [__first,__last).

Definition at line 1532 of file stl_list.h.

template<typename _Tp, typename _Alloc = std::allocator<_Tp>> void std::list< _Tp, _Alloc >::swap (list< _Tp, _Alloc > & __x) [inline]¶

Swaps data with another list.

Parameters:

This exchanges the elements between two lists in constant time. Note that the global std::swap() function is specialized such that std::swap(l1,l2) will feed to this function.

Definition at line 1344 of file stl_list.h.

Referenced by std::list< __inp, __rebind_inp >::sort(), and std::swap().

template<typename _Tp , typename _Alloc > void list::unique ()¶

Remove consecutive duplicate elements. For each consecutive set of elements with the same value, remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 311 of file list.tcc.

Referenced by std::list< __inp, __rebind_inp >::remove(), and std::list< __inp, __rebind_inp >::remove_if().

template<typename _Tp , typename _Alloc > template<typename _BinaryPredicate > void list::unique (_BinaryPredicate __binary_pred)¶

Remove consecutive elements satisfying a predicate.

Template Parameters:

For each consecutive set of elements [first,last) that satisfy predicate(first,i) where i is an iterator in [first,last), remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 460 of file list.tcc.