数据结构复习4 双向链表

/* DbList.cpp*/
template<class T>
struct DbNode{
	T data;
	DbNode<T> *lLink,*rLink;
	DbNode(DbNode<T> *l=NULL,DbNode<T> *r=NULL):lLink(l),rLink(r){}
	DbNode(T value,DbNode<T> *l=NULL,DbNode<T> *r=NULL):data(value),lLink(l),rLink(r) {}
};

template<class T>
class DbList:public LinkList<T>{
	protected:
	DbNode<T> *first;
	public:
	DbList(T value);
	~DbList();
	int Length()const;
	bool IsEmpty(){return first->rLink==first;}
	DbNode<T> *GetHead()const{return first;}
	void SetHead(DbList<T> *p){
		first=p;
	}
	DbNode<T>* Search(const T&x);
	DbNode<T>* Locate(int i,int LorR);
	bool Insert(int i,const T &x,int LorR);
	bool Remove(int i,T &x，int LorR);
};

template<class T>
DbList<T>::DbList(T value){
	first=new DbNode<T>(value);
	assert(first!=NULL);
	first->rLink=first->lLink=first;
}

/* 
template<class T>

 */

template<class T>
DbList<T>::~DbList(){
	
}
 
template<class T>
int DbList<T>::Length()const{
	DbNode<T> *p=first;
	int ctr=1;
	//count first in number
	while(p!=first){
		p=p->rlink;
		ctr++;
	}
	return ctr;
}

/* protected:
	DbNode<T> *first;
	public:
	DbList(T value);
	~DbList();
	int Length()const;
	bool IsEmpty(){return first->rLink==first;}
	DbNode<T> *GetHead()const{return first;}
	void SetHead(DbList<T> *p){
		first=p;
	}
	DbNode<T>* Search(const T&x);
	DbNode<T>* Locate(int i,int LorR);
	bool Insert(int i,const T &x,int LorR);
	bool Remove(int i,T &x，int LorR); */
template<class T>
DbNode<T>* DbList<T>::Search(const T&x){
	DbNode<T> *p=first->rLink;
	while(p!=first){
		if(p->data==x)
			return p;
		p=p->rlink;
	}
	return NULL;
}
 
template<class T>
DbNode<T>* DbList<T>::Locate(int i,int LorR){
	if(first->rLink==first||i==0)
		return first;
	DbNode<T> *p;
	if(LorR==0)
		p=first->lLink;
	else
		p=first->rLink;
	for(int j=1;j<i;j++){
		if(p==first)
			break;
		else if(LorR==0)
			p=p->lLink;
		else
			p=p->rLink;
	}
	if(p!=first)
		return p;
	else
		return NULL;
}
 
template<class T>
bool DbList<T>::Insert(int i,const T &x,int LorR){
	DbNode<T> *p=Locate(i,LorR);
	if(p==NULL)
		return false;
	
	DbNode<T> *newnode=new DbNode<T>(x);
	//allocate error
	//left insert
	assert(newnode!=NULL);
	if(LorR==1){
		newnode->lLink=p;
		newnode->rLink=p->rLink;
		p->rLink=newnode;
		newnode->rLink->lLink=newnode;
	}else{
		newnode->lLink=p->lLink;
		newnode->rLink=p;
		p->lLink->rLink=newnode;
		p->lLink=newnode;
	}
	return true;
}

template<class T>
bool DbList<T>::Remove(int i,T &x，int LorR){
	DbNode<T> *p=Locate(i,LorR);
	//find no result==...
	if(p==NULL){
		return false;
	}
	//delete
	p->lLink->rLink=p->rLink;
	p->rLink->lLink=p->lLink;
	x=p->data;delete p;
	return true;
}