1 //===----------------------------------------------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 
10 // <unordered_map>
11 
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
15 
16 // template <class InputIterator>
17 //     unordered_map(InputIterator first, InputIterator last, size_type n,
18 //                   const hasher& hf);
19 
20 #include <unordered_map>
21 #include <string>
22 #include <cassert>
23 #include <cfloat>
24 
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"
31 
32 int main()
33 {
34     {
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> >
39                                    > C;
40         typedef std::pair<int, std::string> P;
41         P a[] =
42         {
43             P(1, "one"),
44             P(2, "two"),
45             P(3, "three"),
46             P(4, "four"),
47             P(1, "four"),
48             P(2, "four"),
49         };
50         C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
51             7,
52             test_hash<std::hash<int> >(8)
53            );
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> >()));
64         assert(!c.empty());
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);
69     }
70 #if __cplusplus >= 201103L
71     {
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> >
76                                    > C;
77         typedef std::pair<int, std::string> P;
78         P a[] =
79         {
80             P(1, "one"),
81             P(2, "two"),
82             P(3, "three"),
83             P(4, "four"),
84             P(1, "four"),
85             P(2, "four"),
86         };
87         C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
88             7,
89             test_hash<std::hash<int> >(8)
90            );
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> >()));
101         assert(!c.empty());
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);
106     }
107 #endif
108 }
109