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