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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include <QSet>
#include <QTest>
class tst_QSet : public QObject
{
Q_OBJECT
private slots:
void intersect_int_data();
void intersect_int();
void intersect_complexType_data();
void intersect_complexType();
};
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);
}
}
QTEST_MAIN(tst_QSet)
#include "tst_bench_qset.moc"
|
