//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // <unordered_map> // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, // class Alloc = allocator<pair<const Key, T>>> // class unordered_map // size_type bucket(const key_type& __k) const; #ifdef _LIBCPP_DEBUG #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) #endif #include <unordered_map> #include <string> #include <cassert> #include "min_allocator.h" int main() { { typedef std::unordered_map<int, std::string> C; typedef std::pair<int, std::string> P; P a[] = { P(1, "one"), P(2, "two"), P(3, "three"), P(4, "four"), P(1, "four"), P(2, "four"), }; const C c(std::begin(a), std::end(a)); size_t bc = c.bucket_count(); assert(bc >= 5); for (size_t i = 0; i < 13; ++i) assert(c.bucket(i) == i % bc); } #if __cplusplus >= 201103L { typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, std::string>>> C; typedef std::pair<int, std::string> P; P a[] = { P(1, "one"), P(2, "two"), P(3, "three"), P(4, "four"), P(1, "four"), P(2, "four"), }; const C c(std::begin(a), std::end(a)); size_t bc = c.bucket_count(); assert(bc >= 5); for (size_t i = 0; i < 13; ++i) assert(c.bucket(i) == i % bc); } #endif #if _LIBCPP_DEBUG_LEVEL >= 1 { typedef std::unordered_map<int, std::string> C; C c; C::size_type i = c.bucket(3); assert(false); } #endif }