init_size.pass.cpp revision 7a6b7cedcb3359ad7d77e355b02ab982d9d2b25b
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 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 28int 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 ); 48 assert(c.bucket_count() == 7); 49 assert(c.size() == 4); 50 assert(c.at(1) == "one"); 51 assert(c.at(2) == "two"); 52 assert(c.at(3) == "three"); 53 assert(c.at(4) == "four"); 54 assert(c.hash_function() == test_hash<std::hash<int> >()); 55 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 56 assert(c.get_allocator() == 57 (test_allocator<std::pair<const int, std::string> >())); 58 assert(!c.empty()); 59 assert(std::distance(c.begin(), c.end()) == c.size()); 60 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 61 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 62 assert(c.max_load_factor() == 1); 63 } 64#if __cplusplus >= 201103L 65 { 66 typedef std::unordered_map<int, std::string, 67 test_hash<std::hash<int> >, 68 test_compare<std::equal_to<int> >, 69 min_allocator<std::pair<const int, std::string> > 70 > C; 71 typedef std::pair<int, std::string> P; 72 C c({ 73 P(1, "one"), 74 P(2, "two"), 75 P(3, "three"), 76 P(4, "four"), 77 P(1, "four"), 78 P(2, "four"), 79 }, 80 7 81 ); 82 assert(c.bucket_count() == 7); 83 assert(c.size() == 4); 84 assert(c.at(1) == "one"); 85 assert(c.at(2) == "two"); 86 assert(c.at(3) == "three"); 87 assert(c.at(4) == "four"); 88 assert(c.hash_function() == test_hash<std::hash<int> >()); 89 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 90 assert(c.get_allocator() == 91 (min_allocator<std::pair<const int, std::string> >())); 92 assert(!c.empty()); 93 assert(std::distance(c.begin(), c.end()) == c.size()); 94 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 95 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 96 assert(c.max_load_factor() == 1); 97 } 98#endif 99#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 100} 101