---
name: "std::reverse_iterator"
section: "3"
platform: "linux"
package: "gcc"
version: "16.2.1+r23+gd564253eb6c8-1"
release: "Arch Linux 2026-11-01"
platforms: ["linux"]
url: "https://new.carta.tech/std::reverse_iterator"
---

# std::reverse\_iterator(3)

## NAME

std::reverse\_iterator\< \_Iterator \>

## SYNOPSIS

\#include \<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 \>**.

### 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\> 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\> 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 & \>())))\

## Detailed Description

### 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.

## Constructor & Destructor Documentation

### template\<typename \_Iterator\> std::reverse\_iterator\< \_Iterator \>::reverse\_iterator () \[inline\], \[constexpr\], \[noexcept\]

The default constructor value-initializes member current. If it is a pointer, that means it is zero-initialized.

Referenced by **std::reverse\_iterator\< iterator \>::operator+()**, and **std::reverse\_iterator\< iterator \>::operator-()**.

### template\<typename \_Iterator\> std::reverse\_iterator\< \_Iterator \>::reverse\_iterator (iterator\_type \_\_x) \[inline\], \[explicit\], \[constexpr\], \[noexcept\]

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

### template\<typename \_Iterator\> std::reverse\_iterator\< \_Iterator \>::reverse\_iterator (const reverse\_iterator\< \_Iterator \> & \_\_x) \[inline\], \[constexpr\], \[noexcept\]

The copy constructor is normal.

### template\<typename \_Iterator\> template\<typename \_Iter\> std::reverse\_iterator\< \_Iterator \>::reverse\_iterator (const reverse\_iterator\< \_Iter \> & \_\_x) \[inline\], \[constexpr\], \[noexcept\]

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

## Member Function Documentation

### template\<typename \_Iterator\> iterator\_type std::reverse\_iterator\< \_Iterator \>::base () const \[inline\], \[nodiscard\], \[constexpr\], \[noexcept\]

**Returns**

current, the iterator used for underlying work.

Referenced by **std::operator==()**.

### template\<typename \_Iterator\> reference std::reverse\_iterator\< \_Iterator \>::operator\* () const \[inline\], \[nodiscard\], \[constexpr\]

**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

### template\<typename \_Iterator\> reverse\_iterator std::reverse\_iterator\< \_Iterator \>::operator+ (difference\_type \_\_n) const \[inline\], \[nodiscard\], \[constexpr\]

**Returns**

A reverse\_iterator that refers to current - *\_\_n*

The underlying iterator must be a Random Access Iterator.

### template\<typename \_Iterator\> reverse\_iterator & std::reverse\_iterator\< \_Iterator \>::operator++ () \[inline\], \[constexpr\]

**Returns**

\*this

Decrements the underlying iterator.

### template\<typename \_Iterator\> reverse\_iterator std::reverse\_iterator\< \_Iterator \>::operator++ (int ) \[inline\], \[constexpr\]

**Returns**

The original value of \*this

Decrements the underlying iterator.

### template\<typename \_Iterator\> reverse\_iterator & std::reverse\_iterator\< \_Iterator \>::operator+= (difference\_type \_\_n) \[inline\], \[constexpr\]

**Returns**

\*this

Moves the underlying iterator backwards *\_\_n* steps. The underlying iterator must be a Random Access Iterator.

### template\<typename \_Iterator\> reverse\_iterator std::reverse\_iterator\< \_Iterator \>::operator- (difference\_type \_\_n) const \[inline\], \[nodiscard\], \[constexpr\]

**Returns**

A reverse\_iterator that refers to current - *\_\_n*

The underlying iterator must be a Random Access Iterator.

### template\<typename \_Iterator\> reverse\_iterator & std::reverse\_iterator\< \_Iterator \>::operator-- () \[inline\], \[constexpr\]

**Returns**

\*this

Increments the underlying iterator.

### template\<typename \_Iterator\> reverse\_iterator std::reverse\_iterator\< \_Iterator \>::operator-- (int ) \[inline\], \[constexpr\]

**Returns**

A reverse\_iterator with the previous value of \*this

Increments the underlying iterator.

### template\<typename \_Iterator\> reverse\_iterator & std::reverse\_iterator\< \_Iterator \>::operator-= (difference\_type \_\_n) \[inline\], \[constexpr\]

**Returns**

\*this

Moves the underlying iterator forwards *\_\_n* steps. The underlying iterator must be a Random Access Iterator.

### template\<typename \_Iterator\> pointer std::reverse\_iterator\< \_Iterator \>::operator-\> () const \[inline\], \[nodiscard\], \[constexpr\]

**Returns**

A pointer to the value at --current

This requires that --current is dereferenceable.

### template\<typename \_Iterator\> reference std::reverse\_iterator\< \_Iterator \>::operator\[\] (difference\_type \_\_n) const \[inline\], \[nodiscard\], \[constexpr\]

**Returns**

The value at current - *\_\_n* - 1

The underlying iterator must be a Random Access Iterator.

## Author

Generated automatically by Doxygen for libstdc++ from the source code.