Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Arbitrary bit sizes for slots in the counting bloom filter #12

Merged
merged 1 commit into from
Feb 16, 2014
Merged

Arbitrary bit sizes for slots in the counting bloom filter #12

merged 1 commit into from
Feb 16, 2014

Commits on Feb 16, 2014

  1. Arbitrary bit sizes for slots in the counting bloom filter 

    Relax the divisible-by restriction on the number of bits for each slot.
I suspect the sweet spot for these things will be 3 bits, so this change
seemed worth doing. It was trickier than expected. I created a
"visitSlotBytes" method to refactor incrementSlot and getSlot to avoid
duplicated code as it had gotten complicated.

Fixed visibility issues with filter class.
    @spencerkimball
    spencerkimball committed Feb 16, 2014
    Configuration menu
    Copy the full SHA
    13f5cfa View commit details
    Browse the repository at this point in the history