range_size_hash_equal.pass.cpp revision f5256e16dfc425c1d466f6308d4026d529ce9e0b
1//===----------------------------------------------------------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. 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 23#include "../../../iterators.h" 24#include "../../../test_compare.h" 25#include "../../../test_hash.h" 26#include "../../../test_allocator.h" 27 28int main() 29{ 30 { 31 typedef std::unordered_set<int, 32 test_hash<std::hash<int> >, 33 test_compare<std::equal_to<int> >, 34 test_allocator<int> 35 > C; 36 typedef int P; 37 P a[] = 38 { 39 P(1), 40 P(2), 41 P(3), 42 P(4), 43 P(1), 44 P(2) 45 }; 46 C c(input_iterator<P*>(a), input_iterator<P*>(a + sizeof(a)/sizeof(a[0])), 47 7, 48 test_hash<std::hash<int> >(8), 49 test_compare<std::equal_to<int> >(9) 50 ); 51 assert(c.bucket_count() == 7); 52 assert(c.size() == 4); 53 assert(c.count(1) == 1); 54 assert(c.count(2) == 1); 55 assert(c.count(3) == 1); 56 assert(c.count(4) == 1); 57 assert(c.hash_function() == test_hash<std::hash<int> >(8)); 58 assert(c.key_eq() == test_compare<std::equal_to<int> >(9)); 59 assert(c.get_allocator() == test_allocator<int>()); 60 assert(!c.empty()); 61 assert(std::distance(c.begin(), c.end()) == c.size()); 62 assert(std::distance(c.cbegin(), c.cend()) == c.size()); 63 assert(c.load_factor() == (float)c.size()/c.bucket_count()); 64 assert(c.max_load_factor() == 1); 65 } 66} 67