list use c代码,C代码库,德仔网

代码语言
代码分类
【C】 list use c
作者:sincoder / 发布于2012/10/8/ 2993
<div>typedef void * ElementType;
//http://users.cis.fiu.edu/~weiss/dsaa_c2e/list.h
/* START: fig3_6.txt */
#ifndef _List_H
#define _List_H</div>
<div>struct Node;
typedef struct Node *PtrToNode;
typedef PtrToNode List;
typedef PtrToNode position;</div>
<div>List list_make_empty( List L ); //清空链表
int list_is_empty( List L ); //Return true if L is empty
int list_is_last( position P, List L );
position list_find( ElementType X, List L );
void list_delete( ElementType X, List L );
position list_find_previous( ElementType X, List L );
void list_insert( ElementType X, List L, position P );
void list_delete_list( List L );
position list_header( List L );
position list_first( List L );
position list_advance( position P );
ElementType list_retrieve( position P ); //取出 position 里面的值</div>
<div>endif /* _List_H */
/* END */</div>
<div>////////////////////////////////////////////////////////////
#include "StdAfx.h"
#include "list.h"</div>
<div>/* Place in the interface file */
struct Node
{
ElementType Element;
position Next;
};</div>
<div>List
list_make_empty( List L )
{
if( L != NULL )
list_delete_list( L );
L = sin_malloc( sizeof( struct Node ) );
if( L == NULL )
{
dbg_msg(L"list_insert() : malloc failed !!\n");
 return NULL;
}
L->Next = NULL;
return L;
}
<div>
/* START: fig3_8.txt */
/* Return true if L is empty */</div>
<div>int
list_is_empty( List L )
{
return L->Next == NULL;
}
/* END */</div>
<div>/* START: fig3_9.txt */
/* Return true if P is the last position in list L */
/* Parameter L is unused in this implementation */</div>
<div>int list_is_last( position P, List L )
{
return P->Next == NULL;
}
/* END */</div>
<div>/* START: fig3_10.txt */
/* Return Position of X in L; NULL if not found */</div>
<div>position
list_find( ElementType X, List L )
{
position P;

/* 1*/ P = L->Next;
/* 2*/ while( P != NULL && P->Element != X )
/* 3*/ P = P->Next;

/* 4*/ return P;
}
/* END */</div>
<div>/* START: fig3_11.txt */
/* Delete from a list */
/* Cell pointed to by P->Next is wiped out */
/* Assume that the position is legal */
/* Assume use of a header node */</div>
<div>void
list_delete( ElementType X, List L )
{
position P, TmpCell;

P = list_find_previous( X, L );

if( !list_is_last( P, L ) ) /* Assumption of header use */
{ /* X is found; delete it */
TmpCell = P->Next;
P->Next = TmpCell->Next; /* Bypass deleted cell */
sin_free( TmpCell );
}
}
/* END */</div>
<div>/* START: fig3_12.txt */
/* If X is not found, then Next field of returned value is NULL */
/* Assumes a header */</div>
<div>position
list_find_previous( ElementType X, List L )
{
 position P;

/* 1*/ P = L;
/* 2*/ while( P->Next != NULL && P->Next->Element != X )
/* 3*/ P = P->Next;

/* 4*/ return P;
}
/* END */</div>
<div>/* START: fig3_13.txt */
/* Insert (after legal position P) */
/* Header implementation assumed */
/* Parameter L is unused in this implementation */</div>
<div>void
list_insert( ElementType X, List L, position P )
{
position TmpCell;

/* 1*/ TmpCell = sin_malloc( sizeof( struct Node ) );
/* 2*/ if( TmpCell == NULL )
/* 3*/ {
dbg_msg(L"list_insert() : malloc failed !!\n");
return ;
}
/* 4*/ TmpCell->Element = X;
/* 5*/ TmpCell->Next = P->Next;
/* 6*/ P->Next = TmpCell;
}
/* END */</div>
if 0
/* START: fig3_14.txt */
/* Incorrect DeleteList algorithm */</div>
<div>void
DeleteList( List L )
{
Position P;

/* 1*/ P = L->Next; /* Header assumed */
/* 2*/ L->Next = NULL;
/* 3*/ while( P != NULL )
{
/* 4*/ sin_free( P );
/* 5*/ P = P->Next;
}
}
/* END */
#endif</div>
<div>/* START: fig3_15.txt */
/* Correct DeleteList algorithm */</div>
<div>void
list_delete_list( List L )
{
position P, Tmp;

/* 1*/ P = L->Next; /* Header assumed */
/* 2*/ L->Next = NULL;
/* 3*/ while( P != NULL )
{
/* 4*/ Tmp = P->Next;
/* 5*/ sin_free( P );
/* 6*/ P = Tmp;
}
}
/* END */</div>
<div>position
list_header( List L )
{
return L;
}
<div>position
list_first( List L )
{
return L->Next;
}
<div>position
list_advance( position P )
{
return P->Next;
}
<div>ElementType
list_retrieve( position P )
{
return P->Element;
}
</div>
试试其它关键字
　list　　use　　c　
同语言下
可能有用的
sincoder贡献的其它代码(4)