red_polje.h

struct pacijent {
    int prior, x, y;
};
 
struct tred{
    pacijent pac[10000];
    int front, rear;
};
 
tred red;
 
int AddOne (int mjesto) {
    return (mjesto+1)%10000;
}
 
pacijent FrontQ (tred red_atp) {
    return red_atp.pac[red_atp.front];
}
 
void EnQueueQ (pacijent pac, tred &red_atp) {
    red_atp.rear=AddOne(red_atp.rear);
    red_atp.pac[red_atp.rear] = pac;
}
 
void DeQueueQ (tred &red_atp) {
    red_atp.front=AddOne(red_atp.front);
}
 
bool IsEmptyQ (tred red_atp) {
    if (AddOne(red_atp.rear)==red_atp.front) {
        return true;
    }
    else {
        return false;
    }
}
 
void InitQ (tred &red_atp) {
    red_atp.front=0;
    red_atp.rear=9999;
}