From: Martin Bryce <nx-2000@...>
Date: 2008-08-18T06:08:25+09:00
Subject: Re: Not So Random (#173)

Bill Kelly wrote:

> I'm not sure why that would follow.  The number of buckets is typically
> a prime number, and the hash value is mapped to a bucket number by
> modulo arithmetic.  So . . . .

Oh, right. You usually reduce the output to the size of the table with 
the modulus, obviously... anyway, I used to think that the output of an 
hash function should look random to anybody who isn't actively trying to 
break it (the output of a cryptography-grade hash should look random 
EVEN IF YOU TRY, obviously :D)
-- 
Posted via http://www.ruby-forum.com/.