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.
DeclarationFollowing is the declaration for std::deque::crend() function form std::deque header.
C++11const_reverse_iterator crend() const noexcept;Parameters
None
Return valueReturns a constant random reverse iterator which points to the reverser end of deque.
ExceptionsThis member function never throws exception.
Time complexityConstant i.e. O(1)
ExampleThe 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
deque.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4