A Bloom Filter is a probabalistic data structure that Implements the Add() and Contains() methods in a memory efficient manner when compared to the more traditional Hash Set. However, the Bloom Filter has some draw backs:
* It will sometimes indicate that an element is in the set when it isn't. The False Positive rate can be decreased by using more memory.
*The capacity of the Bloom Filter is fixed at creation time. (You can add more elements than the target capacity, but the False Positive rate continues to increase thereafter).
Install-Package BloomFilter -Version 1.0.1
dotnet add package BloomFilter --version 1.0.1
<PackageReference Include="BloomFilter" Version="1.0.1" />
paket add BloomFilter --version 1.0.1
Added Keyword tags to Package Meta-data
This package has no dependencies.
This package is not used by any popular GitHub repositories.