可复用的顺序表

#ifndef _SEQLIST_H
#define _SEQLIST_H


typedef void SeqList;
typedef void SeqListNode;//数据封装 


SeqList* SeqList_Create(int capacity);


void SeqList_Destroy(SeqList* list);


void SeqList_Clear(SeqList* list);


int SeqList_Length(SeqList* list);


int SeqList_Capacity(SeqList* list);


int SeqList_Insert(SeqList* list,SeqListNode* node,int pos);


SeqListNode* SeqList_Delete(SeqList* list,int pos);


SeqListNode* SeqList_Get(SeqList* list,int pos);

#endif

//本例程创建可复用顺序表
#include<stdio.h>
#include<malloc.h>//动态分配堆空间
#include"seqlist.h"


typedef unsigned int TSeqListNode;
//计算机中地址一般为四个字节，也就是32位，正好可以由unsigned int保存
typedef struct _tag_SeqList
{
int capacity;
int length;
TSeqListNode* node;//使用指针代替数组
}TseqList;


SeqList* SeqList_Create(int capacity)//这是什么型
{
TseqList* ret = NULL;
    if(capacity >= 0)
    {
    ret = (TseqList*)malloc(sizeof(TseqList)+sizeof(TSeqListNode)*capacity);//这儿不太懂
    }
    if(ret != NULL)//如果堆分配空间成功
    {
ret->capacity = capacity;
ret->length = 0;
ret->node = (TSeqListNode*)(ret+1);//这儿不太懂
    }
    return ret;
}


void SeqList_Destroy(SeqList* list)
{
free(list);
} 


void SeqList_Clear(SeqList* list)
{
TseqList* sList = (TseqList*)list;
if( sList != NULL)
{
sList->length = 0;
}
}




int SeqList_Length(SeqList* list)
{
TseqList* sList = (TseqList*)list;
int ret = -1;
if(sList != NULL)
{
ret = sList->length;
}
return ret;
}


int SeqList_Capacity(SeqList* list)
{
TseqList* sList = (TseqList*)list;
int ret = -1;
if(sList != NULL)
{
ret = sList->capacity;
}
return  ret;
} 


int SeqList_Insert(SeqList* list,SeqListNode* node,int pos)
{
TseqList* sList = (TseqList*)list;
int i = 0;
int ret = (sList!= NULL);

ret = ret &&(sList->length+1 <= sList->capacity);
ret = ret &&(0 <= pos);

if(ret)
{
if(sList->length <= pos)
{
pos = sList->length;
}
for(i=sList->length;i > pos;i--)
{
sList->node[i] = sList->node[i-1];
}
sList->node[i] = (TSeqListNode)node;
sList->length++;
}
return ret;
}


SeqListNode* SeqList_Get(SeqList* list,int pos)
{
TseqList* sList = (TseqList*)list;
SeqListNode* ret = NULL;
if((sList != NULL)&&(0 <= pos)&&(pos <= sList->length))
{
  ret = (SeqListNode*)sList->node[pos]; 
} 
return ret;
}


SeqListNode* SeqList_Delete(SeqList* list,int pos)
{
TseqList* sList = (TseqList*)list;
SeqListNode* ret = SeqList_Get(list,pos);
int i = 0;
if(ret != NULL)
{
for(i=pos+1;i<sList->length;i++)
{
sList->node[i-1] = sList->node[i];
}
sList->length--;
}
return ret;
}

#include <stdio.h>
#include <stdlib.h>
#include "seqlist.h"


/* run this program using the console pauser or add your own getch, system("pause") or input loop */


int main(int argc, char *argv[])
{
SeqList* list = SeqList_Create(5);
int i = 0;
int a = 0;
int b = 1;
int c = 2;
int d = 3;
int e = 4;
int f = 5;
SeqList_Insert(list,&a,0);
SeqList_Insert(list,&b,0);
SeqList_Insert(list,&c,0);
    SeqList_Insert(list,&d,0);
SeqList_Insert(list,&e,0);
SeqList_Insert(list,&f,0);
for(i = 0;i <= SeqList_Length(list);i++)
{
int* p = (int*)SeqList_Get(list,i);
printf("%d\n",*p);
    }
    printf("\n");
    while(SeqList_Length(list)>0)
    {
int* p = (int*)SeqList_Delete(list,0);
printf("%d\n",*p);
}
SeqList_Destroy(list);

return 0;
}