C++ Deque Library - rend() Function


Advertisements

Description

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

Declaration

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

C++98

reverse_iterator rend();
const_reverse_iterator rend() const;

C++11

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

Parameters

None

Return value

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

#include <iostream>
#include <deque>

using namespace std;

int main(void) {

   deque<int> d = {1, 2, 3, 4, 5};

   cout << "Contents of deque are" << endl;

   for (auto it = d.rend() - 1; it >= d.rbegin(); --it)
      cout << *it << endl;

   return 0;
}

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

Contents of deque are
1
2
3
4
5
deque.htm
Advertisements