[MISC] automatic linting

seqan · Oct 16, 2023 · e5351a1 · e5351a1
1 parent ca37ca5
commit e5351a1
Show file tree

Hide file tree

Showing 2 changed files with 16 additions and 16 deletions.
diff --git a/include/hibf/layout/hierarchical_binning.hpp b/include/hibf/layout/hierarchical_binning.hpp
@@ -121,17 +121,17 @@ class hierarchical_binning
                    std::vector<std::vector<std::pair<size_t, size_t>>> & trace);
 
     void backtrack_merged_bin(size_t trace_j,
-                                                    size_t const next_j,
-                                                    size_t const bin_id,
-                                                    size_t & high_level_max_id,
-                                                    size_t & high_level_max_size,
-                                                    bool is_first_row = false);
+                              size_t const next_j,
+                              size_t const bin_id,
+                              size_t & high_level_max_id,
+                              size_t & high_level_max_size,
+                              bool is_first_row = false);
 
     void backtrack_split_bin(size_t trace_j,
-                                                size_t const number_of_bins,
-                                                size_t const bin_id,
-                                                size_t & high_level_max_id,
-                                                size_t & high_level_max_size);
+                             size_t const number_of_bins,
+                             size_t const bin_id,
+                             size_t & high_level_max_id,
+                             size_t & high_level_max_size);
 
     //!\brief Backtracks the trace matrix and writes the resulting binning into the output file.
     size_t backtracking(std::vector<std::vector<std::pair<size_t, size_t>>> const & trace);

diff --git a/src/layout/hierarchical_binning.cpp b/src/layout/hierarchical_binning.cpp
@@ -267,18 +267,18 @@ void hierarchical_binning::backtrack_merged_bin(size_t trace_j,
 }
 
 void hierarchical_binning::backtrack_split_bin(size_t trace_j,
-                                                size_t const number_of_bins,
-                                                size_t const bin_id,
-                                                size_t & high_level_max_id,
-                                                size_t & high_level_max_size)
+                                               size_t const number_of_bins,
+                                               size_t const bin_id,
+                                               size_t & high_level_max_id,
+                                               size_t & high_level_max_size)
 {
     size_t kmer_count = (*data->kmer_counts)[data->positions[trace_j]];
     size_t const kmer_count_per_bin = (kmer_count + number_of_bins - 1) / number_of_bins; // round up
 
     data->hibf_layout->user_bins.emplace_back(data->previous.bin_indices,
-                                                bin_id,
-                                                number_of_bins,
-                                                data->positions[trace_j]);
+                                              bin_id,
+                                              number_of_bins,
+                                              data->positions[trace_j]);
 
     // std::cout << "split " << trace_j << " into " << number_of_bins << ": " << kmer_count_per_bin << std::endl;