summaryrefslogtreecommitdiffstats
path: root/Utilities/std/cm/unordered_map
blob: 5b8a456fde3e024608de686eef9041b8261bcec8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// -*-c++-*-
// vim: set ft=cpp:

/* Distributed under the OSI-approved BSD 3-Clause License.  See accompanying
   file Copyright.txt or https://cmake.org/licensing for details.  */
#ifndef cm_unordered_map
#define cm_unordered_map

#include <unordered_map> // IWYU pragma: export

#include <cm/bits/erase_if.hxx>

namespace cm {

// should be updated when C++20 is finalized
#if (__cplusplus > 201703L ||                                                 \
     (defined(_MSVC_LANG) && _MSVC_LANG > 201703)) &&                         \
  defined(__cpp_lib_erase_if)

using std::erase_if;

#else

template <typename Key, typename T, typename Hash, typename KeyEqual,
          typename Allocator, typename Predicate>
inline void erase_if(
  std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& cont, Predicate pred)
{
  internals::erase_if(cont, pred);
}

template <typename Key, typename T, typename Hash, typename KeyEqual,
          typename Allocator, typename Predicate>
inline void erase_if(
  std::unordered_multimap<Key, T, Hash, KeyEqual, Allocator>& cont,
  Predicate pred)
{
  internals::erase_if(cont, pred);
}

#endif

} // namespace cm

#endif