队列的相关操作（顺序结构）

给出队列的定义：

#define MAX_SIZE 8
typedef int DataType;

/顺序结构/

typedef struct Queue  //顺序结构
{
	DataType _array[MAX_SIZE];
	int _front;
	int _back; 
	int _count;
}Queue;

将函数的声明放在head.h的头文件里面：

#define _CRT_SECURE_NO_WARNINGS 0

#include <assert.h>
#include <stdio.h>
#include <malloc.h>

#define MAX_SIZE 8
typedef int DataType;

/顺序结构/

typedef struct Queue  //顺序结构
{
	DataType _array[MAX_SIZE];
	int _front;
	int _back; 
	int _count;
}Queue;

//
/// Queue.h ///
void QueueInit(Queue* q);
void QueuePush(Queue* q, DataType data);
void QueuePop(Queue* q);
int QueueEmpty(Queue* q);
int QueueSize(Queue* q);
DataType QueueFront(Queue* q);
DataType QueueBack(Queue* q);

函数的定义（具体实现）：

#include "Queue.h"

void QueueInit(Queue* q)
{
	assert(q);
	q->_front = q->_back = 0;
	q->_count = 0;
}

void QueuePush(Queue* q, DataType data)
{
	assert(q);

	if (MAX_SIZE == q->_count)
	{
		printf("队列已满!!!");
		return;
	}

	q->_array[q->_back++] = data;

	if (q->_back == MAX_SIZE)
	{
		q->_back = 0;
	}

	q->_count++;
}

void QueuePop(Queue* q)
{
	assert(q);
	if (QueueEmpty(q))
	{
		printf("队列已空，无法出队列!!!\n");
		return;
	}

	++(q->_front);

	if (q->_front == MAX_SIZE)
	{
		q->_front = 0;
	}

	q->_count--;
}

int QueueEmpty(Queue* q)
{
	assert(q);
	return 0 == q->_count;
}

int QueueSize(Queue* q)
{
	return q->_count;
}

DataType QueueFront(Queue* q)
{
	return q->_array[q->_front];
}

DataType QueueBack(Queue* q)
{
	//return q->_array[(q->_back-1+MAX_SIZE)%MAX_SIZE];

	if (0 != q->_back)
	{
		return q->_array[q->_back - 1];
	}	
	else
	{
		return q->_array[MAX_SIZE - 1];
	}		
}

测试代码：

#include "Queue.h"

void TestQueue()
{
	Queue q;
	QueueInit(&q);
	QueuePush(&q, 1);
	QueuePush(&q, 2);
	QueuePush(&q, 3);
	QueuePush(&q, 4);
	QueuePush(&q, 5);
	QueuePush(&q, 6);
	printf("size = %d\n", QueueSize(&q));
	printf("front = %d\n", QueueFront(&q));
	printf("back = %d\n", QueueBack(&q));

	QueuePop(&q);
	QueuePop(&q);
	printf("size = %d\n", QueueSize(&q));
	printf("front = %d\n", QueueFront(&q));
	printf("back = %d\n", QueueBack(&q));

	QueuePush(&q, 7);
	QueuePush(&q, 8);
	QueuePush(&q, 9);
	QueuePush(&q, 0);
	printf("size = %d\n", QueueSize(&q));
	printf("front = %d\n", QueueFront(&q));
	printf("back = %d\n", QueueBack(&q));

	QueuePop(&q);
	QueuePop(&q);
	QueuePop(&q);
	QueuePop(&q);
	QueuePop(&q);
	QueuePop(&q);
	printf("size = %d\n", QueueSize(&q));
	printf("front = %d\n", QueueFront(&q));
	printf("back = %d\n", QueueBack(&q));

	printf("\n");
}

int main()
{
	TestQueue();
	system("pause");
	return 0;
}