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_map
16 // size_type bucket_count() const;
18 #include <unordered_map>
22 #include "test_macros.h"
23 #include "min_allocator.h"
28 typedef std::unordered_map<int, std::string> C;
30 assert(c.bucket_count() == 0);
33 typedef std::unordered_map<int, std::string> C;
34 typedef std::pair<int, std::string> P;
46 const C c(std::begin(a), std::end(a));
47 assert(c.bucket_count() >= 11);
49 #if TEST_STD_VER >= 11
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;
54 assert(c.bucket_count() == 0);
57 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
58 min_allocator<std::pair<const int, std::string>>> C;
59 typedef std::pair<int, std::string> P;
71 const C c(std::begin(a), std::end(a));
72 assert(c.bucket_count() >= 11);