[INFO] cloning repository https://github.com/photoszzt/code_practice
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/photoszzt/code_practice" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 55e40661df4fbadae2e76224236e65dce6b24a37
[INFO] checking photoszzt/code_practice against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fphotoszzt%2Fcode_practice" "/workspace/builds/worker-5-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/photoszzt/code_practice on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] removed /workspace/builds/worker-5-tc1/source/.cargo/config
[INFO] started tweaking git repo https://github.com/photoszzt/code_practice
[INFO] finished tweaking git repo https://github.com/photoszzt/code_practice
[INFO] tweaked toml for git repo https://github.com/photoszzt/code_practice written to /workspace/builds/worker-5-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/photoszzt/code_practice 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" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 42ce7ee2a3ea8e83da704d7aaf75523574824b6231c5b526d40d087882733e30
[INFO] running `Command { std: "docker" "start" "-a" "42ce7ee2a3ea8e83da704d7aaf75523574824b6231c5b526d40d087882733e30", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "42ce7ee2a3ea8e83da704d7aaf75523574824b6231c5b526d40d087882733e30", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "42ce7ee2a3ea8e83da704d7aaf75523574824b6231c5b526d40d087882733e30", kill_on_drop: false }`
[INFO] [stdout] 42ce7ee2a3ea8e83da704d7aaf75523574824b6231c5b526d40d087882733e30
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 2507d63aed29a672c59a363c0beb7e61c90a89aea466c2fcf79937508d9fcf6b
[INFO] running `Command { std: "docker" "start" "-a" "2507d63aed29a672c59a363c0beb7e61c90a89aea466c2fcf79937508d9fcf6b", kill_on_drop: false }`
[INFO] [stderr]     Checking code_practice v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/leetcode/s0001_two_sum.rs:52:20
[INFO] [stdout]    |
[INFO] [stdout] 52 |                 if (idx != *counter_idx) {
[INFO] [stdout]    |                    ^                   ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 52 -                 if (idx != *counter_idx) {
[INFO] [stdout] 52 +                 if idx != *counter_idx {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:32:42
[INFO] [stdout]    |
[INFO] [stdout] 32 | use crate::leetcode::util::linked_list::{to_list, ListNode};
[INFO] [stdout]    |                                          ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:28:28
[INFO] [stdout]    |
[INFO] [stdout] 28 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 29 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:63:29
[INFO] [stdout]    |
[INFO] [stdout] 63 |                 let part1 = (left_tree.val == right_tree.val);
[INFO] [stdout]    |                             ^                               ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 63 -                 let part1 = (left_tree.val == right_tree.val);
[INFO] [stdout] 63 +                 let part1 = left_tree.val == right_tree.val;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:30:28
[INFO] [stdout]    |
[INFO] [stdout] 30 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 31 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:68:15
[INFO] [stdout]    |
[INFO] [stdout] 68 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 68 -         while (!queue.is_empty()) {
[INFO] [stdout] 68 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:30:28
[INFO] [stdout]    |
[INFO] [stdout] 30 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 31 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:68:15
[INFO] [stdout]    |
[INFO] [stdout] 68 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 68 -         while (!queue.is_empty()) {
[INFO] [stdout] 68 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:30:28
[INFO] [stdout]    |
[INFO] [stdout] 30 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 31 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:68:15
[INFO] [stdout]    |
[INFO] [stdout] 68 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 68 -         while (!queue.is_empty()) {
[INFO] [stdout] 68 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 28 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:65:16
[INFO] [stdout]    |
[INFO] [stdout] 65 |             if (left_min == 0) {
[INFO] [stdout]    |                ^             ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 65 -             if (left_min == 0) {
[INFO] [stdout] 65 +             if left_min == 0 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:67:23
[INFO] [stdout]    |
[INFO] [stdout] 67 |             } else if (right_min == 0) {
[INFO] [stdout]    |                       ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 67 -             } else if (right_min == 0) {
[INFO] [stdout] 67 +             } else if right_min == 0 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:45:28
[INFO] [stdout]    |
[INFO] [stdout] 45 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 46 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:45:28
[INFO] [stdout]    |
[INFO] [stdout] 45 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 46 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:64:15
[INFO] [stdout]    |
[INFO] [stdout] 64 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 64 -         while (!queue.is_empty()) {
[INFO] [stdout] 64 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:47:15
[INFO] [stdout]    |
[INFO] [stdout] 47 |         while (arri < word1.len() || arrj < word2.len()) {
[INFO] [stdout]    |               ^                                        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 47 -         while (arri < word1.len() || arrj < word2.len()) {
[INFO] [stdout] 47 +         while arri < word1.len() || arrj < word2.len() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/leetcode/s0001_two_sum.rs:52:20
[INFO] [stdout]    |
[INFO] [stdout] 52 |                 if (idx != *counter_idx) {
[INFO] [stdout]    |                    ^                   ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 52 -                 if (idx != *counter_idx) {
[INFO] [stdout] 52 +                 if idx != *counter_idx {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashSet`
[INFO] [stdout]   --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:79:9
[INFO] [stdout]    |
[INFO] [stdout] 79 |     use std::collections::HashSet;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:63:29
[INFO] [stdout]    |
[INFO] [stdout] 63 |                 let part1 = (left_tree.val == right_tree.val);
[INFO] [stdout]    |                             ^                               ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 63 -                 let part1 = (left_tree.val == right_tree.val);
[INFO] [stdout] 63 +                 let part1 = left_tree.val == right_tree.val;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:68:15
[INFO] [stdout]    |
[INFO] [stdout] 68 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 68 -         while (!queue.is_empty()) {
[INFO] [stdout] 68 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:68:15
[INFO] [stdout]    |
[INFO] [stdout] 68 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 68 -         while (!queue.is_empty()) {
[INFO] [stdout] 68 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:68:15
[INFO] [stdout]    |
[INFO] [stdout] 68 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 68 -         while (!queue.is_empty()) {
[INFO] [stdout] 68 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:65:16
[INFO] [stdout]    |
[INFO] [stdout] 65 |             if (left_min == 0) {
[INFO] [stdout]    |                ^             ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 65 -             if (left_min == 0) {
[INFO] [stdout] 65 +             if left_min == 0 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:67:23
[INFO] [stdout]    |
[INFO] [stdout] 67 |             } else if (right_min == 0) {
[INFO] [stdout]    |                       ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 67 -             } else if (right_min == 0) {
[INFO] [stdout] 67 +             } else if right_min == 0 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:45:28
[INFO] [stdout]    |
[INFO] [stdout] 45 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 46 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:101:9
[INFO] [stdout]     |
[INFO] [stdout] 101 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `to_tree` and `tree`
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:45:28
[INFO] [stdout]    |
[INFO] [stdout] 45 |     leetcode::util::tree::{to_tree, TreeNode},
[INFO] [stdout]    |                            ^^^^^^^
[INFO] [stdout] 46 |     tree,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:102:9
[INFO] [stdout]     |
[INFO] [stdout] 102 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:45:9
[INFO] [stdout]    |
[INFO] [stdout] 45 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:64:15
[INFO] [stdout]    |
[INFO] [stdout] 64 |         while (!queue.is_empty()) {
[INFO] [stdout]    |               ^                 ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 64 -         while (!queue.is_empty()) {
[INFO] [stdout] 64 +         while !queue.is_empty() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:47:15
[INFO] [stdout]    |
[INFO] [stdout] 47 |         while (arri < word1.len() || arrj < word2.len()) {
[INFO] [stdout]    |               ^                                        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 47 -         while (arri < word1.len() || arrj < word2.len()) {
[INFO] [stdout] 47 +         while arri < word1.len() || arrj < word2.len() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:74:9
[INFO] [stdout]    |
[INFO] [stdout] 74 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `pos`
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:64:17
[INFO] [stdout]    |
[INFO] [stdout] 64 |         let mut pos = 0;
[INFO] [stdout]    |                 ^^^ help: if this is intentional, prefix it with an underscore: `_pos`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:64:13
[INFO] [stdout]    |
[INFO] [stdout] 64 |         let mut pos = 0;
[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: value assigned to `cur_num` is never read
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:58:21
[INFO] [stdout]    |
[INFO] [stdout] 58 |             let mut cur_num = 0;
[INFO] [stdout]    |                     ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `start_num` is never read
[INFO] [stdout]    --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17
[INFO] [stdout]     |
[INFO] [stdout] 120 |         let mut start_num = 0;
[INFO] [stdout]     |                 ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `mid` is never read
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:41:17
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let mut mid = 0;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:73:17
[INFO] [stdout]    |
[INFO] [stdout] 73 |             let mut cur_trace = trace.get_mut(level - 1).unwrap();
[INFO] [stdout]    |                 ----^^^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:73:17
[INFO] [stdout]    |
[INFO] [stdout] 73 |             let mut cur_trace = trace.get_mut(level - 1).unwrap();
[INFO] [stdout]    |                 ----^^^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:73:17
[INFO] [stdout]    |
[INFO] [stdout] 73 |             let mut cur_trace = trace.get_mut(level - 1).unwrap();
[INFO] [stdout]    |                 ----^^^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |             for i in 0..qlen {
[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/leetcode/s0001_two_sum.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | 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/leetcode/s0001_two_sum.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:56:12
[INFO] [stdout]    |
[INFO] [stdout] 55 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 56 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0005_longest_palindromic_substring.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_palindrome` is never used
[INFO] [stdout]   --> src/leetcode/s0005_longest_palindromic_substring.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0006_zigzag_conversion.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]   --> src/leetcode/s0006_zigzag_conversion.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 52 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse` is never used
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 36 |     pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0008_string_to_integer_atoi.rs:51:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_atoi` is never used
[INFO] [stdout]   --> src/leetcode/s0008_string_to_integer_atoi.rs:59:12
[INFO] [stdout]    |
[INFO] [stdout] 58 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 59 |     pub fn my_atoi(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0009_palindrome_number.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/leetcode/s0009_palindrome_number.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 42 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 43 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `letter_combinations` is never used
[INFO] [stdout]   --> src/leetcode/s0017_letter_combinations_of_a_phone_number.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 38 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_sqrt` is never used
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 35 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sym` and `is_symmetric` are never used
[INFO] [stdout]   --> src/leetcode/s0101_symmetric_tree.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 57 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 58 |     fn sym(left: Option<Rc<RefCell<TreeNode>>>, right: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:61:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 61 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:61:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 61 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order_bottom` is never used
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:61:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 61 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_depth` is never used
[INFO] [stdout]   --> src/leetcode/s0111_minimum_depth_of_binary_tree.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 56 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 57 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traverse` and `preorder_traversal` are never used
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 74 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 75 |     pub fn traverse(root: Option<Rc<RefCell<TreeNode>>>, trace: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 87 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traverse` and `postorder_traversal` are never used
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 74 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 75 |     pub fn traverse(root: Option<Rc<RefCell<TreeNode>>>, trace: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 88 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LRUCache` is never constructed
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | struct LRUCache {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get`, `put`, `access`, and `remove_lru` are never used
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | impl LRUCache {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 62 |     fn new(capacity: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn get(&mut self, key: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 77 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 87 |     fn access(&mut self, key: i32) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 93 |     fn remove_lru(&mut self) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `move_zeroes` is never used
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0516_longest_palindromic_subsequence.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_palindrome_subseq` is never used
[INFO] [stdout]   --> src/leetcode/s0516_longest_palindromic_subsequence.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 37 |     pub fn longest_palindrome_subseq(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0647_palindromic_substrings.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_substrings` is never used
[INFO] [stdout]   --> src/leetcode/s0647_palindromic_substrings.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 44 |     pub fn count_substrings(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `open_lock` is never used
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:54:12
[INFO] [stdout]    |
[INFO] [stdout] 53 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 54 |     pub fn open_lock(deadends: Vec<String>, target: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `smallest_subsequence` is never used
[INFO] [stdout]   --> src/leetcode/s1081_smallest_subsequence_of_distinct_characters.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn smallest_subsequence(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `array_strings_are_equal` is never used
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn array_strings_are_equal(word1: Vec<String>, word2: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/leetcode/util/linked_list.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     #[inline]
[INFO] [stdout] 9 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_list` is never used
[INFO] [stdout]   --> src/leetcode/util/linked_list.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn to_list(vec: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/leetcode/util/tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_tree` is never used
[INFO] [stdout]   --> src/leetcode/util/tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn to_tree(vec: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `pos`
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:64:17
[INFO] [stdout]    |
[INFO] [stdout] 64 |         let mut pos = 0;
[INFO] [stdout]    |                 ^^^ help: if this is intentional, prefix it with an underscore: `_pos`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 77 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0002_add_two_numbers.rs:64:13
[INFO] [stdout]    |
[INFO] [stdout] 64 |         let mut pos = 0;
[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: value assigned to `cur_num` is never read
[INFO] [stdout]   --> src/leetcode/s0007_reverse_integer.rs:58:21
[INFO] [stdout]    |
[INFO] [stdout] 58 |             let mut cur_num = 0;
[INFO] [stdout]    |                     ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `start_num` is never read
[INFO] [stdout]    --> src/leetcode/s0008_string_to_integer_atoi.rs:120:17
[INFO] [stdout]     |
[INFO] [stdout] 120 |         let mut start_num = 0;
[INFO] [stdout]     |                 ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `mid` is never read
[INFO] [stdout]   --> src/leetcode/s0069_sqrtx.rs:41:17
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let mut mid = 0;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0102_binary_tree_level_order_traversal.rs:73:17
[INFO] [stdout]    |
[INFO] [stdout] 73 |             let mut cur_trace = trace.get_mut(level - 1).unwrap();
[INFO] [stdout]    |                 ----^^^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0103_binary_tree_zigzag_level_order_traversal.rs:73:17
[INFO] [stdout]    |
[INFO] [stdout] 73 |             let mut cur_trace = trace.get_mut(level - 1).unwrap();
[INFO] [stdout]    |                 ----^^^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/leetcode/s0107_binary_tree_level_order_traversal_ii.rs:73:17
[INFO] [stdout]    |
[INFO] [stdout] 73 |             let mut cur_trace = trace.get_mut(level - 1).unwrap();
[INFO] [stdout]    |                 ----^^^^^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/leetcode/s0752_open_the_lock.rs:66:17
[INFO] [stdout]    |
[INFO] [stdout] 66 |             for i in 0..qlen {
[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/leetcode/s0144_binary_tree_preorder_traversal.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traverse` and `preorder_traversal` are never used
[INFO] [stdout]   --> src/leetcode/s0144_binary_tree_preorder_traversal.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 74 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 75 |     pub fn traverse(root: Option<Rc<RefCell<TreeNode>>>, trace: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 87 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traverse` and `postorder_traversal` are never used
[INFO] [stdout]   --> src/leetcode/s0145_binary_tree_postorder_traversal.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 74 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 75 |     pub fn traverse(root: Option<Rc<RefCell<TreeNode>>>, trace: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 88 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0146_lru_cache.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `move_zeroes` is never used
[INFO] [stdout]   --> src/leetcode/s0283_move_zeroes.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `array_strings_are_equal` is never used
[INFO] [stdout]   --> src/leetcode/s1662_check_if_two_string_arrays_are_equivalent.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn array_strings_are_equal(word1: Vec<String>, word2: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 34 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.24s
[INFO] running `Command { std: "docker" "inspect" "2507d63aed29a672c59a363c0beb7e61c90a89aea466c2fcf79937508d9fcf6b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "2507d63aed29a672c59a363c0beb7e61c90a89aea466c2fcf79937508d9fcf6b", kill_on_drop: false }`
[INFO] [stdout] 2507d63aed29a672c59a363c0beb7e61c90a89aea466c2fcf79937508d9fcf6b