1 files changed, 69 insertions, 0 deletions
diff --git a/src/tasktree.h b/src/tasktree.h
new file mode 100644
index 0000000..9a3a45f
--- /dev/null
+++ b/src/tasktree.h
@@ -0,0 +1,69 @@
+/* -*- 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 getData(taskid_t id) throw (std::exception);
+  
+  TaskIdList ancestorList(taskid_t id) throw (std::exception);
+
+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__*/