red_polje.h

#include<iostream>
using namespace std;
struct klijentiP{
       char ime_prez[40];
       int godina;
       int stanje;
       int transakcija;
};
 
struct red{
    klijentiP klijenti[10000];   
	int front,back;
};
 
int AddOne(int n) {
	return((n+1)%10000);
}
 
void InitQ(red *Q){
	Q->front=0;
	Q->back=9999;
}
klijentiP FrontQ(red *Q){
		return Q->klijenti[Q->front];
}
void EnQueueQ(klijentiP x,red *Q){
	if (AddOne(AddOne(Q->back))==Q->front)
		cout<<"red je pun!!";
	else{
			Q->back=AddOne(Q->back);
			Q->klijenti[Q->back]=x;
	}
}
void DeQueueQ(red *Q){
	if (AddOne(Q->back)!=Q->front){
		Q->front=AddOne(Q->front);
	}
}
int IsEmptyQ(red *Q){
	if(AddOne(Q->back)==Q->front)
		return 1;
	else
		return 0;
}