btreenode.h

/***************************************************************************
 *   Copyright (C) 2004-2005 by Daniel Clarke                              *
 *   daniel.jc@gmail.com                                                   *
 *                                                                         *
 *   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 BTREENODE_H
#define BTREENODE_H

#include "btreebase.h"
#include "expression.h"

#include <qstring.h>
#include <qptrlist.h>

class BTreeNode
{
        public:
                BTreeNode();
                BTreeNode(BTreeNode *p, BTreeNode *l, BTreeNode *r);
                ~BTreeNode();

//              void printTree();
                void deleteChildren();
                BTreeNode *parent() const { return m_parent; }
                BTreeNode *left() const { return m_left; }
                BTreeNode *right() const { return m_right; }
                void setParent(BTreeNode *parent) { m_parent = parent; }
                void setLeft(BTreeNode *left) { m_left = left; m_left->setParent( this ); }
                void setRight(BTreeNode *right) { m_right = right; m_right->setParent( this ); }
                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;

                QString m_reg;

                ExprType m_type;
                QString m_value;

                Expression::Operation m_childOp;
};

#endif

---