.rend()

The .rend() function in C++ is part of the std::deque container. It returns a reverse iterator pointing to the position before the first element of the container, allowing reverse iteration from the last element toward the first.

Syntax

deque_name.rend()

• deque_name: This represents the specific std::deque container that holds the data and is used to call the .rend() function.

Example

The following code demonstrates how to iterate through a deque in reverse order using .rend():

#include <iostream>
#include <deque>

int main() {
    // Initialize a deque with integer values
    std::deque<int> numbers = {1, 2, 3, 4, 5};

    // Output the deque in reverse order using reverse iterators
    std::cout << "Deque elements in reverse: ";
    for (auto it = numbers.rbegin(); it != numbers.rend(); ++it) {
        std::cout << *it << " ";
    }

    return 0;
}

This example results in the following output:

Deque elements in reverse: 5 4 3 2 1

In this example:

• The .rbegin() method starts the iteration at the last element of the deque.
• The .rend() method determines where the reverse traversal stops, just before the first element.

Codebyte Example

Explore how .rend() works with a character deque in this example:

us
Visit us
code
Hide code
Code
Output
Hide output
Hide output
Loading...
Run

In this example:

• .rbegin() initializes the reverse iteration from the last element.
• .rend() marks the stopping point of reverse traversal.