Hartmut Brandt c76d7d5047 Get rid of the sequential access feature of the lists. This was used ...

only in a couple of places and all of them except for one were easily
converted to use Lst_First/Lst_Succ. The one place is compatibility
mode in job.c where the it was used to advance to the next command on
each invocation of JobStart. For this case add a pointer to the node to
hold the currently executed command.

2004-12-08 16:22:01 +00:00

..

lstAppend.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +00:00

lstConcat.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +00:00

lstDeQueue.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +00:00

lstDestroy.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +00:00

lstDupl.c

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +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

Typedefs of pointers to structs are evil. Make Lst and LstNode typedef of

2004-12-07 13:49:13 +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

Get rid of the sequential access feature of the lists. This was used

2004-12-08 16:22:01 +00:00