This commit was manufactured by cvs2svn to create tag 'FreeBSD-release/1.0'.
[unix-history] / gnu / lib / libg++ / g++-include / gen / PQ.hP
// 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 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 _<T>PQ_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>PQ_h 1
#include <Pix.h>
#include "<T>.defs.h"
class <T>PQ
{
protected:
int count;
public:
<T>PQ();
virtual ~<T>PQ();
int length(); // current number of items
int empty();
virtual Pix enq(<T&> item) = 0; // add item; return Pix
virtual <T> deq(); // return & remove min
virtual <T>& front() = 0; // access min item
virtual void del_front() = 0; // delete min item
virtual int contains(<T&> item); // is item in PQ?
virtual void clear(); // delete all items
virtual Pix first() = 0; // Pix of first item or 0
virtual void next(Pix& i) = 0; // advance to next or 0
virtual <T>& operator () (Pix i) = 0; // access item at i
virtual void del(Pix i) = 0; // delete item at i
virtual int owns(Pix i); // is i a valid Pix ?
virtual Pix seek(<T&> item); // Pix of item
void error(const char* msg);
virtual int OK() = 0; // rep invariant
};
inline <T>PQ::<T>PQ() :count(0) {}
inline <T>PQ::~<T>PQ() {}
inline int <T>PQ::length()
{
return count;
}
inline int <T>PQ::empty()
{
return count == 0;
}
#endif