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_map> 11 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 15 16 // size_type bucket(const key_type& __k) const; 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 22 int main() 23 { 24 { 25 typedef std::unordered_map<int, std::string> C; 26 typedef std::pair<int, std::string> P; 27 P a[] = 28 { 29 P(1, "one"), 30 P(2, "two"), 31 P(3, "three"), 32 P(4, "four"), 33 P(1, "four"), 34 P(2, "four"), 35 }; 36 const C c(std::begin(a), std::end(a)); 37 size_t bc = c.bucket_count(); 38 assert(bc >= 5); 39 for (size_t i = 0; i < 13; ++i) 40 assert(c.bucket(i) == i % bc); 41 } 42 } 43
