std::deque<T,Allocator>::rbegin, std::deque<T,Allocator>::crbegin

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros(C++20)

Language support library

Concepts library(C++20)

Diagnostics library

Memory management library

Metaprogramming library(C++11)

General utilities library

Containers library

Iterators library

Ranges library(C++20)

Algorithms library

Strings library

Text processing library

Numerics library

Date and time library

Input/output library

Filesystem library(C++17)

Concurrency support library(C++11)

Execution control library(C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

node-handle (C++17)

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

hive (C++26)

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Tables

Iterator invalidation

Member function table

Non-member function table

 

std::deque

Member types
Member functions
deque::deque deque::~deque deque::operator= deque::assign deque::assign_range (C++23)   deque::get_allocator Element access deque::at deque::operator[] deque::front deque::back Iterators deque::begindeque::cbegin (C++11) deque::enddeque::cend (C++11) deque::rbegindeque::crbegin (C++11) deque::renddeque::crend (C++11)	Capacity deque::empty deque::size deque::max_size deque::shrink_to_fit (DR*) Modifiers deque::clear deque::insert deque::insert_range (C++23) deque::emplace deque::erase deque::push_front deque::emplace_front (C++11) deque::prepend_range (C++23) deque::pop_front deque::push_back deque::emplace_back (C++11) deque::append_range (C++23) deque::pop_back deque::resize deque::swap
Non-member functions
operator==operator<=> (C++20) swap(std::deque) erase(std::deque)erase_if(std::deque) (C++20)(C++20)	operator!=operator<operator>operator<=operator>= (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides(C++17)

 

reverse_iterator rbegin();	(1)	(noexcept since C++11) (constexpr since C++26)
const_reverse_iterator rbegin()const;	(2)	(noexcept since C++11) (constexpr since C++26)
const_reverse_iterator crbegin()constnoexcept;	(3)	(since C++11) (constexpr since C++26)

Returns a reverse iterator to the first element of the reversed *this. It corresponds to the last element of the non-reversed *this.

If *this is empty, the returned iterator is equal to rend().

Return value

Reverse iterator to the first element.

Complexity

Constant.

Notes

The underlying iterator of the returned reverse iterator is the end iterator. Hence the returned iterator is invalidated if and when the end iterator is invalidated.

libc++ backports crbegin() to C++98 mode.

Example

Run this code

#include <algorithm>#include <iostream>#include <numeric>#include <string>#include <deque>   int main(){std::deque<int> nums{1, 2, 4, 8, 16};std::deque<std::string> fruits{"orange", "apple", "raspberry"};std::deque<char> empty;   // Print deque.std::for_each(nums.rbegin(), nums.rend(), [](constint n){std::cout<< n <<' ';});std::cout<<'\n';   // Sums all integers in the deque nums (if any), printing only the result.std::cout<<"Sum of nums: "<<std::accumulate(nums.rbegin(), nums.rend(), 0)<<'\n';   // Prints the first fruit in the deque fruits, checking if there is any.if(!fruits.empty())std::cout<<"First fruit: "<<*fruits.rbegin()<<'\n';   if(empty.rbegin()== empty.rend())std::cout<<"deque 'empty' is indeed empty.\n";}

Output:

16 8 4 2 1 Sum of nums: 31 First fruit: raspberry deque 'empty' is indeed empty.

See also

rendcrend (C++11)	returns a reverse iterator to the end (public member function)
rbegincrbegin (C++14)	returns a reverse iterator to the beginning of a container or array (function template)