线性表顺序存储设计与实现_框架搭建

传智扫地僧课程学习笔记。

这里是要写一个测试框架，

用于测试所写的链表的操作，是否正确，

本来是要测试dll动态库的，可是我这里没有，

所以只好自己写个实现，其实只有函数名，内部的函数实现，是空的，

设计到3个文件，seqlist.h，seqlist.c，以及我们自己写的主文件

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

typedef struct teacher
{
	int age;
	char name[64];
}teacher;


int main()
{
	int ret = 0, i=0;
	SeqList* list = NULL;
	teacher t1,t2,t3,t4,t5;
	list = SeqList_Create(10);
	if( NULL == list)
	{
		printf("func seqlist create ret:\n");
		return ;
	}


	ret =SeqList_Insert( list, (SeqListNode*)&t1, 0);
	ret =SeqList_Insert( list, (SeqListNode*)&t2, 0);
	ret =SeqList_Insert( list, (SeqListNode*)&t3, 0);
	ret =SeqList_Insert( list, (SeqListNode*)&t4, 0);
	ret =SeqList_Insert( list, (SeqListNode*)&t5, 0);


	for( i=0; i<SeqList_Length(list); i++)
	{
		teacher* tmp = (teacher *)SeqList_Get( list, i);
		if( tmp==NULL )
		{
			return ;
		}
		printf("tmp:age:%d", tmp->age);
	}
	while( SeqList_Length(list)>0)
	{
		SeqList_Delete( list, 0);
	}

	printf("hello...\n");
	system("pause");
	return 0;
}
/*

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_Get(SeqList* list, int pos);

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


*/