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 // void rehash(size_type n); 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 #include <cfloat> 22 23 void test(const std::unordered_multimap<int, std::string>& c) 24 { 25 typedef std::unordered_multimap<int, std::string> C; 26 assert(c.size() == 6); 27 typedef std::pair<C::const_iterator, C::const_iterator> Eq; 28 Eq eq = c.equal_range(1); 29 assert(std::distance(eq.first, eq.second) == 2); 30 C::const_iterator i = eq.first; 31 assert(i->first == 1); 32 assert(i->second == "one"); 33 ++i; 34 assert(i->first == 1); 35 assert(i->second == "four"); 36 eq = c.equal_range(2); 37 assert(std::distance(eq.first, eq.second) == 2); 38 i = eq.first; 39 assert(i->first == 2); 40 assert(i->second == "two"); 41 ++i; 42 assert(i->first == 2); 43 assert(i->second == "four"); 44 45 eq = c.equal_range(3); 46 assert(std::distance(eq.first, eq.second) == 1); 47 i = eq.first; 48 assert(i->first == 3); 49 assert(i->second == "three"); 50 eq = c.equal_range(4); 51 assert(std::distance(eq.first, eq.second) == 1); 52 i = eq.first; 53 assert(i->first == 4); 54 assert(i->second == "four"); 55 assert(std::distance(c.begin(), c.end()) == c.size()); 56 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 57 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 58 } 59 60 int main() 61 { 62 { 63 typedef std::unordered_multimap<int, std::string> C; 64 typedef std::pair<int, std::string> P; 65 P a[] = 66 { 67 P(1, "one"), 68 P(2, "two"), 69 P(3, "three"), 70 P(4, "four"), 71 P(1, "four"), 72 P(2, "four"), 73 }; 74 C c(a, a + sizeof(a)/sizeof(a[0])); 75 test(c); 76 assert(c.bucket_count() >= 7); 77 c.rehash(3); 78 assert(c.bucket_count() == 7); 79 test(c); 80 c.max_load_factor(2); 81 c.rehash(3); 82 assert(c.bucket_count() == 3); 83 test(c); 84 c.rehash(31); 85 assert(c.bucket_count() == 31); 86 test(c); 87 } 88 } 89
