linearlist2.h

来自「成绩排序(c++)用c++编的程序」· C头文件 代码 · 共 26 行

struct  student{
   char name[10];
   short grade;
};
typedef student ElemType;
struct LinearList
{
   ElemType*list;
   int size;
   int MaxSize;
};
void InitList(LinearList& L,int ms);
void ClearList(LinearList& L);
int ListSize(LinearList& L);
bool ListEmpty(LinearList& L);
bool ListFull(LinearList& L);
void TraverList(LinearList& L);
bool FindList(LinearList& L,ElemType& item);
bool UpdateList(LinearList& L,const ElemType& item);
bool InsertList(LinearList& L,const ElemType& item,int mark);
bool DeleteList(LinearList& L,ElemType& item ,int mark);
void OrderOutputList(LinearList& L,int mark);
bool operator == (const ElemType& r1,const ElemType& r2);
bool operator < (const ElemType& r1,const ElemType& r2);
ostream& operator << (ostream& ostr,const ElemType& r);
istream& operator >> (istream& istr,ElemType& r);