Checking membership of a large set quickly! Using hashes to set bits in a #bit_vector in order to test if an element may be in a set. This could be used as a filter for more expensive tests to hone down on a positive data set. some of the three filters can be tuned and dialed in for performance / memory constraints and to fit certain data sets.
