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 #include <unordered_set> 19 #include <cassert> 20 21 int main() 22 { 23 { 24 typedef std::unordered_multiset<int> C; 25 typedef int P; 26 P a[] = 27 { 28 P(1), 29 P(2), 30 P(3), 31 P(4), 32 P(1), 33 P(2) 34 }; 35 const C c(std::begin(a), std::end(a)); 36 size_t bc = c.bucket_count(); 37 assert(bc >= 7); 38 for (size_t i = 0; i < 13; ++i) 39 assert(c.bucket(i) == i % bc); 40 } 41 } 42
