Zach Brown e0e6179156 Fix bloom filter bugs ...

The bloom filter had two bad bugs.

First the calculation was adding the bit width of newly hashed data to
the hash value instead of the record of the hashed bits available.

And the block offset calculation for each bit wasn't truncated to the
number of bloom blocks.  While fixing this we can clean up the code and
make it faster by recording the bits in terms of their block and bit
offset instead of their large bit value.

Signed-off-by: Zach Brown <zab@versity.com>

2016-03-23 22:23:21 -04:00

..

src

Fix bloom filter bugs

2016-03-23 22:23:21 -04:00

.gitignore

Initial commit

2016-02-12 15:58:41 -08:00

Makefile

Initial commit

2016-02-12 15:58:41 -08:00

sparse.sh

Initial commit

2016-02-12 15:58:41 -08:00