red_polje.h

using namespace std;
 
struct tklijent{       
       char ime[15];
       char prezime[20];
       char transakcija[20];
       int god_rodenja;
       int stanje_rac;       
};
typedef int element;        
typedef tklijent elementtype; 
 
struct qu{
   elementtype elements[1000]; 
   element front,rear;         
};
 
typedef struct qu queue; 
 
int AddOne(int n){       
   return((n+1)%1000);   
}
 
bool IsEmptyQ(queue *red){ 
	if (AddOne(red->rear) == red->front) return true; 
	else return false; 
}
 
elementtype FrontQ(queue *red){ 
	if (IsEmptyQ(red)){
		cout << "Red je prazan!" << endl;
		exit(1);
	}
	return red->elements[red->front]; 
}
 
void EnqueueQ(elementtype x , queue *red){  
	if (AddOne(AddOne(red->rear)) == red->front){ 
		cout << "Red je popunjen!" << endl;
		exit(1);
	}
	red->rear = AddOne(red->rear); 
	red->elements[red->rear] = x; 
};
 
void DequeueQ(queue *red){     
	if (IsEmptyQ(red)){
		cout << "Red je prazan!" << endl;
		exit(1);
	}
	red->front = AddOne(red->front); 
}
 
void InitQ(queue *red){
	red->front = 0; 
	red->rear = 999;
}