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
|
#include <QTest>
#include <QDebug>
#include <QStandardItemModel>
#include "krecursivefilterproxymodel.h"
#include "folderlistmodel.h"
class TestModel : public KRecursiveFilterProxyModel {
public:
TestModel()
:KRecursiveFilterProxyModel()
{
auto model = QSharedPointer<QStandardItemModel>::create();
setSourceModel(model.data());
mModel = model;
}
bool lessThan(const QModelIndex &left, const QModelIndex &right) const Q_DECL_OVERRIDE
{
return left.data(Qt::DisplayRole).toString() < right.data(Qt::DisplayRole).toString();
}
bool acceptRow(int sourceRow, const QModelIndex &sourceParent) const Q_DECL_OVERRIDE
{
auto index = sourceModel()->index(sourceRow, 0, sourceParent);
return index.data(Qt::DisplayRole).toString().contains("accept");
}
QSharedPointer<QStandardItemModel> mModel;
};
bool contains(QAbstractItemModel &model, const QModelIndex &parent, QString s)
{
for (int row = 0; row < model.rowCount(parent); row++) {
auto idx = model.index(row, 0, parent);
if (idx.data(Qt::DisplayRole).toString() == s) {
return true;
}
if (contains(model, idx, s)) {
return true;
}
}
return false;
}
class FolderlistModelTest : public QObject
{
Q_OBJECT
private slots:
void initTestCase()
{
}
void testRecursiveFilterModel()
{
TestModel model;
auto root = new QStandardItem{"acceptroot"};
model.mModel->appendRow(root);
auto item = new QStandardItem{"accept1"};
root->appendRow(item);
item->appendRow(new QStandardItem{"accept11"});
QVERIFY(contains(model, {}, "acceptroot"));
QVERIFY(contains(model, {}, "accept1"));
QVERIFY(contains(model, {}, "accept11"));
}
};
QTEST_MAIN(FolderlistModelTest)
#include "folderlistmodeltest.moc"
|
