心得体会:模块化编程,达到“高内聚,低耦合”,将.h文件与.c文件分开写。不仅使程序模块更加清晰,而且程序的可重复利用率提高,暴露出接口,使开发者不用关心函数是怎么实现的,只要调用就行
//工具函数的.H文件
#ifndef _TOOLS_H_
#define _TOOLS_H_
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//工具类接口
void *Malloc(size_t size);
void swap(void *a, void *b, int length);
#endif
//工具函数的具体实现.c文件
#include "tools.h"
void *Malloc(size_t size)
{
void *result = malloc(size);
if(result == NULL){
fprintf(stderr, "the memory is full!\n");
exit(1);
}
return result;
}
void swap(void *a, void *b, int length)
{
void *temp = Malloc(length);
memcpy(temp, a, length);
memcpy(a, b, length);
memcpy(b, temp, length);
free(temp);
}
//双端链表的函数实现的具体声明.H文件
#ifndef _DLIST_H_
#define _DLIST_H_
// A \ esc j . vim实用技巧
#define TRUE (1)
#define FALSE (0)
#define ZERO (0)
#define ONLY_ONE (1)
typedef unsigned char Boolean;
typedef void (*Print_func)(void *value);
//通用双端链表的节点信息
typedef struct Dlist_node{
struct Dlist_node *prev; //指向前一个节点
struct Dlist_node *next; //指向后一个节点
void *data; //数据域
}Dlist_node;
//通用双端链表的控制信息
typedef struct Dlist{
struct Dlist_node *head; //指向头结点
struct Dlist_node *tail; //指向尾节点
int count; //链表节点个数
//添加数据域的释放策略
void (*free)(void *ptr);
//匹配链表节点数据域是否“相等”
Boolean (*match)(void *value1, void *value2);
//拷贝链表节点数据域
void *(*copy_node)(void *value);
}Dlist;
//通用双端链表的接口
Dlist *init_dlist(void); //双端链表的初始化
void destroy_dlist(Dlist **dlist); //双端链表的销毁
Boolean push_front(Dlist *dlist, void *value); //头部插入
Boolean push_back(Dlist *dlist, void *value); //尾部插入
Boolean pop_front(Dlist *dlist); //头部删除
Boolean pop_back(Dlist *dlist); //尾部删除
Boolean insert_prev(Dlist *dlist, Dlist_node *node, void *value); //插入到链表某个节点的前边
Boolean insert_next(Dlist *dlist, Dlist_node *node, void *value); //插入到链表某个节点的后边
Boolean remove_dlist_node(Dlist *dlist, Dlist_node *node, void **value); //删除某个节点
void show_dlist(Dlist *dlist, Print_func print); //显示双端链表信息
Boolean get_front(Dlist *dlist, void **value); //得到第一个节点数据域
Boolean get_tail(Dlist *dlist, void **value); //得到最后一个节点数据域
int get_dlist_count(Dlist *dlist); //得到链表节点数量
#endif
//通用双端链表的具体实现的.C文件
#include "dlist.h"
#include "tools.h"
static Dlist_node *create_node(void);
static Dlist_node *create_node(void)
{
Dlist_node *node = (Dlist_node *)Malloc(sizeof(Dlist_node));
bzero(node, sizeof(Dlist_node));
return node;
}
//通用双端链表的接口
Dlist *init_dlist(void) //双端链表的初始化
{
Dlist *dlist = (Dlist *)Malloc(sizeof(Dlist));
bzero(dlist, sizeof(Dlist));
return dlist;
}
void destroy_dlist(Dlist **dlist) //双端链表的销毁
{
Dlist_node *p_node = NULL;
if(dlist == NULL || *dlist == NULL){
return ;
}
//先释放链表节点信息,再释放链表控制信息
//
//在释放链表节点信息时,需要判断是否释放数据域所指向的空间
p_node = (*dlist)->head;
while((*dlist)->head != NULL){
(*dlist)->head = p_node->next;
if((*dlist)->free != NULL){
(*dlist)->free(p_node->data);
}
free(p_node);
p_node = (*dlist)->head;
}
free(*dlist);
*dlist = NULL;
}
Boolean push_front(Dlist *dlist, void *value) //头部插入
{
Dlist_node *node = NULL;
if(dlist == NULL || value == NULL){
return FALSE;
}
//生成链表节点
node = create_node();
node->data = value;
if(dlist->count == ZERO){ //之前链表为空
dlist->head = dlist->tail = node;
}else{
node->next = dlist->head;
dlist->head->prev = node;
dlist->head = node;
}
dlist->count++;
return TRUE;
}
Boolean push_back(Dlist *dlist, void *value) //尾部插入
{
Dlist_node *node = NULL;
if(dlist == NULL || value == NULL){
return FALSE;
}
node = create_node();
node->data = value;
//对链表为空或非空区别处理
if(dlist->count == ZERO){
dlist->head = dlist->tail = node;
}else{
node->prev = dlist->tail;
dlist->tail->next = node;
dlist->tail = node;
}
dlist->count++;
return TRUE;
}
Boolean pop_front(Dlist *dlist) //头部删除
{
Dlist_node *p_node = NULL;
if(dlist == NULL || dlist->count == ZERO){
return FALSE;
}
p_node = dlist->head;
if(dlist->count == ONLY_ONE){
dlist->head = dlist->tail = NULL;
}else{
dlist->head = p_node->next;
dlist->head->prev = NULL;
}
//在释放节点信息之前,先要判断数据域的指向是否需要释放
if(dlist->free != NULL){
dlist->free(p_node->data);
}
free(p_node);
dlist->count--;
return TRUE;
}
Boolean pop_back(Dlist *dlist) //尾部删除
{
Dlist_node *p_node = NULL;
if(dlist == NULL || dlist->count == ZERO){
return FALSE;
}
//让p_node 指向最后一个节点
p_node = dlist->tail;
if(dlist->count == ONLY_ONE){
dlist->head = dlist->tail = NULL;
}else{
dlist->tail = p_node->prev;
dlist->tail->next = NULL;
}
if(dlist->free != NULL){
dlist->free(p_node->data);
}
free(p_node);
dlist->count--;
return TRUE;
}
Boolean insert_prev(Dlist *dlist, Dlist_node *node, void *value) //插入到链表某个节点的前边
{
Dlist_node *p_node = NULL;
if(dlist == NULL || node == NULL || value == NULL){
return FALSE;
}
//创建节点存储value
p_node = create_node();
p_node->data = value;
//进行节点的插入
//1.当前链表值有一个节点
//2.一般情况(多个节点)
p_node->next = node;
p_node->prev = node->prev;
if(node->prev == NULL){ //node为第一个节点
dlist->head = p_node;
}else{ //不是第一个节点
node->prev->next = p_node;
}
node->prev = p_node;
dlist->count++;
}
Boolean insert_next(Dlist *dlist, Dlist_node *node, void *value) //插入到链表某个节点的后边
{
return FALSE;
}
Boolean remove_dlist_node(Dlist *dlist, Dlist_node *node, void **value) //删除某个节点
{
return FALSE;
}
void show_dlist(Dlist *dlist, Print_func print) //显示双端链表信息
{
Dlist_node *p_node = NULL;
if(dlist != NULL && dlist->count > 0){
for(p_node = dlist->head; p_node; p_node = p_node->next){
print(p_node->data);
}
printf("\n");
}
}
Boolean get_front(Dlist *dlist, void **value) //得到第一个节点数据域
{
if(dlist == NULL || dlist->count == ZERO){
return FALSE;
}
if(value != NULL){
*value = dlist->head->data;
}
return TRUE;
}
Boolean get_tail(Dlist *dlist, void **value) //得到最后一个节点数据域
{
if(dlist == NULL || dlist->count == ZERO){
return FALSE;
}
if(value != NULL){
*value = dlist->tail->data;
}
return TRUE;
}
int get_dlist_count(Dlist *dlist) //得到链表节点数量
{
if(dlist == NULL){
return -1;
}
return dlist->count;
}
//主函数
#include "dlist.h"
#include <stdio.h>
void print_int(void *value);
void print_int(void *value)
{
printf("%d ", *(int *)value);
}
int main(int argc, char **argv)
{
Dlist *dlist = NULL;
dlist = init_dlist(); //双端链表的初始化
int array[] = {12, 23, 34, 45, 56, 67, 78, 89, 90, 100};
int length = sizeof(array) / sizeof(array[0]);
int i = 0;
for(i = 0; i < length; ++i){
push_back(dlist, &array[i]);
}
show_dlist(dlist, print_int); //显示链表信息
destroy_dlist(&dlist); //双端链表的销毁
return 0;
}