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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
//===----------------------------------------------------------------------===//
//
// 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_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 reserve(size_type n);
#include <unordered_map>
#include <string>
#include <set>
#include <cassert>
#include "test_macros.h"
#include "min_allocator.h"
template <class C>
void test(const C& c)
{
assert(c.size() == 6);
{
std::set<std::string> s;
s.insert("one");
s.insert("four");
assert(s.find(c.find(1)->second) != s.end());
s.erase(s.find(c.find(1)->second));
assert(s.find(next(c.find(1))->second) != s.end());
}
{
std::set<std::string> s;
s.insert("two");
s.insert("four");
assert(s.find(c.find(2)->second) != s.end());
s.erase(s.find(c.find(2)->second));
assert(s.find(next(c.find(2))->second) != s.end());
}
assert(c.find(3)->second == "three");
assert(c.find(4)->second == "four");
}
void reserve_invariant(size_t n) // LWG #2156
{
for (size_t i = 0; i < n; ++i)
{
std::unordered_multimap<size_t, size_t> c;
c.reserve(n);
size_t buckets = c.bucket_count();
for (size_t j = 0; j < i; ++j)
{
c.insert(std::unordered_multimap<size_t, size_t>::value_type(i,i));
assert(buckets == c.bucket_count());
}
}
}
int main(int, char**)
{
{
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);
LIBCPP_ASSERT(c.bucket_count() == 7);
test(c);
c.max_load_factor(2);
c.reserve(3);
LIBCPP_ASSERT(c.bucket_count() == 3);
test(c);
c.reserve(31);
assert(c.bucket_count() >= 16);
test(c);
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const 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);
LIBCPP_ASSERT(c.bucket_count() == 7);
test(c);
c.max_load_factor(2);
c.reserve(3);
LIBCPP_ASSERT(c.bucket_count() == 3);
test(c);
c.reserve(31);
assert(c.bucket_count() >= 16);
test(c);
}
#endif
reserve_invariant(20);
return 0;
}
|
