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.

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

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

Merged
merged 1 commit into from
Feb 16, 2014

Conversation

spencerkimball
Copy link
Member

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.

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.
@andybons
Copy link
Contributor

LGTM on the visibility changes. I’ll defer to @strangemonad or @petermattis for the slot stuff.

@spencerkimball spencerkimball merged commit 13f5cfa into master Feb 16, 2014
andreimatei added a commit that referenced this pull request Apr 14, 2016
…-diagram

change the mailboxes diagram to remove the multiple table readers
soniabhishek pushed a commit to soniabhishek/cockroach that referenced this pull request Feb 15, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants