A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://cplusplus.com/reference/deque/deque/crbegin/ below:

public member function

<deque>

std::deque::crbegin 
const_reverse_iterator crbegin() const noexcept;

Return const_reverse_iterator to reverse beginning

Returns a const_reverse_iterator pointing to the last element in the container (i.e., its reverse beginning).

Parameters none

Return Value A const_reverse_iterator to the reverse beginning 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 safetyNo-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::begin
Return iterator to beginning (public member function)
deque::crend
Return const_reverse_iterator to reverse end (public member function)
deque::rbegin
Return reverse iterator to reverse beginning (public member function)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4