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_set> 11 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 13 // class Alloc = allocator<Value>> 14 // class unordered_multiset 15 16 // size_type bucket_count() const; 17 18 #include <unordered_set> 19 #include <cassert> 20 21 #include "test_macros.h" 22 #include "min_allocator.h" 23 24 int main() 25 { 26 { 27 typedef std::unordered_multiset<int> C; 28 const C c; 29 LIBCPP_ASSERT(c.bucket_count() == 0); 30 } 31 { 32 typedef std::unordered_multiset<int> C; 33 typedef int P; 34 P a[] = 35 { 36 P(10), 37 P(20), 38 P(30), 39 P(40), 40 P(50), 41 P(60), 42 P(70), 43 P(80) 44 }; 45 const C c(std::begin(a), std::end(a)); 46 assert(c.bucket_count() >= 8); 47 } 48 #if TEST_STD_VER >= 11 49 { 50 typedef std::unordered_multiset<int, std::hash<int>, 51 std::equal_to<int>, min_allocator<int>> C; 52 const C c; 53 LIBCPP_ASSERT(c.bucket_count() == 0); 54 } 55 { 56 typedef std::unordered_multiset<int, std::hash<int>, 57 std::equal_to<int>, min_allocator<int>> C; 58 typedef int P; 59 P a[] = 60 { 61 P(10), 62 P(20), 63 P(30), 64 P(40), 65 P(50), 66 P(60), 67 P(70), 68 P(80) 69 }; 70 const C c(std::begin(a), std::end(a)); 71 assert(c.bucket_count() >= 8); 72 } 73 #endif 74 } 75
