Re: [Libclc-developers] Introducing the double linked list interface

[Bryan D. <bd...@bd...>]

=2D----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On Sunday 23 March 2003 09:14 pm, Peter "Shaggy" Haywood wrote:
> From: Bryan Donlan <bd...@bd...>
> Subject: Re: [Libclc-developers] Introducing the double linked list
>  interface

> >How about FindPrev to walk the list backwards?
>
>   That's what the dir member (of CLC_DL_SEARCH_DATA) is for. This indicat=
es
> whether to search forward or backward, and is set by clc_dl_FIND_FIRST().

No, undoing FindNext. The lack of such a function defeats much of the purpo=
se=20
of a doubly-linked list. You have to walk the entire list just to look at t=
he=20
prior node.

> > What about removing arbitrar=3D
> >y=3D20
> >nodes and replacing them during such a search?
>
>   Huh? I don't understand.

Walk through the list, and if some test is true, delete the current node an=
d=20
continue to the next.
=2D----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.1 (GNU/Linux)

iD8DBQE+f4hax533NjVSos4RAhRfAJ9Vy88s/VpmCq/z70Vncuhj6e0iHQCfW0fX
B7QS8YEbWIkXGqGXLd2OQZY=3D
=3D3qu7
=2D----END PGP SIGNATURE-----