[INFO] cloning repository https://github.com/zhristophe/leetcode-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/zhristophe/leetcode-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 57abfb79ce722981388779f5e9e0b4ddf3df76b9
[INFO] testing zhristophe/leetcode-rs against try#c2e32f1c9652b13ed99608599c1e855462f421f3 for pr-146098-7
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/zhristophe/leetcode-rs
[INFO] finished tweaking git repo https://github.com/zhristophe/leetcode-rs
[INFO] tweaked toml for git repo https://github.com/zhristophe/leetcode-rs written to /workspace/builds/worker-6-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/zhristophe/leetcode-rs on toolchain c2e32f1c9652b13ed99608599c1e855462f421f3
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+c2e32f1c9652b13ed99608599c1e855462f421f3" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/zhristophe/leetcode-rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+c2e32f1c9652b13ed99608599c1e855462f421f3" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c2e32f1c9652b13ed99608599c1e855462f421f3" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] e80575ee81368819e88358fb9c15adb1650068dc090f61e5200bb0d816238971
[INFO] running `Command { std: "docker" "start" "-a" "e80575ee81368819e88358fb9c15adb1650068dc090f61e5200bb0d816238971", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "e80575ee81368819e88358fb9c15adb1650068dc090f61e5200bb0d816238971", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e80575ee81368819e88358fb9c15adb1650068dc090f61e5200bb0d816238971", kill_on_drop: false }`
[INFO] [stdout] e80575ee81368819e88358fb9c15adb1650068dc090f61e5200bb0d816238971
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c2e32f1c9652b13ed99608599c1e855462f421f3" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 35cc0b9ba484baa45b4a73b52cb5cf2270e6fdac093acf9a04bd21f04f1120f6
[INFO] running `Command { std: "docker" "start" "-a" "35cc0b9ba484baa45b4a73b52cb5cf2270e6fdac093acf9a04bd21f04f1120f6", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:16:13
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let n = values.len();
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_score_triangulation` is never used
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn min_score_triangulation(values: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:52
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edges`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:60
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_critical_and_pseudo_critical_edges` is never used
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `is_infected`
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:26
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_is_infected`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/749_contain-virus.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contain_virus` is never used
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:13:24
[INFO] [stdout]    |
[INFO] [stdout] 13 | use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                        ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:38
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                      ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:55
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                                       ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/4_median-of-two-sorted-arrays.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ans`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ans`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:89:13
[INFO] [stdout]    |
[INFO] [stdout] 89 |         for i in 0..n {}
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_edge_reversals` is never used
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn min_edge_reversals(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `f`
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:17:13
[INFO] [stdout]    |
[INFO] [stdout] 17 |         let f = vec![vec![0; n]; m];
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/174_dungeon-game.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `calculate_minimum_hp` is never used
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn calculate_minimum_hp(dungeon: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.83s
[INFO] running `Command { std: "docker" "inspect" "35cc0b9ba484baa45b4a73b52cb5cf2270e6fdac093acf9a04bd21f04f1120f6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "35cc0b9ba484baa45b4a73b52cb5cf2270e6fdac093acf9a04bd21f04f1120f6", kill_on_drop: false }`
[INFO] [stdout] 35cc0b9ba484baa45b4a73b52cb5cf2270e6fdac093acf9a04bd21f04f1120f6
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c2e32f1c9652b13ed99608599c1e855462f421f3" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] d078b641e6ed8989bb1419e6122650606847aa0147ae57f9fc2667f075a62a44
[INFO] running `Command { std: "docker" "start" "-a" "d078b641e6ed8989bb1419e6122650606847aa0147ae57f9fc2667f075a62a44", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:13:24
[INFO] [stdout]    |
[INFO] [stdout] 13 | use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                        ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ans`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stdout]    |
[INFO] [stdout] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stdout]    |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ans`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:89:13
[INFO] [stdout]    |
[INFO] [stdout] 89 |         for i in 0..n {}
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_edge_reversals` is never used
[INFO] [stdout]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn min_edge_reversals(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:52
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:38
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                      ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:55
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |                                                       ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:16:13
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let n = values.len();
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/4_median-of-two-sorted-arrays.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stdout]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_score_triangulation` is never used
[INFO] [stdout]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn min_score_triangulation(values: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `edges`
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:60
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |                                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_critical_and_pseudo_critical_edges` is never used
[INFO] [stdout]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `f`
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:17:13
[INFO] [stdout]    |
[INFO] [stdout] 17 |         let f = vec![vec![0; n]; m];
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/174_dungeon-game.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `calculate_minimum_hp` is never used
[INFO] [stdout]   --> src/bin/174_dungeon-game.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn calculate_minimum_hp(dungeon: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `is_infected`
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:26
[INFO] [stdout]    |
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_is_infected`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/bin/749_contain-virus.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contain_virus` is never used
[INFO] [stdout]   --> src/bin/749_contain-virus.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.91s
[INFO] running `Command { std: "docker" "inspect" "d078b641e6ed8989bb1419e6122650606847aa0147ae57f9fc2667f075a62a44", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "d078b641e6ed8989bb1419e6122650606847aa0147ae57f9fc2667f075a62a44", kill_on_drop: false }`
[INFO] [stdout] d078b641e6ed8989bb1419e6122650606847aa0147ae57f9fc2667f075a62a44
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c2e32f1c9652b13ed99608599c1e855462f421f3" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 58f11114cfe88693263ec9895d6ca4b275f6ffdc7436126e86a65caf3990f631
[INFO] running `Command { std: "docker" "start" "-a" "58f11114cfe88693263ec9895d6ca4b275f6ffdc7436126e86a65caf3990f631", kill_on_drop: false }`
[INFO] [stderr] warning: unused variable: `n`
[INFO] [stderr]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:52
[INFO] [stderr]    |
[INFO] [stderr] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |                                                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `edges`
[INFO] [stderr]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:60
[INFO] [stderr]    |
[INFO] [stderr] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |                                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges`
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `find_critical_and_pseudo_critical_edges` is never used
[INFO] [stderr]   --> src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 14 |     pub fn find_critical_and_pseudo_critical_edges(n: i32, edges: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `nums1`
[INFO] [stderr]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:38
[INFO] [stderr]    |
[INFO] [stderr] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stderr]    |                                      ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `nums2`
[INFO] [stderr]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:55
[INFO] [stderr]    |
[INFO] [stderr] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stderr]    |                                                       ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/bin/4_median-of-two-sorted-arrays.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `find_median_sorted_arrays` is never used
[INFO] [stderr]   --> src/bin/4_median-of-two-sorted-arrays.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 14 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `n`
[INFO] [stderr]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:16:13
[INFO] [stderr]    |
[INFO] [stderr] 16 |         let n = values.len();
[INFO] [stderr]    |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `min_score_triangulation` is never used
[INFO] [stderr]   --> src/bin/1039_minimum-score-triangulation-of-polygon.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 14 |     pub fn min_score_triangulation(values: Vec<i32>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `is_infected`
[INFO] [stderr]   --> src/bin/749_contain-virus.rs:14:26
[INFO] [stderr]    |
[INFO] [stderr] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_is_infected`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/bin/749_contain-virus.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `contain_virus` is never used
[INFO] [stderr]   --> src/bin/749_contain-virus.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 14 |     pub fn contain_virus(is_infected: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `HashMap`
[INFO] [stderr]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:13:24
[INFO] [stderr]    |
[INFO] [stderr] 13 | use std::collections::{HashMap, VecDeque};
[INFO] [stderr]    |                        ^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stderr]    |
[INFO] [stderr] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stderr]    |             ----^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `ans`
[INFO] [stderr]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:88:13
[INFO] [stderr]    |
[INFO] [stderr] 88 |         let mut ans = vec![0; n as usize];
[INFO] [stderr]    |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ans`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:89:13
[INFO] [stderr]    |
[INFO] [stderr] 89 |         for i in 0..n {}
[INFO] [stderr]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `min_edge_reversals` is never used
[INFO] [stderr]   --> src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs:15:12
[INFO] [stderr]    |
[INFO] [stderr] 14 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 15 |     pub fn min_edge_reversals(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `f`
[INFO] [stderr]   --> src/bin/174_dungeon-game.rs:17:13
[INFO] [stderr]    |
[INFO] [stderr] 17 |         let f = vec![vec![0; n]; m];
[INFO] [stderr]    |             ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/bin/174_dungeon-game.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `calculate_minimum_hp` is never used
[INFO] [stderr]   --> src/bin/174_dungeon-game.rs:14:12
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 14 |     pub fn calculate_minimum_hp(dungeon: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode-rs` (bin "1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree" test) generated 4 warnings (run `cargo fix --bin "1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree" -p leetcode-rs --tests` to apply 2 suggestions)
[INFO] [stderr] warning: `leetcode-rs` (bin "4_median-of-two-sorted-arrays" test) generated 4 warnings (run `cargo fix --bin "4_median-of-two-sorted-arrays" -p leetcode-rs --tests` to apply 2 suggestions)
[INFO] [stderr] warning: `leetcode-rs` (bin "1039_minimum-score-triangulation-of-polygon" test) generated 3 warnings (run `cargo fix --bin "1039_minimum-score-triangulation-of-polygon" -p leetcode-rs --tests` to apply 1 suggestion)
[INFO] [stderr] warning: `leetcode-rs` (bin "749_contain-virus" test) generated 3 warnings (run `cargo fix --bin "749_contain-virus" -p leetcode-rs --tests` to apply 1 suggestion)
[INFO] [stderr] warning: `leetcode-rs` (bin "2858_minimum-edge-reversals-so-every-node-is-reachable" test) generated 6 warnings (run `cargo fix --bin "2858_minimum-edge-reversals-so-every-node-is-reachable" -p leetcode-rs --tests` to apply 4 suggestions)
[INFO] [stderr] warning: `leetcode-rs` (bin "174_dungeon-game" test) generated 3 warnings (run `cargo fix --bin "174_dungeon-game" -p leetcode-rs --tests` to apply 1 suggestion)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode_rs-79e669d727689ac3)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/1039_minimum-score-triangulation-of-polygon.rs (/opt/rustwide/target/debug/deps/1039_minimum_score_triangulation_of_polygon-48a9d4c8c60ce16e)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/1489_find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.rs (/opt/rustwide/target/debug/deps/1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree-123cf1c113bf7b01)
[INFO] [stderr]      Running unittests src/bin/1502_can-make-arithmetic-progression-from-sequence.rs (/opt/rustwide/target/debug/deps/1502_can_make_arithmetic_progression_from_sequence-67f3c566a31d7d7b)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/1540_can-convert-string-in-k-moves.rs (/opt/rustwide/target/debug/deps/1540_can_convert_string_in_k_moves-b19f5f5c05ddf24e)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/1721_swapping-nodes-in-a-linked-list.rs (/opt/rustwide/target/debug/deps/1721_swapping_nodes_in_a_linked_list-7e27d5947d643e1f)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stderr]      Running unittests src/bin/174_dungeon-game.rs (/opt/rustwide/target/debug/deps/174_dungeon_game-c4858a68f96f3738)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/2154_keep-multiplying-found-values-by-two.rs (/opt/rustwide/target/debug/deps/2154_keep_multiplying_found_values_by_two-7df73f975225f800)
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/2858_minimum-edge-reversals-so-every-node-is-reachable.rs (/opt/rustwide/target/debug/deps/2858_minimum_edge_reversals_so_every_node_is_reachable-278c6e62d4e7316f)
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/4_median-of-two-sorted-arrays.rs (/opt/rustwide/target/debug/deps/4_median_of_two_sorted_arrays-d6c147075d5469eb)
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/749_contain-virus.rs (/opt/rustwide/target/debug/deps/749_contain_virus-2d4b1bf879161836)
[INFO] [stdout] running 0 tests
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/leetcode_rs-6a4e2f2be901341d)
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/bin/main.rs (/opt/rustwide/target/debug/deps/main-9213d2f398fa526c)
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests leetcode_rs
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "58f11114cfe88693263ec9895d6ca4b275f6ffdc7436126e86a65caf3990f631", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "58f11114cfe88693263ec9895d6ca4b275f6ffdc7436126e86a65caf3990f631", kill_on_drop: false }`
[INFO] [stdout] 58f11114cfe88693263ec9895d6ca4b275f6ffdc7436126e86a65caf3990f631