1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8
9 // <unordered_map>
10
11 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
12 // class Alloc = allocator<pair<const Key, T>>>
13 // class unordered_multimap
14
15 // size_type bucket(const key_type& __k) const;
16
17 #include <unordered_map>
18 #include <string>
19 #include <cassert>
20 #include <iterator>
21
22 #include "test_macros.h"
23 #include "min_allocator.h"
24
main(int,char **)25 int main(int, char**)
26 {
27 {
28 typedef std::unordered_multimap<int, std::string> C;
29 typedef std::pair<int, std::string> P;
30 P a[] =
31 {
32 P(1, "one"),
33 P(2, "two"),
34 P(3, "three"),
35 P(4, "four"),
36 P(1, "four"),
37 P(2, "four"),
38 };
39 const C c(std::begin(a), std::end(a));
40 std::size_t bc = c.bucket_count();
41 assert(bc >= 7);
42 for (std::size_t i = 0; i < 13; ++i)
43 LIBCPP_ASSERT(c.bucket(i) == i % bc);
44 }
45 #if TEST_STD_VER >= 11
46 {
47 typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
48 min_allocator<std::pair<const int, std::string>>> C;
49 typedef std::pair<int, std::string> P;
50 P a[] =
51 {
52 P(1, "one"),
53 P(2, "two"),
54 P(3, "three"),
55 P(4, "four"),
56 P(1, "four"),
57 P(2, "four"),
58 };
59 const C c(std::begin(a), std::end(a));
60 std::size_t bc = c.bucket_count();
61 assert(bc >= 7);
62 for (std::size_t i = 0; i < 13; ++i)
63 LIBCPP_ASSERT(c.bucket(i) == i % bc);
64 }
65 #endif
66
67 return 0;
68 }
69