Showing content from https://en.cppreference.com/w/cpp/language/../error/error_code/../../container/forward_list.html below:
std::forward_list - cppreference.com
template<
class T,
class Allocator = std::allocator<T>
> class forward_list; (1) (since C++11) (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. 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 Container (except for the size member function and that operator=='s complexity is always linear), AllocatorAwareContainer and SequenceContainer.
All member functions of std::forward_list are constexpr: it is possible to create and use std::forward_list objects in the evaluation of a constant expression.
However, std::forward_list objects generally cannot be constexpr, because any dynamically allocated storage must be released in the same evaluation of constant expression.
(since C++26) [edit] Template parameters T - The type of the elements. The requirements that are imposed on the elements depend on the actual operations performed on the container. Generally, it is required that element type is a complete type and meets the requirements of Erasable, but many member functions impose stricter requirements. (until C++17)
The requirements that are imposed on the elements depend on the actual operations performed on the container. Generally, it is required that element type meets the requirements of Erasable, but many member functions impose stricter requirements. This container (but not its members) can be instantiated with an incomplete element type if the allocator satisfies the allocator completeness requirements.
Feature-test macro Value Std Feature __cpp_lib_incomplete_container_elements 201505L (C++17) Minimal incomplete type support (since C++17)
[edit]
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.[edit] [edit] Member types [edit] Member functions constructs the forward_list
(public member function) [edit] destructs the forward_list
(public member function) [edit] assigns values to the container
(public member function) [edit] assigns values to the container
(public member function) [edit] assigns a range of values to the container
(public member function) [edit] returns the associated allocator
(public member function) [edit] Element access access the first element
(public member function) [edit] Iterators returns an iterator to the element before beginning
(public member function) [edit] returns an iterator to the beginning
(public member function) [edit] returns an iterator to the end
(public member function) [edit] Capacity checks whether the container is empty
(public member function) [edit] returns the maximum possible number of elements
(public member function) [edit] Modifiers clears the contents
(public member function) [edit] inserts elements after an element
(public member function) [edit] constructs elements in-place after an element
(public member function) [edit] inserts a range of elements after an element
(public member function) [edit] erases an element after an element
(public member function) [edit] inserts an element to the beginning
(public member function) [edit] constructs an element in-place at the beginning
(public member function) [edit] adds a range of elements to the beginning
(public member function) [edit] removes the first element
(public member function) [edit] changes the number of elements stored
(public member function) [edit] swaps the contents
(public member function) [edit] Operations merges two sorted lists
(public member function) [edit] transfers elements from another forward_list
(public member function) [edit] removes elements satisfying specific criteria
(public member function) [edit] reverses the order of the elements
(public member function) [edit] removes consecutive duplicate elements
(public member function) [edit] sorts the elements
(public member function) [edit] [edit] Non-member functions [edit] Notes [edit] Example [edit] See also
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4