std::flat_set<Key,Compare,KeyContainer>::rend, std::flat_set<Key,Compare,KeyContainer>::crend

 

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::flat_set

Member types

Member functions

flat_set::flat_set flat_set::operator= Iterators flat_set::beginflat_set::cbegin flat_set::endflat_set::cend flat_set::rbeginflat_set::crbegin flat_set::rendflat_set::crend Capacity flat_set::size flat_set::max_size flat_set::empty Observers flat_set::key_comp flat_set::value_comp      Modifiers flat_set::clear flat_set::insert flat_set::insert_range flat_set::emplace flat_set::emplace_hint flat_set::erase flat_set::swap flat_set::extract flat_set::replace Lookup flat_set::count flat_set::find flat_set::contains flat_set::equal_range flat_set::lower_bound flat_set::upper_bound Non-member functions operator==operator<=> swap(std::flat_set) erase_if(std::flat_set)

Helper classes

uses_allocator<std::flat_set>

Tags

sorted_unique      sorted_unique_t

Deduction guides

 

reverse_iterator rend()noexcept;	(1)	(since C++23) (constexpr since C++26)
const_reverse_iterator rend()constnoexcept;	(2)	(since C++23) (constexpr since C++26)
const_reverse_iterator crend()constnoexcept;	(3)	(since C++23) (constexpr since C++26)

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

This returned iterator only acts as a sentinel. It is not guaranteed to be dereferenceable.

Return value

Reverse iterator to the element following the last element.

Complexity

Constant.

Notes

Because both iterator and const_iterator are constant iterators (and may in fact be the same type), it is not possible to mutate the elements of the container through an iterator returned by any of these member functions.

Example

Run this code

#include <iostream>#include <flat_set>   int main(){std::flat_set<unsigned> rep{1, 2, 3, 4, 1, 2, 3, 4};   for(auto it = rep.crbegin(); it != rep.crend();++it){for(auto n =*it; n >0;--n)std::cout<<"⏼"<<' ';std::cout<<'\n';}}

Output:

⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼ ⏼

See also

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