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.
In reply to Simplified hash and extended bloom(ish) filter.
by BrowserUk
in thread Fastest way to lookup a point in a set
by eyepopslikeamosquito
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |