Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions include/hibf/build/update_parent_kmers.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -8,9 +8,10 @@
*/
#pragma once

#include <cstdint> // for uint64_t
#include <cstdint> // for uint64_t
#include <functional> // for equal_to

#include <hibf/contrib/robin_hood.hpp> // for unordered_flat_set
#include <hibf/contrib/robin_hood.hpp> // for hash, unordered_flat_set
#include <hibf/misc/timer.hpp> // for serial_timer, concurrent_timer
#include <hibf/platform.hpp>

Expand Down
5 changes: 2 additions & 3 deletions include/hibf/hierarchical_interleaved_bloom_filter.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -4,14 +4,13 @@

#pragma once

#include <algorithm> // for __fn, fill, sort
#include <algorithm> // for __sort, fill, sort
#include <cassert> // for assert
#include <concepts> // for integral, unsigned_integral
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t, uint16_t, uint32_t
#include <limits> // for numeric_limits
#include <memory> // for addressof
#include <ranges> // for forward_range, range_value_t, range
#include <ranges> // for forward_range, integral, range, range_value_t, unsigned_integral
#include <vector> // for vector, operator==

#include <cereal/cereal.hpp> // for make_nvp
Expand Down
13 changes: 5 additions & 8 deletions include/hibf/interleaved_bloom_filter.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -11,12 +11,11 @@

#include <algorithm> // for fill
#include <array> // for array
#include <concepts> // for integral, unsigned_integral, same_as
#include <cstddef> // for size_t
#include <cstdint> // for uint16_t, uint64_t, uint32_t
#include <cstring> // for size_t
#include <memory> // for addressof
#include <ranges> // for forward_range, range_value_t, range, range_reference_t, input...
#include <type_traits> // for remove_cvref_t, false_type
#include <ranges> // for forward_range, integral, range, range_value_t, unsigned_integral
#include <type_traits> // for false_type, remove_cvref_t
#include <vector> // for vector, operator==

#include <cereal/cereal.hpp> // for make_nvp
Expand All @@ -25,20 +24,18 @@
#include <cereal/types/vector.hpp> // IWYU pragma: keep

#include <hibf/cereal/concepts.hpp> // for cereal_archive
#include <hibf/contrib/aligned_allocator.hpp> // for aligned_allocator
#include <hibf/contrib/std/enumerate_view.hpp> // for enumerate
#include <hibf/misc/bit_vector.hpp> // for bit_vector
#include <hibf/misc/counting_vector.hpp> // for counting_vector
#include <hibf/misc/next_multiple_of_64.hpp> // for next_multiple_of_64
#include <hibf/misc/unreachable.hpp> // for unreachable, assert, forward
#include <hibf/platform.hpp> // for HIBF_CONSTEXPR_VECTOR, HIBF_HAS_AVX512
#include <hibf/misc/unreachable.hpp> // for assert, unreachable, forward
#include <hibf/platform.hpp> // for HIBF_HAS_AVX512

namespace seqan::hibf
{

// config.hpp -> misc/insert_iterator.hpp (Needs interleaved_bloom_filter to be a complete class)
struct config;

/*!\brief For testing: An accessor used to inspect private members of seqan::hibf::interleaved_bloom_filter.
* \ingroup ibf
*/
Expand Down
34 changes: 16 additions & 18 deletions include/hibf/misc/bit_vector.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -21,31 +21,29 @@

#pragma once

#include <algorithm> // for __fn, for_each, copy, fill
#include <bit> // for countr_zero
#include <cassert> // for assert
#include <climits> // for CHAR_BIT
#include <compare> // for strong_ordering, operator==
#include <concepts> // for assignable_from
#include <cstddef> // for size_t, ptrdiff_t
#include <cstdint> // for uint64_t
#include <initializer_list> // for initializer_list
#include <iterator> // for iter_reference_t, __fn, back_inserter, distance, iter_differen...
#include <memory> // for allocator, allocator_traits, assume_aligned, __compressed_pair
#include <ranges> // for __fn, begin, end
#include <stdexcept> // for out_of_range
#include <string> // for char_traits, operator+, to_string, operator""s, basic_string
#include <type_traits> // for conditional_t
#include <utility> // for swap
#include <vector> // for vector
#include <algorithm> // for initializer_list, __for_each, for_each, __fill, copy, fill
#include <bit> // for popcount, countr_zero
#include <cassert> // for assert
#include <climits> // for CHAR_BIT
#include <compare> // for strong_ordering, operator==
#include <cstddef> // for size_t, ptrdiff_t
#include <cstdint> // for uint64_t
#include <iterator> // for iter_reference_t, __next, distance, iter_difference_t, iter_va...
#include <memory> // for allocator, allocator_traits, assume_aligned, _LIBCPP_COMPRESSE...
#include <ranges> // for __fn, begin, end
#include <stdexcept> // for out_of_range
#include <string> // for char_traits, operator+, operator""s, basic_string, to_string
#include <type_traits> // for conditional_t
#include <utility> // for swap
#include <vector> // for vector

#include <cereal/cereal.hpp> // for binary_data
#include <cereal/macros.hpp> // for CEREAL_LOAD_FUNCTION_NAME, CEREAL_SAVE_FUNCTION_NAME
#include <cereal/specialize.hpp> // for specialization, specialize

#include <hibf/cereal/concepts.hpp> // for cereal_archive, cereal_text_archive
#include <hibf/contrib/aligned_allocator.hpp> // for aligned_allocator
#include <hibf/platform.hpp> // for HIBF_CONSTEXPR_VECTOR, _LIBCPP_VERSION
#include <hibf/platform.hpp> // for _LIBCPP_VERSION

namespace seqan::hibf
{
Expand Down
4 changes: 2 additions & 2 deletions include/hibf/misc/counting_vector.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,10 @@
#include <bit> // for countr_zero
#include <climits> // for CHAR_BIT
#include <concepts> // for integral
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t, uint8_t
#include <cstring> // for size_t
#include <functional> // for minus, plus
#include <type_traits> // for conditional, conditional_t
#include <type_traits> // for conditional_t
#include <vector> // for vector

#include <hibf/contrib/aligned_allocator.hpp> // for aligned_allocator
Expand Down
5 changes: 2 additions & 3 deletions include/hibf/misc/timer.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -12,11 +12,10 @@
#include <algorithm> // for max
#include <atomic> // for atomic, memory_order_relaxed
#include <cassert> // for assert
#include <chrono> // for duration, time_point, operator-, operator<=>, steady_clock
#include <compare> // for operator>=, _CmpUnspecifiedParam, strong_ordering
#include <chrono> // for time_point, duration, operator-, operator<=>, steady_clock
#include <compare> // for _CmpUnspecifiedParam, operator>=, strong_ordering
#include <concepts> // for same_as
#include <cstdint> // for uint64_t
#include <ratio> // for ratio

#include <hibf/platform.hpp>

Expand Down
17 changes: 9 additions & 8 deletions src/build/construct_ibf.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,20 +2,21 @@
// SPDX-FileCopyrightText: 2016-2026, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause

#include <cassert> // for assert
#include <cmath> // for ceil
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t
#include <vector> // for vector
#include <cassert> // for assert
#include <cmath> // for ceil
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t
#include <functional> // for equal_to
#include <vector> // for vector

#include <hibf/build/bin_size_in_bits.hpp> // for bin_size_in_bits
#include <hibf/build/bin_size_in_bits.hpp> // for bin_size_parameters, bin_size_in_bits
#include <hibf/build/build_data.hpp> // for build_data
#include <hibf/build/construct_ibf.hpp> // for construct_ibf
#include <hibf/build/insert_into_ibf.hpp> // for insert_into_ibf
#include <hibf/build/update_parent_kmers.hpp> // for update_parent_kmers
#include <hibf/config.hpp> // for config
#include <hibf/contrib/robin_hood.hpp> // for unordered_flat_set
#include <hibf/interleaved_bloom_filter.hpp> // for interleaved_bloom_filter, bin_count, bin_size, hash_function_c...
#include <hibf/contrib/robin_hood.hpp> // for unordered_flat_set, hash
#include <hibf/interleaved_bloom_filter.hpp> // for bin_count, bin_size, interleaved_bloom_filter, empty_bin_fraction
#include <hibf/layout/graph.hpp> // for graph
#include <hibf/misc/divide_and_ceil.hpp> // for divide_and_ceil
#include <hibf/misc/timer.hpp> // for serial_timer, concurrent_timer
Expand Down
7 changes: 3 additions & 4 deletions src/build/insert_into_ibf.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,19 +2,18 @@
// SPDX-FileCopyrightText: 2016-2026, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause

#include <algorithm> // for __fn, all_of, fill_n
#include <algorithm> // for __all_of, __fill_n, all_of, fill_n
#include <cassert> // for assert
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t
#include <functional> // for equal_to, function
#include <iterator> // for counted_iterator
#include <ranges> // for subrange
#include <ranges> // for subrange, counted_iterator
#include <vector> // for vector

#include <hibf/build/build_data.hpp> // for build_data
#include <hibf/build/insert_into_ibf.hpp> // for insert_into_ibf
#include <hibf/config.hpp> // for insert_iterator, config
#include <hibf/contrib/robin_hood.hpp> // for Table, unordered_flat_set, hash
#include <hibf/contrib/robin_hood.hpp> // for Table, hash, unordered_flat_set
#include <hibf/contrib/std/chunk_view.hpp> // for chunk_view, chunk, chunk_fn
#include <hibf/interleaved_bloom_filter.hpp> // for interleaved_bloom_filter, bin_index
#include <hibf/layout/layout.hpp> // for layout
Expand Down
11 changes: 6 additions & 5 deletions src/config.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -6,14 +6,15 @@
#include <cmath> // for ceil, sqrt
#include <cstddef> // for size_t
#include <functional> // for function
#include <iostream> // for operator<<, basic_ostream, basic_istream, getline, stringstream
#include <iostream> // for basic_ostream, basic_istream, operator<<, stringstream, cerr
#include <sstream> // for basic_stringstream
#include <stdexcept> // for invalid_argument
#include <string> // for char_traits, basic_string, string
#include <string_view> // for basic_string_view, operator==, string_view
#include <string> // for char_traits, basic_string, getline, operator<<, string
#include <string_view> // for basic_string_view, operator==, operator<<, string_view

#include <cereal/archives/json.hpp> // for epilogue, prologue, JSONInputArchive, JSONOutputArchive
#include <cereal/cereal.hpp> // for make_nvp
#include <cereal/archives/json.hpp> // for epilogue, prologue, load, JSONInputArchive, JSONOutputArchive
#include <cereal/cereal.hpp> // for make_nvp
#include <cereal/details/helpers.hpp> // for NameValuePair

#include <hibf/config.hpp> // for config
#include <hibf/layout/prefixes.hpp> // for meta_header, meta_hibf_config_end, meta_hibf_config_start
Expand Down
25 changes: 13 additions & 12 deletions src/hierarchical_interleaved_bloom_filter.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,16 +2,17 @@
// SPDX-FileCopyrightText: 2016-2026, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause

#include <algorithm> // for shuffle, __none_of, none_of
#include <cassert> // for assert
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t
#include <mutex> // for mutex, lock_guard
#include <numeric> // for iota
#include <optional> // for optional
#include <random> // for random_device, mt19937_64
#include <utility> // for move
#include <vector> // for vector, erase
#include <algorithm> // for __none_of, none_of, shuffle
#include <cassert> // for assert
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t
#include <functional> // for equal_to
#include <mutex> // for mutex, lock_guard
#include <numeric> // for iota
#include <optional> // for optional
#include <random> // for random_device, mt19937_64
#include <utility> // for move
#include <vector> // for vector, erase

#include <hibf/build/build_data.hpp> // for build_data
#include <hibf/build/compute_kmers.hpp> // for compute_kmers
Expand All @@ -20,10 +21,10 @@
#include <hibf/build/update_parent_kmers.hpp> // for update_parent_kmers
#include <hibf/build/update_user_bins.hpp> // for update_user_bins
#include <hibf/config.hpp> // for config
#include <hibf/contrib/robin_hood.hpp> // for unordered_flat_set
#include <hibf/contrib/robin_hood.hpp> // for hash, unordered_flat_set
#include <hibf/hierarchical_interleaved_bloom_filter.hpp> // for hierarchical_interleaved_bloom_filter, merged
#include <hibf/interleaved_bloom_filter.hpp> // for interleaved_bloom_filter
#include <hibf/layout/compute_fpr_correction.hpp> // for compute_fpr_correction
#include <hibf/layout/compute_fpr_correction.hpp> // for fpr_correction_parameters, compute_fpr_correction
#include <hibf/layout/compute_layout.hpp> // for compute_layout
#include <hibf/layout/graph.hpp> // for graph
#include <hibf/layout/layout.hpp> // for layout
Expand Down
15 changes: 7 additions & 8 deletions src/layout/graph.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,14 +2,13 @@
// SPDX-FileCopyrightText: 2016-2026, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause

#include <algorithm> // for max, __is_sorted, __sort, is_sorted, sort
#include <cassert> // for assert
#include <cstddef> // for size_t
#include <functional> // for less
#include <initializer_list> // for initializer_list
#include <iterator> // for __prev, prev
#include <optional> // for optional, nullopt, nullopt_t
#include <vector> // for vector
#include <algorithm> // for initializer_list, max, __is_sorted, __sort, is_sorted, sort
#include <cassert> // for assert
#include <cstddef> // for size_t
#include <functional> // for less
#include <iterator> // for __prev, prev
#include <optional> // for optional, nullopt, nullopt_t
#include <vector> // for vector

#include <hibf/layout/graph.hpp> // for graph
#include <hibf/layout/layout.hpp> // for layout
Expand Down
11 changes: 5 additions & 6 deletions src/misc/print.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,12 +2,11 @@
// SPDX-FileCopyrightText: 2016-2026, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause

#include <cstddef> // for size_t
#include <cstdint> // for uint16_t, int16_t, int8_t, uint64_t, uint8_t, int32_t, int64_t, uin...
#include <iostream> // for ostream, basic_ostream, operator<<
#include <ranges> // for range_value_t, empty
#include <type_traits> // for conditional
#include <vector> // for vector
#include <cstddef> // for size_t
#include <cstdint> // for uint16_t, int16_t, int8_t, uint64_t, uint8_t, int32_t, int64_t, uin...
#include <iostream> // for ostream, basic_ostream, operator<<
#include <ranges> // for empty, range_value_t
#include <vector> // for vector

#include <hibf/misc/bit_vector.hpp> // for bit_vector
#include <hibf/misc/counting_vector.hpp> // for counting_vector
Expand Down
25 changes: 13 additions & 12 deletions src/sketch/toolbox.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2,18 +2,19 @@
// SPDX-FileCopyrightText: 2016-2026, Knut Reinert & MPI für molekulare Genetik
// SPDX-License-Identifier: BSD-3-Clause

#include <algorithm> // for sort
#include <cassert> // for assert
#include <cmath> // for floor, sqrt
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t, int64_t
#include <limits> // for numeric_limits
#include <omp.h> // for omp_get_thread_num
#include <random> // for uniform_int_distribution, mt19937_64
#include <utility> // for swap, move
#include <vector> // for vector

#include <hibf/contrib/robin_hood.hpp> // for unordered_flat_map
#include <algorithm> // for sort
#include <cassert> // for assert
#include <cmath> // for floor, sqrt
#include <cstddef> // for size_t
#include <cstdint> // for uint64_t, int64_t
#include <functional> // for equal_to
#include <limits> // for numeric_limits
#include <omp.h> // for omp_get_thread_num
#include <random> // for uniform_int_distribution, mt19937_64
#include <utility> // for swap, move
#include <vector> // for vector

#include <hibf/contrib/robin_hood.hpp> // for hash, unordered_flat_map
#include <hibf/sketch/hyperloglog.hpp> // for hyperloglog
#include <hibf/sketch/toolbox.hpp> // for clustering_node, entry, neighbor, prio_queue, distance_matrix, cluste...

Expand Down
8 changes: 3 additions & 5 deletions test/include/hibf/test/expect_range_eq.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -9,13 +9,11 @@

#pragma once

#include <gtest/gtest.h> // for EXPECT_PRED_FORMAT2, AssertionSuccess, AssertionResult, CmpHelperEQFailure
#include <gtest/gtest.h> // for EXPECT_PRED_FORMAT2, AssertionResult, AssertionSuccess, CmpHelperEQFailure

#include <algorithm> // for copy, equal
#include <concepts> // for same_as
#include <iterator> // for back_inserter
#include <ostream> // for operator<<, ostream
#include <ranges> // for range, range_value_t
#include <ostream> // for basic_ostream, operator<<, ostream
#include <ranges> // for range, range_value_t, back_inserter, same_as
#include <utility> // for forward
#include <vector> // for vector

Expand Down
9 changes: 4 additions & 5 deletions test/include/hibf/test/expect_same_type.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -9,15 +9,14 @@

#pragma once

#include <gtest/gtest.h> // for EXPECT_PRED_FORMAT2, AssertionSuccess, AssertionResult, CmpHelperEQFailure
#include <gtest/gtest.h> // for EXPECT_PRED_FORMAT2, AssertionResult, AssertionSuccess, CmpHelp...

#include <cassert> // for assert
#include <cstddef> // for size_t
#include <string> // for string, allocator
#include <tuple> // for tuple
#include <type_traits> // for type_identity
#include <string> // for basic_string, string
#include <type_traits> // for type_identity, is_same_v

#include <hibf/test/type_name_as_string.hpp> // IWYU pragma: keep
#include <hibf/test/type_name_as_string.hpp> // for type_name_as_string

namespace seqan::hibf::test
{
Expand Down
6 changes: 2 additions & 4 deletions test/include/hibf/test/iterator_test_template.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -6,13 +6,11 @@

#pragma once

#include <gtest/gtest.h> // for Message, AssertionResult, TestPartResult, EXPECT_TRUE, EXPECT_EQ, EXPECT_FALSE, Typ...
#include <gtest/gtest.h> // for Message, AssertionResult, TestPartResult, EXPECT_TRUE, EXPECT_EQ, EXPECT_FALSE, TYP...

#include <concepts> // for derived_from, same_as, copy_constructible, equality_comparable_with
#include <cstddef> // for size_t
#include <iterator> // for next, random_access_iterator_tag, forward_iterator_tag, input_iterator, distance
#include <memory> // for to_address, addressof
#include <ranges> // for begin, cbegin, end, cend, iterator_t, range_difference_t
#include <ranges> // for begin, cbegin, next, derived_from, end, cend, random_access_iterator_tag, forward_i...
#include <string_view> // for basic_string_view
#include <type_traits> // for remove_reference_t, conditional_t
#include <utility> // for as_const, forward, pair
Expand Down
5 changes: 2 additions & 3 deletions test/include/hibf/test/type_name_as_string.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -16,9 +16,8 @@
#include <cstdlib> // for free
#include <functional> // for function
#include <memory> // for allocator, unique_ptr, addressof
#include <string> // for char_traits, basic_string, operator+, string, to_string
#include <tuple> // for tuple
#include <type_traits> // for remove_reference_t, is_const_v, is_lvalue_reference_v, is_rvalue_reference_v
#include <string> // for basic_string, char_traits, operator+, string, to_string
#include <type_traits> // for is_const_v, is_lvalue_reference_v, is_rvalue_reference_v, remove_reference_t
#include <typeinfo> // for type_info

#include <hibf/platform.hpp>
Expand Down
Loading
Loading