双向循环链表

dllist.h

#ifndef _DLLIST_H
#define _DLLIST_H

#ifdef __cplusplus
extern "C" {
#endif 

struct DLLNode_T{
    void *pData;                 //数据域指针
    struct DLLNode_T *pPrev;     //前驱指针
    struct DLLNode_T *pNext;     //后驱指针
};

#define DLLNODE struct DLLNode_T
typedef DLLNODE *pNode;
#define DLLNODE_SIZE sizeof(struct DLLNode_T)


pNode DLLNODE_Init(void *pData);

void DLLNODE_InsertToTail(pNode head, void *pData);

int DLLNODE_GetCount(pNode head);

pNode DLLNODE_Search(pNode head, char *acCmp, int (*fCmp)(void *pData, char *acCmp));

int DLLNODE_GetIndex(pNode head, pNode pOperate);

void DLLNODE_Print(pNode head, void (*fPrint)(void *pData));

void DLLNODE_FreeFromHead(pNode head);

void DLLNODE_TDelete(pNode pTDel);

bool DLLNODE_FDelete(pNode pFDel, void (*fDel)(void *pData));

#ifdef __cplusplus
}
#endif

#endif

dllist.cpp

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "./dllist.h"

pNode DLLNODE_Init(void *pData)
{
    pNode DDLNode=NULL;

    DDLNode=(pNode)malloc(DLLNODE_SIZE);
    if(DDLNode==NULL)
    {
        printf("Error!");
    }
    else
    {
        DDLNode->pData=pData;
        // 初始化结点的前驱结点与后驱结点就是自身
        DDLNode->pPrev=DDLNode->pNext=DDLNode; 
    }
    
    return DDLNode;
}


void DLLNODE_InsertToTail(pNode head, void *pData)
{
    pNode pNew=NULL;

    pNew=DLLNODE_Init(pData);

    pNew->pNext=head;
    head->pPrev->pNext=pNew;
    pNew->pPrev=head->pPrev;
    head->pPrev=pNew;
}

int DLLNODE_GetCount(pNode head)
{
    pNode pTmp=NULL;
    int count=0;

    for(pTmp=head->pNext; pTmp!=head; pTmp=pTmp->pNext)
    {
        count++;
    }

    return count;
}

pNode DLLNODE_Search(pNode head, char *acCmp, int (*fCmp)(void *pData, char *acCmp))
{
    pNode pTmp=NULL;

    for(pTmp=head->pNext; pTmp!=head; pTmp=pTmp->pNext)
    {
        if(fCmp(pTmp->pData, acCmp))
        {
            return pTmp;
        }
    }
    
    return NULL;
}

int DLLNODE_GetIndex(pNode head, pNode pOperate)
{
    pNode pTmp=NULL;
    int iIndex=0;
    
    for(pTmp=head->pNext; pTmp!=head; pTmp=pTmp->pNext)
    {
        iIndex++;
        if(pTmp==pOperate)
        {
            break;
        }
    }

    return iIndex;
}

void DLLNODE_Print(pNode head, void (*fPrint)(void *pData))
{
    pNode pTmp=NULL;
    int count=0;
    int iOption=0;

    if(head->pNext==head)
    {
        printf("---链表无数据---
");
    }
    else
    {
        for(pTmp=head->pNext; pTmp!=head; pTmp=pTmp->pNext)
        {
            fPrint(pTmp->pData);
        }
    }    
}

void DLLNODE_FreeFromHead(pNode head)
{
    pNode pTmp=NULL;

    for(pTmp=head->pNext; pTmp!=head; pTmp=head->pNext)
    {
        pTmp->pNext->pPrev=head;
        head->pNext=pTmp->pNext;
        free(pTmp->pData);
        free(pTmp);
    }
    free(head);
}

void DLLNODE_TDelete(pNode pTDel)
{
    pTDel->pPrev->pNext=pTDel->pNext;
    pTDel->pNext->pPrev=pTDel->pPrev;

    free(pTDel->pData);
    free(pTDel);
}

bool DLLNODE_FDelete(pNode pFDel, void (*fDel)(void *pData))
{
    if(pFDel==NULL)
    {
        return false;
    }
    else
    {
        fDel(pFDel->pData);
        return true;
    }
}