队列是一种特殊的线性表,它只允许在表的前端(front)进行删除操作,而在表的后端(rear)进行插入操作。进行插入操作的端称为队尾,进行删除操作的端称为队头。队列中没有元素时,称为空队列。
队列具有先进先出(FIFO)的特点。
队列空的条件: front = rear
队列满的条件: rear = MAXSIZE
typedef struct frameData
{
int data;
struct frameData *next;
}FRAME_DATA_ST, *LPFRAME_DATA_ST;
typedef struct frameQueue
{
LPFRAME_DATA_ST front; // 队头
LPFRAME_DATA_ST rear; //队尾
unsigned int totalLenght; //整个队列的长度
unsigned int currLenght; //记录当前队列的长度
}FRAME_QUEUE_ST, *LPFRAME_QUEUE_ST;
/*初始化队列*/
int initFrameData(LPFRAME_QUEUE_ST lq)
{
lq->front=lq->rear = new FRAME_DATA_ST;//为头结点分配内存
if(!lq->front)
{
return FALSE;
}
lq->front->next=NULL; //
lq->totalLenght = MAXSIZE ;
lq->currLenght = 0;
return TRUE;
}
//插入一个元素到队尾
int writeNode(LPFRAME_QUEUE_ST lq, int data)
{
if (lq->currLenght == lq->totalLenght) // 队列已满
{
//fprintf(stderr, "queue is full.\n");
return FALSE;
}
LPFRAME_DATA_ST node = new FRAME_DATA_ST;
node->data = data;
node->next = NULL;
lq->rear = lq->rear->next = node; //或者写成lq->rear->next = node, lq->rear = node;
lq->currLenght++;
return TRUE;
}
//从队头出去一个元素
int readFrameData(LPFRAME_QUEUE_ST lq, int *data)
{
if (lq->front == lq->rear) //队列已空
{
//fprintf(stderr, "queue is empty.\n");
return FALSE;
}
LPFRAME_DATA_ST node= lq->front->next;
*data = node->data;
lq->front->next = node->next;
if(lq->rear==node)
{
lq->rear=lq->front;
}
delete node;
lq->currLenght--;
return TRUE;
}
/*摧毁整个队列*/
void DestoryFrameData(LPFRAME_QUEUE_ST lq)
{
while(lq->front)
{
lq->rear = lq->front->next;
delete lq->front;
lq->front = lq->rear;
}
}