#include"Seqlist1228.h"
//打印函数的实现
void slprint(SL* ps)
{
	for (int i = 0; i < ps->size; i++)
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}


//初始化
void seqlistinit(SL* ps)
{
	ps->a = NULL;
	ps->size = ps->capacity = 0;
}

//释放内存
void seqlistdestroy(SL* ps)
{
	free(ps->a);
	ps->a = NULL;
	ps->capacity = ps->size = 0;
}

//扩容
void seqlistcheckcapacity(SL* ps)
{
	if (ps->size == ps->capacity)//是否扩容的条件
	{
		int newcapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;


		sldatatype* tmp = realloc(ps->a, newcapacity * sizeof(sldatatype));


		if (tmp == NULL)//realloc失败
		{
			printf("realloc fail\n");
			exit(-1);
		}
		//realloc成功了
		ps->a = tmp;//把申请到的空间给  a
		ps->capacity = newcapacity;//  容量给扩容后的容量
	}
}

//实现尾插函数
void seqlistpushback(SL* ps, sldatatype x)
{
	//先判断
	// 
	// 
	// 
	//如果无空间或者空间不足，那么就扩容
	seqlistcheckcapacity(ps);

	//插入数据
	ps->a[ps->size] = x;
	ps->size++;
	/*ps->a[ps -> size] = x;
	ps->size++;直接插入*/

}//尾插




//尾删
void seqlistpopback(SL* ps)
{
	//判断法

	/*if (ps->size > 0)
	{
		ps->size--;
	}*/


	//断言法
	assert(ps->size > 0);
	ps->size--;
}



//实现头插
void seqlistpushfront(SL* ps, sldatatype x)
{
	seqlistcheckcapacity(ps);
	int end = ps->size - 1;
	while (end >= 0)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[0] = x;
	ps->size++;
}//头插
void seqlistpopfront(SL* ps)
{		
	assert(ps->size > 0);
	int begin = 1;
	while (begin < ps->size)
	{
		ps->a[begin - 1] = ps->a[begin];
		++begin;
	}
	ps->size--;
	
}//头删