Re: [gtk-list] Nevermind (was: Glib BTree & GTree wrapper)

[Antonio Campos <acampos ceronet com>]

Derek Simkowiak wrote:

>      All,
>         A few days ago I was proposing the addition of a BTree data type
> to glib, and replacing the balanced binary tree with the BTree code.
>
>         Well, Josh MacDonald introduced me to a relatively new data
> structure (from the late 80's :) that I'd never heard of before: Skipped
> Lists.
>
>         Skipped Lists are like linked lists on steroids.  All of the
> reading I've done so far (including a paper co-written by Josh) indicates
> that Skipped Lists are much faster than BTrees, usually by several orders
> of magnitude, and under some conditions, by a factor of several dozen.
> Also, they are much, much easier to implement than BTrees.  On the
> outside, they operate on sorted data so your API can be exactly like that
> of a BTree.
>
>         I'm not sure if I'm going to need Skipped Lists for my project or
> not, but if anyone's up to it I think this structure would make a
> wonderful addition to Glib.  There are several reference implementations
> available, including one by Josh.   Just run a search of Google for more
> info.
>
> --Derek Simkowiak
>
> --
> To unsubscribe: mail -s unsubscribe gtk-list-request@redhat.com < /dev/null

I don't know much (not to say nothing), about data structures, but glib should
be a very little library (that's the intended use, isn't it?), so I don't see
the point of adding many complex structures to the library.
If you want this structure added to glib, shouldn't you make a library apart
from glib and deliver it separately from glib?

I hope I haven't been very rude...