self_list.rar_self

#include "stdio.h" #include "self_list.h" int InitializeList(LISTNODE * pList) { if(pList == NULL) return -1; PNODE pHead = new NODE; if(pHead == NULL) return -1; pHead->next=pHead; pHead->prev=pHead; pList->head=pHead; pList->NodeCount=0; return 0; } int InsertElement(LISTNODE * pList, _TYPE _element) { if(pList == NULL) return -1; PNODE pNode = new NODE; if(pNode == NULL) return -1; pNode->element = _element; InsertNode(pList, pNode); return 0; } int InsertNode(LISTNODE * pList, PNODE pNode) { if(pList == NULL || pNode == NULL) return -1; PNODE pos = pList->head; pos->prev->next =pNode; pNode->prev = pos->prev; pNode->next = pos; pos->prev = pNode; pList->NodeCount++; return 0; } PNODE DeleteElement(LISTNODE * pList, _TYPE _element) { if( pList == NULL) return NULL; PNODE pNode = FindElement(pList, _element); if(pNode != NULL) { DeleteNode(pList, pNode); } return pNode; } int DeleteNode(LISTNODE * pList, PNODE pNode) { if(pList == NULL || pNode == NULL) return -1; pNode->prev->next = pNode->next; pNode->next->prev = pNode->prev; pList->NodeCount--; return 0; } PNODE FindElement(LISTNODE * pList, _TYPE _element) { if( pList == NULL) return NULL; PNODE pNode = pList->head->next; int FindFlag = -1; while(pNode != pList->head) { if(pNode->element == _element) { FindFlag = 0; break; } pNode = pNode->next; } if(FindFlag == -1) pNode = NULL; return pNode; } int IsEmpty(LISTNODE * pList) { if(pList == NULL) return -1; return pList->NodeCount; } int ClearList(LISTNODE * pList) { if(pList == NULL) return -1; PNODE pNode = pList->head->next; while(pNode != pList->head) { DeleteNode(pList, pNode); pNode = pNode->next; } return 0; } int DestroyList(LISTNODE * pList) { if(pList == NULL) return -1; ClearList(pList); delete pList->head; pList->head = NULL; return 0; }