range_size.pass.cpp revision 83e2c4d877fe2d7793868b1c6a5d9525a7c4d431
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 30int main() 31{ 32 { 33 typedef std::unordered_map<int, std::string, 34 test_hash<std::hash<int> >, 35 test_compare<std::equal_to<int> >, 36 test_allocator<std::pair<const int, std::string> > 37 > C; 38 typedef std::pair<int, std::string> P; 39 P a[] = 40 { 41 P(1, "one"), 42 P(2, "two"), 43 P(3, "three"), 44 P(4, "four"), 45 P(1, "four"), 46 P(2, "four"), 47 }; 48 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 49 10 50 ); 51 assert(c.bucket_count() == 11); 52 assert(c.size() == 4); 53 assert(c.at(1) == "one"); 54 assert(c.at(2) == "two"); 55 assert(c.at(3) == "three"); 56 assert(c.at(4) == "four"); 57 assert(c.hash_function() == test_hash<std::hash<int> >()); 58 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 59 assert(c.get_allocator() == 60 (test_allocator<std::pair<const int, std::string> >())); 61 assert(!c.empty()); 62 assert(std::distance(c.begin(), c.end()) == c.size()); 63 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 64 assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON); 65 assert(c.max_load_factor() == 1); 66 } 67} 68