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_multimap 15 16 // unordered_multimap& operator=(unordered_multimap&& u); 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 #include <cfloat> 22 23 #include "../../../test_compare.h" 24 #include "../../../test_hash.h" 25 #include "../../../test_allocator.h" 26 27 int main() 28 { 29 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30 { 31 typedef test_allocator<std::pair<const int, std::string> > A; 32 typedef std::unordered_multimap<int, std::string, 33 test_hash<std::hash<int> >, 34 test_compare<std::equal_to<int> >, 35 A 36 > C; 37 typedef std::pair<int, std::string> P; 38 P a[] = 39 { 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 C c0(a, a + sizeof(a)/sizeof(a[0]), 48 7, 49 test_hash<std::hash<int> >(8), 50 test_compare<std::equal_to<int> >(9), 51 A(10) 52 ); 53 C c(a, a + 2, 54 7, 55 test_hash<std::hash<int> >(2), 56 test_compare<std::equal_to<int> >(3), 57 A(4) 58 ); 59 c = std::move(c0); 60 assert(c.bucket_count() == 7); 61 assert(c.size() == 6); 62 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 63 Eq eq = c.equal_range(1); 64 assert(std::distance(eq.first, eq.second) == 2); 65 C::const_iterator i = eq.first; 66 assert(i->first == 1); 67 assert(i->second == "one"); 68 ++i; 69 assert(i->first == 1); 70 assert(i->second == "four"); 71 eq = c.equal_range(2); 72 assert(std::distance(eq.first, eq.second) == 2); 73 i = eq.first; 74 assert(i->first == 2); 75 assert(i->second == "two"); 76 ++i; 77 assert(i->first == 2); 78 assert(i->second == "four"); 79 80 eq = c.equal_range(3); 81 assert(std::distance(eq.first, eq.second) == 1); 82 i = eq.first; 83 assert(i->first == 3); 84 assert(i->second == "three"); 85 eq = c.equal_range(4); 86 assert(std::distance(eq.first, eq.second) == 1); 87 i = eq.first; 88 assert(i->first == 4); 89 assert(i->second == "four"); 90 assert(std::distance(c.begin(), c.end()) == c.size()); 91 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 92 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 93 assert(c.max_load_factor() == 1); 94 } 95 { 96 typedef test_allocator<std::pair<const int, std::string> > A; 97 typedef std::unordered_multimap<int, std::string, 98 test_hash<std::hash<int> >, 99 test_compare<std::equal_to<int> >, 100 A 101 > C; 102 typedef std::pair<int, std::string> P; 103 P a[] = 104 { 105 P(1, "one"), 106 P(2, "two"), 107 P(3, "three"), 108 P(4, "four"), 109 P(1, "four"), 110 P(2, "four"), 111 }; 112 C c0(a, a + sizeof(a)/sizeof(a[0]), 113 7, 114 test_hash<std::hash<int> >(8), 115 test_compare<std::equal_to<int> >(9), 116 A(10) 117 ); 118 C c(a, a + 2, 119 7, 120 test_hash<std::hash<int> >(2), 121 test_compare<std::equal_to<int> >(3), 122 A(10) 123 ); 124 c = std::move(c0); 125 assert(c.bucket_count() == 7); 126 assert(c.size() == 6); 127 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 128 Eq eq = c.equal_range(1); 129 assert(std::distance(eq.first, eq.second) == 2); 130 C::const_iterator i = eq.first; 131 assert(i->first == 1); 132 assert(i->second == "one"); 133 ++i; 134 assert(i->first == 1); 135 assert(i->second == "four"); 136 eq = c.equal_range(2); 137 assert(std::distance(eq.first, eq.second) == 2); 138 i = eq.first; 139 assert(i->first == 2); 140 assert(i->second == "two"); 141 ++i; 142 assert(i->first == 2); 143 assert(i->second == "four"); 144 145 eq = c.equal_range(3); 146 assert(std::distance(eq.first, eq.second) == 1); 147 i = eq.first; 148 assert(i->first == 3); 149 assert(i->second == "three"); 150 eq = c.equal_range(4); 151 assert(std::distance(eq.first, eq.second) == 1); 152 i = eq.first; 153 assert(i->first == 4); 154 assert(i->second == "four"); 155 assert(std::distance(c.begin(), c.end()) == c.size()); 156 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 157 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 158 assert(c.max_load_factor() == 1); 159 } 160 { 161 typedef other_allocator<std::pair<const int, std::string> > A; 162 typedef std::unordered_multimap<int, std::string, 163 test_hash<std::hash<int> >, 164 test_compare<std::equal_to<int> >, 165 A 166 > C; 167 typedef std::pair<int, std::string> P; 168 P a[] = 169 { 170 P(1, "one"), 171 P(2, "two"), 172 P(3, "three"), 173 P(4, "four"), 174 P(1, "four"), 175 P(2, "four"), 176 }; 177 C c0(a, a + sizeof(a)/sizeof(a[0]), 178 7, 179 test_hash<std::hash<int> >(8), 180 test_compare<std::equal_to<int> >(9), 181 A(10) 182 ); 183 C c(a, a + 2, 184 7, 185 test_hash<std::hash<int> >(2), 186 test_compare<std::equal_to<int> >(3), 187 A(4) 188 ); 189 c = std::move(c0); 190 assert(c.bucket_count() == 7); 191 assert(c.size() == 6); 192 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 193 Eq eq = c.equal_range(1); 194 assert(std::distance(eq.first, eq.second) == 2); 195 C::const_iterator i = eq.first; 196 assert(i->first == 1); 197 assert(i->second == "one"); 198 ++i; 199 assert(i->first == 1); 200 assert(i->second == "four"); 201 eq = c.equal_range(2); 202 assert(std::distance(eq.first, eq.second) == 2); 203 i = eq.first; 204 assert(i->first == 2); 205 assert(i->second == "two"); 206 ++i; 207 assert(i->first == 2); 208 assert(i->second == "four"); 209 210 eq = c.equal_range(3); 211 assert(std::distance(eq.first, eq.second) == 1); 212 i = eq.first; 213 assert(i->first == 3); 214 assert(i->second == "three"); 215 eq = c.equal_range(4); 216 assert(std::distance(eq.first, eq.second) == 1); 217 i = eq.first; 218 assert(i->first == 4); 219 assert(i->second == "four"); 220 assert(std::distance(c.begin(), c.end()) == c.size()); 221 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 222 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 223 assert(c.max_load_factor() == 1); 224 } 225 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 226 } 227
