std::forward_list
Defined in header <forward_list>
|
||
template< class T, |
(since C++11) | |
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 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.
Addition, removal and moving the elements within the list or across several lists does not invalidate the iterators. An iterator is invalidated only when the corresponding element is deleted.
std::forward_list
meets the requirements of Template:concept (except for the size()
member function), 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 .
|