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 // unordered_multimap(initializer_list<value_type> il, size_type n);
18 #include <unordered_map>
25 #include "test_macros.h"
26 #include "../../../test_compare.h"
27 #include "../../../test_hash.h"
28 #include "test_allocator.h"
29 #include "min_allocator.h"
33 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
35 typedef std::unordered_multimap<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> >
40 typedef std::pair<int, std::string> P;
51 LIBCPP_ASSERT(c.bucket_count() == 7);
52 assert(c.size() == 6);
53 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
54 Eq eq = c.equal_range(1);
55 assert(std::distance(eq.first, eq.second) == 2);
56 C::const_iterator i = eq.first;
57 assert(i->first == 1);
58 assert(i->second == "one");
60 assert(i->first == 1);
61 assert(i->second == "four");
62 eq = c.equal_range(2);
63 assert(std::distance(eq.first, eq.second) == 2);
65 assert(i->first == 2);
66 assert(i->second == "two");
68 assert(i->first == 2);
69 assert(i->second == "four");
71 eq = c.equal_range(3);
72 assert(std::distance(eq.first, eq.second) == 1);
74 assert(i->first == 3);
75 assert(i->second == "three");
76 eq = c.equal_range(4);
77 assert(std::distance(eq.first, eq.second) == 1);
79 assert(i->first == 4);
80 assert(i->second == "four");
81 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
82 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
83 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
84 assert(c.max_load_factor() == 1);
85 assert(c.hash_function() == test_hash<std::hash<int> >());
86 assert(c.key_eq() == test_compare<std::equal_to<int> >());
87 assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >()));
89 #if TEST_STD_VER >= 11
91 typedef std::unordered_multimap<int, std::string,
92 test_hash<std::hash<int> >,
93 test_compare<std::equal_to<int> >,
94 min_allocator<std::pair<const int, std::string> >
96 typedef std::pair<int, std::string> P;
107 LIBCPP_ASSERT(c.bucket_count() == 7);
108 assert(c.size() == 6);
109 typedef std::pair<C::const_iterator, C::const_iterator> Eq;
110 Eq eq = c.equal_range(1);
111 assert(std::distance(eq.first, eq.second) == 2);
112 C::const_iterator i = eq.first;
113 assert(i->first == 1);
114 assert(i->second == "one");
116 assert(i->first == 1);
117 assert(i->second == "four");
118 eq = c.equal_range(2);
119 assert(std::distance(eq.first, eq.second) == 2);
121 assert(i->first == 2);
122 assert(i->second == "two");
124 assert(i->first == 2);
125 assert(i->second == "four");
127 eq = c.equal_range(3);
128 assert(std::distance(eq.first, eq.second) == 1);
130 assert(i->first == 3);
131 assert(i->second == "three");
132 eq = c.equal_range(4);
133 assert(std::distance(eq.first, eq.second) == 1);
135 assert(i->first == 4);
136 assert(i->second == "four");
137 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size());
138 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
139 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
140 assert(c.max_load_factor() == 1);
141 assert(c.hash_function() == test_hash<std::hash<int> >());
142 assert(c.key_eq() == test_compare<std::equal_to<int> >());
143 assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >()));
146 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS