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_map
16 // template <class InputIterator>
17 // unordered_map(InputIterator first, InputIterator last, size_type n,
20 #include <unordered_map>
25 #include "test_iterators.h"
26 #include "../../../NotConstructible.h"
27 #include "../../../test_compare.h"
28 #include "../../../test_hash.h"
29 #include "test_allocator.h"
30 #include "min_allocator.h"
35 typedef std::unordered_map<int, std::string,
36 test_hash<std::hash<int> >,
37 test_compare<std::equal_to<int> >,
38 test_allocator<std::pair<const int, std::string> >
40 typedef std::pair<int, std::string> P;
50 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
52 test_hash<std::hash<int> >(8)
54 assert(c.bucket_count() == 7);
55 assert(c.size() == 4);
56 assert(c.at(1) == "one");
57 assert(c.at(2) == "two");
58 assert(c.at(3) == "three");
59 assert(c.at(4) == "four");
60 assert(c.hash_function() == test_hash<std::hash<int> >(8));
61 assert(c.key_eq() == test_compare<std::equal_to<int> >());
62 assert(c.get_allocator() ==
63 (test_allocator<std::pair<const int, std::string> >()));
65 assert(std::distance(c.begin(), c.end()) == c.size());
66 assert(std::distance(c.cbegin(), c.cend()) == c.size());
67 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
68 assert(c.max_load_factor() == 1);
70 #if __cplusplus >= 201103L
72 typedef std::unordered_map<int, std::string,
73 test_hash<std::hash<int> >,
74 test_compare<std::equal_to<int> >,
75 min_allocator<std::pair<const int, std::string> >
77 typedef std::pair<int, std::string> P;
87 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
89 test_hash<std::hash<int> >(8)
91 assert(c.bucket_count() == 7);
92 assert(c.size() == 4);
93 assert(c.at(1) == "one");
94 assert(c.at(2) == "two");
95 assert(c.at(3) == "three");
96 assert(c.at(4) == "four");
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
98 assert(c.key_eq() == test_compare<std::equal_to<int> >());
99 assert(c.get_allocator() ==
100 (min_allocator<std::pair<const int, std::string> >()));
102 assert(std::distance(c.begin(), c.end()) == c.size());
103 assert(std::distance(c.cbegin(), c.cend()) == c.size());
104 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
105 assert(c.max_load_factor() == 1);