CirQueue.doc

template /class CirQueueprivate:T *base;/ 存?储空?间?基址int front;/ 队头指?针?int rear;/ 队尾2指?针?int queuesize;/ 队容Y量?public:CirQueue(int m);/构1造空?队列DCirQueue();/ 析?构1函数y，?释放?链队各结点?的?存?储空?间?void EnQueue(T x);/ 元a素?x入?队T DeQueue();/ 队顶元a素?出?队T GetHead();/ 取?队头元a素?T GetLast();/取?队尾2元a素?int QueueEmpty(); / 判D队空?int QueueFull();/判D队满void ClearQueue();/清?空?队void QueueTranverse();/遍历队，?输?出?队列D元a素?;template CirQueue:CirQueue(int m)/构1造函数y/创建一?空?队base=new Tm;if(base=NULL) cout队创建失败，?退?出?!endl;exit(1);front=rear=0;queuesize=m;template CirQueue:CirQueue()/析?构1函数y/释放?队列D所占?存?储空?间?delete base;rear=0;front=0;queuesize=0;template void CirQueue:EnQueue(T x)/元a素?入?队if(rear+1)%queuesize=front) throw 上?溢?，?无T法入?队;baserear=x;rear=(rear+1)%queuesize;cout入?队成功|，?新?队尾2为a：orearendl;template T CirQueue:DeQueue()T x;if(front=rear) throw 下?溢?，?不?能出?队;x=basefront;front=(front+1)%queuesize;cout出?队成功|，?新?队头为a：ofrontendl;return x;template T CirQueue:GetHead()T x;if(front=rear) throw 队空?，?队顶无T元a素?;x=basefront; cout取?队头元a素?成功|，?队头为a：ofrontendl;return x;template T CirQueue:GetLast()T x;if(front=rear) throw 队空?，?队顶无T元a素?;x=baserear-1;cout取?队尾2元a素?成功|，?队尾2为a：orearendl;return x;template int CirQueue:QueueEmpty()if(front=rear) return 1;elsereturn 0;template int CirQueue:QueueFull()if(rear+1)%queuesize=front)return 1;elsereturn 0;template void CirQueue:ClearQueue()front=rear=0;template void CirQueue:QueueTranver