CycleQueue--循环队列(c语言简单实现)

#include<stdlib.h>

#define SIZE 10
typedef char ele;

typedef struct{
    ele *e;
    int front;
    int rear;
}cycleQueue;


//initQueue
void initQueue(cycleQueue *q){
    q = (cycleQueue *)malloc(sizeof(cycleQueue));
    q->e = (ele *)malloc(SIZE*sizeof(ele));
    q->front=q->rear=0;
}

//insertQueue
void insertQueue(cycleQueue *q,ele e){
    if(q->front==(q->rear+1)%SIZE)return;
    q->e[q->rear]=e;
    q->rear=(q->rear+1)%SIZE;
}

//popQueue
ele popQueue(cycleQueue *q){
    if(q->front==q->rear)return NULL;
    ele e = q->e[q->front];
    q->front=(q->front+1)%SIZE;
    return e;
}