// This may look like C code, but it is really -*- C++ -*- /* Copyright (C) 1988 Free Software Foundation written by Doug Lea (dl@rocky.oswego.edu) This file is part of GNU CC. GNU CC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. No author or distributor accepts responsibility to anyone for the consequences of using it or for whether it serves any particular purpose or works at all, unless he says so in writing. Refer to the GNU CC General Public License for full details. Everyone is granted permission to copy, modify and redistribute GNU CC, but only under the conditions described in the GNU CC General Public License. A copy of this license is supposed to have been given to you along with GNU CC so you can know your rights and responsibilities. It should be in a file named COPYING. Among other things, the copyright notice and this notice must be preserved on all copies. */ #ifndef _AVL_h #ifdef __GNUG__ #pragma once #pragma interface #endif #define _AVL_h 1 #include ".Set.h" struct AVLNode { AVLNode* lt; AVLNode* rt; item; char stat; AVLNode( h, AVLNode* l=0, AVLNode* r=0); ~AVLNode(); }; #if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) inline AVLNode::AVLNode( h, AVLNode* l, AVLNode* r) :item(h), lt(l), rt(r), stat(0) {} inline AVLNode::~AVLNode() {} #endif typedef AVLNode* AVLNodePtr; class AVLSet : public Set { protected: AVLNode* root; AVLSet(AVLNode* p, int l); AVLNode* leftmost(); AVLNode* rightmost(); AVLNode* pred(AVLNode* t); AVLNode* succ(AVLNode* t); void _kill(AVLNode* t); void _add(AVLNode*& t); void _del(AVLNode* p, AVLNode*& t); public: AVLSet(); AVLSet(AVLSet& a); ~AVLSet(); Pix add( item); void del( item); int contains( item); void clear(); Pix first(); void next(Pix& i); & operator () (Pix i); int owns(Pix i); Pix seek( item); Pix last(); void prev(Pix& i); void operator |= (AVLSet& b); void operator -= (AVLSet& b); void operator &= (AVLSet& b); int operator == (AVLSet& b); int operator != (AVLSet& b); int operator <= (AVLSet& b); int OK(); }; #if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) inline AVLSet::~AVLSet() { _kill(root); } inline AVLSet::AVLSet() { root = 0; count = 0; } inline AVLSet::AVLSet(AVLNode* p, int l) { root = p; count = l; } inline int AVLSet::operator != (AVLSet& b) { return ! ((*this) == b); } inline Pix AVLSet::first() { return Pix(leftmost()); } inline Pix AVLSet::last() { return Pix(rightmost()); } inline void AVLSet::next(Pix& i) { if (i != 0) i = Pix(succ((AVLNode*)i)); } inline void AVLSet::prev(Pix& i) { if (i != 0) i = Pix(pred((AVLNode*)i)); } inline & AVLSet::operator () (Pix i) { if (i == 0) error("null Pix"); return ((AVLNode*)i)->item; } inline void AVLSet::clear() { _kill(root); count = 0; root = 0; } inline int AVLSet::contains( key) { return seek(key) != 0; } #endif #endif