| Defined in header <list> | ||
|---|---|---|
template<
class T,
class Allocator = std::allocator<T>
> class list; |
std::list is a container that supports constant time insertion and removal of elements from anywhere in the container. Fast random access is not supported. It is usually implemented as a doubly-linked list. Compared to std::forward_list this container provides bidirectional iteration capability while being less space efficient.
Addition, removal and moving the elements within the list or across several lists does not invalidate the iterators or references. An iterator is invalidated only when the corresponding element is deleted.
std::list meets the requirements of Container, AllocatorAwareContainer, SequenceContainer and ReversibleContainer.
Template parameters
| T | - | The type of the elements.
| ||||||
| Allocator | - | An allocator that is used to acquire memory to store the elements. The type must meet the requirements of Allocator. |
Member types
| Member type | Definition | ||||
|---|---|---|---|---|---|
value_type | T | ||||
allocator_type | Allocator | ||||
size_type | Unsigned integral type (usually std::size_t) | ||||
difference_type | Signed integer type (usually std::ptrdiff_t) | ||||
reference |
| ||||
const_reference |
| ||||
pointer |
| ||||
const_pointer |
| ||||
iterator | BidirectionalIterator | ||||
const_iterator | Constant bidirectional iterator | ||||
reverse_iterator | std::reverse_iterator<iterator> | ||||
const_reverse_iterator | std::reverse_iterator<const_iterator> |
Member functions
constructs the list (public member function) | |
| (destructor)
| destructs the list (public member function) |
| operator=
| assigns values to the container (public member function) |
| assigns values to the container (public member function) | |
| returns the associated allocator (public member function) | |
Element access | |
| access the first element (public member function) | |
| access the last element (public member function) | |
Iterators | |
| returns an iterator to the beginning (public member function) | |
| returns an iterator to the end (public member function) | |
| returns a reverse iterator to the beginning (public member function) | |
| returns a reverse iterator to the end (public member function) | |
Capacity | |
| checks whether the container is empty (public member function) | |
| returns the number of elements (public member function) | |
| returns the maximum possible number of elements (public member function) | |
Modifiers | |
| clears the contents (public member function) | |
| inserts elements (public member function) | |
| (C++11) | constructs element in-place (public member function) |
| erases elements (public member function) | |
| adds an element to the end (public member function) | |
| (C++11) | constructs an element in-place at the end (public member function) |
| removes the last element (public member function) | |
| inserts an element to the beginning (public member function) | |
| (C++11) | constructs an element in-place at the beginning (public member function) |
| removes the first element (public member function) | |
| changes the number of elements stored (public member function) | |
| swaps the contents (public member function) | |
Operations | |
| merges two sorted lists (public member function) | |
moves elements from another list (public member function) | |
| removes elements satisfying specific criteria (public member function) | |
| reverses the order of the elements (public member function) | |
| removes consecutive duplicate elements (public member function) | |
| sorts the elements (public member function) | |
Non-member functions
| lexicographically compares the values in the list (function template) | |
specializes the std::swap algorithm (function template) |
Please login to continue.