队列queue的系列函数

main.c

#include <stdio.h>
#include <stdlib.h>

#include "queue.h"

void show_menu(void){
	printf("******队列功能测试界面******\n");
	printf("*** 1.队列压入元素 \n");
	printf("*** 2.队列弹出元素 \n");
	printf("*** 3.查看队列首元素 \n");
	printf("*** 4.队列是否为空 \n");
	printf("*** 5.队列是否满了 \n");
	printf("*** 6.队列里面元素遍历 \n");
	printf("*** 0.销毁 \n");
	printf(">>>>");
}
void print(int n){
	printf("%d ",n);
}

void test_queue(void){
	printf("请输入要创建队列的容量大小:");
	size_t cap = 0;
	scanf("%u",&cap);
	Queue s;
	queue_init(&s,cap);
	int ret = 0;
	int data = 0;
	while(true){
		show_menu();
		int opt = 0;
		scanf("%d",&opt);
		switch(opt){
			case 1:
				printf("请输入要压入到队列的元素:");
				scanf("%d",&data);
				ret = queue_push(&s,data);
				if(ret == -1){
					printf("压入失败!  栈满了!\n");
				}else{
					printf("压入成功!\n");
				}
				break;
			case 2:
				data = 0;
				ret = queue_pop(&s,&data);
				if(ret == -1){
					printf("弹出失败!  栈已空!\n");
				}else{
					printf("弹出成功,元素为:%d\n",data);
				}
				break;
			case 3:
				data = 0;
				ret = queue_first(&s,&data);
				if(ret == -1){
					printf("查看栈顶元素失败!  栈已空!\n");
				}else{
					printf("栈顶元素为:%d\n",data);
				}	
				break;			
			case 4:
				if(queue_empty(&s)){
					printf("栈空空如也!\n");
				}else{
					printf("栈中有数据!\n");
				}
				break;
			case 5:
				if(queue_full(&s)){
					printf("栈满!\n");
				}else{
					printf("栈没满，还有空间存储数据!\n");
				}
				break;
			case 6:
				queue_travel(&s,print);
				printf("\n");
				break; 
			case 0:
				queue_destroy(&s);
				return;
		}
	}
}


int main(int argc, char *argv[]) {
	test_queue();
	return 0;
}

queue.h

#ifndef _QUEUE_H__
#define _QUEUE_H__

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct Queue{
	int *data;
	size_t cap;   //队列最大容量
	size_t size;  //队列中元素的个数
	size_t first; //队列头的下标位置        size_t head,tail; 
}Queue;

int queue_init(Queue *que,size_t cap);
bool queue_empty(Queue *que);
bool queue_full(Queue *que);
int queue_push(Queue *que,int elem);
int queue_pop(Queue *que,int *pelem);
int queue_first(Queue *que,int *pelem);
void queue_travel(Queue *que,void (*travel)(int));
void queue_destroy(Queue *que);

#endif //_QUEUE_H__

queue.c

#include "queue.h"
int queue_init(Queue *que,size_t cap){
	que->data = malloc(cap*sizeof(int));
	if(que->data == NULL){
		return -1;
	}
	que->cap = cap;
	que->size = 0;
	que->first = 0;
}
bool queue_empty(Queue *que){
	return que->size == 0;
}
bool queue_full(Queue *que){
	return que->size >= que->cap;
}
int queue_push(Queue *que,int elem){
	if(queue_full(que)){
		return -1;
	}
	que->data[(que->first + que->size)%que->cap] = elem;
	(que->size)++;
	return 0;
}
int queue_pop(Queue *que,int *pelem){
	if(queue_empty(que)){
		return -1;
	}
	*pelem = que->data[que->first];
	que->first++;
	que->size--;
	if(que->first>=que->cap){
		que->first = 0;
	}
	return 0;
}
int queue_first(Queue *que,int *pelem){
	if(queue_empty(que)){
		return -1;
	}
	*pelem = que->data[que->first]; 
	return 0;
}
void queue_travel(Queue *que,void (*travel)(int)){
	size_t i;
	for(i=0;i<que->size;i++){
		travel(que->data[(que->first+i)%que->cap]);
	}
}
void queue_destroy(Queue *que){
	if(que->data!=NULL){
		free(que->data);
		que->data = NULL;
		que->size = 0;
		que->first = 0;
	}
}