LstIsEmpty	lstInt.h	/^#define LstIsEmpty(l)	(((List)l)->firstPtr == NilL/
LstNodeValid	lstInt.h	/^#define LstNodeValid(ln, l)	((((LstNode)ln) == NIL/
LstValid	lstInt.h	/^#define LstValid(l)	(((Lst)l == NILLST) ? FALSE : /
Lst_Append	lstAppend.c	/^Lst_Append (l, ln, d)$/
Lst_AtEnd	lstAtEnd.c	/^Lst_AtEnd (l, d)$/
Lst_AtFront	lstAtFront.c	/^Lst_AtFront (l, d)$/
Lst_Close	lstClose.c	/^Lst_Close (l)$/
Lst_Concat	lstConcat.c	/^Lst_Concat (l1, l2, flags, copyProc)$/
Lst_Cur	lstCur.c	/^Lst_Cur (l)$/
Lst_Datum	lstDatum.c	/^Lst_Datum (ln)$/
Lst_DeQueue	lstDeQueue.c	/^Lst_DeQueue (l)$/
Lst_Destroy	lstDestroy.c	/^Lst_Destroy (l, freeProc)$/
Lst_Duplicate	lstDupl.c	/^Lst_Duplicate (l, copyProc)$/
Lst_EnQueue	lstEnQueue.c	/^Lst_EnQueue (l, d)$/
Lst_Find	lstFind.c	/^Lst_Find (l, d, cProc)$/
Lst_FindFrom	lstFindFrom.c	/^Lst_FindFrom (l, ln, d, cProc)$/
Lst_First	lstFirst.c	/^Lst_First (l)$/
Lst_ForEach	lstForEach.c	/^Lst_ForEach (l, proc, d)$/
Lst_ForEachFrom	lstForEachFrom.c	/^Lst_ForEachFrom (l, ln, proc, d)$/
Lst_Index	lstIndex.c	/^Lst_Index(l, d)$/
Lst_Init	lstInit.c	/^Lst_Init(circ)$/
Lst_Insert	lstInsert.c	/^Lst_Insert (l, ln, d)$/
Lst_IsAtEnd	lstIsAtEnd.c	/^Lst_IsAtEnd (l)$/
Lst_IsEmpty	lstIsEmpty.c	/^Lst_IsEmpty (l)$/
Lst_Last	lstLast.c	/^Lst_Last (l)$/
Lst_Length	lstLength.c	/^Lst_Length(l)$/
Lst_Member	lstMember.c	/^Lst_Member (l, d)$/
Lst_Move	lstMove.c	/^Lst_Move (ls, lns, ld, lnd, before)$/
Lst_Next	lstNext.c	/^Lst_Next (l)$/
Lst_Open	lstOpen.c	/^Lst_Open (l)$/
Lst_Pred	lstPred.c	/^Lst_Pred (ln)$/
Lst_Prev	lstPrev.c	/^Lst_Prev (l)$/
Lst_Remove	lstRemove.c	/^Lst_Remove (l, ln)$/
Lst_Replace	lstReplace.c	/^Lst_Replace (ln, d)$/
Lst_SetCirc	lstSetCirc.c	/^Lst_SetCirc (l, circ)$/
Lst_Succ	lstSucc.c	/^Lst_Succ (ln)$/
PAlloc	lstInt.h	/^#define	PAlloc(var,ptype)	var = (ptype) emalloc (s/
