red_polje.h

struct klijent 										
{
	char ime[20];			
	char prezime[20];			
	int godina;										
	float stanje;									
	int transakcija;											
};
 
struct tred											
{
	klijent elementi[10000];						
	int front, rear;								
};
 
typedef struct tred *pred;							
 
int AddOne(int n)									
{													
	return (n + 1) % 10000;							
}
 
klijent FrontQ(tred *Q)								
{
	if (AddOne(Q->rear) == Q->front)				
	{
		klijent x;									
        x.godina = 0;								
        x.stanje = 0;
        x.transakcija = 0;
 
        return x;
	}
	else
		return Q->elementi[Q->front];				
}
 
void EnQueueQ(klijent x, tred *Q)					
{
	if (AddOne(AddOne(Q->rear)) != Q->front)		 
	{
		Q->rear = AddOne(Q->rear);					
		Q->elementi[Q->rear] = x;					
	}
}
 
void DeQueueQ(tred *Q)								
{
	if (AddOne(Q->rear) != Q->front) Q->front = AddOne(Q->front);	
}
 
void InitQ(tred *Q)									
{
	Q->rear = 9999;									
	Q->front = 0;									
}
 
bool IsEmptyQ(tred *Q)								
{
	if (AddOne(Q->rear) == Q->front)				
		return true;
	else
		return false;
}