C++ List Library - rend() Function

---

---

Description

The C++ function std::list::rend() returns a reverse iterator which points to the reverse end of the list i.e. beginning of the list.

Declaration

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

C++98

reverse_iterator rend();
const_reverse_iterator rend() const;

C++11

reverse_iterator rend() nothrow;
const_reverse_iterator rend() const nothrow;

Parameters

None

Return value

If object is constant qualified then method returns constant reverser iterator otherwise non-constant 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::list::rend() function.

#include <iostream>
#include <list>

using namespace std;

int main(void) {
   list<int> l = {1, 2, 3, 4, 5};

   cout << "List contains following elements in reverse order" << endl;

   for (auto it = l.rbegin(); it != l.rend(); ++it)
      cout << *it << endl;

   return 0;
}

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

List contains following elements in reverse order
5
4
3
2
1