libstdc++
|
#include <stl_iterator.h>
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 > |
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 131 of file bits/stl_iterator.h.
|
protected |
Definition at line 152 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::difference_type = iter_difference_t<_Iterator> |
Definition at line 169 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::iterator_category = __detail::__clamp_iter_cat<typename __traits_type::iterator_category, random_access_iterator_tag> |
Definition at line 165 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::iterator_concept = __conditional_t<random_access_iterator<_Iterator>, random_access_iterator_tag, bidirectional_iterator_tag> |
Definition at line 161 of file bits/stl_iterator.h.
typedef _Iterator std::reverse_iterator< _Iterator >::iterator_type |
Definition at line 155 of file bits/stl_iterator.h.
typedef __traits_type::pointer std::reverse_iterator< _Iterator >::pointer |
Definition at line 156 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::reference = iter_reference_t<_Iterator> |
Definition at line 170 of file bits/stl_iterator.h.
using std::reverse_iterator< _Iterator >::value_type = iter_value_t<_Iterator> |
Definition at line 168 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 181 of file bits/stl_iterator.h.
|
inlineexplicitconstexprnoexcept |
This iterator will move in the opposite direction that x
does.
Definition at line 190 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
The copy constructor is normal.
Definition at line 199 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 217 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
current
, the iterator used for underlying work. Definition at line 243 of file bits/stl_iterator.h.
|
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 259 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 342 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Decrements the underlying iterator.
Definition at line 291 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Decrements the underlying iterator.
Definition at line 303 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 352 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
- __n The underlying iterator must be a Random Access Iterator.
Definition at line 365 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Increments the underlying iterator.
Definition at line 316 of file bits/stl_iterator.h.
|
inlineconstexpr |
*this
Increments the underlying iterator.
Definition at line 328 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 375 of file bits/stl_iterator.h.
|
inlineconstexpr |
--current
This requires that --current
is dereferenceable.
Definition at line 272 of file bits/stl_iterator.h.
|
inlineconstexprnoexcept |
Definition at line 230 of file bits/stl_iterator.h.
|
inlineconstexpr |
current
- __n - 1The underlying iterator must be a Random Access Iterator.
Definition at line 388 of file bits/stl_iterator.h.
Definition at line 139 of file bits/stl_iterator.h.
|
friend |
Definition at line 394 of file bits/stl_iterator.h.
|
friend |
Definition at line 404 of file bits/stl_iterator.h.
|
protected |
Definition at line 150 of file bits/stl_iterator.h.