多个头文件 定义 困惑

 

我想用 一个 链表的数据结构 来实现 一个 多项式 ，可是在 加入头文件时 遇到了问题，第三个头文件 遇上了 一点问题，求大家解答

code.h

 

 

#include <stdio.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;//typedef int ElemType;typedef struct {float coef;int expn;}term ,ElemType;CLinkList.h#include<stdio.h>// circle link list typedef struct DuLNode {ElemType data;struct DuLNode *prior;struct DuLNode *next;}DuLNode,*DuLinkList;//useful structuretypedef struct LNode {ElemType data;struct LNode *next;}*Link, *Position,LNode ;typedef struct {Link head, tail;// easy to append and insertint len;// overcome link list cannot know the length of the list}LinkList;int Compare_CL(ElemType,ElemType);/*Status MakeNode (Link *p , ElemType e );// delete the listStatus DestroyList (LinkList *L);// make link list emptyStatus ClearList(LinkList *L);// h point to head , insert node s refer toStatus InsFirst(Link h,Link s);//Status DelFirst(Link h,Link s);//Status Append(LinkList *L , Link s );//Status Remove (LinkList*L,Link *q);// p point to a node , q insert that nodeStatus InsBefore(LinkList *L,Link *p,Link s);//Status InsAfter(LinkList *L,Link *p,Link s);//known:p point to node ,return data of the nodeStatus SetCurElem(Link *p, ElemType e );ElemType GetCurElem(Link p);//Status ListEmpty(LinkList L);//int ListLength(LinkList L);//Position GetHead(LinkList L);// get the last node Position GetLast (LinkList L);// Position NextPos (LinkList L, Link p);//return i th element in list ,and return p as pointer point to i th element//Status LocatePos(LinkList p, int i,Link *p);//Position LocateElem( LinkList L, ElemType e ,Status(*compare)(ElemType , ElemTye));//every node use visit()functionStatus ListTraverse(LinkList L, Status(*visit));*/ 

CLinkList.h

CLinkList.h#include<stdio.h>// circle link list typedef struct DuLNode {ElemType data;struct DuLNode *prior;struct DuLNode *next;}DuLNode,*DuLinkList;//useful structuretypedef struct LNode {ElemType data;struct LNode *next;}*Link, *Position,LNode ;typedef struct {Link head, tail;// easy to append and insertint len;// overcome link list cannot know the length of the list}LinkList;int Compare_CL(ElemType,ElemType);/*Status MakeNode (Link *p , ElemType e );// delete the listStatus DestroyList (LinkList *L);// make link list emptyStatus ClearList(LinkList *L);// h point to head , insert node s refer toStatus InsFirst(Link h,Link s);//Status DelFirst(Link h,Link s);//Status Append(LinkList *L , Link s );//Status Remove (LinkList*L,Link *q);// p point to a node , q insert that nodeStatus InsBefore(LinkList *L,Link *p,Link s);//Status InsAfter(LinkList *L,Link *p,Link s);//known:p point to node ,return data of the nodeStatus SetCurElem(Link *p, ElemType e );ElemType GetCurElem(Link p);//Status ListEmpty(LinkList L);//int ListLength(LinkList L);//Position GetHead(LinkList L);// get the last node Position GetLast (LinkList L);// Position NextPos (LinkList L, Link p);//return i th element in list ,and return p as pointer point to i th element//Status LocatePos(LinkList p, int i,Link *p);//Position LocateElem( LinkList L, ElemType e ,Status(*compare)(ElemType , ElemTye));//every node use visit()functionStatus ListTraverse(LinkList L, Status(*visit));*/ 

Polyn.h

// typedef LinkList polynomial ; // doesn't work#define polynomial LinkList  

为什么不能在 Polyn.h头文件里 用 typedef 定义

 gcc codelite ide