C++ <list> - rend() Function

The C++ list::rend function returns the reverse iterator pointing to the element preceding the first element (reversed past-the-last element) of the list. A reverse iterator iterates in backward direction and increasing it results into moving to the beginning of the list container. Similarly, decreasing a reverse iterator results into moving to the end of the list container.

Syntax

• C++98
• C++11

reverse_iterator rend();
const_reverse_iterator rend() const;

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

Parameters

No parameter is required.

Return Value

A reverse iterator to the reversed past-the-last element of the sequence container. If the sequence object is constant qualified, the function returns a const_reverse_iterator, else returns an reverse_iterator.

Time Complexity

Constant i.e, Θ(1).

Example:

In the example below, the list::rend function returns the reverse iterator pointing to the element preceding the first element of the list MyList.

#include <iostream>
#include <list>
using namespace std;
 
int main (){
  list<string> MyList{"Alpha","Coding","Skills"};
  list<string>::reverse_iterator rit;

  rit = MyList.rend();
  rit--;
  cout<<*rit<<" ";
  rit--;
  cout<<*rit<<" ";
  rit--;
  cout<<*rit<<" ";
  return 0;
}

The output of the above code will be:

Alpha Coding Skills

Example:

Lets see another example where the list called MyList contains integer values and list::rend function is used with list::rbegin function to specify a range including all elements of the list container.

#include <iostream>
#include <list>
using namespace std;
 
int main (){
  list<int> MyList{10, 20, 30, 40, 50};
  list<int>::reverse_iterator rit;

  for(rit = MyList.rbegin(); rit != MyList.rend(); ++rit)
    cout<<*rit<<" ";

  return 0;
}

The output of the above code will be:

50 40 30 20 10