# std::set<Key,Compare,Allocator>::end, std::set<Key,Compare,Allocator>::cend

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

| (1) |
iterator end(); |  | (until C++11)
iterator end() noexcept; |  | (since C++11)
| (2) |
const_iterator end() const; |  | (until C++11)
const_iterator end() const noexcept; |  | (since C++11)
const_iterator cend() const noexcept; | (3) | (since C++11)

Returns an iterator to the element following the last element of the `set`.

This element acts as a placeholder; attempting to access it results in undefined behavior.

### Parameters

(none)

### Return value

Iterator to the element following the last element.

### 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.

### Example

Run this code

    #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';
    }

Output:

    1 2 3 4 5 6 9

### See also

begin cbegin (C++11) | returns an iterator to the beginning (public member function)
end cend (C++11)(C++14) | returns an iterator to the end of a container or array (function template)

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/set/end&oldid=135442"