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
|
/*
BackendIntegrationTests.h
This file is part of Charm, a task-based time tracking application.
Copyright (C) 2007-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/>.
*/
#ifndef BACKENDINTEGRATIONTESTS_H
#define BACKENDINTEGRATIONTESTS_H
#include "TestApplication.h"
#include "Core/Task.h"
class BackendIntegrationTests : public TestApplication
{
Q_OBJECT
public:
BackendIntegrationTests();
private Q_SLOTS:
void initTestCase();
void initialValuesTest();
void simpleCreateModifyDeleteTaskTest();
void biggerCreateModifyDeleteTaskTest();
void cleanupTestCase();
private:
const TaskList &referenceTasks();
// returns true if both lists contain the same tasks, even if not
// in the same order:
bool contentsEqual(const TaskList &list1, const TaskList &list2);
};
#endif
|
