std::inplace_vector<T,N>::end, std::inplace_vector<T,N>::cend
来自 zh.cppreference.net
constexpr iterator end() noexcept;
|
(1) | (自 C++26) |
constexpr const_iterator end() const noexcept;
|
(2) | (自 C++26) |
constexpr const_iterator cend() const noexcept;
|
(3) | (自 C++26) |
返回指向 inplace_vector 最后一个元素之后元素的迭代器。
该元素充当占位符；尝试访问它会导致未定义行为。
返回值
指向最后一个元素之后的迭代器。
复杂度
常量。
示例
运行此代码
#include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
#include <string>
#include <inplace_vector>
int main()
{
std::inplace_vector<int, 5> nums{1, 2, 4, 8, 16};
std::inplace_vector<std::string, 3> fruits{"orange", "apple", "raspberry"};
std::inplace_vector<char, 0> empty;
// Print inplace_vector nums.
std::for_each(nums.cbegin(), nums.cend(),
[](const int n) { std::cout << n << ' '; });
std::cout << '\n';
// Sum all integers in the inplace_vector nums, printing only the result.
std::cout << "Sum of nums: "
<< std::accumulate(nums.cbegin(), nums.cend(), 0) << '\n';
// Print the first fruit in the inplace_vector fruits, checking if there is any.
if (!fruits.empty())
std::cout << "First fruit: " << *fruits.cbegin() << '\n';
if (empty.cbegin() == empty.cend())
std::cout << "inplace_vector ‘empty’ is indeed empty.\n";
// Modify the first element in nums.
*nums.begin() = 32;
assert(*nums.cbegin() == 32);
}
输出：
1 2 4 8 16
Sum of nums: 31
First fruit: orange
inplace_vector ‘empty’ is indeed empty.
参见
|
返回指向起始位置的迭代器
(公开成员函数) |
|
|
(C++11)
(C++14)
|
返回指向容器或数组末尾的迭代器
(函数模板) |