[ RMAN @ 13.12.2008. 13:57 ] @
Moze li pomoc kako da ovaj program (klasu) prepravim da radi i za red sa dva kraja (znaci da moze i da se upisuje i da se brise i na kraju i na pocetku) Code: #ifndef QUEUE_LINK_HPP_INCLUDED #define QUEUE_LINK_HPP_INCLUDED #include "list.hpp" template <class T> class LinkedQueue; template <class T> void printOut(const LinkedQueue<T> &); template <class T> class LinkedQueue:protected List<T> { public: LinkedQueue(){} bool readFromQueue(T&) const; void removeFromQueue() {List<T>::remove(1);} void addToQueue(const T &El) {List<T>::add(List<T>::size()+1,El);} bool empty() const {return List<T>::empty();} int size() const {return List<T>::size();} friend void printOut<>(const LinkedQueue<T> &); virtual ~LinkedQueue(){} }; template <class T> void printOut(const LinkedQueue<T> &l) { cout<<endl; cout<<"\tVelicina reda: "<<l.size()<<endl; cout<<"\tSadrzaj reda je: "; T retVal; for(int i=1; i<=l.size();i++) { if(i>1) cout<<", "; l.read(i,retVal); cout<<retVal; } cout<<endl<<endl; } template <class T> bool LinkedQueue<T>::readFromQueue(T& retVal) const { return List<T>::read(1,retVal); } #endif // QUEUE_LINK_HPP_INCLUDED |