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
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QString>
#include <qtest.h>
class tst_associative_containers : public QObject
{
Q_OBJECT
private slots:
void insert_data();
void insert();
void lookup_data();
void lookup();
};
template <typename T>
void testInsert(int size)
{
T container;
QBENCHMARK {
for (int i = 0; i < size; ++i)
container.insert(i, i);
}
}
void tst_associative_containers::insert_data()
{
QTest::addColumn<bool>("useHash");
QTest::addColumn<int>("size");
for (int size = 10; size < 20000; size += 100) {
const QByteArray sizeString = QByteArray::number(size);
QTest::newRow(QByteArray("hash--" + sizeString).constData()) << true << size;
QTest::newRow(QByteArray("map--" + sizeString).constData()) << false << size;
}
}
void tst_associative_containers::insert()
{
QFETCH(bool, useHash);
QFETCH(int, size);
QHash<int, int> testHash;
QMap<int, int> testMap;
if (useHash) {
testInsert<QHash<int, int> >(size);
} else {
testInsert<QMap<int, int> >(size);
}
}
void tst_associative_containers::lookup_data()
{
// setReportType(LineChartReport);
// setChartTitle("Time to call value(), with an increasing number of items in the container");
QTest::addColumn<bool>("useHash");
QTest::addColumn<int>("size");
for (int size = 10; size < 20000; size += 100) {
const QByteArray sizeString = QByteArray::number(size);
QTest::newRow(QByteArray("hash--" + sizeString).constData()) << true << size;
QTest::newRow(QByteArray("map--" + sizeString).constData()) << false << size;
}
}
template <typename T>
void testLookup(int size)
{
T container;
for (int i = 0; i < size; ++i)
container.insert(i, i);
int val;
QBENCHMARK {
for (int i = 0; i < size; ++i)
val = container.value(i);
}
}
void tst_associative_containers::lookup()
{
QFETCH(bool, useHash);
QFETCH(int, size);
if (useHash) {
testLookup<QHash<int, int> >(size);
} else {
testLookup<QMap<int, int> >(size);
}
}
QTEST_MAIN(tst_associative_containers)
#include "main.moc"
|
