|
| _Deque_iterator (_Elt_pointer __x, _Map_pointer __y) noexcept |
|
| _Deque_iterator (const _Deque_iterator &__x) noexcept |
|
template<typename _Iter , typename = _Require<is_same<_Self, const_iterator>, is_same<_Iter, iterator>>> |
| _Deque_iterator (const _Iter &__x) noexcept |
|
iterator | _M_const_cast () const noexcept |
|
void | _M_set_node (_Map_pointer __new_node) noexcept |
|
reference | operator* () const noexcept |
|
_Self & | operator++ () noexcept |
|
_Self | operator++ (int) noexcept |
|
_Self & | operator+= (difference_type __n) noexcept |
|
_Self & | operator-- () noexcept |
|
_Self | operator-- (int) noexcept |
|
_Self & | operator-= (difference_type __n) noexcept |
|
pointer | operator-> () const noexcept |
|
_Deque_iterator & | operator= (const _Deque_iterator &)=default |
|
reference | operator[] (difference_type __n) const noexcept |
|
|
template<typename _RefR , typename _PtrR > |
bool | operator!= (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
bool | operator!= (const _Self &__x, const _Self &__y) noexcept |
|
_Self | operator+ (const _Self &__x, difference_type __n) noexcept |
|
_Self | operator+ (difference_type __n, const _Self &__x) noexcept |
|
template<typename _RefR , typename _PtrR > |
difference_type | operator- (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
difference_type | operator- (const _Self &__x, const _Self &__y) noexcept |
|
_Self | operator- (const _Self &__x, difference_type __n) noexcept |
|
template<typename _RefR , typename _PtrR > |
bool | operator< (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
bool | operator< (const _Self &__x, const _Self &__y) noexcept |
|
template<typename _RefR , typename _PtrR > |
bool | operator<= (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
bool | operator<= (const _Self &__x, const _Self &__y) noexcept |
|
template<typename _RefR , typename _PtrR > |
bool | operator== (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
bool | operator== (const _Self &__x, const _Self &__y) noexcept |
|
template<typename _RefR , typename _PtrR > |
bool | operator> (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
bool | operator> (const _Self &__x, const _Self &__y) noexcept |
|
template<typename _RefR , typename _PtrR > |
bool | operator>= (const _Self &__x, const _Deque_iterator< _Tp, _RefR, _PtrR > &__y) noexcept |
|
bool | operator>= (const _Self &__x, const _Self &__y) noexcept |
|
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 113 of file stl_deque.h.
template<typename _Tp , typename _Ref , typename _Ptr >
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 260 of file stl_deque.h.