动态数组队列

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

static QUEUE_TYPE *queue; //定义队列指针
static size_t queue_size; //记录队列大小
static int front = 0;
static int rear = 0;

void creat_queue(size_t size) {
assert(queue_size == 0);
queue_size = size;
queue =(QUEUE_TYPE*) malloc((queue_size+1)*sizeof(QUEUE_TYPE));
assert(queue != NULL);
}

void destroy_queue(void) {
assert(queue_size > 0);
queue_size = 0;
free(queue);
queue = NULL;
}

void enqueue(QUEUE_TYPE value) {
// 判断队列是否为满
assert(!is_full());
// 判断队列是否为空
if (is_empty())
queue[front] = value;
queue[rear] = value;
rear = (rear + 1) % (queue_size + 1);
}

QUEUE_TYPE dequeue(void) {
//判断队列是否为空
assert(!is_empty());

int temp = queue[front];
front = (front + 1) % (queue_size + 1);
return temp;

}

bool is_empty(void) {
//如果rear==front则队列为空
return rear == front;
}

bool is_full(void) {
//如果(rear+1)%(QUEUE_SIZE+1)==front则队列为满
return (rear + 1) % (queue_size + 1) == front;
}

QUEUE_TYPE front_value(void) {
return queue[front];
}

int get_size(void) {
return (rear - front);
}