fea4e9eca5
dd777f3e12Remove unused variable (practicalswift)cdf4089457Remove redundant assignments (dead stores) (practicalswift) Pull request description: Remove redundant assignments (dead stores). Tree-SHA512: e852059b22a161c34a0f18a6a6ed798e2b35e6d2b9f23c526af0ec33e01f6a5bb1fa5ada6671ba183d7b02393ff0d397be5aa4b4e2edbd5e604c9a76ac48d249
31 lines
821 B
C++
31 lines
821 B
C++
// Copyright (c) 2016-2018 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <iostream>
|
|
|
|
#include <bench/bench.h>
|
|
#include <bloom.h>
|
|
|
|
static void RollingBloom(benchmark::State& state)
|
|
{
|
|
CRollingBloomFilter filter(120000, 0.000001);
|
|
std::vector<unsigned char> data(32);
|
|
uint32_t count = 0;
|
|
while (state.KeepRunning()) {
|
|
count++;
|
|
data[0] = count;
|
|
data[1] = count >> 8;
|
|
data[2] = count >> 16;
|
|
data[3] = count >> 24;
|
|
filter.insert(data);
|
|
|
|
data[0] = count >> 24;
|
|
data[1] = count >> 16;
|
|
data[2] = count >> 8;
|
|
data[3] = count;
|
|
filter.contains(data);
|
|
}
|
|
}
|
|
|
|
BENCHMARK(RollingBloom, 1500 * 1000);
|