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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
* node.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 "nodemanager.h"
#include "hugin.hpp"
#include "exceptions.h"
// Global NodeManager object.
NodeManager node_manager;
#define ROOT_ID 0
#define FINISHED_ID 1
#define BACKLOG_ID 2
#define LOSTFOUND_ID 3
#define PROJECTS_ID 4
#define FIRST_NODE_ID 10
NodeManager::NodeManager()
{
}
NodeManager::~NodeManager()
{
}
void NodeManager::init(const std::string& filename)
{
DEBUG(nodemgr, "Reading nodes 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
node_t t;
t.attributes["title"] = "root";
t.id = ROOT_ID;
tree.insertAsChild(0, ROOT_ID, t, -1);
t.attributes["title"] = "Finished";
t.id = FINISHED_ID;
tree.insertAsChild(ROOT_ID, FINISHED_ID, t, -1);
t.attributes["title"] = "Backlog";
t.id = BACKLOG_ID;
tree.insertAsChild(ROOT_ID, BACKLOG_ID, t, -1);
t.attributes["title"] = "Lost+Found";
t.id = LOSTFOUND_ID;
tree.insertAsChild(ROOT_ID, LOSTFOUND_ID, t, -1);
t.attributes["title"] = "Projects";
t.id = PROJECTS_ID;
tree.insertAsChild(ROOT_ID, PROJECTS_ID, t, -1);
}
tree.toStdOut();
}
NodeIdList NodeManager::createNode(nodeid_t parentid, nodeid_t id,
nodeid_t insertbeforeid)
{
NodeIdList affectedNodes;
node_t t;
t.attributes["title"] = "";
t.id = id;
affectedNodes = tree.insertAsChild(parentid, id, t, insertbeforeid);
flushNodes();
return affectedNodes;
}
NodeIdList NodeManager::updateNode(nodeid_t id, const std::string &name,
const std::string &value)
{
if(isProtected(id))
{
throw Error::ProtectedNode();
}
NodeIdList affectedNodes;
affectedNodes = tree.updateData(id, name, value);
flushNodes();
return affectedNodes;
}
NodeIdList NodeManager::removeNode(nodeid_t id)
{
if(isProtected(id))
{
throw Error::ProtectedNode();
}
NodeIdList affectedNodes;
affectedNodes = tree.remove(id);
flushNodes();
return affectedNodes;
}
NodeIdListPair NodeManager::moveNode(nodeid_t id, nodeid_t to,
nodeid_t beforeId)
{
if(isProtected(id))
{
throw Error::ProtectedNode();
}
NodeIdList tilremove;
tilremove.push_back(id);
NodeIdList ancestors = tree.ancestorList(id);
tilremove.insert(tilremove.end(), ancestors.begin(), ancestors.end());
NodeIdList tilcreate;
tilcreate.push_back(to);
ancestors = tree.ancestorList(to);
tilcreate.insert(tilcreate.end(), ancestors.begin(), ancestors.end());
tree.move(id, to, beforeId); // TODO: Use node list pair from return value
flushNodes();
return {tilremove, tilcreate};
}
NodeIdList NodeManager::subNodes(nodeid_t t)
{
NodeIdList affectedNodes;
affectedNodes = tree.bfs(t);
return affectedNodes;
}
node_t NodeManager::node(nodeid_t t)
{
return tree.data(t);
}
nodeid_t NodeManager::createId()
{
return tree.createId();
}
void NodeManager::flushNodes()
{
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);
}
bool NodeManager::hasId(nodeid_t id)
{
return tree.hasId(id);
}
bool NodeManager::isProtected(nodeid_t id) const
{
return id < FIRST_NODE_ID;
}
|
