in reply to Fastest way to lookup a point in a set

You might also look at this simplified I::C hash. I'm sure it is slower than Perl's hashes, but it is also more compact if space is a problem.

And if bloom filters float your boat, then my 10x32-bit bit-tables from 1x 64-bit hash technique described in this thread might be of interest. You only need read my posts for code and roboticus' for the stats; the rest are noise.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". The enemy of (IT) success is complexity.
In the absence of evidence, opinion is indistinguishable from prejudice. Suck that fhit
  • Comment on Simplified hash and extended bloom(ish) filter.

In Section Seekers of Perl Wisdom