测试随笔功能

#include <stdlib.h>
#include "list.h"// 创建节点
Node* create_node(void* data)
{
    Node* node = malloc(sizeof(Node));
    node->data = data;
    node->next = NULL;
    return node;
}

// 销毁节点void destory_node(Node* node)
{
    free(node->data);
    free(node);
}

// 创建链表
List* create_list(void)
{
    List* list = malloc(sizeof(List));
    list->head = NULL;
    list->tail = NULL;
    list->size = 0;
    return list;
}

// 销毁链表void destory_list(List* list);
// 尾添加void add_list(List* list,void* data)
{
    Node* node = create_node(data);
    if(0 == list->size)
    {
        list->head = node;
        list->tail = node;
    }
    else
    {
        list->tail->next = node;
        list->tail = node;
    }
    list->size++;
}

// 删除bool del_list(List* list,void* cond,compar cmp)
{
    Node* temp = list->head;
    if(cmp(cond,list->head->data))
    {
        list->head = temp->next;
        destory_node(temp);
        list->size--;
        returntrue;
    }
    while(NULL!=temp->next)
    {
        if(cmp(cond,temp->next->data))
        {
            Node* node = temp->next;
            temp->next = node->next;
            if(node == list->tail)
            {
                list->tail = temp;
            }
            destory_node(node);
            list->size--;
            returntrue;
        }
        temp = temp->next;
    }
    returnfalse;
}

// 查找void* find_list(List* list,void* cond,compar cmp);
// 排序void sort_list(List* list,compar cmp);
// 遍历void show_list(List* list,void (*show)(void* data))
{
    for(Node* node=list->head; NULL!=node; node=node->next)
    {
        show(node->data);
    }
}