libstdc++: std::reverse_iterator< _Iterator > Class Template Reference (original) (raw)
#include <[stl_iterator.h](a17942%5Fsource.html)>
| 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 (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 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 & >()))) |
template<typename _Iterator>
class std::reverse_iterator< _Iterator >
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.
◆ __traits_type
template<typename _Iterator >
◆ difference_type
template<typename _Iterator >
◆ iterator_category
template<typename _Iterator >
◆ iterator_concept
template<typename _Iterator >
◆ iterator_type
template<typename _Iterator >
◆ pointer
template<typename _Iterator >
template<typename _Iterator >
◆ value_type
template<typename _Iterator >
◆ reverse_iterator() [1/4]
template<typename _Iterator >
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.
◆ reverse_iterator() [2/4]
template<typename _Iterator >
| constexpr std::reverse_iterator< _Iterator >::reverse_iterator ( iterator_type __x) | inlineexplicitconstexprnoexcept |
|---|
This iterator will move in the opposite direction that x does.
Definition at line 188 of file bits/stl_iterator.h.
◆ reverse_iterator() [3/4]
template<typename _Iterator >
◆ reverse_iterator() [4/4]
template<typename _Iterator >
template<typename _Iter >
requires __convertible<_Iter>
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.
◆ base()
template<typename _Iterator >
◆ operator*()
template<typename _Iterator >
Returns
A reference to the value at --current
This requires that --current is dereferenceable.
Warning
This implementation requires that for an iterator of the underlying iterator type, 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.
◆ operator+()
template<typename _Iterator >
Returns
A reverse_iterator that refers to current - __n
The underlying iterator must be a Random Access Iterator.
Definition at line 340 of file bits/stl_iterator.h.
◆ operator++() [1/2]
template<typename _Iterator >
◆ operator++() [2/2]
template<typename _Iterator >
Returns
The original value of *this
Decrements the underlying iterator.
Definition at line 301 of file bits/stl_iterator.h.
◆ operator+=()
template<typename _Iterator >
Returns
*this
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.
◆ operator-()
template<typename _Iterator >
Returns
A reverse_iterator that refers to current - __n
The underlying iterator must be a Random Access Iterator.
Definition at line 363 of file bits/stl_iterator.h.
◆ operator--() [1/2]
template<typename _Iterator >
◆ operator--() [2/2]
template<typename _Iterator >
Returns
A reverse_iterator with the previous value of *this
Increments the underlying iterator.
Definition at line 326 of file bits/stl_iterator.h.
◆ operator-=()
template<typename _Iterator >
Returns
*this
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.
◆ operator->()
template<typename _Iterator >
Returns
A pointer to the value at --current
This requires that --current is dereferenceable.
Definition at line 270 of file bits/stl_iterator.h.
◆ operator=()
template<typename _Iterator >
template<typename _Iter >
requires __convertible<_Iter> && assignable_from<_Iterator&, const _Iter&>
◆ operator[]()
template<typename _Iterator >
| constexpr reference std::reverse_iterator< _Iterator >::operator[] ( difference_type __n) const | inlineconstexpr |
|---|
Returns
The value at current - __n - 1
The underlying iterator must be a Random Access Iterator.
Definition at line 386 of file bits/stl_iterator.h.
◆ reverse_iterator
template<typename _Iterator >
template<typename _Iter >
◆ iter_move
template<typename _Iterator >
| constexpr iter_rvalue_reference_t< _Iterator > iter_move ( const reverse_iterator< _Iterator > & __i) | friend |
|---|
◆ iter_swap
template<typename _Iterator >
template<indirectly_swappable< _Iterator > _Iter2>
◆ current
template<typename _Iterator >
The documentation for this class was generated from the following file: