libstdc++
unordered_set
Go to the documentation of this file.
00001 // <experimental/unordered_set> -*- C++ -*-
00002 
00003 // Copyright (C) 2015-2019 Free Software Foundation, Inc.
00004 //
00005 // This file is part of the GNU ISO C++ Library.  This library is free
00006 // software; you can redistribute it and/or modify it under the
00007 // terms of the GNU General Public License as published by the
00008 // Free Software Foundation; either version 3, or (at your option)
00009 // any later version.
00010 
00011 // This library is distributed in the hope that it will be useful,
00012 // but WITHOUT ANY WARRANTY; without even the implied warranty of
00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00014 // GNU General Public License for more details.
00015 
00016 // Under Section 7 of GPL version 3, you are granted additional
00017 // permissions described in the GCC Runtime Library Exception, version
00018 // 3.1, as published by the Free Software Foundation.
00019 
00020 // You should have received a copy of the GNU General Public License and
00021 // a copy of the GCC Runtime Library Exception along with this program;
00022 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
00023 // <http://www.gnu.org/licenses/>.
00024 
00025 /** @file experimental/unordered_set
00026  *  This is a TS C++ Library header.
00027  */
00028 
00029 #ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_SET
00030 #define _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 1
00031 
00032 #pragma GCC system_header
00033 
00034 #if __cplusplus >= 201402L
00035 
00036 #include <unordered_set>
00037 #include <bits/erase_if.h>
00038 #include <experimental/memory_resource>
00039 
00040 namespace std _GLIBCXX_VISIBILITY(default)
00041 {
00042 _GLIBCXX_BEGIN_NAMESPACE_VERSION
00043 
00044 namespace experimental
00045 {
00046 inline namespace fundamentals_v2
00047 {
00048   template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
00049            typename _Predicate>
00050     inline void
00051     erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
00052              _Predicate __pred)
00053     { std::__detail::__erase_nodes_if(__cont, __pred); }
00054 
00055   template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
00056            typename _Predicate>
00057     inline void
00058     erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
00059              _Predicate __pred)
00060     { std::__detail::__erase_nodes_if(__cont, __pred); }
00061 
00062   namespace pmr {
00063     template<typename _Key, typename _Hash = hash<_Key>,
00064              typename _Pred = equal_to<_Key>>
00065       using unordered_set
00066       = std::unordered_set<_Key, _Hash, _Pred, polymorphic_allocator<_Key>>;
00067 
00068     template<typename _Key, typename _Hash = hash<_Key>,
00069              typename _Pred = equal_to<_Key>>
00070       using unordered_multiset
00071       = std::unordered_multiset<_Key, _Hash, _Pred,
00072                                 polymorphic_allocator<_Key>>;
00073   } // namespace pmr
00074 
00075 } // namespace fundamentals_v2
00076 } // namespace experimental
00077 
00078 _GLIBCXX_END_NAMESPACE_VERSION
00079 } // namespace std
00080 
00081 #endif // C++14
00082 
00083 #endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_SET