From cppreference.com
Defined in header
template<classT,classAllocator=std::allocator<T>>classlist; (1) namespacepmr{template<classT>usinglist=std::list<T,std::pmr::polymorphic_allocator<T>>;} (2) (since C++17)std::list is a container that supports constant time insertion and removal of elements from anywhere in the container. Fast random access is not supported. It is usually implemented as a doubly-linked list. Compared to
this container provides bidirectional iteration capability while being less space efficient.
Adding, removing and moving the elements within the list or across several lists does not invalidate the iterators or references. An iterator is invalidated only when the corresponding element is deleted.
std::list meets the requirements of
,
,
and
.
All member functions of std::list are constexpr: it is possible to create and use std::list objects in the evaluation of a constant expression.
However, defining a constexprstd::list variable is generally an error, because constant evaluation requires any dynamically allocated storage to be released in the same evaluation, which is usually not the case with std::list's initializer.
(since C++26)Template parameters
T - The type of the elements. T must meet the requirements of
. T must meet the requirements of
if
or
is instantiated with T.(until C++11)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
, but many member functions impose stricter requirements.(since C++11)
(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
, but many member functions impose stricter requirements. This container (but not its members) can be instantiated with an
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
. 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 functions
constructs the list
(public member function)
destructs the list
(public member function)
assigns values to the container
(public member function)
assigns values to the container
(public member function)
(C++23)
assigns a range of values to the container
(public member function)
returns the associated allocator
(public member function)
Element access
access the first element
(public member function)
access the last element
(public member function)
Iterators
(C++11)
returns an iterator to the beginning
(public member function)
(C++11)
returns an iterator to the end
(public member function)
(C++11)
returns a reverse iterator to the beginning
(public member function)
(C++11)
returns a reverse iterator to the end
(public member function)
Capacity
checks whether the container is empty
(public member function)
returns the number of elements
(public member function)
returns the maximum possible number of elements
(public member function)
Modifiers
clears the contents
(public member function)
inserts elements
(public member function)
(C++23)
inserts a range of elements
(public member function)
(C++11)
constructs element in-place
(public member function)
erases elements
(public member function)
adds an element to the end
(public member function)
(C++11)
constructs an element in-place at the end
(public member function)
(C++23)
adds a range of elements to the end
(public member function)
removes the last element
(public member function)
inserts an element to the beginning
(public member function)
(C++11)
constructs an element in-place at the beginning
(public member function)
(C++23)
adds a range of elements to 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 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
Notes
macro ValueStdFeature
__cpp_lib_incomplete_container_elements
(C++17)Minimal incomplete type support
(C++23)Ranges construction and insertion for containers
(C++26)Constexpr std::listExample
Run this code
#include<algorithm>#include<iostream>#include<list>intmain(){// Create a list containing integersstd::list<int>l={7,5,16,8};// Add an integer to the front of the listl.push_front(25);// Add an integer to the back of the listl.push_back(13);// Insert an integer before 16 by searchingautoit=std::find(l.begin(),l.end(),16);if(it!=l.end())l.insert(it,42);// Print out the liststd::cout<<"l = { ";for(intn:l)std::cout<<n<<", ";std::cout<<"};\n";}Output:
l = { 25, 7, 5, 42, 16, 8, 13, }; Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR Applied to Behavior as published Correct behavior
C++98 T was not required to be
(an element of type T might not be able to be constructed) T is also required to
be
C++98 T was always required to be
only required if
or
is instantiated with TSee also