| //===----------------------------------------------------------------------===// |
| // |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| // See https://llvm.org/LICENSE.txt for license information. |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <unordered_set> |
| |
| // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, |
| // class Alloc = allocator<Value>> |
| // class unordered_set |
| |
| // size_type bucket_count() const; |
| |
| #include <unordered_set> |
| #include <cassert> |
| |
| #include "test_macros.h" |
| #include "min_allocator.h" |
| |
| int main(int, char**) |
| { |
| { |
| typedef std::unordered_set<int> C; |
| const C c; |
| LIBCPP_ASSERT(c.bucket_count() == 0); |
| } |
| { |
| typedef std::unordered_set<int> C; |
| typedef int P; |
| P a[] = |
| { |
| P(10), |
| P(20), |
| P(30), |
| P(40), |
| P(50), |
| P(60), |
| P(70), |
| P(80) |
| }; |
| const C c(std::begin(a), std::end(a)); |
| assert(c.bucket_count() >= 8); |
| } |
| #if TEST_STD_VER >= 11 |
| { |
| typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; |
| const C c; |
| LIBCPP_ASSERT(c.bucket_count() == 0); |
| } |
| { |
| typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C; |
| typedef int P; |
| P a[] = |
| { |
| P(10), |
| P(20), |
| P(30), |
| P(40), |
| P(50), |
| P(60), |
| P(70), |
| P(80) |
| }; |
| const C c(std::begin(a), std::end(a)); |
| assert(c.bucket_count() >= 8); |
| } |
| #endif |
| |
| return 0; |
| } |