C队列实现

队列

队列是先进先出的结构

队列实现
queue.h

#include <stdlib.h>

#define    QUEUE_TYPE   int

void create_queue(size_t size);

void destroy_queue(void);

void insert( QUEUE_TYPE value );

void delete( void );

QUEUE_TYPE first( void );

int is_empty(void);

int is_full(void);

queue.c

#include <stdio.h>
#include "queue.h"
#include <assert.h>

#define QUEUE_SIZE  100
#define ARRAY_SIZE  ( QUEUE_SIZE + 1 )

static QUEUE_TYPE  queue[ARRAY_SIZE];
static size_t      front = 1;
static size_t      rear = 0;

void insert( QUEUE_TYPE value)
{
	assert( !is_full() );
	rear = (rear + 1) % ARRAY_SIZE;
	queue[rear] = value;
}

void delete(void)
{
	assert( !is_empty() );
	front = (front + 1) % ARRAY_SIZE;

}

QUEUE_TYPE first(void)
{
	assert(!is_empty());
	return queue[front];
}

int is_empty(void)
{
	return (rear + 1) % ARRAY_SIZE == front;
}

int is_full( void )
{
	return (rear + 2) % ARRAY_SIZE == front;
}