单链表dll

放假的时候，习了下如何编写dll，于是编写了一个单链表的通用dll。

 

#define DLLFUNC _declspec(dllexport) #include <stdio.h> #include <stdlib.h> #include <Fatal.h> #include "linklist.h" /* Assume the linklist use of a header node */ /*STATE:Make the list empty*/ /*Then return the header of the list*/ List MakeEmpty(List L) { if(L!=NULL) DeleteList(L); L=malloc(sizeof(struct Node)); if(L==NULL) FatalError("Out of Space!!!"); L->next=NULL; return L; } /*END*/ /*STATE:Whether the list is a empty one*/ /*return 1 if the list is empty*/ int IsEmpty(List L) { return (L->next==NULL); } /*END*/ /*STATE:Whether the current node is the last one*/ /*return 1 if the node is the last one*/ int IsLast(Position ptr, List L) { return (ptr->next==NULL); } /*END*/ /*STATE:Find the position of element "x" in the list*/ /* Return Position of X in L; NULL if not found*/ Position Find(ElemType x, List L) { Position p; p=L->next; while(p!=NULL&&p->data!=x) p=p->next; return p; } /*END*/ /*STATE:Delete the element x in the list*/ /* Assume that the position is legal */ void Delete( ElemType x, List L) { Position p,TmpCell; p=FindPrevious(x,L); //Find the Previous one of element "x" TmpCell=p->next; p->next=TmpCell->next; free(TmpCell); } /*END*/ /*STATE:Find the Previous one of element "x"*/ /* If X is not found, then Next field of returned value is NULL */ Position FindPrevious( ElemType x, List L) { Position pre; pre=L; while(pre->next!=NULL&&pre->next->data!=x) pre=pre->next; return pre; } /*END*/ /*STATE:Insert (after legal position P) */ /*The L is legal also*/ void Insert( ElemType x, List L, Position p) { Position TmpCell; TmpCell=malloc(sizeof(struct Node)); if(TmpCell==NULL) FatalError("Out of Space!!!"); TmpCell->data=x; TmpCell->next=p->next; p->next=TmpCell; } /*END*/ /*STATE:DeleteList algorithm*/ /*make the next field of header to be NULL*/ void DeleteList( List L) { Position p,TmpCell; p=L->next; L->next=NULL; while(p!=NULL){ TmpCell=p->next; free(p); p=TmpCell; }//while } /*END*/ /*STATE:return the header of the list*/ Position Header( List L) { return L; } /*END*/ /*STATE:return the first node of the list*/ Position First( List L) { return L->next; } /*END*/ /*STATE:return the next node of position p*/ Position Advance( Position P ) { return P->next; } /*END*/ /*STATE:return the data of the node*/ ElemType Retrieve(Position P) { return P->data; } /*END*/

 

不过后来发现，C并不能很好的编写dll，我要生成dll，必须在编译时，给定ElemType的类型，如果不定义，就无法编译，也就是说，在每次使用该dll的时候，都得根据新的elemtype来编译该dll……

确实不算是好办法。更好的办法还在研究中……