Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : AVLSET.HP

// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea ([email protected])

This file is part of the GNU C++ Library. This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 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 Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/


#ifndef _AVL_h
#ifdef __GNUG__
#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();
};

inline AVLNode::AVLNode( h, AVLNode* l, AVLNode* r)
:item(h), lt(l), rt(r), stat(0) {}

inline AVLNode::~AVLNode() {}

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();
};

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