|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the test suite of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 #include <QtGui> |
|
42 #include <QString> |
|
43 |
|
44 #include <qtest.h> |
|
45 |
|
46 class tst_associative_containers : public QObject |
|
47 { |
|
48 Q_OBJECT |
|
49 private slots: |
|
50 void insert_data(); |
|
51 void insert(); |
|
52 void lookup_data(); |
|
53 void lookup(); |
|
54 }; |
|
55 |
|
56 template <typename T> |
|
57 void testInsert(int size) |
|
58 { |
|
59 T container; |
|
60 |
|
61 QBENCHMARK { |
|
62 for (int i = 0; i < size; ++i) |
|
63 container.insert(i, i); |
|
64 } |
|
65 } |
|
66 |
|
67 void tst_associative_containers::insert_data() |
|
68 { |
|
69 QTest::addColumn<bool>("useHash"); |
|
70 QTest::addColumn<int>("size"); |
|
71 |
|
72 for (int size = 10; size < 20000; size += 100) { |
|
73 |
|
74 const QByteArray sizeString = QByteArray::number(size); |
|
75 |
|
76 QTest::newRow(("hash--" + sizeString).constData()) << true << size; |
|
77 QTest::newRow(("map--" + sizeString).constData()) << false << size; |
|
78 } |
|
79 } |
|
80 |
|
81 void tst_associative_containers::insert() |
|
82 { |
|
83 QFETCH(bool, useHash); |
|
84 QFETCH(int, size); |
|
85 |
|
86 QHash<int, int> testHash; |
|
87 QMap<int, int> testMap; |
|
88 |
|
89 if (useHash) { |
|
90 testInsert<QHash<int, int> >(size); |
|
91 } else { |
|
92 testInsert<QMap<int, int> >(size); |
|
93 } |
|
94 } |
|
95 |
|
96 void tst_associative_containers::lookup_data() |
|
97 { |
|
98 // setReportType(LineChartReport); |
|
99 // setChartTitle("Time to call value(), with an increasing number of items in the container"); |
|
100 |
|
101 QTest::addColumn<bool>("useHash"); |
|
102 QTest::addColumn<int>("size"); |
|
103 |
|
104 for (int size = 10; size < 20000; size += 100) { |
|
105 |
|
106 const QByteArray sizeString = QByteArray::number(size); |
|
107 |
|
108 QTest::newRow(("hash--" + sizeString).constData()) << true << size; |
|
109 QTest::newRow(("map--" + sizeString).constData()) << false << size; |
|
110 } |
|
111 } |
|
112 |
|
113 template <typename T> |
|
114 void testLookup(int size) |
|
115 { |
|
116 T container; |
|
117 |
|
118 for (int i = 0; i < size; ++i) |
|
119 container.insert(i, i); |
|
120 |
|
121 int val; |
|
122 |
|
123 QBENCHMARK { |
|
124 for (int i = 0; i < size; ++i) |
|
125 val = container.value(i); |
|
126 |
|
127 } |
|
128 } |
|
129 |
|
130 void tst_associative_containers::lookup() |
|
131 { |
|
132 QFETCH(bool, useHash); |
|
133 QFETCH(int, size); |
|
134 |
|
135 if (useHash) { |
|
136 testLookup<QHash<int, int> >(size); |
|
137 } else { |
|
138 testLookup<QMap<int, int> >(size); |
|
139 } |
|
140 } |
|
141 |
|
142 QTEST_MAIN(tst_associative_containers) |
|
143 #include "main.moc" |