std::_deque_iterator(3) [centos man page]
std::_Deque_iterator< _Tp, _Ref, _Ptr >(3) Library Functions Manual std::_Deque_iterator< _Tp, _Ref, _Ptr >(3) NAME
std::_Deque_iterator< _Tp, _Ref, _Ptr > - SYNOPSIS
Public Types typedef _Tp ** _Map_pointer typedef _Deque_iterator _Self typedef _Deque_iterator< _Tp, const _Tp &, const _Tp * > const_iterator" typedef ptrdiff_t difference_type typedef _Deque_iterator< _Tp, _Tp &, _Tp * > iterator" typedef std::random_access_iterator_tag iterator_category" typedef _Ptr pointer typedef _Ref reference typedef size_t size_type typedef _Tp value_type Public Member Functions _Deque_iterator (_Tp *__x, _Map_pointer __y) _Deque_iterator (const iterator &__x) void _M_set_node (_Map_pointer __new_node) reference operator* () const _Self operator+ (difference_type __n) const _Self & operator++ () _Self operator++ (int) _Self & operator+= (difference_type __n) _Self operator- (difference_type __n) const _Self & operator-- () _Self operator-- (int) _Self & operator-= (difference_type __n) pointer operator-> () const reference operator[] (difference_type __n) const Static Public Member Functions static size_t _S_buffer_size () Public Attributes _Tp * _M_cur _Tp * _M_first _Tp * _M_last _Map_pointer _M_node Detailed Description template<typename _Tp, typename _Ref, typename _Ptr>struct std::_Deque_iterator< _Tp, _Ref, _Ptr > A deque::iterator. Quite a bit of intelligence here. Much of the functionality of deque is actually passed off to this class. A deque holds two of these internally, marking its valid range. Access to elements is done as offsets of either of those two, relying on operator overloading in this class. All the functions are op overloads except for _M_set_node. Definition at line 106 of file stl_deque.h. Member Function Documentation template<typename _Tp, typename _Ref, typename _Ptr> void std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_set_node (_Map_pointer__new_node) [inline] Prepares to traverse new_node. Sets everything except _M_cur, which should therefore be set by the caller immediately afterwards, based on _M_first and _M_last. Definition at line 234 of file stl_deque.h. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Jun 10 2014 std::_Deque_iterator< _Tp, _Ref, _Ptr >(3)
Check Out this Related Man Page
std::__profile::deque< _Tp, _Allocator >(3) Library Functions Manual std::__profile::deque< _Tp, _Allocator >(3) NAME
std::__profile::deque< _Tp, _Allocator > - SYNOPSIS
Inherits deque< _Tp, _Allocator >. Public Types typedef _Allocator allocator_type typedef _Base::const_iterator const_iterator typedef _Base::const_pointer const_pointer typedef _Base::const_reference const_reference typedef _Base::const_reverse_iterator const_reverse_iterator" typedef _Base::difference_type difference_type typedef _Base::iterator iterator typedef _Base::pointer pointer typedef _Base::reference reference typedef _Base::reverse_iterator reverse_iterator typedef _Base::size_type size_type typedef _Tp value_type Public Member Functions _Base & _M_base () noexcept const _Base & _M_base () const noexcept reference back () const_reference back () const const _Tp const _Allocator 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 (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 (iterator __position) iterator erase (iterator __first, iterator __last) reference front () const_reference front () const iterator insert (iterator __position, const _Tp &__x) iterator insert (iterator __position, _Tp &&__x) void insert (iterator __p, initializer_list< value_type > __l) void insert (iterator __position, size_type __n, const _Tp &__x) template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> void insert (iterator __position, _InputIterator __first, _InputIterator __last) reference operator[] (size_type __n) const_reference operator[] (size_type __n) const void pop_back () void pop_front () 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 swap (deque &__x) Public Attributes const _Tp const _Allocator & __a __pad0__: _Base(__a) { } explicit deque(size_type __n) : _Base(__n) { } deque(size_type __n const _Tp & __value Detailed Description template<typename _Tp, typename _Allocator = std::allocator<_Tp>>class std::__profile::deque< _Tp, _Allocator > Class std::deque wrapper with performance instrumentation. Definition at line 40 of file profile/deque. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Jun 10 2014 std::__profile::deque< _Tp, _Allocator >(3)