//TQueue.h #ifndef _myqueue_H #define _myqueue_H template class myqueue { public: myqueue(int sz = 30); ~myqueue(); // MODIFICATION MEMBER FUNCTIONS void pop(); void push(const T& entry); // CONSTANT MEMBER FUNCTIONS bool empty() const { return (count == 0); } T front() const; int size() const { return count; } private: T* data; // Circular array int qsize; int first; // Index of double at front of the myqueue int last; // Index of double at rear of the myqueue int count; // Total number of doubles in the myqueue // HELPER MEMBER FUNCTION int next_index(int i) const { return (i + 1) % qsize; } }; template myqueue::myqueue(int sz) :qsize(sz) { data = new T[qsize]; count = 0; first = 0; last = qsize - 1; } template myqueue::~myqueue() { delete[] data; } template T myqueue::front() const { return data[first]; } template void myqueue::pop() { first = next_index(first); --count; } template void myqueue::push(const T& entry) // Library facilities used: cassert { last = next_index(last); data[last] = entry; ++count; } #endif //Main.cpp #include #include //#include "TQueue.h" using namespace std; template void printandpop( myqueue& q) { while (!q.empty()) { cout << q.front() << "\n"; q.pop(); } } int main() { myqueue IntQ; IntQ.push(1); IntQ.push(2); IntQ.push(3); IntQ.push(4); printandpop(IntQ); //----------- myqueue StrQ; StrQ.push("ali"); StrQ.push("ayse"); StrQ.push("ahmet"); StrQ.push("sam"); StrQ.push("jack"); StrQ.push("elena"); StrQ.push("mina"); printandpop(StrQ); return 0; }

lab9(24.05.2019)