[INFO] cloning repository https://github.com/yxxx5/leetcode_rusrt
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/yxxx5/leetcode_rusrt" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fyxxx5%2Fleetcode_rusrt", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fyxxx5%2Fleetcode_rusrt'...
[INFO] [stderr] fatal: write error: No space left on device
[INFO] [stderr] fatal: fetch-pack: invalid index-pack output
[WARN] Retrying crate fetch in 3 seconds (attempt 1)
[INFO] cloning repository https://github.com/yxxx5/leetcode_rusrt
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/yxxx5/leetcode_rusrt" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fyxxx5%2Fleetcode_rusrt", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fyxxx5%2Fleetcode_rusrt'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 31eca0197ae14438fed9f6280b93bbc4ecc26e9b
[INFO] checking yxxx5/leetcode_rusrt against try#1f308f12738d8cc40bb23bf0c8114b37c164bb49 for pr-137268
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fyxxx5%2Fleetcode_rusrt" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/yxxx5/leetcode_rusrt on toolchain 1f308f12738d8cc40bb23bf0c8114b37c164bb49
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/yxxx5/leetcode_rusrt
[INFO] finished tweaking git repo https://github.com/yxxx5/leetcode_rusrt
[INFO] tweaked toml for git repo https://github.com/yxxx5/leetcode_rusrt written to /workspace/builds/worker-3-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/yxxx5/leetcode_rusrt 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" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]      Locking 12 packages to latest compatible versions
[INFO] [stderr]       Adding itoa v1.0.15
[INFO] [stderr]       Adding leetcode_prelude v0.2.3
[INFO] [stderr]       Adding leetcode_test v0.1.2
[INFO] [stderr]       Adding memchr v2.7.4
[INFO] [stderr]       Adding proc-macro2 v1.0.95
[INFO] [stderr]       Adding quote v1.0.40
[INFO] [stderr]       Adding ryu v1.0.20
[INFO] [stderr]       Adding serde v1.0.219
[INFO] [stderr]       Adding serde_derive v1.0.219
[INFO] [stderr]       Adding serde_json v1.0.140
[INFO] [stderr]       Adding syn v2.0.101
[INFO] [stderr]       Adding unicode-ident v1.0.18
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 2d2d050c9b4791c18cdfd83c148b8b10ce28189ac3870e1cac86ac0b881b1d6c
[INFO] running `Command { std: "docker" "start" "-a" "2d2d050c9b4791c18cdfd83c148b8b10ce28189ac3870e1cac86ac0b881b1d6c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "2d2d050c9b4791c18cdfd83c148b8b10ce28189ac3870e1cac86ac0b881b1d6c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "2d2d050c9b4791c18cdfd83c148b8b10ce28189ac3870e1cac86ac0b881b1d6c", kill_on_drop: false }`
[INFO] [stdout] 2d2d050c9b4791c18cdfd83c148b8b10ce28189ac3870e1cac86ac0b881b1d6c
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 0cae897480461f96c204a1ac0a2ac9c295ca32f9d9c6ff5c7f9cb4d32573e7bd
[INFO] running `Command { std: "docker" "start" "-a" "0cae897480461f96c204a1ac0a2ac9c295ca32f9d9c6ff5c7f9cb4d32573e7bd", kill_on_drop: false }`
[INFO] [stderr]    Compiling serde v1.0.219
[INFO] [stderr]    Compiling serde_json v1.0.140
[INFO] [stderr]    Compiling itoa v1.0.15
[INFO] [stderr]    Compiling ryu v1.0.20
[INFO] [stderr]    Compiling memchr v2.7.4
[INFO] [stderr]    Compiling leetcode_test v0.1.2
[INFO] [stderr]     Checking leetcode_prelude v0.2.3
[INFO] [stderr]     Checking leetcode_rust v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `Solution617`
[INFO] [stdout]  --> src/main.rs:3:26
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::merge_trees::{Solution617, makeRcTree};
[INFO] [stdout]   |                          ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::makeRcTree`
[INFO] [stdout]  --> src/binary_tree_inorder_traversal/mod.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use super::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::binary_tree_inorder_traversal::*`
[INFO] [stdout]  --> src/main.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::binary_tree_inorder_traversal::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::single_number::*`
[INFO] [stdout]   --> src/main.rs:11:5
[INFO] [stdout]    |
[INFO] [stdout] 11 | use crate::single_number::*;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::makeRcTree`
[INFO] [stdout]  --> src/kth_smallest_element_in_a_bst/mod.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use super::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::kth_smallest_element_in_a_bst::Solution230`
[INFO] [stdout]   --> src/main.rs:14:5
[INFO] [stdout]    |
[INFO] [stdout] 14 | use crate::kth_smallest_element_in_a_bst::Solution230;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::num_unique_emails::Solution929`
[INFO] [stdout]   --> src/main.rs:17:5
[INFO] [stdout]    |
[INFO] [stdout] 17 | use crate::num_unique_emails::Solution929;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::makeRcTree`
[INFO] [stdout]  --> src/maximum_depth_of_binary_tree/mod.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use super::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::makeRcTree`
[INFO] [stdout]  --> src/invert_binary_tree/mod.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use super::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `peak_index_in_a_mountain_array::Solution852`
[INFO] [stdout]   --> src/main.rs:24:5
[INFO] [stdout]    |
[INFO] [stdout] 24 | use peak_index_in_a_mountain_array::Solution852;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]  --> src/self_dividing_numbers/mod.rs:6:16
[INFO] [stdout]   |
[INFO] [stdout] 6 |             if (i < 10) {
[INFO] [stdout]   |                ^      ^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]   |
[INFO] [stdout] 6 -             if (i < 10) {
[INFO] [stdout] 6 +             if i < 10 {
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::merge_trees::makeRcTree`
[INFO] [stdout]  --> src/univalued_binary_tree/mod.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::merge_trees::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::merge_trees::makeRcTree`
[INFO] [stdout]  --> src/search_in_a_binary_search_tree/mod.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::merge_trees::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/longest_substring_without_repeating_characters/mod.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 |         if (len == 1) {
[INFO] [stdout]    |            ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 18 -         if (len == 1) {
[INFO] [stdout] 18 +         if len == 1 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary trailing semicolon
[INFO] [stdout]  --> src/majority_element/mod.rs:6:29
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let mut cnt:i32 = 0;;
[INFO] [stdout]   |                             ^ help: remove this semicolon
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(redundant_semicolons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]  --> src/majority_element/mod.rs:9:16
[INFO] [stdout]   |
[INFO] [stdout] 9 |             if (cnt == 0) {
[INFO] [stdout]   |                ^        ^
[INFO] [stdout]   |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]   |
[INFO] [stdout] 9 -             if (cnt == 0) {
[INFO] [stdout] 9 +             if cnt == 0 {
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/majority_element/mod.rs:13:20
[INFO] [stdout]    |
[INFO] [stdout] 13 |                 if (res == x) {
[INFO] [stdout]    |                    ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 13 -                 if (res == x) {
[INFO] [stdout] 13 +                 if res == x {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/intersection_of_two_arrays/mod.rs:19:16
[INFO] [stdout]    |
[INFO] [stdout] 19 |             if (nums1[i1] == nums2[i2]) {
[INFO] [stdout]    |                ^                      ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 19 -             if (nums1[i1] == nums2[i2]) {
[INFO] [stdout] 19 +             if nums1[i1] == nums2[i2] {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/my_sqrt/mod.rs:14:15
[INFO] [stdout]    |
[INFO] [stdout] 14 |         while (left < right) {
[INFO] [stdout]    |               ^            ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 14 -         while (left < right) {
[INFO] [stdout] 14 +         while left < right {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/smallest_range_i/mod.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 12 |         if (max - k <= min + k) {
[INFO] [stdout]    |            ^                  ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 12 -         if (max - k <= min + k) {
[INFO] [stdout] 12 +         if max - k <= min + k {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/shortest_distance_to_a_character/mod.rs:19:20
[INFO] [stdout]    |
[INFO] [stdout] 19 |                 if (i as i32 == *j) {
[INFO] [stdout]    |                    ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 19 -                 if (i as i32 == *j) {
[INFO] [stdout] 19 +                 if i as i32 == *j {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::min`
[INFO] [stdout]  --> src/minimum_absolute_difference_in_bst/mod.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::cmp::min;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::makeRcTree`
[INFO] [stdout]  --> src/minimum_absolute_difference_in_bst/mod.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 | use super::makeRcTree;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/binary_gap/mod.rs:10:20
[INFO] [stdout]    |
[INFO] [stdout] 10 |                 if (m > res) {
[INFO] [stdout]    |                    ^       ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 10 -                 if (m > res) {
[INFO] [stdout] 10 +                 if m > res {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]  --> src/fixed_point/mod.rs:6:16
[INFO] [stdout]   |
[INFO] [stdout] 6 |             if (j == i as i32) {
[INFO] [stdout]   |                ^             ^
[INFO] [stdout]   |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]   |
[INFO] [stdout] 6 -             if (j == i as i32) {
[INFO] [stdout] 6 +             if j == i as i32 {
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Solution617`
[INFO] [stdout]  --> src/main.rs:3:26
[INFO] [stdout]   |
[INFO] [stdout] 3 | use crate::merge_trees::{Solution617, makeRcTree};
[INFO] [stdout]   |                          ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::binary_tree_inorder_traversal::*`
[INFO] [stdout]  --> src/main.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::binary_tree_inorder_traversal::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::single_number::*`
[INFO] [stdout]   --> src/main.rs:11:5
[INFO] [stdout]    |
[INFO] [stdout] 11 | use crate::single_number::*;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::kth_smallest_element_in_a_bst::Solution230`
[INFO] [stdout]   --> src/main.rs:14:5
[INFO] [stdout]    |
[INFO] [stdout] 14 | use crate::kth_smallest_element_in_a_bst::Solution230;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::num_unique_emails::Solution929`
[INFO] [stdout]   --> src/main.rs:17:5
[INFO] [stdout]    |
[INFO] [stdout] 17 | use crate::num_unique_emails::Solution929;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `peak_index_in_a_mountain_array::Solution852`
[INFO] [stdout]   --> src/main.rs:24:5
[INFO] [stdout]    |
[INFO] [stdout] 24 | use peak_index_in_a_mountain_array::Solution852;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]  --> src/self_dividing_numbers/mod.rs:6:16
[INFO] [stdout]   |
[INFO] [stdout] 6 |             if (i < 10) {
[INFO] [stdout]   |                ^      ^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]   |
[INFO] [stdout] 6 -             if (i < 10) {
[INFO] [stdout] 6 +             if i < 10 {
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/longest_substring_without_repeating_characters/mod.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 |         if (len == 1) {
[INFO] [stdout]    |            ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 18 -         if (len == 1) {
[INFO] [stdout] 18 +         if len == 1 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary trailing semicolon
[INFO] [stdout]  --> src/majority_element/mod.rs:6:29
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let mut cnt:i32 = 0;;
[INFO] [stdout]   |                             ^ help: remove this semicolon
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(redundant_semicolons)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]  --> src/majority_element/mod.rs:9:16
[INFO] [stdout]   |
[INFO] [stdout] 9 |             if (cnt == 0) {
[INFO] [stdout]   |                ^        ^
[INFO] [stdout]   |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]   |
[INFO] [stdout] 9 -             if (cnt == 0) {
[INFO] [stdout] 9 +             if cnt == 0 {
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/majority_element/mod.rs:13:20
[INFO] [stdout]    |
[INFO] [stdout] 13 |                 if (res == x) {
[INFO] [stdout]    |                    ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 13 -                 if (res == x) {
[INFO] [stdout] 13 +                 if res == x {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/intersection_of_two_arrays/mod.rs:19:16
[INFO] [stdout]    |
[INFO] [stdout] 19 |             if (nums1[i1] == nums2[i2]) {
[INFO] [stdout]    |                ^                      ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 19 -             if (nums1[i1] == nums2[i2]) {
[INFO] [stdout] 19 +             if nums1[i1] == nums2[i2] {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `while` condition
[INFO] [stdout]   --> src/my_sqrt/mod.rs:14:15
[INFO] [stdout]    |
[INFO] [stdout] 14 |         while (left < right) {
[INFO] [stdout]    |               ^            ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 14 -         while (left < right) {
[INFO] [stdout] 14 +         while left < right {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/smallest_range_i/mod.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 12 |         if (max - k <= min + k) {
[INFO] [stdout]    |            ^                  ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 12 -         if (max - k <= min + k) {
[INFO] [stdout] 12 +         if max - k <= min + k {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/shortest_distance_to_a_character/mod.rs:19:20
[INFO] [stdout]    |
[INFO] [stdout] 19 |                 if (i as i32 == *j) {
[INFO] [stdout]    |                    ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 19 -                 if (i as i32 == *j) {
[INFO] [stdout] 19 +                 if i as i32 == *j {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::min`
[INFO] [stdout]  --> src/minimum_absolute_difference_in_bst/mod.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::cmp::min;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/binary_gap/mod.rs:10:20
[INFO] [stdout]    |
[INFO] [stdout] 10 |                 if (m > res) {
[INFO] [stdout]    |                    ^       ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 10 -                 if (m > res) {
[INFO] [stdout] 10 +                 if m > res {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]  --> src/fixed_point/mod.rs:6:16
[INFO] [stdout]   |
[INFO] [stdout] 6 |             if (j == i as i32) {
[INFO] [stdout]   |                ^             ^
[INFO] [stdout]   |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]   |
[INFO] [stdout] 6 -             if (j == i as i32) {
[INFO] [stdout] 6 +             if j == i as i32 {
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
[INFO] [stdout]   --> src/reverse_words_in_a_string_iii/mod.rs:12:19
[INFO] [stdout]    |
[INFO] [stdout] 12 |         res = res.trim_right().to_string();
[INFO] [stdout]    |                   ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] help: replace the use of the deprecated method
[INFO] [stdout]    |
[INFO] [stdout] 12 -         res = res.trim_right().to_string();
[INFO] [stdout] 12 +         res = res.trim_end().to_string();
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/next_permutation/mod.rs:10:17
[INFO] [stdout]    |
[INFO] [stdout] 10 |         for (i, n) in nums.iter().enumerate() {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]  --> src/num_unique_emails/mod.rs:8:14
[INFO] [stdout]   |
[INFO] [stdout] 8 |         for (i, s) in emails.iter().enumerate() {
[INFO] [stdout]   |              ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `n` is never read
[INFO] [stdout]   --> src/maximum_depth_of_binary_tree/mod.rs:10:17
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut n= 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 `newt` is never read
[INFO] [stdout]   --> src/invert_binary_tree/mod.rs:11:17
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut newt: Option<Rc<RefCell<TreeNode>>> = None;
[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/number_of_recent_calls/mod.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut count = 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: variable does not need to be mutable
[INFO] [stdout]   --> src/reverse_string/mod.rs:10:17
[INFO] [stdout]    |
[INFO] [stdout] 10 |             let mut temp = s[i];
[INFO] [stdout]    |                 ----^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `c` is never read
[INFO] [stdout]   --> src/longest_substring_without_repeating_characters/mod.rs:24:17
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let mut c = "";
[INFO] [stdout]    |                 ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
[INFO] [stdout]   --> src/reverse_words_in_a_string_iii/mod.rs:12:19
[INFO] [stdout]    |
[INFO] [stdout] 12 |         res = res.trim_right().to_string();
[INFO] [stdout]    |                   ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] help: replace the use of the deprecated method
[INFO] [stdout]    |
[INFO] [stdout] 12 -         res = res.trim_right().to_string();
[INFO] [stdout] 12 +         res = res.trim_end().to_string();
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution617` is never constructed
[INFO] [stdout]  --> src/merge_trees/mod.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution617{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_trees` is never used
[INFO] [stdout]  --> src/merge_trees/mod.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution617 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn merge_trees(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `makeRcTree` is never used
[INFO] [stdout]   --> src/merge_trees/mod.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn makeRcTree(val:i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution31` is never constructed
[INFO] [stdout]  --> src/next_permutation/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution31 {}
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_permutation` is never used
[INFO] [stdout]  --> src/next_permutation/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution31 {
[INFO] [stdout]   | --------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn next_permutation(nums: &mut Vec<i32>) {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution94` is never constructed
[INFO] [stdout]  --> src/binary_tree_inorder_traversal/mod.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution94{}
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `inorder_traversal` is never used
[INFO] [stdout]  --> src/binary_tree_inorder_traversal/mod.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution94 {
[INFO] [stdout]   | --------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution136` is never constructed
[INFO] [stdout]  --> src/single_number/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution136{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]  --> src/single_number/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution136 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn single_number(nums: Vec<i32>) -> i32{
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution230` is never constructed
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub struct Solution230{}
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_smallest` is never used
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Solution230 {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 19 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `treeLen` is never used
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn treeLen(root: Option<Rc<RefCell<TreeNode>>>) -> i32{
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max` is never used
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:52:4
[INFO] [stdout]    |
[INFO] [stdout] 52 | fn max(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution929` is never constructed
[INFO] [stdout]  --> src/num_unique_emails/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution929{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_unique_emails` is never used
[INFO] [stdout]  --> src/num_unique_emails/mod.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution929 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn num_unique_emails(emails: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution104` is never constructed
[INFO] [stdout]  --> src/maximum_depth_of_binary_tree/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Solution104{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]  --> src/maximum_depth_of_binary_tree/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution104 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution226` is never constructed
[INFO] [stdout]  --> src/invert_binary_tree/mod.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub struct Solution226{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]   --> src/invert_binary_tree/mod.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl Solution226 {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution852` is never constructed
[INFO] [stdout]  --> src/peak_index_in_a_mountain_array/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution852{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `peak_index_in_mountain_array` is never used
[INFO] [stdout]  --> src/peak_index_in_a_mountain_array/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution852 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn peak_index_in_mountain_array(a: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution728` is never constructed
[INFO] [stdout]  --> src/self_dividing_numbers/mod.rs:1:14
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub  struct  Solution728{}
[INFO] [stdout]   |              ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `self_dividing_numbers` and `test` are never used
[INFO] [stdout]   --> src/self_dividing_numbers/mod.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout] 2  | impl Solution728 {
[INFO] [stdout]    | ---------------- associated functions in this implementation
[INFO] [stdout] 3  |     pub fn self_dividing_numbers(left: i32, right: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn test (n: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution292` is never constructed
[INFO] [stdout]  --> src/nim_game/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution292{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_win_nim` is never used
[INFO] [stdout]   --> src/nim_game/mod.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution292{
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 17 |     pub fn can_win_nim(n: i32) -> bool{
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RecentCounter` is never constructed
[INFO] [stdout]  --> src/number_of_recent_calls/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct RecentCounter {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `ping` are never used
[INFO] [stdout]   --> src/number_of_recent_calls/mod.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl RecentCounter {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 14 |
[INFO] [stdout] 15 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn ping(&mut self, t: i32) -> i32 {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution965` is never constructed
[INFO] [stdout]  --> src/univalued_binary_tree/mod.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution965{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_unival_tree` is never used
[INFO] [stdout]  --> src/univalued_binary_tree/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution965 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_unival_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution509` is never constructed
[INFO] [stdout]  --> src/fibonacci_number/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution509{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `fib` is never used
[INFO] [stdout]  --> src/fibonacci_number/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution509 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn fib(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution344` is never constructed
[INFO] [stdout]  --> src/reverse_string/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution344{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_string` is never used
[INFO] [stdout]  --> src/reverse_string/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution344 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution500` is never constructed
[INFO] [stdout]  --> src/keyboard_row/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution500{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_words` and `matched` are never used
[INFO] [stdout]   --> src/keyboard_row/mod.rs:3:12
[INFO] [stdout]    |
[INFO] [stdout] 2  | impl Solution500{
[INFO] [stdout]    | ---------------- associated functions in this implementation
[INFO] [stdout] 3  |     pub fn find_words(words: Vec<String>) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn matched(s: &String) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution700` is never constructed
[INFO] [stdout]  --> src/search_in_a_binary_search_tree/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Solution700{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_bst` is never used
[INFO] [stdout]  --> src/search_in_a_binary_search_tree/mod.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution700 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn search_bst(root: Option<Rc<RefCell<TreeNode>>>, val: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution3` is never constructed
[INFO] [stdout]   --> src/longest_substring_without_repeating_characters/mod.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub struct Solution3{}
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/longest_substring_without_repeating_characters/mod.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution3 {
[INFO] [stdout]    | -------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution15` is never constructed
[INFO] [stdout]   --> src/three_sum/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution15{
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]   --> src/three_sum/mod.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Solution15 {
[INFO] [stdout]    | --------------- associated function in this implementation
[INFO] [stdout] 18 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution169` is never constructed
[INFO] [stdout]  --> src/majority_element/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution169{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `majority_element` is never used
[INFO] [stdout]  --> src/majority_element/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution169 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t3`
[INFO] [stdout]   --> src/merge_trees/mod.rs:67:13
[INFO] [stdout]    |
[INFO] [stdout] 67 |         let t3 = Solution617::merge_trees(t1, t2);
[INFO] [stdout]    |             ^^ help: if this is intentional, prefix it with an underscore: `_t3`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution349` is never constructed
[INFO] [stdout]  --> src/intersection_of_two_arrays/mod.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub struct Solution349{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `intersection` is never used
[INFO] [stdout]   --> src/intersection_of_two_arrays/mod.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl Solution349 {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn intersection(mut nums1: Vec<i32>, mut nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution657` is never constructed
[INFO] [stdout]  --> src/robot_return_to_origin/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution657{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `judge_circle` is never used
[INFO] [stdout]  --> src/robot_return_to_origin/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution657 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn judge_circle(moves: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution942` is never constructed
[INFO] [stdout]  --> src/di_string_match/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution942 {}
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `di_string_match` is never used
[INFO] [stdout]   --> src/di_string_match/mod.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution942 {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn di_string_match(s: String) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution69` is never constructed
[INFO] [stdout]  --> src/my_sqrt/mod.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Solution69 {}
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_sqrt` is never used
[INFO] [stdout]  --> src/my_sqrt/mod.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution69 {
[INFO] [stdout]   | --------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution561` is never constructed
[INFO] [stdout]  --> src/array_partition_i/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution561{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `array_pair_sum` is never used
[INFO] [stdout]  --> src/array_partition_i/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution561 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn array_pair_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution557` is never constructed
[INFO] [stdout]  --> src/reverse_words_in_a_string_iii/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution557{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_words` is never used
[INFO] [stdout]  --> src/reverse_words_in_a_string_iii/mod.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution557 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution908` is never constructed
[INFO] [stdout]  --> src/smallest_range_i/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution908{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `smallest_range_i` is never used
[INFO] [stdout]  --> src/smallest_range_i/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution908 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn smallest_range_i(a: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/next_permutation/mod.rs:10:17
[INFO] [stdout]    |
[INFO] [stdout] 10 |         for (i, n) in nums.iter().enumerate() {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution146` is never constructed
[INFO] [stdout]  --> src/same_tree/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution146{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]  --> src/same_tree/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution146 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution821` is never constructed
[INFO] [stdout]  --> src/shortest_distance_to_a_character/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution821{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `shortest_to_char` is never used
[INFO] [stdout]  --> src/shortest_distance_to_a_character/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution821 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn shortest_to_char(s: String, c: char) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution530` is never constructed
[INFO] [stdout]  --> src/minimum_absolute_difference_in_bst/mod.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct Solution530{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_minimum_difference` is never used
[INFO] [stdout]   --> src/minimum_absolute_difference_in_bst/mod.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl Solution530 {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution868` is never constructed
[INFO] [stdout]  --> src/binary_gap/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution868{}
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `binary_gap` is never used
[INFO] [stdout]  --> src/binary_gap/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution868 {
[INFO] [stdout]   | ---------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn binary_gap(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution1064` is never constructed
[INFO] [stdout]  --> src/fixed_point/mod.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution1064{}
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `fixed_point` is never used
[INFO] [stdout]  --> src/fixed_point/mod.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution1064 {
[INFO] [stdout]   | ----------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn fixed_point(a: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t1Left` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:11:17
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut t1Left = None;
[INFO] [stdout]    |                 ^^^^^^ help: convert the identifier to snake case: `t1_left`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t1Right` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:12:17
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut t1Right = None;
[INFO] [stdout]    |                 ^^^^^^^ help: convert the identifier to snake case: `t1_right`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t2Left` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:13:17
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut t2Left = None;
[INFO] [stdout]    |                 ^^^^^^ help: convert the identifier to snake case: `t2_left`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t2Right` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:14:17
[INFO] [stdout]    |
[INFO] [stdout] 14 |         let mut t2Right = None;
[INFO] [stdout]    |                 ^^^^^^^ help: convert the identifier to snake case: `t2_right`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `makeRcTree` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn makeRcTree(val:i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^ help: convert the identifier to snake case: `make_rc_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `bMin` should have a snake case name
[INFO] [stdout]   --> src/next_permutation/mod.rs:12:21
[INFO] [stdout]    |
[INFO] [stdout] 12 |             let mut bMin = 0;
[INFO] [stdout]    |                     ^^^^ help: convert the identifier to snake case: `b_min`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `leftLen` should have a snake case name
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:23:13
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let leftLen = treeLen(left.clone());
[INFO] [stdout]    |             ^^^^^^^ help: convert the identifier to snake case: `left_len`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `treeLen` should have a snake case name
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn treeLen(root: Option<Rc<RefCell<TreeNode>>>) -> i32{
[INFO] [stdout]    |    ^^^^^^^ help: convert the identifier to snake case: `tree_len`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]  --> src/num_unique_emails/mod.rs:8:14
[INFO] [stdout]   |
[INFO] [stdout] 8 |         for (i, s) in emails.iter().enumerate() {
[INFO] [stdout]   |              ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/num_unique_emails/mod.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut v = toStringVec(v1);
[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 `n` is never read
[INFO] [stdout]   --> src/maximum_depth_of_binary_tree/mod.rs:10:17
[INFO] [stdout]    |
[INFO] [stdout] 10 |         let mut n= 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 `newt` is never read
[INFO] [stdout]   --> src/invert_binary_tree/mod.rs:11:17
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut newt: Option<Rc<RefCell<TreeNode>>> = None;
[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/number_of_recent_calls/mod.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut count = 0;
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `n` is never read
[INFO] [stdout]   --> src/number_of_recent_calls/mod.rs:50:17
[INFO] [stdout]    |
[INFO] [stdout] 50 |         let mut n = 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/reverse_string/mod.rs:10:17
[INFO] [stdout]    |
[INFO] [stdout] 10 |             let mut temp = s[i];
[INFO] [stdout]    |                 ----^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `c` is never read
[INFO] [stdout]   --> src/longest_substring_without_repeating_characters/mod.rs:24:17
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let mut c = "";
[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/intersection_of_two_arrays/mod.rs:42:13
[INFO] [stdout]    |
[INFO] [stdout] 42 |         let mut v1 = vec![1, 2, 2, 1];
[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/intersection_of_two_arrays/mod.rs:43:13
[INFO] [stdout]    |
[INFO] [stdout] 43 |         let mut v2 = vec![2, 2];
[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/intersection_of_two_arrays/mod.rs:44:13
[INFO] [stdout]    |
[INFO] [stdout] 44 |         let mut v3 = vec![4, 9, 5];
[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/intersection_of_two_arrays/mod.rs:45:13
[INFO] [stdout]    |
[INFO] [stdout] 45 |         let mut v4 = vec![9, 4, 9, 8, 4];
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t1Left` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:11:17
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut t1Left = None;
[INFO] [stdout]    |                 ^^^^^^ help: convert the identifier to snake case: `t1_left`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t1Right` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:12:17
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut t1Right = None;
[INFO] [stdout]    |                 ^^^^^^^ help: convert the identifier to snake case: `t1_right`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t2Left` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:13:17
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut t2Left = None;
[INFO] [stdout]    |                 ^^^^^^ help: convert the identifier to snake case: `t2_left`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `t2Right` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:14:17
[INFO] [stdout]    |
[INFO] [stdout] 14 |         let mut t2Right = None;
[INFO] [stdout]    |                 ^^^^^^^ help: convert the identifier to snake case: `t2_right`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `makeRcTree` should have a snake case name
[INFO] [stdout]   --> src/merge_trees/mod.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn makeRcTree(val:i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^ help: convert the identifier to snake case: `make_rc_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `bMin` should have a snake case name
[INFO] [stdout]   --> src/next_permutation/mod.rs:12:21
[INFO] [stdout]    |
[INFO] [stdout] 12 |             let mut bMin = 0;
[INFO] [stdout]    |                     ^^^^ help: convert the identifier to snake case: `b_min`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `leftLen` should have a snake case name
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:23:13
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let leftLen = treeLen(left.clone());
[INFO] [stdout]    |             ^^^^^^^ help: convert the identifier to snake case: `left_len`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `treeLen` should have a snake case name
[INFO] [stdout]   --> src/kth_smallest_element_in_a_bst/mod.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn treeLen(root: Option<Rc<RefCell<TreeNode>>>) -> i32{
[INFO] [stdout]    |    ^^^^^^^ help: convert the identifier to snake case: `tree_len`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `toStringVec` should have a snake case name
[INFO] [stdout]   --> src/num_unique_emails/mod.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 |     fn toStringVec (v: Vec<&str>) -> Vec<String>{
[INFO] [stdout]    |        ^^^^^^^^^^^ help: convert the identifier to snake case: `to_string_vec`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `A` should have a snake case name
[INFO] [stdout]   --> src/smallest_range_i/mod.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let A = vec![0, 10];
[INFO] [stdout]    |             ^ help: convert the identifier to snake case: `a`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `K` should have a snake case name
[INFO] [stdout]   --> src/smallest_range_i/mod.rs:26:13
[INFO] [stdout]    |
[INFO] [stdout] 26 |         let K = 2;
[INFO] [stdout]    |             ^ help: convert the identifier to snake case (notice the capitalization): `k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 5.86s
[INFO] running `Command { std: "docker" "inspect" "0cae897480461f96c204a1ac0a2ac9c295ca32f9d9c6ff5c7f9cb4d32573e7bd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0cae897480461f96c204a1ac0a2ac9c295ca32f9d9c6ff5c7f9cb4d32573e7bd", kill_on_drop: false }`
[INFO] [stdout] 0cae897480461f96c204a1ac0a2ac9c295ca32f9d9c6ff5c7f9cb4d32573e7bd