[INFO] updating cached repository yxxx5/leetcode_rusrt
[INFO] running `"git" "fetch" "--all"`
[INFO] [stdout] Fetching origin
[INFO] [stderr] From git://github.com/yxxx5/leetcode_rusrt
[INFO] [stderr]  * branch            HEAD       -> FETCH_HEAD
[INFO] running `"git" "clone" "work/cache/sources/gh/yxxx5/leetcode_rusrt" "work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/yxxx5/leetcode_rusrt"`
[INFO] [stderr] Cloning into 'work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/yxxx5/leetcode_rusrt'...
[INFO] [stderr] done.
[INFO] running `"git" "clone" "work/cache/sources/gh/yxxx5/leetcode_rusrt" "work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/yxxx5/leetcode_rusrt"`
[INFO] [stderr] Cloning into 'work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/yxxx5/leetcode_rusrt'...
[INFO] [stderr] done.
[INFO] running `"git" "rev-parse" "HEAD"`
[INFO] [stdout] e6b8b913c85d998a245a3557034b4b7a02c38435
[INFO] sha for GitHub repo yxxx5/leetcode_rusrt: e6b8b913c85d998a245a3557034b4b7a02c38435
[INFO] validating manifest of yxxx5/leetcode_rusrt on toolchain master#a850a426491e14186af2250549bf41256b5938d2
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] validating manifest of yxxx5/leetcode_rusrt on toolchain try#06a150c7d11500b41499224f165e9de1de096768
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+06a150c7d11500b41499224f165e9de1de096768-alt" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] started frobbing yxxx5/leetcode_rusrt
[INFO] finished frobbing yxxx5/leetcode_rusrt
[INFO] frobbed toml for yxxx5/leetcode_rusrt written to work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/yxxx5/leetcode_rusrt/Cargo.toml
[INFO] started frobbing yxxx5/leetcode_rusrt
[INFO] finished frobbing yxxx5/leetcode_rusrt
[INFO] frobbed toml for yxxx5/leetcode_rusrt written to work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/yxxx5/leetcode_rusrt/Cargo.toml
[INFO] crate yxxx5/leetcode_rusrt already has a lockfile, it will not be regenerated
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr] error: the lock file /mnt/crater-raid/crater/work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/yxxx5/leetcode_rusrt/Cargo.lock needs to be updated but --locked was passed to prevent this
[INFO] the lockfile is outdated, regenerating it
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update"`
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+06a150c7d11500b41499224f165e9de1de096768-alt" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update"`
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+06a150c7d11500b41499224f165e9de1de096768-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] checking yxxx5/leetcode_rusrt against try#06a150c7d11500b41499224f165e9de1de096768 for pr-60162
[INFO] running `"docker" "create" "-v" "/mnt/crater-raid/crater/work/local/target-dirs/pr-60162/worker-1/try#06a150c7d11500b41499224f165e9de1de096768:/opt/crater/target:rw,Z" "-v" "/mnt/crater-raid/crater/work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/yxxx5/leetcode_rusrt:/opt/crater/workdir:ro,Z" "-v" "/mnt/crater-raid/crater/work/local/cargo-home:/opt/crater/cargo-home:ro,Z" "-v" "/mnt/crater-raid/crater/work/local/rustup-home:/opt/crater/rustup-home:ro,Z" "-e" "USER_ID=1000" "-e" "SOURCE_DIR=/opt/crater/workdir" "-e" "MAP_USER_ID=1000" "-e" "CARGO_TARGET_DIR=/opt/crater/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/crater/cargo-home" "-e" "RUSTUP_HOME=/opt/crater/rustup-home" "-w" "/opt/crater/workdir" "-m" "1536M" "--network" "none" "rustops/crates-build-env" "/opt/crater/cargo-home/bin/cargo" "+06a150c7d11500b41499224f165e9de1de096768-alt" "check" "--frozen" "--all" "--all-targets"`
[INFO] [stdout] 664887cb71f28e94e29430c4bcd00b0566f80832bc8de9fc13369201fc18c757
[INFO] running `"docker" "start" "-a" "664887cb71f28e94e29430c4bcd00b0566f80832bc8de9fc13369201fc18c757"`
[INFO] [stderr]    Compiling ryu v0.2.7
[INFO] [stderr]    Compiling serde v1.0.90
[INFO] [stderr]    Compiling serde_json v1.0.39
[INFO] [stderr]    Compiling leetcode_test v0.1.1
[INFO] [stderr]     Checking leetcode_prelude v0.2.2
[INFO] [stderr]     Checking leetcode_rust v0.1.0 (/opt/crater/workdir)
[INFO] [stderr] warning: unused import: `Solution617`
[INFO] [stderr]  --> src/main.rs:3:26
[INFO] [stderr]   |
[INFO] [stderr] 3 | use crate::merge_trees::{Solution617, makeRcTree};
[INFO] [stderr]   |                          ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(unused_imports)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::makeRcTree`
[INFO] [stderr]  --> src/binary_tree_inorder_traversal/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use super::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::binary_tree_inorder_traversal::*`
[INFO] [stderr]  --> src/main.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 | use crate::binary_tree_inorder_traversal::*;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::single_number::*`
[INFO] [stderr]   --> src/main.rs:11:5
[INFO] [stderr]    |
[INFO] [stderr] 11 | use crate::single_number::*;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::makeRcTree`
[INFO] [stderr]  --> src/kth_smallest_element_in_a_bst/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use super::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::kth_smallest_element_in_a_bst::Solution230`
[INFO] [stderr]   --> src/main.rs:14:5
[INFO] [stderr]    |
[INFO] [stderr] 14 | use crate::kth_smallest_element_in_a_bst::Solution230;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::num_unique_emails::Solution929`
[INFO] [stderr]   --> src/main.rs:17:5
[INFO] [stderr]    |
[INFO] [stderr] 17 | use crate::num_unique_emails::Solution929;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::makeRcTree`
[INFO] [stderr]  --> src/maximum_depth_of_binary_tree/mod.rs:5:5
[INFO] [stderr]   |
[INFO] [stderr] 5 | use super::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::makeRcTree`
[INFO] [stderr]  --> src/invert_binary_tree/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use super::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `peak_index_in_a_mountain_array::Solution852`
[INFO] [stderr]   --> src/main.rs:24:5
[INFO] [stderr]    |
[INFO] [stderr] 24 | use peak_index_in_a_mountain_array::Solution852;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]  --> src/self_dividing_numbers/mod.rs:6:16
[INFO] [stderr]   |
[INFO] [stderr] 6 |             if (i < 10) {
[INFO] [stderr]   |                ^^^^^^^^ help: remove these parentheses
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(unused_parens)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::merge_trees::makeRcTree`
[INFO] [stderr]  --> src/univalued_binary_tree/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use crate::merge_trees::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::merge_trees::makeRcTree`
[INFO] [stderr]  --> src/search_in_a_binary_search_tree/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 | use crate::merge_trees::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/longest_substring_without_repeating_characters/mod.rs:18:12
[INFO] [stderr]    |
[INFO] [stderr] 18 |         if (len == 1) {
[INFO] [stderr]    |            ^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]  --> src/majority_element/mod.rs:9:16
[INFO] [stderr]   |
[INFO] [stderr] 9 |             if (cnt == 0) {
[INFO] [stderr]   |                ^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/majority_element/mod.rs:13:20
[INFO] [stderr]    |
[INFO] [stderr] 13 |                 if (res == x) {
[INFO] [stderr]    |                    ^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:19:16
[INFO] [stderr]    |
[INFO] [stderr] 19 |             if (nums1[i1] == nums2[i2]) {
[INFO] [stderr]    |                ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `while` condition
[INFO] [stderr]   --> src/my_sqrt/mod.rs:14:15
[INFO] [stderr]    |
[INFO] [stderr] 14 |         while (left < right) {
[INFO] [stderr]    |               ^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/smallest_range_i/mod.rs:12:12
[INFO] [stderr]    |
[INFO] [stderr] 12 |         if (max - k <= min + k) {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/shortest_distance_to_a_character/mod.rs:19:20
[INFO] [stderr]    |
[INFO] [stderr] 19 |                 if (i as i32 == *j) {
[INFO] [stderr]    |                    ^^^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp::min`
[INFO] [stderr]  --> src/minimum_absolute_difference_in_bst/mod.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cmp::min;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::makeRcTree`
[INFO] [stderr]  --> src/minimum_absolute_difference_in_bst/mod.rs:7:5
[INFO] [stderr]   |
[INFO] [stderr] 7 | use super::makeRcTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `Solution617`
[INFO] [stderr]  --> src/main.rs:3:26
[INFO] [stderr]   |
[INFO] [stderr] 3 | use crate::merge_trees::{Solution617, makeRcTree};
[INFO] [stderr]   |                          ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(unused_imports)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::binary_tree_inorder_traversal::*`
[INFO] [stderr]  --> src/main.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 | use crate::binary_tree_inorder_traversal::*;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::single_number::*`
[INFO] [stderr]   --> src/main.rs:11:5
[INFO] [stderr]    |
[INFO] [stderr] 11 | use crate::single_number::*;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::kth_smallest_element_in_a_bst::Solution230`
[INFO] [stderr]   --> src/main.rs:14:5
[INFO] [stderr]    |
[INFO] [stderr] 14 | use crate::kth_smallest_element_in_a_bst::Solution230;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::num_unique_emails::Solution929`
[INFO] [stderr]   --> src/main.rs:17:5
[INFO] [stderr]    |
[INFO] [stderr] 17 | use crate::num_unique_emails::Solution929;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `peak_index_in_a_mountain_array::Solution852`
[INFO] [stderr]   --> src/main.rs:24:5
[INFO] [stderr]    |
[INFO] [stderr] 24 | use peak_index_in_a_mountain_array::Solution852;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]  --> src/self_dividing_numbers/mod.rs:6:16
[INFO] [stderr]   |
[INFO] [stderr] 6 |             if (i < 10) {
[INFO] [stderr]   |                ^^^^^^^^ help: remove these parentheses
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(unused_parens)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/longest_substring_without_repeating_characters/mod.rs:18:12
[INFO] [stderr]    |
[INFO] [stderr] 18 |         if (len == 1) {
[INFO] [stderr]    |            ^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]  --> src/majority_element/mod.rs:9:16
[INFO] [stderr]   |
[INFO] [stderr] 9 |             if (cnt == 0) {
[INFO] [stderr]   |                ^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/majority_element/mod.rs:13:20
[INFO] [stderr]    |
[INFO] [stderr] 13 |                 if (res == x) {
[INFO] [stderr]    |                    ^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:19:16
[INFO] [stderr]    |
[INFO] [stderr] 19 |             if (nums1[i1] == nums2[i2]) {
[INFO] [stderr]    |                ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `while` condition
[INFO] [stderr]   --> src/my_sqrt/mod.rs:14:15
[INFO] [stderr]    |
[INFO] [stderr] 14 |         while (left < right) {
[INFO] [stderr]    |               ^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/smallest_range_i/mod.rs:12:12
[INFO] [stderr]    |
[INFO] [stderr] 12 |         if (max - k <= min + k) {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around `if` condition
[INFO] [stderr]   --> src/shortest_distance_to_a_character/mod.rs:19:20
[INFO] [stderr]    |
[INFO] [stderr] 19 |                 if (i as i32 == *j) {
[INFO] [stderr]    |                    ^^^^^^^^^^^^^^^^ help: remove these parentheses
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp::min`
[INFO] [stderr]  --> src/minimum_absolute_difference_in_bst/mod.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cmp::min;
[INFO] [stderr]   |     ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: use of deprecated item 'core::str::<impl str>::trim_right': superseded by `trim_end`
[INFO] [stderr]   --> src/reverse_words_in_a_string_iii/mod.rs:12:19
[INFO] [stderr]    |
[INFO] [stderr] 12 |         res = res.trim_right().to_string();
[INFO] [stderr]    |                   ^^^^^^^^^^ help: replace the use of the deprecated item: `trim_end`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(deprecated)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `n`
[INFO] [stderr]   --> src/next_permutation/mod.rs:10:17
[INFO] [stderr]    |
[INFO] [stderr] 10 |         for (i, n) in nums.iter().enumerate() {
[INFO] [stderr]    |                 ^ help: consider prefixing with an underscore: `_n`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(unused_variables)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]  --> src/num_unique_emails/mod.rs:8:14
[INFO] [stderr]   |
[INFO] [stderr] 8 |         for (i, s) in emails.iter().enumerate() {
[INFO] [stderr]   |              ^ help: consider prefixing with an underscore: `_i`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `n` is never read
[INFO] [stderr]   --> src/maximum_depth_of_binary_tree/mod.rs:10:17
[INFO] [stderr]    |
[INFO] [stderr] 10 |         let mut n= 0;
[INFO] [stderr]    |                 ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(unused_assignments)] on by default
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `newt` is never read
[INFO] [stderr]   --> src/invert_binary_tree/mod.rs:11:17
[INFO] [stderr]    |
[INFO] [stderr] 11 |         let mut newt: Option<Rc<RefCell<TreeNode>>> = None;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `c` is never read
[INFO] [stderr]   --> src/longest_substring_without_repeating_characters/mod.rs:24:17
[INFO] [stderr]    |
[INFO] [stderr] 24 |         let mut c = "";
[INFO] [stderr]    |                 ^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/number_of_recent_calls/mod.rs:25:13
[INFO] [stderr]    |
[INFO] [stderr] 25 |         let mut count = 0;
[INFO] [stderr]    |             ----^^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(unused_mut)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/reverse_string/mod.rs:10:17
[INFO] [stderr]    |
[INFO] [stderr] 10 |             let mut temp = s[i];
[INFO] [stderr]    |                 ----^^^^
[INFO] [stderr]    |                 |
[INFO] [stderr]    |                 help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution617`
[INFO] [stderr]  --> src/merge_trees/mod.rs:6:1
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct Solution617{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(dead_code)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `merge_trees`
[INFO] [stderr]  --> src/merge_trees/mod.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 |     pub fn merge_trees(t1: Option<Rc<RefCell<TreeNode>>>, t2: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `makeRcTree`
[INFO] [stderr]   --> src/merge_trees/mod.rs:49:1
[INFO] [stderr]    |
[INFO] [stderr] 49 | pub fn makeRcTree(val:i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution31`
[INFO] [stderr]  --> src/next_permutation/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution31 {}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `next_permutation`
[INFO] [stderr]  --> src/next_permutation/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn next_permutation(nums: &mut Vec<i32>) {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution94`
[INFO] [stderr]  --> src/binary_tree_inorder_traversal/mod.rs:6:1
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct Solution94{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `inorder_traversal`
[INFO] [stderr]  --> src/binary_tree_inorder_traversal/mod.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution136`
[INFO] [stderr]  --> src/single_number/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution136{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `single_number`
[INFO] [stderr]  --> src/single_number/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 |     pub fn single_number(nums: Vec<i32>) -> i32{
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution230`
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:16:1
[INFO] [stderr]    |
[INFO] [stderr] 16 | pub struct Solution230{}
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `kth_smallest`
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:19:5
[INFO] [stderr]    |
[INFO] [stderr] 19 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `treeLen`
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:40:1
[INFO] [stderr]    |
[INFO] [stderr] 40 | fn treeLen(root: Option<Rc<RefCell<TreeNode>>>) -> i32{
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max`
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:52:1
[INFO] [stderr]    |
[INFO] [stderr] 52 | fn max(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution929`
[INFO] [stderr]  --> src/num_unique_emails/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution929{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `num_unique_emails`
[INFO] [stderr]  --> src/num_unique_emails/mod.rs:5:5
[INFO] [stderr]   |
[INFO] [stderr] 5 |     pub fn num_unique_emails(emails: Vec<String>) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution104`
[INFO] [stderr]  --> src/maximum_depth_of_binary_tree/mod.rs:7:1
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub struct Solution104{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `max_depth`
[INFO] [stderr]  --> src/maximum_depth_of_binary_tree/mod.rs:9:5
[INFO] [stderr]   |
[INFO] [stderr] 9 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution226`
[INFO] [stderr]  --> src/invert_binary_tree/mod.rs:8:1
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub struct Solution226{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `invert_tree`
[INFO] [stderr]   --> src/invert_binary_tree/mod.rs:10:5
[INFO] [stderr]    |
[INFO] [stderr] 10 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution852`
[INFO] [stderr]  --> src/peak_index_in_a_mountain_array/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution852{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `peak_index_in_mountain_array`
[INFO] [stderr]  --> src/peak_index_in_a_mountain_array/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn peak_index_in_mountain_array(a: Vec<i32>) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution728`
[INFO] [stderr]  --> src/self_dividing_numbers/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub  struct  Solution728{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `self_dividing_numbers`
[INFO] [stderr]  --> src/self_dividing_numbers/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn self_dividing_numbers(left: i32, right: i32) -> Vec<i32> {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `test`
[INFO] [stderr]   --> src/self_dividing_numbers/mod.rs:16:5
[INFO] [stderr]    |
[INFO] [stderr] 16 |     fn test (n: i32) -> bool {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution292`
[INFO] [stderr]  --> src/nim_game/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution292{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `can_win_nim`
[INFO] [stderr]   --> src/nim_game/mod.rs:17:5
[INFO] [stderr]    |
[INFO] [stderr] 17 |     pub fn can_win_nim(n: i32) -> bool{
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `RecentCounter`
[INFO] [stderr]  --> src/number_of_recent_calls/mod.rs:4:1
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub struct RecentCounter {
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `new`
[INFO] [stderr]   --> src/number_of_recent_calls/mod.rs:15:5
[INFO] [stderr]    |
[INFO] [stderr] 15 |     pub fn new() -> Self {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `ping`
[INFO] [stderr]   --> src/number_of_recent_calls/mod.rs:21:5
[INFO] [stderr]    |
[INFO] [stderr] 21 |     pub fn ping(&mut self, t: i32) -> i32 {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution965`
[INFO] [stderr]  --> src/univalued_binary_tree/mod.rs:6:1
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub struct Solution965{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `is_unival_tree`
[INFO] [stderr]  --> src/univalued_binary_tree/mod.rs:9:5
[INFO] [stderr]   |
[INFO] [stderr] 9 |     pub fn is_unival_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution509`
[INFO] [stderr]  --> src/fibonacci_number/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution509{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `fib`
[INFO] [stderr]  --> src/fibonacci_number/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn fib(n: i32) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution344`
[INFO] [stderr]  --> src/reverse_string/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution344{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `reverse_string`
[INFO] [stderr]  --> src/reverse_string/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution500`
[INFO] [stderr]  --> src/keyboard_row/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution500{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `find_words`
[INFO] [stderr]  --> src/keyboard_row/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn find_words(words: Vec<String>) -> Vec<String> {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `matched`
[INFO] [stderr]   --> src/keyboard_row/mod.rs:16:5
[INFO] [stderr]    |
[INFO] [stderr] 16 |     fn matched(s: &String) -> bool {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution700`
[INFO] [stderr]  --> src/search_in_a_binary_search_tree/mod.rs:7:1
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub struct Solution700{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `search_bst`
[INFO] [stderr]  --> src/search_in_a_binary_search_tree/mod.rs:9:5
[INFO] [stderr]   |
[INFO] [stderr] 9 |     pub fn search_bst(root: Option<Rc<RefCell<TreeNode>>>, val: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution3`
[INFO] [stderr]   --> src/longest_substring_without_repeating_characters/mod.rs:13:1
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub struct Solution3{}
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `length_of_longest_substring`
[INFO] [stderr]   --> src/longest_substring_without_repeating_characters/mod.rs:16:5
[INFO] [stderr]    |
[INFO] [stderr] 16 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution15`
[INFO] [stderr]   --> src/three_sum/mod.rs:13:1
[INFO] [stderr]    |
[INFO] [stderr] 13 | struct Solution15{
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `three_sum`
[INFO] [stderr]   --> src/three_sum/mod.rs:18:5
[INFO] [stderr]    |
[INFO] [stderr] 18 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution169`
[INFO] [stderr]  --> src/majority_element/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution169{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `majority_element`
[INFO] [stderr]  --> src/majority_element/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution349`
[INFO] [stderr]  --> src/intersection_of_two_arrays/mod.rs:8:1
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub struct Solution349{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `intersection`
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:10:5
[INFO] [stderr]    |
[INFO] [stderr] 10 |     pub fn intersection(mut nums1: Vec<i32>, mut nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution657`
[INFO] [stderr]  --> src/robot_return_to_origin/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution657{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `judge_circle`
[INFO] [stderr]  --> src/robot_return_to_origin/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn judge_circle(moves: String) -> bool {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution942`
[INFO] [stderr]  --> src/di_string_match/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution942 {}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `di_string_match`
[INFO] [stderr]   --> src/di_string_match/mod.rs:11:5
[INFO] [stderr]    |
[INFO] [stderr] 11 |     pub fn di_string_match(s: String) -> Vec<i32> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution69`
[INFO] [stderr]  --> src/my_sqrt/mod.rs:6:1
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct Solution69 {}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `my_sqrt`
[INFO] [stderr]  --> src/my_sqrt/mod.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution561`
[INFO] [stderr]  --> src/array_partition_i/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution561{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `array_pair_sum`
[INFO] [stderr]  --> src/array_partition_i/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 |     pub fn array_pair_sum(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution557`
[INFO] [stderr]  --> src/reverse_words_in_a_string_iii/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution557{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `reverse_words`
[INFO] [stderr]  --> src/reverse_words_in_a_string_iii/mod.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 |     pub fn reverse_words(s: String) -> String {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution908`
[INFO] [stderr]  --> src/smallest_range_i/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution908{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `smallest_range_i`
[INFO] [stderr]  --> src/smallest_range_i/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 |     pub fn smallest_range_i(a: Vec<i32>, k: i32) -> i32 {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution146`
[INFO] [stderr]  --> src/same_tree/mod.rs:4:1
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub struct Solution146{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `is_same_tree`
[INFO] [stderr]  --> src/same_tree/mod.rs:7:5
[INFO] [stderr]   |
[INFO] [stderr] 7 |     pub fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution821`
[INFO] [stderr]  --> src/shortest_distance_to_a_character/mod.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub struct Solution821{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `shortest_to_char`
[INFO] [stderr]  --> src/shortest_distance_to_a_character/mod.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 4 |     pub fn shortest_to_char(s: String, c: char) -> Vec<i32> {
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution530`
[INFO] [stderr]  --> src/minimum_absolute_difference_in_bst/mod.rs:5:1
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub struct Solution530{}
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `get_minimum_difference`
[INFO] [stderr]   --> src/minimum_absolute_difference_in_bst/mod.rs:10:5
[INFO] [stderr]    |
[INFO] [stderr] 10 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t1Left` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:11:17
[INFO] [stderr]    |
[INFO] [stderr] 11 |         let mut t1Left = None;
[INFO] [stderr]    |                 ^^^^^^ help: convert the identifier to snake case: `t1_left`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(non_snake_case)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t1Right` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:12:17
[INFO] [stderr]    |
[INFO] [stderr] 12 |         let mut t1Right = None;
[INFO] [stderr]    |                 ^^^^^^^ help: convert the identifier to snake case: `t1_right`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t2Left` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:13:17
[INFO] [stderr]    |
[INFO] [stderr] 13 |         let mut t2Left = None;
[INFO] [stderr]    |                 ^^^^^^ help: convert the identifier to snake case: `t2_left`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t2Right` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:14:17
[INFO] [stderr]    |
[INFO] [stderr] 14 |         let mut t2Right = None;
[INFO] [stderr]    |                 ^^^^^^^ help: convert the identifier to snake case: `t2_right`
[INFO] [stderr] 
[INFO] [stderr] warning: function `makeRcTree` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:49:8
[INFO] [stderr]    |
[INFO] [stderr] 49 | pub fn makeRcTree(val:i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |        ^^^^^^^^^^ help: convert the identifier to snake case: `make_rc_tree`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `bMin` should have a snake case name
[INFO] [stderr]   --> src/next_permutation/mod.rs:12:21
[INFO] [stderr]    |
[INFO] [stderr] 12 |             let mut bMin = 0;
[INFO] [stderr]    |                     ^^^^ help: convert the identifier to snake case: `b_min`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `leftLen` should have a snake case name
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:23:13
[INFO] [stderr]    |
[INFO] [stderr] 23 |         let leftLen = treeLen(left.clone());
[INFO] [stderr]    |             ^^^^^^^ help: convert the identifier to snake case: `left_len`
[INFO] [stderr] 
[INFO] [stderr] warning: function `treeLen` should have a snake case name
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:40:4
[INFO] [stderr]    |
[INFO] [stderr] 40 | fn treeLen(root: Option<Rc<RefCell<TreeNode>>>) -> i32{
[INFO] [stderr]    |    ^^^^^^^ help: convert the identifier to snake case: `tree_len`
[INFO] [stderr] 
[INFO] [stderr] warning: use of deprecated item 'core::str::<impl str>::trim_right': superseded by `trim_end`
[INFO] [stderr]   --> src/reverse_words_in_a_string_iii/mod.rs:12:19
[INFO] [stderr]    |
[INFO] [stderr] 12 |         res = res.trim_right().to_string();
[INFO] [stderr]    |                   ^^^^^^^^^^ help: replace the use of the deprecated item: `trim_end`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(deprecated)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `t3`
[INFO] [stderr]   --> src/merge_trees/mod.rs:67:13
[INFO] [stderr]    |
[INFO] [stderr] 67 |         let t3 = Solution617::merge_trees(t1, t2);
[INFO] [stderr]    |             ^^ help: consider prefixing with an underscore: `_t3`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(unused_variables)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `n`
[INFO] [stderr]   --> src/next_permutation/mod.rs:10:17
[INFO] [stderr]    |
[INFO] [stderr] 10 |         for (i, n) in nums.iter().enumerate() {
[INFO] [stderr]    |                 ^ help: consider prefixing with an underscore: `_n`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]  --> src/num_unique_emails/mod.rs:8:14
[INFO] [stderr]   |
[INFO] [stderr] 8 |         for (i, s) in emails.iter().enumerate() {
[INFO] [stderr]   |              ^ help: consider prefixing with an underscore: `_i`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `n` is never read
[INFO] [stderr]   --> src/maximum_depth_of_binary_tree/mod.rs:10:17
[INFO] [stderr]    |
[INFO] [stderr] 10 |         let mut n= 0;
[INFO] [stderr]    |                 ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(unused_assignments)] on by default
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `newt` is never read
[INFO] [stderr]   --> src/invert_binary_tree/mod.rs:11:17
[INFO] [stderr]    |
[INFO] [stderr] 11 |         let mut newt: Option<Rc<RefCell<TreeNode>>> = None;
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `n` is never read
[INFO] [stderr]   --> src/number_of_recent_calls/mod.rs:50:17
[INFO] [stderr]    |
[INFO] [stderr] 50 |         let mut n = 0;
[INFO] [stderr]    |                 ^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `c` is never read
[INFO] [stderr]   --> src/longest_substring_without_repeating_characters/mod.rs:24:17
[INFO] [stderr]    |
[INFO] [stderr] 24 |         let mut c = "";
[INFO] [stderr]    |                 ^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/num_unique_emails/mod.rs:47:13
[INFO] [stderr]    |
[INFO] [stderr] 47 |         let mut v = toStringVec(v1);
[INFO] [stderr]    |             ----^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(unused_mut)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/number_of_recent_calls/mod.rs:25:13
[INFO] [stderr]    |
[INFO] [stderr] 25 |         let mut count = 0;
[INFO] [stderr]    |             ----^^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/reverse_string/mod.rs:10:17
[INFO] [stderr]    |
[INFO] [stderr] 10 |             let mut temp = s[i];
[INFO] [stderr]    |                 ----^^^^
[INFO] [stderr]    |                 |
[INFO] [stderr]    |                 help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:42:13
[INFO] [stderr]    |
[INFO] [stderr] 42 |         let mut v1 = vec![1, 2, 2, 1];
[INFO] [stderr]    |             ----^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:43:13
[INFO] [stderr]    |
[INFO] [stderr] 43 |         let mut v2 = vec![2, 2];
[INFO] [stderr]    |             ----^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:44:13
[INFO] [stderr]    |
[INFO] [stderr] 44 |         let mut v3 = vec![4, 9, 5];
[INFO] [stderr]    |             ----^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/intersection_of_two_arrays/mod.rs:45:13
[INFO] [stderr]    |
[INFO] [stderr] 45 |         let mut v4 = vec![9, 4, 9, 8, 4];
[INFO] [stderr]    |             ----^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t1Left` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:11:17
[INFO] [stderr]    |
[INFO] [stderr] 11 |         let mut t1Left = None;
[INFO] [stderr]    |                 ^^^^^^ help: convert the identifier to snake case: `t1_left`
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(non_snake_case)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t1Right` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:12:17
[INFO] [stderr]    |
[INFO] [stderr] 12 |         let mut t1Right = None;
[INFO] [stderr]    |                 ^^^^^^^ help: convert the identifier to snake case: `t1_right`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t2Left` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:13:17
[INFO] [stderr]    |
[INFO] [stderr] 13 |         let mut t2Left = None;
[INFO] [stderr]    |                 ^^^^^^ help: convert the identifier to snake case: `t2_left`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `t2Right` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:14:17
[INFO] [stderr]    |
[INFO] [stderr] 14 |         let mut t2Right = None;
[INFO] [stderr]    |                 ^^^^^^^ help: convert the identifier to snake case: `t2_right`
[INFO] [stderr] 
[INFO] [stderr] warning: function `makeRcTree` should have a snake case name
[INFO] [stderr]   --> src/merge_trees/mod.rs:49:8
[INFO] [stderr]    |
[INFO] [stderr] 49 | pub fn makeRcTree(val:i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |        ^^^^^^^^^^ help: convert the identifier to snake case: `make_rc_tree`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `bMin` should have a snake case name
[INFO] [stderr]   --> src/next_permutation/mod.rs:12:21
[INFO] [stderr]    |
[INFO] [stderr] 12 |             let mut bMin = 0;
[INFO] [stderr]    |                     ^^^^ help: convert the identifier to snake case: `b_min`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `leftLen` should have a snake case name
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:23:13
[INFO] [stderr]    |
[INFO] [stderr] 23 |         let leftLen = treeLen(left.clone());
[INFO] [stderr]    |             ^^^^^^^ help: convert the identifier to snake case: `left_len`
[INFO] [stderr] 
[INFO] [stderr] warning: function `treeLen` should have a snake case name
[INFO] [stderr]   --> src/kth_smallest_element_in_a_bst/mod.rs:40:4
[INFO] [stderr]    |
[INFO] [stderr] 40 | fn treeLen(root: Option<Rc<RefCell<TreeNode>>>) -> i32{
[INFO] [stderr]    |    ^^^^^^^ help: convert the identifier to snake case: `tree_len`
[INFO] [stderr] 
[INFO] [stderr] warning: function `toStringVec` should have a snake case name
[INFO] [stderr]   --> src/num_unique_emails/mod.rs:53:8
[INFO] [stderr]    |
[INFO] [stderr] 53 |     fn toStringVec (v: Vec<&str>) -> Vec<String>{
[INFO] [stderr]    |        ^^^^^^^^^^^ help: convert the identifier to snake case: `to_string_vec`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `A` should have a snake case name
[INFO] [stderr]   --> src/smallest_range_i/mod.rs:25:13
[INFO] [stderr]    |
[INFO] [stderr] 25 |         let A = vec![0, 10];
[INFO] [stderr]    |             ^ help: convert the identifier to snake case: `a`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `K` should have a snake case name
[INFO] [stderr]   --> src/smallest_range_i/mod.rs:26:13
[INFO] [stderr]    |
[INFO] [stderr] 26 |         let K = 2;
[INFO] [stderr]    |             ^ help: convert the identifier to snake case: `k`
[INFO] [stderr] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 22.71s
[INFO] running `"docker" "inspect" "664887cb71f28e94e29430c4bcd00b0566f80832bc8de9fc13369201fc18c757"`
[INFO] running `"docker" "rm" "-f" "664887cb71f28e94e29430c4bcd00b0566f80832bc8de9fc13369201fc18c757"`
[INFO] [stdout] 664887cb71f28e94e29430c4bcd00b0566f80832bc8de9fc13369201fc18c757