NAME¶
std::unordered_set< _Value, _Hash, _Pred, _Alloc > -
SYNOPSIS¶
Inherits std::__unordered_set< _Value, _Hash, _Pred, _Alloc,
__cache_hash_code >.
Public Types¶
typedef _Base::allocator_type
allocator_type
typedef _Base::const_iterator
const_iterator
typedef
__detail::_Local_const_iterator
< key_type, value_type,
std::_Identity< _Value >
, _Hash,
__detail::_Mod_range_hashing,
__detail::_Default_ranged_hash,
__constant_iterators,
__cache_hash_code >
const_local_iterator"
typedef _Alloc::const_pointer
const_pointer
typedef _Alloc::const_reference
const_reference
typedef std::ptrdiff_t
difference_type
typedef _Base::hasher
hasher
typedef _Base::iterator
iterator
typedef _Base::key_equal
key_equal
typedef _Value
key_type
typedef
__detail::_Local_iterator
< key_type, value_type,
std::_Identity< _Value >
, _Hash,
__detail::_Mod_range_hashing,
__detail::_Default_ranged_hash,
__constant_iterators,
__cache_hash_code >
local_iterator"
typedef _Alloc::pointer
pointer
typedef _Alloc::reference
reference
typedef _Base::size_type
size_type
typedef _Base::value_type
value_type
Public Member Functions¶
unordered_set (size_type __n=10, const hasher &__hf=hasher(), const
key_equal &__eql=key_equal(), const allocator_type
&__a=allocator_type())
template<typename _InputIterator >
unordered_set (_InputIterator
__f, _InputIterator __l, size_type __n=0, const hasher &__hf=hasher(),
const key_equal &__eql=key_equal(), const allocator_type
&__a=allocator_type())
unordered_set (
initializer_list< value_type > __l, size_type
__n=0, const hasher &__hf=hasher(), const key_equal
&__eql=key_equal(), const allocator_type &__a=allocator_type())
const
__detail::_Prime_rehash_policy &
__rehash_policy () const"
void
__rehash_policy (const __detail::_Prime_rehash_policy &)
iterator
begin () noexcept
const_iterator
begin () const noexcept
local_iterator
begin (size_type __n)
const_local_iterator
begin (size_type __n) const
size_type
bucket (const key_type &__k) const
size_type
bucket_count () const noexcept
size_type
bucket_size (size_type __n) const
const_iterator
cbegin () const noexcept
const_local_iterator
cbegin (size_type __n) const
const_iterator
cend () const noexcept
const_local_iterator
cend (size_type __n) const
void
clear () noexcept
size_type
count (const key_type &__k) const
_Insert_Return_Type
emplace (_Args &&...__args)
iterator
emplace_hint (const_iterator, _Args &&...__args)
bool
empty () const noexcept
iterator
end () noexcept
const_iterator
end () const noexcept
local_iterator
end (size_type __n)
const_local_iterator
end (size_type __n) const
std::pair< iterator, iterator >
equal_range (const key_type
&__k)
std::pair< const_iterator,
const_iterator >
equal_range (const key_type &__k) const"
iterator
erase (const_iterator)
iterator
erase (iterator __it)
size_type
erase (const key_type &)
iterator
erase (const_iterator, const_iterator)
iterator
find (const key_type &__k)
const_iterator
find (const key_type &__k) const
allocator_type
get_allocator () const noexcept
std::pair< iterator, bool >
insert (value_type
&&__v)
iterator
insert (const_iterator, value_type &&__v)
_Insert_Return_Type
insert (const value_type &__v)
iterator
insert (const_iterator, const value_type &__v)
_Insert_Return_Type
insert (_Pair &&__v)
iterator
insert (const_iterator, _Pair &&__v)
void
insert (_InputIterator __first, _InputIterator __last)
void
insert (
initializer_list< value_type > __l)
key_equal
key_eq () const
float
load_factor () const noexcept
size_type
max_bucket_count () const noexcept
size_type
max_size () const noexcept
unordered_set &
operator= (
initializer_list<
value_type > __l)
void
rehash (size_type __n)
size_type
size () const noexcept
void
swap (
_Hashtable &)
Protected Types¶
typedef _HCBase::_Hash_code_type
_Hash_code_type
Protected Member Functions¶
std::pair< iterator, bool >
_M_emplace
(
std::true_type, _Args &&...__args)
iterator
_M_emplace (
std::false_type, _Args &&...__args)
const _Equal &
_M_eq () const
_Equal &
_M_eq ()
bool
_M_equals (const _Key &__k, _Hash_code_type __c, _Hash_node<
_Value, __cache_hash_code > *__n) const
std::pair< iterator, bool >
_M_insert (_Arg &&,
std::true_type)
iterator
_M_insert (_Arg &&,
std::false_type)
void
_M_swap (_Hashtable_base &__x)
Detailed Description¶
template<class _Value, class _Hash = hash<_Value>, class
_Pred = std::equal_to<_Value>, class _Alloc =
std::allocator<_Value>>class std::unordered_set< _Value, _Hash,
_Pred, _Alloc >¶
A standard container composed of unique keys (containing at most one of each key
value) in which the elements' keys are the elements themselves.
Meets the requirements of a container, and unordered associative container
Parameters:
Value Type of key objects.
Hash Hashing function object type, defaults to hash<Value>.
Pred Predicate function object type, defaults to equal_to<Value>.
Alloc Allocator type, defaults to allocator<Key>.
Definition at line 279 of file unordered_set.h.
Author¶
Generated automatically by Doxygen for libstdc++ from the source code.