dash/blackcoin-more
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge #7934: Improve rolling bloom filter performance and benchmark

Browse Source 
1953c40 More efficient bitsliced rolling Bloom filter (Pieter Wuille)
aa62b68 Benchmark rolling bloom filter (Pieter Wuille)
This commit is contained in:
Wladimir J. van der Laan
2016-05-09 08:31:14 +02:00
parent fbd84788e6 1953c40aa9
commit f17032f703
5 changed files with 77 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
src/test/bloom_tests.cpp
View File

@@ -514,11 +514,14 @@ BOOST_AUTO_TEST_CASE(rolling_bloom)
if (i >= 100)
BOOST_CHECK(rb1.contains(data[i-100]));
rb1.insert(data[i]);
BOOST_CHECK(rb1.contains(data[i]));
}
// Insert 999 more random entries:
for (int i = 0; i < 999; i++) {
rb1.insert(RandomData());
std::vector<unsigned char> d = RandomData();
rb1.insert(d);
BOOST_CHECK(rb1.contains(d));
}
// Sanity check to make sure the filter isn't just filling up:
nHits = 0;