list.h

数据结构自己写的linux链表的实现

#ifndef _LIST_H
#define _LIST_H

typedef struct _node
{
	struct _node *next;	
}Node;

typedef struct _list
{
	Node *head;
}List;

typedef struct _searchnode
{
	Node *node;
	struct _searchnode *next;
}Snode;
typedef struct _searchlist
{
	Snode *head;	
}Slist;

typedef void (*Print)(Node *data);
typedef int (*Cond)(Node *node, int b);
typedef void (*Deldata)(Node *node);

List *createlist(void);
void addnode(List *l, Node *datanode);
void delnode(List *l, Cond con, Deldata del, int b);
void printnode(List *l, Print printdata);
Slist *searchnode(List *l, Cond con, int b);

Slist *createslist(void);
void addsnode(Slist *sl, Node *node);
void destoryslist(Slist *sl);
void printsnode(Slist *l, Print printdata);
#endif