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
|
/***************************************************************************
* Copyright (C) 2011 by Peter Penz <[email protected]> *
* Copyright (C) 2011 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 "dolphindebug.h"
#include "kitemviews/kstandarditem.h"
#include "kitemviews/kstandarditemmodel.h"
#include <QTest>
class KStandardItemModelTest : public QObject
{
Q_OBJECT
private slots:
void init();
void cleanup();
void testNewItems();
void testRemoveItems();
private:
bool isModelConsistent() const;
private:
KStandardItemModel* m_model;
};
void KStandardItemModelTest::init()
{
m_model = new KStandardItemModel();
}
void KStandardItemModelTest::cleanup()
{
delete m_model;
m_model = 0;
}
void KStandardItemModelTest::testNewItems()
{
m_model->insertItem(0, new KStandardItem("item 1"));
m_model->insertItem(0, new KStandardItem("item 2"));
m_model->insertItem(2, new KStandardItem("item 3"));
m_model->appendItem(new KStandardItem("item 4"));
m_model->insertItem(-1, new KStandardItem("invalid 1"));
m_model->insertItem(5, new KStandardItem("invalid 2"));
QCOMPARE(m_model->count(), 4);
QCOMPARE(m_model->item(0)->text(), QString("item 2"));
QCOMPARE(m_model->item(1)->text(), QString("item 1"));
QCOMPARE(m_model->item(2)->text(), QString("item 3"));
QCOMPARE(m_model->item(3)->text(), QString("item 4"));
QVERIFY(isModelConsistent());
}
void KStandardItemModelTest::testRemoveItems()
{
for (int i = 1; i <= 10; ++i) {
m_model->appendItem(new KStandardItem("item " + QString::number(i)));
}
m_model->removeItem(0);
m_model->removeItem(3);
m_model->removeItem(5);
m_model->removeItem(-1);
QCOMPARE(m_model->count(), 7);
QCOMPARE(m_model->item(0)->text(), QString("item 2"));
QCOMPARE(m_model->item(1)->text(), QString("item 3"));
QCOMPARE(m_model->item(2)->text(), QString("item 4"));
QCOMPARE(m_model->item(3)->text(), QString("item 6"));
QCOMPARE(m_model->item(4)->text(), QString("item 7"));
QCOMPARE(m_model->item(5)->text(), QString("item 9"));
QCOMPARE(m_model->item(6)->text(), QString("item 10"));
}
bool KStandardItemModelTest::isModelConsistent() const
{
if (m_model->m_items.count() != m_model->m_indexesForItems.count()) {
return false;
}
for (int i = 0; i < m_model->count(); ++i) {
const KStandardItem* item = m_model->item(i);
if (!item) {
qCWarning(DolphinDebug) << "Item" << i << "is null";
return false;
}
const int itemIndex = m_model->index(item);
if (itemIndex != i) {
qCWarning(DolphinDebug) << "Item" << i << "has a wrong index:" << itemIndex;
return false;
}
}
return true;
}
QTEST_GUILESS_MAIN(KStandardItemModelTest)
#include "kstandarditemmodeltest.moc"
|
