queue.cpp

c++模板小实验

#include <iostream.h>
#include "queue.h"
template <class T>
queue<T>::queue(int q)
{
size=q>0 && q<1000 ?q:10;
rear=front=0;
queptr=new T[size];
}
template <class T>
queue<T>::~queue()
{delete[]queptr;}
template <class T>
int queue<T>::isempty()
{if(rear%size==front) return 1;
 else return 0;
}
template <class T>
int queue<T>::isfull()
{if((rear+1)%size==front) return 1;
 else return 0;
}
template <class T>
int queue<T>::enqueue( T & item)
{
if(!isfull())
{rear=(rear+1)%size;
 queptr[rear]=item;
 return 1;
}
else return 0;
}
template <class T>
int queue<T>::dlqueue( T & dl)
{
if(!isempty())
{front=(front+1)%size;
 dl=queptr[front];
 return 1;
}
else return 0;
}