-
Notifications
You must be signed in to change notification settings - Fork 3.1k
Addition of a Bloom Filter object #2176
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
Conversation
app/modules/bloom.c
Outdated
#include "../crypto/sha2.h" | ||
|
||
#if defined(LUA_USE_MODULES_BLOOM) && !defined(SHA2_ENABLE) | ||
#error Must have SHA2)ENABLE set for BLOOM module |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
) -> _
docs/en/modules/bloom.md
Outdated
|
||
|
||
This module implements a bloom filter. This is a probabilistic data structure that is used to test for set membership. There are two operations -- `add` and `check` that allow | ||
arbitrary strings to be added to the set or tested for set membership. Since this is a probabilistic dta structure, the answer returned can be incorrect. However, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
dta -> data
docs/en/modules/bloom.md
Outdated
|
||
This module implements a bloom filter. This is a probabilistic data structure that is used to test for set membership. There are two operations -- `add` and `check` that allow | ||
arbitrary strings to be added to the set or tested for set membership. Since this is a probabilistic dta structure, the answer returned can be incorrect. However, | ||
if the string *is* a member of the set, then the `check` operation will always return `true`. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Maybe add a link to https://en.wikipedia.org/wiki/Bloom_filter for further reading.
Thanks for fixing those issues 👍 |
* Initial checkin * Add bloom.md into mkdocs * Added reset and improved info * Update bloom.c * Update bloom.md * Add Wikipedia link
* Initial checkin * Add bloom.md into mkdocs * Added reset and improved info * Update bloom.c * Update bloom.md * Add Wikipedia link
Fixes #2175.
dev
branch rather than formaster
.docs/en/*
.This is a fairly simple implementation of a bloom filter object. The limits on how many objects you can store vary based on how much memory is available. However, storing 10,000 objects with a 1 false positive error rate consumes under 8k bytes of memory.