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_multimap
16 // template <class InputIterator>
17 // unordered_multimap(InputIterator first, InputIterator last);
19 #include <unordered_map>
26 #include "test_macros.h"
27 #include "test_iterators.h"
28 #include "../../../NotConstructible.h"
29 #include "../../../test_compare.h"
30 #include "../../../test_hash.h"
31 #include "test_allocator.h"
32 #include "min_allocator.h"
37 typedef std::unordered_multimap<int, std::string,
38 test_hash<std::hash<int> >,
39 test_compare<std::equal_to<int> >,
40 test_allocator<std::pair<const int, std::string> >
42 typedef std::pair<int, std::string> P;
52 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
53 assert(c.bucket_count() >= 7);
54 assert(c.size() == 6);
55 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
56 Eq eq = c.equal_range(1);
57 assert(std::distance(eq.first, eq.second) == 2);
58 C::const_iterator i = eq.first;
59 assert(i->first == 1);
60 assert(i->second == "one");
62 assert(i->first == 1);
63 assert(i->second == "four");
64 eq = c.equal_range(2);
65 assert(std::distance(eq.first, eq.second) == 2);
67 assert(i->first == 2);
68 assert(i->second == "two");
70 assert(i->first == 2);
71 assert(i->second == "four");
73 eq = c.equal_range(3);
74 assert(std::distance(eq.first, eq.second) == 1);
76 assert(i->first == 3);
77 assert(i->second == "three");
78 eq = c.equal_range(4);
79 assert(std::distance(eq.first, eq.second) == 1);
81 assert(i->first == 4);
82 assert(i->second == "four");
83 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
84 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
85 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
86 assert(c.max_load_factor() == 1);
87 assert(c.hash_function() == test_hash<std::hash<int> >());
88 assert(c.key_eq() == test_compare<std::equal_to<int> >());
89 assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >()));
91 #if TEST_STD_VER >= 11
93 typedef std::unordered_multimap<int, std::string,
94 test_hash<std::hash<int> >,
95 test_compare<std::equal_to<int> >,
96 min_allocator<std::pair<const int, std::string> >
98 typedef std::pair<int, std::string> P;
108 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])));
109 assert(c.bucket_count() >= 7);
110 assert(c.size() == 6);
111 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
112 Eq eq = c.equal_range(1);
113 assert(std::distance(eq.first, eq.second) == 2);
114 C::const_iterator i = eq.first;
115 assert(i->first == 1);
116 assert(i->second == "one");
118 assert(i->first == 1);
119 assert(i->second == "four");
120 eq = c.equal_range(2);
121 assert(std::distance(eq.first, eq.second) == 2);
123 assert(i->first == 2);
124 assert(i->second == "two");
126 assert(i->first == 2);
127 assert(i->second == "four");
129 eq = c.equal_range(3);
130 assert(std::distance(eq.first, eq.second) == 1);
132 assert(i->first == 3);
133 assert(i->second == "three");
134 eq = c.equal_range(4);
135 assert(std::distance(eq.first, eq.second) == 1);
137 assert(i->first == 4);
138 assert(i->second == "four");
139 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
140 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
141 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
142 assert(c.max_load_factor() == 1);
143 assert(c.hash_function() == test_hash<std::hash<int> >());
144 assert(c.key_eq() == test_compare<std::equal_to<int> >());
145 assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >()));
147 #if TEST_STD_VER > 11
149 typedef std::pair<int, std::string> P;
150 typedef test_allocator<std::pair<const int, std::string>> A;
151 typedef test_hash<std::hash<int>> HF;
152 typedef test_compare<std::equal_to<int>> Comp;
153 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C;
165 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, a);
166 assert(c.bucket_count() >= 14);
167 assert(c.size() == 6);
168 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
169 Eq eq = c.equal_range(1);
170 assert(std::distance(eq.first, eq.second) == 2);
171 C::const_iterator i = eq.first;
172 assert(i->first == 1);
173 assert(i->second == "one");
175 assert(i->first == 1);
176 assert(i->second == "four");
177 eq = c.equal_range(2);
178 assert(std::distance(eq.first, eq.second) == 2);
180 assert(i->first == 2);
181 assert(i->second == "two");
183 assert(i->first == 2);
184 assert(i->second == "four");
186 eq = c.equal_range(3);
187 assert(std::distance(eq.first, eq.second) == 1);
189 assert(i->first == 3);
190 assert(i->second == "three");
191 eq = c.equal_range(4);
192 assert(std::distance(eq.first, eq.second) == 1);
194 assert(i->first == 4);
195 assert(i->second == "four");
196 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
197 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
198 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
199 assert(c.max_load_factor() == 1);
200 assert(c.hash_function() == HF());
201 assert(c.key_eq() == Comp());
202 assert(c.get_allocator() == a);
203 assert(!(c.get_allocator() == A()));
206 typedef std::pair<int, std::string> P;
207 typedef test_allocator<std::pair<const int, std::string>> A;
208 typedef test_hash<std::hash<int>> HF;
209 typedef test_compare<std::equal_to<int>> Comp;
210 typedef std::unordered_multimap<int, std::string, HF, Comp, A> C;
223 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 12, hf, a );
224 assert(c.bucket_count() >= 12);
225 assert(c.size() == 6);
226 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
227 Eq eq = c.equal_range(1);
228 assert(std::distance(eq.first, eq.second) == 2);
229 C::const_iterator i = eq.first;
230 assert(i->first == 1);
231 assert(i->second == "one");
233 assert(i->first == 1);
234 assert(i->second == "four");
235 eq = c.equal_range(2);
236 assert(std::distance(eq.first, eq.second) == 2);
238 assert(i->first == 2);
239 assert(i->second == "two");
241 assert(i->first == 2);
242 assert(i->second == "four");
244 eq = c.equal_range(3);
245 assert(std::distance(eq.first, eq.second) == 1);
247 assert(i->first == 3);
248 assert(i->second == "three");
249 eq = c.equal_range(4);
250 assert(std::distance(eq.first, eq.second) == 1);
252 assert(i->first == 4);
253 assert(i->second == "four");
254 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
255 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
256 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
257 assert(c.max_load_factor() == 1);
258 assert(c.hash_function() == hf);
259 assert(!(c.hash_function() == HF()));
260 assert(c.key_eq() == Comp());
261 assert(c.get_allocator() == a);
262 assert(!(c.get_allocator() == A()));