std::forward_list (3cxx)

Inherits std::_Fwd_list_base< _Tp, _Alloc >.

Public Types

typedef _Alloc allocator_type

typedef

_Fwd_list_const_iterator< _Tp > const_iterator"

typedef

_Alloc_traits::const_pointer const_pointer"

typedef const value_type & const_reference

typedef std::ptrdiff_t difference_type

typedef _Fwd_list_iterator< _Tp > iterator

typedef _Alloc_traits::pointer pointer

typedef value_type & reference

typedef std::size_t size_type

typedef _Tp value_type

Public Member Functions

forward_list (const _Alloc &__al=_Alloc())

forward_list (const forward_list &__list, const _Alloc &__al)

forward_list (forward_list &&__list, const _Alloc &__al) noexcept(_Node_alloc_traits::_S_always_equal())

forward_list (size_type __n, const _Alloc &__al=_Alloc())

forward_list (size_type __n, const _Tp &__value, const _Alloc &__al=_Alloc())

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> forward_list (_InputIterator __first, _InputIterator __last, const _Alloc &__al=_Alloc())

forward_list (const forward_list &__list)

forward_list (forward_list &&__list) noexcept

forward_list (std::initializer_list< _Tp > __il, const _Alloc &__al=_Alloc())

~forward_list () noexcept

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void assign (_InputIterator __first, _InputIterator __last)

void assign (size_type __n, const _Tp &__val)

void assign (std::initializer_list< _Tp > __il)

iterator before_begin () noexcept

const_iterator before_begin () const noexcept

iterator begin () noexcept

const_iterator begin () const noexcept

const_iterator cbefore_begin () const noexcept

const_iterator cbegin () const noexcept

const_iterator cend () const noexcept

void clear () noexcept

template<typename... _Args> iterator emplace_after (const_iterator __pos, _Args &&...__args)

template<typename... _Args> void emplace_front (_Args &&...__args)

bool empty () const noexcept

iterator end () noexcept

const_iterator end () const noexcept

iterator erase_after (const_iterator __pos)

iterator erase_after (const_iterator __pos, const_iterator __last)

reference front ()

const_reference front () const

allocator_type get_allocator () const noexcept

iterator insert_after (const_iterator __pos, const _Tp &__val)

iterator insert_after (const_iterator __pos, _Tp &&__val)

iterator insert_after (const_iterator __pos, size_type __n, const _Tp &__val)

template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> iterator insert_after (const_iterator __pos, _InputIterator __first, _InputIterator __last)

iterator insert_after (const_iterator __pos, std::initializer_list< _Tp > __il)

size_type max_size () const noexcept

void merge (forward_list &&__list)

void merge (forward_list &__list)

template<typename _Comp > void merge (forward_list &&__list, _Comp __comp)

template<typename _Comp > void merge (forward_list &__list, _Comp __comp)

forward_list & operator= (const forward_list &__list)

forward_list & operator= (forward_list &&__list) noexcept(_Node_alloc_traits::_S_nothrow_move())

forward_list & operator= (std::initializer_list< _Tp > __il)

void pop_front ()

void push_front (const _Tp &__val)

void push_front (_Tp &&__val)

void remove (const _Tp &__val)

template<typename _Pred > void remove_if (_Pred __pred)

void resize (size_type __sz)

void resize (size_type __sz, const value_type &__val)

void reverse () noexcept

void sort ()

template<typename _Comp > void sort (_Comp __comp)

void splice_after (const_iterator __pos, forward_list &&__list)

void splice_after (const_iterator __pos, forward_list &__list)

void splice_after (const_iterator __pos, forward_list &&__list, const_iterator __i)

void splice_after (const_iterator __pos, forward_list &__list, const_iterator __i)

void splice_after (const_iterator __pos, forward_list &&, const_iterator __before, const_iterator __last)

void splice_after (const_iterator __pos, forward_list &, const_iterator __before, const_iterator __last)

void swap (forward_list &__list) noexcept(_Node_alloc_traits::_S_nothrow_swap())

void unique ()

template<typename _BinPred > void unique (_BinPred __binary_pred)

Private Member Functions

template<typename... _Args> _Node * _M_create_node (_Args &&...__args)

_Fwd_list_node_base * _M_erase_after (_Fwd_list_node_base *__pos)

_Fwd_list_node_base * _M_erase_after (_Fwd_list_node_base *__pos, _Fwd_list_node_base *__last)

_Node * _M_get_node ()

_Node_alloc_type & _M_get_Node_allocator () noexcept

const _Node_alloc_type & _M_get_Node_allocator () const noexcept

template<typename... _Args> _Fwd_list_node_base * _M_insert_after (const_iterator __pos, _Args &&...__args)

void _M_put_node (_Node *__p)

Private Attributes

_Fwd_list_impl _M_impl

template<typename _Tp, typename _Alloc = allocator<_Tp>>class std::forward_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:

_Tp Type of element.

_Alloc Allocator type, defaults to allocator<_Tp>.

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

This is a singly linked list. Traversal up 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::forward_list provides specialized algorithms unique to linked lists, such as splicing, sorting, and in-place reversal.

Definition at line 414 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (const _Alloc &__al = \fC_Alloc()\fP)\fC [inline]\fP, \fC [explicit]\fP

Creates a forward_list with no elements.

Parameters:

__al An allocator object.

Definition at line 446 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (const \fBforward_list\fP< _Tp, _Alloc > &__list, const _Alloc &__al)\fC [inline]\fP

Copy constructor with allocator argument.

Parameters:

__list Input list to copy.

__al An allocator object.

Definition at line 455 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::begin(), and std::forward_list< _Tp, _Alloc >::end().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (\fBforward_list\fP< _Tp, _Alloc > &&__list, const _Alloc &__al)\fC [inline]\fP, \fC [noexcept]\fP

Move constructor with allocator argument.

Parameters:

__list Input list to move.

__al An allocator object.

Definition at line 464 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (size_type__n, const _Alloc &__al = \fC_Alloc()\fP)\fC [inline]\fP, \fC [explicit]\fP

Creates a forward_list with default constructed elements.

Parameters:

__n The number of elements to initially create.

This constructor creates the forward_list with __n default constructed elements.

Definition at line 477 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (size_type__n, const _Tp &__value, const _Alloc &__al = \fC_Alloc()\fP)\fC [inline]\fP

Creates a forward_list with copies of an exemplar element.

Parameters:

__n The number of elements to initially create.

__value An element to copy.

__al An allocator object.

This constructor fills the forward_list with __n copies of __value.

Definition at line 490 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (_InputIterator__first, _InputIterator__last, const _Alloc &__al = \fC_Alloc()\fP)\fC [inline]\fP

Builds a forward_list from a range.

Parameters:

__first An input iterator.

__last An input iterator.

__al An allocator object.

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

Definition at line 507 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (const \fBforward_list\fP< _Tp, _Alloc > &__list)\fC [inline]\fP

The forward_list copy constructor.

Parameters:

__list A forward_list of identical element and allocator types.

Definition at line 517 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::begin(), and std::forward_list< _Tp, _Alloc >::end().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (\fBforward_list\fP< _Tp, _Alloc > &&__list)\fC [inline]\fP, \fC [noexcept]\fP

The forward_list move constructor.

Parameters:

__list A forward_list of identical element and allocator types.

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

Definition at line 531 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::\fBforward_list\fP (std::initializer_list< _Tp >__il, const _Alloc &__al = \fC_Alloc()\fP)\fC [inline]\fP

Builds a forward_list from an initializer_list.

Parameters:

__il An initializer_list of value_type.

__al An allocator object.

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

Definition at line 542 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBstd::forward_list\fP< _Tp, _Alloc >::~\fBforward_list\fP ()\fC [inline]\fP, \fC [noexcept]\fP

The forward_list dtor.

Definition at line 550 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void \fBstd::forward_list\fP< _Tp, _Alloc >::assign (_InputIterator__first, _InputIterator__last)\fC [inline]\fP

Assigns a range to a forward_list.

Parameters:

__first An input iterator.

__last An input iterator.

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

Note that the assignment completely changes the forward_list and that the number of elements of the resulting forward_list is the same as the number of elements assigned. Old data is lost.

Definition at line 615 of file forward_list.h.

Referenced by std::forward_list< _Tp, _Alloc >::assign(), and std::forward_list< _Tp, _Alloc >::operator=().

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::assign (size_type__n, const _Tp &__val)\fC [inline]\fP

Assigns a given value to a forward_list.

Parameters:

__n Number of elements to be assigned.

__val Value to be assigned.

This function fills a forward_list with __n copies of the given value. Note that the assignment completely changes the forward_list, and that the resulting forward_list has __n elements. Old data is lost.

Definition at line 632 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::assign (std::initializer_list< _Tp >__il)\fC [inline]\fP

Assigns an initializer_list to a forward_list.

Parameters:

__il An initializer_list of value_type.

Replace the contents of the forward_list with copies of the elements in the initializer_list __il. This is linear in il.size().

Definition at line 644 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::assign().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::before_begin ()\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 659 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBconst_iterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::before_begin () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 668 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 676 of file forward_list.h.

Referenced by std::forward_list< _Tp, _Alloc >::forward_list().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBconst_iterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::begin () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 685 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBconst_iterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::cbefore_begin () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 721 of file forward_list.h.

Referenced by std::forward_list< _Tp, _Alloc >::emplace_front(), and std::forward_list< _Tp, _Alloc >::push_front().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBconst_iterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 712 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBconst_iterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::cend () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 730 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP

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 1033 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename... _Args> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::emplace_after (\fBconst_iterator\fP__pos, _Args &&...__args)\fC [inline]\fP

Constructs object in forward_list after the specified iterator.

Parameters:

__pos A const_iterator into the forward_list.

__args Arguments.

Returns:

An iterator that points to the inserted data.

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

Definition at line 843 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename... _Args> void \fBstd::forward_list\fP< _Tp, _Alloc >::emplace_front (_Args &&...__args)\fC [inline]\fP

Constructs object in forward_list at the front of the list.

Parameters:

__args Arguments.

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

Definition at line 787 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::cbefore_begin().

template<typename _Tp, typename _Alloc = allocator<_Tp>> bool \fBstd::forward_list\fP< _Tp, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 738 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::end ()\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 694 of file forward_list.h.

Referenced by std::forward_list< _Tp, _Alloc >::forward_list().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBconst_iterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::end () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 703 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::erase_after (\fBconst_iterator\fP__pos)\fC [inline]\fP

Removes the element pointed to by the iterator following pos.

Parameters:

__pos Iterator pointing before element to be erased.

Returns:

An iterator pointing to the element following the one that was erased, or end() if no such element exists.

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

Due to the nature of a forward_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 946 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::erase_after (\fBconst_iterator\fP__pos, \fBconst_iterator\fP__last)\fC [inline]\fP

Remove a range of elements.

Parameters:

__pos Iterator pointing before the first element to be erased.

__last Iterator pointing to one past the last element to be erased.

Returns:

@ __last.

This function will erase the elements in the range (__pos,__last) and shorten the forward_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 969 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> reference \fBstd::forward_list\fP< _Tp, _Alloc >::front ()\fC [inline]\fP

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

Definition at line 755 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> const_reference \fBstd::forward_list\fP< _Tp, _Alloc >::front () const\fC [inline]\fP

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

Definition at line 766 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> allocator_type \fBstd::forward_list\fP< _Tp, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP

Get a copy of the memory allocation object.

Definition at line 649 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::insert_after (\fBconst_iterator\fP__pos, const _Tp &__val)\fC [inline]\fP

Inserts given value into forward_list after specified iterator.

Parameters:

__pos An iterator into the forward_list.

__val Data to be inserted.

Returns:

An iterator that points to the inserted data.

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

Definition at line 860 of file forward_list.h.

Referenced by std::forward_list< _Tp, _Alloc >::insert_after().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::insert_after (\fBconst_iterator\fP__pos, size_type__n, const _Tp &__val)

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

Parameters:

__pos An iterator into the forward_list.

__n Number of elements to be inserted.

__val Data to be inserted.

Returns:

An iterator pointing to the last inserted copy of val or pos if n == 0.

This function will insert a specified number of copies of the given data after the location specified by pos.

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

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::insert_after (\fBconst_iterator\fP__pos, _InputIterator__first, _InputIterator__last)

Inserts a range into the forward_list.

Parameters:

__pos An iterator into the forward_list.

__first An input iterator.

__last An input iterator.

Returns:

An iterator pointing to the last inserted element or __pos if __first == __last.

This function will insert copies of the data in the range [__first,__last) into the forward_list after the location specified by __pos.

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

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBiterator\fP \fBstd::forward_list\fP< _Tp, _Alloc >::insert_after (\fBconst_iterator\fP__pos, std::initializer_list< _Tp >__il)\fC [inline]\fP

Inserts the contents of an initializer_list into forward_list after the specified iterator.

Parameters:

__pos An iterator into the forward_list.

__il An initializer_list of value_type.

Returns:

An iterator pointing to the last inserted element or __pos if __il is empty.

This function will insert copies of the data in the initializer_list __il into the forward_list before the location specified by __pos.

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

Definition at line 925 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::insert_after().

template<typename _Tp, typename _Alloc = allocator<_Tp>> size_type \fBstd::forward_list\fP< _Tp, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the largest possible number of elements of forward_list.

Definition at line 745 of file forward_list.h.

References std::allocator_traits< _Alloc >::max_size().

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::merge (\fBforward_list\fP< _Tp, _Alloc > &&__list)\fC [inline]\fP

Merge sorted lists.

Parameters:

__list Sorted list to merge.

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

Definition at line 1171 of file forward_list.h.

References std::move().

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _Comp > void \fBstd::forward_list\fP< _Tp, _Alloc >::merge (\fBforward_list\fP< _Tp, _Alloc > &&__list, _Comp__comp)

Merge sorted lists according to comparison function.

Parameters:

__list Sorted list to merge.

__comp Comparison function defining sort order.

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

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBforward_list\fP& \fBstd::forward_list\fP< _Tp, _Alloc >::operator= (const \fBforward_list\fP< _Tp, _Alloc > &__list)

The forward_list assignment operator.

Parameters:

__list A forward_list of identical element and allocator types.

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

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBforward_list\fP& \fBstd::forward_list\fP< _Tp, _Alloc >::operator= (\fBforward_list\fP< _Tp, _Alloc > &&__list)\fC [inline]\fP, \fC [noexcept]\fP

The forward_list move assignment operator.

Parameters:

__list A forward_list of identical element and allocator types.

The contents of __list are moved into this forward_list (without copying, if the allocators permit it). __list is a valid, but unspecified forward_list

Definition at line 574 of file forward_list.h.

References std::move().

template<typename _Tp, typename _Alloc = allocator<_Tp>> \fBforward_list\fP& \fBstd::forward_list\fP< _Tp, _Alloc >::operator= (std::initializer_list< _Tp >__il)\fC [inline]\fP

The forward_list initializer list assignment operator.

Parameters:

__il An initializer_list of value_type.

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

Definition at line 594 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::assign().

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::pop_front ()\fC [inline]\fP

Removes first element. This is a typical stack operation. It shrinks the forward_list by one. Due to the nature of a forward_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 825 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::push_front (const _Tp &__val)\fC [inline]\fP

Add data to the front of the forward_list.

Parameters:

__val Data to be added.

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

Definition at line 802 of file forward_list.h.

References std::forward_list< _Tp, _Alloc >::cbefore_begin().

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::remove (const _Tp &__val)

Remove all elements equal to value.

Parameters:

__val The value to remove.

Removes every element in the list equal to __val. 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.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _Pred > void \fBstd::forward_list\fP< _Tp, _Alloc >::remove_if (_Pred__pred)

Remove all elements satisfying a predicate.

Parameters:

__pred Unary predicate function or object.

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.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::resize (size_type__sz)

Resizes the forward_list to the specified number of elements.

Parameters:

__sz Number of elements the forward_list should contain.

This function will resize the forward_list to the specified number of elements. If the number is smaller than the forward_list's current number of elements the forward_list is truncated, otherwise the forward_list is extended and the new elements are default constructed.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::resize (size_type__sz, const value_type &__val)

Resizes the forward_list to the specified number of elements.

Parameters:

__sz Number of elements the forward_list should contain.

__val Data with which new elements should be populated.

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

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::reverse ()\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 1224 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::sort ()\fC [inline]\fP

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

Definition at line 1205 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _Comp > void \fBstd::forward_list\fP< _Tp, _Alloc >::sort (_Comp__comp)

Sort the forward_list using a comparison function. Sorts the elements of this list in NlogN time. Equivalent elements remain in list order.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::splice_after (\fBconst_iterator\fP__pos, \fBforward_list\fP< _Tp, _Alloc > &&__list)\fC [inline]\fP

Insert contents of another forward_list.

Parameters:

__pos Iterator referencing the element to insert after.

__list Source list.

The elements of list are inserted in constant time after the element referenced by pos. list becomes an empty list.

Requires this != x.

Definition at line 1050 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::splice_after (\fBconst_iterator\fP__pos, \fBforward_list\fP< _Tp, _Alloc > &&__list, \fBconst_iterator\fP__i)

Insert element from another forward_list.

Parameters:

__pos Iterator referencing the element to insert after.

__list Source list.

__i Iterator referencing the element before the element to move.

Removes the element in list list referenced by i and inserts it into the current list after pos.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::splice_after (\fBconst_iterator\fP__pos, \fBforward_list\fP< _Tp, _Alloc > &&, \fBconst_iterator\fP__before, \fBconst_iterator\fP__last)\fC [inline]\fP

Insert range from another forward_list.

Parameters:

__pos Iterator referencing the element to insert after.

__list Source list.

__before Iterator referencing before the start of range in list.

__last Iterator referencing the end of range in list.

Removes elements in the range (__before,__last) and inserts them after __pos in constant time.

Undefined if __pos is in (__before,__last).

Definition at line 1093 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::swap (\fBforward_list\fP< _Tp, _Alloc > &__list)\fC [inline]\fP, \fC [noexcept]\fP

Swaps data with another forward_list.

Parameters:

__list A forward_list of the same element and allocator types.

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 986 of file forward_list.h.

References std::swap().

Referenced by std::swap().

template<typename _Tp, typename _Alloc = allocator<_Tp>> void \fBstd::forward_list\fP< _Tp, _Alloc >::unique ()\fC [inline]\fP

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 1142 of file forward_list.h.

template<typename _Tp, typename _Alloc = allocator<_Tp>> template<typename _BinPred > void \fBstd::forward_list\fP< _Tp, _Alloc >::unique (_BinPred__binary_pred)

Remove consecutive elements satisfying a predicate.

Parameters:

__binary_pred Binary predicate function or object.

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.

Generated automatically by Doxygen for libstdc++ from the source code.