Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : AVLMAP.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 _AVLMap_h
#ifdef __GNUG__
#pragma interface
#endif
#define _AVLMap_h 1

#include "..Map.h"

struct AVLNode
{
AVLNode* lt;
AVLNode* rt;
item;
cont;
char stat;
AVLNode( h, c,
AVLNode* l=0, AVLNode* r=0);
~AVLNode();
};

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

inline AVLNode::~AVLNode() {}

typedef AVLNode* AVLNodePtr;


class AVLMap : public Map
{
protected:
AVLNode* root;

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:
AVLMap( dflt);
AVLMap(AVLMap& a);
~AVLMap();

& operator [] ( key);

void del( key);

Pix first();
void next(Pix& i);
& key(Pix i);
& contents(Pix i);

Pix seek( key);
int contains( key);

void clear();

Pix last();
void prev(Pix& i);

int OK();
};

inline AVLMap::~AVLMap()
{
_kill(root);
}

inline AVLMap::AVLMap( dflt) :Map(dflt)
{
root = 0;
}

inline Pix AVLMap::first()
{
return Pix(leftmost());
}

inline Pix AVLMap::last()
{
return Pix(rightmost());
}

inline void AVLMap::next(Pix& i)
{
if (i != 0) i = Pix(succ((AVLNode*)i));
}

inline void AVLMap::prev(Pix& i)
{
if (i != 0) i = Pix(pred((AVLNode*)i));
}

inline & AVLMap::key(Pix i)
{
if (i == 0) error("null Pix");
return ((AVLNode*)i)->item;
}

inline & AVLMap::contents(Pix i)
{
if (i == 0) error("null Pix");
return ((AVLNode*)i)->cont;
}

inline void AVLMap::clear()
{
_kill(root);
count = 0;
root = 0;
}

inline int AVLMap::contains( key)
{
return seek(key) != 0;
}

#endif