命名空间
变体
操作

标准库头文件 <list>

来自 cppreference.com
< cpp‎ | header
 
 
标准库头文件
语言支持
概念
<concepts> (C++20)
诊断
<system_error> (C++11)

内存管理
<memory_resource> (C++17)  
元编程
<type_traits> (C++11)
<ratio> (C++11)
通用实用程序
<utility>
<tuple> (C++11)
<optional> (C++17)
<variant> (C++17)
<any> (C++17)
<debugging> (C++26)
<expected> (C++23)
<bitset>
<charconv> (C++17)
<format> (C++20)
<bit> (C++20)

字符串
<cuchar> (C++11)

容器
<array> (C++11)
<deque>
<forward_list> (C++11)
<list>
<flat_set> (C++23)
<span> (C++20)
<mdspan> (C++23)
<inplace_vector> (C++26)
迭代器
<iterator>
范围
<ranges> (C++20)
<generator> (C++23)
算法
数值
<cfenv> (C++11)
<complex>
<cmath>
<linalg> (C++26)
<numbers> (C++20)

时间
<chrono> (C++11)
本地化
<codecvt> (C++11/17/26*)
<text_encoding> (C++26)
输入/输出
<filesystem> (C++17)
<cstdio>
<cinttypes> (C++11)
<strstream> (C++98/26*)
正则表达式
<regex> (C++11)
并发支持
<stop_token> (C++20)
<thread> (C++11)
<atomic> (C++11)
<rcu> (C++26)
<stdatomic.h> (C++23)
<mutex> (C++11)
<shared_mutex> (C++14)

<condition_variable> (C++11)  
<semaphore> (C++20)
<latch> (C++20)

<barrier> (C++20)
<future> (C++11)
<hazard_pointer> (C++26)

C 兼容性
<cstdbool> (C++11/17/20*)  
<ccomplex> (C++11/17/20*)
<ctgmath> (C++11/17/20*)

<cstdalign> (C++11/17/20*)

<ciso646> (直到 C++20)

 

此头文件是 容器 库的一部分。

内容

包含

(C++20)
三方比较运算符 支持[edit]
std::initializer_list 类模板[edit]

双向链表
(类模板) [编辑]

函数

(在 C++20 中移除)(在 C++20 中移除)(在 C++20 中移除)(在 C++20 中移除)(在 C++20 中移除)(C++20)
按字典顺序比较两个 list 的值
(函数模板) [编辑]
专门化了 std::swap 算法
(函数模板) [编辑]
擦除所有满足特定条件的元素
(函数模板) [编辑]
范围访问
(C++11)(C++14)
返回指向容器或数组开头的迭代器
(函数模板) [编辑]
(C++11)(C++14)
返回指向容器或数组末尾的迭代器
(函数模板) [编辑]
返回指向容器或数组开头的反向迭代器
(函数模板) [编辑]
(C++14)
返回指向容器或数组末尾的反向迭代器
(函数模板) [编辑]
(C++17)(C++20)
返回容器或数组的大小
(函数模板) [编辑]
(C++17)
检查容器是否为空
(函数模板) [编辑]
(C++17)
获取指向底层数组的指针
(函数模板) [编辑]

[编辑] 概要

#include <compare>
#include <initializer_list>
 
namespace std {
  // class template list
  template<class T, class Allocator = allocator<T>>
  class list;
 
  template<class T, class Allocator>
  bool operator==(const list<T, Allocator>& x, const list<T, Allocator>& y);
  template<class T, class Allocator>
  /*synth-three-way-result*/<T> operator<=>(const list<T, Allocator>& x,
                                            const list<T, Allocator>& y);
 
  template<class T, class Allocator>
  void swap(list<T, Allocator>& x, list<T, Allocator>& y) noexcept(noexcept(x.swap(y)));
 
  // erasure
  template<class T, class Allocator, class U = T>
  typename list<T, Allocator>::size_type erase(list<T, Allocator>& c, const U& value);
  template<class T, class Allocator, class Predicate>
  typename list<T, Allocator>::size_type erase_if(list<T, Allocator>& c, Predicate pred);
 
  namespace pmr {
    template<class T>
    using list = std::list<T, polymorphic_allocator<T>>;
  }
}

[编辑] 类模板 std::list

namespace std {
  template<class T, class Allocator = allocator<T>>
  class list
  {
  public:
    // types
    using value_type             = T;
    using allocator_type         = Allocator;
    using pointer                = typename allocator_traits<Allocator>::pointer;
    using const_pointer          = typename allocator_traits<Allocator>::const_pointer;
    using reference              = value_type&;
    using const_reference        = const value_type&;
    using size_type              = /* implementation-defined */;
    using difference_type        = /* implementation-defined */;
    using iterator               = /* implementation-defined */;
    using const_iterator         = /* implementation-defined */;
    using reverse_iterator       = std::reverse_iterator<iterator>;
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
 
    // construct/copy/destroy
    list()
      : list(Allocator())
    {
    }
    explicit list(const Allocator&);
    explicit list(size_type n, const Allocator& = Allocator());
    list(size_type n, const T& value, const Allocator& = Allocator());
    template<class InputIter>
    list(InputIter first, InputIter last, const Allocator& = Allocator());
    template<container-compatible-range<T> R>
    list(from_range_t, R&& rg, const Allocator& = Allocator());
    list(const list& x);
    list(list&& x);
    list(const list&, const type_identity_t<Allocator>&);
    list(list&&, const type_identity_t<Allocator>&);
    list(initializer_list<T>, const Allocator& = Allocator());
    ~list();
    list& operator=(const list& x);
    list& operator=(list&& x) noexcept(
      allocator_traits<Allocator>::is_always_equal::value);
    list& operator=(initializer_list<T>);
    template<class InputIter>
    void assign(InputIter first, InputIter last);
    template<container-compatible-range<T> R>
    void assign_range(R&& rg);
    void assign(size_type n, const T& t);
    void assign(initializer_list<T>);
    allocator_type get_allocator() const noexcept;
 
    // iterators
    iterator begin() noexcept;
    const_iterator begin() const noexcept;
    iterator end() noexcept;
    const_iterator end() const noexcept;
    reverse_iterator rbegin() noexcept;
    const_reverse_iterator rbegin() const noexcept;
    reverse_iterator rend() noexcept;
    const_reverse_iterator rend() const noexcept;
 
    const_iterator cbegin() const noexcept;
    const_iterator cend() const noexcept;
    const_reverse_iterator crbegin() const noexcept;
    const_reverse_iterator crend() const noexcept;
 
    // capacity
    bool empty() const noexcept;
    size_type size() const noexcept;
    size_type max_size() const noexcept;
    void resize(size_type sz);
    void resize(size_type sz, const T& c);
 
    // element access
    reference front();
    const_reference front() const;
    reference back();
    const_reference back() const;
 
    // modifiers
    template<class... Args>
    reference emplace_front(Args&&... args);
    template<class... Args>
    reference emplace_back(Args&&... args);
    void push_front(const T& x);
    void push_front(T&& x);
    template<container-compatible-range<T> R>
    void prepend_range(R&& rg);
    void pop_front();
    void push_back(const T& x);
    void push_back(T&& x);
    template<container-compatible-range<T> R>
    void append_range(R&& rg);
    void pop_back();
 
    template<class... Args>
    iterator emplace(const_iterator position, Args&&... args);
    iterator insert(const_iterator position, const T& x);
    iterator insert(const_iterator position, T&& x);
    iterator insert(const_iterator position, size_type n, const T& x);
    template<class InputIter>
    iterator insert(const_iterator position, InputIter first, InputIter last);
    template<container-compatible-range<T> R>
    iterator insert_range(const_iterator position, R&& rg);
    iterator insert(const_iterator position, initializer_list<T> il);
 
    iterator erase(const_iterator position);
    iterator erase(const_iterator position, const_iterator last);
    void swap(list&) noexcept(allocator_traits<Allocator>::is_always_equal::value);
    void clear() noexcept;
 
    // list operations
    void splice(const_iterator position, list& x);
    void splice(const_iterator position, list&& x);
    void splice(const_iterator position, list& x, const_iterator i);
    void splice(const_iterator position, list&& x, const_iterator i);
    void splice(const_iterator position,
                list& x,
                const_iterator first,
                const_iterator last);
    void splice(const_iterator position,
                list&& x,
                const_iterator first,
                const_iterator last);
 
    size_type remove(const T& value);
    template<class Predicate>
    size_type remove_if(Predicate pred);
 
    size_type unique();
    template<class BinaryPredicate>
    size_type unique(BinaryPredicate binary_pred);
 
    void merge(list& x);
    void merge(list&& x);
    template<class Compare>
    void merge(list& x, Compare comp);
    template<class Compare>
    void merge(list&& x, Compare comp);
 
    void sort();
    template<class Compare>
    void sort(Compare comp);
 
    void reverse() noexcept;
  };
 
  template<class InputIter, class Allocator = allocator</*iter-value-type*/<InputIter>>>
  list(InputIter, InputIter, Allocator = Allocator())
    -> list</*iter-value-type*/<InputIter>, Allocator>;
 
  template<ranges::input_range R, class Allocator = allocator<ranges::range_value_t<R>>>
  list(from_range_t, R&&, Allocator = Allocator())
    -> list<ranges::range_value_t<R>, Allocator>;
}