public static int EstimateD0(int sizeA, int sizeB, int quasiIntersectionN0, BloomFilter bf)
{
var div = 1 - bf.FalsePositive;
var d = sizeA - sizeB + 2 * (sizeB - quasiIntersectionN0) / div;
return (int)Math.Ceiling(d);
}
public void BFTestCorrect()
{
var hFuncs = new List<IHashFunc>
{
new MurmurHash3_x86_32() {Seed = 0},
new MurmurHash3_x86_32() {Seed = 1},
new MurmurHash3_x86_32() {Seed = 2},
new MurmurHash3_x86_32() {Seed = 3},
new MurmurHash3_x86_32() {Seed = 4}
};
var filter = new BloomFilter(1000000, hFuncs);
var numberOfValuesToAdd = 5000;
for (int i = 0; i < numberOfValuesToAdd; i++)
{
var str = string.Format("Test {0}", i);
var ba = System.Text.Encoding.UTF8.GetBytes(str);
Assert.IsFalse(filter.Contains(ba, 0, ba.Length));
filter.Add(ba, 0, ba.Length);
Assert.IsTrue(filter.Contains(ba, 0, ba.Length));
}
}
public static int SizeOfBF(BloomFilter bf)
{
return 4 + (int)Math.Ceiling(bf.BitLength / 8.0);
}
