标签:clu #define lis return turn trie type bsp style
// seqqueue.h #ifndef SEQQUEUE_H_INCLUDED #define SEQQUEUE_H_INCLUDED 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_H_INCLUDED
// seqqueue.c #include "seqqueue.h" #include "seqList.h" seqQueue* seqQueue_Create(int capacity) { return Creat(capacity); } void seqQueue_Destroy(seqQueue* queue) { Destroy(queue); } void seqQueue_Clear(seqQueue* queue) { Clear(queue); } int seqQueue_Append(seqQueue* queue, void* item) { return Insert(queue, item, Length(queue)); } void* seqQueue_Retrieve(seqQueue* queue) { return Delete(queue, 0); } void* seqQueue_Header(seqQueue* queue) { return Get(queue, 0); } int seqQueue_Length(seqQueue* queue) { return Length(queue); } int seqQueue_Capacity(seqQueue* queue) { return Capacity(queue); }
标签:clu #define lis return turn trie type bsp style
原文地址:https://www.cnblogs.com/randyniu/p/9192003.html