24 1.0 / fuzzed_data_provider.
ConsumeIntegralInRange<
unsigned int>(1, std::numeric_limits<unsigned int>::max()),
26 static_cast<unsigned char>(fuzzed_data_provider.
PickValueInArray({BLOOM_UPDATE_NONE, BLOOM_UPDATE_ALL, BLOOM_UPDATE_P2PUBKEY_ONLY, BLOOM_UPDATE_MASK}))};
35 const bool present = bloom_filter.
contains(b);
44 (void)bloom_filter.
contains(*out_point);
45 bloom_filter.
insert(*out_point);
46 const bool present = bloom_filter.
contains(*out_point);
56 bloom_filter.
insert(*u256);
57 const bool present = bloom_filter.
contains(*u256);
BloomFilter is a probabilistic filter which SPV clients provide so that we can filter the transaction...
bool IsWithinSizeConstraints() const
void insert(std::span< const unsigned char > vKey)
bool contains(std::span< const unsigned char > vKey) const
bool IsRelevantAndUpdate(const CTransaction &tx)
Also adds any outputs which match the filter to the filter (to match their spending txes).
The basic transaction that is broadcasted on the network and contained in blocks.
T ConsumeIntegralInRange(T min, T max)
T PickValueInArray(const T(&array)[size])
#define LIMITED_WHILE(condition, limit)
Can be used to limit a theoretically unbounded loop.
static constexpr TransactionSerParams TX_WITH_WITNESS
size_t CallOneOf(FuzzedDataProvider &fuzzed_data_provider, Callables... callables)
std::vector< B > ConsumeRandomLengthByteVector(FuzzedDataProvider &fuzzed_data_provider, const std::optional< size_t > &max_length=std::nullopt) noexcept
std::optional< T > ConsumeDeserializable(FuzzedDataProvider &fuzzed_data_provider, const P ¶ms, const std::optional< size_t > &max_length=std::nullopt) noexcept