C++程序代码-C++顺序表类模板seqlistclass.doc

#include#include#includeseqlistclass.hSeqList:SeqList() data=new TypeMAXSIZE;size=0;SeqList:SeqList(const SeqList& l)data=new TypeMAXSIZE;size=l.size;for(int i=0;isize;i+)datai=l.datai;SeqList:SeqList()deletedata;void SeqList:Error(const char *c)const coutc; exit(1);SeqList& SeqList:operator=(const SeqList& l)size=l.size;for(int i=0;isize;i+)datai=l.datai;return(*this);Type& SeqList:operator(int id)/下标运算符重载coutcall;if(idsize-1)Error(id illegal!);return(dataid);const Type& SeqList:operator(int id)const/常量型下标运算符重载coutcalling;if(idsize-1)Error(id illegal!);return(dataid);void SeqList:Insert(int id,const Type& item)int i;if(size=MAXSIZE)Error(Insert:SeqList is full!);if(idsize) Error(Insert:id is out of range!);for(i=size-1;i=id;i-)datai+1=datai;dataid=item;size+;void SeqList:InsertRear(const Type& item)if(size=MAXSIZE)Error(InsertRear:SeqList is full!);datasize=item;size+;void SeqList:Erase(int id)int i;if(size=0)/步骤Error(Erase: an empty list!);if(idsize-1)/步骤Error(Erase: id is out of range!);for(i=id+1;isize;i+)/步骤datai-1=datai;size-;void SeqList:Clear(void)/将元素个数置0，使其成为空表size=0;const Type& SeqList:GetData(int id)constif(size=0)/步骤Error(GetData:an empty list!);if(idsize-1)/步骤Error(GetData:id is out of range!);return(dataid);/步骤int SeqList:Find(const Type& item)const/找到item，返回其下标，否则返回-1int i;for(i=0;isize;i+)if(datai=item)break;return(i=size?-1:i);int SeqList:Size(void)constreturn(size);bool SeqList:Empty(void)const/判空。判断顺序表是否空return(size=0);bool SeqList:Full(void)const/判满。判断顺序表是否满return(size=MAXSIZE);void SeqList:Swap(int id1,int id2)if(id10|id2size-1|id2size-1)Error(Update:Index is out of range!);Type temp=dataid1;dataid1=dataid2;dataid2=temp;void SeqList:Replace(int id,const Type& i