Today, let's learn the basic operation of sequence table .

---

Preface

The order sheet , Full name sequential storage structure , It's a kind of linear table .
When a sequence table stores data , Will apply for a whole piece of physical space of sufficient size in advance , And then store the data one by one , When storing, there is no gap between data elements .
emm, Isn't this an array
you 're right , The sequence table is A linear table stored as an array in computer memory .

---

One 、 Initialization sequence table

void SLInit(SL* ps)
{
    
	assert(ps);

	ps->a = NULL;
	ps->size = ps->capacity = 0;
}

Two 、 Print order table

void SLPrint(SL* ps)
{
    
	assert(ps);

	for (int i = 0;i < ps->size;i++)
	{
    
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}

3、 ... and 、 Destroy space

void SLDestory(SL* ps)
{
    
	assert(ps);

	if (ps->a)
	{
    
		free(ps->a);
		ps->a = NULL;
	}
}

Four 、 Check capacity space , Full capacity expansion

void SLCheckCapacity(SL* ps)
{
    
	assert(ps);

	if (ps->capacity == ps->size)
	{
    
		int newCapacity = ps->capacity == 0 ? 4 : ps->capacity * 2;
		SLDataType* tmp = (SLDataType*)realloc(ps->a, newCapacity * sizeof(SLDataType));
		if (tmp == NULL)
		{
    
			perror("realloc");
			exit(-1);
		}
		ps->a = tmp;
		ps->capacity = newCapacity;
	}

}

5、 ... and 、 Tail insertion

void SLPushBack(SL* ps,SLDataType x)
{
    
	assert(ps);

	// Check the space 
	SLCheckCapacity(ps);

	ps->a[ps->size] = x;
	ps->size++;
}

6、 ... and 、 Deletion at the end

void SLPopBack(SL* ps)
{
    
	assert(ps);

	assert(ps->size);
	ps->size--;
	
}

7、 ... and 、 Head insertion

void SLPushFront(SL* ps,SLDataType x)
{
    
	assert(ps);

	// Check the space 
	SLCheckCapacity(ps);

	// Move data 
	int end = ps->size - 1;
	while (end >= 0)
	{
    
		ps->a[end + 1] = ps->a[end];
		end--;
	}

	ps->a[0] = x;
	ps->size++;
	
}

8、 ... and 、 Head deletion

void SLPopFront(SL* ps)
{
    
	assert(ps);
	assert(ps->size>0);

	int begin = 1;
	while (begin < ps->size)
	{
    
		ps->a[begin-1] = ps->a[begin];
		++begin;
	}
	ps->size--;

}

Nine 、 Insert... At a certain location

void SLInsert(SL* ps, int pos, SLDataType x)
{
    
	assert(ps);
	assert(pos >= 0 && pos <= ps->size);
	// Check the space 
	SLCheckCapacity(ps);

	int end = ps->size-1;
	while (end >= pos)
	{
    
		ps->a[end + 1] = ps->a[end];
		--end;
	}
	ps->a[pos] = x;
	ps->size++;
}

Ten 、 Delete a location

void SLErase(SL* ps, int pos)
{
    
	assert(ps);
	assert(pos >= 0 && pos < ps->size);

	int begin = pos;
	while (begin < ps->size-1)
	{
    
		ps->a[begin] = ps->a[begin + 1];
		++begin;
	}
	ps->size--;
}

11、 ... and 、 lookup

int SLFind(SL* ps, SLDataType x)
{
    
	assert(ps);
	for (int i = 0; i < ps->size; i++)
	{
    
		if (x == ps->a[i])
			return i;
	}
	return -1;
}

Twelve 、 modify

int Modify(SL* ps, int pos, SLDataType x)
{
    
	assert(ps);
	assert(pos >= 0 && pos < ps->size);
	ps->a[pos] = x;
}

---