libstdc++-v3/include/experimental/unordered_map

   1 // <experimental/unordered_map> -*- C++ -*-
   2
   3 // Copyright (C) 2015-2025 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_map
  26  *  This is a TS C++ Library header.
  27  *  @ingroup libfund-ts
  28  */
  29
  30 #ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP
  31 #define _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP 1
  32
  33 #ifdef _GLIBCXX_SYSHDR
  34 #pragma GCC system_header
  35 #endif
  36
  37 #include <bits/requires_hosted.h> // experimental is currently omitted
  38
  39 #if __cplusplus >= 201402L
  40
  41 #include <unordered_map>
  42 #include <bits/erase_if.h>
  43 #include <experimental/memory_resource>
  44
  45 namespace std _GLIBCXX_VISIBILITY(default)
  46 {
  47 _GLIBCXX_BEGIN_NAMESPACE_VERSION
  48
  49 namespace experimental
  50 {
  51 inline namespace fundamentals_v2
  52 {
  53   template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
  54            typename _Alloc, typename _Predicate>
  55     inline void
  56     erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
  57              _Predicate __pred)
  58     {
  59       _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
  60         __ucont = __cont;
  61       std::__detail::__erase_nodes_if(__cont, __ucont, __pred);
  62     }
  63
  64   template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
  65            typename _Alloc, typename _Predicate>
  66     inline void
  67     erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
  68              _Predicate __pred)
  69     {
  70       _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
  71         __ucont = __cont;
  72       std::__detail::__erase_nodes_if(__cont, __ucont, __pred);
  73     }
  74
  75   namespace pmr {
  76     template<typename _Key, typename _Tp, typename _Hash = hash<_Key>,
  77              typename _Pred = equal_to<_Key>>
  78       using unordered_map
  79       = std::unordered_map<_Key, _Tp, _Hash, _Pred,
  80                  polymorphic_allocator<pair<const _Key, _Tp>>>;
  81
  82     template<typename _Key, typename _Tp, typename _Hash = hash<_Key>,
  83              typename _Pred = equal_to<_Key>>
  84       using unordered_multimap
  85       = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
  86                       polymorphic_allocator<pair<const _Key, _Tp>>>;
  87   } // namespace pmr
  88
  89 } // namespace fundamentals_v2
  90 } // namespace experimental
  91
  92 _GLIBCXX_END_NAMESPACE_VERSION
  93 } // namespace std
  94
  95 #endif // C++14
  96
  97 #endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP