双向链表的实现与测试.docVIP

//双向链表的定义和实现 #pragma once #includeutility.h //类え?的?声Θ?明÷ template class Node_entry struct Node { Node_entry entry; Node Node_entry *next; Node Node_entry *back; Node(); Node(Node_entry x ,NodeNode_entry *link_back =NULL , NodeNode_entry *link_next =NULL); }; template class Node_entry NodeNode_entry::Node() { next = NULL; back = NULL; } template class Node_entry NodeNode_entry::Node(Node_entry x ,NodeNode_entry *link_back , NodeNode_entry *link_next ) { entry = x; next = link_next; back = link_back; } template class List_entry class List { public: List(); void clear(); bool empty() const; bool full() const; int size() const; Error_code insert(int position, const List_entry x); Error_code remove(int position, List_entry x); Error_code retrieve(int position,List_entry x) const; Error_code replace (int position,const List_entry x); protected: int count; mutable int current_position; mutable NodeList_entry *current ; void set_position(int pisition) const; }; //类え?的?定¨义? template class List_entry ListList_entry::List() { count = 0; current_position = 0; current = NULL; //此?处鋦是?必?须?要癮做?的?，?对?所ù有瓺可é能ü用?到?的?变?量?进?行D一?个?初?始?化ˉ赋3值μ } template class List_entry void ListList_entry::clear () { List_entry temp; for(int i = 0; icount ; i++) { remove(i, temp); } return ; } template class List_entry bool ListList_entry::empty() const { return count == 0; } template class List_entry bool ListList_entry::full () const { return false; } template class List_entry int ListList_entry ::size() const { return count; } template class List_entry void ListList_entry ::set_position(int position) const { if(current_position=position) for(; current_position!=position;current_position++) current = current-next ; else for(;current_position !=position; current_position--) current=current-back ; return ; } template class List_entry Error_code ListList_entry::insert(int position, cons