c语言数据结构链表源代码----笛风读书笔记系列

读书笔记系列之：c语言数据结构链表源代码

                                                                              笛风

                                                                              2013.10.11

在linux下已通过编译，运行毫无压力~

头文件的定义：

Linked_list.h

#ifndef LINKED_LIST_H_
#define LINKED_LIST_H_
#define NOT_FOUND -1
#define SUCCESS 0
typedef struct linked_list_t linked_list_t;
//链表提供接口，可以继续增加功能
struct linked_list_t {
	int (*get_count)(linked_list_t *this);
	int (*remove_first)(linked_list_t *this, void **item);
	void (*insert_last)(linked_list_t *this, void *item);
	void (*destroy)(linked_list_t *this);
};


linked_list_t *linked_list_create(void);

#endif

链表的函数定义：

Linked_list.c

#include "stdlib.h"
#include "stdio.h"
#include "linked_list.h"

typedef struct element_t element_t;
struct element_t {
	void *value;
	element_t *previous;
	element_t *next;
};
//创建链表节点
element_t *element_create(void *value)
{
	element_t *this = malloc(sizeof(element_t));
	this->previous = NULL;
	this->next = NULL;
	this->value = value;
	return (this);
}

typedef struct private_linked_list_t private_linked_list_t;

//链表
struct private_linked_list_t {
	linked_list_t public;
	int count;
	element_t *first;
	element_t *last;
};

static int get_count(private_linked_list_t *this){
	return this->count;
}
static int get_first(private_linked_list_t *this, void **item)
{
	if (this->count == 0)
	{
		return NOT_FOUND;
	}
	*item = this->first->value;
	return SUCCESS;
}
static element_t* remove_element(private_linked_list_t *this, element_t *element)
{
	element_t *next, *previous;

	next = element->next;
	previous = element->previous;
	free(element);
	if (next)
	{
		next->previous = previous;
	}
	else
	{
		this->last = previous;
	}
	if (previous)
	{
		previous->next = next;
	}
	else
	{
		this->first = next;
	}
	if (--this->count == 0)
	{
		this->first = NULL;
		this->last = NULL;
	}
	return next;
}
//线程从任务队列上取下任务
static int remove_first(private_linked_list_t *this, void **item)
{
	//获得第一个元素的值结构体指针
	if (get_first(this, item) == SUCCESS)
	{
		//删除第一个元素
		remove_element(this, this->first);
		return SUCCESS;
	}
	return NOT_FOUND;
}

static void insert_last(private_linked_list_t *this , void * item){
	element_t *element = element_create(item);
	if (this->count == 0)
	{
		/* first entry in list */
		this->first = element;
		this->last = element;
		element->previous = NULL;
		element->next = NULL;
	}
	else
	{
		element_t *old_last_element = this->last;
		element->previous = old_last_element;
		element->next = NULL;
		old_last_element->next = element;
		this->last = element;
	}
	this->count++;
}
static void destroy(private_linked_list_t *this){
	printf("linked list destroy!\n");
}
linked_list_t *linked_list_create(void){
	private_linked_list_t *this = malloc(sizeof(private_linked_list_t));
	this->public.get_count = (int(*)(linked_list_t *))get_count;
	this->public.remove_first = (int(*)(linked_list_t * ,void **item))remove_first;	
	this->public.insert_last = (void(*)(linked_list_t * ,void *item))insert_last;
	this->public.destroy = (void(*)(linked_list_t *))destroy;
	this->first = NULL;
	this->last = NULL;
	this->count = 0;
	return &(this->public);
}

主函数：//链表的使用：

#include "stdlib.h"
#include "stdio.h"
#include "linked_list.h"

 
main() 
{
	linked_list_t *list=linked_list_create();
	int a=list->get_count(list);
	int c=25;
	void *b=(void *)&c;
	printf("链表元素的个数为：%d\n",a);
	list->insert_last(list,b);
	printf("链表插入元素成功！\n");
	a=list->get_count(list);
	printf("链表元素的个数为：%d\n",a);
	 
}