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