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
Public Member Functions¶
_Deque_iterator (_Tp *__x, _Map_pointer __y)
Static Public Member Functions¶
static size_t _S_buffer_size ()
Public Attributes¶
_Tp * _M_cur
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.Fri Dec 19 2014 | libstdc++ |