init_size.pass.cpp revision b64f8b07c104c6cc986570ac8ee0ed16a9f23976
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 22#include "../../../test_compare.h" 23#include "../../../test_hash.h" 24#include "../../../test_allocator.h" 25 26int main() 27{ 28#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 29 { 30 typedef std::unordered_map<int, std::string, 31 test_hash<std::hash<int> >, 32 test_compare<std::equal_to<int> >, 33 test_allocator<std::pair<const int, std::string> > 34 > C; 35 typedef std::pair<int, std::string> P; 36 C c({ 37 P(1, "one"), 38 P(2, "two"), 39 P(3, "three"), 40 P(4, "four"), 41 P(1, "four"), 42 P(2, "four"), 43 }, 44 7 45 ); 46 assert(c.bucket_count() == 7); 47 assert(c.size() == 4); 48 assert(c.at(1) == "one"); 49 assert(c.at(2) == "two"); 50 assert(c.at(3) == "three"); 51 assert(c.at(4) == "four"); 52 assert(c.hash_function() == test_hash<std::hash<int> >()); 53 assert(c.key_eq() == test_compare<std::equal_to<int> >()); 54 assert(c.get_allocator() == 55 (test_allocator<std::pair<const int, std::string> >())); 56 assert(!c.empty()); 57 assert(std::distance(c.begin(), c.end()) == c.size()); 58 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 59 assert(c.load_factor() == (float)c.size()/c.bucket_count()); 60 assert(c.max_load_factor() == 1); 61 } 62#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES 63} 64