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
|
/*
TaskTreeItem.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>
Author: Frank Osterfeld <frank.osterfeld@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 TASKTREEITEM_H
#define TASKTREEITEM_H
#include <QList>
#include "Task.h"
/** TaskTreeItem is a node in the task tree.
The tasks form a tree, since tasks can belong to a parent task.
This structure is modeled by storing TaskTreeItems in a map that
associates them with the respective task id.
Every TaskTreeItem has a parent that represents the parent
task. If a task has no parent, it is a child of the root
TaskTreeItem stored in the model.
Every TaskTreeItem keeps a list of children.
Every TaskTreeItem also has a position in it's parents list of
children. This integer position can be retrieved by calling row on
the item.
*/
class TaskTreeItem
{
public:
typedef QList<const TaskTreeItem *> ConstPointerList;
typedef std::map<TaskId, TaskTreeItem> Map;
TaskTreeItem();
explicit TaskTreeItem(const Task &task, TaskTreeItem *parent = nullptr);
TaskTreeItem(const TaskTreeItem &other);
TaskTreeItem &operator=(const TaskTreeItem &other);
~TaskTreeItem();
void makeChildOf(TaskTreeItem &parent);
bool isValid() const;
Task &task();
const Task &task() const;
const TaskTreeItem &child(int row) const;
int row() const;
int childCount() const;
// recursively find all children of this item
// warning: SLOW
TaskList children() const;
TaskIdList childIds() const;
private:
TaskTreeItem *m_parent = nullptr;
ConstPointerList m_children;
Task m_task;
};
#endif
|
