blob: 3e0c45bb1ad0c398687ff7798dc30f1d5f588b0d (
plain)
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
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include "randomsortmodel.h"
#include <QRandomGenerator>
RandomSortModel::RandomSortModel(QObject* parent):
QAbstractListModel(parent)
{
for (int i = 0; i < 10; ++i) {
mData.append(qMakePair(QString::fromLatin1("Item %1").arg(i), i * 10));
}
}
QHash<int, QByteArray> RandomSortModel::roleNames() const
{
QHash<int,QByteArray> roles = QAbstractItemModel::roleNames();
roles[Qt::UserRole] = "SortRole";
return roles;
}
int RandomSortModel::rowCount(const QModelIndex& parent) const
{
if (!parent.isValid())
return mData.size();
return 0;
}
QVariant RandomSortModel::data(const QModelIndex& index, int role) const
{
if (!index.isValid()) {
return QVariant();
}
if (index.row() >= mData.size()) {
return QVariant();
}
if (role == Qt::DisplayRole) {
return QString::fromLatin1("%1 (weight %2)").arg(mData[index.row()].first).arg(mData[index.row()].second);
} else if (role == Qt::UserRole) {
return mData[index.row()].second;
}
return QVariant();
}
void RandomSortModel::randomize()
{
const int row = QRandomGenerator::global()->bounded(mData.size());
int random;
bool exists = false;
// Make sure we won't end up with two items with the same weight, as that
// would make unit-testing much harder
do {
exists = false;
random = QRandomGenerator::global()->bounded(mData.size() * 10);
QList<QPair<QString, int> >::ConstIterator iter, end;
for (iter = mData.constBegin(), end = mData.constEnd(); iter != end; ++iter) {
if ((*iter).second == random) {
exists = true;
break;
}
}
} while (exists);
mData[row].second = random;
Q_EMIT dataChanged(index(row, 0), index(row, 0));
}
|
