std::unordered_set<Key,Hash,KeyEqual,Allocator>::end(size_type), std::unordered_set<Key,Hash,KeyEqual,Allocator>::cend(size_type)
From cppreference.com
< cpp | container | unordered set
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::unordered_set (C++17)
(C++17)
(C++23)
(C++20)
unordered_set::end(size_type)unordered_set::cend(size_type)
(until C++20)
Deduction guides (C++17)
local_iterator end( size_type n );
(since C++11)
const_local_iterator end( size_type n ) const;
(since C++11)
const_local_iterator cend( size_type n ) const;
(since C++11)
Returns an iterator to the element following the last element of the bucket with index n. This element acts as a placeholder, attempting to access it results in undefined behavior.
Contents
[edit] Parameters
n
-
the index of the bucket to access
[edit] Return value
Iterator to the element following the last element.
[edit] Complexity
Constant.