Fiber::unordered_set< typename _Value, typename _Hash, typename _Pred, typename _Alloc > Class Template Reference

STL class. More...

Classes
class	iterator
	STL iterator class. More...
class	const_iterator
	STL iterator class. More...
class	reverse_iterator
	STL iterator class. More...
class	const_reverse_iterator
	STL iterator class. More...

Public Types
typedef _Hashtable::key_type	key_type
typedef _Hashtable::key_type	key_type
typedef _Hashtable::value_type	value_type
typedef _Hashtable::value_type	value_type
typedef _Hashtable::hasher	hasher
typedef _Hashtable::hasher	hasher
typedef _Hashtable::key_equal	key_equal
typedef _Hashtable::key_equal	key_equal
typedef _Hashtable::allocator_type	allocator_type
typedef _Hashtable::allocator_type	allocator_type
typedef _Hashtable::pointer	pointer
typedef _Hashtable::pointer	pointer
typedef _Hashtable::const_pointer	const_pointer
typedef _Hashtable::const_pointer	const_pointer
typedef _Hashtable::reference	reference
typedef _Hashtable::reference	reference
typedef _Hashtable::const_reference	const_reference
typedef _Hashtable::const_reference	const_reference
typedef _Hashtable::iterator	iterator
typedef _Hashtable::iterator	iterator
typedef _Hashtable::const_iterator	const_iterator
typedef _Hashtable::const_iterator	const_iterator
typedef _Hashtable::local_iterator	local_iterator
typedef _Hashtable::local_iterator	local_iterator
typedef _Hashtable::const_local_iterator	const_local_iterator
typedef _Hashtable::const_local_iterator	const_local_iterator
typedef _Hashtable::size_type	size_type
typedef _Hashtable::size_type	size_type
typedef _Hashtable::difference_type	difference_type
typedef _Hashtable::difference_type	difference_type

Public Member Functions
	unordered_set (_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
	unordered_set (const allocator_type &__a)
	unordered_set (const unordered_set &)=default
	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())
	unordered_set (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
	unordered_set (unordered_set &&)=default
size_type	bucket_count () const noexcept
const_iterator	cbegin () const noexcept
const_local_iterator	cbegin (size_type __n) const
const_local_iterator	cbegin (size_type __n) const
const_iterator	cend () const noexcept
const_local_iterator	cend (size_type __n) const
const_local_iterator	cend (size_type __n) const
void	clear () noexcept
std::pair< iterator, bool >	emplace (_Args &&... __args)
iterator	emplace_hint (const_iterator __pos, _Args &&... __args)
bool	empty () const noexcept
size_type	erase (const key_type &__x)
iterator	erase (const_iterator __first, const_iterator __last)
iterator	erase (const_iterator __position)
iterator	erase (iterator __position)
iterator	erase (const_iterator __position)
iterator	erase (iterator __position)
node_type	extract (const key_type &__key)
node_type	extract (const_iterator __pos)
allocator_type	get_allocator () const noexcept
hasher	hash_function () const
void	insert (_InputIterator __first, _InputIterator __last)
iterator	insert (const_iterator, node_type &&__nh)
void	insert (initializer_list< value_type > __l)
insert_return_type	insert (node_type &&__nh)
std::pair< iterator, bool >	insert (const value_type &__x)
std::pair< iterator, bool >	insert (value_type &&__x)
iterator	insert (const_iterator __hint, const value_type &__x)
iterator	insert (const_iterator __hint, value_type &&__x)
std::pair< iterator, bool >	insert (const value_type &__x)
std::pair< iterator, bool >	insert (value_type &&__x)
iterator	insert (const_iterator __hint, const value_type &__x)
iterator	insert (const_iterator __hint, value_type &&__x)
key_equal	key_eq () const
float	load_factor () const noexcept
size_type	max_bucket_count () const noexcept
float	max_load_factor () const noexcept
void	max_load_factor (float __z)
size_type	max_size () const noexcept
unordered_set &	operator= (const unordered_set &)=default
unordered_set &	operator= (initializer_list< value_type > __l)
unordered_set &	operator= (unordered_set &&)=default
void	rehash (size_type __n)
void	reserve (size_type __n)
size_type	size () const noexcept
void	swap (unordered_set &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
iterator	begin () noexcept
const_iterator	begin () const noexcept
local_iterator	begin (size_type __n)
const_local_iterator	begin (size_type __n) const
iterator	begin () noexcept
const_iterator	begin () const noexcept
local_iterator	begin (size_type __n)
const_local_iterator	begin (size_type __n) const
iterator	end () noexcept
const_iterator	end () const noexcept
local_iterator	end (size_type __n)
const_local_iterator	end (size_type __n) const
iterator	end () noexcept
const_iterator	end () const noexcept
local_iterator	end (size_type __n)
const_local_iterator	end (size_type __n) const
iterator	find (const key_type &__x)
auto	find (const _Kt &__k) -> decltype(_M_h._M_find_tr(__k))
const_iterator	find (const key_type &__x) const
auto	find (const _Kt &__k) const -> decltype(_M_h._M_find_tr(__k))
iterator	find (const key_type &__x)
auto	find (const _Kt &__k) -> decltype(_M_h._M_find_tr(__k))
const_iterator	find (const key_type &__x) const
auto	find (const _Kt &__k) const -> decltype(_M_h._M_find_tr(__k))
size_type	count (const key_type &__x) const
auto	count (const _Kt &__k) const -> decltype(_M_h._M_count_tr(__k))
size_type	count (const key_type &__x) const
auto	count (const _Kt &__k) const -> decltype(_M_h._M_count_tr(__k))
bool	contains (const key_type &__x) const
auto	contains (const _Kt &__k) const -> decltype(_M_h._M_find_tr(__k), void(), true)
bool	contains (const key_type &__x) const
auto	contains (const _Kt &__k) const -> decltype(_M_h._M_find_tr(__k), void(), true)
std::pair< iterator, iterator >	equal_range (const key_type &__x)
auto	equal_range (const _Kt &__k) -> decltype(_M_h._M_equal_range_tr(__k))
std::pair< const_iterator, const_iterator >	equal_range (const key_type &__x) const
auto	equal_range (const _Kt &__k) const -> decltype(_M_h._M_equal_range_tr(__k))
std::pair< iterator, iterator >	equal_range (const key_type &__x)
auto	equal_range (const _Kt &__k) -> decltype(_M_h._M_equal_range_tr(__k))
std::pair< const_iterator, const_iterator >	equal_range (const key_type &__x) const
auto	equal_range (const _Kt &__k) const -> decltype(_M_h._M_equal_range_tr(__k))

Public Attributes
K	keys
	STL member.

Detailed Description

STL class.