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// UNSUPPORTED: c++98, c++03 11 12// <unordered_map> 13 14// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 15// class Alloc = allocator<pair<const Key, T>>> 16// class unordered_map 17 18// unordered_map(initializer_list<value_type> il, size_type n, 19// const hasher& hf, const key_equal& eql); 20 21#include <unordered_map> 22#include <string> 23#include <cassert> 24#include <cfloat> 25#include <cmath> 26#include <cstddef> 27 28#include "test_macros.h" 29#include "../../../test_compare.h" 30#include "../../../test_hash.h" 31#include "test_allocator.h" 32#include "min_allocator.h" 33 34int main() 35{ 36 { 37 typedef std::unordered_map<int, std::string, 38 test_hash<std::hash<int> >, 39 test_compare<std::equal_to<int> >, 40 test_allocator<std::pair<const int, std::string> > 41 > C; 42 typedef std::pair<int, std::string> P; 43 C c({ 44 P(1, "one"), 45 P(2, "two"), 46 P(3, "three"), 47 P(4, "four"), 48 P(1, "four"), 49 P(2, "four"), 50 }, 51 7, 52 test_hash<std::hash<int> >(8), 53 test_compare<std::equal_to<int> >(9) 54 ); 55 LIBCPP_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(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 67 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 68 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 69 assert(c.max_load_factor() == 1); 70 } 71 { 72 typedef std::unordered_map<int, std::string, 73 test_hash<std::hash<int> >, 74 test_compare<std::equal_to<int> >, 75 min_allocator<std::pair<const int, std::string> > 76 > C; 77 typedef std::pair<int, std::string> P; 78 C c({ 79 P(1, "one"), 80 P(2, "two"), 81 P(3, "three"), 82 P(4, "four"), 83 P(1, "four"), 84 P(2, "four"), 85 }, 86 7, 87 test_hash<std::hash<int> >(8), 88 test_compare<std::equal_to<int> >(9) 89 ); 90 LIBCPP_ASSERT(c.bucket_count() == 7); 91 assert(c.size() == 4); 92 assert(c.at(1) == "one"); 93 assert(c.at(2) == "two"); 94 assert(c.at(3) == "three"); 95 assert(c.at(4) == "four"); 96 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 97 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 98 assert(c.get_allocator() == 99 (min_allocator<std::pair<const int, std::string> >())); 100 assert(!c.empty()); 101 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 102 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 103 assert(std::fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 104 assert(c.max_load_factor() == 1); 105 } 106} 107