1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8
9 // <unordered_map>
10
11 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
12 // class Alloc = allocator<pair<const Key, T>>>
13 // class unordered_map
14
15 // template <class InputIterator>
16 // unordered_map(InputIterator first, InputIterator last, size_type n);
17
18 #include <unordered_map>
19 #include <string>
20 #include <cassert>
21 #include <cfloat>
22 #include <cmath>
23 #include <cstddef>
24
25 #include "test_macros.h"
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"
32
main(int,char **)33 int main(int, char**)
34 {
35 {
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> >
40 > C;
41 typedef std::pair<int, std::string> P;
42 P a[] =
43 {
44 P(1, "one"),
45 P(2, "two"),
46 P(3, "three"),
47 P(4, "four"),
48 P(1, "four"),
49 P(2, "four"),
50 };
51 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])),
52 10
53 );
54 LIBCPP_ASSERT(c.bucket_count() == 11);
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> >());
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(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
66 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
67 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
68 assert(c.max_load_factor() == 1);
69 }
70 #if TEST_STD_VER >= 11
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 10
89 );
90 LIBCPP_ASSERT(c.bucket_count() == 11);
91 assert(c.size() == 4);
92 assert(c.at(1) == "one");
93 assert(c.at(2) == "two");
94 assert(c.at(3) == "three");
95 assert(c.at(4) == "four");
96 assert(c.hash_function() == test_hash<std::hash<int> >());
97 assert(c.key_eq() == test_compare<std::equal_to<int> >());
98 assert(c.get_allocator() ==
99 (min_allocator<std::pair<const int, std::string> >()));
100 assert(!c.empty());
101 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
102 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
103 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
104 assert(c.max_load_factor() == 1);
105 }
106 #endif
107
108 return 0;
109 }
110