pqueue.h

非常完整的电梯模拟系统 欢迎大家提出宝贵建议

#ifndef PQUEUE_CLASS
#define PQUEUE_CLASS

#include <iostream.h>
#include <assert.h>

template <class T>
class PQueue;

template <class T>
class PQueueNode
{
	friend class PQueue<T>;

public:
	PQueueNode(T & value,int newpriority,PQueueNode<T> *next)
		:data(value),priority(newpriority),link(next){}
	T GetData(){return data;}
	int GetPriority(){return priority;}
	PQueueNode<T> * GetLink(){return link;}
	void SetData(T & value){data=vaule;}
	void SetPriority(int newpriority){priority=newpriority;}
	void SetLink(PQueueNode<T> * next){link=next;}

private:
	T data;
	int priority;
	PQueueNode<T> * link;
};

template <class T>
class PQueue
{
public:
	PQueue():front(NULL),rear(NULL){}
	~PQueue(){MakeEmpty();}
	void EnQueue1(T & value,int newpriority);
	void EnQueue2(T & value,int newpriority);
	T DeQueue();
	T Get();
	void MakeEmpty();
	int IsEmpty(){return front==NULL;}

protected:
	PQueueNode<T> *front, *rear;

};

template <class T>
void PQueue<T>::MakeEmpty()
{
	PQueueNode<T> *q;
	while(front!=NULL)
	{
		q=front;
		front=front->link;
		delete q;
	}
	rear=NULL;
}

template <class T>
void PQueue<T>::EnQueue1(T & value,int newpriority)
{
	PQueueNode<T> * q=new PQueueNode<T>(value,newpriority,NULL);
	if(IsEmpty())
		front=rear=q;
	else
	{
		PQueueNode<T> *p=front,*pr=NULL;
		while(p!=NULL&&p->priority<=newpriority)
		{
			pr=p;
			p=p->link;
		}
		if(pr==NULL)
		{
			q->link=front;
			front=q;
		}
		else
		{
			q->link=p;
			pr->link=q;
			if(pr==rear)
				rear=q;
		}

	}
}

template <class T>
void PQueue<T>::EnQueue2(T & value,int newpriority)
{
	PQueueNode<T> * q=new PQueueNode<T>(value,newpriority,NULL);
	if(IsEmpty())
		front=rear=q;
	else
	{
		PQueueNode<T> *p=front,*pr=NULL;
		while(p!=NULL&&p->priority>=newpriority)
		{
			pr=p;
			p=p->link;
		}
		if(pr==NULL)
		{
			q->link=front;
			front=q;
		}
		else
		{
			q->link=p;
			pr->link=q;
			if(pr==rear)
				rear=q;
		}

	}
}

template <class T>
T PQueue<T>::DeQueue()
{
	if(IsEmpty())
		cout<<"Empty Queue"<<endl;
	PQueueNode<T> *q=front;
	front=front->link;
	T value=q->data;
	delete q;
	if(front==NULL)
		rear=NULL;
	return value;
}

template <class T>
T PQueue<T>::Get()
{
	return front->data;
}

#endif