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); 19 20#include <unordered_map> 21#include <string> 22#include <cassert> 23#include <cfloat> 24#include <cmath> 25#include <cstddef> 26 27#include "test_macros.h" 28#include "test_iterators.h" 29#include "../../../NotConstructible.h" 30#include "../../../test_compare.h" 31#include "../../../test_hash.h" 32#include "test_allocator.h" 33#include "min_allocator.h" 34 35int main() 36{ 37 { 38 typedef std::unordered_multimap<int, std::string, 39 test_hash<std::hash<int> >, 40 test_compare<std::equal_to<int> >, 41 test_allocator<std::pair<const int, std::string> > 42 > C; 43 typedef std::pair<int, std::string> P; 44 P a[] = 45 { 46 P(1, "one"), 47 P(2, "two"), 48 P(3, "three"), 49 P(4, "four"), 50 P(1, "four"), 51 P(2, "four"), 52 }; 53 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 54 7, 55 test_hash<std::hash<int> >(8) 56 ); 57 LIBCPP_ASSERT(c.bucket_count() == 7); 58 assert(c.size() == 6); 59 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 60 Eq eq = c.equal_range(1); 61 assert(std::distance(eq.first, eq.second) == 2); 62 C::const_iterator i = eq.first; 63 assert(i->first == 1); 64 assert(i->second == "one"); 65 ++i; 66 assert(i->first == 1); 67 assert(i->second == "four"); 68 eq = c.equal_range(2); 69 assert(std::distance(eq.first, eq.second) == 2); 70 i = eq.first; 71 assert(i->first == 2); 72 assert(i->second == "two"); 73 ++i; 74 assert(i->first == 2); 75 assert(i->second == "four"); 76 77 eq = c.equal_range(3); 78 assert(std::distance(eq.first, eq.second) == 1); 79 i = eq.first; 80 assert(i->first == 3); 81 assert(i->second == "three"); 82 eq = c.equal_range(4); 83 assert(std::distance(eq.first, eq.second) == 1); 84 i = eq.first; 85 assert(i->first == 4); 86 assert(i->second == "four"); 87 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 88 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 89 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 90 assert(c.max_load_factor() == 1); 91 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 92 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 93 assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >())); 94 } 95#if TEST_STD_VER >= 11 96 { 97 typedef std::unordered_multimap<int, std::string, 98 test_hash<std::hash<int> >, 99 test_compare<std::equal_to<int> >, 100 min_allocator<std::pair<const int, std::string> > 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 c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 113 7, 114 test_hash<std::hash<int> >(8) 115 ); 116 LIBCPP_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(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 147 assert(static_cast<std::size_t>(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> >()); 152 assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >())); 153 } 154#endif 155} 156