29#ifndef _GLIBCXX_UNORDERED_SET
30#define _GLIBCXX_UNORDERED_SET 1
33#pragma GCC system_header
38#if __cplusplus < 201103L
51#define __glibcxx_want_allocator_traits_is_always_equal
52#define __glibcxx_want_erase_if
53#define __glibcxx_want_generic_unordered_lookup
54#define __glibcxx_want_node_extract
55#define __glibcxx_want_nonmember_container_access
58#if __cplusplus >= 201703L
60namespace std _GLIBCXX_VISIBILITY(default)
62_GLIBCXX_BEGIN_NAMESPACE_VERSION
65 template<
typename _Key,
typename _Hash = std::hash<_Key>,
66 typename _Pred = std::equal_to<_Key>>
69 polymorphic_allocator<_Key>>;
70 template<
typename _Key,
typename _Hash = std::hash<_Key>,
71 typename _Pred = std::equal_to<_Key>>
72 using unordered_multiset
74 polymorphic_allocator<_Key>>;
76_GLIBCXX_END_NAMESPACE_VERSION
80#if __cplusplus > 201703L
81namespace std _GLIBCXX_VISIBILITY(default)
83_GLIBCXX_BEGIN_NAMESPACE_VERSION
84 template<
typename _Key,
typename _Hash,
typename _CPred,
typename _Alloc,
87 erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>&
__cont,
90 _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
92 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
95 template<
typename _Key,
typename _Hash,
typename _CPred,
typename _Alloc,
98 erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
__cont,
101 _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
103 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
105_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.