std::inplace_vector<T,N>::begin, std::inplace_vector<T,N>::cbegin - cppreference.com
From cppreference.com
constexpr iterator begin() noexcept; |
(1) | (since C++26) |
constexpr const_iterator begin() const noexcept; |
(2) | (since C++26) |
constexpr const_iterator cbegin() const noexcept; |
(3) | (since C++26) |
Returns an iterator to the first element of the inplace_vector.
If the inplace_vector is empty, the returned iterator will be equal to end().
Return value
Iterator to the first element.
Complexity
Constant.
Example
#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); }
Output:
1 2 4 8 16 Sum of nums: 31 First fruit: orange inplace_vector ‘empty’ is indeed empty.
See also
| returns an iterator to the end (public member function) [edit] | |
| returns an iterator to the beginning of a container or array (function template) [edit] |