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_multimap 15 16 // size_type bucket_count() const; 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 22 int main() 23 { 24 { 25 typedef std::unordered_multimap<int, std::string> C; 26 typedef C::const_iterator I; 27 typedef std::pair<int, std::string> P; 28 const C c; 29 assert(c.bucket_count() == 0); 30 } 31 { 32 typedef std::unordered_multimap<int, std::string> C; 33 typedef C::const_iterator I; 34 typedef std::pair<int, std::string> P; 35 P a[] = 36 { 37 P(10, "ten"), 38 P(20, "twenty"), 39 P(30, "thirty"), 40 P(40, "forty"), 41 P(50, "fifty"), 42 P(60, "sixty"), 43 P(70, "seventy"), 44 P(80, "eighty"), 45 }; 46 const C c(std::begin(a), std::end(a)); 47 assert(c.bucket_count() >= 11); 48 } 49 } 50
