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 24 #include "../../../test_compare.h" 25 #include "../../../test_hash.h" 26 #include "../../../test_allocator.h" 27 28 int main() 29 { 30 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 31 { 32 typedef std::unordered_multimap<int, std::string, 33 test_hash<std::hash<int> >, 34 test_compare<std::equal_to<int> >, 35 test_allocator<std::pair<const int, std::string> > 36 > C; 37 typedef std::pair<int, std::string> P; 38 C c({ 39 P(1, "one"), 40 P(2, "two"), 41 P(3, "three"), 42 P(4, "four"), 43 P(1, "four"), 44 P(2, "four"), 45 }, 46 7, 47 test_hash<std::hash<int> >(8), 48 test_compare<std::equal_to<int> >(9), 49 test_allocator<std::pair<const int, std::string> >(10) 50 ); 51 assert(c.bucket_count() == 7); 52 assert(c.size() == 6); 53 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 54 Eq eq = c.equal_range(1); 55 assert(std::distance(eq.first, eq.second) == 2); 56 C::const_iterator i = eq.first; 57 assert(i->first == 1); 58 assert(i->second == "one"); 59 ++i; 60 assert(i->first == 1); 61 assert(i->second == "four"); 62 eq = c.equal_range(2); 63 assert(std::distance(eq.first, eq.second) == 2); 64 i = eq.first; 65 assert(i->first == 2); 66 assert(i->second == "two"); 67 ++i; 68 assert(i->first == 2); 69 assert(i->second == "four"); 70 71 eq = c.equal_range(3); 72 assert(std::distance(eq.first, eq.second) == 1); 73 i = eq.first; 74 assert(i->first == 3); 75 assert(i->second == "three"); 76 eq = c.equal_range(4); 77 assert(std::distance(eq.first, eq.second) == 1); 78 i = eq.first; 79 assert(i->first == 4); 80 assert(i->second == "four"); 81 assert(std::distance(c.begin(), c.end()) == c.size()); 82 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 83 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 84 assert(c.max_load_factor() == 1); 85 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 86 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 87 assert((c.get_allocator() == test_allocator<std::pair<const int, std::string> >(10))); 88 } 89 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 90 } 91
