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_map
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_map>
23 #include <string>
24 #include <cassert>
25
26 #include "test_macros.h"
27 #include "min_allocator.h"
28
main()29 int main()
30 {
31 {
32 typedef std::unordered_map<int, std::string> C;
33 typedef std::pair<int, std::string> P;
34 P a[] =
35 {
36 P(1, "one"),
37 P(2, "two"),
38 P(3, "three"),
39 P(4, "four"),
40 P(1, "four"),
41 P(2, "four"),
42 };
43 const C c(std::begin(a), std::end(a));
44 size_t bc = c.bucket_count();
45 assert(bc >= 5);
46 for (size_t i = 0; i < 13; ++i)
47 LIBCPP_ASSERT(c.bucket(i) == i % bc);
48 }
49 #if TEST_STD_VER >= 11
50 {
51 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
52 min_allocator<std::pair<const int, std::string>>> C;
53 typedef std::pair<int, std::string> P;
54 P a[] =
55 {
56 P(1, "one"),
57 P(2, "two"),
58 P(3, "three"),
59 P(4, "four"),
60 P(1, "four"),
61 P(2, "four"),
62 };
63 const C c(std::begin(a), std::end(a));
64 size_t bc = c.bucket_count();
65 assert(bc >= 5);
66 for (size_t i = 0; i < 13; ++i)
67 LIBCPP_ASSERT(c.bucket(i) == i % bc);
68 }
69 #endif
70 #if _LIBCPP_DEBUG_LEVEL >= 1
71 {
72 typedef std::unordered_map<int, std::string> C;
73 C c;
74 C::size_type i = c.bucket(3);
75 assert(false);
76 }
77 #endif
78 }
79