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& operator=(initializer_list<value_type> il); 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 26 int main() 27 { 28 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 29 { 30 typedef std::allocator<std::pair<const int, std::string> > A; 31 typedef std::unordered_map<int, std::string, 32 test_hash<std::hash<int> >, 33 test_compare<std::equal_to<int> >, 34 A 35 > C; 36 typedef std::pair<int, std::string> P; 37 C c = { 38 P(4, "four"), 39 P(1, "four"), 40 P(2, "four"), 41 }; 42 c = { 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 assert(c.bucket_count() >= 5); 51 assert(c.size() == 4); 52 assert(c.at(1) == "one"); 53 assert(c.at(2) == "two"); 54 assert(c.at(3) == "three"); 55 assert(c.at(4) == "four"); 56 assert(std::distance(c.begin(), c.end()) == c.size()); 57 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 58 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 59 assert(c.max_load_factor() == 1); 60 } 61 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 62 } 63
