c++ 队列基本操作实现

#ifndef STATICQUEUE_H_INCLUDED
#define STATICQUEUE_H_INCLUDED

template<class T>
class StaticQueue
{
public:

StaticQueue();
StaticQueue(int size);
~StaticQueue();
void enqueue(T data);
T dequeue();
bool isEmpty();
bool isFull();
int count();
void display();

private:

int rear;
int front;
int size;
const static int DEFAULT;
T* queue;

};

#endif // STATICQUEUE_H_INCLUDED

#include <iostream>
#include <cstdio>
#include "StaticQueue.h"

using namespace std;
const int DEFAULT = 10;

template<class T>
StaticQueue<T>::StaticQueue()
{
queue = new T[DEFAULT];
size = DEFAULT;
rear = front = 0;
}

template<class T>
StaticQueue<T>::StaticQueue(int size)
{
queue = new T[size];
this->size = size;
rear = front = 0;
}

template<class T>
StaticQueue<T>::~StaticQueue()
{
delete [] queue;
queue = 0;
size = 0;
rear = front = 0;
}

template<class T>
bool StaticQueue<T>::isEmpty()
{
if(front == rear)
return true;
return false;
}

template<class T>
bool StaticQueue<T>::isFull()
{
if((rear - front) >= size)
return true;
return false;
}

template<class T>
void StaticQueue<T>::enqueue(T data)
{
if(isFull() == 0)
{
queue[rear] = data;
rear++;
}
else
fprintf(stderr, "Queue is full now.\n");
}

template<class T>
T StaticQueue<T>::dequeue()
{
if(isEmpty() == 0)
{
T tmp = queue[front];
front++;
return tmp;
}
else
{
fprintf(stderr, "Queue is empty now.\n");
return NULL;
}
}

template<class T>
int StaticQueue<T>::count()
{
return(rear-front);
}

template<class T>
void StaticQueue<T>::display()
{
int i;
for(i=front; i<rear; i++)
{
cout<<queue[i]<<" ";
}
cout<<endl;
}

//#include "StaticQueue.cpp"
#include <iostream>
#include <cstdio>
#include "StaticQueue.cpp"
using namespace std;

int main()
{
StaticQueue<int> q(4);
cout<<q.count()<<endl;
int arr[] = {1,2,3,4};
int i;
for(i=0; i<4; i++)
q.enqueue(arr[i]);
q.display();
return 0;
}