We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Currently, the smallest counter size supported by Counting Bloom Filter is 8 bit. It would be useful to implement 4 or possibly even 2 bit counters.
@jowong4 started implementing this at https://github.com/bcgsc/btl_bloomfilter/blob/bitvector/BitVector.hpp However it is not well tested it and it might be missing functionality. Atomic increment needs to be called until it returns true.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Currently, the smallest counter size supported by Counting Bloom Filter is 8 bit. It would be useful to implement 4 or possibly even 2 bit counters.
@jowong4 started implementing this at https://github.com/bcgsc/btl_bloomfilter/blob/bitvector/BitVector.hpp
However it is not well tested it and it might be missing functionality. Atomic increment needs to be called until it returns true.
The text was updated successfully, but these errors were encountered: