1// <unordered_set> -*- C++ -*-
3// Copyright (C) 2007-2025 Free Software Foundation, Inc.
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)
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.
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.
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/>.
25/** @file include/unordered_set
26 * This is a Standard C++ Library header.
29#ifndef _GLIBCXX_UNORDERED_SET
30#define _GLIBCXX_UNORDERED_SET 1
33#pragma GCC system_header
36#include <bits/requires_hosted.h> // containers
38#if __cplusplus < 201103L
39# include <bits/c++0x_warning.h>
42#include <initializer_list>
43#include <bits/unordered_set.h>
44#include <bits/range_access.h>
45#include <bits/erase_if.h>
48# include <debug/unordered_set>
51#define __glibcxx_want_allocator_traits_is_always_equal
52#define __glibcxx_want_erase_if
53#define __glibcxx_want_generic_unordered_lookup
54#define __glibcxx_want_node_extract
55#define __glibcxx_want_nonmember_container_access
56#include <bits/version.h>
58#if __cplusplus >= 201703L
59#include <bits/memory_resource.h>
60namespace std _GLIBCXX_VISIBILITY(default)
62_GLIBCXX_BEGIN_NAMESPACE_VERSION
65 template<typename _Key, typename _Hash = std::hash<_Key>,
66 typename _Pred = std::equal_to<_Key>>
68 = std::unordered_set<_Key, _Hash, _Pred,
69 polymorphic_allocator<_Key>>;
70 template<typename _Key, typename _Hash = std::hash<_Key>,
71 typename _Pred = std::equal_to<_Key>>
72 using unordered_multiset
73 = std::unordered_multiset<_Key, _Hash, _Pred,
74 polymorphic_allocator<_Key>>;
76_GLIBCXX_END_NAMESPACE_VERSION
80#if __cplusplus > 201703L
81namespace std _GLIBCXX_VISIBILITY(default)
83_GLIBCXX_BEGIN_NAMESPACE_VERSION
84 template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
86 inline typename unordered_set<_Key, _Hash, _CPred, _Alloc>::size_type
87 erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
90 _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
92 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
95 template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
97 inline typename unordered_multiset<_Key, _Hash, _CPred, _Alloc>::size_type
98 erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
101 _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
103 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
105_GLIBCXX_END_NAMESPACE_VERSION
111#endif // _GLIBCXX_UNORDERED_SET