Raptor 3.0.1
A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences
insert_into_ibf.hpp
Go to the documentation of this file.
1// --------------------------------------------------------------------------------------------------
2// Copyright (c) 2006-2023, Knut Reinert & Freie Universität Berlin
3// Copyright (c) 2016-2023, 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
13#pragma once
14
15#include <robin_hood.h>
16
17#include <seqan3/search/dream_index/interleaved_bloom_filter.hpp>
18
21
22namespace raptor::hibf
23{
24
25// automatically does naive splitting if number_of_bins > 1
26void insert_into_ibf(robin_hood::unordered_flat_set<size_t> const & kmers,
27 size_t const number_of_bins,
28 size_t const bin_index,
29 seqan3::interleaved_bloom_filter<> & ibf,
30 timer<concurrent::yes> & fill_ibf_timer);
31
32void insert_into_ibf(build_arguments const & arguments,
33 chopper_pack_record const & record,
34 seqan3::interleaved_bloom_filter<> & ibf);
35
36} // namespace raptor::hibf
Provides raptor::build_arguments.
Provides raptor::hibf::chopper_pack_record.
Must be first include.
Definition: bin_size_in_bits.hpp:18