ngx_queue_t双向链表

typedefstruct ngx_queue_s ngx_queue_t;
typedefstruct ngx_queue_s {
    ngx_queue_t *prev;
    ngx_queue_t *next;
};

#include #include "./ngx_queue.h"//元素所在结构体typedefstruct _TestNode{
    u_char *str;
    ngx_queue_t qEle;   //包含ngx_queue_t组成双向链表int num;
}TestNode;

//设置的比较函数
ngx_int_t compTestNode(const ngx_queue_t *a,const ngx_queue_t *b){
    TestNode *aNode = ngx_queue_data(a, TestNode, qEle);
    TestNode *bNode = ngx_queue_data(b, TestNode, qEle);
    return aNode->num > bNode->num;
}

//按顺序打印链表内容void printQueue(ngx_queue_t *head){
    ngx_queue_t *pNode = NULL;
    for(pNode = ngx_queue_head(head);\
        pNode != ngx_queue_sentinel(head);\
        pNode = ngx_queue_next(pNode)){
        TestNode *node = ngx_queue_data(pNode,TestNode,qEle);
        printf("%d ",node->num);
    }
    printf("\n");
}

int main(){
    ngx_queue_t queueContainer;         //Create a ngx_queue_t variable
    ngx_queue_init(&queueContainer);    //Initialize the variableint i = 0;
    TestNode node[5];
    for(;i5;++i)
        node[i].num = i;

    //可以考虑一下插入后的顺序
    ngx_queue_insert_tail(&queueContainer,&node[0].qEle);
    ngx_queue_insert_head(&queueContainer,&node[1].qEle);
    ngx_queue_insert_tail(&queueContainer,&node[2].qEle);
    ngx_queue_insert_after(&queueContainer,&node[3].qEle);
    ngx_queue_insert_tail(&queueContainer,&node[4].qEle);

    //Pirnt queue
    printQueue(&queueContainer);

    //Sort
    ngx_queue_sort(&queueContainer,compTestNode);

    //Print queue after sort
    printQueue(&queueContainer);

    return0;
}