队列之C语言

持戒波罗蜜

已于 2022-06-30 09:06:29 修改

阅读量258

点赞数

分类专栏：嵌入式文章标签： c语言 c++ 算法

于 2022-06-28 17:30:07 首次发布

本文链接：https://blog.csdn.net/qq_31057589/article/details/125506814

版权

嵌入式专栏收录该内容

13 篇文章 1 订阅

订阅专栏

#include <stdio.h>
#include <string.h>

#define   QUEUESIZE   128



struct queue
{
	unsigned char buff[QUEUESIZE];
	int front;
	int tail;
};

void  QueueInit(struct queue *queue_t)
{
	memset(queue_t,0,QUEUESIZE);
	queue_t->front=0;
	queue_t->tail=0;
}
int  QueueIsEmpty(struct queue * queue_t )
{
	return    queue_t->tail==queue_t->front;
}
int QueueisFull(struct queue * queue_t)
{
	return  queue_t->tail >= QUEUESIZE;
}
int QueueInsert(struct queue *queue_t , unsigned  char  word)
{
	if(!QueueisFull(queue_t)){
		queue_t->buff[queue_t->tail] = word;
		queue_t->tail++;
	}else
	{
		printf("Queue is Full \n");
		return -1;
	}
}
int QueueGetData(struct queue * queue_t )
{
	if(!QueueIsEmpty(queue_t))
	{		
			return queue_t->buff[queue_t->front++];
	}else{
		  printf("Queue is Empty !\n");
		  return -1;
	}
}
int QueueGetCount(struct  queue  *  queue_t )
{
	return  queue_t->tail -  queue_t -> front ;
}

int main(int argc ,char ** argv )
{
	int index=0;

	struct  queue  queue_p;

	QueueInit(&queue_p);
	
	QueueInsert(&queue_p,22);
	QueueInsert(&queue_p,23);
	QueueInsert(&queue_p,24);
	QueueInsert(&queue_p,25);
		
	printf("count == %d  \n",index=QueueGetCount(&queue_p ));
	
	while(index--)   printf("data =  %d  \n",QueueGetData(&queue_p));
		
	printf("count == %d  \n",index=QueueGetCount(&queue_p ));

	
	return 0;

}