red_polje.h

#include <cstdlib>
#include <iostream>
 
using namespace std;
 
struct tpopis{      
 
       int red_br;
       int prvi;
       int drugi; 
       int pok;      
};
 
struct r{
 
       tpopis popis[10000];
       int front, rear; 
};
 
int addone(int i){
 
    return ((i+1)%10000);
};
 
void initq(r *red){
 
     red->front=0;
     red->rear=9999; //zadnji el polja
     cout<<"Red je inicijaliziran"<<endl;
};
 
bool isemptyq(r *red){
 
    if(addone(red->rear)==red->front) return true;
    else return false;
};
 
void enqueueq(tpopis prvi, r *red){ 
 
     if(addone(addone(red->rear))==(red->front)) cout<<"Red je pun";
     else {
          red->rear=addone(red->rear);
          red->popis[red->rear]=prvi; 
          }
};
 
void dequeueq(r *red){ 
 
     if(isemptyq(red)) cout<<"Red je prazan";
     else red->front=addone(red->front); 
};
 
tpopis frontq(r *red){
 
       if(isemptyq(red)) cout<<"Red je prazan";
       else return (red->popis[red->front]);
};