std::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)

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.

(since C++17)

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 if Allocator::value_type is not the same as T.

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

ForwardIterator

const_iterator

Constant forward iterator

(destructor)

destructs the forward_list (public member function)

operator=

assigns values to the container (public member function)

assign

assigns values to the container (public member function)

get_allocator

returns the associated allocator (public member function)

std::swap(std::forward_list) (C++11)

specializes the std::swap algorithm (function template)