libstdc++
|
00001 // <experimental/unordered_map> -*- C++ -*- 00002 00003 // Copyright (C) 2015-2016 Free Software Foundation, Inc. 00004 // 00005 // This file is part of the GNU ISO C++ Library. This library is free 00006 // software; you can redistribute it and/or modify it under the 00007 // terms of the GNU General Public License as published by the 00008 // Free Software Foundation; either version 3, or (at your option) 00009 // any later version. 00010 00011 // This library is distributed in the hope that it will be useful, 00012 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00014 // GNU General Public License for more details. 00015 00016 // Under Section 7 of GPL version 3, you are granted additional 00017 // permissions described in the GCC Runtime Library Exception, version 00018 // 3.1, as published by the Free Software Foundation. 00019 00020 // You should have received a copy of the GNU General Public License and 00021 // a copy of the GCC Runtime Library Exception along with this program; 00022 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 00023 // <http://www.gnu.org/licenses/>. 00024 00025 /** @file experimental/unordered_map 00026 * This is a TS C++ Library header. 00027 */ 00028 00029 #ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP 00030 #define _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP 1 00031 00032 #pragma GCC system_header 00033 00034 #if __cplusplus <= 201103L 00035 # include <bits/c++14_warning.h> 00036 #else 00037 00038 #include <unordered_map> 00039 #include <experimental/bits/erase_if.h> 00040 #include <experimental/memory_resource> 00041 00042 namespace std _GLIBCXX_VISIBILITY(default) 00043 { 00044 namespace experimental 00045 { 00046 inline namespace fundamentals_v2 00047 { 00048 _GLIBCXX_BEGIN_NAMESPACE_VERSION 00049 00050 template<typename _Key, typename _Tp, typename _Hash, typename _CPred, 00051 typename _Alloc, typename _Predicate> 00052 inline void 00053 erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont, 00054 _Predicate __pred) 00055 { __detail::__erase_nodes_if(__cont, __pred); } 00056 00057 template<typename _Key, typename _Tp, typename _Hash, typename _CPred, 00058 typename _Alloc, typename _Predicate> 00059 inline void 00060 erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont, 00061 _Predicate __pred) 00062 { __detail::__erase_nodes_if(__cont, __pred); } 00063 00064 _GLIBCXX_END_NAMESPACE_VERSION 00065 00066 namespace pmr { 00067 _GLIBCXX_BEGIN_NAMESPACE_VERSION 00068 00069 template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, 00070 typename _Pred = equal_to<_Key>> 00071 using unordered_map 00072 = std::unordered_map<_Key, _Tp, _Hash, _Pred, 00073 polymorphic_allocator<pair<const _Key, _Tp>>>; 00074 00075 template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, 00076 typename _Pred = equal_to<_Key>> 00077 using unordered_multimap 00078 = std::unordered_multimap<_Key, _Tp, _Hash, _Pred, 00079 polymorphic_allocator<pair<const _Key, _Tp>>>; 00080 00081 _GLIBCXX_END_NAMESPACE_VERSION 00082 } // namespace pmr 00083 00084 } // namespace fundamentals_v2 00085 } // namespace experimental 00086 } // namespace std 00087 00088 #endif // C++14 00089 00090 #endif // _GLIBCXX_EXPERIMENTAL_UNORDERED_MAP