Mladen Turk wrote:
OK!
I'll propose the two things:
1. apr_btree to be able to do the range-based searches
Sounds useful. (I'd suggest implementing red-black trees, not AVL.)
2. apr_shash to be able to sort the hash table.
Do you mean actually sort elements in the table by some key, or just
make sure traversal is in the order of insertions? If the first, it's
probably better to use a tree. If the second, then there should be a way
to insert an element in a specific place in the traversal.
How that sounds?
All of this should go into apr-util, not apr.
--
Brane Čibej <[EMAIL PROTECTED]> http://www.xbc.nu/brane/
