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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/***************************************************************************
* Copyright (C) 2011 by Peter Penz <[email protected]> *
* Copyright (C) 2013 by Frank Reininghaus <[email protected]> *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *
***************************************************************************/
#include <QTest>
#include <QSignalSpy>
#include <algorithm>
#include <random>
#include "kitemviews/kfileitemmodel.h"
#include "kitemviews/private/kfileitemmodelsortalgorithm.h"
#include "testdir.h"
void myMessageOutput(QtMsgType type, const QMessageLogContext& context, const QString& msg)
{
Q_UNUSED(context);
switch (type) {
case QtDebugMsg:
break;
case QtWarningMsg:
break;
case QtCriticalMsg:
fprintf(stderr, "Critical: %s\n", msg.toLocal8Bit().data());
break;
case QtFatalMsg:
fprintf(stderr, "Fatal: %s\n", msg.toLocal8Bit().data());
abort();
default:
break;
}
}
Q_DECLARE_METATYPE(KFileItemList)
Q_DECLARE_METATYPE(KItemRangeList)
class KFileItemModelBenchmark : public QObject
{
Q_OBJECT
public:
KFileItemModelBenchmark();
private slots:
void insertAndRemoveManyItems_data();
void insertAndRemoveManyItems();
private:
static KFileItemList createFileItemList(const QStringList& fileNames, const QString& urlPrefix = QLatin1String("file:///"));
};
KFileItemModelBenchmark::KFileItemModelBenchmark()
{
}
void KFileItemModelBenchmark::insertAndRemoveManyItems_data()
{
QTest::addColumn<KFileItemList>("initialItems");
QTest::addColumn<KFileItemList>("newItems");
QTest::addColumn<KFileItemList>("removedItems");
QTest::addColumn<KFileItemList>("expectedFinalItems");
QTest::addColumn<KItemRangeList>("expectedItemsInserted");
QTest::addColumn<KItemRangeList>("expectedItemsRemoved");
QList<int> sizes;
sizes << 100000;
foreach (int n, sizes) {
QStringList allStrings;
for (int i = 0; i < n; ++i) {
allStrings << QString::number(i);
}
// We want to keep the sorting overhead in the benchmark low.
// Therefore, we do not use natural sorting. However, this
// means that our list is currently not sorted.
allStrings.sort();
KFileItemList all = createFileItemList(allStrings);
KFileItemList firstHalf, secondHalf, even, odd;
for (int i = 0; i < n; ++i) {
if (i < n / 2) {
firstHalf << all.at(i);
} else {
secondHalf << all.at(i);
}
if (i % 2 == 0) {
even << all.at(i);
} else {
odd << all.at(i);
}
}
KItemRangeList itemRangeListFirstHalf;
itemRangeListFirstHalf << KItemRange(0, firstHalf.count());
KItemRangeList itemRangeListSecondHalf;
itemRangeListSecondHalf << KItemRange(firstHalf.count(), secondHalf.count());
KItemRangeList itemRangeListOddInserted, itemRangeListOddRemoved;
for (int i = 0; i < odd.count(); ++i) {
// Note that the index in the KItemRange is the index of
// the model *before* the items have been inserted.
itemRangeListOddInserted << KItemRange(i + 1, 1);
itemRangeListOddRemoved << KItemRange(2 * i + 1, 1);
}
const int bufferSize = 128;
char buffer[bufferSize];
snprintf(buffer, bufferSize, "all--n=%i", n);
QTest::newRow(buffer) << all << KFileItemList() << KFileItemList() << all << KItemRangeList() << KItemRangeList();
snprintf(buffer, bufferSize, "1st half + 2nd half--n=%i", n);
QTest::newRow(buffer) << firstHalf << secondHalf << KFileItemList() << all << itemRangeListSecondHalf << KItemRangeList();
snprintf(buffer, bufferSize, "2nd half + 1st half--n=%i", n);
QTest::newRow(buffer) << secondHalf << firstHalf << KFileItemList() << all << itemRangeListFirstHalf << KItemRangeList();
snprintf(buffer, bufferSize, "even + odd--n=%i", n);
QTest::newRow(buffer) << even << odd << KFileItemList() << all << itemRangeListOddInserted << KItemRangeList();
snprintf(buffer, bufferSize, "all - 2nd half--n=%i", n);
QTest::newRow(buffer) << all << KFileItemList() << secondHalf << firstHalf << KItemRangeList() << itemRangeListSecondHalf;
snprintf(buffer, bufferSize, "all - 1st half--n=%i", n);
QTest::newRow(buffer) << all << KFileItemList() << firstHalf << secondHalf << KItemRangeList() << itemRangeListFirstHalf;
snprintf(buffer, bufferSize, "all - odd--n=%i", n);
QTest::newRow(buffer) << all << KFileItemList() << odd << even << KItemRangeList() << itemRangeListOddRemoved;
}
}
void KFileItemModelBenchmark::insertAndRemoveManyItems()
{
QFETCH(KFileItemList, initialItems);
QFETCH(KFileItemList, newItems);
QFETCH(KFileItemList, removedItems);
QFETCH(KFileItemList, expectedFinalItems);
QFETCH(KItemRangeList, expectedItemsInserted);
QFETCH(KItemRangeList, expectedItemsRemoved);
KFileItemModel model;
// Avoid overhead caused by natural sorting
// and determining the isDir/isLink roles.
model.m_naturalSorting = false;
model.setRoles({"text"});
QSignalSpy spyItemsInserted(&model, &KFileItemModel::itemsInserted);
QSignalSpy spyItemsRemoved(&model, &KFileItemModel::itemsRemoved);
QBENCHMARK {
model.slotClear();
model.slotItemsAdded(model.directory(), initialItems);
model.slotCompleted();
QCOMPARE(model.count(), initialItems.count());
if (!newItems.isEmpty()) {
model.slotItemsAdded(model.directory(), newItems);
model.slotCompleted();
}
QCOMPARE(model.count(), initialItems.count() + newItems.count());
if (!removedItems.isEmpty()) {
model.slotItemsDeleted(removedItems);
}
QCOMPARE(model.count(), initialItems.count() + newItems.count() - removedItems.count());
}
QVERIFY(model.isConsistent());
for (int i = 0; i < model.count(); ++i) {
QCOMPARE(model.fileItem(i), expectedFinalItems.at(i));
}
if (!expectedItemsInserted.empty()) {
QVERIFY(!spyItemsInserted.empty());
const KItemRangeList actualItemsInserted = spyItemsInserted.last().first().value<KItemRangeList>();
QCOMPARE(actualItemsInserted, expectedItemsInserted);
}
if (!expectedItemsRemoved.empty()) {
QVERIFY(!spyItemsRemoved.empty());
const KItemRangeList actualItemsRemoved = spyItemsRemoved.last().first().value<KItemRangeList>();
QCOMPARE(actualItemsRemoved, expectedItemsRemoved);
}
}
KFileItemList KFileItemModelBenchmark::createFileItemList(const QStringList& fileNames, const QString& prefix)
{
// Suppress 'file does not exist anymore' messages from KFileItemPrivate::init().
qInstallMessageHandler(myMessageOutput);
KFileItemList result;
foreach (const QString& name, fileNames) {
const KFileItem item(QUrl::fromLocalFile(prefix + name), QString(), KFileItem::Unknown);
result << item;
}
return result;
}
QTEST_MAIN(KFileItemModelBenchmark)
#include "kfileitemmodelbenchmark.moc"
|
