//Queue //by baptiste prunier #include #include using namespace std; template class File; template ostream& operator<<(ostream& os,const File& f); template class File{ public: File(); File(unsigned int size,unsigned int inc=50); ~File(); void push(T value); T pop(); T head(); bool isEmpty(); private: T *values; int curr=-1; unsigned int size=0; unsigned int trueSize; const int incSize; friend ostream& operator<< <>(ostream& os,const File& f); }; int main() { int value; File f(1); f.push(1); f.push(2); f.push(3); cout<<"Queue : "< File::File():incSize(50),trueSize(50),values(new T[50]){} template File::File(unsigned int size,unsigned int inc):incSize(inc),trueSize(size),values(new T[size]){} template File::~File(){ delete[] values; } template void File::push(T value){ T* tab; if(size==trueSize ) { tab=new T[trueSize+incSize]; for(int i=0;i T File::pop(){ T value; if(isEmpty()){ throw "Error in File::pop : nothing to be poped"; } value=values[curr]; ++curr%=trueSize; --size; return value; } template T File::head(){ if(isEmpty()){ throw "Error in File::head : the queue is empty"; } return values[curr]; } template bool File::isEmpty(){ return !size; } template ostream& operator<<(ostream& os,const File& f){ for(int i=0;i

Queue FIFO