temp: test with new runner on staging

[not-matthias]

No description provided.

[codspeed-hq]

CodSpeed Instrumentation Performance Report

Merging #126 will degrade performances by 12.14%

_{Comparing staging-test (9f7a0c9) with main (4be2e55)}

Summary

⚡ 3 improvements
❌ 6 regressions
✅ 158 untouched

⚠️ Please fix the performance issues or acknowledge them on CodSpeed.

Benchmarks breakdown

	Benchmark	BASE	HEAD	Change
⚡	bench_array1[4]	183.6 ns	154.4 ns	+18.88%
⚡	bench_array2[4]	183.6 ns	154.4 ns	+18.88%
⚡	init_array[4]	183.6 ns	154.4 ns	+18.88%
❌	mut_borrow	895 ns	924.2 ns	-3.16%
❌	recursive[0]	211.1 ns	240.3 ns	-12.14%
❌	recursive[5]	291.1 ns	320.3 ns	-9.11%
❌	recursive_memoized[HashMap<u64, u64>, 0]	929.2 ns	958.3 ns	-3.04%
❌	instant	334.4 ns	363.6 ns	-8.02%
❌	system_time	334.4 ns	363.6 ns	-8.02%

[avalanche-staging]

CodSpeed WallTime Performance Report

Congrats! CodSpeed is installed 🎉

🆕 163 new benchmarks were detected.

You will start to see performance impacts in the reports once the benchmarks are run from your default branch.

Detected benchmarks

• sum_fold (304 ns)
• build_vec (210 ns)
• Iterative (21 ns)
• Recursive (47 µs)
• Iterative[20] (21 ns)
• Iterative[21] (22 ns)
• Recursive[20] (47 µs)
• Recursive[21] (77.2 µs)
• fibonacci_custom_measurement (411 ns)
• large_drop (171.1 µs)
• small_drop (< 1 ns)
• large_setup (12 ns)
• small_setup (1 ns)
• iter_with_setup (39 ns)
• iter (< 1 ns)
• iter_batched_large_input (< 1 ns)
• iter_batched_per_iteration (40 ns)
• iter_batched_ref_large_input (< 1 ns)
• iter_batched_ref_per_iteration (40 ns)
• iter_batched_ref_small_input (< 1 ns)
• iter_batched_small_input (< 1 ns)
• iter_with_large_drop (< 1 ns)
• iter_with_large_setup (< 1 ns)
• iter_with_setup (40 ns)
• Auto (3 ns)
• Flat (10.1 ms)
• Linear (3 ns)
• sleep_100ms (100.1 ms)
• sleep_10ms (10.1 ms)
• sleep_1ms (1.1 ms)
• sleep_50ms (50.1 ms)
• "*benchmark/" ' (< 1 ns)
• from_elem[1024] (82 ns)
• from_elem[16384] (914 ns)
• from_elem[2048] (244 ns)
• from_elem[4096] (325 ns)
• from_elem[8192] (529 ns)
• from_elem_decimal[1024] (82 ns)
• from_elem_decimal[2048] (266 ns)
• with_input[5] (< 1 ns)
• bench_explicit_measurement (< 1 ns)
• with_input[5] (< 1 ns)
• with_input[5] (< 1 ns)
• bench_array1[10] (10 ns)
• bench_array1[1] (1 ns)
• bench_array1[42] (51 ns)
• bench_array1[4] (3 ns)
• bench_array2[10] (10 ns)
• bench_array2[1] (1 ns)
• bench_array2[42] (51 ns)
• bench_array2[4] (3 ns)
• init_array[1000] (1.8 µs)
• init_array[42] (51 ns)
• init_array[4] (3 ns)
• fibo_10 (2 ns)
• fibo_50 (2 ns)
• mut_borrow (7 ns)
• sleep_100ms (100.1 ms)
• sleep_100ms_with_custom_sample (100.1 ms)
• sleep_10ms (10.1 ms)
• sleep_1ms (1.1 ms)
• sleep_50ms (50.1 ms)
• print_env_hello (2.1 µs)
• add (2 ns)
• div (3 ns)
• iterative[0] (1 ns)
• iterative[10] (16 ns)
• iterative[20] (40 ns)
• iterative[30] (51 ns)
• iterative[5] (7 ns)
• recursive[0] (1 ns)
• recursive[10] (391 ns)
• recursive[20] (47.4 µs)
• recursive[30] (5.9 ms)
• recursive[5] (31 ns)
• recursive_memoized[BTreeMap<u64, u64>, 0] (14 ns)
• recursive_memoized[BTreeMap<u64, u64>, 10] (551 ns)
• recursive_memoized[BTreeMap<u64, u64>, 20] (1.8 µs)
• recursive_memoized[BTreeMap<u64, u64>, 30] (2.9 µs)
• recursive_memoized[BTreeMap<u64, u64>, 5] (199 ns)
• recursive_memoized[HashMap<u64, u64>, 0] (16 ns)
• recursive_memoized[HashMap<u64, u64>, 10] (1.5 µs)
• recursive_memoized[HashMap<u64, u64>, 20] (3.3 µs)
• recursive_memoized[HashMap<u64, u64>, 30] (5.7 µs)
• recursive_memoized[HashMap<u64, u64>, 5] (575 ns)
• mul (2 ns)
• rem (3 ns)
• sort (4.9 ms)
• sort_unstable (3.3 ms)
• sort (139.4 µs)
• sort_unstable (130.5 µs)
• generate_combinations[5] (785 ns)
• generate_combinations[6] (1.3 µs)
• generate_combinations[7] (2.1 µs)
• generate_combinations[8] (3.1 µs)
• generate_combinations[9] (6.5 µs)
• generate_parentheses[3] (2.4 µs)
• generate_parentheses[4] (6.9 µs)
• generate_parentheses[5] (21.7 µs)
• generate_parentheses[6] (68.3 µs)
• graph_coloring[3] (1.1 µs)
• graph_coloring[4] (896 ns)
• graph_coloring[5] (995 ns)
• graph_coloring[6] (1.1 µs)
• hamiltonian_cycle[4] (543 ns)
• hamiltonian_cycle[5] (603 ns)
• hamiltonian_cycle[6] (713 ns)
• hamiltonian_cycle[7] (782 ns)
• knight_tour[5] (293.2 µs)
• knight_tour[6] (8.5 ms)
• knight_tour[7] (247.4 ms)
• knight_tour[8] (292 ms)
• n_queens_solver[4] (1.6 µs)
• n_queens_solver[5] (7.4 µs)
• n_queens_solver[6] (20.5 µs)
• n_queens_solver[7] (119.7 µs)
• n_queens_solver[8] (498.1 µs)
• permutations[3] (713 ns)
• permutations[4] (2.5 µs)
• permutations[5] (14.8 µs)
• permutations[6] (74.3 µs)
• permutations[7] (780.5 µs)
• rat_in_maze[5] (579 ns)
• rat_in_maze[6] (701 ns)
• rat_in_maze[7] (809 ns)
• rat_in_maze[8] (923 ns)
• subset_sum[10] (1 µs)
• subset_sum[12] (1.9 µs)
• subset_sum[14] (2.1 µs)
• subset_sum[16] (4 µs)
• subset_sum[18] (4.1 µs)
• sudoku (111.3 µs)
• add_two_integers[(0, 0)] (5 ns)
• add_two_integers[(1024, -1024)] (65 ns)
• add_two_integers[(255, 255)] (6 ns)
• add_two_integers[(42, 13)] (6 ns)
• add_two_integers[(65535, -65535)] (74 ns)
• count_set_bits[0] (8 ns)
• count_set_bits[1024] (7 ns)
• count_set_bits[255] (8 ns)
• count_set_bits[42] (8 ns)
• count_set_bits[65535] (8 ns)
• find_highest_set_bit[0] (5 ns)
• find_highest_set_bit[1024] (5 ns)
• find_highest_set_bit[255] (5 ns)
• find_highest_set_bit[42] (5 ns)
• find_highest_set_bit[65535] (5 ns)
• generate_gray_code[1] (146 ns)
• generate_gray_code[2] (267 ns)
• generate_gray_code[3] (518 ns)
• generate_gray_code[4] (1.1 µs)
• generate_gray_code[5] (2.1 µs)
• instant (10 ns)
• system_time (13 ns)
• tsc (aarch64) (< 1 ns)
• instant (38 ns)
• system_time (38 ns)
• tsc (aarch64) (3 ns)
• sleep_100ns (61.8 µs)
• sleep_100us (161.8 µs)
• sleep_1ms (1.1 ms)
• sleep_1ns (61.7 µs)
• sleep_1us (62.7 µs)