std::_Deque_iterator< _Tp, _Ref, _Ptr > Struct Template Reference

A deque::iterator. More...

Inheritance diagram for std::_Deque_iterator< _Tp, _Ref, _Ptr >:

Inheritance graph

List of all members.

Public Types

Public Member Functions

Static Public Member Functions

Public Attributes


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 94 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 222 of file stl_deque.h.


The documentation for this struct was generated from the following file:

Generated on Thu Jul 23 21:17:31 2009 for libstdc++ by  doxygen 1.5.8