std::_Deque_iterator Struct Reference
Inheritance diagram for std::_Deque_iterator:

List of all members.

Public Types

Public Member Functions

Static Public Member Functions

Public Attributes

Detailed Description

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.

Member Function Documentation

void std::_Deque_iterator::_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.

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