[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#bd7d74411512a3dd3b35d2f699c51dd2557c7e7e+cargoflags=-Zbuild-dir-new-layout for pr-149852-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fzhristophe%2Fleetcode-rs" "/workspace/builds/worker-4-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4-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-4-tc2/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/zhristophe/leetcode-rs on toolchain bd7d74411512a3dd3b35d2f699c51dd2557c7e7e [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+bd7d74411512a3dd3b35d2f699c51dd2557c7e7e" "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" "+bd7d74411512a3dd3b35d2f699c51dd2557c7e7e" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:aa71247004a7fa38d13ec170f48f06cdedf5bc50b2a8645e56ed7e992e6fa513" "/opt/rustwide/cargo-home/bin/cargo" "+bd7d74411512a3dd3b35d2f699c51dd2557c7e7e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 671c8805f91f74bf7802da648255b599d065508c79f45c1cb46d52e29e53f7fc [INFO] running `Command { std: "docker" "start" "-a" "671c8805f91f74bf7802da648255b599d065508c79f45c1cb46d52e29e53f7fc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "671c8805f91f74bf7802da648255b599d065508c79f45c1cb46d52e29e53f7fc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "671c8805f91f74bf7802da648255b599d065508c79f45c1cb46d52e29e53f7fc", kill_on_drop: false }` [INFO] [stdout] 671c8805f91f74bf7802da648255b599d065508c79f45c1cb46d52e29e53f7fc [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:aa71247004a7fa38d13ec170f48f06cdedf5bc50b2a8645e56ed7e992e6fa513" "/opt/rustwide/cargo-home/bin/cargo" "+bd7d74411512a3dd3b35d2f699c51dd2557c7e7e" "build" "--frozen" "--message-format=json" "-Zbuild-dir-new-layout", kill_on_drop: false }` [INFO] [stdout] de4de1767de6d5f866fe4f393eb95745d25035b6becc77ef1a1d8eca4e8e4916 [INFO] running `Command { std: "docker" "start" "-a" "de4de1767de6d5f866fe4f393eb95745d25035b6becc77ef1a1d8eca4e8e4916", 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 { [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> { [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> { [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> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [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, nums2: Vec) -> 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, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2` [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>) -> 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>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [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, nums2: Vec) -> f64 { [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: `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>) -> i32 { [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 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.24s [INFO] running `Command { std: "docker" "inspect" "de4de1767de6d5f866fe4f393eb95745d25035b6becc77ef1a1d8eca4e8e4916", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "de4de1767de6d5f866fe4f393eb95745d25035b6becc77ef1a1d8eca4e8e4916", kill_on_drop: false }` [INFO] [stdout] de4de1767de6d5f866fe4f393eb95745d25035b6becc77ef1a1d8eca4e8e4916 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:aa71247004a7fa38d13ec170f48f06cdedf5bc50b2a8645e56ed7e992e6fa513" "/opt/rustwide/cargo-home/bin/cargo" "+bd7d74411512a3dd3b35d2f699c51dd2557c7e7e" "test" "--frozen" "--no-run" "--message-format=json" "-Zbuild-dir-new-layout", kill_on_drop: false }` [INFO] [stdout] 63bd30d853230506877ccbd5cc9465e96bb5f616b563d74426fa2ead01ee2f6a [INFO] running `Command { std: "docker" "start" "-a" "63bd30d853230506877ccbd5cc9465e96bb5f616b563d74426fa2ead01ee2f6a", 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: 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>) -> 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: 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/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>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [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 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [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, nums2: Vec) -> 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, nums2: Vec) -> 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/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> { [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> { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [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>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [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> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [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, nums2: Vec) -> 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 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.20s [INFO] running `Command { std: "docker" "inspect" "63bd30d853230506877ccbd5cc9465e96bb5f616b563d74426fa2ead01ee2f6a", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "63bd30d853230506877ccbd5cc9465e96bb5f616b563d74426fa2ead01ee2f6a", kill_on_drop: false }` [INFO] [stdout] 63bd30d853230506877ccbd5cc9465e96bb5f616b563d74426fa2ead01ee2f6a [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:aa71247004a7fa38d13ec170f48f06cdedf5bc50b2a8645e56ed7e992e6fa513" "/opt/rustwide/cargo-home/bin/cargo" "+bd7d74411512a3dd3b35d2f699c51dd2557c7e7e" "test" "--frozen" "-Zbuild-dir-new-layout", kill_on_drop: false }` [INFO] [stdout] 8a3a0eea5123d47fb5462ffd53c204332ece4daf8a8362870dbed66f2b9afd08 [INFO] running `Command { std: "docker" "start" "-a" "8a3a0eea5123d47fb5462ffd53c204332ece4daf8a8362870dbed66f2b9afd08", kill_on_drop: false }` [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>) -> 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>) -> i32 { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [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> { [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> { [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> { [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>) -> i32 { [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 { [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 { [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, nums2: Vec) -> 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, nums2: Vec) -> 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, nums2: Vec) -> f64 { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [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 "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 "174_dungeon-game" test) generated 3 warnings (run `cargo fix --bin "174_dungeon-game" -p leetcode-rs --tests` to apply 1 suggestion) [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 "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 "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] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.01s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/build/leetcode-rs/79e669d727689ac3/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/build/leetcode-rs/729942bbfce66dc8/deps/1039_minimum_score_triangulation_of_polygon-729942bbfce66dc8) [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/build/leetcode-rs/b9b5f72d2e988e71/deps/1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree-b9b5f72d2e988e71) [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/1502_can-make-arithmetic-progression-from-sequence.rs (/opt/rustwide/target/debug/build/leetcode-rs/04121dbd4395201d/deps/1502_can_make_arithmetic_progression_from_sequence-04121dbd4395201d) [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/build/leetcode-rs/320396f7b210f5fb/deps/1540_can_convert_string_in_k_moves-320396f7b210f5fb) [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/build/leetcode-rs/96f2e708e8663e75/deps/1721_swapping_nodes_in_a_linked_list-96f2e708e8663e75) [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/174_dungeon-game.rs (/opt/rustwide/target/debug/build/leetcode-rs/bdbdf73039edbf99/deps/174_dungeon_game-bdbdf73039edbf99) [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/build/leetcode-rs/dcb41aeada9b81a9/deps/2154_keep_multiplying_found_values_by_two-dcb41aeada9b81a9) [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/2858_minimum-edge-reversals-so-every-node-is-reachable.rs (/opt/rustwide/target/debug/build/leetcode-rs/63ca4bea9d7f888f/deps/2858_minimum_edge_reversals_so_every_node_is_reachable-63ca4bea9d7f888f) [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/build/leetcode-rs/d924806bae80512f/deps/4_median_of_two_sorted_arrays-d924806bae80512f) [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/749_contain-virus.rs (/opt/rustwide/target/debug/build/leetcode-rs/6a3a19b2b73ab8a7/deps/749_contain_virus-6a3a19b2b73ab8a7) [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/main.rs (/opt/rustwide/target/debug/build/leetcode-rs/494f8f56484283ca/deps/leetcode_rs-494f8f56484283ca) [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/main.rs (/opt/rustwide/target/debug/build/leetcode-rs/a4ff97f78b988092/deps/main-a4ff97f78b988092) [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" "8a3a0eea5123d47fb5462ffd53c204332ece4daf8a8362870dbed66f2b9afd08", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8a3a0eea5123d47fb5462ffd53c204332ece4daf8a8362870dbed66f2b9afd08", kill_on_drop: false }` [INFO] [stdout] 8a3a0eea5123d47fb5462ffd53c204332ece4daf8a8362870dbed66f2b9afd08