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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
|
/*
TaskStructureTests.cpp
This file is part of Charm, a task-based time tracking application.
Copyright (C) 2008-2018 Klarälvdalens Datakonsult AB, a KDAB Group company, info@kdab.com
Author: Mirko Boehm <mirko.boehm@kdab.com>
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, see <http://www.gnu.org/licenses/>.
*/
#include "TaskStructureTests.h"
#include "TestHelpers.h"
#include "Core/Task.h"
#include "Core/TaskListMerger.h"
#include "Core/CharmConstants.h"
#include <QtDebug>
#include <QtTest/QtTest>
TaskStructureTests::TaskStructureTests()
: QObject()
{
}
void TaskStructureTests::checkForUniqueTaskIdsTest_data()
{
QTest::addColumn<TaskList>("tasks");
QTest::addColumn<bool>("unique");
Q_FOREACH (const QDomElement &testcase,
TestHelpers::retrieveTestCases(QLatin1String(":/checkForUniqueTaskIdsTest/Data"),
QLatin1String("checkForUniqueTaskIdsTest"))) {
QString name = testcase.attribute(QStringLiteral("name"));
bool expectedResult = TestHelpers::attribute(QStringLiteral("expectedResult"), testcase);
QDomElement element = testcase.firstChildElement(Task::taskListTagName());
QVERIFY(!element.isNull());
TaskList tasks = Task::readTasksElement(element, CHARM_DATABASE_VERSION);
QTest::newRow(name.toLocal8Bit().constData()) << tasks << expectedResult;
QVERIFY(element.nextSiblingElement(Task::taskListTagName()).isNull());
qDebug() << "Added test case" << name;
}
}
void TaskStructureTests::checkForUniqueTaskIdsTest()
{
QFETCH(TaskList, tasks);
QFETCH(bool, unique);
QCOMPARE(Task::checkForUniqueTaskIds(tasks), unique);
}
void TaskStructureTests::checkForTreenessTest_data()
{
QTest::addColumn<TaskList>("tasks");
QTest::addColumn<bool>("directed");
Q_FOREACH (const QDomElement &testcase,
TestHelpers::retrieveTestCases(QLatin1String(":/checkForTreenessTest/Data"),
QLatin1String("checkForTreenessTest"))) {
QString name = testcase.attribute(QStringLiteral("name"));
bool expectedResult = TestHelpers::attribute(QStringLiteral("expectedResult"), testcase);
QDomElement element = testcase.firstChildElement(Task::taskListTagName());
QVERIFY(!element.isNull());
TaskList tasks = Task::readTasksElement(element, CHARM_DATABASE_VERSION);
QTest::newRow(name.toLocal8Bit().constData()) << tasks << expectedResult;
QVERIFY(element.nextSiblingElement(Task::taskListTagName()).isNull());
qDebug() << "Added test case" << name;
}
}
void TaskStructureTests::checkForTreenessTest()
{
QFETCH(TaskList, tasks);
QFETCH(bool, directed);
QCOMPARE(Task::checkForTreeness(tasks), directed);
}
void TaskStructureTests::mergeTaskListsTest_data()
{
QTest::addColumn<TaskList>("old");
QTest::addColumn<TaskList>("newTasks");
QTest::addColumn<TaskList>("merged");
Q_FOREACH (const QDomElement &testcase,
TestHelpers::retrieveTestCases(QLatin1String(":/mergeTaskListsTest/Data"),
QLatin1String("mergeTaskListsTest"))) {
QString name = testcase.attribute(QStringLiteral("name"));
QList<QDomElement> elements;
elements << testcase.firstChildElement(Task::taskListTagName());
elements << (elements.first()).nextSiblingElement(Task::taskListTagName());
elements << (elements.at(1)).nextSiblingElement(Task::taskListTagName());
bool oldFound = false, newFound = false, mergedFound = false;
TaskList old, newTasks, merged;
Q_FOREACH (const QDomElement &element, elements) {
QString arg = element.attribute(QStringLiteral("arg"));
TaskList tasks = Task::readTasksElement(element, CHARM_DATABASE_VERSION);
if (arg == QLatin1String("old")) {
old = tasks;
oldFound = true;
} else if (arg == QLatin1String("new")) {
newTasks = tasks;
newFound = true;
} else if (arg == QLatin1String("merged")) {
merged = tasks;
qSort(merged.begin(), merged.end(), Task::lowerTaskId);
mergedFound = true;
} else {
QFAIL("invalid XML structure in input data");
}
}
QVERIFY(oldFound);
QVERIFY(newFound);
QVERIFY(mergedFound);
QTest::newRow(name.toLocal8Bit().constData()) << old << newTasks << merged;
qDebug() << "Added test case" << name;
}
}
void TaskStructureTests::mergeTaskListsTest()
{
QFETCH(TaskList, old);
QFETCH(TaskList, newTasks);
QFETCH(TaskList, merged);
TaskListMerger merger;
merger.setOldTasks(old);
merger.setNewTasks(newTasks);
TaskList result = merger.mergedTaskList();
qSort(result.begin(), result.end(), Task::lowerTaskId);
if (result != merged) {
qDebug() << "Test failed";
qDebug() << "Merge Result:";
dumpTaskList(result);
qDebug() << "Expected Merge Result:";
dumpTaskList(merged);
}
QCOMPARE(result, merged);
}
QTEST_MAIN(TaskStructureTests)
|
