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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
* nodetree.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.
*/
#pragma once
#include <list>
#include <map>
#include "node.h"
class Node;
typedef std::list<class Node*> NodeList;
class Node
{
public:
nodeid_t id;
Node* parent;
node_t data;
NodeList children;
std::string toXML(std::string prefix);
};
class NodeTree
{
public:
NodeTree();
~NodeTree();
nodeid_t createId();
bool hasId(nodeid_t nodeid) const;
//! May throw:
//! - Error::MissingParent if the parent node id does not exist in the tree.
//! - Error::NoSuchId if the ancestorList cannot be made from the supplied id.
//! - Error::IdAlreadyExists if the supplied id already exists in the tree.
//! - Error::NewParentIsSelf if id and parentid are the same.
NodeIdList insertAsChild(nodeid_t parentid, nodeid_t id, node_t data,
nodeid_t insertBeforeId);
//! May throw:
//! - Error::NoSuchId if node id does not exist.
//! - Error::ProtectedNode if node is protected and cannot be removed.
NodeIdList remove(nodeid_t id);
//! May throw:
//! - Error::NewParentIsSelf if id and parentid are the same.
//! - Error::NoSuchId if node id does not exist.
//! - Error::MissingParent if new parent node does not exist.
//! - Error::ProtectedNode if node is protected and cannot be (re)moved.
NodeIdList move(nodeid_t id, nodeid_t newParentId, nodeid_t insertBeforeId);
//! May throw:
//! - Error::NoSuchId if node id does not exist.
NodeIdList updateData(nodeid_t id, const std::string &name,
const std::string &value);
//! May throw:
//! - Error::NoSuchId if node id does not exist.
node_t data(nodeid_t id);
//! May throw:
//! - Error::NoSuchId if node id does not exist.
NodeIdList bfs(nodeid_t id);
//! May throw:
//! - Error::NoSuchId if node id does not exist.
NodeIdList ancestorList(nodeid_t id);
void toStdOut();
std::string toXML();
void fromXML(const std::string& xml);
private:
friend class XmlParser;
Node* createNode(nodeid_t id);
void insertChild(Node* parent, Node* child, nodeid_t insertBeforeId);
nodeid_t nextid{10};
Node* root{nullptr};
std::map<int, Node*> id2node;
};
|
