forked from Alinshans/MyTinySTL
-
Notifications
You must be signed in to change notification settings - Fork 0
/
unordered_set_test.h
191 lines (181 loc) · 7.17 KB
/
unordered_set_test.h
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
#ifndef MYTINYSTL_UNORDERED_SET_TEST_H_
#define MYTINYSTL_UNORDERED_SET_TEST_H_
// unordered_set test : 测试 unordered_set, unordered_multiset 的接口与它们 insert 的性能
#include <unordered_set>
#include "../MyTinySTL/unordered_set.h"
#include "set_test.h"
#include "test.h"
namespace mystl
{
namespace test
{
namespace unordered_set_test
{
void unordered_set_test()
{
std::cout << "[===============================================================]" << std::endl;
std::cout << "[-------------- Run container test : unordered_set -------------]" << std::endl;
std::cout << "[-------------------------- API test ---------------------------]" << std::endl;
int a[] = { 5,4,3,2,1 };
mystl::unordered_set<int> us1;
mystl::unordered_set<int> us2(520);
mystl::unordered_set<int> us3(520, mystl::hash<int>());
mystl::unordered_set<int> us4(520, mystl::hash<int>(), mystl::equal_to<int>());
mystl::unordered_set<int> us5(a, a + 5);
mystl::unordered_set<int> us6(a, a + 5, 100);
mystl::unordered_set<int> us7(a, a + 5, 100, mystl::hash<int>());
mystl::unordered_set<int> us8(a, a + 5, 100, mystl::hash<int>(), mystl::equal_to<int>());
mystl::unordered_set<int> us9(us5);
mystl::unordered_set<int> us10(std::move(us5));
mystl::unordered_set<int> us11;
us11 = us6;
mystl::unordered_set<int> us12;
us12 = std::move(us6);
mystl::unordered_set<int> us13{ 1,2,3,4,5 };
mystl::unordered_set<int> us14;
us13 = { 1,2,3,4,5 };
FUN_AFTER(us1, us1.emplace(1));
FUN_AFTER(us1, us1.emplace_hint(us1.end(), 2));
FUN_AFTER(us1, us1.insert(5));
FUN_AFTER(us1, us1.insert(us1.begin(), 5));
FUN_AFTER(us1, us1.insert(a, a + 5));
FUN_AFTER(us1, us1.erase(us1.begin()));
FUN_AFTER(us1, us1.erase(us1.begin(), us1.find(3)));
FUN_AFTER(us1, us1.erase(1));
std::cout << std::boolalpha;
FUN_VALUE(us1.empty());
std::cout << std::noboolalpha;
FUN_VALUE(us1.size());
FUN_VALUE(us1.bucket_count());
FUN_VALUE(us1.max_bucket_count());
FUN_VALUE(us1.bucket(1));
FUN_VALUE(us1.bucket_size(us1.bucket(5)));
FUN_AFTER(us1, us1.clear());
FUN_AFTER(us1, us1.swap(us7));
FUN_VALUE(*us1.begin());
std::cout << std::boolalpha;
FUN_VALUE(us1.empty());
std::cout << std::noboolalpha;
FUN_VALUE(us1.size());
FUN_VALUE(us1.max_size());
FUN_VALUE(us1.bucket_count());
FUN_AFTER(us1, us1.reserve(1000));
FUN_VALUE(*us1.begin(us1.bucket(1)));
FUN_VALUE(us1.size());
FUN_VALUE(us1.bucket_count());
FUN_VALUE(us1.bucket_size(1));
FUN_VALUE(us1.bucket_size(2));
FUN_VALUE(us1.bucket_size(3));
FUN_AFTER(us1, us1.rehash(150));
FUN_VALUE(us1.bucket_count());
FUN_VALUE(us1.count(1));
FUN_VALUE(*us1.find(3));
auto first = *us1.equal_range(3).first;
auto second = *us1.equal_range(3).second;
std::cout << " us1.equal_range(3) : from " << first << " to " << second << std::endl;
FUN_VALUE(us1.load_factor());
FUN_VALUE(us1.max_load_factor());
FUN_AFTER(us1, us1.max_load_factor(1.5f));
FUN_VALUE(us1.max_load_factor());
PASSED;
#if PERFORMANCE_TEST_ON
std::cout << "[--------------------- Performance Testing ---------------------]" << std::endl;
std::cout << "|---------------------|-------------|-------------|-------------|" << std::endl;
std::cout << "| emplace |";
#if LARGER_TEST_DATA_ON
CON_TEST_P1(unordered_set<int>, emplace, rand(), SCALE_L(LEN1), SCALE_L(LEN2), SCALE_L(LEN3));
#else
CON_TEST_P1(unordered_set<int>, emplace, rand(), SCALE_M(LEN1), SCALE_M(LEN2), SCALE_M(LEN3));
#endif
std::cout << std::endl;
std::cout << "|---------------------|-------------|-------------|-------------|" << std::endl;
PASSED;
#endif
std::cout << "[-------------- End container test : unordered_set -------------]" << std::endl;
}
void unordered_multiset_test()
{
std::cout << "[===============================================================]" << std::endl;
std::cout << "[------------ Run container test : unordered_multiset ----------]" << std::endl;
std::cout << "[-------------------------- API test ---------------------------]" << std::endl;
int a[] = { 5,4,3,2,1 };
mystl::unordered_multiset<int> us1;
mystl::unordered_multiset<int> us2(520);
mystl::unordered_multiset<int> us3(520, mystl::hash<int>());
mystl::unordered_multiset<int> us4(520, mystl::hash<int>(), mystl::equal_to<int>());
mystl::unordered_multiset<int> us5(a, a + 5);
mystl::unordered_multiset<int> us6(a, a + 5, 100);
mystl::unordered_multiset<int> us7(a, a + 5, 100, mystl::hash<int>());
mystl::unordered_multiset<int> us8(a, a + 5, 100, mystl::hash<int>(), mystl::equal_to<int>());
mystl::unordered_multiset<int> us9(us5);
mystl::unordered_multiset<int> us10(std::move(us5));
mystl::unordered_multiset<int> us11;
us11 = us6;
mystl::unordered_multiset<int> us12;
us12 = std::move(us6);
mystl::unordered_multiset<int> us13{ 1,2,3,4,5 };
mystl::unordered_multiset<int> us14;
us14 = { 1,2,3,4,5 };
FUN_AFTER(us1, us1.emplace(1));
FUN_AFTER(us1, us1.emplace_hint(us1.end(), 2));
FUN_AFTER(us1, us1.insert(5));
FUN_AFTER(us1, us1.insert(us1.begin(), 5));
FUN_AFTER(us1, us1.insert(a, a + 5));
FUN_AFTER(us1, us1.erase(us1.begin()));
FUN_AFTER(us1, us1.erase(us1.begin(), us1.find(3)));
FUN_AFTER(us1, us1.erase(1));
std::cout << std::boolalpha;
FUN_VALUE(us1.empty());
std::cout << std::noboolalpha;
FUN_VALUE(us1.size());
FUN_VALUE(us1.bucket_count());
FUN_VALUE(us1.max_bucket_count());
FUN_VALUE(us1.bucket(1));
FUN_VALUE(us1.bucket_size(us1.bucket(5)));
FUN_AFTER(us1, us1.clear());
FUN_AFTER(us1, us1.swap(us7));
FUN_VALUE(*us1.begin());
std::cout << std::boolalpha;
FUN_VALUE(us1.empty());
std::cout << std::noboolalpha;
FUN_VALUE(us1.size());
FUN_VALUE(us1.max_size());
FUN_VALUE(us1.bucket_count());
FUN_AFTER(us1, us1.reserve(1000));
FUN_VALUE(*us1.begin(us1.bucket(1)));
FUN_VALUE(us1.size());
FUN_VALUE(us1.bucket_count());
FUN_VALUE(us1.bucket_size(1));
FUN_VALUE(us1.bucket_size(2));
FUN_VALUE(us1.bucket_size(3));
FUN_AFTER(us1, us1.rehash(150));
FUN_VALUE(us1.bucket_count());
FUN_VALUE(us1.count(1));
FUN_VALUE(*us1.find(3));
auto first = *us1.equal_range(3).first;
auto second = *us1.equal_range(3).second;
std::cout << " us1.equal_range(3) : from " << first << " to " << second << std::endl;
FUN_VALUE(us1.load_factor());
FUN_VALUE(us1.max_load_factor());
FUN_AFTER(us1, us1.max_load_factor(1.5f));
FUN_VALUE(us1.max_load_factor());
PASSED;
#if PERFORMANCE_TEST_ON
std::cout << "[--------------------- Performance Testing ---------------------]" << std::endl;
std::cout << "|---------------------|-------------|-------------|-------------|" << std::endl;
std::cout << "| emplace |";
#if LARGER_TEST_DATA_ON
CON_TEST_P1(unordered_multiset<int>, emplace, rand(), SCALE_M(LEN1), SCALE_M(LEN2), SCALE_M(LEN3));
#else
CON_TEST_P1(unordered_multiset<int>, emplace, rand(), SCALE_S(LEN1), SCALE_S(LEN2), SCALE_S(LEN3));
#endif
std::cout << std::endl;
std::cout << "|---------------------|-------------|-------------|-------------|" << std::endl;
PASSED;
#endif
std::cout << "[------------ End container test : unordered_multiset ----------]" << std::endl;
}
} // namespace unordered_set_test
} // namespace test
} // namespace mystl
#endif // !MYTINYSTL_UNORDERED_SET_TEST_H_