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
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** 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 Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QFile>
#include <QMap>
#include <QString>
#include <QTest>
#include <qdebug.h>
class tst_QMap : public QObject
{
Q_OBJECT
private slots:
void insertion_int_int();
void insertion_int_string();
void insertion_string_int();
void lookup_int_int();
void lookup_int_string();
void lookup_string_int();
void iteration();
};
void tst_QMap::insertion_int_int()
{
QMap<int, int> map;
QBENCHMARK {
for (int i = 0; i < 100000; ++i)
map.insert(i, i);
}
}
void tst_QMap::insertion_int_string()
{
QMap<int, QString> map;
QString str("Hello World");
QBENCHMARK {
for (int i = 0; i < 100000; ++i)
map.insert(i, str);
}
}
void tst_QMap::insertion_string_int()
{
QMap<QString, int> map;
QString str("Hello World");
QBENCHMARK {
for (int i = 1; i < 100000; ++i) {
str[0] = QChar(i);
map.insert(str, i);
}
}
}
void tst_QMap::lookup_int_int()
{
QMap<int, int> map;
for (int i = 0; i < 100000; ++i)
map.insert(i, i);
int sum = 0;
QBENCHMARK {
for (int i = 0; i < 100000; ++i)
sum += map.value(i);
}
}
void tst_QMap::lookup_int_string()
{
QMap<int, QString> map;
QString str("Hello World");
for (int i = 0; i < 100000; ++i)
map.insert(i, str);
QBENCHMARK {
for (int i = 0; i < 100000; ++i)
str += map.value(i);
}
}
void tst_QMap::lookup_string_int()
{
QMap<QString, int> map;
QString str("Hello World");
for (int i = 1; i < 100000; ++i) {
str[0] = QChar(i);
map.insert(str, i);
}
int sum = 0;
QBENCHMARK {
for (int i = 1; i < 100000; ++i) {
str[0] = QChar(i);
sum += map.value(str);
}
}
}
// iteration speed doesn't depend on the type of the map.
void tst_QMap::iteration()
{
QMap<int, int> map;
for (int i = 0; i < 100000; ++i)
map.insert(i, i);
int j = 0;
QBENCHMARK {
for (int i = 0; i < 100; ++i) {
QMap<int, int>::const_iterator it = map.constBegin();
QMap<int, int>::const_iterator end = map.constEnd();
while (it != end) {
j += *it;
++it;
}
}
}
}
QTEST_MAIN(tst_QMap)
#include "main.moc"
|
