1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
13 // class Alloc = allocator<Value>>
14 // class unordered_set
16 // void reserve(size_type n);
18 #include <unordered_set>
21 #include "min_allocator.h"
26 assert(c.size() == 4);
27 assert(c.count(1) == 1);
28 assert(c.count(2) == 1);
29 assert(c.count(3) == 1);
30 assert(c.count(4) == 1);
33 void reserve_invariant(size_t n) // LWG #2156
35 for (size_t i = 0; i < n; ++i)
37 std::unordered_set<size_t> c;
39 size_t buckets = c.bucket_count();
40 for (size_t j = 0; j < i; ++j)
43 assert(buckets == c.bucket_count());
51 typedef std::unordered_set<int> C;
62 C c(a, a + sizeof(a)/sizeof(a[0]));
64 assert(c.bucket_count() >= 5);
66 assert(c.bucket_count() == 5);
70 assert(c.bucket_count() >= 2);
73 assert(c.bucket_count() >= 16);
76 #if __cplusplus >= 201103L
78 typedef std::unordered_set<int, std::hash<int>,
79 std::equal_to<int>, min_allocator<int>> C;
90 C c(a, a + sizeof(a)/sizeof(a[0]));
92 assert(c.bucket_count() >= 5);
94 assert(c.bucket_count() == 5);
98 assert(c.bucket_count() >= 2);
101 assert(c.bucket_count() >= 16);
105 reserve_invariant(20);