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
|
/*
* Copyright (c) 2009 Samit Basu
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef __Tree_hpp__
#define __Tree_hpp__
#include <QString>
#include "Token.hpp"
#include "Array.hpp"
#include "DebugStream.hpp"
class Tree;
typedef QList<Tree> TreeList;
class TreeNode : public QSharedData {
public:
Token m_node;
TreeList m_children;
};
class Tree {
private:
QSharedDataPointer<TreeNode> d;
public:
Tree();
Tree(const Token& tok);
Tree(TokenValueType token, unsigned position);
Tree(const Token& tok, Tree child1, Tree child2);
Tree(const Token& tok, Tree child1);
Tree(Serialize *s);
~Tree();
inline const Token& node() const {return d->m_node;}
void print() const;
inline void rename(TokenValueType newtok) {d->m_node.setValue(newtok);}
inline unsigned context() const {return d->m_node.position();}
inline bool valid() const {return !(d->m_node.is(TOK_INVALID));}
inline Tree first() const {return d->m_children.front();}
inline Tree second() const {return d->m_children.at(1);}
inline bool is(TokenValueType tok) const {return (token()==tok);}
inline TokenValueType token() const {return d->m_node.value();}
inline int numChildren() const {return d->m_children.size();}
inline bool hasChildren() const {return (d->m_children.size()>0);}
inline QString text() const {return d->m_node.text();}
inline void setText(QString t) {d->m_node.setText(t);}
inline Array array() const {return d->m_node.array();}
inline const TreeList& children() const {return d->m_children;}
inline Tree last() const {return d->m_children.back();}
inline Tree child(unsigned n) const {return d->m_children.at(n);}
inline Token& node() {return d->m_node;}
inline void addChild(Tree t_child) {d->m_children.push_back(t_child);}
inline void addChildren(Tree child1, Tree child2) {
d->m_children.push_back(child1);
d->m_children.push_back(child2);
}
void freeze(Serialize *s) const;
};
DebugStream& operator<<(DebugStream& o, const Tree& b);
#endif
|
