C++&QT 作业6

#include 
#define MAX 128
using namespace std;
template
class Queue_q
{
private:
    T *p=new T[MAX];//队列的数组
    int tail;//记录队尾元素
    int head;//记录对头元素
public:
    //构造函数
    Queue_q(int t=0)
    {
        head=t;
        tail=t;
        cout<<"无参构造函数"<
int Queue_q::queue_push(T e)
{
    if(queue_full())
    {
        cout<<"入队失败"<
int Queue_q::queue_pop()
{
    if(queue_empty())
    {
        cout<<"出队失败"<
int Queue_q::queue_delete()
{
    while(head!=tail)
    {
        queue_pop();
    }
    delete [] p;
    p=nullptr;
    cout<<"清空队列成功"<
bool Queue_q::queue_empty()
{
    if(head==tail)
    {
        cout<<"队列空"<
bool Queue_q::queue_full()
{
    if((tail+1)==0)
    {
        cout<<"队列满了"<
void Queue_q::queue_getsize()
{
    int size;
    size=(tail-head+MAX)%MAX;
    cout<<"队的大小为："< q1;
    double e;
    int s;
    q

#include 
#define MAX 128
using namespace std;
template
class Queue_q
{
private:
    T *p=new T[MAX];//队列的数组
    int tail;//记录队尾元素
    int head;//记录对头元素
public:
    //构造函数
    Queue_q(int t=0)
    {
        head=t;
        tail=t;
        cout<<"无参构造函数"<
int Queue_q::queue_push(T e)
{
    if(queue_full())
    {
        cout<<"入队失败"<
int Queue_q::queue_pop()
{
    if(queue_empty())
    {
        cout<<"出队失败"<
int Queue_q::queue_delete()
{
    while(head!=tail)
    {
        queue_pop();
    }
    delete [] p;
    p=nullptr;
    cout<<"清空队列成功"<
bool Queue_q::queue_empty()
{
    if(head==tail)
    {
        cout<<"队列空"<
bool Queue_q::queue_full()
{
    if((tail+1)==0)
    {
        cout<<"队列满了"<
void Queue_q::queue_getsize()
{
    int size;
    size=(tail-head+MAX)%MAX;
    cout<<"队的大小为："< q1;
    double e;
    int s;
    q