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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
* tasktree.cc
*
* Tue Mar 27 11:07:48 CEST 2012
* Copyright 2012 Jonas Suhr Christensen
* jsc@umbraculum.org
****************************************************************************/
/*
* This file is part of Munia.
*
* Munia 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.
*
* Munia 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 Munia; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "tasktree.h"
#include "debug.h"
TaskTree::TaskTree() {
root = NULL;
}
TaskTree::~TaskTree() {
// cleanup tree
}
TaskIdList TaskTree::insertAsChild(taskid_t parentid, taskid_t id, task_t data)
throw (std::exception) {
TaskIdList affectedNodes;
// Initialize
if(!root) {
node_t* node = createNode(id);
root = node;
node->data = data;
affectedNodes.push_back(id);
goto finish;
}
try {
node_t* parent = id2node.at(parentid);
node_t* child = createNode(id);
child->data = data;
insertChild(parent, child);
affectedNodes.push_back(parentid);
affectedNodes.push_back(id);
goto finish;
}
catch(std::exception& e) {
throw e;
}
finish:
return affectedNodes;
}
TaskIdList TaskTree::remove(taskid_t id)
throw (std::exception) {
//todo: move all childrin to lost+found
WARN(tasktree, "Feature not implemneted yet\n");
TaskIdList affectedNodes;
return affectedNodes;
}
TaskIdList TaskTree::move(taskid_t id, taskid_t toid)
throw (std::exception) {
TaskIdList affectedNodes;
try {
node_t* child = id2node.at(id);
node_t* newparent = id2node.at(toid);
if(!child->parent) {
throw std::exception();
}
child->parent->children.remove(child);
newparent->children.push_back(child);
affectedNodes.push_back(id);
affectedNodes.push_back(child->parent->id);
affectedNodes.push_back(toid);
goto finish;
}
catch(std::exception& e) {
throw e;
}
finish:
return affectedNodes;
}
TaskIdList TaskTree::updateData(taskid_t id, task_t t)
throw (std::exception) {
TaskIdList affectedNodes;
try {
node_t* node = id2node.at(id);
node->data = t;
affectedNodes.push_back(id);
goto finish;
}
catch(std::exception& e) {
throw e;
}
finish:
return affectedNodes;
}
task_t TaskTree::getData(taskid_t id)
throw (std::exception) {
task_t t;
try {
node_t* node = id2node.at(id);
t = node->data;
goto finish;
}
catch(std::exception& e) {
throw e;
}
finish:
return t;
}
TaskIdList TaskTree::ancestorList(taskid_t id)
throw (std::exception) {
TaskIdList ancestors;
try {
node_t* current = id2node.at(id);
while(current->parent) {
ancestors.push_back(current->parent->id);
current = current->parent;
}
goto finish;
}
catch(std::exception& e) {
throw e;
}
finish:
return ancestors;
}
node_t* TaskTree::createNode(taskid_t id) {
node_t* node = new node_t();
node->parent = NULL;
node->id = id;
id2node[id] = node;
return node;
}
void TaskTree::insertChild(node_t* parent, node_t* child) {
parent->children.push_back(child);
child->parent = parent;
}
static void printNode(node_t* node, std::string prefix) {
if(!node) return;
task_t t = node->data;
printf("%s/%u - %s\n", prefix.c_str(), node->id, t.title.c_str());
char buf[4096];
sprintf(buf, "%s/%u - %s", prefix.c_str(), node->id, t.title.c_str());
NodeList::iterator it;
for(it = node->children.begin(); it != node->children.end(); it++) {
node_t* child = *it;
printNode(child, buf);
}
}
void TaskTree::toStdOut() {
printNode(root, "");
}
#ifdef TEST_TASKTREE
//Additional dependency files
//deps:
//Required cflags (autoconf vars may be used)
//cflags:
//Required link options (autoconf vars may be used)
//libs:
#include "test.h"
#include <exception>
TEST_BEGIN;
TaskTree tree;
task_t t;
try {
tree.insertAsChild(-1, t);
}
catch(std::exeception& e) {
}
// TODO: Put some testcode here (see test.h for usable macros).
TEST_TRUE(false, "No tests yet!");
TEST_END;
#endif/*TEST_TASKTREE*/
|
