SequenceQueue

#ifndef SEQUENCE_QUEUE_H_
#define SEQUENCE_QUEUE_H_


#define MAX_ELEM 100   
#define ElemType char  
struct SequenceQueue;
typedef struct SequenceQueue SequenceQueue;
typedef SequenceQueue *pSequenceQueue;
struct SequenceQueue
{
ElemType elem[MAX_ELEM];
int front;
int rear;
};




/************函数声明*****************/
pSequenceQueue CreateEmptyQueue();
bool IsSequenceQueueEmpty(pSequenceQueue p);
bool EnSequenceQueue(pSequenceQueue p, ElemType elem);
bool DelSequenceQueue(pSequenceQueue p);
ElemType GetFrontElem(pSequenceQueue p);

#endif

、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、、源文件

#include <stdio.h>
#include <malloc.h>
#include "SequenceQueue.h"




pSequenceQueue CreateEmptyQueue()
{
pSequenceQueue p = NULL;
p = (pSequenceQueue)malloc(sizeof(SequenceQueue));
if(p)
p->front = p->rear = 0;
return p;
}


bool IsSequenceQueueEmpty(pSequenceQueue p)
{
return (p->front == p->rear);
}


bool EnSequenceQueue(pSequenceQueue p, ElemType elem)
{
if (p->rear+1 % MAX_ELEM == p->front)
return false;
else
{
p->elem[p->rear] = elem;
p->rear = (p->rear+1) % MAX_ELEM;
return true;
}

}


bool DelSequenceQueue(pSequenceQueue p)
{
if (p->front == p->rear)
return false;
else
{
p->front = (p->front+1) % MAX_ELEM;
return true;
}
}


ElemType GetFrontElem(pSequenceQueue p)
{
return (p->elem[p->front]);
}