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 // template <class InputIterator> 17 // unordered_multimap(InputIterator first, InputIterator last, size_type n, 18 // const hasher& hf, const key_equal& eql); 19 20 #include <unordered_map> 21 #include <string> 22 #include <cassert> 23 #include <cfloat> 24 #include <cmath> 25 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 33 int main() 34 { 35 { 36 typedef std::unordered_multimap<int, std::string, 37 test_hash<std::hash<int> >, 38 test_compare<std::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(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 52 7, 53 test_hash<std::hash<int> >(8), 54 test_compare<std::equal_to<int> >(9) 55 ); 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(std::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> >())); 93 } 94 #if __cplusplus >= 201103L 95 { 96 typedef std::unordered_multimap<int, std::string, 97 test_hash<std::hash<int> >, 98 test_compare<std::equal_to<int> >, 99 min_allocator<std::pair<const int, std::string> > 100 > C; 101 typedef std::pair<int, std::string> P; 102 P a[] = 103 { 104 P(1, "one"), 105 P(2, "two"), 106 P(3, "three"), 107 P(4, "four"), 108 P(1, "four"), 109 P(2, "four"), 110 }; 111 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 112 7, 113 test_hash<std::hash<int> >(8), 114 test_compare<std::equal_to<int> >(9) 115 ); 116 assert(c.bucket_count() == 7); 117 assert(c.size() == 6); 118 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 119 Eq eq = c.equal_range(1); 120 assert(std::distance(eq.first, eq.second) == 2); 121 C::const_iterator i = eq.first; 122 assert(i->first == 1); 123 assert(i->second == "one"); 124 ++i; 125 assert(i->first == 1); 126 assert(i->second == "four"); 127 eq = c.equal_range(2); 128 assert(std::distance(eq.first, eq.second) == 2); 129 i = eq.first; 130 assert(i->first == 2); 131 assert(i->second == "two"); 132 ++i; 133 assert(i->first == 2); 134 assert(i->second == "four"); 135 136 eq = c.equal_range(3); 137 assert(std::distance(eq.first, eq.second) == 1); 138 i = eq.first; 139 assert(i->first == 3); 140 assert(i->second == "three"); 141 eq = c.equal_range(4); 142 assert(std::distance(eq.first, eq.second) == 1); 143 i = eq.first; 144 assert(i->first == 4); 145 assert(i->second == "four"); 146 assert(std::distance(c.begin(), c.end()) == c.size()); 147 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 148 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 149 assert(c.max_load_factor() == 1); 150 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 151 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 152 assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >())); 153 } 154 #endif 155 } 156
