“a.h”
#include
#include
#define TRUE 1;
#define FALSE 0;
#define ERROR 0;
#define OK 1;
typedef int Status;
typedef int ElemType;
typedef struct DuLNode{
}DuLNode , *DuLinkList;
"b.h"
#include"a.h"
Status InitList(DuLinkList *L);
Status DestroyList(DuLinkList *L);
Status ClearList(DuLinkList L);
Status ListEmpty(DuLinkList L);
Status ListLength(DuLinkList L);
Status GetElem(DuLinkList L,int i,ElemType *e);
int
Status PriorElem(DuLinkList L,ElemType cur_e,ElemType *pre_e);
Status NextElem(DuLinkList L,ElemType cur_e,ElemType *next_e);
DuLinkList GetElemP(DuLinkList L,int i);
Status ListInsert(DuLinkList L,int i,ElemType e);
Status ListTraverse(DuLinkList L,void(*fun)(ElemType e));
Status ListDelete(DuLinkList L,int i,ElemType *e);
Status ListTraverseBack(DuLinkList L,void(*fun)(ElemType e));
"b.c"
#include "b.h"
Status InitList(DuLinkList *L)
{
}
Status DestroyList(DuLinkList *L)
{
}
Status ClearList(DuLinkList L)
{
}
Status ListEmpty(DuLinkList L)
{
}
Status ListLength(DuLinkList L)
{
}
Status GetElem(DuLinkList L,int i,ElemType *e)
{
}
int
{
}
Status PriorElem(DuLinkList L,ElemType cur_e,ElemType *pre_e)
{
}
Status NextElem(DuLinkList L,ElemType cur_e,ElemType *next_e)
{
}
DuLinkList GetElemP(DuLinkList L,int i)
{
}
Status ListInsert(DuLinkList L,int i,ElemType e)
{
}
Status ListTraverse(DuLinkList L,void(*fun)(ElemType e))
{
}
Status ListDelete(DuLinkList L,int i,ElemType *e)
{
}
Status ListTraverseBack(DuLinkList L,void(*fun)(ElemType e))
{
}
"main.c"
#include "b.h"
Status compare(ElemType e,ElemType f)
{
}
void fun(ElemType e)
{
}
int main()
{
}