public member function
const_reverse_iterator rbegin() const;
reverse_iterator rbegin() noexcept;
const_reverse_iterator rbegin() const noexcept;
Return reverse iterator to reverse beginning
Returns a reverse iterator pointing to the last element in the container (i.e., its reverse beginning).
Reverse iterators iterate backwards: increasing them moves them towards the beginning of the container.
rbegin points to the element right before the one that would be pointed to by member end.
Notice that unlike member deque::back, which returns a reference to this same element, this function returns a reverse random access iterator.
A reverse iterator to the reverse beginning of the sequence container.
If the deque object is const-qualified, the function returns a const_iterator. Otherwise, it returns an iterator.
Member types reverse_iterator and const_reverse_iterator are reverse random access iterator types (pointing to an element and to a const element, respectively). See deque member types.
int main ()
std::deque<int> mydeque (5); // 5 default-constructed ints
std::deque<int>::reverse_iterator rit = mydeque.rbegin();
for (rit = mydeque.rbegin(); rit!= mydeque.rend(); ++rit)
*rit = ++i;
std::cout << "mydeque contains:";
for (std::deque<int>::iterator it = mydeque.begin(); it != mydeque.end(); ++it)
std::cout << ' ' << *it;
std::cout << '\n';
mydeque contains: 5 4 3 2 1
The container is accessed (neither the const nor the non-const versions modify the container).
No contained elements are accessed by the call, but the iterator returned can be used to access or modify elements. Concurrently accessing or modifying different elements is safe.
No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.
- Access last element (public member function
- Return reverse iterator to reverse end (public member function
- Return iterator to beginning (public member function
- Return iterator to end (public member function