Meziantou.FrameworkBlockedBloomFilterSize Struct
The size of a BlockedBloomFilter: a number of 512-bit blocks and a number of bits set per value.
public readonly struct BlockedBloomFilterSizeRemarks
The values do not spread evenly over the blocks: the number of values per block follows a Poisson distribution, and the crowded blocks answer "maybe" more often than the average. BlockedBloomFilterSize.CreateOptimalSize accounts for this, so it returns more bits than BloomFilterSize.CreateOptimalSize for the same false positive probability.
Properties
| Name | Description |
|---|---|
| BitCount | Gets the total number of bits: BlockedBloomFilterSize.BlockCount × 512. |
| BlockCount | Gets the number of 512-bit (64-byte) blocks. |
| HashCount | Gets the number of bits set in the block of a value when it is added. |
BitCount
BlockedBloomFilterSize.csGets the total number of bits: BlockedBloomFilterSize.BlockCount × 512.
public long BitCount { get; }Property value
BlockCount
BlockedBloomFilterSize.csHashCount
BlockedBloomFilterSize.csMethods
| Name | Description |
|---|---|
| CreateExact(long, int) | |
| CreateOptimalSize(long, double) | Computes the smallest size whose false positive probability, once expectedItemCount values are added, is at most falsePositiveProbability. |
| GetFalsePositiveProbability(long) | Computes the expected false positive probability of a filter of this size once itemCount distinct values are added. |
CreateExact(long, int)
BlockedBloomFilterSize.cspublic static BlockedBloomFilterSize CreateExact(long blockCount, int hashCount)No documentation is available.
CreateOptimalSize(long, double)
BlockedBloomFilterSize.csComputes the smallest size whose false positive probability, once expectedItemCount values are added, is at most falsePositiveProbability.
public static BlockedBloomFilterSize CreateOptimalSize(long expectedItemCount, double falsePositiveProbability)