CodSpeedHQ
codspeed-rust
Blog
Docs
Changelog
Blog
Docs
Changelog
Overview
Branches
Benchmarks
Runs
GitHub Actions run
Wall Time
Wall Time
Uses the
Wall Time instrument
to collect wall time performance metrics.
2 days ago
8054636
simplify-instrument-hooks
pull_request
Compare
Base
Search a run
Head
fix(codspeed): always compile instrument-hooks (with stubs)
#132
simplify-instrument-hooks
2 days ago
Wall Time
Compare
Suggested base runs:
Pull Request Base
•
Parent Commit
Benchmarks
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
76 µs
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
10.1 ms
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
952 ns
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
40 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
40 ns
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
47.5 µs
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime
< 1 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
21 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b
208 ns
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup
20 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 ns
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
534 ns
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
21 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
306 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
83 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
44 ns
sleep_1ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
1.1 ms
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
sleep_50ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
50.1 ms
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
47.4 µs
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
44 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench
< 1 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
2 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
53 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
263 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
83 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
423 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
260 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
22 ns
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
798.9 µs
sleep_10ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
10.1 ms
sleep_100ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
100.1 ms
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
40 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
44 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
339 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.2 µs
instant
crates/divan_compat/examples/benches/time.rs::now
38 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
289.4 ms
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
20.7 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
162.2 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.8 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
636 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
824 ns
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
917 ns
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
62 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
827 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.8 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
248.4 ms
sort
crates/divan_compat/examples/benches/sort.rs::random
4.9 ms
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
1.1 ms
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3 µs
div
crates/divan_compat/examples/benches/math.rs
3 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
161 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
add
crates/divan_compat/examples/benches/math.rs
2 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
38 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.1 ms
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
74 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
506.5 µs
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
8 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
34 ns
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
300.4 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
119.2 µs
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.2 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
992 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.7 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.9 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
130.8 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
581 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
1.1 µs
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
19 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
22.5 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4 µs
system_time
crates/divan_compat/examples/benches/time.rs::now
38 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
294 ns
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
19 ns
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
221 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.1 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.7 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
63.2 µs
instant
crates/divan_compat/examples/benches/time.rs::duration_since
10 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
908 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
49.8 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
9.3 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
17.5 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
66 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.6 ms
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
791 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
599 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.5 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.5 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.3 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
3.3 ms
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
13 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
2.4 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
914 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
5 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
mul
crates/divan_compat/examples/benches/math.rs
2 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
119.4 µs
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
416 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
14 ns
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
962 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
51 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
62.4 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
965 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
2 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.1 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
69.1 µs
rem
crates/divan_compat/examples/benches/math.rs
3 ns
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
66.9 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
3 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
794.8 µs
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.2 µs
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
707 ns
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
108.9 µs
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench
9 ns
sleep_1ms
crates/divan_compat/benches/sleep_benches.rs
1.1 ms
sleep_10ms
crates/divan_compat/benches/sleep_benches.rs
10 ms
fib_in_thread_bench[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
fib_in_thread[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
fibo_50
crates/divan_compat/benches/basic_example.rs
2 ns
sleep_100ms_with_custom_sample
crates/divan_compat/benches/sleep_benches.rs
100.1 ms
fib_in_thread_bench[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
fib_in_thread[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
sleep_50ms
crates/divan_compat/benches/sleep_benches.rs
50.1 ms
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
2 ns
bench_large_input_local
crates/divan_compat/benches/drop_example.rs
50.4 ms
fib_in_thread_bench[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
bench_large_input
crates/divan_compat/benches/drop_example.rs
50.5 ms
fib_in_thread_bench_local[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
sleep_100ms
crates/divan_compat/benches/sleep_benches.rs
100.1 ms
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
fib_in_thread_bench_local[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
9 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
2.1 µs
fib_20
crates/divan_compat/benches/fib_example.rs
45.6 µs
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
fib_in_thread_bench_local[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
fib_10
crates/divan_compat/benches/fib_example.rs
376 ns
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
7 ns
fib_30
crates/divan_compat/benches/fib_example.rs
5.6 ms
fib_in_thread[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
© 2025 CodSpeed Technology
Home
Terms
Privacy
Docs