std::flat_set<Key,Compare,KeyContainer>::begin, std::flat_set<Key,Compare,KeyContainer>::cbegin
From cppreference.com
C++
Containers library
(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::flat_set
iterator begin() noexcept; |
(1) | (since C++23) (constexpr since C++26) |
const_iterator begin() const noexcept; |
(2) | (since C++23) (constexpr since C++26) |
const_iterator cbegin() const noexcept; |
(3) | (since C++23) (constexpr since C++26) |
Returns an iterator to the first element of *this.
If *this is empty, the returned iterator will be equal to end().
Contents |
[edit] Return value
Iterator to the first element.
[edit] Complexity
Constant.
Notes
Because both iterator and const_iterator are constant iterators (and may in fact be the same type), it is not possible to mutate the elements of the container through an iterator returned by any of these member functions.
[edit] Example
Run this code
#include <algorithm> #include <flat_set> #include <iostream> int main() { std::flat_set<int> set{3, 1, 4, 1, 5, 9, 2, 6, 5}; std::for_each(set.cbegin(), set.cend(), [](int x) { std::cout << x << ' '; }); std::cout << '\n'; }
Output:
1 2 3 4 5 6 9
[edit] See also
| returns an iterator to the end (public member function) | |
| (C++11)(C++14) |
returns an iterator to the beginning of a container or array (function template) |
