libstdc++
experimental/unordered_set
Go to the documentation of this file.
1 // <experimental/unordered_set> -*- C++ -*-
2 
3 // Copyright (C) 2015-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 experimental/unordered_set
26  * This is a TS C++ Library header.
27  * @ingroup libfund-ts
28  */
29 
30 #ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_SET
31 #define _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 1
32 
33 #pragma GCC system_header
34 
35 #include <bits/requires_hosted.h> // experimental is currently omitted
36 
37 #if __cplusplus >= 201402L
38 
39 #include <unordered_set>
40 #include <bits/erase_if.h>
41 #include <experimental/memory_resource>
42 
43 namespace std _GLIBCXX_VISIBILITY(default)
44 {
45 _GLIBCXX_BEGIN_NAMESPACE_VERSION
46 
47 namespace experimental
48 {
49 inline namespace fundamentals_v2
50 {
51  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
52  typename _Predicate>
53  inline void
54  erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
55  _Predicate __pred)
56  {
57  _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
58  __ucont = __cont;
59  std::__detail::__erase_nodes_if(__cont, __ucont, __pred);
60  }
61 
62  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
63  typename _Predicate>
64  inline void
65  erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
66  _Predicate __pred)
67  {
68  _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
69  __ucont = __cont;
70  std::__detail::__erase_nodes_if(__cont, __ucont, __pred);
71  }
72 
73  namespace pmr {
74  template<typename _Key, typename _Hash = hash<_Key>,
75  typename _Pred = equal_to<_Key>>
76  using unordered_set
77  = std::unordered_set<_Key, _Hash, _Pred, polymorphic_allocator<_Key>>;
78 
79  template<typename _Key, typename _Hash = hash<_Key>,
80  typename _Pred = equal_to<_Key>>
81  using unordered_multiset
82  = std::unordered_multiset<_Key, _Hash, _Pred,
83  polymorphic_allocator<_Key>>;
84  } // namespace pmr
85 
86 } // namespace fundamentals_v2
87 } // namespace experimental
88 
89 _GLIBCXX_END_NAMESPACE_VERSION
90 } // namespace std
91 
92 #endif // C++14
93 
94 #endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_SET