std::_list_iterator(3) [centos man page]

std::_List_iterator< _Tp >(3)				     Library Functions Manual				     std::_List_iterator< _Tp >(3)

NAME

       std::_List_iterator< _Tp > -

SYNOPSIS

   Public Types
       typedef _List_node< _Tp > _Node
       typedef _List_iterator< _Tp > _Self
       typedef ptrdiff_t difference_type
       typedef
	   std::bidirectional_iterator_tag iterator_category"
       typedef _Tp * pointer
       typedef _Tp & reference
       typedef _Tp value_type

   Public Member Functions
       _List_iterator (__detail::_List_node_base *__x)
       bool operator!= (const _Self &__x) const
       reference operator* () const
       _Self & operator++ ()
       _Self operator++ (int)
       _Self & operator-- ()
       _Self operator-- (int)
       pointer operator-> () const
       bool operator== (const _Self &__x) const

   Public Attributes
       __detail::_List_node_base * _M_node

Detailed Description
   template<typename _Tp>struct std::_List_iterator< _Tp >
       A list::iterator.

       All the functions are op overloads.

       Definition at line 125 of file stl_list.h.

Author
       Generated automatically by Doxygen for libstdc++ from the source code.

libstdc++							  Tue Jun 10 2014				     std::_List_iterator< _Tp >(3)

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)