Circular queue

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

#define MAXSIZE 20

typedef int T;

typedef struct Quene
{
    
	T data[MAXSIZE];
	int front;// Head position 
	int rear;// Tail position 
}*quene;

bool InitQuene(quene q)// initialization 
{
    
	if (!q)
		return false;
	q->front = 0;
	q->rear = 0;
	return true;
}

bool ClearQuene(quene q)// Qingdui 
{
    
	if (!q)
		return false;
	q->front = q->rear = 0;
	return true;
}

bool Is_Empty(quene q)// The disk is empty 
{
    
	return q->front == q->rear;
}

bool Is_Full(quene q)// Full sentence 
{
    
	return (q->rear + 1)%MAXSIZE == q->front;
}

int GetLength(quene q)// The number of data 
{
    
	return (q->rear - q->front + MAXSIZE) % MAXSIZE;
}

T GetHead(quene q)// Get team leader elements 
{
    
	if (Is_Empty(q))
		return -1;
	return q->data[q->front];
}

bool Push(quene q,T val)// The team 
{
    
	if (Is_Full(q))
		return false;
	q->data[q->rear] = val;
	q->rear = (q->rear + 1) % MAXSIZE;
	return true;
}

T Pop(quene q)// Out of the team 
{
    
	if (Is_Empty(q))
		return false;
	T tmp = q->data[q->front];
	q->front = (q->front + 1) % MAXSIZE;
	return tmp;
}

void Show(quene q)// Traverse 
{
    
	if (Is_Empty(q))
		return;
	int i = q->front;
	while (i != q->rear)
	{
    
		printf("%d ", q->data[i]);
		i = (i + 1) % MAXSIZE;
	}
	printf("\n");
}

//int main()
//{
    
// quene q;
// q = (quene)malloc(sizeof(Quene));
// InitQuene(q);
// for (int i = 1; i <= 10; i++)
// {
    
// Push(q,i);
// }
// Show(q);
// for (int i = 1; i <= 5; i++)
// {
    
// printf("%d ", Pop(q));
// }
// printf("\n");
// Show(q);
// return 0;
//}