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);
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
33int main(int, char**)
34{
35 {
36 typedef std::unordered_map<int, std::string,
37 test_hash<int>,
38 test_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(cpp17_input_iterator<P*>(a), cpp17_input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
52 assert(c.bucket_count() >= 5);
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<int>());
59 assert(c.key_eq() == test_equal_to<int>());
60 assert(c.get_allocator() ==
61 (test_allocator<std::pair<const int, std::string> >()));
62 assert(!c.empty());
63 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
64 assert(static_cast<std::size_t>(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 TEST_STD_VER >= 11
69 {
70 typedef std::unordered_map<int, std::string,
71 test_hash<int>,
72 test_equal_to<int>,
73 min_allocator<std::pair<const int, std::string> >
74 > C;
75 typedef std::pair<int, std::string> P;
76 P a[] =
77 {
78 P(1, "one"),
79 P(2, "two"),
80 P(3, "three"),
81 P(4, "four"),
82 P(1, "four"),
83 P(2, "four"),
84 };
85 C c(cpp17_input_iterator<P*>(a), cpp17_input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
86 assert(c.bucket_count() >= 5);
87 assert(c.size() == 4);
88 assert(c.at(1) == "one");
89 assert(c.at(2) == "two");
90 assert(c.at(3) == "three");
91 assert(c.at(4) == "four");
92 assert(c.hash_function() == test_hash<int>());
93 assert(c.key_eq() == test_equal_to<int>());
94 assert(c.get_allocator() ==
95 (min_allocator<std::pair<const int, std::string> >()));
96 assert(!c.empty());
97 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
98 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
99 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
100 assert(c.max_load_factor() == 1);
101 }
102#if TEST_STD_VER > 11
103 {
104 typedef std::pair<int, std::string> P;
105 typedef test_allocator<std::pair<const int, std::string>> A;
106 typedef test_hash<int> HF;
107 typedef test_equal_to<int> Comp;
108 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
109
110 P arr[] =
111 {
112 P(1, "one"),
113 P(2, "two"),
114 P(3, "three"),
115 P(4, "four"),
116 P(1, "four"),
117 P(2, "four"),
118 };
119 C c(cpp17_input_iterator<P*>(arr), cpp17_input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14);
120 assert(c.bucket_count() >= 14);
121 assert(c.size() == 4);
122 assert(c.at(1) == "one");
123 assert(c.at(2) == "two");
124 assert(c.at(3) == "three");
125 assert(c.at(4) == "four");
126 assert(c.hash_function() == HF());
127 assert(c.key_eq() == Comp());
128 assert(c.get_allocator() == A());
129 assert(!c.empty());
130 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
131 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
132 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
133 assert(c.max_load_factor() == 1);
134 }
135 {
136 typedef std::pair<int, std::string> P;
137 typedef test_allocator<std::pair<const int, std::string>> A;
138 typedef test_hash<int> HF;
139 typedef test_equal_to<int> Comp;
140 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
141
142 P arr[] =
143 {
144 P(1, "one"),
145 P(2, "two"),
146 P(3, "three"),
147 P(4, "four"),
148 P(1, "four"),
149 P(2, "four"),
150 };
151 HF hf(42);
152 A a(43);
153 C c(cpp17_input_iterator<P*>(arr), cpp17_input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a);
154 assert(c.bucket_count() >= 14);
155 assert(c.size() == 4);
156 assert(c.at(1) == "one");
157 assert(c.at(2) == "two");
158 assert(c.at(3) == "three");
159 assert(c.at(4) == "four");
160 assert(c.hash_function() == hf);
161 assert(!(c.hash_function() == HF()));
162 assert(c.key_eq() == Comp());
163 assert(c.get_allocator() == a);
164 assert(!c.empty());
165 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
166 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
167 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
168 assert(c.max_load_factor() == 1);
169 }
170#endif
171#endif
172
173 return 0;
174}
175

source code of libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/iter_iter.pass.cpp