10 for (
int i = 0; i < 10000; ++i) {
12 element[0] =
static_cast<uint8_t
>(i);
13 element[1] =
static_cast<uint8_t
>(i >> 8);
14 elements.insert(std::move(element));
17 uint64_t siphash_k0 = 0;
27 for (
int i = 0; i < 10000; ++i) {
29 element[0] =
static_cast<uint8_t
>(i);
30 element[1] =
static_cast<uint8_t
>(i >> 8);
31 elements.insert(std::move(element));
bool Match(const Element &element) const
Checks if the element may be in the set.
static void ConstructGCSFilter(benchmark::State &state)
static unsigned char elements[DATACOUNT][DATALEN]
This implements a Golomb-coded set as defined in BIP 158.
std::unordered_set< Element, ByteVectorHash > ElementSet
std::vector< uint8_t > Element
static void MatchGCSFilter(benchmark::State &state)
BENCHMARK(ConstructGCSFilter, 1000)