// 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 _SplayPQ_h #ifdef __GNUG__ #pragma once #pragma interface #endif #define _SplayPQ_h 1 #include ".PQ.h" #ifndef _SplayNode #define _SplayNode 1 struct SplayNode { SplayNode* lt; SplayNode* rt; SplayNode* par; item; SplayNode( h, SplayNode* l=0, SplayNode* r=0); ~SplayNode(); }; #if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) inline SplayNode::SplayNode( h, SplayNode* l, SplayNode* r) :item(h), lt(l), rt(r), par(0) {} inline SplayNode::~SplayNode() {} #endif typedef SplayNode* SplayNodePtr; #endif class SplayPQ : public PQ { protected: SplayNode* root; SplayNode* leftmost(); SplayNode* rightmost(); SplayNode* pred(SplayNode* t); SplayNode* succ(SplayNode* t); void _kill(SplayNode* t); SplayNode* _copy(SplayNode* t); public: SplayPQ(); SplayPQ(SplayPQ& a); ~SplayPQ(); Pix enq( item); deq(); & front(); void del_front(); int contains( item); void clear(); Pix first(); Pix last(); void next(Pix& i); void prev(Pix& i); & operator () (Pix i); void del(Pix i); Pix seek( item); int OK(); // rep invariant }; #if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES) inline SplayPQ::~SplayPQ() { _kill(root); } inline SplayPQ::SplayPQ() { root = 0; count = 0; } inline SplayPQ::SplayPQ(SplayPQ& b) { count = b.count; root = _copy(b.root); } inline Pix SplayPQ::first() { return Pix(leftmost()); } inline Pix SplayPQ::last() { return Pix(rightmost()); } inline void SplayPQ::next(Pix& i) { if (i != 0) i = Pix(succ((SplayNode*)i)); } inline void SplayPQ::prev(Pix& i) { if (i != 0) i = Pix(pred((SplayNode*)i)); } inline & SplayPQ::operator () (Pix i) { if (i == 0) error("null Pix"); return ((SplayNode*)i)->item; } inline void SplayPQ::clear() { _kill(root); count = 0; root = 0; } inline int SplayPQ::contains( key) { return seek(key) != 0; } #endif #endif