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::istream_iterator< _Tp, _CharT, _Traits, _Dist >(3) Library Functions Manual std::istream_iterator< _Tp, _CharT, _Traits, _Dist >(3) NAME
std::istream_iterator< _Tp, _CharT, _Traits, _Dist > - SYNOPSIS
Inherits std::iterator< input_iterator_tag, _Tp, _Dist, const _Tp *, const _Tp & >. Public Types typedef _CharT char_type typedef _Dist difference_type typedef basic_istream< _CharT, _Traits > istream_type" typedef input_iterator_tag iterator_category typedef const _Tp * pointer typedef const _Tp & reference typedef _Traits traits_type typedef _Tp value_type Public Member Functions constexpr istream_iterator () istream_iterator (istream_type &__s) istream_iterator (const istream_iterator &__obj) bool _M_equal (const istream_iterator &__x) const const _Tp & operator* () const istream_iterator & operator++ () istream_iterator operator++ (int) const _Tp * operator-> () const Detailed Description template<typename _Tp, typename _CharT = char, typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t>class std::istream_iterator< _Tp, _CharT, _Traits, _Dist > Provides input iterator semantics for streams. Definition at line 49 of file stream_iterator.h. Member Typedef Documentation typedef _Dist std::iterator< input_iterator_tag , _Tp, _Dist , const _Tp * , const _Tp & >::difference_type [inherited] Distance between iterators is represented as this type. Definition at line 125 of file stl_iterator_base_types.h. typedef input_iterator_tag std::iterator< input_iterator_tag , _Tp, _Dist , const _Tp * , const _Tp & >::iterator_category [inherited] One of the tag types. Definition at line 121 of file stl_iterator_base_types.h. typedef const _Tp * std::iterator< input_iterator_tag , _Tp, _Dist , const _Tp * , const _Tp & >::pointer [inherited] This type represents a pointer-to-value_type. Definition at line 127 of file stl_iterator_base_types.h. typedef const _Tp & std::iterator< input_iterator_tag , _Tp, _Dist , const _Tp * , const _Tp & >::reference [inherited] This type represents a reference-to-value_type. Definition at line 129 of file stl_iterator_base_types.h. typedef _Tp std::iterator< input_iterator_tag , _Tp, _Dist , const _Tp * , const _Tp & >::value_type [inherited] The type 'pointed to' by the iterator. Definition at line 123 of file stl_iterator_base_types.h. Constructor &; Destructor Documentation template<typename _Tp, typename _CharT = char, typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t> constexpr std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::istream_iterator () [inline] Construct end of input stream iterator. Definition at line 64 of file stream_iterator.h. template<typename _Tp, typename _CharT = char, typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t> std::istream_iterator< _Tp, _CharT, _Traits, _Dist >::istream_iterator (istream_type &__s) [inline] Construct start of input stream iterator. Definition at line 68 of file stream_iterator.h. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Jun 10 2014 std::istream_iterator< _Tp, _CharT, _Traits, _Dist >(3)