std::reverse_iterator< _Iterator >(3cxx) | std::reverse_iterator< _Iterator >(3cxx) |
std::reverse_iterator< _Iterator >
Inherits std::iterator< iterator_traits< _Iterator >::iterator_category, iterator_traits< _Iterator >::value_type, iterator_traits< _Iterator >::difference_type, iterator_traits< _Iterator >::pointer, iterator_traits< _Iterator >::reference >.
typedef __traits_type::difference_type difference_type
typedef iterator_traits< _Iterator >::iterator_category
iterator_category
One of the tag types. typedef _Iterator iterator_type
typedef __traits_type::pointer pointer
typedef __traits_type::reference reference
typedef iterator_traits< _Iterator >::value_type
value_type
The type 'pointed to' by the iterator.
_GLIBCXX17_CONSTEXPR reverse_iterator ()
_GLIBCXX17_CONSTEXPR reverse_iterator (iterator_type __x)
_GLIBCXX17_CONSTEXPR reverse_iterator (const reverse_iterator
&__x)
template<typename _Iter > _GLIBCXX17_CONSTEXPR reverse_iterator
(const reverse_iterator< _Iter > &__x)
_GLIBCXX17_CONSTEXPR iterator_type base () const
_GLIBCXX17_CONSTEXPR reference operator* () const
_GLIBCXX17_CONSTEXPR reverse_iterator operator+ (difference_type
__n) const
_GLIBCXX17_CONSTEXPR reverse_iterator & operator++ ()
_GLIBCXX17_CONSTEXPR reverse_iterator operator++ (int)
_GLIBCXX17_CONSTEXPR reverse_iterator & operator+=
(difference_type __n)
_GLIBCXX17_CONSTEXPR reverse_iterator operator- (difference_type
__n) const
_GLIBCXX17_CONSTEXPR reverse_iterator & operator-- ()
_GLIBCXX17_CONSTEXPR reverse_iterator operator-- (int)
_GLIBCXX17_CONSTEXPR reverse_iterator & operator-=
(difference_type __n)
_GLIBCXX17_CONSTEXPR pointer operator-> () const
_GLIBCXX17_CONSTEXPR reference operator[] (difference_type __n) const
typedef iterator_traits< _Iterator > __traits_type
_Iterator current
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:
&*(reverse_iterator(i)) == &*(i - 1)
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 101 of file bits/stl_iterator.h.
One of the tag types.
Definition at line 121 of file stl_iterator_base_types.h.
The type 'pointed to' by the iterator.
Definition at line 123 of file stl_iterator_base_types.h.
The default constructor value-initializes member current. If it is a pointer, that means it is zero-initialized.
Definition at line 127 of file bits/stl_iterator.h.
Referenced by std::reverse_iterator< _Iterator >::operator+(), and std::reverse_iterator< _Iterator >::operator-().
This iterator will move in the opposite direction that x does.
Definition at line 133 of file bits/stl_iterator.h.
The copy constructor is normal.
Definition at line 139 of file bits/stl_iterator.h.
A reverse_iterator across other types can be copied if the underlying iterator can be converted to the type of current.
Definition at line 148 of file bits/stl_iterator.h.
Returns:
Definition at line 155 of file bits/stl_iterator.h.
Referenced by std::make_reverse_iterator(), and std::operator==().
Returns:
This requires that --current is dereferenceable.
Warning:
Definition at line 169 of file bits/stl_iterator.h.
Returns:
The underlying iterator must be a Random Access Iterator.
Definition at line 242 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::reverse_iterator().
Returns:
Decrements the underlying iterator.
Definition at line 192 of file bits/stl_iterator.h.
Returns:
Decrements the underlying iterator.
Definition at line 204 of file bits/stl_iterator.h.
Returns:
Moves the underlying iterator backwards __n steps. The underlying iterator must be a Random Access Iterator.
Definition at line 252 of file bits/stl_iterator.h.
Returns:
The underlying iterator must be a Random Access Iterator.
Definition at line 264 of file bits/stl_iterator.h.
References std::reverse_iterator< _Iterator >::reverse_iterator().
Returns:
Increments the underlying iterator.
Definition at line 217 of file bits/stl_iterator.h.
Returns:
Increments the underlying iterator.
Definition at line 229 of file bits/stl_iterator.h.
Returns:
Moves the underlying iterator forwards __n steps. The underlying iterator must be a Random Access Iterator.
Definition at line 274 of file bits/stl_iterator.h.
Returns:
This requires that --current is dereferenceable.
Definition at line 183 of file bits/stl_iterator.h.
References std::__addressof().
Returns:
The underlying iterator must be a Random Access Iterator.
Definition at line 286 of file bits/stl_iterator.h.
Generated automatically by Doxygen for libstdc++ from the source code.
Mon Feb 25 2019 | libstdc++ |