Eric Blake <[EMAIL PROTECTED]> writes: > Does it really matter whether the set size is prime vs. 2^n-1 in how > likely a modulo operation in the hash is to cause collisions?
If the hash function is high-quality, then no. If the hash function is poor, quite possibly yes. -- Ben Pfaff http://benpfaff.org
