14 std::vector<unsigned char> data(32);
16 uint32_t nEntriesPerGeneration = (120000 + 1) / 2;
17 uint32_t countnow = 0;
23 data[2] = count >> 16;
24 data[3] = count >> 24;
25 if (countnow == nEntriesPerGeneration) {
29 std::cout <<
"RollingBloom-refresh,1," << (e-b)*0.000001 <<
"," << (e-b)*0.000001 <<
"," << (e-b)*0.000001 <<
"\n";
35 data[0] = count >> 24;
36 data[1] = count >> 16;
39 match += filter.contains(data);
RollingBloomFilter is a probabilistic "keep track of most recently inserted" set.
BENCHMARK(RollingBloom, 1500 *1000)
int64_t GetTimeMicros()
Returns the system time (not mockable)