libstdc++
unordered_set
Go to the documentation of this file.
1 // <unordered_set> -*- C++ -*-
2 
3 // Copyright (C) 2007-2023 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 #if __cplusplus >= 201703L
50 #include <bits/memory_resource.h>
51 namespace std _GLIBCXX_VISIBILITY(default)
52 {
53 _GLIBCXX_BEGIN_NAMESPACE_VERSION
54  namespace pmr
55  {
56  template<typename _Key, typename _Hash = std::hash<_Key>,
57  typename _Pred = std::equal_to<_Key>>
58  using unordered_set
59  = std::unordered_set<_Key, _Hash, _Pred,
60  polymorphic_allocator<_Key>>;
61  template<typename _Key, typename _Hash = std::hash<_Key>,
62  typename _Pred = std::equal_to<_Key>>
63  using unordered_multiset
64  = std::unordered_multiset<_Key, _Hash, _Pred,
65  polymorphic_allocator<_Key>>;
66  } // namespace pmr
67 _GLIBCXX_END_NAMESPACE_VERSION
68 } // namespace std
69 #endif // C++17
70 
71 #if __cplusplus > 201703L
72 namespace std _GLIBCXX_VISIBILITY(default)
73 {
74 _GLIBCXX_BEGIN_NAMESPACE_VERSION
75  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
76  typename _Predicate>
77  inline typename unordered_set<_Key, _Hash, _CPred, _Alloc>::size_type
78  erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
79  _Predicate __pred)
80  {
81  _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
82  __ucont = __cont;
83  return __detail::__erase_nodes_if(__cont, __ucont, __pred);
84  }
85 
86  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
87  typename _Predicate>
88  inline typename unordered_multiset<_Key, _Hash, _CPred, _Alloc>::size_type
89  erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
90  _Predicate __pred)
91  {
92  _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
93  __ucont = __cont;
94  return __detail::__erase_nodes_if(__cont, __ucont, __pred);
95  }
96 _GLIBCXX_END_NAMESPACE_VERSION
97 } // namespace std
98 #endif // C++20
99 
100 #endif // C++11
101 
102 #endif // _GLIBCXX_UNORDERED_SET