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_multiset
16 // void reserve(size_type n);
18 #include <unordered_set>
21 #include "test_macros.h"
22 #include "min_allocator.h"
27 assert(c.size() == 6);
28 assert(c.count(1) == 2);
29 assert(c.count(2) == 2);
30 assert(c.count(3) == 1);
31 assert(c.count(4) == 1);
34 void reserve_invariant(size_t n) // LWG #2156
36 for (size_t i = 0; i < n; ++i)
38 std::unordered_multiset<size_t> c;
40 size_t buckets = c.bucket_count();
41 for (size_t j = 0; j < i; ++j)
44 assert(buckets == c.bucket_count());
52 typedef std::unordered_multiset<int> C;
63 C c(a, a + sizeof(a)/sizeof(a[0]));
65 assert(c.bucket_count() >= 7);
67 LIBCPP_ASSERT(c.bucket_count() == 7);
71 LIBCPP_ASSERT(c.bucket_count() == 3);
74 assert(c.bucket_count() >= 16);
77 #if TEST_STD_VER >= 11
79 typedef std::unordered_multiset<int, std::hash<int>,
80 std::equal_to<int>, min_allocator<int>> C;
91 C c(a, a + sizeof(a)/sizeof(a[0]));
93 assert(c.bucket_count() >= 7);
95 LIBCPP_ASSERT(c.bucket_count() == 7);
99 LIBCPP_ASSERT(c.bucket_count() == 3);
102 assert(c.bucket_count() >= 16);
106 reserve_invariant(20);