1// <unordered_set> -*- C++ -*-
2
3// Copyright (C) 2007-2019 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#if __cplusplus < 201103L
35# include <bits/c++0x_warning.h>
36#else
37
38#include <type_traits>
39#include <initializer_list>
40#include <bits/allocator.h>
41#include <ext/alloc_traits.h>
42#include <ext/aligned_buffer.h>
43#include <bits/stl_pair.h>
44#include <bits/stl_function.h> // equal_to, _Identity, _Select1st
45#include <bits/functional_hash.h>
46#include <bits/hashtable.h>
47#include <bits/unordered_set.h>
48#include <bits/range_access.h>
49#include <bits/erase_if.h>
50
51#ifdef _GLIBCXX_DEBUG
52# include <debug/unordered_set>
53#endif
54
55#ifdef _GLIBCXX_PROFILE
56# include <profile/unordered_set>
57#endif
58
59#if __cplusplus >= 201703L
60namespace std _GLIBCXX_VISIBILITY(default)
61{
62_GLIBCXX_BEGIN_NAMESPACE_VERSION
63 namespace pmr
64 {
65 template<typename _Tp> class polymorphic_allocator;
66 template<typename _Key, typename _Hash = std::hash<_Key>,
67 typename _Pred = std::equal_to<_Key>>
68 using unordered_set
69 = std::unordered_set<_Key, _Hash, _Pred,
70 polymorphic_allocator<_Key>>;
71 template<typename _Key, typename _Hash = std::hash<_Key>,
72 typename _Pred = std::equal_to<_Key>>
73 using unordered_multiset
74 = std::unordered_multiset<_Key, _Hash, _Pred,
75 polymorphic_allocator<_Key>>;
76 } // namespace pmr
77_GLIBCXX_END_NAMESPACE_VERSION
78} // namespace std
79#endif // C++17
80
81#if __cplusplus > 201703L
82namespace std _GLIBCXX_VISIBILITY(default)
83{
84_GLIBCXX_BEGIN_NAMESPACE_VERSION
85 template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
86 typename _Predicate>
87 inline typename unordered_set<_Key, _Hash, _CPred, _Alloc>::size_type
88 erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
89 _Predicate __pred)
90 { return __detail::__erase_nodes_if(__cont, __pred); }
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 { return __detail::__erase_nodes_if(__cont, __pred); }
98_GLIBCXX_END_NAMESPACE_VERSION
99} // namespace std
100#endif // C++20
101
102#endif // C++11
103
104#endif // _GLIBCXX_UNORDERED_SET
105