Re: Advanced data structures in Glib ?

[Mark Mielke <mark mark mielke cc>]

On Tue, Mar 12, 2002 at 03:25:55PM -0500, Zack Rusin wrote:
> I was wondering if there's a chance of seeing a little more advanced data 
> structures in the next release of Glib. To be more specific, I think it 
> would be really beneficial to see:
> - Red Black tree moved from GTK+ to Glib,
> - Hash table with collision resolution (linked list preferably),
> - B-Tree (come on you know you want it :) ),
> - Splay tree, 
> - priority queue, 
> added to Glib. What do you guys think?

I suspect they would consider a patch that included the new
functionality, assuming it was consistent with the rest of glib... :-)

Personally, I would like to see glib improve in these sorts of areas.

mark

-- 
mark mielke cc/markm ncf ca/markm nortelnetworks com __________________________
.  .  _  ._  . .   .__    .  . ._. .__ .   . . .__  | Neighbourhood Coder
|\/| |_| |_| |/    |_     |\/|  |  |_  |   |/  |_   | 
|  | | | | \ | \   |__ .  |  | .|. |__ |__ | \ |__  | Ottawa, Ontario, Canada

  One ring to rule them all, one ring to find them, one ring to bring them all
                       and in the darkness bind them...

                           http://mark.mielke.cc/