1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
14 // class unordered_multimap
16 // float load_factor() const
18 #include <unordered_map>
24 #include "min_allocator.h"
29 typedef std::unordered_multimap<int, std::string> C;
30 typedef std::pair<int, std::string> P;
42 const C c(std::begin(a), std::end(a));
43 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
46 typedef std::unordered_multimap<int, std::string> C;
47 typedef std::pair<int, std::string> P;
49 assert(c.load_factor() == 0);
51 #if __cplusplus >= 201103L
53 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
54 min_allocator<std::pair<const int, std::string>>> C;
55 typedef std::pair<int, std::string> P;
67 const C c(std::begin(a), std::end(a));
68 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
71 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
72 min_allocator<std::pair<const int, std::string>>> C;
73 typedef std::pair<int, std::string> P;
75 assert(c.load_factor() == 0);