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(initializer_list<value_type> il, size_type n, 17 // const hasher& hf, const key_equal& eql); 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 #include "min_allocator.h" 28 29 int main() 30 { 31 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 32 { 33 typedef std::unordered_map<int, std::string, 34 test_hash<std::hash<int> >, 35 test_compare<std::equal_to<int> >, 36 test_allocator<std::pair<const int, std::string> > 37 > C; 38 typedef std::pair<int, std::string> P; 39 C c({ 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 7, 48 test_hash<std::hash<int> >(8), 49 test_compare<std::equal_to<int> >(9) 50 ); 51 assert(c.bucket_count() == 7); 52 assert(c.size() == 4); 53 assert(c.at(1) == "one"); 54 assert(c.at(2) == "two"); 55 assert(c.at(3) == "three"); 56 assert(c.at(4) == "four"); 57 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 58 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 59 assert(c.get_allocator() == 60 (test_allocator<std::pair<const int, std::string> >())); 61 assert(!c.empty()); 62 assert(std::distance(c.begin(), c.end()) == c.size()); 63 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 64 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 65 assert(c.max_load_factor() == 1); 66 } 67 #if __cplusplus >= 201103L 68 { 69 typedef std::unordered_map<int, std::string, 70 test_hash<std::hash<int> >, 71 test_compare<std::equal_to<int> >, 72 min_allocator<std::pair<const int, std::string> > 73 > C; 74 typedef std::pair<int, std::string> P; 75 C c({ 76 P(1, "one"), 77 P(2, "two"), 78 P(3, "three"), 79 P(4, "four"), 80 P(1, "four"), 81 P(2, "four"), 82 }, 83 7, 84 test_hash<std::hash<int> >(8), 85 test_compare<std::equal_to<int> >(9) 86 ); 87 assert(c.bucket_count() == 7); 88 assert(c.size() == 4); 89 assert(c.at(1) == "one"); 90 assert(c.at(2) == "two"); 91 assert(c.at(3) == "three"); 92 assert(c.at(4) == "four"); 93 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 94 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 95 assert(c.get_allocator() == 96 (min_allocator<std::pair<const int, std::string> >())); 97 assert(!c.empty()); 98 assert(std::distance(c.begin(), c.end()) == c.size()); 99 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 100 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 101 assert(c.max_load_factor() == 1); 102 } 103 #endif 104 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 105 } 106
