RE: [gtk-list] Re: Benchmarking glib (atleast GList)

["Rostedt, Steven" <steven rostedt lmco com>]

I'm posting this again, but since I don't see my original in the
archive (posted on Oct 26 1998) I don't think it ever really made 
it to the list.

This is GQList:  a wrapper around GList.

You CAN initialize the GQList to NULL then
use it later, It tests to see if it was initialized
before using it, like GList does.

It contains THREE pointers. One to the front,
one to the end, and an arbitrary "current" pointer.
This current pointer points to the last position 
accessed to make indexing down the list
more efficient.  
GQList also provides a method of sorting
the list like an array.

Please take some time to look at this 
and give me a reply (steven.rostedt@lmco.com)

I haven't had time to thoroughly test it, so 
take a little caution.

> -----Original Message-----
> From:	Joe Pfeiffer [SMTP:pfeiffer@cs.nmsu.edu]
> Sent:	Wednesday, March 24, 1999 9:55 AM
> To:	gtk-list@redhat.com
> Subject:	[gtk-list] Re: Benchmarking glib (atleast GList)
> 
> 
>    I dribbled:
>    > A datastructure with fast addition at either end isn't really a list,
> it's
>    > more like a LIFO queue or something.
> 
>    <blush>Hehe, I meant LILO of course.</blush>
> 
> Of course you can have a list with fast insertion at both ends.  It's
> easy to insert at the head of a standard singly linked list based LIFO
> queue
> implementation, though if that's what you're using it for you don't
> exploit that fact.  It's just that, with a singly linked list, it's
> only easy to remove from the head.
> 
> How would a LILO queue be different from a FIFO queue?
>