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