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_multiset
15
16 // size_type bucket(const key_type& __k) const;
17
18 #ifdef _LIBCPP_DEBUG
19 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
20 #endif
21
22 #include <unordered_set>
23 #include <cassert>
24
25 #include "min_allocator.h"
26
main()27 int main()
28 {
29 {
30 typedef std::unordered_multiset<int> C;
31 typedef int P;
32 P a[] =
33 {
34 P(1),
35 P(2),
36 P(3),
37 P(4),
38 P(1),
39 P(2)
40 };
41 const C c(std::begin(a), std::end(a));
42 size_t bc = c.bucket_count();
43 assert(bc >= 7);
44 for (size_t i = 0; i < 13; ++i)
45 assert(c.bucket(i) == i % bc);
46 }
47 #if __cplusplus >= 201103L
48 {
49 typedef std::unordered_multiset<int, std::hash<int>,
50 std::equal_to<int>, min_allocator<int>> C;
51 typedef int P;
52 P a[] =
53 {
54 P(1),
55 P(2),
56 P(3),
57 P(4),
58 P(1),
59 P(2)
60 };
61 const C c(std::begin(a), std::end(a));
62 size_t bc = c.bucket_count();
63 assert(bc >= 7);
64 for (size_t i = 0; i < 13; ++i)
65 assert(c.bucket(i) == i % bc);
66 }
67 #endif
68 #if _LIBCPP_DEBUG_LEVEL >= 1
69 {
70 typedef std::unordered_multiset<int> C;
71 C c;
72 C::size_type i = c.bucket(3);
73 assert(false);
74 }
75 #endif
76 }
77