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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only
#include <QSet>
#include <QTest>
class tst_QSet : public QObject
{
Q_OBJECT
private slots:
void initTestCase();
void intersect_int_data();
void intersect_int();
void intersect_complexType_data();
void intersect_complexType();
void unite_int_data();
void unite_int();
void contains_then_insert_int_data();
void contains_then_insert_int();
};
void tst_QSet::initTestCase()
{
QHashSeed::setDeterministicGlobalSeed();
}
void tst_QSet::intersect_int_data()
{
QTest::addColumn<int>("lhsSize");
QTest::addColumn<int>("rhsSize");
QTest::addColumn<int>("intersectSize");
QTest::newRow("1000000.intersect(1000) = empty") << 1000000 << 1000 << 0;
QTest::newRow("1000.intersect(1000000) = empty") << 1000 << 1000000 << 0;
QTest::newRow("1000000.intersect(1000) = 500") << 1000000 << 1000 << 500;
QTest::newRow("1000.intersect(1000000) = 500") << 1000 << 1000000 << 500;
QTest::newRow("1000000.intersect(1000) = 1000") << 1000000 << 1000 << 1000;
QTest::newRow("1000.intersect(1000000) = 1000") << 1000 << 1000000 << 1000;
}
void tst_QSet::intersect_int()
{
QFETCH(int, lhsSize);
QFETCH(int, rhsSize);
QFETCH(int, intersectSize);
// E.g. when lhsSize = 1000, rhsSize = 1000000 and intersectSize = 500:
// lhsSize = { 0, 1, ... 1000 }
// rhsSize = { 500, 501, ... 1000500 }
QSet<int> lhs;
for (int i = 0; i < lhsSize; ++i)
lhs.insert(i);
QSet<int> rhs;
const int start = lhsSize - intersectSize;
for (int i = start; i < start + rhsSize; ++i)
rhs.insert(i);
QBENCHMARK {
lhs.intersect(rhs);
}
QVERIFY(lhs.size() == intersectSize);
}
struct ComplexType
{
ComplexType(int a) : a(a) {}
int a;
int b;
int c;
};
inline uint qHash(const ComplexType &key, uint seed = 0)
{
return uint(key.a) ^ seed;
}
inline bool operator==(const ComplexType &lhs, const ComplexType &rhs)
{
return lhs.a == rhs.a;
}
void tst_QSet::intersect_complexType_data()
{
intersect_int_data();
}
void tst_QSet::intersect_complexType()
{
QFETCH(int, lhsSize);
QFETCH(int, rhsSize);
QFETCH(int, intersectSize);
QSet<ComplexType> lhs;
for (int i = 0; i < lhsSize; ++i)
lhs.insert(ComplexType(i));
QSet<ComplexType> rhs;
const int start = lhsSize - intersectSize;
for (int i = start; i < start + rhsSize; ++i)
rhs.insert(ComplexType(i));
QBENCHMARK {
lhs.intersect(rhs);
}
}
void tst_QSet::unite_int_data()
{
QTest::addColumn<int>("lhsSize");
QTest::addColumn<int>("rhsSize");
QTest::addColumn<int>("overlap");
QTest::newRow("1000000.unite(1000) - 0 overlap") << 1000000 << 1000 << 0;
QTest::newRow("1000000.unite(1000) - 100 overlap") << 1000000 << 1000 << 100;
QTest::newRow("1000000.unite(1000) - 1000 overlap") << 1000000 << 1000 << 1000;
QTest::newRow("1000.unite(1000000) - 0 overlap") << 1000 << 1000000 << 0;
QTest::newRow("1000.unite(1000000) - 100 overlap") << 1000 << 1000000 << 100;
QTest::newRow("1000.unite(1000000) - 1000 overlap") << 1000 << 1000000 << 1000;
}
auto build_sets(int lhsSize, int rhsSize, int overlap)
{
QSet<int> lhs;
for (int i = 0; i < lhsSize; ++i)
lhs.insert(i);
QSet<int> rhs;
for (int i = lhsSize - overlap; i < rhsSize + lhsSize - overlap; ++i)
rhs.insert(i);
return std::make_pair(lhs, rhs);
}
void tst_QSet::unite_int()
{
QFETCH(int, lhsSize);
QFETCH(int, rhsSize);
QFETCH(int, overlap);
auto [lhs, rhs] = build_sets(lhsSize, rhsSize, overlap);
QBENCHMARK {
QSet united = QSet(lhs).unite(rhs);
QCOMPARE(united.size(), lhsSize + rhsSize - overlap);
}
}
void tst_QSet::contains_then_insert_int_data()
{
unite_int_data();
}
void tst_QSet::contains_then_insert_int()
{
QFETCH(int, lhsSize);
QFETCH(int, rhsSize);
QFETCH(int, overlap);
auto [lhs, rhs] = build_sets(lhsSize, rhsSize, overlap);
QBENCHMARK {
QSet copy(lhs);
for (auto i : rhs) {
if (!copy.contains(i))
copy.insert(i);
}
QCOMPARE(copy.size(), lhsSize + rhsSize - overlap);
}
}
QTEST_MAIN(tst_QSet)
#include "tst_bench_qset.moc"
|
