//定義循環(huán)隊(duì)列
typedef struct _LoopQueue {
	int data[8];		//存放數(shù)據(jù)
	int start;		//頭指針
	int end;		//尾指針
} LoopQueue;

#define TRUE	1
#define FALSE	0
#define SIZE	8
//初始化隊(duì)列
int init(LoopQueue *lq) {
	lq->start = 0;
	lq->end = 0;
	return TRUE;
}
//判斷隊(duì)列是否為空
int isEmpty(LoopQueue *lq) {
	if (lq->start == lq->end) {
		return TRUE;
	}
	return FALSE;
}
//判斷隊(duì)列是否為滿
int isFull(LoopQueue *lq) {
	if ((lq->end + 1) % SIZE == lq->start) {
		return TRUE;
	}
	return FALSE;
}
//獲取隊(duì)列的長度
int getLength(LoopQueue *lq) {
	return (lq->end - lq->start + SIZE) % SIZE;
}
//插入數(shù)據(jù)
int pushQueue(LoopQueue *lq, int data) {
	if(isFull(lq)) {
		printf("Queue is full.\n");
		return FALSE;
	}
	lq->data[lq->end] = data;
	lq->end = (lq->end + 1) % SIZE;
	return TRUE;
}
//彈出數(shù)據(jù)
int popQueue(LoopQueue *lq, int *data) {
	if (isEmpty(lq)) {
		printf("Queue is empty.\n");
		return FALSE;
	}
	*data = lq->data[lq->start];
	lq->start = (lq->start + 1) % SIZE;
	return TRUE;
}
//顯示隊(duì)列中的數(shù)據(jù)
void printQueue(LoopQueue *lq) {
	int index;
	int count;
	count = getLength(lq);
	if (0 == count) {
		printf("No data.\n");
		return;
	}
	for (index = 0; index < count; index++) {
		printf("%d ", lq->data[index]);
	}
	printf("\n");
	return;
}

int main()
{
	int index;
	int num;
	//隊(duì)列測試代碼
	LoopQueue *lq = (LoopQueue *)malloc(sizeof(LoopQueue));
	init(lq);
	printQueue(lq);
	for (index = 0; index < SIZE; index ++) {	//注意這里要放8個(gè)數(shù)據(jù)，但是實(shí)際上只能放7個(gè)，所以最后一個(gè)會(huì)報(bào)錯(cuò)
		pushQueue(lq, index);
	}
	printQueue(lq);
	for (index = 0; index < SIZE; index ++) {	//同上，會(huì)打印一個(gè)錯(cuò)誤
		if (popQueue(lq, &num)) {
			printf("%d\n", num);
		}
	}
	printQueue(lq);
	return 0;
}