-
Notifications
You must be signed in to change notification settings - Fork 325
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
How about adding Bloom Filter data structure? #162
Labels
Comments
@ericbreyer |
Cool, I will work on that! Is there any guide or docs for how the testing should be structured? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I think Bloom Filters are pretty cool. They are a fairly fast and space-efficient implementation of a set with the trade-off that "False positive matches are possible, but false negatives are not – in other words, a query returns either 'possibly in set' or 'definitely not in set'". Interesting applications could be guarding against expensive searches if the element definitely does not exist or if you only care about an element being outside the set.
I have a very rudimentary implementation of a (counting) bloom filter in cpp here (porting to C is trivial). https://github.com/ericbreyer/redBlackTreeInCpp/blob/master/bloomFilter/bloomFilter.cpp
Wikipedia on bloom filters: https://en.wikipedia.org/wiki/Bloom_filter
Wikipedia on counting bloom filters: https://en.wikipedia.org/wiki/Counting_Bloom_filter
Also skip lists could be cool?
The text was updated successfully, but these errors were encountered: