libstdc++
|
#include <stl_iterator.h>
Public Types | |
using | difference_type |
using | iterator_category |
using | iterator_concept |
typedef _Iterator | iterator_type |
typedef __traits_type::pointer | pointer |
using | reference |
using | value_type |
Public Member Functions | |
constexpr | reverse_iterator () 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 */) |
constexpr | reverse_iterator (iterator_type __x) noexcept(/*conditional */) |
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 |
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 |
Protected Types | |
typedef iterator_traits< _Iterator > | __traits_type |
Protected Attributes | |
_Iterator | current |
Friends | |
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 77 of file formatter.h.
|
protected |
Definition at line 150 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::difference_type |
Definition at line 165 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::iterator_category |
Definition at line 162 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::iterator_concept |
Definition at line 159 of file bits/stl_iterator.h.
_Iterator std::reverse_iterator< _Iterator >::iterator_type |
Definition at line 153 of file bits/stl_iterator.h.
__traits_type::pointer std::reverse_iterator< _Iterator >::pointer |
Definition at line 154 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::reference |
Definition at line 166 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::value_type |
Definition at line 164 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
The default constructor value-initializes member current
. If it is a pointer, that means it is zero-initialized.
Definition at line 177 of file bits/stl_iterator.h.
|
inlineexplicitconstexprnoexcept |
This iterator will move in the opposite direction that x
does.
Definition at line 186 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
The copy constructor is normal.
Definition at line 195 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
A reverse_iterator across other types can be copied if the underlying iterator can be converted to the type of current
.
Definition at line 213 of file bits/stl_iterator.h.
|
inlinenodiscardconstexprnoexcept |
current
, the iterator used for underlying work. Definition at line 239 of file bits/stl_iterator.h.
|
inlinenodiscardconstexpr |
--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 255 of file bits/stl_iterator.h.
|
inlinenodiscardconstexpr |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 338 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Decrements the underlying iterator.
Definition at line 287 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Decrements the underlying iterator.
Definition at line 299 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 348 of file bits/stl_iterator.h.
|
inlinenodiscardconstexpr |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 361 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Increments the underlying iterator.
Definition at line 312 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Increments the underlying iterator.
Definition at line 324 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 371 of file bits/stl_iterator.h.
|
inlinenodiscardconstexpr |
--current
This requires that --current
is dereferenceable.
Definition at line 268 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
Definition at line 226 of file bits/stl_iterator.h.
|
inlinenodiscardconstexpr |
current
- __n - 1The underlying iterator must be a Random Access Iterator.
Definition at line 384 of file bits/stl_iterator.h.
Definition at line 137 of file bits/stl_iterator.h.
|
friend |
Definition at line 390 of file bits/stl_iterator.h.
|
friend |
Definition at line 400 of file bits/stl_iterator.h.
|
protected |
Definition at line 148 of file bits/stl_iterator.h.