A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. For example, checking availability of username is set membership problem, where the set is the list of all registered username.
ilkhom19/bloom_filter
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|