A fixed size HashMap that inserts newer key-values to empty spaces or overwrites older key-values if the space is occupied by an older key-value.
Credit: Original implementation https://github.com/alexandrnikitin/bloom-filter-scala.
Reserves a range of keys for processing by a single thread.
Reserves a range of keys for processing by a single thread.
This is used to ensure that multiple threads do not concurrent perform compaction on overlapping keys within the same Level.