std::list
From cppreference.com
| Defined in header <list>
|
||
| template< class T, |
||
List is a container which supports fast insertion and removal of elements from anywhere from the container. Fast random access is not supported. It is implemented as double-linked list. Compared to std::forward_list this container provides bidirectional iteration capability while being less space efficient.
std::list meets the requirements of Container, AllocatorAwareContainer, SequenceContainer and ReversibleContainer.
Contents |
[edit] Member types
| Member type | Definition |
| value_type | T |
| allocator_type | Allocator |
| size_type | Unsigned integral type (usually size_t) |
| difference_type | Signed integer type (usually ptrdiff_t) |
| reference | Allocator::reference (until C++11) value_type& (since C++11) |
| const_reference | Allocator::const_reference (until C++11) const value_type& (since C++11) |
| pointer | Allocator::pointer (until C++11) std::allocator_traits<Allocator>::pointer (since C++11) |
| const_pointer | Allocator::const_pointer (until C++11) std::allocator_traits<Allocator>::const_pointer (since C++11) |
| iterator | BidirectionalIterator |
| const_iterator | Constant bidirectional iterator |
reverse_iterator
|
std::reverse_iterator<iterator> |
const_reverse_iterator
|
std::reverse_iterator<const_iterator> |
[edit] Member functions
| constructs the list (public member function) | |
| destructs the list (public member function) | |
| 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 elements to the end (public member function) | |
| (C++11) |
constructs elements in-place at the end (public member function) |
| removes the last element (public member function) | |
| inserts elements to the beginning (public member function) | |
| (C++11) |
constructs elements 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) | |
[edit] Non-member functions
| lexicographically compares the values in the list (function template) | |
| specializes the std::swap algorithm (function template) | |