29#ifndef _GLIBCXX_UNORDERED_SET
30#define _GLIBCXX_UNORDERED_SET 1
32#pragma GCC system_header
36#if __cplusplus < 201103L
49#define __glibcxx_want_allocator_traits_is_always_equal
50#define __glibcxx_want_erase_if
51#define __glibcxx_want_generic_unordered_lookup
52#define __glibcxx_want_node_extract
53#define __glibcxx_want_nonmember_container_access
56#if __cplusplus >= 201703L
58namespace std _GLIBCXX_VISIBILITY(default)
60_GLIBCXX_BEGIN_NAMESPACE_VERSION
63 template<
typename _Key,
typename _Hash = std::hash<_Key>,
64 typename _Pred = std::equal_to<_Key>>
67 polymorphic_allocator<_Key>>;
68 template<
typename _Key,
typename _Hash = std::hash<_Key>,
69 typename _Pred = std::equal_to<_Key>>
70 using unordered_multiset
72 polymorphic_allocator<_Key>>;
74_GLIBCXX_END_NAMESPACE_VERSION
78#if __cplusplus > 201703L
79namespace std _GLIBCXX_VISIBILITY(default)
81_GLIBCXX_BEGIN_NAMESPACE_VERSION
82 template<
typename _Key,
typename _Hash,
typename _CPred,
typename _Alloc,
85 erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>&
__cont,
88 _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
90 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
93 template<
typename _Key,
typename _Hash,
typename _CPred,
typename _Alloc,
96 erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
__cont,
99 _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
101 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
103_GLIBCXX_END_NAMESPACE_VERSION
ISO C++ entities toplevel namespace is std.
A standard container composed of equivalent keys (possibly containing multiple of each key value) in ...
_Hashtable::size_type size_type
Iterator-related typedefs.
A standard container composed of unique keys (containing at most one of each key value) in which the ...
_Hashtable::size_type size_type
Iterator-related typedefs.