These functions return useful iterators to access vector elements in reverse order (from end to beginning)
It’s a public member function that returns a const_reverse_iterator pointing to the element preceding the first element.
A const_reverse_iterator to the reverse end of the sequence.
const_reverse_iterator crend() const noexcept;
It returns a const_reverse_iterator pointing to the last element in the container (i.e., its reverse beginning)..
A const_reverse_iterator to the reverse beginning of the sequence.
const_reverse_iterator crbegin() const noexcept;
50 40 30 20 10
Returns a reverse iterator to the element following the last element of the reversed container. It corresponds to the element preceding the first element of the non-reversed container. This element acts as a placeholder, attempting to access it results in undefined behavior
Returns a reverse iterator to the first element of the reversed container. It corresponds to the last element of the non-reversed container.
Both are used in deque operations, concurrently accessing or modifying different elements is safe.
The copy construction or assignment of the returned iterator is also guaranteed to never throw exception.
- Stack of Pair in C++ STL with Examples
- Modulo Operator (%) in C/C++ with Examples
- fpclassify() method in C/C++ with Examples
- Operator Overloading '<<' and '>>' operator in a linked list class
- Set of Vectors in C++ STL with Examples
- Priority Queue of Vectors in C++ STL with Examples
- How to find the Entry with largest Value in a C++ Map
- Visibility Modes in C++ with Examples
- Program to implement Separate Chaining in C++ STL without the use of pointers
- Speed up Code executions with help of Pragma in C/C++
- Vector of Vectors in C++ STL with Examples
- Array of Vectors in C++ STL
- Difference between Virtual function and Pure virtual function in C++
- cin get() in C++ with Examples
- Difference between Increment and Decrement Operators
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : Anish Kumar Arya