//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator>> // class unordered_map // size_type bucket_count() const; #include #include #include #include "test_macros.h" #include "min_allocator.h" int main() { { typedef std::unordered_map C; const C c; LIBCPP_ASSERT(c.bucket_count() == 0); } { typedef std::unordered_map C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "forty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; const C c(std::begin(a), std::end(a)); assert(c.bucket_count() >= 8); } #if TEST_STD_VER >= 11 { typedef std::unordered_map, std::equal_to, min_allocator>> C; const C c; LIBCPP_ASSERT(c.bucket_count() == 0); } { typedef std::unordered_map, std::equal_to, min_allocator>> C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "forty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; const C c(std::begin(a), std::end(a)); assert(c.bucket_count() >= 8); } #endif }