range_size_hash_equal.pass.cpp revision f836d531b4146465342939fe32ae47d157ee07b2
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_set> 11 12// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13// class Alloc = allocator<Value>> 14// class unordered_set 15 16// template <class InputIterator> 17// unordered_set(InputIterator first, InputIterator last, size_type n, 18// const hasher& hf, const key_equal& eql); 19 20#include <unordered_set> 21#include <cassert> 22#include <cfloat> 23 24#include "../../../iterators.h" 25#include "../../../test_compare.h" 26#include "../../../test_hash.h" 27#include "../../../test_allocator.h" 28 29int main() 30{ 31 { 32 typedef std::unordered_set<int, 33 test_hash<std::hash<int> >, 34 test_compare<std::equal_to<int> >, 35 test_allocator<int> 36 > C; 37 typedef int P; 38 P a[] = 39 { 40 P(1), 41 P(2), 42 P(3), 43 P(4), 44 P(1), 45 P(2) 46 }; 47 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 48 7, 49 test_hash<std::hash<int> >(8), 50 test_compare<std::equal_to<int> >(9) 51 ); 52 assert(c.bucket_count() == 7); 53 assert(c.size() == 4); 54 assert(c.count(1) == 1); 55 assert(c.count(2) == 1); 56 assert(c.count(3) == 1); 57 assert(c.count(4) == 1); 58 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 59 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 60 assert(c.get_allocator() == test_allocator<int>()); 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