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 Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
14 // class unordered_multimap
16 // size_type bucket(const key_type& __k) const;
19 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0))
22 #include <unordered_map>
26 #include "test_macros.h"
27 #include "min_allocator.h"
32 typedef std::unordered_multimap<int, std::string> C;
33 typedef std::pair<int, std::string> P;
43 const C c(std::begin(a), std::end(a));
44 size_t bc = c.bucket_count();
46 for (size_t i = 0; i < 13; ++i)
47 LIBCPP_ASSERT(c.bucket(i) == i % bc);
49 #if TEST_STD_VER >= 11
51 typedef std::unordered_multimap<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;
63 const C c(std::begin(a), std::end(a));
64 size_t bc = c.bucket_count();
66 for (size_t i = 0; i < 13; ++i)
67 LIBCPP_ASSERT(c.bucket(i) == i % bc);
70 #if _LIBCPP_DEBUG_LEVEL >= 1
72 typedef std::unordered_multimap<int, std::string> C;
74 C::size_type i = c.bucket(3);