Re: include/wine: Header only implementation of generic redblack binary search tree.

[Marcus Meissner]

On Sat, Dec 20, 2008 at 07:30:53PM +0200, Pauli Nieminen wrote:
> This implementation provides easy access to rb-tree which should be used instead of hashmap
> if number of entries changes a lot of over time of execution.
> It should be simple to write hashtree based on this which uses hash value of the key instead of
> key it self. (Which would speed up tree operations a lot if key is long string)
>
> Note: I have also code to test the tree functionality but I don't know where to put
> internal test cases.

For what functionality in Wine is this intended? We do not seem
to be using hashmap either?

Ciao, Marcus

include/wine: Header only implementation of generic redblack binary search tree.

[Henri Verbeet]

2008/12/20 Marcus Meissner <marcus(a)jet.franken.de>:
> On Sat, Dec 20, 2008 at 07:30:53PM +0200, Pauli Nieminen wrote:
> > This implementation provides easy access to rb-tree which should be used instead of hashmap
> > if number of entries changes a lot of over time of execution.
> > It should be simple to write hashtree based on this which uses hash value of the key instead of
> > key it self. (Which would speed up tree operations a lot if key is long string)
> >
> > Note: I have also code to test the tree functionality but I don't know where to put
> > internal test cases.
>
> For what functionality in Wine is this intended? We do not seem
> to be using hashmap either?

We use hash maps in a couple of places in wined3d. I think using a
rbtree could be useful there, but I don't particularly like this
implementation. If other people agree that a generic rbtree would be
useful outside of wined3d, I'm pretty sure I can write something
that's less heavy on macros.