myqueue.h

一个基于H.wang的谓词演算公式的机器证明的vc实现

template<class T> class myqueue;
template<class T> class myqueueNode{
	friend class myqueue<T>;
private:
	 T data;
	 myqueueNode<T> *link;
	 myqueueNode(T d=0,myqueueNode<T> *l=NULL):data(d),link(l){}
};
template<class T> class myqueue{
public:
	myqueue():rear(NULL),front(NULL){}
	~myqueue();
	void push(const T &item);
	void pop();
	T top();
	void MakeEmpty();
	int IsEmpty()const{return front==NULL;}
private:
	myqueueNode<T> *rear,*front;
};
template<class T> myqueue<T>::~myqueue(){
	MakeEmpty();
}
template<class T> void myqueue<T>::push(const T & item){
	if(front==NULL)front=rear=new myqueueNode<T>(item,NULL);
	else rear=rear->link=new myqueueNode<T>(item,NULL);
}
template<class T>  void myqueue<T>::pop(){
	if(!IsEmpty()){
	myqueueNode<T> *p=front;
	T value=p->data;
	front=front->link;
	delete p;
	}
}
template<class T> T myqueue<T>::top (){
	if(!IsEmpty())
		return front->data;
	else
		return 0;
}
template<class T> void myqueue<T>::MakeEmpty(){
	myqueueNode<T> *p;
	while(front!=NULL){	p=front;front=front->link;delete p;}
}