C++ Deque Library - crend() Function

---

---

Description

The C++ function std::deque::crend() returns a constant reverse iterator which points to the theoretical element preceding the first element in the deque i.e. reverse end of deque.

Declaration

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

C++11

const_reverse_iterator crend() const noexcept;

Parameters

None

Return value

Returns a constant random reverse iterator which points to the reverser end of deque.

Exceptions

This member function never throws exception.

Time complexity

Constant i.e. O(1)

Example

The following example shows the usage of std::deque::crend() 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.crend() - 1; it >= d.crbegin(); --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