utlist使用总结

参考：https://blog.csdn.net/a123441/article/details/90374650

utlist.h获取（可直接粘贴）：https://gitee.com/yanbib/libcoap2/blob/master/utlist.h

使用手册（暂时只找到uthash的）：http://troydhanson.github.io/uthash/userguide.html#_delete_item

使用utlist双向链表可以模拟栈、队列。示例：

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include "utlist.h"
#include "uthash.h"

#define LEN 10

typedef struct _node {
    int num;
    char str[LEN];
    struct _node *prev;
    struct _node *next;
} node;

node *list = NULL;

void Show()
{
    node *tmp = NULL;

    printf("================
");
    DL_FOREACH(list, tmp) {
        printf("%d %s
", tmp->num, tmp->str);
    }
}

int Cmp(node *a, node *b)
{
    return b->num - a->num;
}

int Cmp1(node *a, node *b)
{
    return strcmp(a->str, b->str);
}

int main()
{
    node *cur = NULL;
    node *tmp = NULL;
    char strs[LEN * LEN] = "asr.srh.hhet.ad.hs.";
    char dlip[LEN] = ".";
    char *token = strtok(strs, dlip);
    int num = 0;

    while (token != NULL) {
        tmp = (node *)malloc(sizeof(node));
        memset(tmp, 0, sizeof(node));
        num++;
        tmp->num = num;
        strcpy(tmp->str, token);
        DL_APPEND(list, tmp);
        token = strtok(NULL, dlip);
    }

    Show();
    DL_SORT(list, Cmp);
    Show();
    DL_SORT(list, Cmp1);
    Show();

    tmp = list;
    DL_DELETE(list, tmp);
    Show();
    printf(" %d %s
", tmp->num, tmp->str);

    tmp = list->prev;
    DL_DELETE(list, tmp);
    Show();
    printf(" %d %s
", tmp->num, tmp->str);

    DL_FOREACH_SAFE(list, cur, tmp) {
        DL_DELETE(list, cur);
        free(cur);
    }
    Show();

    return 0;
}