1// <experimental/unordered_map> -*- C++ -*-
2
3// Copyright (C) 2015-2020 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#pragma GCC system_header
34
35#if __cplusplus >= 201402L
36
37#include <unordered_map>
38#include <bits/erase_if.h>
39#include <experimental/memory_resource>
40
41namespace std _GLIBCXX_VISIBILITY(default)
42{
43_GLIBCXX_BEGIN_NAMESPACE_VERSION
44
45namespace experimental
46{
47inline namespace fundamentals_v2
48{
49  template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
50	   typename _Alloc, typename _Predicate>
51    inline void
52    erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
53	     _Predicate __pred)
54    { std::__detail::__erase_nodes_if(__cont, __pred); }
55
56  template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
57	   typename _Alloc, typename _Predicate>
58    inline void
59    erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
60	     _Predicate __pred)
61    { std::__detail::__erase_nodes_if(__cont, __pred); }
62
63  namespace pmr {
64    template<typename _Key, typename _Tp, typename _Hash = hash<_Key>,
65	     typename _Pred = equal_to<_Key>>
66      using unordered_map
67      = std::unordered_map<_Key, _Tp, _Hash, _Pred,
68		 polymorphic_allocator<pair<const _Key, _Tp>>>;
69
70    template<typename _Key, typename _Tp, typename _Hash = hash<_Key>,
71	     typename _Pred = equal_to<_Key>>
72      using unordered_multimap
73      = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
74		      polymorphic_allocator<pair<const _Key, _Tp>>>;
75  } // namespace pmr
76
77} // namespace fundamentals_v2
78} // namespace experimental
79
80_GLIBCXX_END_NAMESPACE_VERSION
81} // namespace std
82
83#endif // C++14
84
85#endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP
86