"a.h"
#include
#include
#include
#define TRUE 1
#define
#define OK 1
#define ERROR 0
typedef int Status;
typedef int ElemType;
typedef struct LNode{
}LNode ,*Link,*Position;
typedef struct LinkList{
} LinkList;
"b.h"
#include"a.h"
Status MakeNode(Link*p,ElemType e);
void Free(Link *p);
Status InitList(LinkList *L);
Status ClearList(LinkList *L);
Status DestroyList(LinkList *L);
Status InFirst(LinkList *L,Link h,Link s);
Status DelFirst(LinkList *L,Link h,Link *s);
Status Append(LinkList *L,Link s);
Position PriorPosition(LinkList *L,Link s);
Status RemoveLast(LinkList *L,Link *s);
Status InsBefore(LinkList *L,Link *p,Link s);
Status InsAfter(LinkList *L,Link *p,Link s);
Status SetData(Link p,ElemType e);
Status GetData(Link p);
Status ListEmpty(LinkList L);
int ListLength(LinkList L);
Position GetHead(LinkList L);
Position GetLast (LinkList L);
Position NextPosition(Link p);
Status LocatePosition(LinkList L,int i,Link *s);
Position LocateElem(LinkList L,ElemType e,Status(*compare1)(ElemType,ElemType));
Status ListTraverse(LinkList L,void(*fun)(EelmType));
Status OrderInsert(LinkList ,ElemType e,int (*compare2)(ElemType,ElemType));
Status LocateElemTypePosition(LinkList L,ElemType e,Link *p,int (*compare1)(ElemType,ElemType));
"b.c"
#include"b.h"
Status MakeNode(Link *p,ElemType e)
{
}
void Free(Link *p)
{
}
Status InitList(LinkList *L)
{
}
Status ClearList(LinkList *L)
{
}
Status DestroyList(LinkList *L)
{
}
Status InFirst(LinkList *L,Link h,Link s)
{
}
Status DelFirst(LinkList *L,Link h,Link *s)
{
}
Status Append(LinkList *L,Link s)
{
}
Position PriorPosition(LinkList *L,Link s)
{
}
int ListLength(LinkList L)
{
}
Status RemoveLast(LinkList *L,Link *s)
{
}
Status InsBefore(LinkList *L,Link *p,Link s)
{
}
Status InsAfter(LinkList *L,Link *p,Link s)
{
}
Status SetData(Link p,ElemType e)
{
}
ElemType GetData(Link p)
{
}
Status ListEmpty(LinkList L)
{
}
Position GetHead(LinkList L)
{
}
Position GetLast (LinkList L)
{
}
Position NextPosition(Link p)
{
}
Status LocatePosition(LinkList L,int i,Link *s)
{
}
Position LocateElem(LinkList L,ElemType e,Status(*compare1)(ElemType,ElemType))
{
}
Status ListTraverse(LinkList L,void(*fun)(EelmType))
{
}
Status OrderInsert(LinkList L,ElemType e,int (*compare2)(ElemType,ElemType))
{
}
Status LocateElemTypePosition(LinkList L,ElemType e,Link *p,int (*compare2)(ElemType,ElemType))
{
}
"main.c"
#include"b.h"
Status compare1(ElemType e,ElemType f)
{
}
int compare2(ElemType e,ElemType f)
{
}
void fun(ElemType e)
{
}
int main()
{
}