29#ifndef _GLIBCXX_UNORDERED_SET
30#define _GLIBCXX_UNORDERED_SET 1
32#pragma GCC system_header
36#if __cplusplus < 201103L
49#if __cplusplus >= 201703L
51namespace std _GLIBCXX_VISIBILITY(default)
53_GLIBCXX_BEGIN_NAMESPACE_VERSION
56 template<
typename _Key,
typename _Hash = std::hash<_Key>,
57 typename _Pred = std::equal_to<_Key>>
60 polymorphic_allocator<_Key>>;
61 template<
typename _Key,
typename _Hash = std::hash<_Key>,
62 typename _Pred = std::equal_to<_Key>>
63 using unordered_multiset
65 polymorphic_allocator<_Key>>;
67_GLIBCXX_END_NAMESPACE_VERSION
71#if __cplusplus > 201703L
72namespace std _GLIBCXX_VISIBILITY(default)
74_GLIBCXX_BEGIN_NAMESPACE_VERSION
75 template<
typename _Key,
typename _Hash,
typename _CPred,
typename _Alloc,
78 erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>&
__cont,
81 const _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
83 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
86 template<
typename _Key,
typename _Hash,
typename _CPred,
typename _Alloc,
89 erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
__cont,
92 const _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
94 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
96_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.