libstdc++
|
#include <stl_iterator.h>
Public Types | |
typedef __traits_type::difference_type | difference_type |
typedef iterator_traits< _Iterator >::iterator_category | iterator_category |
typedef _Iterator | iterator_type |
typedef __traits_type::pointer | pointer |
typedef __traits_type::reference | reference |
typedef iterator_traits< _Iterator >::value_type | value_type |
Public Member Functions | |
constexpr | reverse_iterator () |
constexpr | reverse_iterator (const reverse_iterator &__x) |
template<typename _Iter > | |
constexpr | reverse_iterator (const reverse_iterator< _Iter > &__x) |
constexpr | reverse_iterator (iterator_type __x) |
constexpr iterator_type | base () const |
constexpr reference | operator* () const |
constexpr reverse_iterator | operator+ (difference_type __n) const |
constexpr reverse_iterator & | operator++ () |
constexpr reverse_iterator | operator++ (int) |
constexpr reverse_iterator & | operator+= (difference_type __n) |
constexpr reverse_iterator | operator- (difference_type __n) const |
constexpr reverse_iterator & | operator-- () |
constexpr reverse_iterator | operator-- (int) |
constexpr reverse_iterator & | operator-= (difference_type __n) |
constexpr pointer | operator-> () const |
reverse_iterator & | operator= (const reverse_iterator &)=default |
template<typename _Iter > | |
constexpr reverse_iterator & | operator= (const reverse_iterator< _Iter > &__x) |
constexpr reference | operator[] (difference_type __n) const |
Protected Types | |
typedef iterator_traits< _Iterator > | __traits_type |
Protected Attributes | |
_Iterator | current |
Bidirectional and random access iterators have corresponding reverse iterator adaptors that iterate through the data structure in the opposite direction. They have the same signatures as the corresponding iterators. The fundamental relation between a reverse iterator and its corresponding iterator i
is established by the identity:
This mapping is dictated by the fact that while there is always a pointer past the end of an array, there might not be a valid pointer before the beginning of an array. [24.4.1]/1,2
Reverse iterators can be tricky and surprising at first. Their semantics make sense, however, and the trickiness is a side effect of the requirement that the iterators must be safe.
Definition at line 128 of file bits/stl_iterator.h.
|
protected |
Definition at line 149 of file bits/stl_iterator.h.
typedef __traits_type::difference_type std::reverse_iterator< _Iterator >::difference_type |
Definition at line 155 of file bits/stl_iterator.h.
|
inherited |
One of the tag types.
Definition at line 130 of file stl_iterator_base_types.h.
typedef _Iterator std::reverse_iterator< _Iterator >::iterator_type |
Definition at line 152 of file bits/stl_iterator.h.
typedef __traits_type::pointer std::reverse_iterator< _Iterator >::pointer |
Definition at line 153 of file bits/stl_iterator.h.
typedef __traits_type::reference std::reverse_iterator< _Iterator >::reference |
Definition at line 156 of file bits/stl_iterator.h.
|
inherited |
The type "pointed to" by the iterator.
Definition at line 132 of file stl_iterator_base_types.h.
|
inlineconstexpr |
The default constructor value-initializes member current
. If it is a pointer, that means it is zero-initialized.
Definition at line 178 of file bits/stl_iterator.h.
|
inlineexplicitconstexpr |
This iterator will move in the opposite direction that x
does.
Definition at line 184 of file bits/stl_iterator.h.
|
inlineconstexpr |
The copy constructor is normal.
Definition at line 190 of file bits/stl_iterator.h.
|
inlineconstexpr |
A reverse_iterator across other types can be copied if the underlying iterator can be converted to the type of current
.
Definition at line 206 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
, the iterator used for underlying work. Definition at line 228 of file bits/stl_iterator.h.
Referenced by std::operator==().
|
inlineconstexpr |
--current
This requires that --current
is dereferenceable.
x
, a reference obtained by *x
remains valid after x
has been modified or destroyed. This is a bug: http://gcc.gnu.org/PR51823 Definition at line 242 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 323 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Decrements the underlying iterator.
Definition at line 273 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Decrements the underlying iterator.
Definition at line 285 of file bits/stl_iterator.h.
|
inlineconstexpr |
Moves the underlying iterator backwards __n steps. The underlying iterator must be a Random Access Iterator.
Definition at line 333 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 345 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Increments the underlying iterator.
Definition at line 298 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Increments the underlying iterator.
Definition at line 310 of file bits/stl_iterator.h.
|
inlineconstexpr |
Moves the underlying iterator forwards __n steps. The underlying iterator must be a Random Access Iterator.
Definition at line 355 of file bits/stl_iterator.h.
|
inlineconstexpr |
--current
This requires that --current
is dereferenceable.
Definition at line 254 of file bits/stl_iterator.h.
|
inlineconstexpr |
Definition at line 217 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
- __n - 1The underlying iterator must be a Random Access Iterator.
Definition at line 367 of file bits/stl_iterator.h.
Definition at line 136 of file bits/stl_iterator.h.
|
protected |
Definition at line 147 of file bits/stl_iterator.h.