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

[Joe Pfeiffer <pfeiffer cs nmsu edu>]

   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?
-- 
Joseph J. Pfeiffer, Jr., Ph.D.       Phone -- (505) 646-1605
Department of Computer Science       FAX   -- (505) 646-1002
New Mexico State University          http://www.cs.nmsu.edu/~pfeiffer