#ifndef CHAIN_COMMON_H#define CHAIN_COMMON_H#include<stdio.h>#include<malloc.h>#include "group_common.h"/**********************************************************************************************************************************//**********************************************************************************************************************************//*有關(guān)的錯(cuò)誤類型*/#define ERR_NODATA 0#define ERR_OUTOFLENGTH -1#define ERR_OUTOFMEMORY -1/**********************************************************************************************************************************//**********************************************************************************************************************************/struct chain_node{	DATA_TYPE node_data;	struct chain_node *chain_next;};struct chain_init{	LONGINT chain_length;	struct chain_node *chain_head;};struct chain_cur{	struct chain_init *chain_name;	struct chain_node *chain_point;	LONGINT chain_local;};struct chain_init* last_operation;/*指向最后操作的鏈表*//*功能：chain_create:初始化一個(gè)鏈表輸入：data_cable:緩沖區(qū)長(zhǎng)度 默認(rèn)為500輸出：已經(jīng)初始化的鏈表*/struct chain_init chain_Create();/*功能：chain_Curcreate:建立一個(gè)游標(biāo)輸入：chain_name:指向的鏈表輸出：游標(biāo)*/struct chain_cur chain_Curcreate(struct chain_init* chain_name);/*功能：chain_Length:返回?cái)?shù)據(jù)量輸入：chain_name:鏈表名稱輸出數(shù)據(jù)量*/LONGINT chain_Length(struct chain_cur* cur_name);/*功能：chain_Eof:判斷是否到尾輸入：chain_name:鏈表名稱輸出是否到尾*/SHORTINT chain_Eof(struct chain_cur* cur_name);/*功能：chain_Append:在鏈表尾部增加數(shù)據(jù)，操作完畢后指針會(huì)移至尾部輸入：chain_name:待操作鏈表名indata:插入的數(shù)據(jù)輸出：插入后鏈表的長(zhǎng)度*/LONGINT chain_Append(DATA_TYPE indata,struct chain_cur* cur_name);/*功能：chain_Insert:在游標(biāo)所在位置插入數(shù)據(jù)輸入：chain_name:鏈表名稱indata:插入數(shù)據(jù)輸出：插入后鏈表的長(zhǎng)度*/LONGINT chain_Insert(DATA_TYPE indata,struct chain_cur* cur_name);/*功能：chain_Remove:刪除游標(biāo)當(dāng)前的數(shù)據(jù)注：此函數(shù)效率極低，慎用輸入：chain_name:鏈表名稱輸出：刪除后鏈表的長(zhǎng)度*/LONGINT chain_Remove(struct chain_cur* cur_name);/*功能：chain_First:把鏈表游標(biāo)移至頭部輸入：chain_name:鏈表名稱輸出：無(wú)*/void chain_First(struct chain_cur* cur_name);/*功能：chain_Next():把鏈表游標(biāo)后移一位輸入：chain_name:鏈表名稱輸出：無(wú)*/void chain_Next(struct chain_cur* cur_name);/*功能chain_Prev():把鏈表游標(biāo)前移一位注：此函數(shù)效率極低，慎用輸入：chain_name:鏈表名稱輸出：無(wú)*/void chain_Prev(struct chain_cur* cur_name);/*功能chain_Last():把鏈表游標(biāo)移至末尾注：此函數(shù)效率極低，慎用輸入：chain_name:鏈表名稱輸出：無(wú)*/void chain_Last(struct chain_cur* cur_name);/*功能chain_Goto():把鏈表游標(biāo)移動(dòng)到指定位置輸入：chain_location:位置chain_name:鏈表名稱輸出：無(wú)*/void chain_Goto(LONGINT chain_location,struct chain_cur* cur_name);/*功能chain_Get():取得游標(biāo)當(dāng)前的數(shù)據(jù)輸入：arrap_name:鏈表名稱輸出：取得的數(shù)據(jù)*/DATA_TYPE chain_Get(struct chain_cur* cur_name);/*功能chain_Get():修改游標(biāo)當(dāng)前的數(shù)據(jù)輸入：indata:輸入數(shù)據(jù)arrap_name:鏈表名稱輸出：無(wú)*/void chain_Set(DATA_TYPE indata,struct chain_cur* cur_name);/*功能chain_Drop():拋棄鏈表輸入：arrap_name:鏈表名稱輸出：無(wú)*/void chain_Drop(struct chain_cur* cur_name);/**********************************************************************************************************************************//*各函數(shù)的快速調(diào)用，省略鏈表參數(shù)，操作最近一次操作過(guò)的鏈表，命名規(guī)則為在chain_后加q*//**********************************************************************************************************************************//*LONGINT chain_qSize();LONGINT chain_qLength();SHORTINT chain_qEof(struct chain_cur* cur_name);*/#endif