/*
Sichuan Engineering Vocational and Technical College
15 Software
*/
#include <string>
#include <assert.h>
#include <iostream>
typedef int status;
#define OK 1
#define ERROR 0
Template<class type>
Class Order_tream
{
Public
Order_tream (int a): Size (a+1), n (0)
{
Base =new type [a+1];
ASSERT (base!=0);
front=0;
rear=0;
}
int n;
Status full ();//Determine if the
status empty ();//Determine if empty
void Putin (int a);//input
Status Enqueue (Type a);//Incoming queue
Status Sqqueue (type &a);//OUT queue
void clear ();//Empty
Status out ();//Output entire queue
Private
int rear;//Tail
int front;//Head
int size;
type* Base;
};
/* Enter Queue */
Template<class type>
Status Order_tream<type>::enqueue (Type a)
{
if (full ())
return ERROR;
Base[rear]=a;
Rear= (rear+1)%size;
n++;
return OK;
}
/* Empty */
Template<class type>
void Order_tream<type>::clear ()
{
Front=rear;
}
/* Input */
Template<class type>
void Order_tream<type>::p utin (int a)
{
Type X;
cout<< "Input Start" <<endl;
for (int i=0;i<a;i++)
{
cin>>x;
Enqueue (x);
}
}
/* Out of queue */
Template<class type>
Status Order_tream<type>::sqqueue (type& a)
{
if (empty ())
return ERROR;
A=base[front];
Front= (front+1)%size;
n--;
return OK;
}
/* Determine if it is empty */
Template<class type>
Status Order_tream<type>::empty ()
{
if (front==rear)
return OK;
Else
return ERROR;
}
/* Determine if it is full */
Template<class type>
Status Order_tream<type>::full ()
{
if (front==rear+1)
return OK;
Else
return ERROR;
}
/* Output Entire queue */
Template<class type>
Status Order_tream<type>::out ()
{
if (empty ())
return ERROR;
Type A;
for (int i=0;i<n;i++)
{
A=base[i];
cout<<a<< ' \ t ';
}
cout<<n;
cout<<endl;
return OK;
}
C + + Queue basic Features