An implementation of Bloom Filters in Java. Includes five hash functions, and a table size of 100 elements, but can be changed to use more, or less.
-
Notifications
You must be signed in to change notification settings - Fork 1
Heanthor/Bloom-Filter
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of Bloom Filters in Java
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published