[INFO] cloning repository https://github.com/Knapptr/leet_code [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Knapptr/leet_code" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKnapptr%2Fleet_code", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKnapptr%2Fleet_code'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] d657857bc14aee545398956e638fa9028be38f2e [INFO] checking Knapptr/leet_code against try#da0275e101cdc809ce291ed8b64d6f82c6b65467 for pr-134276 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKnapptr%2Fleet_code" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Knapptr/leet_code on toolchain da0275e101cdc809ce291ed8b64d6f82c6b65467 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+da0275e101cdc809ce291ed8b64d6f82c6b65467" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/Knapptr/leet_code [INFO] finished tweaking git repo https://github.com/Knapptr/leet_code [INFO] tweaked toml for git repo https://github.com/Knapptr/leet_code written to /workspace/builds/worker-2-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/Knapptr/leet_code 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" "+da0275e101cdc809ce291ed8b64d6f82c6b65467" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+da0275e101cdc809ce291ed8b64d6f82c6b65467" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 694373103afbdbb10895b5695889005b0010ec3d40d9446bca0cd9da890c9d03 [INFO] running `Command { std: "docker" "start" "-a" "694373103afbdbb10895b5695889005b0010ec3d40d9446bca0cd9da890c9d03", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "694373103afbdbb10895b5695889005b0010ec3d40d9446bca0cd9da890c9d03", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "694373103afbdbb10895b5695889005b0010ec3d40d9446bca0cd9da890c9d03", kill_on_drop: false }` [INFO] [stdout] 694373103afbdbb10895b5695889005b0010ec3d40d9446bca0cd9da890c9d03 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+da0275e101cdc809ce291ed8b64d6f82c6b65467" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 0c6ce4b6a1321d68356bc559326127ee37c29c9818ef04c06dbe02e6e9b3e8ff [INFO] running `Command { std: "docker" "start" "-a" "0c6ce4b6a1321d68356bc559326127ee37c29c9818ef04c06dbe02e6e9b3e8ff", kill_on_drop: false }` [INFO] [stderr] Checking leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `std::rc::Rc` [INFO] [stdout] --> src/destructest.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::rc::Rc; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::mem` [INFO] [stdout] --> src/grind_75/invert_tree.rs:95:5 [INFO] [stdout] | [INFO] [stdout] 95 | use std::mem; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/grind_75/longest_substring.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | collections::HashMap, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/grind_75/lowest_common_ancestor.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/grind_75/majority_element.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/merge_two_bin_trees.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `VecDeque` [INFO] [stdout] --> src/permutations.rs:3:33 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::{HashSet, VecDeque}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated trait `std::ascii::AsciiExt`: use inherent methods instead [INFO] [stdout] --> src/grind_75/valid_palindrome.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ascii::AsciiExt; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::mem` [INFO] [stdout] --> src/grind_75/invert_tree.rs:95:5 [INFO] [stdout] | [INFO] [stdout] 95 | use std::mem; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `collections::HashMap` [INFO] [stdout] --> src/grind_75/longest_substring.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | collections::HashMap, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/grind_75/lowest_common_ancestor.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/grind_75/majority_element.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/merge_two_bin_trees.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `VecDeque` [INFO] [stdout] --> src/permutations.rs:3:33 [INFO] [stdout] | [INFO] [stdout] 3 | use std::collections::{HashSet, VecDeque}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/count_rule.rs:20:18 [INFO] [stdout] | [INFO] [stdout] 20 | _ => rule_index = unreachable!(), [INFO] [stdout] | ^^^^^^^^^^^^^-------------- [INFO] [stdout] | | | [INFO] [stdout] | | any code following this expression is unreachable [INFO] [stdout] | unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated trait `std::ascii::AsciiExt`: use inherent methods instead [INFO] [stdout] --> src/grind_75/valid_palindrome.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ascii::AsciiExt; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ascii::AsciiExt` [INFO] [stdout] --> src/grind_75/valid_palindrome.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ascii::AsciiExt; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/combo_phone.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | let mut solution = String::new(); [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/count_build_good_strings.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | let mut sol = String::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `rule_index` is never read [INFO] [stdout] --> src/count_rule.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | let mut rule_index: i32 = -1; [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: variable does not need to be mutable [INFO] [stdout] --> src/grind_75/insert_interval.rs:9:24 [INFO] [stdout] | [INFO] [stdout] 9 | fn insert_interval(mut intervals: Vec>, new_interval: Vec) -> Vec> { [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/grind_75/insert_interval.rs:31:17 [INFO] [stdout] | [INFO] [stdout] 31 | let mut current_element = &intervals[index]; [INFO] [stdout] | ----^^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/count_rule.rs:20:18 [INFO] [stdout] | [INFO] [stdout] 20 | _ => rule_index = unreachable!(), [INFO] [stdout] | ^^^^^^^^^^^^^-------------- [INFO] [stdout] | | | [INFO] [stdout] | | any code following this expression is unreachable [INFO] [stdout] | unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `char` [INFO] [stdout] --> src/grind_75/longest_substring.rs:24:30 [INFO] [stdout] | [INFO] [stdout] 24 | for (char_index, char) in chars.iter().enumerate() { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_char` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `first_in` [INFO] [stdout] --> src/grind_75/queue_from_stacks.rs:49:13 [INFO] [stdout] | [INFO] [stdout] 49 | let first_in = match self.first_in_one { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_first_in` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/isomorphic_strings.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let mut s_chars: Vec = s.chars().collect(); [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/isomorphic_strings.rs:13:13 [INFO] [stdout] | [INFO] [stdout] 13 | let mut t_chars: Vec = t.chars().collect(); [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/merge_two_bin_trees.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | let mut current_node = match root { [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/merge_two_bin_trees.rs:93:9 [INFO] [stdout] | [INFO] [stdout] 93 | let mut new_node = Rc::new(RefCell::new(TreeNode::new(-1))); [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tree_1` [INFO] [stdout] --> src/merge_two_bin_trees.rs:103:13 [INFO] [stdout] | [INFO] [stdout] 103 | let mut tree_1 = root1.as_ref(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_tree_1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tree_2` [INFO] [stdout] --> src/merge_two_bin_trees.rs:104:13 [INFO] [stdout] | [INFO] [stdout] 104 | let mut tree_2 = root2.as_ref(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_tree_2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `current_node` [INFO] [stdout] --> src/merge_two_bin_trees.rs:107:13 [INFO] [stdout] | [INFO] [stdout] 107 | let mut current_node = merged_tree.clone(); [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/merge_two_bin_trees.rs:103:9 [INFO] [stdout] | [INFO] [stdout] 103 | let mut tree_1 = root1.as_ref(); [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/merge_two_bin_trees.rs:104:9 [INFO] [stdout] | [INFO] [stdout] 104 | let mut tree_2 = root2.as_ref(); [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/merge_two_bin_trees.rs:106:9 [INFO] [stdout] | [INFO] [stdout] 106 | let mut merged_tree = Rc::new(RefCell::new(TreeNode::new(0))); [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/merge_two_bin_trees.rs:107:9 [INFO] [stdout] | [INFO] [stdout] 107 | let mut current_node = merged_tree.clone(); [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/middle_linked_list.rs:15:20 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn middle_node(mut head: Option>) -> Option> { [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/permutations.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | mut solution: Vec, [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/permutations.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | let mut sol = Vec::new(); [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/remove_nth_from_end_2.rs:23:28 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn remove_nth_from_end(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/binary_search.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `HOUR_VALUES` is never used [INFO] [stdout] --> src/binary_watch.rs:25:7 [INFO] [stdout] | [INFO] [stdout] 25 | const HOUR_VALUES: [i32; 5] = [16, 8, 4, 2, 1]; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MINUTE_VALUES` is never used [INFO] [stdout] --> src/binary_watch.rs:26:7 [INFO] [stdout] | [INFO] [stdout] 26 | const MINUTE_VALUES: [i32; 6] = [32, 16, 8, 4, 2, 1]; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `to_time_string` is never used [INFO] [stdout] --> src/binary_watch.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn to_time_string(hour: i32, minute: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/binary_watch.rs:34:4 [INFO] [stdout] | [INFO] [stdout] 34 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_watch` is never used [INFO] [stdout] --> src/binary_watch.rs:86:4 [INFO] [stdout] | [INFO] [stdout] 86 | fn binary_watch(turned_on: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combine` is never used [INFO] [stdout] --> src/combinations.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/combinations.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn backtrack(curr_n: i32, target: i32, k: i32, sol: &mut Vec, sols: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_options` is never used [INFO] [stdout] --> src/combo_phone.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn letter_options(char: char) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/combo_phone.rs:21:4 [INFO] [stdout] | [INFO] [stdout] 21 | fn backtrack(digits: &[char], solution: String, solutions: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_combinations` is never used [INFO] [stdout] --> src/combo_phone.rs:33:4 [INFO] [stdout] | [INFO] [stdout] 33 | fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/count_binary_strings.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_one` is never used [INFO] [stdout] --> src/count_binary_strings.rs:6:4 [INFO] [stdout] | [INFO] [stdout] 6 | fn is_one(char: char) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_binary_substrings` is never used [INFO] [stdout] --> src/count_binary_strings.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn count_binary_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `choices` is never used [INFO] [stdout] --> src/count_build_good_strings.rs:18:4 [INFO] [stdout] | [INFO] [stdout] 18 | fn choices(zero: i32, one: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/count_build_good_strings.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn backtrack(sol: String, solutions: &mut Vec, low: i32, high: i32, zero: i32, one: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `construct_good_strings` is never used [INFO] [stdout] --> src/count_build_good_strings.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn construct_good_strings(low: i32, high: i32, zero: i32, one: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/count_rule.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_matches` is never used [INFO] [stdout] --> src/count_rule.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn count_matches(items: Vec>, rule_key: String, rule_value: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/counting_bits.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_bits` is never used [INFO] [stdout] --> src/counting_bits.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn count_bits(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Person` is never constructed [INFO] [stdout] --> src/destructest.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Person { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide_players` is never used [INFO] [stdout] --> src/divide_players.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn divide_players(skill: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `mock_is_bad_version` is never used [INFO] [stdout] --> src/first_bad_version.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn mock_is_bad_version(first_bad: i32) -> Box bool> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `first_bad_version` is never used [INFO] [stdout] --> src/first_bad_version.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn first_bad_version(n: i32, answer: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `flood_fill` is never used [INFO] [stdout] --> src/flood_fill.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn flood_fill(mut image: Vec>, sr: i32, sc: i32, color: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `map_pairs` is never used [INFO] [stdout] --> src/four_sum.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn map_pairs( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `four_sum` is never used [INFO] [stdout] --> src/four_sum.rs:34:4 [INFO] [stdout] | [INFO] [stdout] 34 | fn four_sum(nums: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `add_bin_chars` is never used [INFO] [stdout] --> src/grind_75/add_binary.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn add_bin_chars(l: char, r: char) -> (char, bool) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_binary` is never used [INFO] [stdout] --> src/grind_75/add_binary.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 13 | pub fn add_binary(mut a: String, mut b: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/grind_75/best_time_stock.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/grind_75/binary_search.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `climb_stairs` is never used [INFO] [stdout] --> src/grind_75/climbing_stairs.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `flood_fill_recursive` and `flood_fill` are never used [INFO] [stdout] --> src/grind_75/flood_fill.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 17 | fn flood_fill_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn flood_fill(mut image: Vec>, sr: i32, sc: i32, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `MergeCase` is never used [INFO] [stdout] --> src/grind_75/insert_interval.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | enum MergeCase { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insert_interval` is never used [INFO] [stdout] --> src/grind_75/insert_interval.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | fn insert_interval(mut intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `invert_tree` and `invert_tree_2nd_attempt` are never used [INFO] [stdout] --> src/grind_75/invert_tree.rs:98:12 [INFO] [stdout] | [INFO] [stdout] 97 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 98 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 138 | pub fn invert_tree_2nd_attempt( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/grind_75/is_balanced.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 18 | #[inline] [INFO] [stdout] 19 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_balanced` is never used [INFO] [stdout] --> src/grind_75/is_balanced.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_palindrome` is never used [INFO] [stdout] --> src/grind_75/longest_palindrome.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn longest_palindrome(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_substring` is never used [INFO] [stdout] --> src/grind_75/longest_substring.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn longest_substring(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/grind_75/lowest_common_ancestor.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | #[inline] [INFO] [stdout] 28 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/grind_75/lowest_common_ancestor.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `majority_element` is never used [INFO] [stdout] --> src/grind_75/majority_element.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `update_matrix` is never used [INFO] [stdout] --> src/grind_75/matrix_01.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn update_matrix(mut mat: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/grind_75/max_sub_array.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/grind_75/merge_sorted.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/grind_75/queue_from_stacks.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/grind_75/queue_from_stacks.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 29 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn peek(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/grind_75/twosum.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_anagram` is never used [INFO] [stdout] --> src/grind_75/valid_anagram.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/grind_75/valid_palindrome.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/grind_75/valid_parens.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_happy` is never used [INFO] [stdout] --> src/happy_number.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn is_happy(mut n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_square_digits` is never used [INFO] [stdout] --> src/happy_number.rs:28:4 [INFO] [stdout] | [INFO] [stdout] 28 | fn sum_square_digits(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/inorder_binary_tree_traversal.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/inorder_binary_tree_traversal.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `inorder_traversal` is never used [INFO] [stdout] --> src/inorder_binary_tree_traversal.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 26 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_isomorphic` is never used [INFO] [stdout] --> src/isomorphic_strings.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn is_isomorphic(s:String, t:String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_longest_substring` is never used [INFO] [stdout] --> src/longest_non_repeating_substring.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bfs` is never used [INFO] [stdout] --> src/matrix_01.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn bfs(mat: Vec>) -> Vec> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `update_matrix` is never used [INFO] [stdout] --> src/matrix_01.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn update_matrix(mat: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/max_depth_bin_tree.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_depth_bin_tree.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/max_depth_bin_tree.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/max_num_of_operations.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_operations` is never used [INFO] [stdout] --> src/max_num_of_operations.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | fn max_operations(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/maximum_typed.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_be_typed_words` is never used [INFO] [stdout] --> src/maximum_typed.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn can_be_typed_words(text: String, broken_letters: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/merge_strings_alternately.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_alternately` is never used [INFO] [stdout] --> src/merge_strings_alternately.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn merge_alternately(word1: String, word2: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/merge_two_bin_trees.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `TreeNode` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Tree` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 20 | type Tree = Rc>; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | #[inline] [INFO] [stdout] 24 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert_pointer` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn insert_pointer(root: &mut Option, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert_stack` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn insert_stack(root: &mut Option, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_nodes` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn merge_nodes(node1: Option<&Tree>, node2: Option<&Tree>) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_trees` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:102:4 [INFO] [stdout] | [INFO] [stdout] 102 | fn merge_trees(root1: Option, root2: Option) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/merge_two_sorted_lists.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | #[inline] [INFO] [stdout] 17 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/merge_two_sorted_lists.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/merge_two_sorted_lists.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/middle_linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `middle_node` is never used [INFO] [stdout] --> src/middle_linked_list.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn middle_node(mut head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `pascal` is never used [INFO] [stdout] --> src/pascal.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn pascal(n_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/path_sum.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `has_path_sum` is never used [INFO] [stdout] --> src/path_sum.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check_inclusion` is never used [INFO] [stdout] --> src/permutation_in_a_string.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn check_inclusion(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/permutations.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn backtrack( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `permute` is never used [INFO] [stdout] --> src/permutations.rs:23:4 [INFO] [stdout] | [INFO] [stdout] 23 | fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `iterative` is never used [INFO] [stdout] --> src/permutations.rs:30:4 [INFO] [stdout] | [INFO] [stdout] 30 | fn iterative(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `from_vec` are never used [INFO] [stdout] --> src/remove_nth_from_end.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn from_vec(vals: Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `remove_nth_from_end` is never used [INFO] [stdout] --> src/remove_nth_from_end.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn remove_nth_from_end(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `from_vec` are never used [INFO] [stdout] --> src/remove_nth_from_end_2.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn from_vec(vals: Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `remove_nth_from_end` is never used [INFO] [stdout] --> src/remove_nth_from_end_2.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn remove_nth_from_end(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse_words` is never used [INFO] [stdout] --> src/reverse_words_string.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn reverse_words(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `shortest_to_char` is never used [INFO] [stdout] --> src/shortest_distance_to_character.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn shortest_to_char(s: String, c: char) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/twosum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `convert` is never used [INFO] [stdout] --> src/zigzag_conversion.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `DIGIT_LETTERS` should have a snake case name [INFO] [stdout] --> src/combo_phone.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | let DIGIT_LETTERS: Vec> = vec![ [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `digit_letters` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/grind_75/longest_substring.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | io::stdout().flush(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = io::stdout().flush(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/shortest_distance_to_character.rs:11:33 [INFO] [stdout] | [INFO] [stdout] 11 | while left < chars.len() && right >= 0 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ascii::AsciiExt` [INFO] [stdout] --> src/grind_75/valid_palindrome.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::ascii::AsciiExt; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/combo_phone.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | let mut solution = String::new(); [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/count_build_good_strings.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | let mut sol = String::new(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `rule_index` is never read [INFO] [stdout] --> src/count_rule.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | let mut rule_index: i32 = -1; [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: unused variable: `x` [INFO] [stdout] --> src/destructest.rs:21:9 [INFO] [stdout] | [INFO] [stdout] 21 | for x in 0..2 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cloned_option` [INFO] [stdout] --> src/destructest.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | let cloned_option = option.as_ref().cloned(); [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cloned_option` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/four_sum.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | let mut all_pairs: Vec<_> = pairs.into_values().collect(); [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/grind_75/insert_interval.rs:9:24 [INFO] [stdout] | [INFO] [stdout] 9 | fn insert_interval(mut intervals: Vec>, new_interval: Vec) -> Vec> { [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/grind_75/insert_interval.rs:31:17 [INFO] [stdout] | [INFO] [stdout] 31 | let mut current_element = &intervals[index]; [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/grind_75/invert_tree.rs:177:9 [INFO] [stdout] | [INFO] [stdout] 177 | let mut tree = Some(Rc::new(RefCell::new(TreeNode::from(vec![ [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `char` [INFO] [stdout] --> src/grind_75/longest_substring.rs:24:30 [INFO] [stdout] | [INFO] [stdout] 24 | for (char_index, char) in chars.iter().enumerate() { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_char` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `first_in` [INFO] [stdout] --> src/grind_75/queue_from_stacks.rs:49:13 [INFO] [stdout] | [INFO] [stdout] 49 | let first_in = match self.first_in_one { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_first_in` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/isomorphic_strings.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let mut s_chars: Vec = s.chars().collect(); [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/isomorphic_strings.rs:13:13 [INFO] [stdout] | [INFO] [stdout] 13 | let mut t_chars: Vec = t.chars().collect(); [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/merge_two_bin_trees.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | let mut current_node = match root { [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/merge_two_bin_trees.rs:93:9 [INFO] [stdout] | [INFO] [stdout] 93 | let mut new_node = Rc::new(RefCell::new(TreeNode::new(-1))); [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tree_1` [INFO] [stdout] --> src/merge_two_bin_trees.rs:103:13 [INFO] [stdout] | [INFO] [stdout] 103 | let mut tree_1 = root1.as_ref(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_tree_1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tree_2` [INFO] [stdout] --> src/merge_two_bin_trees.rs:104:13 [INFO] [stdout] | [INFO] [stdout] 104 | let mut tree_2 = root2.as_ref(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_tree_2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `current_node` [INFO] [stdout] --> src/merge_two_bin_trees.rs:107:13 [INFO] [stdout] | [INFO] [stdout] 107 | let mut current_node = merged_tree.clone(); [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/merge_two_bin_trees.rs:103:9 [INFO] [stdout] | [INFO] [stdout] 103 | let mut tree_1 = root1.as_ref(); [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/merge_two_bin_trees.rs:104:9 [INFO] [stdout] | [INFO] [stdout] 104 | let mut tree_2 = root2.as_ref(); [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/merge_two_bin_trees.rs:106:9 [INFO] [stdout] | [INFO] [stdout] 106 | let mut merged_tree = Rc::new(RefCell::new(TreeNode::new(0))); [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/merge_two_bin_trees.rs:107:9 [INFO] [stdout] | [INFO] [stdout] 107 | let mut current_node = merged_tree.clone(); [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/middle_linked_list.rs:15:20 [INFO] [stdout] | [INFO] [stdout] 15 | pub fn middle_node(mut head: Option>) -> Option> { [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/path_sum.rs:52:9 [INFO] [stdout] | [INFO] [stdout] 52 | let mut root = Some(Rc::new(RefCell::new(TreeNode { [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/path_sum.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | let mut root = Some(Rc::new(RefCell::new(TreeNode { [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/permutations.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | mut solution: Vec, [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/permutations.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | let mut sol = Vec::new(); [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/remove_nth_from_end_2.rs:23:28 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn remove_nth_from_end(mut head: Option>, n: i32) -> Option> { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `MergeCase` is never used [INFO] [stdout] --> src/grind_75/insert_interval.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | enum MergeCase { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/grind_75/invert_tree.rs:98:12 [INFO] [stdout] | [INFO] [stdout] 97 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 98 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/grind_75/lowest_common_ancestor.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | #[inline] [INFO] [stdout] 28 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/grind_75/lowest_common_ancestor.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/grind_75/queue_from_stacks.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/grind_75/queue_from_stacks.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 29 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn peek(&self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bfs` is never used [INFO] [stdout] --> src/matrix_01.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn bfs(mat: Vec>) -> Vec> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/max_depth_bin_tree.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert_stack` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn insert_stack(root: &mut Option, val: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_nodes` is never used [INFO] [stdout] --> src/merge_two_bin_trees.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn merge_nodes(node1: Option<&Tree>, node2: Option<&Tree>) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/path_sum.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | #[inline] [INFO] [stdout] 15 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `DIGIT_LETTERS` should have a snake case name [INFO] [stdout] --> src/combo_phone.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | let DIGIT_LETTERS: Vec> = vec![ [INFO] [stdout] | ^^^^^^^^^^^^^ help: convert the identifier to snake case: `digit_letters` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/grind_75/longest_substring.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | io::stdout().flush(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = io::stdout().flush(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/shortest_distance_to_character.rs:11:33 [INFO] [stdout] | [INFO] [stdout] 11 | while left < chars.len() && right >= 0 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.46s [INFO] running `Command { std: "docker" "inspect" "0c6ce4b6a1321d68356bc559326127ee37c29c9818ef04c06dbe02e6e9b3e8ff", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "0c6ce4b6a1321d68356bc559326127ee37c29c9818ef04c06dbe02e6e9b3e8ff", kill_on_drop: false }` [INFO] [stdout] 0c6ce4b6a1321d68356bc559326127ee37c29c9818ef04c06dbe02e6e9b3e8ff