Queue.cpp

#include <iostream> #include "Queue.h" using namespace std; int main(){ Queue<int> qi; ((((qi.insert(5)).insert(6)).insert(7)).remove()).insert(8); cout << "the tail is: " << qi.tail() << endl; while (!qi.empty()){ cout << qi.head()<< " "; qi.remove(); } cout << endl << "Finished" << endl; return 0; }

Queue.h

template <class T> class Queue{ public: Queue(){ top = 0; header = 0; array = new T[0]; } ~Queue(){*array=NULL;} inline Queue& Queue::insert(const T num){ array[top] = (T)num; top++; return *this; } inline Queue& Queue::remove(){ array[header] = 0; header++; return *this; } inline T Queue::tail(){ return array[top-1]; } inline T Queue::empty(){ return !(top-header); } inline T Queue::head(){ return array[header]; } private: T* array; int header; int top; };