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 // unordered_map(initializer_list<value_type> il, size_type n,
17 // const hasher& hf, const key_equal& eql, const allocator_type& a);
18
19 #include <unordered_map>
20 #include <string>
21 #include <cassert>
22 #include <cfloat>
23
24 #include "../../../test_compare.h"
25 #include "../../../test_hash.h"
26 #include "test_allocator.h"
27 #include "min_allocator.h"
28
main()29 int main()
30 {
31 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
32 {
33 typedef std::unordered_map<int, std::string,
34 test_hash<std::hash<int> >,
35 test_compare<std::equal_to<int> >,
36 test_allocator<std::pair<const int, std::string> >
37 > C;
38 typedef std::pair<int, std::string> P;
39 C c({
40 P(1, "one"),
41 P(2, "two"),
42 P(3, "three"),
43 P(4, "four"),
44 P(1, "four"),
45 P(2, "four"),
46 },
47 7,
48 test_hash<std::hash<int> >(8),
49 test_compare<std::equal_to<int> >(9),
50 test_allocator<std::pair<const int, std::string> >(10)
51 );
52 assert(c.bucket_count() == 7);
53 assert(c.size() == 4);
54 assert(c.at(1) == "one");
55 assert(c.at(2) == "two");
56 assert(c.at(3) == "three");
57 assert(c.at(4) == "four");
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
59 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
60 assert(c.get_allocator() ==
61 (test_allocator<std::pair<const int, std::string> >(10)));
62 assert(!c.empty());
63 assert(std::distance(c.begin(), c.end()) == c.size());
64 assert(std::distance(c.cbegin(), c.cend()) == c.size());
65 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
66 assert(c.max_load_factor() == 1);
67 }
68 #if __cplusplus >= 201103L
69 {
70 typedef std::unordered_map<int, std::string,
71 test_hash<std::hash<int> >,
72 test_compare<std::equal_to<int> >,
73 min_allocator<std::pair<const int, std::string> >
74 > C;
75 typedef std::pair<int, std::string> P;
76 C c({
77 P(1, "one"),
78 P(2, "two"),
79 P(3, "three"),
80 P(4, "four"),
81 P(1, "four"),
82 P(2, "four"),
83 },
84 7,
85 test_hash<std::hash<int> >(8),
86 test_compare<std::equal_to<int> >(9),
87 min_allocator<std::pair<const int, std::string> >()
88 );
89 assert(c.bucket_count() == 7);
90 assert(c.size() == 4);
91 assert(c.at(1) == "one");
92 assert(c.at(2) == "two");
93 assert(c.at(3) == "three");
94 assert(c.at(4) == "four");
95 assert(c.hash_function() == test_hash<std::hash<int> >(8));
96 assert(c.key_eq() == test_compare<std::equal_to<int> >(9));
97 assert(c.get_allocator() ==
98 (min_allocator<std::pair<const int, std::string> >()));
99 assert(!c.empty());
100 assert(std::distance(c.begin(), c.end()) == c.size());
101 assert(std::distance(c.cbegin(), c.cend()) == c.size());
102 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
103 assert(c.max_load_factor() == 1);
104 }
105 #endif
106 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
107 }
108