std::set<Key,Compare,Allocator>:: end, std::set<Key,Compare,Allocator>:: cend
|
(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 |
| Member functions | |||||||||||||||||||||||||||
| Non-member functions | |||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||
| Deduction guides (C++17) | |||||||||||||||||||||||||||
|
iterator end
(
)
;
|
(1) |
(noexcept since C++11)
(constexpr since C++26) |
|
const_iterator end
(
)
const
;
|
(2) |
(noexcept since C++11)
(constexpr since C++26) |
|
const_iterator cend
(
)
const
noexcept
;
|
(3) |
(since C++11)
(constexpr since C++26) |
Returns an iterator past the last element of * this .
This returned iterator only acts as a sentinel. It is not guaranteed to be dereferenceable .
Contents |
Return value
Iterator past 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.
libc++ backports
cend()
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'; }
Output:
1 2 3 4 5 6 9
See also
|
(C++11)
|
returns an iterator to the beginning
(public member function) |
|
(C++11)
(C++14)
|
returns an iterator to the end of a container or array
(function template) |