11 #include <seqan3/std/new>
19 template <seqan3::data_layout data_layout_mode>
22 alignas(std::hardware_destructive_interference_size) std::atomic<size_t>
ibf_number{};
23 alignas(std::hardware_destructive_interference_size) std::atomic<size_t>
user_bin_number{};
56 double const denominator = std::log(1 - std::exp(std::log(fpr) / hash));
58 for (
size_t i = 2; i <= tmax; ++i)
60 double const tmp = 1.0 - std::pow(1 - fpr,
static_cast<double>(i));
61 fp_correction[i] = std::log(1 - std::exp(std::log(tmp) / hash)) / denominator;
std::vector< ibf_t > ibf_vector
The individual interleaved Bloom filters.
Definition: hierarchical_interleaved_bloom_filter.hpp:113
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:122
user_bins user_bins
The underlying user bins.
Definition: hierarchical_interleaved_bloom_filter.hpp:125
Must be first include.
Definition: bin_prefixes.hpp:13
Definition: build_data.hpp:21
std::atomic< size_t > ibf_number
Definition: build_data.hpp:22
size_t number_of_user_bins
Definition: build_data.hpp:25
lemon::ListDigraph ibf_graph
Definition: build_data.hpp:28
std::atomic< size_t > user_bin_number
Definition: build_data.hpp:23
size_t request_ibf_idx()
Definition: build_data.hpp:34
void compute_fp_correction(size_t const tmax, size_t const hash, double const fpr)
Definition: build_data.hpp:52
size_t request_user_bin_idx()
Definition: build_data.hpp:39
lemon::ListDigraph::NodeMap< node_data > node_map
Definition: build_data.hpp:29
size_t number_of_ibfs
Definition: build_data.hpp:26
hierarchical_interleaved_bloom_filter< data_layout_mode > hibf
Definition: build_data.hpp:31
void resize()
Definition: build_data.hpp:44
std::vector< double > fp_correction
Definition: build_data.hpp:32