public member function
<deque>

std::deque::crend

const_reverse_iterator crend() const noexcept;
Return const_reverse_iterator to reverse end
Returns a const_reverse_iterator pointing to the theoretical element preceding the first element in the container (which is considered its reverse end).

Parameters

none

Return Value

A const_reverse_iterator to the reverse end of the sequence.

Member type const_reverse_iterator is a reverse random access iterator type that points to a const element (see deque member types).

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 
// deque::crbegin/crend
#include <iostream>
#include <deque>

int main ()
{
  std::deque<int> mydeque = {1,2,3,4,5};

  std::cout << "mydeque backwards:";
  for (auto rit = mydeque.crbegin(); rit != mydeque.crend(); ++rit)
    std::cout << ' ' << *rit;
  std::cout << '\n';

  return 0;
}


Output:
mydeque backwards: 5 4 3 2 1

Complexity

Constant.

Iterator validity

No changes.

Data races

The container is accessed.
No contained elements are accessed by the call, but the iterator returned can be used to access them. Concurrently accessing or modifying different elements is safe.

Exception safety

No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.

See also

deque::end
Return iterator to end (public member function )
deque::crbegin
Return const_reverse_iterator to reverse beginning (public member function )
deque::rend
Return reverse iterator to reverse end (public member function )

C++