fastq_to_fasta
A template for creation of SeqAn3 apps, with a FASTQ to FASTA example app.
insert_into_ibf.hpp
Go to the documentation of this file.
1 // --------------------------------------------------------------------------------------------------
2 // Copyright (c) 2006-2022, Knut Reinert & Freie Universität Berlin
3 // Copyright (c) 2016-2022, Knut Reinert & MPI für molekulare Genetik
4 // This file may be used, modified and/or redistributed under the terms of the 3-clause BSD-License
5 // shipped with this file and also available at: https://github.com/seqan/raptor/blob/main/LICENSE.md
6 // --------------------------------------------------------------------------------------------------
7 
8 #pragma once
9 
10 #include <robin_hood.h>
11 
12 #include <seqan3/search/dream_index/interleaved_bloom_filter.hpp>
13 
16 
17 namespace raptor::hibf
18 {
19 
20 // automatically does naive splitting if number_of_bins > 1
21 void insert_into_ibf(robin_hood::unordered_flat_set<size_t> & parent_kmers,
22  robin_hood::unordered_flat_set<size_t> const & kmers,
23  size_t const number_of_bins,
24  size_t const bin_index,
25  seqan3::interleaved_bloom_filter<> & ibf,
26  bool is_root);
27 
28 void insert_into_ibf(build_arguments const & arguments,
29  chopper_pack_record const & record,
30  seqan3::interleaved_bloom_filter<> & ibf);
31 
32 } // namespace raptor::hibf
Must be first include.
Definition: bin_prefixes.hpp:13
void insert_into_ibf(robin_hood::unordered_flat_set< size_t > &parent_kmers, 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, bool is_root)
Definition: insert_into_ibf.cpp:18
seqan3::interleaved_bloom_filter< seqan3::data_layout::uncompressed > ibf
Definition: index.hpp:22