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