red_polje.h

struct tdata{
  int x,y, prioritet, rb;
};
 
struct tlist{
  tdata data[10000];
  int front, rear;
};
 
int AddOne(int n){
  return (( n + 1 ) % 10000);
}
 
bool IsEmptyQ(tlist *Q){
  if(AddOne(Q->rear)==Q->front)
    return true;
  return false;
}
 
tdata FronQ(tlist *Q){
  tdata data;
  data.x = 0; data.y = 0;
  if(IsEmptyQ(Q))
    return data;
  return Q->data[Q->front];
}
 
void EnQueueQ(tdata x,tlist *Q){
  Q->rear = AddOne(Q->rear);
  Q->data[Q->rear] = x;
}
 
bool DeQueueQ(tlist *Q){
  if(IsEmptyQ(Q))
    return false;
  Q->front = AddOne(Q->front);
  return true;
}
 
tlist* InitQ(tlist *Q){
  Q = new tlist;
  Q->front = 0;
  Q->rear = 9999;
  return Q;
}