deque
deque (). .
template <class , class Allocator = allocator<T>> class deque
- , . deque .
explicit deque(const Allocator &a = Allocator()); explicit deque(size_type num, const &val = (), const Allocator &a = Allocator()); deque(const deque<T, Allocator> &ob); template <class InIter> deque(InIter start, InIter end, const Allocator &a = Allocator());
. , val. , , ob. , , start end.
deque : ==, <, < = , !=, > >=.
deque -.
- |
|
template <class InIter> void assign(InIter start, InIter end); |
, start end |
void assign(size_type num, const &val); |
num val |
reference at(size_type i); const_reference at(size_type i) const; |
, i |
reference back(); const_reference back() const; |
|
iterator begin(); const_iterator begin() const; |
|
void clear(); |
|
bool empty() const; |
, , |
const_iterator end() const; iterator end(); |
|
iterator erase(iterator i);
|
, i; , |
iterator erase(iterator start, iterator end); |
, start end; , |
reference front(); const_reference front() const, |
|
allocator_type get_allocator() const; |
|
iterator insert(iterator i, const &val = ()); |
val , i; |
void insert(iterator i, size_type num, const &val); |
num val , i |
template <class InIter> void insert(iterator i, InIter start, Inlter end); |
, start end, , i |
size_type max_size() const; |
, |
reference operator[](size_type i) const; const_reference operator[](size_type i) const; |
i- |
void pop_back(); |
|
void pop_front(); |
|
void push_back(const &val); |
, val, |
void push_front(const &val); |
, val, |
reverse_iterator rbegin(); const_reverse_iterator rbegin() const; |
|
reverse_iterator rend(); const_reverse_iterator rend() const; |
|
void resize(size_type num, val = T()); |
, num. , , val |
size_type size() const; |
|
void swap(deque<T, Allocator> &ob); |
ob |
|