bucket.pass.cpp (1932B)
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(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_set> 23 #include <cassert> 24 25 #include "test_macros.h" 26 #include "min_allocator.h" 27 28 int main() 29 { 30 { 31 typedef std::unordered_multiset<int> C; 32 typedef int P; 33 P a[] = 34 { 35 P(1), 36 P(2), 37 P(3), 38 P(4), 39 P(1), 40 P(2) 41 }; 42 const C c(std::begin(a), std::end(a)); 43 size_t bc = c.bucket_count(); 44 assert(bc >= 7); 45 for (size_t i = 0; i < 13; ++i) 46 LIBCPP_ASSERT(c.bucket(i) == i % bc); 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 typedef int P; 53 P a[] = 54 { 55 P(1), 56 P(2), 57 P(3), 58 P(4), 59 P(1), 60 P(2) 61 }; 62 const C c(std::begin(a), std::end(a)); 63 size_t bc = c.bucket_count(); 64 assert(bc >= 7); 65 for (size_t i = 0; i < 13; ++i) 66 LIBCPP_ASSERT(c.bucket(i) == i % bc); 67 } 68 #endif 69 #if _LIBCPP_DEBUG_LEVEL >= 1 70 { 71 typedef std::unordered_multiset<int> C; 72 C c; 73 C::size_type i = c.bucket(3); 74 assert(false); 75 } 76 #endif 77 }