summaryrefslogtreecommitdiffstats
path: root/microbe/btreenode.h
diff options
context:
space:
mode:
Diffstat (limited to 'microbe/btreenode.h')
-rw-r--r--microbe/btreenode.h107
1 files changed, 107 insertions, 0 deletions
diff --git a/microbe/btreenode.h b/microbe/btreenode.h
new file mode 100644
index 0000000..7f5fdfb
--- /dev/null
+++ b/microbe/btreenode.h
@@ -0,0 +1,107 @@
+/***************************************************************************
+ * Copyright (C) 2004-2005 by Daniel Clarke *
+ * *
+ * 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 BTREENODE_H
+#define BTREENODE_H
+
+#include "btreebase.h"
+#include "expression.h"
+
+#include <qstring.h>
+#include <qptrlist.h>
+
+/**
+A node points to the two child nodes (left and right), and contains the binary
+operation used to combine them.
+
+@author Daniel Clarke
+@author David Saxton
+*/
+class BTreeNode
+{
+ public:
+ BTreeNode();
+ BTreeNode(BTreeNode *p, BTreeNode *l, BTreeNode *r);
+ ~BTreeNode();
+
+ /**
+ * Used for debugging purposes; prints the tree structure to stdout.
+ */
+// void printTree();
+ /**
+ * Recursively delete all children of a node.
+ */
+ void deleteChildren();
+ /**
+ * @return the parent node.
+ */
+ BTreeNode *parent() const { return m_parent; }
+ /**
+ * @return the left child node.
+ */
+ BTreeNode *left() const { return m_left; }
+ /**
+ * @return the right child node.
+ */
+ BTreeNode *right() const { return m_right; }
+ void setParent(BTreeNode *parent) { m_parent = parent; }
+ /**
+ * Set the child node on the left to the one give, and reparents it to
+ * this node.
+ */
+ void setLeft(BTreeNode *left) { m_left = left; m_left->setParent( this ); }
+ /**
+ * Set the child node on the right to the one give, and reparents it to
+ * this node.
+ */
+ void setRight(BTreeNode *right) { m_right = right; m_right->setParent( this ); }
+ /**
+ * @return true if have a left or a right child node.
+ */
+ bool hasChildren() const { return m_left || m_right; }
+
+ ExprType type() const {return m_type;}
+ void setType(ExprType type) { m_type = type; }
+ QString value() const {return m_value;}
+ void setValue( const QString & value ) { m_value = value; }
+
+ Expression::Operation childOp() const {return m_childOp;}
+ void setChildOp(Expression::Operation op){ m_childOp = op;}
+
+ void setReg( const QString & r ){ m_reg = r; }
+ QString reg() const {return m_reg;}
+
+ bool needsEvaluating() const { return hasChildren(); }
+
+ protected:
+ BTreeNode *m_parent;
+ BTreeNode *m_left;
+ BTreeNode *m_right;
+
+ /** This is used to remember what working register contains the value of the node during assembly.*/
+ QString m_reg;
+
+ ExprType m_type;
+ QString m_value;
+
+ Expression::Operation m_childOp;
+};
+
+#endif