CodSpeedHQ
codspeed-rust
Blog
Docs
Changelog
Blog
Docs
Changelog
Overview
Branches
Benchmarks
Runs
GitHub Actions run
CPU Simulation
Uses the
CPU Simulation instrument
to collect CPU performance metrics.
8 months ago
788b13d
cod-674-collect-profiles-while-benchmarks-are-running
pull_request
This run is associated to a commit that was force-pushed
It will not be associated with its branch history. Be careful when comparing its performance to other runs.
Compare
Base
Search a run
Head
Cod 674 collect profiles while benchmarks are running
#92
cod-674-collect-profiles-while-benchmarks-are-running
8 months ago
CPU Simulation
Compare
Suggested base runs:
Pull Request Base
•
Default Branch
Benchmarks
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
240.3 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
206.4 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
79.2 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
9.7 ms
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90 ns
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
175.8 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
119.2 ns
mul
crates/divan_compat/examples/benches/math.rs
91.4 ns
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.5 µs
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
236.9 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
160.6 ns
div
crates/divan_compat/examples/benches/math.rs
124.2 ns
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
118.7 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.1 µs
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
91.7 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
93.9 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90.8 ns
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.4 µs
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
400.8 ns
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.7 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
291.2 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.4 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
24 µs
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.1 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.8 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.5 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.4 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.9 µs
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.8 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.3 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
17.2 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.9 µs
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
99.4 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
4.9 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.9 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
17.8 µs
add
crates/divan_compat/examples/benches/math.rs
91.4 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
39 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
200.7 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.6 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
24.8 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.1 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
773.4 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.1 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.4 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
6.5 ms
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.8 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
8 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.4 µs
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
13.1 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.3 µs
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
320.3 ns
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
9.7 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
219.6 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
108.3 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.6 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
10.6 µs
rem
crates/divan_compat/examples/benches/math.rs
124.4 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.2 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
12.6 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
464 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
8 ms
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
42.4 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
8.4 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
3.2 µs
tsc (x86)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
257.8 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
241.1 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
121.1 ns
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
124.1 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
834.7 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
8 µs
tsc (x86)
crates/divan_compat/examples/benches/time.rs::now
< 1 ns
instant
crates/divan_compat/examples/benches/time.rs::now
334.4 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
154.4 ns
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
4.4 µs
system_time
crates/divan_compat/examples/benches/time.rs::now
334.4 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
6 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
568.2 ms
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.6 ms
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
666.3 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90.8 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
3.5 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
9.2 µs
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
19 ms
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
154.4 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90.8 ns
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
39.9 µs
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90.8 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90.8 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
404.7 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
661.1 ms
fibo_recursive
crates/codspeed/benches/native.rs
916.7 ns
fibo_recursive_cached
crates/codspeed/benches/native.rs
6.3 µs
fibo_iterative
crates/codspeed/benches/native.rs
126.7 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
254.4 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
103.6 ns
bench_without_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::only_codspeed::bench_using_group_without_explicit_measurement::group
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench
< 1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
130.7 µs
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
103.6 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b
2.8 µs
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
105.3 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
80.9 µs
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
80.9 µs
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime
< 1 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup
< 1 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
1.9 µs
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
4.1 µs
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
1 ms
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
11.4 µs
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
7.2 µs
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
1.9 µs
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
< 1 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
916.7 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
19.6 µs
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
< 1 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
4.1 µs
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
925 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
11.4 µs
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench
225 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
225 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
90 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
90 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench
125.3 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench
90 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
125.3 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
125.3 ns
fibo_50
crates/divan_compat/benches/basic_example.rs
90.3 ns
b
crates/bencher_compat/benches/bencher_example.rs
2.8 µs
a
crates/bencher_compat/benches/bencher_example.rs
254.7 ns
a
crates/bencher_compat/benches/bencher_example.rs::c
254.7 ns
b
crates/bencher_compat/benches/bencher_example.rs::c
3.4 µs
Ignored
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
Ignored
932.5 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since
Ignored
343.9 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
536.9 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
Ignored
536.9 ns
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
Ignored
536.9 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
Ignored
536.9 ns
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
566.1 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
Ignored
374.4 ns
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
Ignored
566.1 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
Ignored
215.3 ns
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
Ignored
215.3 ns
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
1.1 µs
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
1.1 µs
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
1.1 µs
© 2025 CodSpeed Technology
Home
Terms
Privacy
Docs