polje_red.h

#include <iostream>
using namespace std;
 
struct klijent{
       char ime[35];
       int god;
       float stanje;
       int transakcija;
};
 
struct queue{
       klijent k[100];
       int front, rear;    
};
 
typedef struct queue *qu;
 
int AddOne (int n){
    return ((n+1) % 100);
}
 
void InitQ (queue *q){
     q -> front = 0;
     q -> rear = 99;    
}
 
bool IsEmptyQ (queue *q){
     if (AddOne(q -> rear) == q -> front) return true;
     else return false;
}
 
klijent FrontQ (queue *q){
        if (!IsEmptyQ(q)) return (q -> k[q -> front]);
        else cout << "Red je prazan." << endl;
}
 
void EnQueueQ (klijent k, queue *q){
     if (AddOne(AddOne(q -> rear)) == q -> front) cout << "Red je pun." << endl;
     else{
          q -> rear = AddOne(q -> rear);
          q -> k[q -> rear] = k;
     }
}
 
void DeQueueQ (queue *q){
     if (IsEmptyQ(q)) cout << "Red je prazan." << endl;
     else q -> front = AddOne(q -> front);
}