seqqueue2.h

内存页式调度算法

#include <iostream.h>
#include <stdlib.h>

const int MaxQueueSize2=3;


class SeqQueue2
{
private:
	Datatype data2[MaxQueueSize];
	int front2;
	int rear2;
	int count2;
public:
	SeqQueue2(void){front2=rear2=0;count2=0;};
	~SeqQueue2(){};
	void QInsert2(const Datatype & item2);    //入队列
    Datatype QDelete2(void);   //出队列
	Datatype QFront2(void) const;    //读队头
    int QueueEmpty2(void)const
	{return front2==rear2;};
	void ClearQueue2(void)
	{front2=rear2=0;count2=0;}
	int GetSize2(void)const
	{return count2;};
    void Getitem2();
    char temp4;
    
};



void SeqQueue2::QInsert2(const Datatype& item2)
{   
 if(count2==MaxQueueSize2)
 {
	 cout<<"队列已满"<<endl;
	QDelete2();
	 data2[rear2]=item2;
	 rear2=(rear2+1)%MaxQueueSize2;
	 count2++;
 }
 else
 {
     data2[rear2]=item2;
	 rear2=(rear2+1)%MaxQueueSize2;
	 count2++;
 }
}



Datatype SeqQueue2::QDelete2()
{
	Datatype temp2;
	if(count2==0)
	{
		cerr<<"队列已空"<<endl;
		exit(1);

	}
	temp2=data2[front2];
	front2=(front2+1)%MaxQueueSize2;
	count2--;
	return temp2;

}


Datatype SeqQueue2::QFront2(void)const
{
	if(count2==0)
	{
		cerr<<"队列已空"<<endl;
		exit(1);

	}
	return data2[front2];
}