libstdc++
unordered_set
Go to the documentation of this file.
1 // <unordered_set> -*- C++ -*-
2 
3 // Copyright (C) 2007-2024 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
9 // any later version.
10 
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
15 
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
19 
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
24 
25 /** @file include/unordered_set
26  * This is a Standard C++ Library header.
27  */
28 
29 #ifndef _GLIBCXX_UNORDERED_SET
30 #define _GLIBCXX_UNORDERED_SET 1
31 
32 #pragma GCC system_header
33 
34 #include <bits/requires_hosted.h> // containers
35 
36 #if __cplusplus < 201103L
37 # include <bits/c++0x_warning.h>
38 #else
39 
40 #include <initializer_list>
41 #include <bits/unordered_set.h>
42 #include <bits/range_access.h>
43 #include <bits/erase_if.h>
44 
45 #ifdef _GLIBCXX_DEBUG
46 # include <debug/unordered_set>
47 #endif
48 
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
54 #include <bits/version.h>
55 
56 #if __cplusplus >= 201703L
57 #include <bits/memory_resource.h>
58 namespace std _GLIBCXX_VISIBILITY(default)
59 {
60 _GLIBCXX_BEGIN_NAMESPACE_VERSION
61  namespace pmr
62  {
63  template<typename _Key, typename _Hash = std::hash<_Key>,
64  typename _Pred = std::equal_to<_Key>>
65  using unordered_set
66  = std::unordered_set<_Key, _Hash, _Pred,
67  polymorphic_allocator<_Key>>;
68  template<typename _Key, typename _Hash = std::hash<_Key>,
69  typename _Pred = std::equal_to<_Key>>
70  using unordered_multiset
71  = std::unordered_multiset<_Key, _Hash, _Pred,
72  polymorphic_allocator<_Key>>;
73  } // namespace pmr
74 _GLIBCXX_END_NAMESPACE_VERSION
75 } // namespace std
76 #endif // C++17
77 
78 #if __cplusplus > 201703L
79 namespace std _GLIBCXX_VISIBILITY(default)
80 {
81 _GLIBCXX_BEGIN_NAMESPACE_VERSION
82  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
83  typename _Predicate>
84  inline typename unordered_set<_Key, _Hash, _CPred, _Alloc>::size_type
85  erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
86  _Predicate __pred)
87  {
88  _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
89  __ucont = __cont;
90  return __detail::__erase_nodes_if(__cont, __ucont, __pred);
91  }
92 
93  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
94  typename _Predicate>
95  inline typename unordered_multiset<_Key, _Hash, _CPred, _Alloc>::size_type
96  erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
97  _Predicate __pred)
98  {
99  _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
100  __ucont = __cont;
101  return __detail::__erase_nodes_if(__cont, __ucont, __pred);
102  }
103 _GLIBCXX_END_NAMESPACE_VERSION
104 } // namespace std
105 #endif // C++20
106 
107 #endif // C++11
108 
109 #endif // _GLIBCXX_UNORDERED_SET