[MISC] IWYU

include/hibf/misc/divide_and_ceil.hpp

@@ -4,10 +4,9 @@
 
 #pragma once
 
-#include <cassert>
-#include <concepts>
-#include <cstddef> // for size_t
-#include <limits>
+#include <cassert>  // for assert
+#include <concepts> // for unsigned_integral
+#include <cstddef>  // for size_t
 
 #include <hibf/platform.hpp>
 

src/build/construct_ibf.cpp

@@ -2,6 +2,7 @@
 // SPDX-FileCopyrightText: 2016-2023, Knut Reinert & MPI für molekulare Genetik
 // SPDX-License-Identifier: BSD-3-Clause
 
+#include <cassert>   // for assert
 #include <cinttypes> // for uint64_t
 #include <cmath>     // for ceil
 #include <cstddef>   // for size_t
@@ -14,7 +15,7 @@
 #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_fun...
+#include <hibf/interleaved_bloom_filter.hpp>  // for interleaved_bloom_filter, bin_count, bin_size, hash_function_c...
 #include <hibf/layout/graph.hpp>              // for graph
 #include <hibf/misc/divide_and_ceil.hpp>      // for divide_and_ceil
 #include <hibf/misc/timer.hpp>                // for concurrent, timer

src/layout/graph.cpp

@@ -2,12 +2,13 @@
 // SPDX-FileCopyrightText: 2016-2023, Knut Reinert & MPI für molekulare Genetik
 // SPDX-License-Identifier: BSD-3-Clause
 
-#include <algorithm> // for max, copy
-#include <cassert>   // for assert
-#include <cstddef>   // for size_t
-#include <optional>  // for nullopt, optional
-#include <ranges>    // for __prev_fn, prev
-#include <vector>    // for vector
+#include <algorithm>        // for max, copy
+#include <cassert>          // for assert
+#include <cstddef>          // for size_t
+#include <initializer_list> // for initializer_list
+#include <optional>         // for optional, nullopt
+#include <ranges>           // for __prev_fn, prev
+#include <vector>           // for vector
 
 #include <hibf/layout/graph.hpp>  // for graph
 #include <hibf/layout/layout.hpp> // for layout

test/performance/example/example_benchmark.cpp

@@ -2,11 +2,12 @@
 // SPDX-FileCopyrightText: 2016-2023, Knut Reinert & MPI für molekulare Genetik
 // SPDX-License-Identifier: BSD-3-Clause
 
-#include <benchmark/benchmark.h>
+#include <benchmark/benchmark.h> // for State, Benchmark, Counter, BENCHMARK, BENCHMARK_MAIN
 
-#include <algorithm>
-#include <cstring>
-#include <vector>
+#include <algorithm> // for copy, fill_n, copy_n
+#include <cstring>   // for memset, size_t
+#include <string>    // for basic_string
+#include <vector>    // for allocator, vector
 
 inline benchmark::Counter bytes_per_second(size_t bytes)
 {

test/performance/hibf/hierarchical_interleaved_bloom_filter_benchmark.cpp

@@ -11,10 +11,11 @@
 #include <ranges>     // for _Size, size
 #include <span>       // for span
 #include <stdexcept>  // for invalid_argument
+#include <string>     // for basic_string
 #include <tuple>      // for make_tuple
 #include <vector>     // for allocator, vector
 
-#include <hibf/config.hpp>                                // for config, insert_iterator
+#include <hibf/config.hpp>                                // for insert_iterator, config
 #include <hibf/hierarchical_interleaved_bloom_filter.hpp> // for hierarchical_interleaved_bloom_filter
 
 inline benchmark::Counter hashes_per_second(size_t const count)

test/performance/ibf/binning_bitvector_benchmark.cpp

@@ -8,9 +8,9 @@
 #include <cinttypes>  // for uint64_t
 #include <cstddef>    // for size_t
 #include <functional> // for identity
-#include <memory>     // for allocator
+#include <vector>     // for allocator, vector
 
-#include <hibf/interleaved_bloom_filter.hpp> // for interleaved_bloom_filter
+#include <hibf/interleaved_bloom_filter.hpp> // for binning_bitvector
 
 #include <sdsl/int_vector.hpp> // for operator-
 

test/performance/ibf/interleaved_bloom_filter_benchmark.cpp

@@ -9,11 +9,12 @@
 #include <limits>    // for numeric_limits
 #include <random>    // for uniform_int_distribution, mt19937_64
 #include <ranges>    // for transform_view, all_t, iota_view, _Partial, _Transform
+#include <string>    // for basic_string
 #include <tuple>     // for make_tuple
 #include <vector>    // for vector, allocator
 
 #include <hibf/contrib/std/detail/adaptor_base.hpp> // for operator|
-#include <hibf/contrib/std/pair.hpp>                // for operator==
+#include <hibf/contrib/std/pair.hpp>                // for operator==, pair
 #include <hibf/contrib/std/to.hpp>                  // for to
 #include <hibf/contrib/std/zip_view.hpp>            // for zip_view, operator==, zip, zip_fn
 #include <hibf/interleaved_bloom_filter.hpp>        // for bin_index, interleaved_bloom_filter, bin_count, bin_size

test/unit/hibf/build/bin_size_in_bits_test.cpp

@@ -2,13 +2,11 @@
 // SPDX-FileCopyrightText: 2016-2023, Knut Reinert & MPI für molekulare Genetik
 // SPDX-License-Identifier: BSD-3-Clause
 
-#include <gtest/gtest.h> // for Message, TestPartResult, EXPECT_EQ, Test, ASSERT_EQ, TestInfo, TEST
+#include <gtest/gtest.h> // for Test, TestInfo, EXPECT_EQ, Message, TEST, TestPartResult
 
-#include <cstddef>  // for size_t
-#include <optional> // for optional
-#include <vector>   // for vector, allocator
+#include <vector> // for allocator
 
-#include <hibf/build/bin_size_in_bits.hpp> // for graph
+#include <hibf/build/bin_size_in_bits.hpp> // for bin_size_in_bits
 
 TEST(bin_size_in_bits_test, general)
 {