bucket_size.pass.cpp revision a8bf9de8057ad254cc642f33bd7d0a48dc1ae55c 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <unordered_map>
11
12// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13//           class Alloc = allocator<pair<const Key, T>>>
14// class unordered_multimap
15
16// size_type bucket_size(size_type n) const
17
18#include <unordered_map>
19#include <string>
20#include <cassert>
21
22int main()
23{
24    {
25        typedef std::unordered_multimap<int, std::string> C;
26        typedef std::pair<int, std::string> P;
27        P a[] =
28        {
29            P(1, "one"),
30            P(2, "two"),
31            P(3, "three"),
32            P(4, "four"),
33            P(1, "four"),
34            P(2, "four"),
35        };
36        const C c(std::begin(a), std::end(a));
37        assert(c.bucket_count() >= 7);
38        assert(c.bucket_size(0) == 0);
39        assert(c.bucket_size(1) == 2);
40        assert(c.bucket_size(2) == 2);
41        assert(c.bucket_size(3) == 1);
42        assert(c.bucket_size(4) == 1);
43        assert(c.bucket_size(5) == 0);
44        assert(c.bucket_size(6) == 0);
45    }
46}
47