Public Types¶

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.

Public Member Functions¶

constexpr reverse_iterator ()
constexpr reverse_iterator (const reverse_iterator &__x)
template<typename _Iter > constexpr reverse_iterator (const reverse_iterator< _Iter > &__x)
constexpr reverse_iterator (iterator_type __x)
constexpr iterator_type base () const
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 > constexpr reverse_iterator & operator= (const reverse_iterator< _Iter > &__x)
constexpr reference operator[] (difference_type __n) const

Protected Types¶

typedef iterator_traits< _Iterator > __traits_type

Protected Attributes¶

_Iterator current

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:

&*(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 127 of file bits/stl_iterator.h.

typedef iterator_traits< _Iterator >::iterator_category 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 >::iterator_category [inherited]¶

One of the tag types.

Definition at line 130 of file stl_iterator_base_types.h.

typedef iterator_traits< _Iterator >::value_type 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 >::value_type [inherited]¶

The type 'pointed to' by the iterator.

Definition at line 132 of file stl_iterator_base_types.h.

template<typename _Iterator > constexpr std::reverse_iterator< _Iterator >::reverse_iterator () [inline], [constexpr]¶

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.

template<typename _Iterator > constexpr std::reverse_iterator< _Iterator >::reverse_iterator (iterator_type __x) [inline], [explicit], [constexpr]¶

This iterator will move in the opposite direction that x does.

Definition at line 183 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr std::reverse_iterator< _Iterator >::reverse_iterator (const reverse_iterator< _Iterator > & __x) [inline], [constexpr]¶

The copy constructor is normal.

Definition at line 189 of file bits/stl_iterator.h.

template<typename _Iterator > template<typename _Iter > constexpr std::reverse_iterator< _Iterator >::reverse_iterator (const reverse_iterator< _Iter > & __x) [inline], [constexpr]¶

A reverse_iterator across other types can be copied if the underlying iterator can be converted to the type of current.

Definition at line 205 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr iterator_type std::reverse_iterator< _Iterator >::base () const [inline], [constexpr]¶

Returns

Definition at line 227 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reference std::reverse_iterator< _Iterator >::operator* () const [inline], [constexpr]¶

Returns

This requires that --current is dereferenceable.

Warning

Definition at line 241 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator std::reverse_iterator< _Iterator >::operator+ (difference_type __n) const [inline], [constexpr]¶

Returns

The underlying iterator must be a Random Access Iterator.

Definition at line 322 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator& std::reverse_iterator< _Iterator >::operator++ () [inline], [constexpr]¶

Returns

Decrements the underlying iterator.

Definition at line 272 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator std::reverse_iterator< _Iterator >::operator++ (int) [inline], [constexpr]¶

Returns

Decrements the underlying iterator.

Definition at line 284 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator& std::reverse_iterator< _Iterator >::operator+= (difference_type __n) [inline], [constexpr]¶

Returns

Moves the underlying iterator backwards __n steps. The underlying iterator must be a Random Access Iterator.

Definition at line 332 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator std::reverse_iterator< _Iterator >::operator- (difference_type __n) const [inline], [constexpr]¶

Returns

The underlying iterator must be a Random Access Iterator.

Definition at line 344 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator& std::reverse_iterator< _Iterator >::operator-- () [inline], [constexpr]¶

Returns

Increments the underlying iterator.

Definition at line 297 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator std::reverse_iterator< _Iterator >::operator-- (int) [inline], [constexpr]¶

Returns

Increments the underlying iterator.

Definition at line 309 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reverse_iterator& std::reverse_iterator< _Iterator >::operator-= (difference_type __n) [inline], [constexpr]¶

Returns

Moves the underlying iterator forwards __n steps. The underlying iterator must be a Random Access Iterator.

Definition at line 354 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr pointer std::reverse_iterator< _Iterator >::operator-> () const [inline], [constexpr]¶

Returns

This requires that --current is dereferenceable.

Definition at line 253 of file bits/stl_iterator.h.

template<typename _Iterator > constexpr reference std::reverse_iterator< _Iterator >::operator[] (difference_type __n) const [inline], [constexpr]¶

Returns

The underlying iterator must be a Random Access Iterator.

Definition at line 366 of file bits/stl_iterator.h.