GitHub Actions run
Wall TimeCPU SimulationMemory
3 months ago 693edb3 main workflow_dispatchCompare
Suggested base runs:
603 total
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking128 B
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking623.9 KB
uppercase_chars_with_counter
crates/divan_compat/examples/benches/counters.rs::chars_counter_examples175 B
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
instant
crates/divan_compat/examples/benches/time.rs::duration_since128 B
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking390 B
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking29.3 KB
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking912 B
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation1.1 KB
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci1 KB
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking360 B
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking1.4 KB
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random128 B
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci128 B
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking228 B
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking495.1 µs
instant
crates/divan_compat/examples/benches/time.rs::duration_since20 ns
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci14 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking2.4 µs
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking1.7 µs
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation5 ns
mul
crates/divan_compat/examples/benches/math.rs2 ns
vec_copy_with_bytes_counter
crates/divan_compat/examples/benches/counters.rs::bytes_counter_examples61 ns