std::_deque_iterator(3) [debian man page]

std::_Deque_iterator< _Tp, _Ref, _Ptr >(3cxx)							     std::_Deque_iterator< _Tp, _Ref, _Ptr >(3cxx)

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 105 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 233 of file stl_deque.h.

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

libstdc++							  Tue Nov 27 2012		     std::_Deque_iterator< _Tp, _Ref, _Ptr >(3cxx)

std::complex< _Tp >(3cxx)												 std::complex< _Tp >(3cxx)

NAME

       std::complex< _Tp > -

SYNOPSIS

   Public Types
       typedef _Tp value_type

   Public Member Functions
       constexpr complex (const _Tp &__r=_Tp(), const _Tp &__i=_Tp())
       template<typename _Up > constexpr complex (const complex< _Up > &__z)
       constexpr complex __rep () const
       constexpr _Tp imag () const
       void imag (_Tp __val)
       complex< _Tp > & operator*= (const _Tp &)
       template<typename _Up > complex< _Tp > & operator*= (const complex< _Up > &)
       complex< _Tp > & operator+= (const _Tp &__t)
       template<typename _Up > complex< _Tp > & operator+= (const complex< _Up > &)
       complex< _Tp > & operator-= (const _Tp &__t)
       template<typename _Up > complex< _Tp > & operator-= (const complex< _Up > &)
       complex< _Tp > & operator/= (const _Tp &)
       template<typename _Up > complex< _Tp > & operator/= (const complex< _Up > &)
       complex< _Tp > & operator= (const _Tp &)
       template<typename _Up > complex< _Tp > & operator= (const complex< _Up > &)
       constexpr _Tp real () const
       void real (_Tp __val)

Detailed Description
   template<typename _Tp>struct std::complex< _Tp >
       Template to represent complex numbers.

       Specializations for float, double, and long double are part of the library. Results with any other type are not guaranteed.

       Parameters:
	   Tp Type of real and imaginary values.

       Definition at line 124 of file complex.

Member Typedef Documentation
   template<typename _Tp> typedef _Tp std::complex< _Tp >::value_type
       Value typedef.

       Definition at line 127 of file complex.

Constructor &; Destructor Documentation
   template<typename _Tp> constexpr std::complex< _Tp >::complex (const _Tp &__r = _Tp(), const _Tp &__i = _Tp()) [inline]
       Default constructor. First parameter is x, second parameter is y. Unspecified parameters default to 0.

       Definition at line 131 of file complex.

   template<typename _Tp> template<typename _Up > constexpr std::complex< _Tp >::complex (const complex< _Up > &__z) [inline]
       Copy constructor.

       Definition at line 138 of file complex.

Member Function Documentation
   template<typename _Tp> complex<_Tp>& std::complex< _Tp >::operator+= (const _Tp &__t) [inline]
       Add t to this complex number.

       Definition at line 181 of file complex.

   template<typename _Tp> complex<_Tp>& std::complex< _Tp >::operator-= (const _Tp &__t) [inline]
       Subtract t from this complex number.

       Definition at line 190 of file complex.

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

libstdc++							  Tue Nov 27 2012					 std::complex< _Tp >(3cxx)