libstdc++-v3/include/std/unordered_set

   1 // <unordered_set> -*- C++ -*-
   2
   3 // Copyright (C) 2007-2022 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 <initializer_list>
  39 #include <bits/unordered_set.h>
  40 #include <bits/range_access.h>
  41 #include <bits/erase_if.h>
  42
  43 #ifdef _GLIBCXX_DEBUG
  44 # include <debug/unordered_set>
  45 #endif
  46
  47 #if __cplusplus >= 201703L
  48 #include <bits/memory_resource.h>
  49 namespace std _GLIBCXX_VISIBILITY(default)
  50 {
  51 _GLIBCXX_BEGIN_NAMESPACE_VERSION
  52   namespace pmr
  53   {
  54     template<typename _Key, typename _Hash = std::hash<_Key>,
  55              typename _Pred = std::equal_to<_Key>>
  56       using unordered_set
  57         = std::unordered_set<_Key, _Hash, _Pred,
  58                              polymorphic_allocator<_Key>>;
  59     template<typename _Key, typename _Hash = std::hash<_Key>,
  60              typename _Pred = std::equal_to<_Key>>
  61       using unordered_multiset
  62         = std::unordered_multiset<_Key, _Hash, _Pred,
  63                                   polymorphic_allocator<_Key>>;
  64   } // namespace pmr
  65 _GLIBCXX_END_NAMESPACE_VERSION
  66 } // namespace std
  67 #endif // C++17
  68
  69 #if __cplusplus > 201703L
  70 namespace std _GLIBCXX_VISIBILITY(default)
  71 {
  72 _GLIBCXX_BEGIN_NAMESPACE_VERSION
  73   template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
  74            typename _Predicate>
  75     inline typename unordered_set<_Key, _Hash, _CPred, _Alloc>::size_type
  76     erase_if(unordered_set<_Key, _Hash, _CPred, _Alloc>& __cont,
  77              _Predicate __pred)
  78     {
  79       const _GLIBCXX_STD_C::unordered_set<_Key, _Hash, _CPred, _Alloc>&
  80         __ucont = __cont;
  81       return __detail::__erase_nodes_if(__cont, __ucont, __pred);
  82     }
  83
  84   template<typename _Key, typename _Hash, typename _CPred, typename _Alloc,
  85            typename _Predicate>
  86     inline typename unordered_multiset<_Key, _Hash, _CPred, _Alloc>::size_type
  87     erase_if(unordered_multiset<_Key, _Hash, _CPred, _Alloc>& __cont,
  88              _Predicate __pred)
  89     {
  90       const _GLIBCXX_STD_C::unordered_multiset<_Key, _Hash, _CPred, _Alloc>&
  91         __ucont = __cont;
  92       return __detail::__erase_nodes_if(__cont, __ucont, __pred);
  93     }
  94 _GLIBCXX_END_NAMESPACE_VERSION
  95 } // namespace std
  96 #endif // C++20
  97
  98 #endif // C++11
  99
 100 #endif // _GLIBCXX_UNORDERED_SET