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
|
/*
This file is part of the KDE Baloo project.
SPDX-FileCopyrightText: 2015 Vishesh Handa <vhanda@kde.org>
SPDX-License-Identifier: LGPL-2.1-or-later
*/
#include "positioncodec.h"
#include "positioninfo.h"
#include <QTest>
using namespace Baloo;
class PositionCodecBenchmark : public QObject
{
Q_OBJECT
private Q_SLOTS:
void initTestCase();
// data 1 - small number of documents, each with many positions
void benchEncodeData1();
void benchDecodeData1();
// data 2 - large number of documents, few positions (10) each
void benchEncodeData2();
void benchDecodeData2();
// data 3 - small number of documents, many positions with large increment
void benchEncodeData3();
void benchDecodeData3();
private:
QVector<PositionInfo> m_benchmarkData1;
QVector<PositionInfo> m_benchmarkData2;
QVector<PositionInfo> m_benchmarkData3;
};
void PositionCodecBenchmark::initTestCase()
{
/*
* Same dataset as in autotests/unit/codecs/positioncodectest.cpp
* Correctness of encoding/decoding is checked there.
*/
m_benchmarkData1.clear();
m_benchmarkData1.reserve(100);
for(int i = 0; i < 100; ++i)
{
PositionInfo info;
info.docId = (i + 1) * 4711;
info.positions.reserve(3000);
for (int j = 0; j < 3000; j++) {
info.positions.append(((j + 1) * (i + 2)));
}
m_benchmarkData1.append(info);
}
m_benchmarkData2.clear();
m_benchmarkData2.reserve(5000);
for (int i = 0; i < 5000; i++) {
PositionInfo info;
info.docId = i;
info.positions = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
m_benchmarkData2.append(info);
}
m_benchmarkData3.clear();
m_benchmarkData3.reserve(200);
for (int i = 0; i < 200; i++) {
PositionInfo info;
info.docId = i;
info.positions.reserve(30000); // > 2^14 -> 3 byte VarInt32
for (int j = 0; j < 30000; j++) {
info.positions.append((j + 1) * 200); // increment 200 -> 2 byte DiffVarInt32
}
m_benchmarkData3.append(info);
}
}
void PositionCodecBenchmark::benchEncodeData1()
{
PositionCodec pc;
QBENCHMARK { pc.encode(m_benchmarkData1); }
}
void PositionCodecBenchmark::benchDecodeData1()
{
PositionCodec pc;
const QByteArray ba = pc.encode(m_benchmarkData1);
QBENCHMARK { pc.decode(ba); }
}
void PositionCodecBenchmark::benchEncodeData2()
{
PositionCodec pc;
QBENCHMARK { pc.encode(m_benchmarkData2); }
}
void PositionCodecBenchmark::benchDecodeData2()
{
PositionCodec pc;
const QByteArray ba = pc.encode(m_benchmarkData2);
QBENCHMARK { pc.decode(ba); }
}
void PositionCodecBenchmark::benchEncodeData3()
{
PositionCodec pc;
QBENCHMARK { pc.encode(m_benchmarkData3); }
}
void PositionCodecBenchmark::benchDecodeData3()
{
PositionCodec pc;
const QByteArray ba = pc.encode(m_benchmarkData3);
QBENCHMARK { pc.decode(ba); }
}
QTEST_MAIN(PositionCodecBenchmark)
#include "positioncodecbenchmark.moc"
|
