summaryrefslogtreecommitdiff
path: root/src/tasktree.h
blob: d82b9a4558fed6ae96c43ec2b2240a753090211d (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
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
 *            tasktree.h
 *
 *  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.
 */
#ifndef __MUNIA_TASKTREE_H__
#define __MUNIA_TASKTREE_H__

#include <list>
#include <map>
#include <exception>

#include "task.h"

typedef struct node node_t;

typedef std::list<struct node*> NodeList;

struct node {
  taskid_t id;
  node_t* parent;
  task_t data;
  NodeList children;
};

class TaskTree {
public:
  TaskTree();
  ~TaskTree();

  TaskIdList insertAsChild(taskid_t parentid, taskid_t id, task_t data) throw (std::exception);
  TaskIdList remove(taskid_t id) throw (std::exception);
  TaskIdList move(taskid_t id, taskid_t newParentId) throw (std::exception);
  TaskIdList updateData(taskid_t id, task_t t) throw (std::exception);
  task_t data(taskid_t id) throw (std::exception);

  TaskIdList bfs(taskid_t id) throw (std::exception);

  TaskIdList ancestorList(taskid_t id) throw (std::exception);

  void toStdOut();

private:
  node_t* createNode(taskid_t id);
  void insertChild(node_t* parent, node_t* child);

  node_t* root;
  std::map<int, node_t*> id2node;
};

#endif/*__MUNIA_TASKTREE_H__*/