Re: [PATCH] implementation of backward traversing of lists

[David Laight <david%l8s.co.uk@localhost>]

On Fri, Oct 03, 2008 at 01:58:59PM +0300, Ilya Dogolazky wrote:
> Hi all,
> 
> the LIST data structure is the only one of the six data structures (SLIST,
> LIST, SIMPLEQ, STAILQ, TAILQ, CIRCLEQ), which is a double linked structure,
> but can't be traversed backwards.

Indeed, so if you want a list you can travers backwards you use one of
the other list types.

The big advantage of LIST is that you can remove an item without
knowing the correct 'head'.

        David

-- 
David Laight: david%l8s.co.uk@localhost