Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/forward list"

From cppreference.com
< cpp‎ | container
m (→‎Deduction guides: restore rev-gadget compatibility, otherwise there is no point in {{rrev}} here.)
m (→‎See also: +)
 
(One intermediate revision by one user not shown)
Line 3: Line 3:
 
{{dcl begin}}
 
{{dcl begin}}
 
{{dcl header|forward_list}}
 
{{dcl header|forward_list}}
−
{{dcl|since=c++11|num=1|
+
{{dcl|since=c++11|num=1|1=
 
template<
 
template<
 
     class T,
 
     class T,
−
     class Allocator {{=}} std::allocator<T>
+
     class Allocator = std::allocator<T>
 
> class forward_list;
 
> class forward_list;
 
}}
 
}}
Line 21: Line 21:
 
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 {{lc|erase_after}}) from the list.
 
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 {{lc|erase_after}}) from the list.
  
−
{{tt|std::forward_list}} meets the requirements of {{named req|Container}} (except for the {{lc|size}} member function and that {{tt|operator{{==}}}}'s complexity is always linear), {{named req|AllocatorAwareContainer}} and {{named req|SequenceContainer}}.
+
{{tt|std::forward_list}} meets the requirements of {{named req|Container}} (except for the {{lc|size}} member function and that {{tt|1=operator==}}'s complexity is always linear), {{named req|AllocatorAwareContainer}} and {{named req|SequenceContainer}}.
  
 
===Template parameters===
 
===Template parameters===
Line 105: Line 105:
 
===Example===
 
===Example===
 
{{example}}
 
{{example}}
 +
 +
===See also===
 +
{{dsc begin}}
 +
{{dsc inc|cpp/container/dsc list}}
 +
{{dsc end}}
  
 
{{langlinks|de|es|fr|it|ja|pl|pt|ru|zh}}
 
{{langlinks|de|es|fr|it|ja|pl|pt|ru|zh}}

Latest revision as of 20:53, 2 August 2024

 
C++
 
Containers library
 
std::forward_list
Member functions
Non-member functions
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides (C++17)
 
Defined in header <forward_list>
template<

    class T,
    class Allocator = std::allocator<T>

> class forward_list;
 (1) (since C++11)
namespace pmr {

    template< class T >
    using forward_list = std::forward_list<T, std::pmr::polymorphic_allocator<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. 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.

Contents

[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

Member type Definition
value_type T[edit]
allocator_type Allocator[edit]
size_type Unsigned integer type (usually std::size_t)[edit]
difference_type Signed integer type (usually std::ptrdiff_t)[edit]
reference value_type&[edit]
const_reference const value_type&[edit]
pointer std::allocator_traits<Allocator>::pointer[edit]
const_pointer std::allocator_traits<Allocator>::const_pointer[edit]
iterator LegacyForwardIterator to value_type[edit]
const_iterator LegacyForwardIterator to const value_type[edit]

[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]
(C++23)
 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]
(C++23)
 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]
(C++23)
 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]
moves 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

(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) [edit]
(C++11)
 specializes the std::swap algorithm
(function template) [edit]
(C++20)
 erases all elements satisfying specific criteria
(function template) [edit]

Deduction guides

 (since C++17)

[edit] Notes

Feature-test macro Value Std Feature
__cpp_lib_containers_ranges 202202L (C++23) Ranges construction and insertion for containers

[edit] Example

This section is incomplete
Reason: no example

[edit] See also

 doubly-linked list
(class template) [edit]
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/forward_list&oldid=174035"