Skip to content

Commit

Permalink
small stuff
Browse files Browse the repository at this point in the history
  • Loading branch information
eseiler committed Oct 7, 2023
1 parent 7c2a7a3 commit 2c3858d
Showing 1 changed file with 5 additions and 5 deletions.
10 changes: 5 additions & 5 deletions src/display_layout/sizes.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -137,17 +137,17 @@ size_t hierarchical_stats(stats & stats_data,
{
auto & child = current_node.children[index];

robin_hood::unordered_flat_set<uint64_t> kmers{};
hierarchical_stats(stats_data, kmers, child, data, current_hibf_level + 1u);
robin_hood::unordered_flat_set<uint64_t> kmers2{};
hierarchical_stats(stats_data, kmers2, child, data, current_hibf_level + 1u);

if (current_hibf_level > 0 /* not top level */)
{
std::lock_guard<std::mutex> guard{merge_kmer_mutex};
update_parent_kmers(parent_kmers, kmers);
update_parent_kmers(parent_kmers, kmers2);
}

size_waste_per_tb[child.parent_bin_index] =
amount_of_max_bin_kmers - std::min(amount_of_max_bin_kmers, kmers.size());
amount_of_max_bin_kmers - std::min(amount_of_max_bin_kmers, kmers2.size());
}
}

Expand Down Expand Up @@ -251,7 +251,7 @@ void execute_general_stats(config const & cfg)
std::vector<double> load_factor_per_level(number_of_levels);
std::vector<size_t> num_ibfs_per_level(number_of_levels);

for (size_t i = 0; i < stats_data.ibf_sizes.size(); ++i)
for (size_t i = 0; i < number_of_ibfs; ++i)
{
size_t const ibf_level{stats_data.ibf_levels[i]};
size_per_level[ibf_level] += stats_data.ibf_sizes[i];
Expand Down

0 comments on commit 2c3858d

Please sign in to comment.