带模板的顺序循环队列

#include<iostream>
#include<list>
#include<assert.h>
using namespace std;
template<typename T>
inline void print(T* c)
{
cout<<*c<<" ";
}
template<typename T>
class SqQueueCy
{
protected:
T *base;
int front;
int rear;
int queuesize;
public:
SqQueueCy(int k = 1)
{
base = new T[k];
assert(base != NULL)
front = rear = 0;
queuesize = k;
}
~SqQueueCy()
{
delete[]base;
}
bool EnQueue(T e)
{
T *newbase;
int i;
if((rear + 1)%queuesize == front)
{
newbase = new T[queuesize*2];
if(newbase == NULL)
{
return false;
}
for(int i=0;i<queuesize-1;i++)
{
*(newbase+i) = *(base+(front+i)%queuesize);
}
delete[]base;
base = newbase;
front = 0;
rear = queuesize-1;
queuesize*=2;
}
*(base+rear) = e;
rear=++rear %queuesize;
return true;
}
bool DeQueue(T &e)
{
if(front == rear)
{
return false;
}
e = *(base+front);
front == ++front%queuesize;
}
void QueueTraverse(void (*visit)(T *))const
{
int i = front;
while(i!=rear)
{
visit(base+i);
i=++i%queuesize;
}
}
};
int main()
{
return 0;
}