|
| deque (const deque &)=default |
|
| deque (deque &&)=default |
|
| deque (const deque &__d, const _Allocator &__a) |
|
| deque (deque &&__d, const _Allocator &__a) |
|
| deque (initializer_list< value_type > __l, const allocator_type &__a=allocator_type()) |
|
| deque (const _Allocator &__a) |
|
| deque (size_type __n, const _Allocator &__a=_Allocator()) |
|
| deque (size_type __n, const _Tp &__value, const _Allocator &__a=_Allocator()) |
|
template<class _InputIterator , typename = std::_RequireInputIter<_InputIterator>> |
| deque (_InputIterator __first, _InputIterator __last, const _Allocator &__a=_Allocator()) |
|
| deque (const _Base &__x) |
|
_Base & | _M_base () noexcept |
|
const _Base & | _M_base () const noexcept |
|
void | _M_invalidate_if (_Predicate __pred) |
|
void | _M_swap (_Safe_container &__x) noexcept |
|
void | _M_transfer_from_if (_Safe_sequence &__from, _Predicate __pred) |
|
template<class _InputIterator , typename = std::_RequireInputIter<_InputIterator>> |
void | assign (_InputIterator __first, _InputIterator __last) |
|
void | assign (size_type __n, const _Tp &__t) |
|
void | assign (initializer_list< value_type > __l) |
|
reference | back () noexcept |
|
const_reference | back () const noexcept |
|
iterator | begin () noexcept |
|
const_iterator | begin () const noexcept |
|
const_iterator | cbegin () const noexcept |
|
const_iterator | cend () const noexcept |
|
void | clear () noexcept |
|
const_reverse_iterator | crbegin () const noexcept |
|
const_reverse_iterator | crend () const noexcept |
|
template<typename... _Args> |
iterator | emplace (const_iterator __position, _Args &&... __args) |
|
template<typename... _Args> |
void | emplace_back (_Args &&... __args) |
|
template<typename... _Args> |
void | emplace_front (_Args &&... __args) |
|
iterator | end () noexcept |
|
const_iterator | end () const noexcept |
|
iterator | erase (const_iterator __position) |
|
iterator | erase (const_iterator __first, const_iterator __last) |
|
reference | front () noexcept |
|
const_reference | front () const noexcept |
|
iterator | insert (const_iterator __position, const _Tp &__x) |
|
iterator | insert (const_iterator __position, _Tp &&__x) |
|
iterator | insert (const_iterator __position, initializer_list< value_type > __l) |
|
iterator | insert (const_iterator __position, size_type __n, const _Tp &__x) |
|
template<class _InputIterator , typename = std::_RequireInputIter<_InputIterator>> |
iterator | insert (const_iterator __position, _InputIterator __first, _InputIterator __last) |
|
deque & | operator= (const deque &)=default |
|
deque & | operator= (deque &&)=default |
|
deque & | operator= (initializer_list< value_type > __l) |
|
reference | operator[] (size_type __n) noexcept |
|
const_reference | operator[] (size_type __n) const noexcept |
|
void | pop_back () noexcept |
|
void | pop_front () noexcept |
|
void | push_back (const _Tp &__x) |
|
void | push_back (_Tp &&__x) |
|
void | push_front (const _Tp &__x) |
|
void | push_front (_Tp &&__x) |
|
reverse_iterator | rbegin () noexcept |
|
const_reverse_iterator | rbegin () const noexcept |
|
reverse_iterator | rend () noexcept |
|
const_reverse_iterator | rend () const noexcept |
|
void | resize (size_type __sz) |
|
void | resize (size_type __sz, const _Tp &__c) |
|
void | shrink_to_fit () noexcept |
|
void | swap (deque &__x) noexcept(/*conditional */) |
|
template<typename _Tp, typename _Allocator = std::allocator<_Tp>>
class std::__debug::deque< _Tp, _Allocator >
Class std::deque with safety/checking/debug instrumentation.
Definition at line 45 of file debug/deque.