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.
- History of C++
- What are Forward declarations in C++
- __builtin_inf() functions of GCC compiler
- Find k ordered pairs in array with minimum difference d
- Structures in C++
- Variables in C++
- Implementing Forward Iterator in BST
- Count substrings that contain all vowels | SET 2
- Machine Learning in C++
- How can we use Comma operator in place of curly braces?
- Optimally accommodate 0s and 1s from a Binary String into K buckets
- Remove first adjacent pairs of similar characters until possible
- Find a number containing N - 1 set bits at even positions from the right
- Sort an array according to absolute difference with given value using Functors
- Rearrange characters in a string such that no two adjacent are same using hashing
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