libstdc++
|
Public Types | |
using | difference_type = iter_difference_t< _Iterator > |
using | iterator_category = __detail::__clamp_iter_cat< typename __traits_type::iterator_category, random_access_iterator_tag > |
using | iterator_concept = __conditional_t< random_access_iterator< _Iterator >, random_access_iterator_tag, bidirectional_iterator_tag > |
typedef _Iterator | iterator_type |
typedef __traits_type::pointer | pointer |
using | reference = iter_reference_t< _Iterator > |
using | value_type = iter_value_t< _Iterator > |
Public Member Functions | |
constexpr | reverse_iterator () noexcept(/*conditional */) |
constexpr | reverse_iterator (iterator_type __x) noexcept(/*conditional */) |
constexpr | reverse_iterator (const reverse_iterator &__x) noexcept(/*conditional */) |
template<typename _Iter > | |
requires __convertible< _Iter > constexpr | reverse_iterator (const reverse_iterator< _Iter > &__x) noexcept(/*conditional */) |
return | _S_to_pointer (__tmp) |
constexpr iterator_type | base () const noexcept(/*conditional */) |
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 requires is_pointer_v< _Iterator >||requires(const _Iterator __i) |
reverse_iterator & | operator= (const reverse_iterator &)=default |
template<typename _Iter > | |
requires __convertible< _Iter > &&assignable_from< _Iterator &, const _Iter & > constexpr reverse_iterator & | operator= (const reverse_iterator< _Iter > &__x) noexcept(/*conditional */) |
constexpr reference | operator[] (difference_type __n) const |
Public Attributes | |
__tmp | |
Protected Types | |
typedef iterator_traits< _Iterator > | __traits_type |
Protected Attributes | |
_Iterator | current |
Friends | |
template<typename _Iter > | |
class | reverse_iterator |
constexpr iter_rvalue_reference_t< _Iterator > | iter_move (const reverse_iterator &__i) noexcept(is_nothrow_copy_constructible_v< _Iterator > &&noexcept(ranges::iter_move(--std::declval< _Iterator &>()))) |
template<indirectly_swappable< _Iterator > _Iter2> | |
constexpr void | iter_swap (const reverse_iterator &__x, const reverse_iterator< _Iter2 > &__y) noexcept(is_nothrow_copy_constructible_v< _Iterator > &&is_nothrow_copy_constructible_v< _Iter2 > &&noexcept(ranges::iter_swap(--std::declval< _Iterator &>(), --std::declval< _Iter2 &>()))) |
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 129 of file bits/stl_iterator.h.
|
inlinenoexcept |
The default constructor value-initializes member current
. If it is a pointer, that means it is zero-initialized.
Definition at line 179 of file bits/stl_iterator.h.
Referenced by std::reverse_iterator< _Iterator >::operator+(), and std::reverse_iterator< _Iterator >::operator-().
|
inlineexplicitnoexcept |
This iterator will move in the opposite direction that x
does.
Definition at line 188 of file bits/stl_iterator.h.
|
inlinenoexcept |
The copy constructor is normal.
Definition at line 197 of file bits/stl_iterator.h.
|
inlinenoexcept |
A reverse_iterator across other types can be copied if the underlying iterator can be converted to the type of current
.
Definition at line 215 of file bits/stl_iterator.h.
|
inlinenoexcept |
current
, the iterator used for underlying work. Definition at line 241 of file bits/stl_iterator.h.
|
inline |
–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 257 of file bits/stl_iterator.h.
|
inline |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 340 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::reverse_iterator().
|
inline |
*this
Decrements the underlying iterator.
Definition at line 289 of file bits/stl_iterator.h.
|
inline |
*this
Decrements the underlying iterator.
Definition at line 301 of file bits/stl_iterator.h.
|
inline |
Moves the underlying iterator backwards __n steps. The underlying iterator must be a Random Access Iterator.
Definition at line 350 of file bits/stl_iterator.h.
|
inline |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 363 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::reverse_iterator().
|
inline |
*this
Increments the underlying iterator.
Definition at line 314 of file bits/stl_iterator.h.
|
inline |
*this
Increments the underlying iterator.
Definition at line 326 of file bits/stl_iterator.h.
|
inline |
Moves the underlying iterator forwards __n steps. The underlying iterator must be a Random Access Iterator.
Definition at line 373 of file bits/stl_iterator.h.
|
inline |
–current
This requires that –current
is dereferenceable.
Definition at line 270 of file bits/stl_iterator.h.
|
inline |
current
- __n - 1The underlying iterator must be a Random Access Iterator.
Definition at line 386 of file bits/stl_iterator.h.