[INFO] cloning repository https://github.com/aranoverse/algorithm-rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/aranoverse/algorithm-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faranoverse%2Falgorithm-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faranoverse%2Falgorithm-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] bde16b5227006cdbd4ea370a9c9759f082ed9030 [INFO] checking aranoverse/algorithm-rust against try#173780a87744406b7489b28349c0176f14bb3881 for pr-135841 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Faranoverse%2Falgorithm-rust" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/aranoverse/algorithm-rust on toolchain 173780a87744406b7489b28349c0176f14bb3881 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+173780a87744406b7489b28349c0176f14bb3881" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/aranoverse/algorithm-rust [INFO] finished tweaking git repo https://github.com/aranoverse/algorithm-rust [INFO] tweaked toml for git repo https://github.com/aranoverse/algorithm-rust written to /workspace/builds/worker-6-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/aranoverse/algorithm-rust 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" "+173780a87744406b7489b28349c0176f14bb3881" "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] [stderr] Downloading crates ... [INFO] [stderr] Downloaded test-case-macros v2.2.1 [INFO] [stderr] Downloaded test-case v2.2.1 [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:c80049f3b88b82089a44e0f06d0d6029d44b96b7257e55a1cd63dbc9f4c33334" "/opt/rustwide/cargo-home/bin/cargo" "+173780a87744406b7489b28349c0176f14bb3881" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 9c3f5757d634aae0e49ec26eb70e9baa77310aa365fb673a6248257d89e22511 [INFO] running `Command { std: "docker" "start" "-a" "9c3f5757d634aae0e49ec26eb70e9baa77310aa365fb673a6248257d89e22511", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "9c3f5757d634aae0e49ec26eb70e9baa77310aa365fb673a6248257d89e22511", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "9c3f5757d634aae0e49ec26eb70e9baa77310aa365fb673a6248257d89e22511", kill_on_drop: false }` [INFO] [stdout] 9c3f5757d634aae0e49ec26eb70e9baa77310aa365fb673a6248257d89e22511 [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:c80049f3b88b82089a44e0f06d0d6029d44b96b7257e55a1cd63dbc9f4c33334" "/opt/rustwide/cargo-home/bin/cargo" "+173780a87744406b7489b28349c0176f14bb3881" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] f2b47eee0e9e39b828e3f62174d5584c8e3415b0bc68a510e56a064e6fb37313 [INFO] running `Command { std: "docker" "start" "-a" "f2b47eee0e9e39b828e3f62174d5584c8e3415b0bc68a510e56a064e6fb37313", kill_on_drop: false }` [INFO] [stderr] Compiling proc-macro2 v1.0.43 [INFO] [stderr] Compiling unicode-ident v1.0.3 [INFO] [stderr] Compiling quote v1.0.21 [INFO] [stderr] Compiling proc-macro-error-attr v1.0.4 [INFO] [stderr] Compiling syn v1.0.99 [INFO] [stderr] Compiling proc-macro-error v1.0.4 [INFO] [stderr] Checking algorithm-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Add` [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Add; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around type [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:18:90 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> (i32) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 18 - pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> (i32) { [INFO] [stdout] 18 + pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/solution/dynamic_programming/triangle.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Shl` [INFO] [stdout] --> src/solution/dynamic_programming/counting_bits.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Shl; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Add` [INFO] [stdout] --> src/solution/dynamic_programming/jump_game_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Add; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths.rs:18:9 [INFO] [stdout] | [INFO] [stdout] 18 | /// formula: grid_ways[i][j] = grid_ways[i-1][j] + grid_ways[i][j-1] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 19 | / for idx_m in 1..m { [INFO] [stdout] 20 | | for idx_n in 1..n { [INFO] [stdout] 21 | | grid_ways[idx_m][idx_n] = grid_ways[idx_m - 1][idx_n] + grid_ways[idx_m][idx_n - 1]; [INFO] [stdout] 22 | | } [INFO] [stdout] 23 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths_ii.rs:38:9 [INFO] [stdout] | [INFO] [stdout] 38 | /// formula: grid_ways[i][j] = grid_ways[i-1][j] + grid_ways[i][j-1] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 39 | / for idx_m in 1..m { [INFO] [stdout] 40 | | for idx_n in 1..n { [INFO] [stdout] 41 | | if obstacle_grid[idx_m][idx_n] == 1 { [INFO] [stdout] 42 | | grid_ways[idx_m][idx_n] = 0; [INFO] [stdout] ... | [INFO] [stdout] 48 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/normal/minimum_windown_substring.rs:5:23 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `t` [INFO] [stdout] --> src/solution/normal/minimum_windown_substring.rs:5:34 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_t` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths_ii.rs:5:40 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn unique_paths_with_obstacles(mut obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/mod.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/solution/normal/two_sum.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | /// https://leetcode.com/problems/two-sum [INFO] [stdout] 6 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_palindrome` and `is_palindrome_v2` are never used [INFO] [stdout] --> src/solution/normal/is_palindrome.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | /// https://leetcode.com/problems/palindrome-number/ [INFO] [stdout] 5 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn is_palindrome_v2(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/solution/normal/tree/mod.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | #[inline] [INFO] [stdout] 17 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_balanced` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_balance_tree.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_balance_tree.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn dfs(node: &Option>>, depth: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_v2` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_balance_tree.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn dfs_v2(node: &Option>>) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/solution/normal/tree/maximum_depth_of_binary_tree.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/solution/normal/tree/maximum_depth_of_binary_tree.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn dfs(node: &Option>>, depth: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_path_sum` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_max_path_sum` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> (i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_window` is never used [INFO] [stdout] --> src/solution/normal/minimum_windown_substring.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | // https://leetcode.com/problems/minimum-window-substring/ [INFO] [stdout] 5 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_perfect_square` is never used [INFO] [stdout] --> src/solution/normal/perfect.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_perfect_square(num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subsets` and `backtrack` are never used [INFO] [stdout] --> src/solution/backtracking/subsets.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn backtrack(nums: &Vec, start: usize, mut sub_list: Vec, subsets: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/solution/dynamic_programming/triangle.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rob` is never used [INFO] [stdout] --> src/solution/dynamic_programming/rob_house.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | /// https://leetcode.com/problems/house-robber/ [INFO] [stdout] 5 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/dynamic_programming/max_profit.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | /// https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ [INFO] [stdout] 5 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `climb_stairs`, `climb_stairs_v2`, and `climb_stairs_recurse` are never used [INFO] [stdout] --> src/solution/dynamic_programming/climb_stairs.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | /// https://leetcode.com/problems/climbing-stairs/ [INFO] [stdout] 5 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn climb_stairs_v2(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn climb_stairs_recurse(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_bits` is never used [INFO] [stdout] --> src/solution/dynamic_programming/counting_bits.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | /// https://leetcode.com/problems/counting-bits/ [INFO] [stdout] 6 | pub fn count_bits(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_jump` is never used [INFO] [stdout] --> src/solution/dynamic_programming/jump_game.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | /// https://leetcode.com/problems/jump-game/ [INFO] [stdout] 6 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `jump` and `jump_v2` are never used [INFO] [stdout] --> src/solution/dynamic_programming/jump_game_ii.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | // https://leetcode.com/problems/jump-game-ii/ [INFO] [stdout] 7 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn jump_v2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths` is never used [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | /// https://leetcode.com/problems/unique-paths/ [INFO] [stdout] 5 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths_with_obstacles` is never used [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths_ii.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | // https://leetcode.com/problems/unique-paths-ii/ [INFO] [stdout] 5 | pub fn unique_paths_with_obstacles(mut obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling test-case-macros v2.2.1 [INFO] [stderr] Checking test-case v2.2.1 [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Add` [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use std::ops::Add; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around type [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:18:90 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> (i32) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 18 - pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> (i32) { [INFO] [stdout] 18 + pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/solution/dynamic_programming/triangle.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Shl` [INFO] [stdout] --> src/solution/dynamic_programming/counting_bits.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Shl; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Add` [INFO] [stdout] --> src/solution/dynamic_programming/jump_game_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ops::Add; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths.rs:18:9 [INFO] [stdout] | [INFO] [stdout] 18 | /// formula: grid_ways[i][j] = grid_ways[i-1][j] + grid_ways[i][j-1] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 19 | / for idx_m in 1..m { [INFO] [stdout] 20 | | for idx_n in 1..n { [INFO] [stdout] 21 | | grid_ways[idx_m][idx_n] = grid_ways[idx_m - 1][idx_n] + grid_ways[idx_m][idx_n - 1]; [INFO] [stdout] 22 | | } [INFO] [stdout] 23 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths_ii.rs:38:9 [INFO] [stdout] | [INFO] [stdout] 38 | /// formula: grid_ways[i][j] = grid_ways[i-1][j] + grid_ways[i][j-1] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 39 | / for idx_m in 1..m { [INFO] [stdout] 40 | | for idx_n in 1..n { [INFO] [stdout] 41 | | if obstacle_grid[idx_m][idx_n] == 1 { [INFO] [stdout] 42 | | grid_ways[idx_m][idx_n] = 0; [INFO] [stdout] ... | [INFO] [stdout] 48 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/normal/minimum_windown_substring.rs:5:23 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `t` [INFO] [stdout] --> src/solution/normal/minimum_windown_substring.rs:5:34 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_t` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/dynamic_programming/unique_paths_ii.rs:5:40 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn unique_paths_with_obstacles(mut obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/solution/normal/two_sum.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | /// https://leetcode.com/problems/two-sum [INFO] [stdout] 6 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_palindrome` and `is_palindrome_v2` are never used [INFO] [stdout] --> src/solution/normal/is_palindrome.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | /// https://leetcode.com/problems/palindrome-number/ [INFO] [stdout] 5 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn is_palindrome_v2(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/solution/normal/tree/mod.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | #[inline] [INFO] [stdout] 17 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_balanced` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_balance_tree.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_balance_tree.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn dfs(node: &Option>>, depth: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_v2` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_balance_tree.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn dfs_v2(node: &Option>>) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/solution/normal/tree/maximum_depth_of_binary_tree.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/solution/normal/tree/maximum_depth_of_binary_tree.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | pub fn dfs(node: &Option>>, depth: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_path_sum` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_max_path_sum` is never used [INFO] [stdout] --> src/solution/normal/tree/binary_tree_maximum_path_sum.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn dfs_max_path_sum(node: &Option>>, max_path_sum: &mut i32) -> (i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_window` is never used [INFO] [stdout] --> src/solution/normal/minimum_windown_substring.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | // https://leetcode.com/problems/minimum-window-substring/ [INFO] [stdout] 5 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_perfect_square` is never used [INFO] [stdout] --> src/solution/normal/perfect.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_perfect_square(num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `climb_stairs_recurse` is never used [INFO] [stdout] --> src/solution/dynamic_programming/climb_stairs.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn climb_stairs_recurse(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 3.06s [INFO] running `Command { std: "docker" "inspect" "f2b47eee0e9e39b828e3f62174d5584c8e3415b0bc68a510e56a064e6fb37313", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f2b47eee0e9e39b828e3f62174d5584c8e3415b0bc68a510e56a064e6fb37313", kill_on_drop: false }` [INFO] [stdout] f2b47eee0e9e39b828e3f62174d5584c8e3415b0bc68a510e56a064e6fb37313