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 19#include <unordered_map> 20#include <string> 21#include <cassert> 22#include <cfloat> 23 24#include "test_iterators.h" 25#include "../../../NotConstructible.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 { 34 typedef std::unordered_map<int, std::string, 35 test_hash<std::hash<int> >, 36 test_compare<std::equal_to<int> >, 37 test_allocator<std::pair<const int, std::string> > 38 > C; 39 typedef std::pair<int, std::string> P; 40 P a[] = 41 { 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 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 50 10 51 ); 52 assert(c.bucket_count() == 11); 53 assert(c.size() == 4); 54 assert(c.at(1) == "one"); 55 assert(c.at(2) == "two"); 56 assert(c.at(3) == "three"); 57 assert(c.at(4) == "four"); 58 assert(c.hash_function() == test_hash<std::hash<int> >()); 59 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 60 assert(c.get_allocator() == 61 (test_allocator<std::pair<const int, std::string> >())); 62 assert(!c.empty()); 63 assert(std::distance(c.begin(), c.end()) == c.size()); 64 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 65 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 66 assert(c.max_load_factor() == 1); 67 } 68#if __cplusplus >= 201103L 69 { 70 typedef std::unordered_map<int, std::string, 71 test_hash<std::hash<int> >, 72 test_compare<std::equal_to<int> >, 73 min_allocator<std::pair<const int, std::string> > 74 > C; 75 typedef std::pair<int, std::string> P; 76 P a[] = 77 { 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 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 86 10 87 ); 88 assert(c.bucket_count() == 11); 89 assert(c.size() == 4); 90 assert(c.at(1) == "one"); 91 assert(c.at(2) == "two"); 92 assert(c.at(3) == "three"); 93 assert(c.at(4) == "four"); 94 assert(c.hash_function() == test_hash<std::hash<int> >()); 95 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 96 assert(c.get_allocator() == 97 (min_allocator<std::pair<const int, std::string> >())); 98 assert(!c.empty()); 99 assert(std::distance(c.begin(), c.end()) == c.size()); 100 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 101 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 102 assert(c.max_load_factor() == 1); 103 } 104#endif 105} 106