1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <unordered_map>
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
// class Alloc = allocator<pair<const Key, T>>>
// class unordered_multimap
// void rehash(size_type n);
#include <unordered_map>
#include <string>
#include <cassert>
void test(const std::unordered_multimap<int, std::string>& c)
{
assert(c.size() == 6);
assert(c.find(1)->second == "one");
assert(next(c.find(1))->second == "four");
assert(c.find(2)->second == "two");
assert(next(c.find(2))->second == "four");
assert(c.find(3)->second == "three");
assert(c.find(4)->second == "four");
}
int main()
{
{
typedef std::unordered_multimap<int, std::string> C;
typedef std::pair<int, std::string> P;
P a[] =
{
P(1, "one"),
P(2, "two"),
P(3, "three"),
P(4, "four"),
P(1, "four"),
P(2, "four"),
};
C c(a, a + sizeof(a)/sizeof(a[0]));
test(c);
assert(c.bucket_count() >= 7);
c.reserve(3);
assert(c.bucket_count() == 7);
test(c);
c.max_load_factor(2);
c.reserve(3);
assert(c.bucket_count() == 3);
test(c);
c.reserve(31);
assert(c.bucket_count() == 17);
test(c);
}
}
|
