以前的一篇博文是使用C语言实现的链表,但是在多处需要使用到链表时候,造成了不便。这里使用类对他进行了简单的封装。
对以下代码经过简单的修改即可以加入您的工程啦。感谢您的阅读。
#ifndef POINT_HPP
#define POINT_HPP
typedef struct Ret_Regex
{
char *Data;
unsigned char length;
Ret_Regex *next;
}Ret_Regex,*pRet_Regex ;
class TPointLinkList
{
public:
pRet_Regex PointLinkList ;
#define Linkpointer pRet_Regex
#define LinkEntity Ret_Regex
void Entity_entity(Linkpointer Node)
{
//Node->Data = readyplaindata.length ;
//Node->Data = readyplaindata.Data ;
}
/* first is messy print */
void Entity_print(Linkpointer Node)
{
}
void PrintList(Linkpointer phead)
{
Linkpointer p = phead ;
while(p!=NULL)
{
Entity_print(p);
p = p->next ;
}
}
/* Length 1 no data only head */
int GetLength(Linkpointer phead)
{
Linkpointer p = phead ; int Length=0 ;
while(p!=NULL)
{
Length ++ ;
p = p->next ;
}
return Length ;
}
Linkpointer Before_Null_Node(Linkpointer phead)
{
Linkpointer p = phead ;
while(p->next!=NULL)
{
p=p->next ;
}
return p ;
}
/* Create,return Node add */
Linkpointer CreateNode()
{
Linkpointer pNode = (Linkpointer)malloc(sizeof(LinkEntity));
if(pNode==NULL)
{
printf("Node malloc error \n");
}
Entity_entity(pNode);
pNode->next = NULL ;
return pNode ;
}
/* Add Node between */
void AddNode(Linkpointer pNode,Linkpointer pNode2)
{
Linkpointer pNew = CreateNode();
pNode->next = pNew ;
pNew->next = pNode2 ;
}
/* Delete next Node */
bool DeleteNode(Linkpointer pNode)
{
Linkpointer pDel = pNode->next ;
if(pDel==NULL)
{
printf(" No Node to Delete ");
return 0 ;
}
pNode->next = pDel->next ;
pDel->next = NULL ;
free(pDel);
return 1 ;
}
private:
protected:
};