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 // explicit unordered_set(size_type n);
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 
26 int main()
27 {
28     {
29         typedef std::unordered_set<NotConstructible,
30                                    test_hash<std::hash<NotConstructible> >,
31                                    test_compare<std::equal_to<NotConstructible> >,
32                                    test_allocator<NotConstructible>
33                                    > C;
34         C c = 7;
35         assert(c.bucket_count() == 7);
36         assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
37         assert(c.key_eq() == test_compare<std::equal_to<NotConstructible> >());
38         assert(c.get_allocator() == (test_allocator<NotConstructible>()));
39         assert(c.size() == 0);
40         assert(c.empty());
41         assert(std::distance(c.begin(), c.end()) == 0);
42         assert(c.load_factor() == 0);
43         assert(c.max_load_factor() == 1);
44     }
45 }
46