生活随笔
收集整理的這篇文章主要介紹了
通用单向链表设计(三)——接口的测试
小編覺得挺不錯的,現(xiàn)在分享給大家,幫大家做個參考.
2019獨角獸企業(yè)重金招聘Python工程師標準>>>
接口的測試：
/***************test.c**********************/
#include "slist.h"static void node_display(void* ctx, void* data)
{printf(">>>%d<<<\n", (int)data);
}static Ret single_slist_test(void)
{ int i = 0;int count = 10; SList *this = slist_create(NULL, NULL);if(this == NULL){return RET_OOM;}for(i = 0 ; i < count/2; i++){assert(RET_OK == slist_append(this, (void*)i)); }assert(slist_length(this) == count/2);for(i = count/2; i < count; i++){assert(RET_OK == slist_prepend(this, (void*)i) );}assert(slist_length(this) == count); printf("\n==========set int middle==============\n");assert(RET_OK == slist_foreach(this, node_display, NULL)); for(i = 0; i < count; i++){void* data = 0;assert(RET_OK == slist_get_by_index(this, i, (void **)&data)); data = (void*)i;assert(RET_OK == slist_set_by_index(this, i, (void *)data)); }printf("\n==========set in sequence==============\n");assert(RET_OK == slist_foreach(this, node_display, NULL)); printf("\n==========set in reverse===============\n");assert(RET_OK == slist_foreach(slist_reverse(this), node_display, NULL)); for(i = count - 1; i >= 0; i--){assert(RET_OK == slist_delete(this, i));}assert(slist_length(this) == 0);slist_destroy(this);return RET_OK;
}int main(int argc, char** argv)
{single_slist_test();return 0 ;
}
測試結(jié)果如下：
==========set int middle==============
>>>9<<<
>>>8<<<
>>>7<<<
>>>6<<<
>>>5<<<
>>>0<<<
>>>1<<<
>>>2<<<
>>>3<<<
>>>4<<<==========set in sequence==============
>>>0<<<
>>>1<<<
>>>2<<<
>>>3<<<
>>>4<<<
>>>5<<<
>>>6<<<
>>>7<<<
>>>8<<<
>>>9<<<==========set in reverse===============
>>>9<<<
>>>8<<<
>>>7<<<
>>>6<<<
>>>5<<<
>>>4<<<
>>>3<<<
>>>2<<<
>>>1<<<
>>>0<<<
轉(zhuǎn)載于:https://my.oschina.net/mavericsoung/blog/177587
總結(jié)
以上是生活随笔為你收集整理的通用单向链表设计(三)——接口的测试的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。
如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。
