数据结构----FIFO队列

之前发的都是链表，补一篇队列形式的，不用指针形式表示。之所以用到先入先出队列是用来缓存我写交换时进入的packet，

#include

#include

#define MAXSIZE 100

typedef struct {

int Data[MAXSIZE];

int front, rear;

}*packet_queue, pp_queue;

int is_empty_queue(packet_queue Q) {

if (Q && Q->front == Q->rear) {

return 1;

}

else {

return 0;

}

}

packet_queue init_queue() {

packet_queue Q = malloc(sizeof(pp_queue));

if (Q) {

Q->front = 0;

Q->rear = 0;

}

return Q;

}

int packet_enqueue(packet_queue Q, const int Data) {

if ((Q->rear + 1) % MAXSIZE == Q->front) {

printf("队满\n");

return 0;

}

else {

Q->rear = (Q->rear + 1) % MAXSIZE;

Q->Data[Q->rear] = (int) Data;

return 1;

}

}

int packet_dequeue(packet_queue Q) {

if (is_empty_queue(Q)) {

return 0;

}

else {

Q->front = (Q->front + 1) % MAXSIZE;

return Q->Data[Q->front];

}

}

void free_queue(packet_queue Q) {

free(Q);

}

int main() {

packet_queue head = init_queue();

packet_enqueue(head,3);

packet_enqueue(head,4);

printf("%d\n",packet_dequeue(head));

printf("%d\n",packet_dequeue(head));

}