AIKBSplayTree.h

//      Copyright (C) 2004 Dylan Blair
//
//      email: dblair@alumni.cs.utexas.edu
//
//      This library is free software; you can redistribute it and/or
//      modify it under the terms of the GNU Lesser General Public
//      License as published by the Free Software Foundation; either
//      version 2.1 of the License, or (at your option) any later version.
//
//      This library 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
//      Lesser General Public License for more details.
//
//      You should have received a copy of the GNU Lesser General Public
//      License along with this library; if not, write to the Free Software
//      Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#ifndef AIKBSplayTree_H
#define AIKBSplayTree_H

#include "AIBase.h"

class AIKBSplayTree {
        friend class AIKB;

        class BinaryNode {
                std::vector<AIException> elements;
                BinaryNode* left;
                BinaryNode* right;

                BinaryNode() : left(0), right(0) {}
                BinaryNode(const std::vector<AIException>& elements_, BinaryNode* left_, BinaryNode* right_)
                        : elements(elements_), left(left_), right(right_) {}

                friend class AIKBSplayTree;
        };

        BinaryNode* root;
        BinaryNode* nullNode;
        AIException EXCEPTION_NOT_FOUND;
        const std::vector<AIException> VECTOR_NOT_FOUND;
        int totalsize;

        void reclaimMemory(BinaryNode* t) const;

        BinaryNode* clone(BinaryNode* t) const;


        void rotateWithLeftChild(BinaryNode*& k2) const;
        void rotateWithRightChild(BinaryNode*& k1) const;

        void splay(const AIException& x, BinaryNode*& t) const;

public:
        AIKBSplayTree();
        AIKBSplayTree(const AIKBSplayTree& rhs);
        const AIKBSplayTree& operator=(const AIKBSplayTree& rhs);
        ~AIKBSplayTree();

        const std::vector<AIException>& find(const AIException& x);
        bool  isEmpty() const;
        int   totalSize() const;

        int   findStateScore(int stateID, BinaryNode* t, bool first) const;

        void  makeEmpty();
        bool  insert(const AIException& x, bool disallow_if_prem_name_exists_=false);
        void  remove(const AIException& x, bool all, int num_of_params_to_check_=-1);
};

#endif //AIKBSplayTree_H

---