red_polje.h

#include<iostream>
using namespace std;
 
struct data {
       int godina, racun; 
       char ime_prezime[50], *transakcija;
};
 
data greska={0,0,'\0','\0'};
 
struct red {
       data element[10000];
       int front, rear;       
};
 
int AddOne(int n) {
    return((n+1)%10000);
}
 
void InitQ(red *Q) {
     Q->rear=9999;
     Q->front=AddOne(Q->rear);     
}
 
bool IsEmptyQ(red *Q) {
     if (AddOne(Q->rear)==Q->front) return true;
     return false;     
}
 
data FrontQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return greska;
     }
     return Q->element[Q->front];     
}
 
void EnQueueQ(data x, red *Q) {
     if (AddOne(AddOne(Q->rear))==Q->front) {
        cout << "Red je pun!" << endl;
        cout << "Element nije dodan!" << endl;
        return;                                       
     }
     Q->rear=AddOne(Q->rear);
     Q->element[Q->rear]=x;
     if (AddOne(AddOne(Q->rear))==Q->front) cout << "Red je pun!" << endl;             
}
 
void DeQueueQ(red *Q) {
     if (IsEmptyQ(Q)) {
        cout << "Nema elemenata u redu!" << endl;
        return;
     }
     Q->front=AddOne(Q->front);     
}