msi: Add binary search to the string table.

Alexandre Julliard julliard at
Mon Dec 14 09:45:45 CST 2009

Hans Leidekker <hans at> writes:

> On Monday 14 December 2009 16:00:21 Henri Verbeet wrote:
>> Does it really make sense to maintain both a hash table and a binary
>> search tree?
> Theoretically the hash lookup is faster for small numbers of strings,
> but I haven't benchmarked it. Alexandre suggested to keep the hash IIRC.

I doubt I did, I don't think it makes sense to have both. The small
number of strings case will be fast no matter what, the added complexity
is not worth it.

Alexandre Julliard
julliard at

More information about the wine-devel mailing list