C++ Deque Library - rbegin() Function

---

Description

The C++ function std::deque::rbegin() returns a reverse iterator which points to the last element of the deque.

Reverse iterator, iterates reverse order that is why incrementing them moves towards beginning of deque.

Declaration

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

C++98

reverse_iterator rbegin();
const_reverse_iterator rbegin() const;

C++11

reverse_iterator rbegin() noexcept;
const_reverse_iterator rbegin() const noexcept;

Parameters

None

Return value

If object is constant qualified then method returns constant reverse 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::deque::rbegin() 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.rbegin(); it != d.rend(); ++it)
      cout << *it << endl;

   return 0;
}

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

Contents of deque are
5
4
3
2
1