.TH "std::__debug::deque< _Tp, _Allocator >" 3cxx "libstdc++" \" -*- nroff -*- .ad l .nh .SH NAME std::__debug::deque< _Tp, _Allocator > \- Class std::deque with safety/checking/debug instrumentation\&. .SH SYNOPSIS .br .PP .PP \fC#include \fP .PP Inherits \fB__gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >\fP, and deque< _Tp, std::allocator< _Tp > >\&. .SS "Public Types" .in +1c .ti -1c .RI "\fBtypedef\fP \fB_Allocator\fP \fBallocator_type\fP" .br .ti -1c .RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_const_iterator\fP, \fBdeque\fP > \fBconst_iterator\fP" .br .ti -1c .RI "\fBtypedef\fP _Base::const_pointer \fBconst_pointer\fP" .br .ti -1c .RI "\fBtypedef\fP _Base::const_reference \fBconst_reference\fP" .br .ti -1c .RI "\fBtypedef\fP \fBstd::reverse_iterator\fP< \fBconst_iterator\fP > \fBconst_reverse_iterator\fP" .br .ti -1c .RI "\fBtypedef\fP _Base::difference_type \fBdifference_type\fP" .br .ti -1c .RI "\fBtypedef\fP \fB__gnu_debug::_Safe_iterator\fP< \fB_Base_iterator\fP, \fBdeque\fP > \fBiterator\fP" .br .ti -1c .RI "\fBtypedef\fP _Base::pointer \fBpointer\fP" .br .ti -1c .RI "\fBtypedef\fP _Base::reference \fBreference\fP" .br .ti -1c .RI "\fBtypedef\fP \fBstd::reverse_iterator\fP< \fBiterator\fP > \fBreverse_iterator\fP" .br .ti -1c .RI "\fBtypedef\fP _Base::size_type \fBsize_type\fP" .br .ti -1c .RI "\fBtypedef\fP _Tp \fBvalue_type\fP" .br .in -1c .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBdeque\fP (_Base_ref __x)" .br .ti -1c .RI "template<\fBclass\fP \fB_InputIterator\fP , \fBtypename\fP = std::_RequireInputIter<_InputIterator>> \fBdeque\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last, \fBconst\fP \fB_Allocator\fP &__a=\fB_Allocator\fP())" .br .ti -1c .RI "\fBdeque\fP (\fBconst\fP \fB_Allocator\fP &__a)" .br .ti -1c .RI "\fBdeque\fP (\fBconst\fP \fBdeque\fP &)=\fBdefault\fP" .br .ti -1c .RI "\fBdeque\fP (\fBconst\fP \fBdeque\fP &__d, \fBconst\fP \fB_Allocator\fP &__a)" .br .ti -1c .RI "\fBdeque\fP (\fBdeque\fP &&)=\fBdefault\fP" .br .ti -1c .RI "\fBdeque\fP (\fBdeque\fP &&__d, \fBconst\fP \fB_Allocator\fP &__a)" .br .ti -1c .RI "\fBdeque\fP (\fBinitializer_list\fP< value_type > \fB__l\fP, \fBconst\fP \fBallocator_type\fP &__a=\fBallocator_type\fP())" .br .ti -1c .RI "\fBdeque\fP (size_type __n, \fBconst\fP \fB__type_identity_t\fP< _Tp > &__value, \fBconst\fP \fB_Allocator\fP &__a=\fB_Allocator\fP())" .br .ti -1c .RI "\fBdeque\fP (size_type __n, \fBconst\fP \fB_Allocator\fP &__a=\fB_Allocator\fP())" .br .ti -1c .RI "\fBconst\fP \fB_Base\fP & \fB_M_base\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fB_Base\fP & \fB_M_base\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fB_M_swap\fP (_Safe_container &__x) \fBnoexcept\fP" .br .ti -1c .RI "template<\fBclass\fP \fB_InputIterator\fP , \fBtypename\fP = std::_RequireInputIter<_InputIterator>> \fBvoid\fP \fBassign\fP (\fB_InputIterator\fP __first, \fB_InputIterator\fP __last)" .br .ti -1c .RI "\fBvoid\fP \fBassign\fP (\fBinitializer_list\fP< value_type > \fB__l\fP)" .br .ti -1c .RI "\fBvoid\fP \fBassign\fP (size_type __n, \fBconst\fP _Tp &__t)" .br .ti -1c .RI "const_reference \fBback\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "reference \fBback\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBconst_iterator\fP \fBbegin\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBiterator\fP \fBbegin\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBconst_iterator\fP \fBcbegin\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBconst_iterator\fP \fBcend\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fBclear\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBconst_reverse_iterator\fP \fBcrbegin\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBconst_reverse_iterator\fP \fBcrend\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "template \fBiterator\fP \fBemplace\fP (\fBconst_iterator\fP \fB__position\fP, \fB_Args\fP &&\&.\&.\&. \fB__args\fP)" .br .ti -1c .RI "template reference \fBemplace_back\fP (\fB_Args\fP &&\&.\&.\&. \fB__args\fP)" .br .ti -1c .RI "template reference \fBemplace_front\fP (\fB_Args\fP &&\&.\&.\&. \fB__args\fP)" .br .ti -1c .RI "\fBconst_iterator\fP \fBend\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBiterator\fP \fBend\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP __first, \fBconst_iterator\fP __last)" .br .ti -1c .RI "\fBiterator\fP \fBerase\fP (\fBconst_iterator\fP \fB__position\fP)" .br .ti -1c .RI "const_reference \fBfront\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "reference \fBfront\fP () \fBnoexcept\fP" .br .ti -1c .RI "template<\fBclass\fP \fB_InputIterator\fP , \fBtypename\fP = std::_RequireInputIter<_InputIterator>> \fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, \fB_InputIterator\fP __first, \fB_InputIterator\fP __last)" .br .ti -1c .RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, _Tp &&__x)" .br .ti -1c .RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, \fBconst\fP _Tp &__x)" .br .ti -1c .RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, \fBinitializer_list\fP< value_type > \fB__l\fP)" .br .ti -1c .RI "\fBiterator\fP \fBinsert\fP (\fBconst_iterator\fP \fB__position\fP, size_type __n, \fBconst\fP _Tp &__x)" .br .ti -1c .RI "\fBdeque\fP & \fBoperator=\fP (\fBconst\fP \fBdeque\fP &)=\fBdefault\fP" .br .ti -1c .RI "\fBdeque\fP & \fBoperator=\fP (\fBdeque\fP &&)=\fBdefault\fP" .br .ti -1c .RI "\fBdeque\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > \fB__l\fP)" .br .ti -1c .RI "const_reference \fBoperator[]\fP (size_type __n) \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "reference \fBoperator[]\fP (size_type __n) \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fBpop_back\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fBpop_front\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fBpush_back\fP (_Tp &&__x)" .br .ti -1c .RI "\fBvoid\fP \fBpush_back\fP (\fBconst\fP _Tp &__x)" .br .ti -1c .RI "\fBvoid\fP \fBpush_front\fP (_Tp &&__x)" .br .ti -1c .RI "\fBvoid\fP \fBpush_front\fP (\fBconst\fP _Tp &__x)" .br .ti -1c .RI "\fBconst_reverse_iterator\fP \fBrbegin\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBreverse_iterator\fP \fBrbegin\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBconst_reverse_iterator\fP \fBrend\fP () \fBconst\fP \fBnoexcept\fP" .br .ti -1c .RI "\fBreverse_iterator\fP \fBrend\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fBresize\fP (size_type \fB__sz\fP)" .br .ti -1c .RI "\fBvoid\fP \fBresize\fP (size_type \fB__sz\fP, \fBconst\fP _Tp &__c)" .br .ti -1c .RI "\fBvoid\fP \fBshrink_to_fit\fP () \fBnoexcept\fP" .br .ti -1c .RI "\fBvoid\fP \fBswap\fP (\fBdeque\fP &__x) \fBnoexcept\fP(/*\fBconditional\fP */)" .br .in -1c .SS "Protected Member Functions" .in +1c .ti -1c .RI "_Safe_container & \fB_M_safe\fP () \fBnoexcept\fP" .br .in -1c .SS "Friends" .in +1c .ti -1c .RI "template<\fBtypename\fP \fB_ItT\fP , \fBtypename\fP \fB_SeqT\fP , \fBtypename\fP \fB_CatT\fP > \fBclass\fP \fB::__gnu_debug::_Safe_iterator\fP" .br .in -1c .SH "Detailed Description" .PP .SS "template<\fBtypename\fP _Tp, \fBtypename\fP \fB_Allocator\fP = std::allocator<_Tp>> .br class std::__debug::deque< _Tp, _Allocator >"Class std::deque with safety/checking/debug instrumentation\&. .SH "Author" .PP Generated automatically by Doxygen for libstdc++ from the source code\&.