1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <unordered_map> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// class Alloc = allocator<pair<const Key, T>>> 14bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// class unordered_map 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// size_type bucket(const key_type& __k) const; 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 185e57142c5902c3f73a6fdcb8cab55e88ffb43a56Howard Hinnant#ifdef _LIBCPP_DEBUG 19824c19963e0263366047787b024a992afc2b1c54Howard Hinnant#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 20824c19963e0263366047787b024a992afc2b1c54Howard Hinnant#endif 21824c19963e0263366047787b024a992afc2b1c54Howard Hinnant 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <unordered_map> 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <string> 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 265eec7d6e30f61f58ad41a939a97822f4c15756dcEric Fiselier#include "test_macros.h" 27061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 287a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::unordered_map<int, std::string> C; 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant typedef std::pair<int, std::string> P; 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P a[] = 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(1, "one"), 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(2, "two"), 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(3, "three"), 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(4, "four"), 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(1, "four"), 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant P(2, "four"), 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant }; 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const C c(std::begin(a), std::end(a)); 44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant size_t bc = c.bucket_count(); 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(bc >= 5); 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (size_t i = 0; i < 13; ++i) 475eec7d6e30f61f58ad41a939a97822f4c15756dcEric Fiselier LIBCPP_ASSERT(c.bucket(i) == i % bc); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 49d24c465beaec2fe9a0e365e6379cd5d3acaeb2caEric Fiselier#if TEST_STD_VER >= 11 507a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant { 517a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, 527a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant min_allocator<std::pair<const int, std::string>>> C; 537a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant typedef std::pair<int, std::string> P; 547a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P a[] = 557a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant { 567a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(1, "one"), 577a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(2, "two"), 587a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(3, "three"), 597a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(4, "four"), 607a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(1, "four"), 617a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant P(2, "four"), 627a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant }; 637a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant const C c(std::begin(a), std::end(a)); 647a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant size_t bc = c.bucket_count(); 657a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant assert(bc >= 5); 667a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant for (size_t i = 0; i < 13; ++i) 675eec7d6e30f61f58ad41a939a97822f4c15756dcEric Fiselier LIBCPP_ASSERT(c.bucket(i) == i % bc); 687a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant } 697a6b7cedcb3359ad7d77e355b02ab982d9d2b25bHoward Hinnant#endif 70824c19963e0263366047787b024a992afc2b1c54Howard Hinnant#if _LIBCPP_DEBUG_LEVEL >= 1 71824c19963e0263366047787b024a992afc2b1c54Howard Hinnant { 72824c19963e0263366047787b024a992afc2b1c54Howard Hinnant typedef std::unordered_map<int, std::string> C; 73824c19963e0263366047787b024a992afc2b1c54Howard Hinnant C c; 74824c19963e0263366047787b024a992afc2b1c54Howard Hinnant C::size_type i = c.bucket(3); 75824c19963e0263366047787b024a992afc2b1c54Howard Hinnant assert(false); 76824c19963e0263366047787b024a992afc2b1c54Howard Hinnant } 77824c19963e0263366047787b024a992afc2b1c54Howard Hinnant#endif 78bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 79