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_map 15 16 // unordered_map(const unordered_map& u, const allocator_type& a); 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 #include <cfloat> 22 #include <cmath> 23 24 #include "../../../test_compare.h" 25 #include "../../../test_hash.h" 26 #include "test_allocator.h" 27 #include "min_allocator.h" 28 29 int main() 30 { 31 { 32 typedef std::unordered_map<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 P a[] = 39 { 40 P(1, "one"), 41 P(2, "two"), 42 P(3, "three"), 43 P(4, "four"), 44 P(1, "four"), 45 P(2, "four"), 46 }; 47 C c0(a, a + sizeof(a)/sizeof(a[0]), 48 7, 49 test_hash<std::hash<int> >(8), 50 test_compare<std::equal_to<int> >(9), 51 test_allocator<std::pair<const int, std::string> >(10) 52 ); 53 C c(c0, test_allocator<std::pair<const int, std::string> >(5)); 54 assert(c.bucket_count() == 7); 55 assert(c.size() == 4); 56 assert(c.at(1) == "one"); 57 assert(c.at(2) == "two"); 58 assert(c.at(3) == "three"); 59 assert(c.at(4) == "four"); 60 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 61 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 62 assert(c.get_allocator() == 63 (test_allocator<std::pair<const int, std::string> >(5))); 64 assert(!c.empty()); 65 assert(std::distance(c.begin(), c.end()) == c.size()); 66 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 67 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 68 assert(c.max_load_factor() == 1); 69 } 70 #if __cplusplus >= 201103L 71 { 72 typedef std::unordered_map<int, std::string, 73 test_hash<std::hash<int> >, 74 test_compare<std::equal_to<int> >, 75 min_allocator<std::pair<const int, std::string> > 76 > C; 77 typedef std::pair<int, std::string> P; 78 P a[] = 79 { 80 P(1, "one"), 81 P(2, "two"), 82 P(3, "three"), 83 P(4, "four"), 84 P(1, "four"), 85 P(2, "four"), 86 }; 87 C c0(a, a + sizeof(a)/sizeof(a[0]), 88 7, 89 test_hash<std::hash<int> >(8), 90 test_compare<std::equal_to<int> >(9), 91 min_allocator<std::pair<const int, std::string> >() 92 ); 93 C c(c0, min_allocator<std::pair<const int, std::string> >()); 94 assert(c.bucket_count() == 7); 95 assert(c.size() == 4); 96 assert(c.at(1) == "one"); 97 assert(c.at(2) == "two"); 98 assert(c.at(3) == "three"); 99 assert(c.at(4) == "four"); 100 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 101 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 102 assert(c.get_allocator() == 103 (min_allocator<std::pair<const int, std::string> >())); 104 assert(!c.empty()); 105 assert(std::distance(c.begin(), c.end()) == c.size()); 106 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 107 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 108 assert(c.max_load_factor() == 1); 109 } 110 #endif 111 } 112
