标准库标头 <deque>

 

C++

编译器支持

自立实现与有宿主实现

语言

标准库

标准库标头

具名要求

功能特性测试宏(C++20)

语言支持库

概念库(C++20)

诊断库

内存管理库

元编程库(C++11)

通用工具库

容器库

迭代器库

范围库(C++20)

算法库

字符串库

文本处理库

数值库

日期和时间库

输入/输出库

文件系统库(C++17)

并发支持库(C++11)

执行控制库(C++26)

技术规范

符号索引

外部库

 

标准库头

语言支持 <cfloat> <climits> <compare>(C++20) <contracts>(C++26) <coroutine>(C++20) <csetjmp> <csignal> <cstdarg> <cstddef> <cstdint>(C++11) <cstdlib> <exception> <initializer_list>(C++11)    <limits> <new> <source_location>(C++20) <stdfloat>(C++23) <typeinfo> <version>(C++20) 概念 <concepts>(C++20) 诊断 <cassert> <cerrno> <debugging>(C++26) <stacktrace>(C++23) <stdexcept> <system_error>(C++11) 内存管理 <memory> <memory_resource>(C++17) <scoped_allocator>(C++11) 元编程 <type_traits>(C++11) <ratio>(C++11)

通用工具 <any>(C++17) <bitset> <bit>(C++20) <charconv>(C++17) <expected>(C++23) <format>(C++20) <functional> <optional>(C++17) <stdbit.h>(C++26) <tuple>(C++11) <typeindex>(C++11) <utility> <variant>(C++17) 容器 <array>(C++11) <deque> <flat_map>(C++23) <flat_set>(C++23) <forward_list>(C++11) <hive>(C++26) <inplace_vector>(C++26)    <list> <map> <mdspan>(C++23) <queue> <set> <span>(C++20) <stack> <unordered_map>(C++11) <unordered_set>(C++11) <vector> 迭代器 <iterator> 范围 <generator>(C++23) <ranges>(C++20)

算法 <algorithm> <numeric> 字符串 <cctype> <cstring> <cuchar>(C++11) <cwchar> <cwctype> <string_view>(C++17) <string> 文本处理 <clocale> <codecvt>(C++11/17/26*) <locale> <regex>(C++11) <text_encoding>(C++26)    cpp/header#数值库数值 <cfenv>(C++11) <cmath> <complex> <linalg>(C++26) <numbers>(C++20) <random>(C++11) <simd>(C++26) <stdckdint.h>(C++26) <valarray> 时间 <chrono>(C++11) <ctime> C 兼容性 <ccomplex>(C++11/17/20*) <ciso646>(C++20 前) <cstdalign>(C++11/17/20*) <cstdbool>(C++11/17/20*) <ctgmath>(C++11/17/20*)

输入/输出 <cinttypes>(C++11) <cstdio> <filesystem>(C++17) <fstream> <iomanip> <iosfwd> <iostream> <ios> <istream> <ostream> <print>(C++23) <spanstream>(C++23) <sstream> <streambuf> <strstream>(C++98/26*) <syncstream>(C++20) 并发支持 <atomic>(C++11) <barrier>(C++20) <condition_variable>(C++11) <future>(C++11) <hazard_pointer>(C++26) <latch>(C++20) <mutex>(C++11) <rcu>(C++26) <semaphore>(C++20) <shared_mutex>(C++14) <stdatomic.h>(C++23) <stop_token>(C++20) <thread>(C++11) 执行支持 <execution>(C++17)

 

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

包含
<compare> (C++20)	三路比较运算符支持
<initializer_list> (C++11)	std::initializer_list 类模板
类
deque	双端队列 (类模板)
函数
operator==operator!=operator<operator<=operator>operator>=operator<=> (C++20 移除)(C++20 移除)(C++20 移除)(C++20 移除)(C++20 移除)(C++20)	按照字典顺序比较两个 deque 的值 (函数模板)
std::swap(std::deque)	特化 std::swap 算法 (函数模板)
erase(std::deque)erase_if(std::deque) (C++20)	擦除所有满足特定判别标准的元素 (函数模板)
范围访问
begincbegin (C++11)(C++14)	返回指向容器或数组起始的迭代器 (函数模板)
endcend (C++11)(C++14)	返回指向容器或数组结尾的迭代器 (函数模板)
rbegincrbegin (C++14)	返回指向一个容器或数组的逆向迭代器 (函数模板)
rendcrend (C++14)	返回容器或数组的逆向尾迭代器 (函数模板)
sizessize (C++17)(C++20)	返回容器或数组的大小 (函数模板)
empty (C++17)	检查容器是否为空 (函数模板)
data (C++17)	获得指向底层数组的指针 (函数模板)

概要

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

类模板 std::deque

namespace std {template<class T, class Allocator = allocator<T>>class deque {public:// 类型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 =/* 由实现定义 */;using difference_type =/* 由实现定义 */;using iterator =/* 由实现定义 */;using const_iterator =/* 由实现定义 */;using reverse_iterator =std::reverse_iterator<iterator>;using const_reverse_iterator =std::reverse_iterator<const_iterator>;   // 构造/复制/销毁 deque(): deque(Allocator()){}explicit deque(const Allocator&);explicit deque(size_type n, const Allocator&= Allocator()); deque(size_type n, const T& value, const Allocator&= Allocator());template<class InputIter> deque(InputIter first, InputIter last, const Allocator&= Allocator());template<container-compatible-range<T> R> deque(from_range_t, R&& rg, const Allocator&= Allocator()); deque(const deque& x); deque(deque&&); deque(const deque&, const type_identity_t<Allocator>&); deque(deque&&, const type_identity_t<Allocator>&); deque(initializer_list<T>, const Allocator&= Allocator());   ~deque(); deque& operator=(const deque& x); deque& operator=(deque&& x)noexcept( allocator_traits<Allocator>::is_always_equal::value); deque& 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()constnoexcept;   // 迭代器 iterator begin()noexcept; const_iterator begin()constnoexcept; iterator end()noexcept; const_iterator end()constnoexcept; reverse_iterator rbegin()noexcept; const_reverse_iterator rbegin()constnoexcept; reverse_iterator rend()noexcept; const_reverse_iterator rend()constnoexcept;   const_iterator cbegin()constnoexcept; const_iterator cend()constnoexcept; const_reverse_iterator crbegin()constnoexcept; const_reverse_iterator crend()constnoexcept;   // 容量bool empty()constnoexcept; size_type size()constnoexcept; size_type max_size()constnoexcept;void resize(size_type sz);void resize(size_type sz, const T& c);void shrink_to_fit();   // 元素访问 reference operator[](size_type n); const_reference operator[](size_type n)const; reference at(size_type n); const_reference at(size_type n)const; reference front(); const_reference front()const; reference back(); const_reference back()const;   // 修改器template<class... Args> reference emplace_front(Args&&... args);template<class... Args> reference emplace_back(Args&&... args);template<class... Args> iterator emplace(const_iterator position, 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 push_back(const T& x);void push_back(T&& x);template<container-compatible-range<T> R>void append_range(R&& rg);   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>);   void pop_front();void pop_back();   iterator erase(const_iterator position); iterator erase(const_iterator first, const_iterator last);void swap(deque&)noexcept(allocator_traits<Allocator>::is_always_equal::value);void clear()noexcept;};   template<class InputIter, class Allocator = allocator</*iter-value-type*/<InputIter>>> deque(InputIter, InputIter, Allocator = Allocator())-> deque</*iter-value-type*/<InputIter>, Allocator>;   template<ranges::input_range R, class Allocator = allocator<ranges::range_value_t<R>>> deque(from_range_t, R&&, Allocator = Allocator())-> deque<ranges::range_value_t<R>, Allocator>;}