QUEUE1.cpp

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

#define Max_customers 5

typedef struct {
	int data[Max_customers];
	int front;
	int rear;
	int count;
	
}CustomerQueue;

void TaoQueue(CustomerQueue *q){
	q->front =0;
	q->rear=-1;
	q->count=0;
}

bool isEmpty(CustomerQueue *q){
	return q->count==0;
}
bool isFull(CustomerQueue *q){
	return q->count==Max_customers;
}

void enqueue(CustomerQueue *q, int customerID){
	if(isFull(q)){
		printf("FULL,customer ID %d please wait.\n",customerID);
		return;
	
	}
	q->rear=(q->rear+1)%Max_customers;
	q->data[q->rear]=customerID;
	q->count++;
	printf("ENQUEUE:%d.\n",customerID);
}
int dequeue(CustomerQueue *q){
	if(isEmpty(q)){
		printf("Empty.\n");
		return -1;
	}
	int customerID = q->data[q->front];
	q->front=(q->front+1)%Max_customers;
	q->count--;
	return customerID;
}
int main(){
	CustomerQueue q;
	TaoQueue(&q);
	printf("---------------------------------------\n");
	enqueue(&q,101);
	enqueue(&q,102);
	enqueue(&q,103);
	printf("DEQUEUE:%d\n",dequeue(&q));
	printf("DEQUEUE:%d\n",dequeue(&q));
	enqueue(&q,104);
	enqueue(&q,105);
	enqueue(&q,106);
	printf("DEQUEUE:%d\n",dequeue(&q));
	printf("DEQUEUE:%d\n",dequeue(&q));
	printf("DEQUEUE:%d\n",dequeue(&q));
	printf("DEQUEUE:%d\n",dequeue(&q));
	return 0;
}