seqlist.h

内存页式调度算法

// Seqlist.cpp : Defines the entry point for the console application.
//

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

const int MaxListSize=3;

class SeqList
{ 
           
public:
         SeqList(void);
         ~SeqList(void);
         int ListSize(void) const;
         int ListEmpty(void) const;
         int Find(Datatype& item) const;
         Datatype GetData(int pos) const;
         void Insert(const Datatype& item, int pos);
         void Delete(const int pos);
         void ClearList(void);
		 int size;
		 Datatype data[MaxListSize];
		 char temp2;
 };

SeqList::SeqList(void){size=0;}

SeqList::~SeqList(void){ }   

int SeqList::ListSize(void) const
   { return size; }

int SeqList::ListEmpty(void) const
 { if (size==0) return 1;
   else return 0; 
  }

int SeqList::Find(Datatype& item) const
{ if (size==0) return -1;
  int i=0;
  while (i<size&&item!=data[i])i++;
  if (i<size) return i;
  else return -1;
}

Datatype SeqList::GetData(int pos) const
{ if (pos<0||pos>size-1)
   { cerr<<"参数pos越界出错！"<<endl;
     //exit(1);
    }
  return data[pos];
 }

void SeqList::Insert(const Datatype& item,int pos)
{ int i;
int j=0;
  if (size==MaxListSize)
    { //cout<<"顺序表已满!"<<endl;
	  int a=0;
      Delete(a);
	  for(i=1;i<3;i++) data[i-1]=data[i];
	  data[pos]=item;
	  size++;
     }
  /*if (pos<0||pos>size)      
    { cerr<<"参数pos越界出错！"<<endl;
      exit(1);
     }*/
  //for (i=size-1;i>pos;i--) data[i]=data[i-1];
  else{ data[pos]=item;
  size++;}
 }

void SeqList::Delete(const int pos)
{ if (size==0)
   { cerr<<"顺序表已空，无元素可删！"<<endl;
     //exit(1);
    }
  if (pos<0||pos>size-1)
   { cerr<<"参数pos越界出错！"<<endl;
      //exit(1);
    }
  Datatype temp=data[pos];
  
  size--;
  temp2=temp;
  //return temp2;
 }

void SeqList::ClearList(void)
 { size=0; }