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
|
/***************************************************************************
* Copyright (C) 2004-2005 by Daniel Clarke *
* [email protected] *
* *
* 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., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#ifndef TRAVERSER_H
#define TRAVERSER_H
#include "btreenode.h"
/**
Keeps persistant information needed and the algorithm for traversing the binary trees made of BTreeNodes, initialise either by passing a BTreeBase or BTreeNode to traverse a sub tree.
Note that this is designed for traversing in the *reverse* way starting at the end of each branch
in order to calculate the expression contained in the tree.
@author Daniel Clarke
*/
class Traverser
{
public:
Traverser(BTreeNode *root);
~Traverser();
/** Find where to start in the tree and return it also resets all the data related to the traversal. */
BTreeNode *start();
/** Finds the next node to move to and returns it. */
BTreeNode *next();
/** Returns true if we are on the left branch, false otherwise. */
bool onLeftBranch();
/** Returns the node on the opposite branch of the parent. */
BTreeNode * oppositeNode();
BTreeNode * current() const { return m_current; }
void setCurrent(BTreeNode *current){m_current = current;}
/** From the current position, go down the tree taking a left turn always,
and stopping when reaching the left terminal node.
*/
void descendLeftwardToTerminal();
/** It might occur in the future that next() does not just move to the parent,
so use this for moving to parent
*/
void moveToParent();
BTreeNode *root() const {return m_root;}
protected:
BTreeNode *m_root;
BTreeNode *m_current;
};
#endif
|
