Difference between revisions of "cpp/container/forward list"
D41D8CD98F (Talk | contribs) m |
(+pmr) |
||
| Line 1: | Line 1: | ||
{{cpp/title|forward_list}} | {{cpp/title|forward_list}} | ||
{{cpp/container/forward_list/navbar}} | {{cpp/container/forward_list/navbar}} | ||
| − | {{ | + | {{dcl begin}} |
| + | {{dcl header|forward_list}} | ||
| + | {{dcl | since=c++11 |num=1| | ||
template< | template< | ||
class T, | class T, | ||
| Line 7: | Line 9: | ||
> class forward_list; | > class forward_list; | ||
}} | }} | ||
| + | {{dcl |since=c++17|num=2|1= | ||
| + | namespace pmr { | ||
| + | template <class T> | ||
| + | using forward_list = std::forward_list<T, std::polymorphic_allocator<T>>; | ||
| + | } | ||
| + | }} | ||
| + | {{dcl end}} | ||
{{tt|std::forward_list}} is a container that supports fast insertion and removal of elements from anywhere in the container. Fast random access is not supported. It is implemented as a singly-linked list and essentially does not have any overhead compared to its implementation in C. Compared to {{lc|std::list}} this container provides more space efficient storage when bidirectional iteration is not needed. | {{tt|std::forward_list}} is a container that supports fast insertion and removal of elements from anywhere in the container. Fast random access is not supported. It is implemented as a singly-linked list and essentially does not have any overhead compared to its implementation in C. Compared to {{lc|std::list}} this container provides more space efficient storage when bidirectional iteration is not needed. | ||
Revision as of 07:06, 16 March 2016
| Defined in header <forward_list>
|
||
| template< class T, |
(1) | (since C++11) |
| namespace pmr { template <class T> |
(2) | (since C++17) |
std::forward_list is a container that supports fast insertion and removal of elements from anywhere in the container. Fast random access is not supported. It is implemented as a singly-linked list and essentially does not have any overhead compared to its implementation in C. Compared to std::list this container provides more space efficient storage when bidirectional iteration is not needed.
Adding, removing and moving the elements within the list, or across several lists, does not invalidate the iterators currently referring to other elements in the list. However, an iterator or reference referring to an element is invalidated when the corresponding element is removed (via erase_after) from the list.
std::forward_list meets the requirements of Template:concept (except for the size member function and that operator=='s complexity is always linear), Template:concept and Template:concept.
Contents |
Template parameters
| T | - | The type of the elements.
| ||||||||||||
| Allocator | - | An allocator that is used to acquire/release memory and to construct/destroy the elements in that memory. The type must meet the requirements of Allocator. The behavior is undefined(until C++20)The program is ill-formed(since C++20) if Allocator::value_type is not the same as T.
|
Member types
| Member type | Definition |
value_type
|
T
|
allocator_type
|
Allocator
|
size_type
|
Unsigned integer type (usually std::size_t) |
difference_type
|
Signed integer type (usually std::ptrdiff_t) |
reference
|
value_type& |
const_reference
|
const value_type& |
pointer
|
std::allocator_traits<Allocator>::pointer |
const_pointer
|
std::allocator_traits<Allocator>::const_pointer |
iterator
|
LegacyForwardIterator to value_type
|
const_iterator
|
LegacyForwardIterator to const value_type |
Member functions
constructs the forward_list (public member function) | |
destructs the forward_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) | |
Iterators | |
| returns an iterator to the element before beginning (public member function) | |
| returns an iterator to the beginning (public member function) | |
| returns an iterator to the end (public member function) | |
Capacity | |
| checks whether the container is empty (public member function) | |
| returns the maximum possible number of elements (public member function) | |
Modifiers | |
| clears the contents (public member function) | |
| inserts elements after an element (public member function) | |
| constructs elements in-place after an element (public member function) | |
| erases an element after an element (public member function) | |
| inserts an element to the beginning (public member function) | |
| 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 forward_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
| (C++11)(C++11)(removed in C++20)(C++11)(removed in C++20)(C++11)(removed in C++20)(C++11)(removed in C++20)(C++11)(removed in C++20)(C++20) |
lexicographically compares the values of two forward_lists (function template) |
| (C++11) |
specializes the std::swap algorithm (function template) |
