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 // size_type bucket_count() const;
17
18 #include <unordered_set>
19 #include <cassert>
20
21 #include "test_macros.h"
22 #include "min_allocator.h"
23
main()24 int main()
25 {
26 {
27 typedef std::unordered_set<int> C;
28 const C c;
29 LIBCPP_ASSERT(c.bucket_count() == 0);
30 }
31 {
32 typedef std::unordered_set<int> C;
33 typedef int P;
34 P a[] =
35 {
36 P(10),
37 P(20),
38 P(30),
39 P(40),
40 P(50),
41 P(60),
42 P(70),
43 P(80)
44 };
45 const C c(std::begin(a), std::end(a));
46 assert(c.bucket_count() >= 8);
47 }
48 #if TEST_STD_VER >= 11
49 {
50 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
51 const C c;
52 LIBCPP_ASSERT(c.bucket_count() == 0);
53 }
54 {
55 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
56 typedef int P;
57 P a[] =
58 {
59 P(10),
60 P(20),
61 P(30),
62 P(40),
63 P(50),
64 P(60),
65 P(70),
66 P(80)
67 };
68 const C c(std::begin(a), std::end(a));
69 assert(c.bucket_count() >= 8);
70 }
71 #endif
72 }
73