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. -Hans