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_map>
11 
12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 //           class Alloc = allocator<pair<const Key, T>>>
14 // class unordered_multimap
15 
16 // size_type bucket_size(size_type n) const
17 
18 #ifdef _LIBCPP_DEBUG
19 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
20 #endif
21 
22 #include <unordered_map>
23 #include <string>
24 #include <cassert>
25 
26 #include "../../min_allocator.h"
27 
28 int main()
29 {
30     {
31         typedef std::unordered_multimap<int, std::string> C;
32         typedef std::pair<int, std::string> P;
33         P a[] =
34         {
35             P(1, "one"),
36             P(2, "two"),
37             P(3, "three"),
38             P(4, "four"),
39             P(1, "four"),
40             P(2, "four"),
41         };
42         const C c(std::begin(a), std::end(a));
43         assert(c.bucket_count() >= 7);
44         assert(c.bucket_size(0) == 0);
45         assert(c.bucket_size(1) == 2);
46         assert(c.bucket_size(2) == 2);
47         assert(c.bucket_size(3) == 1);
48         assert(c.bucket_size(4) == 1);
49         assert(c.bucket_size(5) == 0);
50         assert(c.bucket_size(6) == 0);
51     }
52 #if __cplusplus >= 201103L
53     {
54         typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
55                             min_allocator<std::pair<const int, std::string>>> C;
56         typedef std::pair<int, std::string> P;
57         P a[] =
58         {
59             P(1, "one"),
60             P(2, "two"),
61             P(3, "three"),
62             P(4, "four"),
63             P(1, "four"),
64             P(2, "four"),
65         };
66         const C c(std::begin(a), std::end(a));
67         assert(c.bucket_count() >= 7);
68         assert(c.bucket_size(0) == 0);
69         assert(c.bucket_size(1) == 2);
70         assert(c.bucket_size(2) == 2);
71         assert(c.bucket_size(3) == 1);
72         assert(c.bucket_size(4) == 1);
73         assert(c.bucket_size(5) == 0);
74         assert(c.bucket_size(6) == 0);
75     }
76 #endif
77 #if _LIBCPP_DEBUG_LEVEL >= 1
78     {
79         typedef std::unordered_multimap<int, std::string> C;
80         C c;
81         C::size_type i = c.bucket_size(3);
82         assert(false);
83     }
84 #endif
85 }
86