std::hive<T,Allocator>::rend, std::hive<T,Allocator>::crend
From cppreference.com
reverse_iterator rend() noexcept;
|
(1) | (since C++26) |
const_reverse_iterator rend() const noexcept;
|
(2) | (since C++26) |
const_reverse_iterator crend() const noexcept;
|
(3) | (since C++26) |
Returns a reverse iterator to the element following the last element of the reversed hive. It corresponds to the element preceding the first element of the non-reversed hive. This element acts as a placeholder, attempting to access it results in undefined behavior.
Return value
Reverse iterator to the element following the last element.
Complexity
Constant.
Example
Run this code
#include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
#include <string>
#include <hive>
int main()
{
std::hive<int> nums{1, 2, 4, 8, 16};
std::hive<std::string> fruits{"orange", "apple", "raspberry"};
std::hive<char> empty;
// Print hive nums.
std::for_each(nums.crbegin(), nums.crend(),
[](const int n) { std::cout << n << ' '; });
std::cout << '\n';
// Sum all integers in the hive nums, printing only the result.
std::cout << "Sum of nums: "
<< std::accumulate(nums.crbegin(), nums.crend(), 0) << '\n';
// Print the last fruit in the hive fruits, checking if there is any.
if (!fruits.empty())
std::cout << "Last fruit: " << *fruits.crbegin() << '\n';
if (empty.crbegin() == empty.crend())
std::cout << "hive ‘empty’ is indeed empty.\n";
// Modify the last element in nums.
*nums.rbegin() = 32;
assert(*nums.crbegin() == 32);
}
Output:
16 8 4 2 1
Sum of nums: 31
Last fruit: raspberry
hive ‘empty’ is indeed empty.
See also
| returns a reverse iterator to the beginning (public member function) | |
(C++14) |
returns a reverse end iterator for a container or array (function template) |