CodSpeedHQ
codspeed-rust
BlogDocsChangelog

GitHub Actions run

14 days ago f2e74d7 cod-1711-codspeed-rust-add-analysis-mode-support pull_request

Compare

Base
Search a run

Head
feat: add support for analysis mode
#152
cod-1711-codspeed-rust-add-analysis-mode-support
14 days ago
Wall TimeCPU Simulation

Compare
Suggested base runs:

Benchmarks

with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
52.5 µs
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
21 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
iter_with_large_setup
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
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
357 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
86 µs
iter_batched_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
923 ns
sleep_10ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
10.1 ms
iter
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
44 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
sleep_100ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
100.1 ms
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
272 ns
sleep_1ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
1.1 ms
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
52.6 µs
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
410 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
52 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
48 ns
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
10.1 ms
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
787.5 µs
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
21 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
52 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
84 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
2 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
44 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
84 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b
211 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
44 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
305 ns
sleep_50ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
50.1 ms
Auto
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
521 ns
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup
18 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime
< 1 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
260 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
64 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
22 ns
simulated_processing_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples
884 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.6 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
120.5 µs
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
rem
crates/divan_compat/examples/benches/math.rs
3 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
34 ns
uppercase_chars_with_counter
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples
358 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
290.2 ms
process_with_multiple_counters
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples
48 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
297 ns
count_chars_in_string
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples
32 ns
instant
crates/divan_compat/examples/benches/time.rs::now
38 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
638 ns
allocate
crates/divan_compat/examples/benches/alloc.rs
1 s
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
296.9 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.6 µs
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
system_time
crates/divan_compat/examples/benches/time.rs::now
38 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
20.7 µs
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
38 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
765.8 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
159 ns
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
67.1 µs
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
6.2 ms
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
1.1 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
49.8 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
6 ns
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.3 µs
div
crates/divan_compat/examples/benches/math.rs
3 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.1 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
564 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
16 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
11.6 µs
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
20 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
247.2 ms
instant
crates/divan_compat/examples/benches/time.rs::duration_since
10 ns
string_processing_multi_counter
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples
371 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
1.1 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
220 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
75 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
51 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.3 µs
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
5 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.8 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
66 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
110 µs
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.9 µs
hash_computation_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples
46 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.9 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
10.1 µs
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
185 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
2.4 µs
filter_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples
1.1 µs
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
100.1 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
594 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
3 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
22.5 µs
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
830 ns
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
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.1 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
5.8 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
965 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.6 ms
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.5 µs
vec_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
61 ns
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
69.5 µs
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.3 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
4.9 ms
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
12 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.8 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
109.3 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
3.3 ms
add
crates/divan_compat/examples/benches/math.rs
2 ns
string_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
61 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.3 µs
mul
crates/divan_compat/examples/benches/math.rs
2 ns
slice_into_vec_with_bytes
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
59 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
14 ns
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
830 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
1.1 ms
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
508.8 µs
sort
crates/divan_compat/examples/benches/sort.rs::sorted
118.8 µs
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.2 µs
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
7 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
8 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
995 ns
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
416 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8 µs
process_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples
63 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
8 ns
fib_10
crates/divan_compat/benches/fib_example.rs
375 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
fib_in_thread_bench[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
fibo_10
crates/divan_compat/benches/basic_example.rs
2 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1 ns
sleep_100ms_with_custom_sample
crates/divan_compat/benches/sleep_benches.rs
100.1 ms
sleep_10ms
crates/divan_compat/benches/sleep_benches.rs
10.1 ms
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
2.1 µs
fib_in_thread[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
fib_30
crates/divan_compat/benches/fib_example.rs
5.6 ms
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
9 ns
fib_20
crates/divan_compat/benches/fib_example.rs
45.6 µs
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
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
sleep_100ms
crates/divan_compat/benches/sleep_benches.rs
100.1 ms
fib_in_thread_bench[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
bench_array1[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
bench_array1[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
fib_in_thread[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3 ns
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
47 ns
fib_in_thread_bench[31]
crates/divan_compat/benches/thread_example.rs
10.8 ms
bench_large_input_local
crates/divan_compat/benches/drop_example.rs
50.4 ms
fib_in_thread[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
fibo_50
crates/divan_compat/benches/basic_example.rs
2 ns
fib_in_thread_bench_local[32]
crates/divan_compat/benches/thread_example.rs
17.4 ms
fib_in_thread_bench_local[30]
crates/divan_compat/benches/thread_example.rs
6.8 ms
sleep_1ms
crates/divan_compat/benches/sleep_benches.rs
1.1 ms
sleep_50ms
crates/divan_compat/benches/sleep_benches.rs
50.1 ms
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
slice_into_vec_with_bytes
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
< 1 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
allocate
crates/divan_compat/examples/benches/alloc.rs
< 1 ns
string_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
< 1 ns
count_chars_in_string
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples
< 1 ns
uppercase_chars_with_counter
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples
< 1 ns
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
vec_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples
< 1 ns
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
process_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples
< 1 ns
simulated_processing_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples
< 1 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
hash_computation_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples
< 1 ns
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
process_with_multiple_counters
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples
< 1 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
filter_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples
< 1 ns
string_processing_multi_counter
crates/divan_compat/examples/benches/counters.rs::multiple_counters_examples
< 1 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
system_time
crates/divan_compat/examples/benches/time.rs::now
< 1 ns
tsc (x86)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
instant
crates/divan_compat/examples/benches/time.rs::now
< 1 ns
div
crates/divan_compat/examples/benches/math.rs
< 1 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
tsc (x86)
crates/divan_compat/examples/benches/time.rs::now
< 1 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
print_env_hello
crates/divan_compat/examples/benches/env.rs
< 1 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
add
crates/divan_compat/examples/benches/math.rs
< 1 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
< 1 ns
rem
crates/divan_compat/examples/benches/math.rs
< 1 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
mul
crates/divan_compat/examples/benches/math.rs
< 1 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
sort
crates/divan_compat/examples/benches/sort.rs::random
< 1 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
sort
crates/divan_compat/examples/benches/sort.rs::sorted
< 1 ns
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
< 1 ns
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
< 1 ns
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
< 1 ns
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
< 1 ns
fib_in_thread_bench_local[30]
crates/divan_compat/benches/thread_example.rs
< 1 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
fib_30
crates/divan_compat/benches/fib_example.rs
< 1 ns
fib_in_thread_bench[32]
crates/divan_compat/benches/thread_example.rs
< 1 ns
fib_in_thread[31]
crates/divan_compat/benches/thread_example.rs
< 1 ns
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
fib_in_thread_bench[31]
crates/divan_compat/benches/thread_example.rs
< 1 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
< 1 ns
bench_large_input_local
crates/divan_compat/benches/drop_example.rs
< 1 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
fib_in_thread_bench_local[32]
crates/divan_compat/benches/thread_example.rs
< 1 ns
fib_in_thread[30]
crates/divan_compat/benches/thread_example.rs
< 1 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
fib_in_thread_bench_local[31]
crates/divan_compat/benches/thread_example.rs
< 1 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
< 1 ns
bench_large_input
crates/divan_compat/benches/drop_example.rs
< 1 ns
fib_in_thread[32]
crates/divan_compat/benches/thread_example.rs
< 1 ns
fib_in_thread_bench[30]
crates/divan_compat/benches/thread_example.rs
< 1 ns
fibo_50
crates/divan_compat/benches/basic_example.rs
< 1 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
fib_20
crates/divan_compat/benches/fib_example.rs
< 1 ns
fib_10
crates/divan_compat/benches/fib_example.rs
< 1 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
< 1 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
< 1 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
< 1 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
< 1 ns
iter
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
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
< 1 ns
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
< 1 ns
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b
< 1 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
< 1 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
< 1 ns
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
< 1 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 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_ref_large_input
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
iter_batched_per_iteration
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
< 1 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/async_measurement_overhead.rs::benches::some_benchmark::async overhead
< 1 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
< 1 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 1 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 1 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 1 ns
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 1 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
< 1 ns
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_with_setup
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_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 1 ns
iter_batched_ref_small_input
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
iter_with_large_drop
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_with_explicit_lifetime
< 1 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
< 1 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
iter_with_large_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
iter_with_setup
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
a
crates/bencher_compat/benches/bencher_example.rs::c
< 1 ns
b
crates/bencher_compat/benches/bencher_example.rs::c
< 1 ns
b
crates/bencher_compat/benches/bencher_example.rs
< 1 ns
a
crates/bencher_compat/benches/bencher_example.rs
< 1 ns
fibo_iterative
crates/codspeed/benches/native.rs
< 1 ns
fibo_recursive
crates/codspeed/benches/native.rs
< 1 ns
fibo_recursive_cached
crates/codspeed/benches/native.rs
< 1 ns

Ignored

recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
Ignored
1 ns
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
1.1 µs
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
932 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
713 ns
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
88 ns
instant
crates/divan_compat/examples/benches/time.rs::duration_since
Ignored
< 1 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
< 1 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
Ignored
< 1 ns
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
< 1 ns
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
Ignored
< 1 ns
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
Ignored
< 1 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
Ignored
< 1 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
Ignored
< 1 ns
sleep_100ms
crates/divan_compat/benches/sleep_benches.rs
Ignored
< 1 ns
sleep_100ms_with_custom_sample
crates/divan_compat/benches/sleep_benches.rs
Ignored
< 1 ns
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
< 1 ns
sleep_1ms
crates/divan_compat/benches/sleep_benches.rs
Ignored
< 1 ns
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
< 1 ns
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
Ignored
< 1 ns
sleep_10ms
crates/divan_compat/benches/sleep_benches.rs
Ignored
< 1 ns
sleep_50ms
crates/divan_compat/benches/sleep_benches.rs
Ignored
< 1 ns
sleep_50ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
Ignored
< 1 ns
sleep_1ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
Ignored
< 1 ns
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
Ignored
< 1 ns
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
Ignored
< 1 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
Ignored
< 1 ns
sleep_100ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
Ignored
< 1 ns
sleep_10ms
crates/criterion_compat/benches/criterion_integration/sleep.rs::benches::sleep_benchmarks
Ignored
< 1 ns
© 2025 CodSpeed Technology
Home Terms Privacy Docs