|
| queue () |
|
| queue (const _Myt &_Right) |
|
| queue (const _Container &_Cont) |
|
_Myt & | operator= (const _Myt &_Right) |
|
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type> |
| queue (const _Alloc &_Al) |
|
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type> |
| queue (const _Container &_Cont, const _Alloc &_Al) |
|
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type> |
| queue (const _Myt &_Right, const _Alloc &_Al) |
|
| queue (_Myt &&_Right) _NOEXCEPT_OP(is_nothrow_move_constructible< _Container > |
|
| queue (_Container &&_Cont) |
|
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type> |
| queue (_Container &&_Cont, const _Alloc &_Al) |
|
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type> |
| queue (_Myt &&_Right, const _Alloc &_Al) |
|
_Myt & | operator= (_Myt &&_Right) _NOEXCEPT_OP(is_nothrow_move_assignable< _Container > |
|
void | push (value_type &&_Val) |
|
template<class... _Valty> |
void | emplace (_Valty &&..._Val) |
|
bool | empty () const |
|
size_type | size () const |
|
reference | front () |
|
const_reference | front () const |
|
reference | back () |
|
const_reference | back () const |
|
void | push (const value_type &_Val) |
|
void | pop () |
|
const _Container & | _Get_container () const |
|
void | swap (_Myt &_Right) _NOEXCEPT_OP(_NOEXCEPT_OP(_Swap_adl(c |
|
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
const _Ty & _Right
Definition: algorithm:4087
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
queue< _Ty, _Container >::queue |
( |
const _Container & |
_Cont | ) |
|
|
inlineexplicit |
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type>
queue< _Ty, _Container >::queue |
( |
const _Alloc & |
_Al | ) |
|
|
inlineexplicit |
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type>
queue< _Ty, _Container >::queue |
( |
const _Container & |
_Cont, |
|
|
const _Alloc & |
_Al |
|
) |
| |
|
inline |
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type>
queue< _Ty, _Container >::queue |
( |
const _Myt & |
_Right, |
|
|
const _Alloc & |
_Al |
|
) |
| |
|
inline |
const _Ty & _Right
Definition: algorithm:4087
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
const _Ty & _Right
Definition: algorithm:4087
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
queue< _Ty, _Container >::queue |
( |
_Container && |
_Cont | ) |
|
|
inlineexplicit |
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type>
queue< _Ty, _Container >::queue |
( |
_Container && |
_Cont, |
|
|
const _Alloc & |
_Al |
|
) |
| |
|
inline |
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class _Alloc , class = typename enable_if<uses_allocator<_Container, _Alloc>::value, void>::type>
queue< _Ty, _Container >::queue |
( |
_Myt && |
_Right, |
|
|
const _Alloc & |
_Al |
|
) |
| |
|
inline |
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
const _Ty & _Right
Definition: algorithm:4087
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
const _Container& queue< _Ty, _Container >::_Get_container |
( |
| ) |
const |
|
inline |
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class... _Valty>
void queue< _Ty, _Container >::emplace |
( |
_Valty &&... |
_Val | ) |
|
|
inline |
116 c.emplace_back(
_STD forward<_Valty>(
_Val)...);
_FwdIt const _Ty _Val
Definition: algorithm:1938
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
bool queue< _Ty, _Container >::empty |
( |
| ) |
const |
|
inline |
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
const _Ty & _Right
Definition: algorithm:4087
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
const _Ty & _Right
Definition: algorithm:4087
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
_OutIt move(_InIt _First, _InIt _Last, _OutIt _Dest)
Definition: xutility:2447
_FwdIt const _Ty _Val
Definition: algorithm:1938
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
_FwdIt const _Ty _Val
Definition: algorithm:1938
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
void _Right c
Definition: queue:167
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
template<class _Ty, class _Container = deque<_Ty>>
_Container queue< _Ty, _Container >::c |
|
protected |
The documentation for this class was generated from the following file: