/* Linear Table On Sequence Structure */
#include <stdio.h>
#include<stdlib.h>
#include <string.h>
#include <windows.h>
/*------------------------------------------------------*/
typedef int status;
#define LISTINCREMENT 10
#define LIST_INIT_SIZE 100
#define TRUE 1
#define FALSE 0
#define OVERFLOW -2
#define ERROR 0
#define OK 1
typedef struct{
int item1;
}Elemtype;
typedef struct{
Elemtype * elem;
int length;
int listsize;
}SqList;
/*------------------------------------------------------*/
status Getlist_One(SqList *L);
status SaveData(SqList * L);
status InitList_One(SqList *L);
status IntiaList(SqList * L);
status DestroyList(SqList * L);
status ClearList(SqList* L);
status ListEmpty(SqList L);
int ListLength(SqList L);
status GetElem(SqList L,int i,Elemtype * e);
status LocatElem(SqList L,Elemtype e);
/*
status PriorElem(SqList L,Elemtype cur,Elemtype * pre_e);
status NextElem(SqList L,Elemtype cur,Elemtype * next_e);
*/
status ListInsert(SqList * L,status i, Elemtype e);
status ListDelete(SqList * L);
status ListTrabverse(SqList L,void (* visit)(Elemtype e));
/*------------------------------------------------------*/