Raptor 3.0.1
A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences
raptor::hibf Namespace Reference

Must be first include. More...

Classes

struct  build_data
 
struct  chopper_pack_record
 
struct  node_data
 

Functions

size_t bin_size_in_bits (build_arguments const &arguments, size_t const number_of_kmers_to_be_stored)
 
template<seqan3::data_layout data_layout_mode>
void chopper_build (build_arguments const &arguments)
 
template void chopper_build< seqan3::data_layout::compressed > (build_arguments const &)
 
template void chopper_build< seqan3::data_layout::uncompressed > (build_arguments const &)
 
void compute_kmers (robin_hood::unordered_flat_set< size_t > &kmers, build_arguments const &arguments, chopper_pack_record const &record)
 
template<seqan3::data_layout data_layout_mode>
seqan3::interleaved_bloom_filter construct_ibf (robin_hood::unordered_flat_set< size_t > &parent_kmers, robin_hood::unordered_flat_set< size_t > &kmers, size_t const number_of_bins, lemon::ListDigraph::Node const &node, build_data< data_layout_mode > &data, build_arguments const &arguments, bool is_root)
 
template seqan3::interleaved_bloom_filter construct_ibf< seqan3::data_layout::compressed > (robin_hood::unordered_flat_set< size_t > &, robin_hood::unordered_flat_set< size_t > &, size_t const, lemon::ListDigraph::Node const &, build_data< seqan3::data_layout::compressed > &, build_arguments const &, bool)
 
template seqan3::interleaved_bloom_filter construct_ibf< seqan3::data_layout::uncompressed > (robin_hood::unordered_flat_set< size_t > &, robin_hood::unordered_flat_set< size_t > &, size_t const, lemon::ListDigraph::Node const &, build_data< seqan3::data_layout::uncompressed > &, build_arguments const &, bool)
 
template<seqan3::data_layout data_layout_mode>
void create_ibfs_from_chopper_pack (build_data< data_layout_mode > &data, build_arguments const &arguments)
 
template void create_ibfs_from_chopper_pack< seqan3::data_layout::compressed > (build_data< seqan3::data_layout::compressed > &, build_arguments const &arguments)
 
template void create_ibfs_from_chopper_pack< seqan3::data_layout::uncompressed > (build_data< seqan3::data_layout::uncompressed > &, build_arguments const &)
 
template<seqan3::data_layout data_layout_mode>
size_t hierarchical_build (robin_hood::unordered_flat_set< size_t > &parent_kmers, lemon::ListDigraph::Node const &current_node, build_data< data_layout_mode > &data, build_arguments const &arguments, bool is_root)
 
template size_t hierarchical_build< seqan3::data_layout::compressed > (robin_hood::unordered_flat_set< size_t > &, lemon::ListDigraph::Node const &, build_data< seqan3::data_layout::compressed > &, build_arguments const &, bool)
 
template size_t hierarchical_build< seqan3::data_layout::uncompressed > (robin_hood::unordered_flat_set< size_t > &, lemon::ListDigraph::Node const &, build_data< seqan3::data_layout::uncompressed > &, build_arguments const &, bool)
 
void insert_into_ibf (build_arguments const &arguments, chopper_pack_record const &record, seqan3::interleaved_bloom_filter<> &ibf)
 
void insert_into_ibf (robin_hood::unordered_flat_set< size_t > const &kmers, size_t const number_of_bins, size_t const bin_index, seqan3::interleaved_bloom_filter<> &ibf, timer< concurrent::yes > &fill_ibf_timer)
 
template<seqan3::data_layout data_layout_mode>
void loop_over_children (robin_hood::unordered_flat_set< size_t > &parent_kmers, seqan3::interleaved_bloom_filter<> &ibf, std::vector< int64_t > &ibf_positions, lemon::ListDigraph::Node const &current_node, build_data< data_layout_mode > &data, build_arguments const &arguments, bool is_root)
 
template void loop_over_children< seqan3::data_layout::compressed > (robin_hood::unordered_flat_set< size_t > &, seqan3::interleaved_bloom_filter<> &, std::vector< int64_t > &, lemon::ListDigraph::Node const &, build_data< seqan3::data_layout::compressed > &, build_arguments const &, bool)
 
template void loop_over_children< seqan3::data_layout::uncompressed > (robin_hood::unordered_flat_set< size_t > &, seqan3::interleaved_bloom_filter<> &, std::vector< int64_t > &, lemon::ListDigraph::Node const &, build_data< seqan3::data_layout::uncompressed > &, build_arguments const &, bool)
 
size_t parse_chopper_pack_header (lemon::ListDigraph &ibf_graph, lemon::ListDigraph::NodeMap< node_data > &node_map, std::istream &chopper_pack_file)
 
chopper_pack_record parse_chopper_pack_line (std::string const &current_line)
 
template<seqan3::data_layout data_layout_mode>
void read_chopper_pack_file (build_data< data_layout_mode > &data, std::string const &chopper_pack_filename)
 
template void read_chopper_pack_file< seqan3::data_layout::compressed > (build_data< seqan3::data_layout::compressed > &, std::string const &)
 
template void read_chopper_pack_file< seqan3::data_layout::uncompressed > (build_data< seqan3::data_layout::uncompressed > &, std::string const &)
 
void update_parent_kmers (robin_hood::unordered_flat_set< size_t > &parent_kmers, robin_hood::unordered_flat_set< size_t > const &kmers, timer< concurrent::yes > &merge_kmers_timer)
 
template<seqan3::data_layout data_layout_mode>
void update_user_bins (build_data< data_layout_mode > &data, std::vector< int64_t > &filename_indices, chopper_pack_record const &record)
 
template void update_user_bins< seqan3::data_layout::compressed > (build_data< seqan3::data_layout::compressed > &, std::vector< int64_t > &, chopper_pack_record const &)
 
template void update_user_bins< seqan3::data_layout::uncompressed > (build_data< seqan3::data_layout::uncompressed > &, std::vector< int64_t > &, chopper_pack_record const &)
 

Detailed Description

Must be first include.