[Mono-list] More fighting with Hashtable

Brian Jepson bjepson@oreilly.com
Fri, 13 Jul 2001 15:37:17 -0400 (EDT)

On Fri, 13 Jul 2001, Thomas F. Burdick wrote:

> Hmm, keeping an array of the primes less than 2^32 would be pretty
> easy.  Maybe a back-up prime number generator wouldn't be bad as a
> backup for the pathological case where a hash table has more than 2^32
> buckets, but it seems a waste to do that computation for anything but
> the pathological cases.

I agree - you should definitely use a table, and when you run out of
primes, fall back on the generator.