通用单向链表设计(三)——接口的测试

测试S列表接口功能实现

最新推荐文章于 2025-09-12 17:31:31 发布

转载最新推荐文章于 2025-09-12 17:31:31 发布 · 70 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/mavericsoung/blog/177587

文章标签：

#数据结构与算法 #python

本文详细测试了S列表接口的插入、删除、遍历等基本功能，验证了其在不同场景下的正确性和效率。

2019独角兽企业重金招聘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 ;
}

测试结果如下：

==========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<<<

转载于:https://my.oschina.net/mavericsoung/blog/177587