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
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Copyright (C) 2012 Robin Burchell <robin+qt@viroteck.net>
** 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 <QtTest/QtTest>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <algorithm>
#include <qalgorithms.h>
#include <QStringList>
#include <QString>
#include <QList>
using namespace std;
class tst_QAlgorithms : public QObject
{
Q_OBJECT
private slots:
void stableSort_data();
void stableSort();
void sort_data();
void sort();
};
template<typename DataType>
QList<DataType> generateData(QString dataSetType, const int length)
{
QList<DataType> container;
if (dataSetType == "Random") {
for (int i = 0; i < length; ++i)
container.append(QRandomGenerator::global()->generate());
} else if (dataSetType == "Ascending") {
for (int i = 0; i < length; ++i)
container.append(i);
} else if (dataSetType == "Descending") {
for (int i = 0; i < length; ++i)
container.append(length - i);
} else if (dataSetType == "Equal") {
for (int i = 0; i < length; ++i)
container.append(43);
} else if (dataSetType == "Duplicates") {
for (int i = 0; i < length; ++i)
container.append(i % 10);
} else if (dataSetType == "Almost Sorted") {
for (int i = 0; i < length; ++i)
container.append(i);
for (int i = 0; i<= length / 10; ++i) {
const int iswap = i * 9;
DataType tmp = container.at(iswap);
container[iswap] = container.at(iswap + 1);
container[iswap + 1] = tmp;
}
}
return container;
}
void tst_QAlgorithms::stableSort_data()
{
const int dataSize = 5000;
QTest::addColumn<QList<int>>("unsorted");
QTest::newRow("Equal") << (generateData<int>("Equal", dataSize));
QTest::newRow("Ascending") << (generateData<int>("Ascending", dataSize));
QTest::newRow("Descending") << (generateData<int>("Descending", dataSize));
QTest::newRow("Duplicates") << (generateData<int>("Duplicates", dataSize));
QTest::newRow("Almost Sorted") << (generateData<int>("Almost Sorted", dataSize));
}
void tst_QAlgorithms::stableSort()
{
QFETCH(QList<int>, unsorted);
QBENCHMARK {
QList<int> sorted = unsorted;
qStableSort(sorted.begin(), sorted.end());
}
}
void tst_QAlgorithms::sort_data()
{
stableSort_data();
}
void tst_QAlgorithms::sort()
{
QFETCH(QList<int>, unsorted);
QBENCHMARK {
QList<int> sorted = unsorted;
qSort(sorted.begin(), sorted.end());
}
}
QTEST_MAIN(tst_QAlgorithms)
#include "tst_qalgorithms.moc"
|
