Advanced data structures in Glib ?


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?

Zack Rusin

For every complex problem there is an answer that is clear, simple, and 
-- H L Mencken

[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]