std::flat_set<Key,Compare,KeyContainer>::begin, std::flat_set<Key,Compare,KeyContainer>::

From cppreference.com
< cpp‎ | container‎ | flat set

iterator begin() noexcept;
(1) (since C++23)
const_iterator begin() const noexcept;
(2) (since C++23)
const_iterator cbegin() const noexcept;
(3) (since C++23)

Returns an iterator to the first element of the flat_set.

If the flat_set is empty, the returned iterator will be equal to end().

range-begin-end.svg

Parameters

(none)

Return value

Iterator to the first element.

Complexity

Constant.

Notes

Because both iterator and const_iterator

Example

#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

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)