summaryrefslogtreecommitdiff
path: root/src/taskmanager.cc
blob: 38d7893e0c168b23d66a52adf51808ade763abff (plain)
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
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
 *            task.cc
 *
 *  Fri Feb 24 08:16:30 CET 2012
 *  Copyright 2012 Bent Bisballe Nyeng
 *  deva@aasimon.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 "taskmanager.h"

#include <stdio.h>

#include "hugin.hpp"

// Global TaskManager object.
TaskManager task_manager;

#define ROOT_ID 0
#define FINISHED_ID 1
#define BACKLOG_ID 2
#define LOSTFOUND_ID 3
#define PROJECTS_ID 4
#define FIRST_TASK_ID 10

static bool isProtected(taskid_t id)
{
  return id < FIRST_TASK_ID;
}

TaskManager::TaskManager() {
  idCount = FIRST_TASK_ID;
}

TaskManager::~TaskManager() {
}

void TaskManager::init(std::string filename)
{
  DEBUG(taskmgr, "Reading tasks from file: %s\n", filename.c_str());
  file = filename;

  FILE *fp = fopen(file.c_str(), "r");
  if(fp) {
    std::string xml;
    while(!feof(fp)) {
      char buf[64];
      size_t sz = fread(buf, 1, sizeof(buf), fp);
      xml.append(buf, sz);
    }
    tree.fromXML(xml);
    fclose(fp);
  } else {

    // Create new basis config
    task_t t;

    t.attributes["title"] = "root";
    t.id = ROOT_ID;
    tree.insertAsChild(0, ROOT_ID, t);

    t.attributes["title"] = "Finished";
    t.id = FINISHED_ID;
    tree.insertAsChild(ROOT_ID, FINISHED_ID, t);

    t.attributes["title"] = "Backlog";
    t.id = BACKLOG_ID;
    tree.insertAsChild(ROOT_ID, BACKLOG_ID, t);

    t.attributes["title"] = "Lost+Found";
    t.id = LOSTFOUND_ID;
    tree.insertAsChild(ROOT_ID, LOSTFOUND_ID, t);

    t.attributes["title"] = "Projects";
    t.id = PROJECTS_ID;
    tree.insertAsChild(ROOT_ID, PROJECTS_ID, t);
  }

  tree.toStdOut();
}

task_t TaskManager::task(taskid_t t) {
  return tree.data(t);
}

taskid_t TaskManager::createId() {
  return tree.createId();
}

TaskIdListPair TaskManager::moveTask(taskid_t id, taskid_t to) 
  throw (std::exception) {

  if(isProtected(id)) return TaskIdListPair();

  if(id == to) throw std::exception(); // Node and new parent are the same node.

  //task_t t = tree.data(id);

  // Make sure the new parent exists. This will throw an exception if it doesn't
  //task_t t_ = tree.data(to); 

  //  t.parentid = to;

  //  TaskIdList tilremove = tree.remove(id);
  TaskIdList tilremove;
  tilremove.push_back(id);
  TaskIdList ancestors = tree.ancestorList(id);
  tilremove.insert(tilremove.end(), ancestors.begin(), ancestors.end());

  //  TaskIdList tilcreate = tree.insertAsChild(to, id, t);
  TaskIdList tilcreate;
  tilcreate.push_back(to);
  ancestors = tree.ancestorList(to);
  tilcreate.insert(tilcreate.end(), ancestors.begin(), ancestors.end());

  tree.move(id, to);

  TaskIdListPair tilpair;
  tilpair.first = tilremove;
  tilpair.second = tilcreate;

  flushTasks();

  return tilpair;
}

TaskIdList TaskManager::removeTask(taskid_t id) 
  throw (std::exception) {

  if(isProtected(id)) return TaskIdList();

  TaskIdList affectedTasks;

  if(tree.bfs(id).size() > 1) throw std::exception();

  try {
    affectedTasks = tree.remove(id);
  }
  catch(std::exception& e) {
    throw e;
  }

  flushTasks();

  return affectedTasks;
}

TaskIdList TaskManager::updateTask(taskid_t id, const std::string &name,
                                   const std::string &value) 
  throw (std::exception) {

  if(isProtected(id)) return TaskIdList();

  TaskIdList affectedTasks;

  try {
    affectedTasks = tree.updateData(id, name, value);
  }
  catch (std::exception& e) {
    throw e;
  }

  flushTasks();

  return affectedTasks;
}

TaskIdList TaskManager::createTask(taskid_t parentid, taskid_t *pid)
  throw (std::exception) {
  TaskIdList affectedTasks;

  task_t t;
  taskid_t id = *pid;//createId();
  t.attributes["title"] = "";
  t.id = id;
  if(pid) *pid = id;

  try {
    affectedTasks = tree.insertAsChild(parentid, id, t);
  }
  catch (std::exception& e) {
    throw e;
  }
  
  flushTasks();

  return affectedTasks;
}

TaskIdList TaskManager::subTasks(taskid_t t)
  throw (std::exception) {

  TaskIdList affectedTasks;

  try {
    affectedTasks = tree.bfs(t);
  }
  catch (std::exception& e) {
    throw e;
  }

  return affectedTasks;
}

/*
TaskIdList TaskManager::ancestorList(taskid_t id) 
  throw (std::exception) {
  TaskIdList ancestors;

  try {
    ancestors = tree.ancestorList(id);
    goto finish;
  }
  catch (std::exception& e) {
    throw e;
  }

 finish:
  return ancestors;
}
*/

void TaskManager::flushTasks()
{
   FILE *fp = fopen(file.c_str(), "w");
   if(!fp) return;
   std::string xml = tree.toXML();
   fwrite(xml.c_str(), xml.size(), 1, fp);
   fclose(fp);
}


#if 0
TaskList tasklist;

task_t create_task(std::string title, std::string desc) {

  task_t t;
  t.parent_id = current_id_count();
  t.attributes["title"] = title;
  t.desc = desc;
  t.id = id_count; id_count++;

  return t;
}

TaskList load_tasklist_from_file(std::string file) {
  TaskList list;
 
  // create MuniaDb class which handles tasks, db-flush and db-init. 

  return list;
}

bool save_tasklist_to_file(TaskList list, std::string file) {
  
  FILE* fp;

  if(! (fp = fopen(file.c_str(), "w"))) {
    return false;
  }

  if(!fprintf(fp, "<tasklist>\n")) {
    fclose(fp);
    return false;
  }

  TaskList::iterator it;
  for(it = tasklist.begin(); it != tasklist.end(); it++) {
    task_t t = *it;
    int r = 1;

//    printf("Flushing task %d\n", t.id);

    r |= fprintf(fp, "  <task id=\"%d\" parent_id=\"%d\">\n", t.id, t.parent_id);
    r |= fprintf(fp, "    <title>%s</title>\n", xml_encode(t.attributes["title"]).c_str());
    r |= fprintf(fp, "    <desc>%s</desc>\n", xml_encode(t.attributes["description"]).c_str());
    r |= fprintf(fp, "  </task>)\n");

    if(!r) {
      fclose(fp);
      return false;
    }
  }

  if(!fprintf(fp, "</tasklist>\n")) {
    fclose(fp);
    return false;
  }

  fclose(fp);
  return true;
}

static void delete_task(task_t t, TaskList& graveyard);

static void delete_children(task_t t, TaskList& graveyard) {
  TaskList::iterator it;
  for(it = tasklist.begin(); it != tasklist.end(); it++) {
    if(it->parent_id == t.id) {
      delete_task(*it, graveyard);
    }
  }
}


static void delete_task(task_t t, TaskList& graveyard) {

  TaskList::iterator it;
  for(it = tasklist.begin(); it != tasklist.end(); it++) {
    if(it->id == t.id) {
      break;
    }
  }
  
  if(it != tasklist.end()) {
      graveyard.push_back(*it);
      delete_children(*it, graveyard);
  }

}

void delete_task(int id, TaskList& graveyard) {
  task_t t;
  t.id = id;
  delete_task(t, graveyard);
  
  for(TaskList::iterator it = graveyard.begin();
      it != graveyard.end(); it++) {

      for(TaskList::iterator it_tl = tasklist.begin();
          it_tl != tasklist.end(); it_tl++) {

        if(it_tl->id == it->id) {
          tasklist.erase(it_tl);
          break;
        }
      }
  }
}
#endif