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,
18 // const hasher& hf, const key_equal& eql,
19 // const allocator_type& a);
21 #include <unordered_map>
26 #include "test_iterators.h"
27 #include "../../../NotConstructible.h"
28 #include "../../../test_compare.h"
29 #include "../../../test_hash.h"
30 #include "test_allocator.h"
31 #include "min_allocator.h"
36 typedef std::unordered_map<int, std::string,
37 test_hash<std::hash<int> >,
38 test_compare<std::equal_to<int> >,
39 test_allocator<std::pair<const int, std::string> >
41 typedef std::pair<int, std::string> P;
51 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
53 test_hash<std::hash<int> >(8),
54 test_compare<std::equal_to<int> >(9),
55 test_allocator<std::pair<const int, std::string> >(10)
57 assert(c.bucket_count() == 7);
58 assert(c.size() == 4);
59 assert(c.at(1) == "one");
60 assert(c.at(2) == "two");
61 assert(c.at(3) == "three");
62 assert(c.at(4) == "four");
63 assert(c.hash_function() == test_hash<std::hash<int> >(8));
64 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
65 assert(c.get_allocator() ==
66 (test_allocator<std::pair<const int, std::string> >(10)));
68 assert(std::distance(c.begin(), c.end()) == c.size());
69 assert(std::distance(c.cbegin(), c.cend()) == c.size());
70 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
71 assert(c.max_load_factor() == 1);
73 #if __cplusplus >= 201103L
75 typedef std::unordered_map<int, std::string,
76 test_hash<std::hash<int> >,
77 test_compare<std::equal_to<int> >,
78 min_allocator<std::pair<const int, std::string> >
80 typedef std::pair<int, std::string> P;
90 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
92 test_hash<std::hash<int> >(8),
93 test_compare<std::equal_to<int> >(9),
94 min_allocator<std::pair<const int, std::string> >()
96 assert(c.bucket_count() == 7);
97 assert(c.size() == 4);
98 assert(c.at(1) == "one");
99 assert(c.at(2) == "two");
100 assert(c.at(3) == "three");
101 assert(c.at(4) == "four");
102 assert(c.hash_function() == test_hash<std::hash<int> >(8));
103 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
104 assert(c.get_allocator() ==
105 (min_allocator<std::pair<const int, std::string> >()));
107 assert(std::distance(c.begin(), c.end()) == c.size());
108 assert(std::distance(c.cbegin(), c.cend()) == c.size());
109 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
110 assert(c.max_load_factor() == 1);