顺序表的实现和测试.docVIP

//顺序表的定义 #includeutility.h template class List_entry class List { List(); int size() const; bool full() const; bool empty() const; void clear(); void traverse( void(*visit) (List_entry )); Error_code retrieve( int position, List_entry x) const; Error_code replace ( int position, const List_entry x); Error_code remove ( int position, List_entry x); Error_code insert ( int position, const List_entry x); protected: int count; List_entry entry[max_list]; }; templateclass List_entry ListList_entry::List() { count=0; } templateclass List_entry int ListList_entry::size() const { return count; } templateclass List_entry bool ListList_entry::full() const { return count==max_list; } templateclass List_entry bool ListList_entry::empty () const { return count==0; } templateclass List_entry void ListList_entry::clear () { count = 0; } templateclass List_entry void ListList_entry::traverse ( void(*visit) (List_entry )) { for(int i=0;icount;i++) (*visit)(entry[i]); } templateclass List_entry Error_code ListList_entry::retrieve (int position, List_entry x) const { if(count==0) return underflow; if(position0 || position=count) return range_error; x=entry[position]; return success; } templateclass List_entry Error_code ListList_entry::replace(int position, const List_entry x) { if(position0 || position =count) return range_error; entry[position] = x; return success; } templateclass List_entry Error_code ListList_entry::remove (int position, List_entry x) { if(count==0) return underflow; if(position0 || position=count) return range_error; x=entry[position]; for(int i=position;icount-1;i++) entry[i]=entry[i+1]; count--; return success; } templateclass List_entry Error_code ListList_entry::insert(int position, const List_entry x) { if(count==max_list) return overflow; if(position0 || positioncount) return range_error; for(int i=count-1;i=position;i--) entry[i+1]=entry[i]; entry[position]=x; count++; return success; } //顺序表的测试 #