std::set<Key,Compare,Allocator>::begin, std::set<Key,Compare,Allocator>::

Returns an iterator to the first element of the set.

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

Parameters

(none)

Return value

Iterator to the first element.

Complexity

Constant.

Notes

Because both iterator and const_iterator

libc++ backports cbegin() to C++98 mode.

Example

#include <algorithm>
#include <iostream>
#include <set>
 
int main()
{
    std::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';
}

1 2 3 4 5 6 9

See also