std::inplace_vector<T,N>::rend, std::inplace_vector<T,N>::crend
From cppreference.com
< cpp | container | inplace vector
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::inplace_vector
inplace_vector::rendinplace_vector::crend
constexpr reverse_iterator rend() noexcept;
(1)
(since C++26)
constexpr const_reverse_iterator rend() const noexcept;
(2)
(since C++26)
constexpr const_reverse_iterator crend() const noexcept;
(3)
(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.
Contents
[edit] Return value
Reverse iterator to the element following the last element.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <algorithm> #include <iostream> #include <inplace_vector> int main() { std::inplace_vector <int, 11> a{1, 11, 11, 35, 0, 12, 79, 76, 76, 69, 40}; // Print elements of container in reverse order using const_reverse_iterator's. std::for_each (a.crbegin(), a.crend(), [](int e){ std::cout << e << ' '; }); std::cout << '\n'; // Modify each element of container using non-const reverse_iterator's. std::for_each (a.rbegin(), a.rend(), [](int& e){ e += 32; }); // Print elements as chars in reverse order using const_reverse_iterator's. std::for_each (a.crbegin(), a.crend(), [](char e){ std::cout << e; }); std::cout << '\n'; }
Output:
40 69 76 76 79 12 0 35 11 11 1 Hello, C++!