| commit | 1953c40aa9589a03035fd294f3ba3549374a4826 | |
| author | Pieter Wuille <pieter.wuille@gmail.com> | |
| Sun, 24 Apr 2016 16:37:29 +0000 (24 18:37 +0200) | ||
| committer | Pieter Wuille <pieter.wuille@gmail.com> | |
| Thu, 28 Apr 2016 12:56:32 +0000 (28 14:56 +0200) | ||
| tree | 5b8d6f7d7dbdb8852642339d54050693626d277b | treesnapshot (tar.gz zip) |
| parent | aa62b68745ef43ca135fdffbd886818221e85731 | commitdiff |
More efficient bitsliced rolling Bloom filter
This patch changes the implementation from one that stores 16 2-bit integers
in one uint32_t's, to one that stores the first bit of 64 2-bit integers in
one uint64_t and the second bit in another. This allows for 450x faster
refreshing and 2.2x faster average speed.
This patch changes the implementation from one that stores 16 2-bit integers
in one uint32_t's, to one that stores the first bit of 64 2-bit integers in
one uint64_t and the second bit in another. This allows for 450x faster
refreshing and 2.2x faster average speed.
| src/bloom.cpp | diffblobblamehistory | |
| src/bloom.h | diffblobblamehistory | |
| src/test/bloom_tests.cpp | diffblobblamehistory |