On Tuesday 10 August 2010 at 14:26, luben karavelov wrote: > It helps with hash expansion because when you double the size of bucket > store you have to move arround only a half of the keys, and their new > locations is guarantted to be free
I'm not sure I believe that's the case with our implementation. Besides that, I was under the impression (see The Practice of Programming) that picking a prime number for the array size produces a better distribution of keys in buckets. The argument is that the lack of a common factor between the array size, the hash seed, and likely hash values produces a better distribution. Maybe we need some sort of intrusive benchmark with likely hash values that shows the statistical goodness or badness of our implementation. -- c _______________________________________________ http://lists.parrot.org/mailman/listinfo/parrot-dev
