Hartmut Brandt 3cfcafb49a Nobody actually checked the return codes from Lst_Append and Lst_Insert ... so don't return anything.		2004-12-09 15:31:32 +00:00
..
lstAppend.c	Nobody actually checked the return codes from Lst_Append and Lst_Insert	2004-12-09 15:31:32 +00:00
lstConcat.c	Remove return value from Lst_Concat. None of the callers ever checked	2004-12-08 16:47:19 +00:00
lstDeQueue.c	Don't check the return code from Lst_Remove. There is no way	2004-12-08 16:50:14 +00:00
lstDestroy.c	Now that circular lists are gone remove stuff for them. Simplify	2004-12-08 17:48:15 +00:00
lstDupl.c	Nobody actually checked the return codes from Lst_Append and Lst_Insert	2004-12-09 15:31:32 +00:00
lstFindFrom.c	Constify the arguments to the list compare function. This temporarily	2004-12-08 12:59:27 +00:00
lstForEachFrom.c	Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of	2004-12-07 13:49:13 +00:00
lstInit.c	Get rid of the sequential access feature of the lists. This was used	2004-12-08 16:22:01 +00:00
lstInsert.c	Nobody actually checked the return codes from Lst_Append and Lst_Insert	2004-12-09 15:31:32 +00:00
lstMember.c	Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of	2004-12-07 13:49:13 +00:00
lstRemove.c	No caller checks the return code from Lst_Remove, so don't return one.	2004-12-08 17:43:43 +00:00