1.
if( (tail+1)%SEQLEN != head )
{
seqn[tail] = data;
tail = (tail+1)%SEQLEN;
}
2.
if( head != tail )
{
data = seqn[tail];
head = (head+1)%SEQLEN;
}
3.
if(head == tail)
{
}
4.
while(head != tail)
{
(tail+1) % SEQLEN == head
}
5.
while(head != tail)
{
(tail+1) % SEQLEN == head
}
6.
(tail - head + SEQLEN) % SEQLEN
7.
SEQLEN - 1
插入到 prev 和 next 中间
new->next = next;
prev->next =new;
删除 prev 和 next中间那个
new = prev->next;
prev->next = new->next;
free(new);
new = NULL;
插入到队尾
new->next = NULL;
head->next = new;
head = head->next;
删除
prev = entry->next;
entry->next = NULL;
free(entry);
entry = NULL;
判断是否为空
head->next = head->prev;