#include <deque.h>
◆ deque() [1/4]
◆ deque() [2/4]
◆ deque() [3/4]
◆ deque() [4/4]
列表初始化函数
接受一个大括号列表
- Parameters
-
◆ ~deque()
◆ at() [1/2]
◆ at() [2/2]
template<typename T >
const T& my::deque< T >::at |
( |
size_type |
pos | ) |
const |
|
inline |
◆ back() [1/2]
◆ back() [2/2]
◆ begin() [1/2]
◆ begin() [2/2]
◆ empty()
◆ end() [1/2]
◆ end() [2/2]
◆ front() [1/2]
◆ front() [2/2]
◆ max_size()
返回队列最大长度
[[nodiscard]]指让编译器提醒用户不要忽略函数返回值
- Returns
- 队列最大长度:size_type
◆ operator=() [1/3]
◆ operator=() [2/3]
◆ operator=() [3/3]
列表初始化函数
接受一个大括号列表
- Parameters
-
◆ operator[]() [1/2]
template<typename T >
const T& my::deque< T >::operator[] |
( |
size_type |
pos | ) |
const |
|
inlinenoexcept |
◆ operator[]() [2/2]
template<typename T >
T& my::deque< T >::operator[] |
( |
size_type |
pos | ) |
|
|
inlinenoexcept |
◆ pop_back()
◆ pop_front()
◆ push_back() [1/2]
template<typename T >
void my::deque< T >::push_back |
( |
const T & |
x | ) |
|
|
inline |
◆ push_back() [2/2]
◆ push_front() [1/2]
template<typename T >
void my::deque< T >::push_front |
( |
const T & |
x | ) |
|
|
inline |
◆ push_front() [2/2]
◆ size()
返回当前队列长度
- Returns
- 队列长度:size_type
The documentation for this class was generated from the following file:
- D:/source/data_structure/deque/deque.h