25 std::map<uint32_t, bool> diff;
28 const auto entry{fuzzed_data_provider.ConsumeIntegralInRange<uint32_t>(1, std::numeric_limits<uint32_t>::max() - 1)};
29 const auto KeepDiff{[&] {
30 bool& mut{diff[entry]};
48 const auto num_diff{std::accumulate(diff.begin(), diff.end(),
size_t{0}, [](
auto n,
const auto& e) { return n + e.second; })};
52 sketch_ar.Deserialize(sketch_a.Serialize());
53 sketch_br.Deserialize(sketch_b.Serialize());
55 Minisketch sketch_diff{std::move(fuzzed_data_provider.ConsumeBool() ? sketch_a : sketch_ar)};
56 sketch_diff.Merge(fuzzed_data_provider.ConsumeBool() ? sketch_b : sketch_br);
58 if (capacity >= num_diff) {
59 const auto max_elements{fuzzed_data_provider.ConsumeIntegralInRange<
size_t>(num_diff, capacity)};
60 const auto dec{*
Assert(sketch_diff.Decode(max_elements))};
61 Assert(dec.size() == num_diff);
#define Assert(val)
Identity function.
T ConsumeIntegralInRange(T min, T max)
#define LIMITED_WHILE(condition, limit)
Can be used to limit a theoretically unbounded loop.
struct minisketch minisketch
Opaque type for decoded sketches.
Minisketch MakeMinisketch32(size_t capacity)
Wrapper around Minisketch::Minisketch(32, implementation, capacity).
size_t CallOneOf(FuzzedDataProvider &fuzzed_data_provider, Callables... callables)