|
else return | std::_M_insert_aux (__position._M_const_cast(), __x) |
|
template<typename _Tp > |
_Deque_iterator< _Tp, _Tp
&, _Tp * > | std::copy (_Deque_iterator< _Tp, const _Tp &, const _Tp * > __first, _Deque_iterator< _Tp, const _Tp &, const _Tp * > __last, _Deque_iterator< _Tp, _Tp &, _Tp * > __result) |
|
template<typename _Tp > |
_Deque_iterator< _Tp, _Tp
&, _Tp * > | std::copy_backward (_Deque_iterator< _Tp, const _Tp &, const _Tp * > __first, _Deque_iterator< _Tp, const _Tp &, const _Tp * > __last, _Deque_iterator< _Tp, _Tp &, _Tp * > __result) |
|
template<typename _Tp , typename _Alloc > |
deque< _Tp, _Alloc >::iterator | std::deque< _Tp, _Alloc >if (__position._M_cur==this->_M_impl._M_start._M_cur) |
|
template<typename... _Args> |
void | std::deque< _Tp, _Alloc >if (size()==max_size()) __throw_length_error(__N("cannot create std |
|
else | std::if (__position._M_cur==this->_M_impl._M_finish._M_cur) |
|
template<typename _Tp > |
_Deque_iterator< _Tp, _Tp
&, _Tp * > | std::move (_Deque_iterator< _Tp, const _Tp &, const _Tp * > __first, _Deque_iterator< _Tp, const _Tp &, const _Tp * > __last, _Deque_iterator< _Tp, _Tp &, _Tp * > __result) |
|
template<typename _Tp > |
_Deque_iterator< _Tp, _Tp
&, _Tp * > | std::move_backward (_Deque_iterator< _Tp, const _Tp &, const _Tp * > __first, _Deque_iterator< _Tp, const _Tp &, const _Tp * > __last, _Deque_iterator< _Tp, _Tp &, _Tp * > __result) |
|
This is an internal header file, included by other library headers. Do not attempt to use it directly. Instead, include <deque>.
Definition in file deque.tcc.