public BloomFilter(int expectedCount, double falsePositiveProbability) {
    bitsPerFilter = (int)Math.Ceiling((expectedCount * Math.Log(falsePositiveProbability)) / Math.Log(1.0 / (Math.Pow(2.0, Math.Log(2.0)))));
    hashCount = (int)Math.Round((Math.Log(2.0) * bitsPerFilter) / expectedCount);
    bitSet = new ConcurrentBitSet((uint)bitsPerFilter);
 }
Beispiel #2
0
 public BloomFilter(int expectedCount, double falsePositiveProbability)
 {
     bitsPerFilter = (int)Math.Ceiling((expectedCount * Math.Log(falsePositiveProbability)) / Math.Log(1.0 / (Math.Pow(2.0, Math.Log(2.0)))));
     hashCount     = (int)Math.Round((Math.Log(2.0) * bitsPerFilter) / expectedCount);
     bitSet        = new ConcurrentBitSet((uint)bitsPerFilter);
 }