| 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | |
| 9 | // <unordered_map> |
| 10 | |
| 11 | // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, |
| 12 | // class Alloc = allocator<pair<const Key, T>>> |
| 13 | // class unordered_multimap |
| 14 | |
| 15 | // size_type bucket_count() const; |
| 16 | |
| 17 | #include <unordered_map> |
| 18 | #include <string> |
| 19 | #include <cassert> |
| 20 | #include <iterator> |
| 21 | |
| 22 | #include "test_macros.h" |
| 23 | |
| 24 | int main(int, char**) { |
| 25 | { |
| 26 | typedef std::unordered_multimap<int, std::string> C; |
| 27 | const C c; |
| 28 | LIBCPP_ASSERT(c.bucket_count() == 0); |
| 29 | } |
| 30 | { |
| 31 | typedef std::unordered_multimap<int, std::string> C; |
| 32 | typedef std::pair<int, std::string> P; |
| 33 | P a[] = { |
| 34 | P(10, "ten" ), |
| 35 | P(20, "twenty" ), |
| 36 | P(30, "thirty" ), |
| 37 | P(40, "forty" ), |
| 38 | P(50, "fifty" ), |
| 39 | P(60, "sixty" ), |
| 40 | P(70, "seventy" ), |
| 41 | P(80, "eighty" ), |
| 42 | }; |
| 43 | const C c(std::begin(a), std::end(a)); |
| 44 | assert(c.bucket_count() >= 8); |
| 45 | } |
| 46 | |
| 47 | return 0; |
| 48 | } |
| 49 | |