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 // unordered_set(size_type n, const hasher& hf); 17 18 #include <unordered_set> 19 #include <cassert> 20 21 #include "../../../NotConstructible.h" 22 #include "../../../test_compare.h" 23 #include "../../../test_hash.h" 24 #include "test_allocator.h" 25 #include "min_allocator.h" 26 27 int main() 28 { 29 { 30 typedef std::unordered_set<NotConstructible, 31 test_hash<std::hash<NotConstructible> >, 32 test_compare<std::equal_to<NotConstructible> >, 33 test_allocator<NotConstructible> 34 > C; 35 C c(7, 36 test_hash<std::hash<NotConstructible> >(8) 37 ); 38 assert(c.bucket_count() == 7); 39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 40 assert(c.key_eq() == test_compare<std::equal_to<NotConstructible> >()); 41 assert(c.get_allocator() == (test_allocator<NotConstructible>())); 42 assert(c.size() == 0); 43 assert(c.empty()); 44 assert(std::distance(c.begin(), c.end()) == 0); 45 assert(c.load_factor() == 0); 46 assert(c.max_load_factor() == 1); 47 } 48 #if __cplusplus >= 201103L 49 { 50 typedef std::unordered_set<NotConstructible, 51 test_hash<std::hash<NotConstructible> >, 52 test_compare<std::equal_to<NotConstructible> >, 53 min_allocator<NotConstructible> 54 > C; 55 C c(7, 56 test_hash<std::hash<NotConstructible> >(8) 57 ); 58 assert(c.bucket_count() == 7); 59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8)); 60 assert(c.key_eq() == test_compare<std::equal_to<NotConstructible> >()); 61 assert(c.get_allocator() == (min_allocator<NotConstructible>())); 62 assert(c.size() == 0); 63 assert(c.empty()); 64 assert(std::distance(c.begin(), c.end()) == 0); 65 assert(c.load_factor() == 0); 66 assert(c.max_load_factor() == 1); 67 } 68 #endif 69 } 70