1// -*- C++ -*- 2//===------------------------- unordered_map ------------------------------===// 3// 4// The LLVM Compiler Infrastructure 5// 6// This file is dual licensed under the MIT and the University of Illinois Open 7// Source Licenses. See LICENSE.TXT for details. 8// 9//===----------------------------------------------------------------------===// 10 11#ifndef _LIBCPP_EXPERIMENTAL_UNORDERED_MAP 12#define _LIBCPP_EXPERIMENTAL_UNORDERED_MAP 13/* 14 experimental/unordered_map synopsis 15 16// C++1z 17namespace std { 18namespace experimental { 19inline namespace fundamentals_v1 { 20namespace pmr { 21 22 template <class Key, class T, 23 class Hash = hash<Key>, 24 class Pred = equal_to<Key>> 25 using unordered_map = 26 std::unordered_map<Key, T, Hash, Pred, 27 polymorphic_allocator<pair<const Key,T>>>; 28 29 template <class Key, class T, 30 class Hash = hash<Key>, 31 class Pred = equal_to<Key>> 32 using unordered_multimap = 33 std::unordered_multimap<Key, T, Hash, Pred, 34 polymorphic_allocator<pair<const Key,T>>>; 35 36} // namespace pmr 37} // namespace fundamentals_v1 38} // namespace experimental 39} // namespace std 40 41 */ 42 43#include <experimental/__config> 44#include <unordered_map> 45#include <experimental/memory_resource> 46 47#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 48#pragma GCC system_header 49#endif 50 51_LIBCPP_BEGIN_NAMESPACE_LFTS_PMR 52 53template <class _Key, class _Value, 54 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>> 55using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred, 56 polymorphic_allocator<pair<const _Key, _Value>>>; 57 58template <class _Key, class _Value, 59 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>> 60using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred, 61 polymorphic_allocator<pair<const _Key, _Value>>>; 62 63_LIBCPP_END_NAMESPACE_LFTS_PMR 64 65#endif /* _LIBCPP_EXPERIMENTAL_UNORDERED_MAP */ 66