1*38fd1498Szrj// <experimental/unordered_set> -*- C++ -*- 2*38fd1498Szrj 3*38fd1498Szrj// Copyright (C) 2015-2018 Free Software Foundation, Inc. 4*38fd1498Szrj// 5*38fd1498Szrj// This file is part of the GNU ISO C++ Library. This library is free 6*38fd1498Szrj// software; you can redistribute it and/or modify it under the 7*38fd1498Szrj// terms of the GNU General Public License as published by the 8*38fd1498Szrj// Free Software Foundation; either version 3, or (at your option) 9*38fd1498Szrj// any later version. 10*38fd1498Szrj 11*38fd1498Szrj// This library is distributed in the hope that it will be useful, 12*38fd1498Szrj// but WITHOUT ANY WARRANTY; without even the implied warranty of 13*38fd1498Szrj// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14*38fd1498Szrj// GNU General Public License for more details. 15*38fd1498Szrj 16*38fd1498Szrj// Under Section 7 of GPL version 3, you are granted additional 17*38fd1498Szrj// permissions described in the GCC Runtime Library Exception, version 18*38fd1498Szrj// 3.1, as published by the Free Software Foundation. 19*38fd1498Szrj 20*38fd1498Szrj// You should have received a copy of the GNU General Public License and 21*38fd1498Szrj// a copy of the GCC Runtime Library Exception along with this program; 22*38fd1498Szrj// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 23*38fd1498Szrj// <http://www.gnu.org/licenses/>. 24*38fd1498Szrj 25*38fd1498Szrj/** @file experimental/unordered_set 26*38fd1498Szrj * This is a TS C++ Library header. 27*38fd1498Szrj */ 28*38fd1498Szrj 29*38fd1498Szrj#ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 30*38fd1498Szrj#define _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 1 31*38fd1498Szrj 32*38fd1498Szrj#pragma GCC system_header 33*38fd1498Szrj 34*38fd1498Szrj#if __cplusplus >= 201402L 35*38fd1498Szrj 36*38fd1498Szrj#include <unordered_set> 37*38fd1498Szrj#include <experimental/bits/erase_if.h> 38*38fd1498Szrj#include <experimental/memory_resource> 39*38fd1498Szrj 40*38fd1498Szrjnamespace std _GLIBCXX_VISIBILITY(default) 41*38fd1498Szrj{ 42*38fd1498Szrj_GLIBCXX_BEGIN_NAMESPACE_VERSION 43*38fd1498Szrj 44*38fd1498Szrjnamespace experimental 45*38fd1498Szrj{ 46*38fd1498Szrjinline namespace fundamentals_v2 47*38fd1498Szrj{ 48*38fd1498Szrj template<typename _Key, typename _Hash, typename _CPred, typename _Alloc, 49*38fd1498Szrj typename _Predicate> 50*38fd1498Szrj inline void 51*38fd1498Szrj erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont, 52*38fd1498Szrj _Predicate __pred) 53*38fd1498Szrj { __detail::__erase_nodes_if(__cont, __pred); } 54*38fd1498Szrj 55*38fd1498Szrj template<typename _Key, typename _Hash, typename _CPred, typename _Alloc, 56*38fd1498Szrj typename _Predicate> 57*38fd1498Szrj inline void 58*38fd1498Szrj erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont, 59*38fd1498Szrj _Predicate __pred) 60*38fd1498Szrj { __detail::__erase_nodes_if(__cont, __pred); } 61*38fd1498Szrj 62*38fd1498Szrj namespace pmr { 63*38fd1498Szrj template<typename _Key, typename _Hash = hash<_Key>, 64*38fd1498Szrj typename _Pred = equal_to<_Key>> 65*38fd1498Szrj using unordered_set 66*38fd1498Szrj = std::unordered_set<_Key, _Hash, _Pred, polymorphic_allocator<_Key>>; 67*38fd1498Szrj 68*38fd1498Szrj template<typename _Key, typename _Hash = hash<_Key>, 69*38fd1498Szrj typename _Pred = equal_to<_Key>> 70*38fd1498Szrj using unordered_multiset 71*38fd1498Szrj = std::unordered_multiset<_Key, _Hash, _Pred, 72*38fd1498Szrj polymorphic_allocator<_Key>>; 73*38fd1498Szrj } // namespace pmr 74*38fd1498Szrj 75*38fd1498Szrj} // namespace fundamentals_v2 76*38fd1498Szrj} // namespace experimental 77*38fd1498Szrj 78*38fd1498Szrj_GLIBCXX_END_NAMESPACE_VERSION 79*38fd1498Szrj} // namespace std 80*38fd1498Szrj 81*38fd1498Szrj#endif // C++14 82*38fd1498Szrj 83*38fd1498Szrj#endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 84