bucket.pass.cpp revision 7a6b7cedcb3359ad7d77e355b02ab982d9d2b25b
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#include "../../min_allocator.h" 23 24int main() 25{ 26 { 27 typedef std::unordered_map<int, std::string> C; 28 typedef std::pair<int, std::string> P; 29 P a[] = 30 { 31 P(1, "one"), 32 P(2, "two"), 33 P(3, "three"), 34 P(4, "four"), 35 P(1, "four"), 36 P(2, "four"), 37 }; 38 const C c(std::begin(a), std::end(a)); 39 size_t bc = c.bucket_count(); 40 assert(bc >= 5); 41 for (size_t i = 0; i < 13; ++i) 42 assert(c.bucket(i) == i % bc); 43 } 44#if __cplusplus >= 201103L 45 { 46 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, 47 min_allocator<std::pair<const int, std::string>>> C; 48 typedef std::pair<int, std::string> P; 49 P a[] = 50 { 51 P(1, "one"), 52 P(2, "two"), 53 P(3, "three"), 54 P(4, "four"), 55 P(1, "four"), 56 P(2, "four"), 57 }; 58 const C c(std::begin(a), std::end(a)); 59 size_t bc = c.bucket_count(); 60 assert(bc >= 5); 61 for (size_t i = 0; i < 13; ++i) 62 assert(c.bucket(i) == i % bc); 63 } 64#endif 65} 66