CodSpeedHQ
codspeed-rust
BlogDocsChangelog

GitHub Actions run

3 days ago e5597da main push

Compare

Base
Search a run
Head
main
e5597da
3 days ago
Wall TimeCPU Simulation
Compare
Suggested base runs:

Benchmarks

"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
21 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
52.5 µs
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
36 ns
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
549 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
370 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime
< 1 ns
iter_with_large_setup
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/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
sleep_1ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
1.1 ms
sleep_50ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
50.1 ms
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
22 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
2 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
80 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
305 ns
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
825.6 µs
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
10.1 ms
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
251 ns
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
21 ns
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup
19 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b
226 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
973 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
36 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
36 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench
< 1 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
238 ns
sleep_10ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
10.1 ms
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
36 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
80 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
85.2 µs
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
348 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
46 ns
sleep_100ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
100.1 ms
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
36 ns
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
52.6 µs
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 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
36 ns
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.8 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.9 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.1 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
75 ns
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
2 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
22.7 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
158 ns
rem
crates/divan_compat/examples/benches/math.rs
3 ns
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
69.7 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
15.3 µs
instant
crates/divan_compat/examples/benches/time.rs::now
38 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
51 ns
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
67.3 µs
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.2 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
208 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
67 ns
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
929 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
7 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
506.5 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
118.8 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
20 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.4 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.3 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
49.8 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
130.6 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.2 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since
10 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
14 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.1 ms
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
1.1 µs
system_time
crates/divan_compat/examples/benches/time.rs::now
38 ns
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1 µs
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
289.4 ms
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
5.1 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.3 µ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
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
935 ns
add
crates/divan_compat/examples/benches/math.rs
2 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
3.3 ms
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
61.2 µs
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
725 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
10.1 µs
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
416 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.1 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.7 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
971 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
119.6 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.5 µs
div
crates/divan_compat/examples/benches/math.rs
3 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
20 ns
graph_coloring[3]
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
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
247.8 ms
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
20.5 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
161.7 µs
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
300.3 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
959 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
63.1 µs
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
3 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
62.3 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
560 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.6 ms
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.9 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
2.4 µs
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
635 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
34 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
602 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
989 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
108.9 µs
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
284 ns
sort
crates/divan_compat/examples/benches/sort.rs::random
4.9 ms
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
839 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
38 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
807.8 µs
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
13 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.8 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
761 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
2.1 µs
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
fib_in_thread[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
sleep_10ms
crates/divan_compat/benches/sleep_benches.rs
10.1 ms
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
bench_large_input_local
crates/divan_compat/benches/drop_example.rs
50.4 ms
fibo_50
crates/divan_compat/benches/basic_example.rs
2 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
9 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1 ns
fib_10
crates/divan_compat/benches/fib_example.rs
376 ns
fib_in_thread_bench[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
sleep_100ms
crates/divan_compat/benches/sleep_benches.rs
100.1 ms
fib_20
crates/divan_compat/benches/fib_example.rs
45.6 µs
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench
9 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
fib_30
crates/divan_compat/benches/fib_example.rs
5.6 ms
bench_large_input
crates/divan_compat/benches/drop_example.rs
50.5 ms
mut_borrow
crates/divan_compat/benches/basic_example.rs
7 ns
sleep_100ms_with_custom_sample
crates/divan_compat/benches/sleep_benches.rs
100.1 ms
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
sleep_1ms
crates/divan_compat/benches/sleep_benches.rs
1.1 ms
fib_in_thread_bench[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
fib_in_thread_bench_local[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
fib_in_thread_bench_local[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
fib_in_thread[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
fib_in_thread_bench_local[30]
crates/divan_compat/benches/thread_example.rs
6.7 ms
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
2 ns
sleep_50ms
crates/divan_compat/benches/sleep_benches.rs
50.1 ms
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
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
add
crates/divan_compat/examples/benches/math.rs
120.6 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.6 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
148.3 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
206.4 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
8.1 µs
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
8.3 µs
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
236.9 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
9.7 ms
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
5 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1 µs
div
crates/divan_compat/examples/benches/math.rs
95 ns
rem
crates/divan_compat/examples/benches/math.rs
95.3 ns
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.4 µs
mul
crates/divan_compat/examples/benches/math.rs
120.6 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
79.2 µs
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
160.6 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.4 µs
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
175.8 ns
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
240.3 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.3 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
241.1 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
6.5 ms
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
13 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
8.2 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.7 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
8.1 ms
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.9 µs
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.9 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
464 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
9.5 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
117.1 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
21.6 µs
subset_sum[18]
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
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
121.1 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
289.5 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
154.4 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
90 ns
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
15.7 µs
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.1 µs
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
93.9 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
121.1 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
121.1 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
342.5 ns
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
120.4 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
154.4 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
3 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
257.8 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
320.3 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
108.3 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
121.1 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
99.4 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
2.6 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
9.6 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
404.8 µs
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
121.1 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.1 µs
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
536.9 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
160.4 µs
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7.8 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
536.9 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
536.9 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.5 µs
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
536.9 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
536.9 ns
tsc (x86)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
tsc (x86)
crates/divan_compat/examples/benches/time.rs::now
< 1 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
17.8 µs
instant
crates/divan_compat/examples/benches/time.rs::now
363.6 ns
system_time
crates/divan_compat/examples/benches/time.rs::now
363.6 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
31.9 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.4 µs
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
45 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.5 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
33.7 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.2 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.8 µs
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
19 ms
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
665.9 µs
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.3 ms
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
661.1 ms
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.7 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
3.5 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
568.2 ms
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.3 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
3 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
20.5 µs
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.5 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.1 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.2 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
184.8 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
11.2 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
617.5 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.1 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.6 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.3 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.9 µs
fib_in_thread_bench[31]
crates/divan_compat/benches/thread_example.rs
15.8 ms
fib_in_thread_bench[30]
crates/divan_compat/benches/thread_example.rs
9.7 ms
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench
254.2 ns
fib_in_thread[32]
crates/divan_compat/benches/thread_example.rs
25.5 ms
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench
90 ns
sleep_100ms
crates/divan_compat/benches/sleep_benches.rs
566.1 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench
154.4 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
254.2 ns
sleep_100ms_with_custom_sample
crates/divan_compat/benches/sleep_benches.rs
566.1 ns
fib_in_thread_bench[32]
crates/divan_compat/benches/thread_example.rs
25.5 ms
sleep_50ms
crates/divan_compat/benches/sleep_benches.rs
566.1 ns
sleep_1ms
crates/divan_compat/benches/sleep_benches.rs
566.1 ns
fib_in_thread[31]
crates/divan_compat/benches/thread_example.rs
15.8 ms
fib_in_thread[30]
crates/divan_compat/benches/thread_example.rs
9.7 ms
fib_in_thread_bench_local[30]
crates/divan_compat/benches/thread_example.rs
9.8 ms
fib_in_thread_bench_local[32]
crates/divan_compat/benches/thread_example.rs
25.5 ms
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
90 ns
fib_in_thread_bench_local[31]
crates/divan_compat/benches/thread_example.rs
15.8 ms
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
9.1 µs
sleep_10ms
crates/divan_compat/benches/sleep_benches.rs
566.1 ns
fibo_50
crates/divan_compat/benches/basic_example.rs
90.3 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
119.2 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
154.4 ns
bench_large_input
crates/divan_compat/benches/drop_example.rs
1.6 ms
fib_10
crates/divan_compat/benches/fib_example.rs
859.7 ns
fib_30
crates/divan_compat/benches/fib_example.rs
8.6 ms
mut_borrow
crates/divan_compat/benches/basic_example.rs
953.3 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
154.4 ns
fib_20
crates/divan_compat/benches/fib_example.rs
70 µs
bench_large_input_local
crates/divan_compat/benches/drop_example.rs
1.5 ms
a
crates/bencher_compat/benches/bencher_example.rs
310.6 ns
b
crates/bencher_compat/benches/bencher_example.rs
2.3 µs
b
crates/bencher_compat/benches/bencher_example.rs::c
2.5 µs
a
crates/bencher_compat/benches/bencher_example.rs::c
310.3 ns
iter_batched_ref_small_input
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
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_with_large_setup
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
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
254.7 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
80.9 µs
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_with_large_drop
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/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_small_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
161.7 ns
sleep_100ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
566.1 ns
sleep_10ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
566.1 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
163.3 ns
iter_with_setup
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
19.6 µs
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
161.7 ns
sleep_50ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
566.1 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
1.8 µs
sleep_1ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
566.1 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
4 µs
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime
< 1 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
130.6 µs
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup
< 1 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
916.7 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
< 1 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
4 µs
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
11.3 µs
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
1.8 µs
iter_with_setup
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
bench_without_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::only_codspeed::bench_using_group_without_explicit_measurement::group
< 1 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
7.2 µs
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench
< 1 ns
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
1 ms
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
< 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/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_batched_ref_per_iteration
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
80.9 µs
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
< 1 ns
fibo_iterative
crates/codspeed/benches/native.rs
126.9 ns
fibo_recursive_cached
crates/codspeed/benches/native.rs
6.5 µs
fibo_recursive
crates/codspeed/benches/native.rs
916.9 ns

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
345.3 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
Ignored
375.8 ns
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
809.7 ns
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
809.7 ns
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
809.7 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
© 2025 CodSpeed Technology
Home Terms Privacy Docs