说明:
本队列是通过顺序表实现的;
这里采用了代码复用的方法,即使用了SeqList顺序表,详见 数据结构封装之 《SeqList顺序表》;
下面将给出该数据结构的代码,每个函数的结构分析 ,以及个别主要函数的汇编分析
代码:
SeqQueue.h
#ifndef _SEQQUEUE_H_
#define _SEQQUEUE_H_
typedef void SeqQueue;
SeqQueue* SeqQueue_Create(int capacity);
void SeqQueue_Destroy(SeqQueue* queue);
void SeqQueue_Clear(SeqQueue* queue);
int SeqQueue_Append(SeqQueue* queue, void* item);
void* SeqQueue_Retrieve(SeqQueue* queue);
void* SeqQueue_Header(SeqQueue* queue);
int SeqQueue_Length(SeqQueue* queue);
int SeqQueue_Capacity(SeqQueue* queue);
#endif
SeqQueue.c
#include "SeqList.h"
#include "SeqQueue.h"
SeqQueue* SeqQueue_Create(int capacity) // O(1)
{
return SeqList_Create(capacity);
}
void SeqQueue_Destroy(SeqQueue* queue) // O(1)
{
SeqList_Destroy(queue);
}
void SeqQueue_Clear(SeqQueue* queue) // O(1)
{
SeqList_Clear(queue);
}
int SeqQueue_Append(SeqQueue* queue, void* item) // O(1)
{
return SeqList_Insert(queue, item, SeqList_Length(queue));
}
void* SeqQueue_Retrieve(SeqQueue* queue) // O(n)
{
return SeqList_Delete(queue, 0);
}
void* SeqQueue_Header(SeqQueue* queue) // O(1)
{
return SeqList_Get(queue, 0);
}
int SeqQueue_Length(SeqQueue* queue) // O(1)
{
return SeqList_Length(queue);
}
int SeqQueue_Capacity(SeqQueue* queue) // O(1)
{
return SeqList_Capacity(queue);
}
main.c
#include <stdio.h>
#include <stdlib.h>
#include "SeqQueue.h"
int main(int argc, char *argv[])
{
SeqQueue* queue = SeqQueue_Create(20);
int a[10] = {0};
int i = 0;
for(i=0; i<10; i++)
{
a[i] = i + 1;
SeqQueue_Append(queue, a + i);
}
printf("Header: %d\n", *(int*)SeqQueue_Header(queue));
printf("Length: %d\n", SeqQueue_Length(queue));
printf("Capacity: %d\n", SeqQueue_Capacity(queue));
while( SeqQueue_Length(queue) > 0 )
{
printf("Retrieve: %d\n", *(int*)SeqQueue_Retrieve(queue));
}
SeqQueue_Destroy(queue);
return 0;
}
函数结构分析:
1.SeqQueue_Create
2.SeqQueue_Destroy
3.SeqQueue_Clear
4.SeqQueue_Append
5.SeqQueue_Retrieve
6.SeqQueue_Header
7.SeqQueue_Length
8.SeqQueue_Capacity
汇编分析:
main
1.SeqQueue_Create
2.SeqQueue_Destroy
3.SeqQueue_Append
4.SeqQueue_Retrieve
5.SeqQueue_Header
6.SeqQueue_Length
7.SeqQueue_Capacity