GitHub Actions run
Wall Time
5 days ago d7a1b4b cod-711-file-name-missing-in-codspeed-rust-flamegraphCompare
Base
Search a run
Head
CompareCod 711 file name missing in codspeed rust flamegraph
#93
cod-711-file-name-missing-in-codspeed-rust-flamegraph
5 days ago
Benchmarks
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime::with_input[5]< 1 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[7]762 µs
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[1]3.6 µs
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[8192]488 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[4096]330 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[16384]818 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[2]3.9 µs
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci::Iterative21 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b::build_vec219 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci::Recursive52.3 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[18]4.1 µs
div
crates/divan_compat/examples/benches/math.rs::div3.6 µs
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[5]294.9 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[6]2.8 µs
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[1024]81 ns
fibo_10
crates/divan_compat/benches/basic_example.rs::fibo_104.5 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 20]3.3 µs
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup::small_setup1 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[8]294 ms
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 20]3.5 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted::sort_unstable109.7 µs
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[4]3.6 µs
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[2048]246 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group::bench_explicit_measurement< 1 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem_decimal[2048]246 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 0]4 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[5]3.2 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[5]9.1 µs
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[255]5.8 µs
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles::fibonacci_custom_measurement422 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[0]3.4 µs
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[20]52.3 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[4]4.4 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 10]4 µs
system_time
crates/divan_compat/examples/benches/time.rs::now::system_time4.9 µs
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::Flat10.1 ms
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[42]5.8 µs
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"::"*benchmark/" '< 1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup::iter_with_setup38 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a::sum_fold304 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[20]49.6 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[8]3.9 µs
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[10]4.9 µs
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_large_setup< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter< 1 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[10]4 µs
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[1000]2 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[5]4.7 µs
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop::large_drop169.7 µs
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[21]22 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_setup40 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[7]2 µs
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_small_input< 1 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Recursive[21]85.2 µs
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_with_large_drop< 1 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_per_iteration40 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[4]1.6 µs
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_per_iteration40 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_small_input< 1 ns
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[42]6.5 µs
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_large_input< 1 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[0]3.5 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[3]2.2 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[4]6.9 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 5]4.6 µs
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[4]3.9 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[30]6.1 ms
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::Auto3 ns
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[4]3.5 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[8]533.9 µs
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(0, 0)]5.9 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::sudoku109.7 µs
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[10]6.6 µs
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop::small_drop< 1 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[1024]3.5 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[5]21.9 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 10]6.2 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since::tsc (aarch64)1.1 µs
sort
crates/divan_compat/examples/benches/sort.rs::random::sort4.9 ms
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[42]3.5 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[6]1.3 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[65535]5.8 µs
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem::from_elem[1024]81 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[6]22.5 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::rat_in_maze[7]3.2 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[16]4 µs
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup::large_setup13 ns
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[3]2.3 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[7]249.8 ms
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[5]3.7 µs
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench::with_input[5]< 1 ns
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3::Iterative[20]21 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[30]6.6 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[9]4.3 µs
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[0]4.5 µs
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[42]6.5 µs
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[4]3.9 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[6]66.2 µs
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench::with_input[5]< 1 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench::init_array[4]3.9 µs
system_time
crates/divan_compat/examples/benches/time.rs::duration_since::system_time6.9 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[5]5.1 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(1024, -1024)]4.2 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[7]6.3 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[4]2.3 µs
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[20]5 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 5]5.8 µs
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead::iter_batched_ref_large_input< 1 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now::tsc (aarch64)3.1 µs
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[42]6.5 µs
add
crates/divan_compat/examples/benches/math.rs::add4.5 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[0]5.8 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::hamiltonian_cycle[6]5.7 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_parentheses[6]69.3 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[3]3.7 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random::sort_unstable3.3 ms
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[5]4.3 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[3]2.8 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::generate_combinations[8]3 µs
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::knight_tour[6]8.6 ms
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::permutations[5]14.1 µs
instant
crates/divan_compat/examples/benches/time.rs::duration_since::instant5.2 µs
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(255, 255)]3.4 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[5]4.5 µs
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array2[10]4.9 µs
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::find_highest_set_bit[1024]5.8 µs
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[255]3.5 µs
rem
crates/divan_compat/examples/benches/math.rs::rem3.6 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[HashMap<u64, u64>, 30]5.6 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[14]4.1 µs
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench::bench_array1[1]3.6 µs
mut_borrow
crates/divan_compat/benches/basic_example.rs::mut_borrow4 µs
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 0]3.7 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::n_queens_solver[7]125.2 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::generate_gray_code[1]2.1 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(42, 13)]3.4 µs
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive[5]4.4 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::count_set_bits[65535]3.5 µs
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode::Linear3 ns
sort
crates/divan_compat/examples/benches/sort.rs::sorted::sort137.2 µs
fibo_50
crates/divan_compat/benches/basic_example.rs::fibo_504.5 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci::recursive_memoized[BTreeMap<u64, u64>, 30]2.8 µs
instant
crates/divan_compat/examples/benches/time.rs::now::instant4.9 µs
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::subset_sum[12]3.9 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking::graph_coloring[6]4.8 µs
mul
crates/divan_compat/examples/benches/math.rs::mul5.4 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci::iterative[10]4.3 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation::add_two_integers[(65535, -65535)]4.8 µs