public member function
<array>

std::array::rend

      reverse_iterator rend() noexcept;const_reverse_iterator rend() const noexcept;
Return reverse iterator to reverse end
Returns a reverse iterator pointing to the theoretical element preceding the first element in the array (which is considered its reverse end).

The range between array::rbegin and array::rend contains all the elements of the array (in reverse order).

Parameters

none

Return Value

A reverse iterator to the reverse end of the sequence.

If the array object is const-qualified, the function returns a const_iterator. Otherwise, it returns an iterator.

Member types reverse_iterator and const_reverse_iterator are reverse random access iterator types (pointing to an element and to a const element, respectively). See vector member types.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
// array::rbegin/rend
#include <iostream>
#include <array>

int main ()
{
  std::array<int,4> myarray = {4, 26, 80, 14} ;

  std::cout << "myarray contains:";
  for ( auto rit=myarray.rbegin() ; rit < myarray.rend(); ++rit )
    std::cout << ' ' << *rit;

  std::cout << '\n';

  return 0;
}

Output:
14 80 26 4

Notice how the reverse iterator iterates through the array in a reverse way by increasing the iterator.

Complexity

Constant.

Iterator validity

No changes.

Data races

No contained elements are accessed by the call, but the iterator returned can be used to access or modify elements. Concurrently accessing or modifying different elements is safe.

Exception safety

No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.

See also