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