std::array:...ay::crbegin(3)
π NAME π
okay so this page is from the C++ Standard Libary manual β yes, βLibary,β we are respecting the source, bestie π
β and the page title is std::array:...ay::crbegin(3). The name entry is literally:
std::array::rbegin,std::array::crbegin - std::array::rbegin,std::array::crbegin
β¨ Synopsis β¨
reverse_iterator rbegin() noexcept; (1) (since C++11)
(constexpr since C++17)
const_reverse_iterator rbegin() const noexcept; (2) (since C++11)
(constexpr since C++17)
const_reverse_iterator crbegin() const noexcept; (3) (since C++11)
(constexpr since C++17)
Returns a reverse iterator to the first element of the reversed array. It corresponds to the last element of the non-reversed array. If the array is empty, the returned iterator is equal to rend().
Also, the original page drops in a diagram called range-rbegin-rend.svg right here β iconic little visual, no cap π¦.
π Parameters π
(none) β no parameters. Zero. Nada. Not even one, bestie π«Ά.
π 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.
lowkey important caveat, bestie: that invalidation detail is not a vibe, itβs a fact π
π Example π
// Run this code
#include <algorithm>
#include <array>
#include <iostream>
#include <string>
#include <string_view>
int main()
{
constexpr std::array<std::string_view, 8> data = {"β","β","β","β","β
","β","β","β"};
std::array<std::string, std::size(data)> arr;
std::copy(data.cbegin(), data.cend(), arr.begin());
// ^ ^ ^
auto print = [](const std::string_view s) { std::cout << s << ' '; };
print("Print 'arr' in direct order using [cbegin, cend):\t");
std::for_each(arr.cbegin(), arr.cend(), print);
// ^ ^
print("\n\nPrint 'arr' in reverse order using [crbegin, crend):\t");
std::for_each(arr.crbegin(), arr.crend(), print);
// ^^ ^^
print("\n");
}
πΈ Output πΈ
Print 'arr' in direct order using [cbegin, cend): β β β β β
β β β
Print 'arr' in reverse order using [crbegin, crend): β β β β
β β β β
π¦ See also π¦
rendβ returns a reverse iterator to the endcrendβ (public member function)rbeginβ returns a reverse iterator to the beginning of a container or arraycrbeginβ (function template)(C++14)
okay bye bestie! π source/version: http://cppreference.com Β· date: 2024.06.10 Β· page: std::array:...ay::crbegin(3) β¨
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms