queue.h

题目：设计一个请求页式存储管理方案

# define MAXQ 4

//队列，用于表示Cache块

class Alist{
private:
	int *mmb;  //memory块
	int fence;
	int size,sum;
public:
	Alist(int n=MAXQ){
		size=n;
		mmb=new int[size];
		fence=0;
		sum=0;
	}
	~Alist(){
		delete [] mmb;
	}
	bool insert(int n);
	bool rem_ins(int &n,int p);
	int length(){
		return sum;
	}
	void print();
	bool isexist(int n);
};