GitHub Actions run
Wall TimeCPU SimulationMemory
4 days ago 58b28e6 cod-2459-be-able-to-run-all-integrations-on-macos pull_requestThis run is associated to a commit that was force-pushed
It will not be associated with its branch history. Be careful when comparing its performance to other runs.Compare
Base
Search a run
Head
CompareSupport macos walltime without profiling in codspeed-rust
#176
cod-2459-be-able-to-run-all-integrations-on-macos
4 days ago
Wall TimeCPU SimulationMemory
603 total
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking118.4 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking1.3 µs
simulated_processing_cycles
crates/divan_compat/examples/benches/counters.rs::cycles_counter_examples1.3 µs
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation8 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs1.1 ms
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation5 ns
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci49.6 µs
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking1 µs
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking896 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci16 ns
filter_items_with_counter
crates/divan_compat/examples/benches/counters.rs::items_counter_examples838 ns
system_time
crates/divan_compat/examples/benches/time.rs::now38 ns
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking2.1 µs
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking252 ms
instant
crates/divan_compat/examples/benches/time.rs::now38 ns
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci626 ns
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation67 ns
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs1.1 µs
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation8 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation17 ns
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci38 ns
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation2.4 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking3.4 µs
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking3.8 µs
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation5 ns