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(unordered_multimap&& u, const allocator_type& a); 17 18 #include <iostream> 19 20 #include <unordered_map> 21 #include <string> 22 #include <cassert> 23 #include <cfloat> 24 25 #include "../../../test_compare.h" 26 #include "../../../test_hash.h" 27 #include "../../../test_allocator.h" 28 29 int main() 30 { 31 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 32 { 33 typedef std::pair<int, std::string> P; 34 typedef test_allocator<std::pair<const int, std::string>> A; 35 typedef std::unordered_multimap<int, std::string, 36 test_hash<std::hash<int> >, 37 test_compare<std::equal_to<int> >, 38 A 39 > C; 40 P a[] = 41 { 42 P(1, "one"), 43 P(2, "two"), 44 P(3, "three"), 45 P(4, "four"), 46 P(1, "four"), 47 P(2, "four"), 48 }; 49 C c0(a, a + sizeof(a)/sizeof(a[0]), 50 7, 51 test_hash<std::hash<int> >(8), 52 test_compare<std::equal_to<int> >(9), 53 A(10) 54 ); 55 C c(std::move(c0), A(12)); 56 assert(c.bucket_count() >= 7); 57 assert(c.size() == 6); 58 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 59 Eq eq = c.equal_range(1); 60 assert(std::distance(eq.first, eq.second) == 2); 61 C::const_iterator i = eq.first; 62 assert(i->first == 1); 63 assert(i->second == "one"); 64 ++i; 65 assert(i->first == 1); 66 assert(i->second == "four"); 67 eq = c.equal_range(2); 68 assert(std::distance(eq.first, eq.second) == 2); 69 i = eq.first; 70 assert(i->first == 2); 71 assert(i->second == "two"); 72 ++i; 73 assert(i->first == 2); 74 assert(i->second == "four"); 75 76 eq = c.equal_range(3); 77 assert(std::distance(eq.first, eq.second) == 1); 78 i = eq.first; 79 assert(i->first == 3); 80 assert(i->second == "three"); 81 eq = c.equal_range(4); 82 assert(std::distance(eq.first, eq.second) == 1); 83 i = eq.first; 84 assert(i->first == 4); 85 assert(i->second == "four"); 86 assert(std::distance(c.begin(), c.end()) == c.size()); 87 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 88 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 89 assert(c.max_load_factor() == 1); 90 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 91 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 92 assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >(12))); 93 94 assert(c0.empty()); 95 } 96 { 97 typedef std::pair<int, std::string> P; 98 typedef test_allocator<std::pair<const int, std::string>> A; 99 typedef std::unordered_multimap<int, std::string, 100 test_hash<std::hash<int> >, 101 test_compare<std::equal_to<int> >, 102 A 103 > C; 104 P a[] = 105 { 106 P(1, "one"), 107 P(2, "two"), 108 P(3, "three"), 109 P(4, "four"), 110 P(1, "four"), 111 P(2, "four"), 112 }; 113 C c0(a, a + sizeof(a)/sizeof(a[0]), 114 7, 115 test_hash<std::hash<int> >(8), 116 test_compare<std::equal_to<int> >(9), 117 A(10) 118 ); 119 C c(std::move(c0), A(10)); 120 assert(c.bucket_count() == 7); 121 assert(c.size() == 6); 122 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 123 Eq eq = c.equal_range(1); 124 assert(std::distance(eq.first, eq.second) == 2); 125 C::const_iterator i = eq.first; 126 assert(i->first == 1); 127 assert(i->second == "one"); 128 ++i; 129 assert(i->first == 1); 130 assert(i->second == "four"); 131 eq = c.equal_range(2); 132 assert(std::distance(eq.first, eq.second) == 2); 133 i = eq.first; 134 assert(i->first == 2); 135 assert(i->second == "two"); 136 ++i; 137 assert(i->first == 2); 138 assert(i->second == "four"); 139 140 eq = c.equal_range(3); 141 assert(std::distance(eq.first, eq.second) == 1); 142 i = eq.first; 143 assert(i->first == 3); 144 assert(i->second == "three"); 145 eq = c.equal_range(4); 146 assert(std::distance(eq.first, eq.second) == 1); 147 i = eq.first; 148 assert(i->first == 4); 149 assert(i->second == "four"); 150 assert(std::distance(c.begin(), c.end()) == c.size()); 151 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 152 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 153 assert(c.max_load_factor() == 1); 154 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 155 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 156 assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >(10))); 157 158 assert(c0.empty()); 159 } 160 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 161 } 162
