Skip to content

Commit

Permalink
Fix broken minimal_tree_random_gets benchmarks for N48 and N256
Browse files Browse the repository at this point in the history
Due to a type only N16 random key positions were used! Thank you MSVC static
analysis for not pointing out this bug but for showing something else close to
the hardcoded 16, so finally noticed it.
  • Loading branch information
laurynas-biveinis committed Jan 21, 2022
1 parent 56260e5 commit 13fe8f4
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion benchmark/micro_benchmark_node_utils.hpp
Expand Up @@ -1003,7 +1003,7 @@ void minimal_tree_random_gets(::benchmark::State &state) {
key_limit);
const auto tree_size = test_db.get_current_memory_use();
batched_prng random_key_positions{
node_count * detail::node_capacity_to_minimum_size<16>() - 1};
node_count * detail::node_capacity_to_minimum_size<NodeSize>() - 1};
std::int64_t items_processed = 0;

for (auto _ : state) {
Expand Down

0 comments on commit 13fe8f4

Please sign in to comment.