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
128
129
|
/*
* Copyright 2015 Laszlo Kis-Adam <laszlo.kis-adam@kdemail.net>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Library 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 <QTest>
#include <shell/problemstorenode.h>
#include <shell/problem.h>
using namespace KDevelop;
class TestProblemStoreNode : public QObject
{
Q_OBJECT
private Q_SLOTS:
void initTestCase();
void cleanupTestCase();
void testRootNode();
void testChildren();
void testLabelNode();
void testProblemNode();
private:
QScopedPointer<ProblemStoreNode> m_root;
};
void TestProblemStoreNode::initTestCase()
{
m_root.reset(new ProblemStoreNode());
}
void TestProblemStoreNode::cleanupTestCase()
{
}
void TestProblemStoreNode::testRootNode()
{
QVERIFY(m_root->isRoot());
QVERIFY(m_root->parent() == nullptr);
QCOMPARE(m_root->index(), -1);
QCOMPARE(m_root->count(), 0);
QCOMPARE(m_root->children().count(), 0);
QVERIFY(m_root->label().isEmpty());
QVERIFY(m_root->problem().constData() == nullptr);
}
void TestProblemStoreNode::testChildren()
{
QVector<ProblemStoreNode*> nodes;
nodes.push_back(new ProblemStoreNode());
nodes.push_back(new ProblemStoreNode());
nodes.push_back(new ProblemStoreNode());
int c = 0;
for (ProblemStoreNode* node : qAsConst(nodes)) {
m_root->addChild(node);
c++;
QCOMPARE(m_root->count(), c);
QCOMPARE(m_root->children().count(), c);
QVERIFY(node->parent() == m_root.data());
QVERIFY(!node->isRoot());
}
for (int i = 0; i < c; i++) {
ProblemStoreNode *node = m_root->child(i);
QVERIFY(node);
QVERIFY(node == nodes[i]);
QCOMPARE(node->index(), i);
}
nodes.clear();
m_root->clear();
QCOMPARE(m_root->count(), 0);
}
void TestProblemStoreNode::testLabelNode()
{
QString s1 = QStringLiteral("TEST1");
QString s2 = QStringLiteral("TEST2");
auto *node = new LabelNode(nullptr, s1);
QCOMPARE(node->label(), s1);
node->setLabel(s2);
QCOMPARE(node->label(), s2);
}
void TestProblemStoreNode::testProblemNode()
{
IProblem::Ptr p1(new DetectedProblem());
IProblem::Ptr p2(new DetectedProblem());
QString s1 = QStringLiteral("PROBLEM1");
QString s2 = QStringLiteral("PROBLEM2");
p1->setDescription(s1);
p2->setDescription(s2);
QScopedPointer<ProblemNode> node;
node.reset(new ProblemNode(nullptr, p1));
QCOMPARE(node->problem()->description(), p1->description());
node->setProblem(p2);
QCOMPARE(node->problem()->description(), p2->description());
}
QTEST_MAIN(TestProblemStoreNode)
#include "test_problemstorenode.moc"
|
