- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Deque Library - crbegin() Function
Description
The C++ function std::deque::crbegin() returns a constant reverse iterator which points to the last element of the deque i.e reverser beginning of container.
Declaration
Following is the declaration for std::deque::crbegin() function form std::deque header.
C++11
const_reverse_iterator crbegin() const noexcept;
Parameters
None
Return value
Returns a random access reverse iterator which points to the reverse beginning of the 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::crbegin() function.
#include <iostream> #include <deque> using namespace std; int main(void) { deque<int> d = {1, 2, 3, 4, 5}; cout << "Contents of deque in reverse order" << endl; for (auto it = d.crbegin(); it != d.crend(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Contents of deque in reverse order 5 4 3 2 1
deque.htm
Advertisements