c++十四章第三题

自定义模板QueueTp

#ifndef QUEUETP_H_
#define QUEUETP_H_
template<typename T>
class QueueTp
{
public:
 QueueTp() { date = new T[Q_size], top = 0; }
 QueueTp(int q) { date = new T[2 * q], top = 0; }
 ~QueueTp() { delete[]date; };
 bool isempty() { return top == 0; }
 bool isfull() { return top == Q_size; }
 bool Push(T item);
 bool Pop();
 T& front()const;
 T& rear()const;
 private:
 const int Q_size = 10;
 T* date;
 int top;
};
template<typename T>
bool QueueTp<T>::Push(T item)
{
 if (isfull())
  return false;
 for (int i = top; i > 0; --i)
 {
  date[i] = date[i - 1];
 }
 date[0] = item;
 ++top;
 return true;
}
template<typename T>
bool QueueTp<T>::Pop()
{
 if (isempty())
  return false;
 --top;
 return true;
}
template<typename T>
T& QueueTp<T>::front()const
{
 return date[top - 1];
}
template<typename T>
T& QueueTp<T>::rear()const
{
 return date[0];
}
#endif