顺序队列 array_queue(空一个位置)

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

#define TYPE int

typedef struct ArrayQueue
{
	TYPE* ptr;
	size_t cal;
	size_t front;
	size_t rear;
}ArrayQueue;

ArrayQueue* create_array_queue(size_t cal)
{
	ArrayQueue* queue = malloc(sizeof(ArrayQueue));
	queue->ptr = malloc(sizeof(TYPE)*(cal+1));
	queue->cal = cal+1;
	queue->front = 0;
	queue->rear = 0;
	return queue;
}

void destory_array_queue(ArrayQueue* queue);

bool empty_array_queue(ArrayQueue* queue)
{
	return queue->front == queue->rear;
}

bool full_array_queue(ArrayQueue* queue)
{
	return (queue->rear+1)%queue->cal == queue->front;
}

bool push_array_queue(ArrayQueue* queue,TYPE val)
{
	if(full_array_queue(queue))	return false;
	queue->ptr[queue->rear] = val;
	queue->rear = (queue->rear+1)%queue->cal;
	return true;
}

bool pop_array_queue(ArrayQueue* queue)
{
	if(empty_array_queue(queue))	return false;
	queue->front = (queue->front+1)%queue->cal;
	return true;
}

TYPE head_aray_queue(ArrayQueue* queue)
{
	return queue->ptr[queue->front];
}

TYPE tail_array_queue(ArrayQueue* queue)
{
	return queue->ptr[(queue->cal + queue->rear-1)%queue->cal];
}

size_t size_array_queue(ArrayQueue* queue)
{
	return (queue->rear - queue->front + queue->cal)%queue->cal;
}

int main(int argc,const char* argv[])
{
	ArrayQueue* queue = create_array_queue(10);
	for(int i=0; i<10; i++)
	{
		push_array_queue(queue,i);
		printf("tail:%d ",tail_array_queue(queue));
		printf("size:%lu\n",size_array_queue(queue));
	}
	printf("=================\n");
	while(!empty_array_queue(queue))
	{
		printf("head:%d ",head_aray_queue(queue));
		pop_array_queue(queue);
		printf("size:%lu\n",size_array_queue(queue));
	}
}