seqlist.h

分水问题

#include "stdio.h"     //输入输出函数
#include "stdlib.h"     // 标准库函数
#include "funcstatus.h"

#define  LIST_INIT_SIZE     80  // 线性表存储空间的初始分配量
#define  LISTINCREMENT    10  // 线性表存储空间的分配增量
typedef struct{
	int a;
	int b;
}State;
typedef State ElemType;
typedef struct{
  ElemType  *elem;         //动态数组基址
  int       length;        //线性表表长
  int       listsize;      //当前动态数组大小
}SqList;

Status InitList_Sq(SqList &L);
Status DestroyList_Sq(SqList &L);
Status ClearList_Sq(SqList &L);
Status ListEmpty_Sq(SqList L);
int ListLength_Sq(SqList L);
Status GetElem_Sq(SqList L, int i, ElemType &e);
int LocateElem_Sq(SqList L,ElemType e, int(*compare)(ElemType e1,ElemType e2));
//ElemType *LocateElem_Sq(SqList L,ElemType e, Status(*compare)(ElemType e1,ElemType e2));
Status ListInsert_Sq(SqList &L, int i, ElemType e);
Status ListDelete_Sq(SqList &L, int i, ElemType &e);
Status ListAppend_Sq(SqList &L, ElemType e);
Status ListTraverse_Sq(SqList L,void(*Visit)(ElemType e));