C++ Array Library - rend() Function

---

Description

The C++ function std::array::rend() returns a reverse iterator which points to the theoretical element preceding to first element of the array.

This area represents all arrays elements present between range of array::rbegin() and array::rend() in reverse order.

Declaration

Following is the declaration for std::array::rend() function form std::array header.

reverse_iterator rend() noexcept;
const_reverse_iterator rend() noexcept;

Parameters

None

Return Value

Returns a reverse iterator which points to the theoretical element precedent to first element of the array. In other words it return a reverse iterator which point to the last element of reversed array container.

If array object is const-qualified then method return const reverse iterator otherwise it return reverse iterator.

Exceptions

This member function never throws exception.

Time complexity

Constant i.e. O(1)

Example

The following example shows the usage of std::array::rend() function.

#include <iostream>
#include <array>

using namespace std;

int main(void) {

   array<int, 5> arr = {10, 20, 30, 40, 50};
   /* reverse iterator points to the last element of the array */
   auto s = arr.rbegin(); 
     
   /* reverse iterator points to the first element of the array */
   auto e = arr.rend();   

   /* iterate array in reverse order */
   while (s < e) {
      cout << *s << " ";
      ++s;
   }

   cout << endl;

   return 0;
}

Let us compile and run the above program, this will produce the following result −

50 40 30 20 10