xref: /llvm-project/libcxx/test/std/containers/unord/unord.multimap/bucket_count.pass.cpp (revision 3cd4531b9ba421d1d096e746d787fe3039a546bb)
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 
main(int,char **)24 int main(int, char**)
25 {
26     {
27         typedef std::unordered_multimap<int, std::string> C;
28         const C c;
29         LIBCPP_ASSERT(c.bucket_count() == 0);
30     }
31     {
32         typedef std::unordered_multimap<int, std::string> C;
33         typedef std::pair<int, std::string> P;
34         P a[] =
35         {
36             P(10, "ten"),
37             P(20, "twenty"),
38             P(30, "thirty"),
39             P(40, "forty"),
40             P(50, "fifty"),
41             P(60, "sixty"),
42             P(70, "seventy"),
43             P(80, "eighty"),
44         };
45         const C c(std::begin(a), std::end(a));
46         assert(c.bucket_count() >= 8);
47     }
48 
49   return 0;
50 }
51