init_size_hash_equal.pass.cpp revision 0809a7f62b7e43e2e5f3a31f66dd8cf097cfeb71
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#include <cmath> 24 25#include "test_macros.h" 26#include "../../../test_compare.h" 27#include "../../../test_hash.h" 28#include "test_allocator.h" 29#include "min_allocator.h" 30 31int main() 32{ 33#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 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 C c({ 42 P(1, "one"), 43 P(2, "two"), 44 P(3, "three"), 45 P(4, "four"), 46 P(1, "four"), 47 P(2, "four"), 48 }, 49 7, 50 test_hash<std::hash<int> >(8), 51 test_compare<std::equal_to<int> >(9) 52 ); 53 LIBCPP_ASSERT(c.bucket_count() == 7); 54 assert(c.size() == 4); 55 assert(c.at(1) == "one"); 56 assert(c.at(2) == "two"); 57 assert(c.at(3) == "three"); 58 assert(c.at(4) == "four"); 59 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 60 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 61 assert(c.get_allocator() == 62 (test_allocator<std::pair<const int, std::string> >())); 63 assert(!c.empty()); 64 assert(std::distance(c.begin(), c.end()) == c.size()); 65 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 66 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 67 assert(c.max_load_factor() == 1); 68 } 69#if TEST_STD_VER >= 11 70 { 71 typedef std::unordered_map<int, std::string, 72 test_hash<std::hash<int> >, 73 test_compare<std::equal_to<int> >, 74 min_allocator<std::pair<const int, std::string> > 75 > C; 76 typedef std::pair<int, std::string> P; 77 C c({ 78 P(1, "one"), 79 P(2, "two"), 80 P(3, "three"), 81 P(4, "four"), 82 P(1, "four"), 83 P(2, "four"), 84 }, 85 7, 86 test_hash<std::hash<int> >(8), 87 test_compare<std::equal_to<int> >(9) 88 ); 89 LIBCPP_ASSERT(c.bucket_count() == 7); 90 assert(c.size() == 4); 91 assert(c.at(1) == "one"); 92 assert(c.at(2) == "two"); 93 assert(c.at(3) == "three"); 94 assert(c.at(4) == "four"); 95 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 96 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 97 assert(c.get_allocator() == 98 (min_allocator<std::pair<const int, std::string> >())); 99 assert(!c.empty()); 100 assert(std::distance(c.begin(), c.end()) == c.size()); 101 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 102 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 103 assert(c.max_load_factor() == 1); 104 } 105#endif 106#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 107} 108