Deque_iterator Struct Template Reference
#include <stl_deque.h>
Inheritance diagram for Deque_iterator:
List of all members.
Detailed Description
template<typename Type, typename Ref, typename Ptr>
struct std::Deque_iterator< Type, Ref, Ptr >
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.
Definition at line 100 of file stl_deque.h.
Public Types
-
typedef Deque_iterator< Type,
const Type &, const Type * > const_iterator
-
typedef ptrdiff_t difference_type
-
typedef Deque_iterator< Type,
Type &, Type * > iterator
-
typedef random_access_iterator_tag iterator_category
-
typedef Type ** Map_pointer
-
typedef Ptr pointer
-
typedef Ref reference
-
typedef Deque_iterator Self
-
typedef size_t size_type
-
typedef Type value_type
Public Member Functions
-
Deque_iterator (const iterator &x)
-
Deque_iterator (Type *x, Map_pointer y)
-
void M_set_node (Map_pointer new_node)
-
reference operator * () const
-
Self operator+ (difference_type n) const
-
Self operator++ (int)
-
Self & operator++ ()
-
Self & operator+= (difference_type n)
-
Self operator- (difference_type n) const
-
Self operator-- (int)
-
Self & operator-- ()
-
Self & operator-= (difference_type n)
-
pointer operator-> () const
-
reference operator[] (difference_type n) const
Static Public Member Functions
Public Attributes
-
Type * M_cur
-
Type * M_first
-
Type * M_last
-
Map_pointer M_node
The documentation for this struct was generated from the following file:
Generated on Sun Jul 25 00:12:43 2004 for libstdc++ source by
1.3.7