1// <experimental/unordered_set> -*- C++ -*-
2
3// Copyright (C) 2015-2016 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 */
28
29#ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_SET
30#define _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 1
31
32#pragma GCC system_header
33
34#if __cplusplus <= 201103L
35# include <bits/c++14_warning.h>
36#else
37
38#include <unordered_set>
39#include <experimental/bits/erase_if.h>
40#include <experimental/memory_resource>
41
42namespace std _GLIBCXX_VISIBILITY(default)
43{
44namespace experimental
45{
46inline namespace fundamentals_v2
47{
48_GLIBCXX_BEGIN_NAMESPACE_VERSION
49
50  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
51	   typename _Predicate>
52    inline void
53    erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
54	     _Predicate __pred)
55    { __detail::__erase_nodes_if(__cont, __pred); }
56
57  template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
58	   typename _Predicate>
59    inline void
60    erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
61	     _Predicate __pred)
62    { __detail::__erase_nodes_if(__cont, __pred); }
63
64_GLIBCXX_END_NAMESPACE_VERSION
65
66namespace pmr {
67_GLIBCXX_BEGIN_NAMESPACE_VERSION
68
69  template<typename _Key, typename _Hash = hash<_Key>,
70	   typename _Pred = equal_to<_Key>>
71    using unordered_set
72      = std::unordered_set<_Key, _Hash, _Pred, polymorphic_allocator<_Key>>;
73
74  template<typename _Key, typename _Hash = hash<_Key>,
75	   typename _Pred = equal_to<_Key>>
76    using unordered_multiset
77      = std::unordered_multiset<_Key, _Hash, _Pred,
78				polymorphic_allocator<_Key>>;
79
80_GLIBCXX_END_NAMESPACE_VERSION
81} // namespace pmr
82
83} // namespace fundamentals_v2
84} // namespace experimental
85} // namespace std
86
87#endif // C++14
88
89#endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_SET
90