#include<iostream>
using namespace std;
#define MAXSIZE 20
typedef int ElemType;
typedef struct
{
ElemType data[MAXSIZE];
int front; /* 头指针 */
int rear; /* 尾指针,若队列不空,指向队列尾元素的下一个位置 */
int count; //元素个数
} SqQueue;
bool InitQueue(SqQueue &Sq)
{
cout << "Init Queue ..." << endl;
Sq.front = 0;
Sq.rear = 0;
Sq.count = 0;
return true;
}
bool ClearQueue(SqQueue &Sq)
{
cout << "Clear Queue ..." << endl;
Sq.front = 0;
Sq.rear = 0;
Sq.count = 0;
return true;
}
bool QueueEmpty(SqQueue &Sq)
{
return Sq.count == 0; /* 队列空的标志 */
}
bool QueueFull(SqQueue &Sq)
{
return Sq.count == MAXSIZE;
}
int QueueLength(SqQueue &Sq)
{
if (QueueFull(Sq))
return MAXSIZE;
/* 队列的当前长度 */
return (Sq.rear - Sq.front + MAXSIZE) % MAXSIZE;
}
/* 返回头元素 */
bool GetHead(SqQueue &Sq, ElemType *pe)
{
if (QueueEmpty(Sq))
return false;
else
{
*pe = Sq.data[Sq.front];
cout << "Get Head Item " << *pe << endl;
return true;
}
}
bool EnQueue(SqQueue &Sq, ElemType Elem)
{
/* 队列满 */
if (QueueLength(Sq) == MAXSIZE)
return false;
cout << "EnQueue Item " << Elem << endl;
Sq.data[Sq.rear] = Elem;/* 将元素赋值给队尾 */
Sq.rear = (Sq.rear + 1) % MAXSIZE;/* rear指针向后移一位置, */
/* 若到最后则转到数组头部 */
Sq.count++;
return true;
}
bool DeQueue(SqQueue &Sq, ElemType *pe)
{
if (QueueEmpty(Sq))
return false;
*pe = Sq.data[Sq.front];/* 将队头元素赋值给*pe */
cout << "DeQueue Item " << *pe << endl;
Sq.front = (Sq.front + 1) % MAXSIZE;/* front指针向后移一位置, */
/* 若到最后则转到数组头部 */
Sq.count--;
return true;
}
bool QueueTraverse(SqQueue &Sq)
{
if (QueueEmpty(Sq))
{
cout << "Queue is empty" << endl;
return false;
}
cout << "Queue Traverse ..." << endl;
for (int i = 0; i < Sq.count; i++)
cout << Sq.data[i + Sq.front] << ' ';
cout << endl;
return true;
}
int main(void)
{
SqQueue Sq;
InitQueue(Sq);
for (int i = 0; i < 20; i++)
EnQueue(Sq, i);
QueueTraverse(Sq);
if (!QueueEmpty(Sq))
cout << "Queue Length: " << QueueLength(Sq) << endl;
int result;
GetHead(Sq, &result);
DeQueue(Sq, &result);
DeQueue(Sq, &result);
if (!QueueEmpty(Sq))
cout << "Queue Length: " << QueueLength(Sq) << endl;
QueueTraverse(Sq);
return 0;
}