Certainly it is as fast as most good hash functions. (After all, I could
just keep a counter and hash that if I had a good hash function, couldn't I?)
A simple lagged-fibonacci generator like x[i] = x[i-24] + x[i-55] would
do fine. Moving to a twisted generator (TGFSR) improves things even more.
What is arguably the best PRNG currently existing, the Mersenne Twister
(Can you say "perfect score on the spectral test with up to 600 dimensions",
boys and girls?), is quite fast.
Now, if you need cryptographically strong, that's a different issue.
As I wrote before, I think it's the variable node size that makes skip
lists a pain to work with, not the random numbers.
-- -Colin- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.altern.org/andrebalsa/doc/lkml-faq.html