summaryrefslogtreecommitdiff
path: root/c/dataStructure/线性表/顺序表/sequence.h
blob: 6a48d67d6f69634014a459fbc40e0b11823a2afe (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#ifndef SEQUENCE_H_
#define SEQUENCE_H_

#define MAXSIZE 100

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>

typedef int ElemType;

typedef struct data {
    ElemType * elem;
    int length;
} Elem;

void      InitList     (Elem * L);
void      DestroyList  (Elem * L);
void      ClearList    (Elem * L);
void      AddElem      (Elem * L, ElemType e);           // Add an element, length +1
bool      ListEmpty    (Elem * L);
ElemType  ListLength   (Elem * L);
ElemType  GetElem      (Elem * L, int i);                // Get ith element
ElemType  LocateElem   (Elem * L, ElemType e);           // return element e's position, if not found, return 0
ElemType  PriorElem    (Elem * L, ElemType e);           // return precedent element of e
ElemType  NextElem     (Elem * L, ElemType e);           // return element after e
bool      ListInsert   (Elem * L, ElemType e, int i);    // insert Elem at i
bool      ListDelete   (Elem * L, int i);                // delete ith element
void      TraverseList (Elem * L);                       // traverse all list
char      OperateMenu  (void);                           // show Menu to user

#endif