diff options
Diffstat (limited to 'gnu/lib/libg++/g++-include/gen/RAVLMap.hP')
| -rw-r--r-- | gnu/lib/libg++/g++-include/gen/RAVLMap.hP | 162 |
1 files changed, 162 insertions, 0 deletions
diff --git a/gnu/lib/libg++/g++-include/gen/RAVLMap.hP b/gnu/lib/libg++/g++-include/gen/RAVLMap.hP new file mode 100644 index 00000000000..cf216e5ba02 --- /dev/null +++ b/gnu/lib/libg++/g++-include/gen/RAVLMap.hP @@ -0,0 +1,162 @@ +// 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) + ranking code from Paul Anderson (paul%lfcs.ed.ac.uk) + +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 _<T><C>RAVLMap_h +#ifdef __GNUG__ +#pragma once +#pragma interface +#endif +#define _<T><C>RAVLMap_h 1 + +#include "<T>.<C>.Map.h" + +struct <T><C>RAVLNode +{ + <T><C>RAVLNode* lt; + <T><C>RAVLNode* rt; + <T> item; + <C> cont; + int rank; + char stat; + <T><C>RAVLNode(<T&> h, <C&> c, + <T><C>RAVLNode* l=0, <T><C>RAVLNode* r=0, int k=1); + ~<T><C>RAVLNode(); +}; + +#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) + +inline <T><C>RAVLNode::<T><C>RAVLNode(<T&> h, <C&> c, + <T><C>RAVLNode* l, <T><C>RAVLNode* r, int k) + :item(h), cont(c), lt(l), rt(r), rank(k), stat(0) {} + +inline <T><C>RAVLNode::~<T><C>RAVLNode() {} + +#endif + +typedef <T><C>RAVLNode* <T><C>RAVLNodePtr; + + +class <T><C>RAVLMap : public <T><C>Map +{ +protected: + <T><C>RAVLNode* root; + + <T><C>RAVLNode* leftmost(); + <T><C>RAVLNode* rightmost(); + <T><C>RAVLNode* pred(<T><C>RAVLNode* t); + <T><C>RAVLNode* succ(<T><C>RAVLNode* t); + void _kill(<T><C>RAVLNode* t); + void _add(<T><C>RAVLNode*& t); + void _del(<T><C>RAVLNode* p, <T><C>RAVLNode*& t); + +public: + <T><C>RAVLMap(<C&> dflt); + <T><C>RAVLMap(<T><C>RAVLMap& a); + ~<T><C>RAVLMap(); + + <C>& operator [] (<T&> key); + + void del(<T&> key); + + Pix first(); + void next(Pix& i); + <T>& key(Pix i); + <C>& contents(Pix i); + + Pix seek(<T&> key); + int contains(<T&> key); + + Pix ranktoPix(int i); + int rankof(<T&> key); + + void clear(); + + Pix last(); + void prev(Pix& i); + + int OK(); +}; + +#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) + +inline <T><C>RAVLMap::~<T><C>RAVLMap() +{ + _kill(root); +} + +inline <T><C>RAVLMap::<T><C>RAVLMap(<C&> dflt) :(dflt) +{ + root = 0; +} + + +inline Pix <T><C>RAVLMap::first() +{ + return Pix(leftmost()); +} + +inline Pix <T><C>RAVLMap::last() +{ + return Pix(rightmost()); +} + +inline void <T><C>RAVLMap::next(Pix& i) +{ + if (i != 0) i = Pix(succ((<T><C>RAVLNode*)i)); +} + +inline void <T><C>RAVLMap::prev(Pix& i) +{ + if (i != 0) i = Pix(pred((<T><C>RAVLNode*)i)); +} + +inline <T>& <T><C>RAVLMap::key(Pix i) +{ + if (i == 0) error("null Pix"); + return ((<T><C>RAVLNode*)i)->item; +} + +inline <C>& <T><C>RAVLMap::contents(Pix i) +{ + if (i == 0) error("null Pix"); + return ((<T><C>RAVLNode*)i)->cont; +} + +inline void <T><C>RAVLMap::clear() +{ + _kill(root); + count = 0; + root = 0; +} + +inline int <T><C>RAVLMap::contains(<T&> key) +{ + return seek(key) != 0; +} + + + +#endif +#endif |