On Tue, 30 Nov 2010 16:48:03 +0100 Joerg Sonnenberger <jo...@britannica.bec.de> wrote:
> On Tue, Nov 30, 2010 at 03:37:28PM +0000, Sad Clouds wrote: > > Well, if hash table is heavily used for looking up keys, you can reduce > > the number of collisions even further. The trick is to use different > > hash functions, which are very fast to compute: Ah yeah, you have a valid point.
