16#include <seqan3/std/new>
24template <seqan3::data_layout data_layout_mode>
30 size_t number_of_user_bins{};
31 size_t number_of_ibfs{};
33 lemon::ListDigraph ibf_graph{};
34 lemon::ListDigraph::NodeMap<node_data> node_map{ibf_graph};
39 size_t request_ibf_idx()
44 size_t request_user_bin_idx()
52 hibf.
user_bins.set_ibf_count(number_of_ibfs);
53 hibf.
user_bins.set_user_bin_count(number_of_user_bins);
60 void compute_fp_correction(
size_t const requested_max_tb,
size_t const num_hash_functions,
double const desired_fpr)
62 fp_correction.
resize(requested_max_tb + 1, 0.0);
63 fp_correction[1] = 1.0;
68 for (
size_t split = 2u; split <= requested_max_tb; ++split)
71 fp_correction[split] = numerator /
std::log1p(-
std::exp(log_target_fpr / num_hash_functions));
72 assert(fp_correction[split] >= 1.0);
T atomic_fetch_add(T... args)
The HIBF binning directory. A data structure that efficiently answers set-membership queries for mult...
Definition hierarchical_interleaved_bloom_filter.hpp:88
std::vector< ibf_t > ibf_vector
The individual interleaved Bloom filters.
Definition hierarchical_interleaved_bloom_filter.hpp:123
std::vector< std::vector< int64_t > > next_ibf_id
Stores for each bin in each IBF of the HIBF the ID of the next IBF.
Definition hierarchical_interleaved_bloom_filter.hpp:132
user_bins user_bins
The underlying user bins.
Definition hierarchical_interleaved_bloom_filter.hpp:135
Provides raptor::hierarchical_interleaved_bloom_filter.
Must be first include.
Definition bin_size_in_bits.hpp:18
Provides raptor::hibf::node_data.
Definition build_data.hpp:26
void compute_fp_correction(size_t const requested_max_tb, size_t const num_hash_functions, double const desired_fpr)
Precompute f_h factors that adjust the split bin size to prevent FPR inflation due to multiple testin...
Definition build_data.hpp:60