[INFO] updating cached repository https://github.com/NaughtyDogOfSchrodinger/leetcode-in-rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "-c" "remote.origin.fetch=refs/heads/*:refs/heads/*" "fetch" "origin" "--force" "--prune", kill_on_drop: false }` [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 24258620ba455d85e630b5134df1a6f650852bc3 [INFO] checking NaughtyDogOfSchrodinger/leetcode-in-rust/24258620ba455d85e630b5134df1a6f650852bc3 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FNaughtyDogOfSchrodinger%2Fleetcode-in-rust" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/NaughtyDogOfSchrodinger/leetcode-in-rust on toolchain ab869e094a907cc5d19b4080f22eccaf347f1f95 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/NaughtyDogOfSchrodinger/leetcode-in-rust [INFO] finished tweaking git repo https://github.com/NaughtyDogOfSchrodinger/leetcode-in-rust [INFO] tweaked toml for git repo https://github.com/NaughtyDogOfSchrodinger/leetcode-in-rust written to /workspace/builds/worker-1-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/NaughtyDogOfSchrodinger/leetcode-in-rust already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 8d96ddbf06f3725ad6201ed5ee7b1e9acac81000c6b09e3b7fe47649a23be366 [INFO] running `Command { std: "docker" "start" "-a" "8d96ddbf06f3725ad6201ed5ee7b1e9acac81000c6b09e3b7fe47649a23be366", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "8d96ddbf06f3725ad6201ed5ee7b1e9acac81000c6b09e3b7fe47649a23be366", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8d96ddbf06f3725ad6201ed5ee7b1e9acac81000c6b09e3b7fe47649a23be366", kill_on_drop: false }` [INFO] [stdout] 8d96ddbf06f3725ad6201ed5ee7b1e9acac81000c6b09e3b7fe47649a23be366 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] ae8fc7bfbc26298c6df9174cf9ff566d06517439879c83226045337dde475605 [INFO] running `Command { std: "docker" "start" "-a" "ae8fc7bfbc26298c6df9174cf9ff566d06517439879c83226045337dde475605", kill_on_drop: false }` [INFO] [stderr] Checking leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_005.rs:85:14 [INFO] [stdout] | [INFO] [stdout] 85 | for i in (center_index - max_r..=center_index + max_r) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 85 - for i in (center_index - max_r..=center_index + max_r) { [INFO] [stdout] 85 + for i in center_index - max_r..=center_index + max_r { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `DerefMut` and `Deref` [INFO] [stdout] --> src/leetcode_114.rs:3:16 [INFO] [stdout] | [INFO] [stdout] 3 | use std::ops::{Deref, DerefMut}; [INFO] [stdout] | ^^^^^ ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/leetcode_226.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_238.rs:3:14 [INFO] [stdout] | [INFO] [stdout] 3 | for i in (1..nums.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 3 - for i in (1..nums.len()) { [INFO] [stdout] 3 + for i in 1..nums.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_31.rs:15:26 [INFO] [stdout] | [INFO] [stdout] 15 | for i in (end..=last) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 15 - for i in (end..=last) { [INFO] [stdout] 15 + for i in end..=last { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_36.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | for line in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 7 - for line in (0..9) { [INFO] [stdout] 7 + for line in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_36.rs:8:20 [INFO] [stdout] | [INFO] [stdout] 8 | for row in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 8 - for row in (0..9) { [INFO] [stdout] 8 + for row in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_37.rs:34:17 [INFO] [stdout] | [INFO] [stdout] 34 | for line in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 34 - for line in (0..9) { [INFO] [stdout] 34 + for line in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_37.rs:35:20 [INFO] [stdout] | [INFO] [stdout] 35 | for row in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - for row in (0..9) { [INFO] [stdout] 35 + for row in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::leetcode_37::solve_sudoku` [INFO] [stdout] --> src/leetcode_37.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | use crate::leetcode_37::solve_sudoku; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_39.rs:15:22 [INFO] [stdout] | [INFO] [stdout] 15 | for i in (index..sorted.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 15 - for i in (index..sorted.len()) { [INFO] [stdout] 15 + for i in index..sorted.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_46.rs:7:18 [INFO] [stdout] | [INFO] [stdout] 7 | for i in (index..path.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 7 - for i in (index..path.len()) { [INFO] [stdout] 7 + for i in index..path.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode_80.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | if (nums[slow - 2] != nums[fast]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 9 - if (nums[slow - 2] != nums[fast]) { [INFO] [stdout] 9 + if nums[slow - 2] != nums[fast] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_005.rs:85:14 [INFO] [stdout] | [INFO] [stdout] 85 | for i in (center_index - max_r..=center_index + max_r) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 85 - for i in (center_index - max_r..=center_index + max_r) { [INFO] [stdout] 85 + for i in center_index - max_r..=center_index + max_r { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `DerefMut` and `Deref` [INFO] [stdout] --> src/leetcode_114.rs:3:16 [INFO] [stdout] | [INFO] [stdout] 3 | use std::ops::{Deref, DerefMut}; [INFO] [stdout] | ^^^^^ ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `sort_list` [INFO] [stdout] --> src/leetcode_148.rs:65:31 [INFO] [stdout] | [INFO] [stdout] 65 | use crate::leetcode_148::{sort_list, sort_list1}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `remove_nth_from_end` [INFO] [stdout] --> src/leetcode_19.rs:57:30 [INFO] [stdout] | [INFO] [stdout] 57 | use crate::leetcode_19::{remove_nth_from_end, remove_nth_from_end1}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ops::Deref` [INFO] [stdout] --> src/leetcode_226.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::ops::Deref; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_238.rs:3:14 [INFO] [stdout] | [INFO] [stdout] 3 | for i in (1..nums.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 3 - for i in (1..nums.len()) { [INFO] [stdout] 3 + for i in 1..nums.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_31.rs:15:26 [INFO] [stdout] | [INFO] [stdout] 15 | for i in (end..=last) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 15 - for i in (end..=last) { [INFO] [stdout] 15 + for i in end..=last { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_36.rs:7:17 [INFO] [stdout] | [INFO] [stdout] 7 | for line in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 7 - for line in (0..9) { [INFO] [stdout] 7 + for line in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_36.rs:8:20 [INFO] [stdout] | [INFO] [stdout] 8 | for row in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 8 - for row in (0..9) { [INFO] [stdout] 8 + for row in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_37.rs:34:17 [INFO] [stdout] | [INFO] [stdout] 34 | for line in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 34 - for line in (0..9) { [INFO] [stdout] 34 + for line in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_37.rs:35:20 [INFO] [stdout] | [INFO] [stdout] 35 | for row in (0..9) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - for row in (0..9) { [INFO] [stdout] 35 + for row in 0..9 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_39.rs:15:22 [INFO] [stdout] | [INFO] [stdout] 15 | for i in (index..sorted.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 15 - for i in (index..sorted.len()) { [INFO] [stdout] 15 + for i in index..sorted.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/leetcode_46.rs:7:18 [INFO] [stdout] | [INFO] [stdout] 7 | for i in (index..path.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 7 - for i in (index..path.len()) { [INFO] [stdout] 7 + for i in index..path.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `group_anagrams` [INFO] [stdout] --> src/leetcode_49.rs:46:30 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::leetcode_49::{group_anagrams, group_anagrams1}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/leetcode_80.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | if (nums[slow - 2] != nums[fast]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 9 - if (nums[slow - 2] != nums[fast]) { [INFO] [stdout] 9 + if nums[slow - 2] != nums[fast] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `end` is never read [INFO] [stdout] --> src/leetcode_003.rs:9:17 [INFO] [stdout] | [INFO] [stdout] 9 | let mut end: i32 = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_173.rs:16:55 [INFO] [stdout] | [INFO] [stdout] 16 | fn build(root: Option>>, mut arr: &mut Vec) { [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/leetcode_19.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | let mut dummy = Some(Box::new(ListNode { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_37.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | mut end: &mut bool, [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_39.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | mut path: &mut 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/leetcode_39.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | mut result: &mut 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/leetcode_392.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | let mut s_arr = 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/leetcode_40.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | mut path: &mut 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/leetcode_40.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | mut result: &mut 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/leetcode_49.rs:16:26 [INFO] [stdout] | [INFO] [stdout] 16 | .and_modify(|mut arr: &mut Vec| arr.push(s.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/leetcode_49.rs:36:26 [INFO] [stdout] | [INFO] [stdout] 36 | .and_modify(|mut arr: &mut Vec| arr.push(s.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/leetcode_61.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | let mut head = head; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/common.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | #[inline] [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/common.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | #[inline] [INFO] [stdout] 30 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/leetcode_001.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `add_two_numbers` is never used [INFO] [stdout] --> src/leetcode_002.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_longest_substring` is never used [INFO] [stdout] --> src/leetcode_003.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_palindrome` is never used [INFO] [stdout] --> src/leetcode_005.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `convert` is never used [INFO] [stdout] --> src/leetcode_006.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse` is never used [INFO] [stdout] --> src/leetcode_007.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `my_atoi` is never used [INFO] [stdout] --> src/leetcode_008.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn my_atoi(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/leetcode_009.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_same_tree` is never used [INFO] [stdout] --> src/leetcode_100.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_same_tree(p: Option>>, q: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_symmetric` is never used [INFO] [stdout] --> src/leetcode_101.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_depth` is never used [INFO] [stdout] --> src/leetcode_104.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree` is never used [INFO] [stdout] --> src/leetcode_105.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `build_tree` is never used [INFO] [stdout] --> src/leetcode_106.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_area` is never used [INFO] [stdout] --> src/leetcode_11.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `has_path_sum` is never used [INFO] [stdout] --> src/leetcode_112.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `flatten` is never used [INFO] [stdout] --> src/leetcode_114.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `int_to_roman` is never used [INFO] [stdout] --> src/leetcode_12.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn int_to_roman(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/leetcode_125.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_consecutive` is never used [INFO] [stdout] --> src/leetcode_128.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_numbers` is never used [INFO] [stdout] --> src/leetcode_129.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_complete_circuit` is never used [INFO] [stdout] --> src/leetcode_134.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `candy` is never used [INFO] [stdout] --> src/leetcode_135.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn candy(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LRUCache` is never constructed [INFO] [stdout] --> src/leetcode_146.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/leetcode_146.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 12 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/leetcode_146.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 20 | fn new(key: i32, val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/leetcode_146.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl LRUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 31 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn move_to_first(&mut self, ptr: *mut Node) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | fn remove_last(&mut self) -> *mut Node { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn remove_first(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn add_first(&mut self, ptr: *mut Node) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | fn remove(&mut self, ptr: *mut Node) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 118 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sort_list` is never used [INFO] [stdout] --> src/leetcode_148.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sort_list1` is never used [INFO] [stdout] --> src/leetcode_148.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn sort_list1(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `three_sum` is never used [INFO] [stdout] --> src/leetcode_15.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `eval_rpn` is never used [INFO] [stdout] --> src/leetcode_150.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse_words` is never used [INFO] [stdout] --> src/leetcode_151.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn reverse_words(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/leetcode_155.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used [INFO] [stdout] --> src/leetcode_155.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 7 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn get_min(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `two_sum` is never used [INFO] [stdout] --> src/leetcode_167.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `letter_combinations` is never used [INFO] [stdout] --> src/leetcode_17.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/leetcode_173.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/leetcode_173.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 15 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rotate` is never used [INFO] [stdout] --> src/leetcode_189.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `remove_nth_from_end` is never used [INFO] [stdout] --> src/leetcode_19.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `remove_nth_from_end1` is never used [INFO] [stdout] --> src/leetcode_19.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn remove_nth_from_end1(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid` is never used [INFO] [stdout] --> src/leetcode_20.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | 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/leetcode_202.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_isomorphic` is never used [INFO] [stdout] --> src/leetcode_205.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_sub_array_len` is never used [INFO] [stdout] --> src/leetcode_209.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_two_lists` is never used [INFO] [stdout] --> src/leetcode_21.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/leetcode_219.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_nodes` is never used [INFO] [stdout] --> src/leetcode_222.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `invert_tree` is never used [INFO] [stdout] --> src/leetcode_226.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `summary_ranges` is never used [INFO] [stdout] --> src/leetcode_228.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn summary_ranges(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `product_except_self` is never used [INFO] [stdout] --> src/leetcode_238.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_anagram` is never used [INFO] [stdout] --> src/leetcode_242.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `h_index` is never used [INFO] [stdout] --> src/leetcode_274.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn h_index(citations: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `str_str` is never used [INFO] [stdout] --> src/leetcode_28.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `word_pattern` is never used [INFO] [stdout] --> src/leetcode_290.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn word_pattern(pattern: String, s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_substring` is never used [INFO] [stdout] --> src/leetcode_30.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `next_permutation` is never used [INFO] [stdout] --> src/leetcode_31.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search_range` is never used [INFO] [stdout] --> src/leetcode_34.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_valid_sudoku` is never used [INFO] [stdout] --> src/leetcode_36.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `solve_sudoku` is never used [INFO] [stdout] --> src/leetcode_37.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn solve_sudoku(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_and_say` is never used [INFO] [stdout] --> src/leetcode_38.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_construct` is never used [INFO] [stdout] --> src/leetcode_383.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn can_construct(ransom_note: String, magazine: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combination_sum` is never used [INFO] [stdout] --> src/leetcode_39.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_subsequence` is never used [INFO] [stdout] --> src/leetcode_392.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn is_subsequence(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `combination_sum2` is never used [INFO] [stdout] --> src/leetcode_40.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn combination_sum2(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `trap` is never used [INFO] [stdout] --> src/leetcode_42.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `multiply` is never used [INFO] [stdout] --> src/leetcode_43.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn multiply(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots` is never used [INFO] [stdout] --> src/leetcode_452.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn find_min_arrow_shots(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots_1` is never used [INFO] [stdout] --> src/leetcode_452.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn find_min_arrow_shots_1(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `permute` is never used [INFO] [stdout] --> src/leetcode_46.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rotate` is never used [INFO] [stdout] --> src/leetcode_48.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `group_anagrams` is never used [INFO] [stdout] --> src/leetcode_49.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `group_anagrams1` is never used [INFO] [stdout] --> src/leetcode_49.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn group_anagrams1(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `spiral_order` is never used [INFO] [stdout] --> src/leetcode_54.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn spiral_order(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `can_jump` is never used [INFO] [stdout] --> src/leetcode_55.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge` is never used [INFO] [stdout] --> src/leetcode_56.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_1` is never used [INFO] [stdout] --> src/leetcode_56.rs:64:8 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn merge_1(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/leetcode_57.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn insert(intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_last_word` is never used [INFO] [stdout] --> src/leetcode_58.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn length_of_last_word(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rotate_right` is never used [INFO] [stdout] --> src/leetcode_61.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `simplify_path` is never used [INFO] [stdout] --> src/leetcode_71.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn simplify_path(path: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `set_zeroes` is never used [INFO] [stdout] --> src/leetcode_73.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `remove_duplicates` is never used [INFO] [stdout] --> src/leetcode_80.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `delete_duplicates` is never used [INFO] [stdout] --> src/leetcode_82.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `partition` is never used [INFO] [stdout] --> src/leetcode_86.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn partition(head: Option>, x: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `reverse_between` is never used [INFO] [stdout] --> src/leetcode_92.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn reverse_between( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 112 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `end` is never read [INFO] [stdout] --> src/leetcode_003.rs:9:17 [INFO] [stdout] | [INFO] [stdout] 9 | let mut end: i32 = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/leetcode_101.rs:39:13 [INFO] [stdout] | [INFO] [stdout] 39 | let node = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/leetcode_112.rs:28:13 [INFO] [stdout] | [INFO] [stdout] 28 | let node = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/leetcode_129.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let node = Some(Rc::new(RefCell::new(TreeNode { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_173.rs:16:55 [INFO] [stdout] | [INFO] [stdout] 16 | fn build(root: Option>>, mut arr: &mut Vec) { [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/leetcode_19.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | let mut dummy = Some(Box::new(ListNode { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_238.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | let mut a = Vec::from([1, 2, 3, 4]); [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_274.rs:24:13 [INFO] [stdout] | [INFO] [stdout] 24 | let mut a = Vec::from([3, 0, 6, 1, 5]); [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/leetcode_36.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | let board = [ [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_37.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | mut end: &mut bool, [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/leetcode_37.rs:62:13 [INFO] [stdout] | [INFO] [stdout] 62 | let a = 0 + 1 << 8; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `b` [INFO] [stdout] --> src/leetcode_37.rs:63:13 [INFO] [stdout] | [INFO] [stdout] 63 | let b = 0 + 1 << 7; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_b` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/leetcode_37.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | let mut a = 0b1101101; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `count` [INFO] [stdout] --> src/leetcode_37.rs:72:17 [INFO] [stdout] | [INFO] [stdout] 72 | let mut count = 0; [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_count` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_37.rs:64:13 [INFO] [stdout] | [INFO] [stdout] 64 | let mut a = 0b1101101; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_37.rs:72:13 [INFO] [stdout] | [INFO] [stdout] 72 | let mut count = 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/leetcode_39.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | mut path: &mut 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/leetcode_39.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | mut result: &mut 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/leetcode_392.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | let mut s_arr = 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/leetcode_40.rs:7:9 [INFO] [stdout] | [INFO] [stdout] 7 | mut path: &mut 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/leetcode_40.rs:8:9 [INFO] [stdout] | [INFO] [stdout] 8 | mut result: &mut 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/leetcode_49.rs:16:26 [INFO] [stdout] | [INFO] [stdout] 16 | .and_modify(|mut arr: &mut Vec| arr.push(s.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/leetcode_49.rs:36:26 [INFO] [stdout] | [INFO] [stdout] 36 | .and_modify(|mut arr: &mut Vec| arr.push(s.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/leetcode_55.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut a = Vec::from([2, 3, 1, 1, 4]); [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode_61.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | let mut head = head; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node` [INFO] [stdout] --> src/leetcode_86.rs:63:13 [INFO] [stdout] | [INFO] [stdout] 63 | let node = Some(Box::new(ListNode { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_node` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node2` [INFO] [stdout] --> src/leetcode_92.rs:57:13 [INFO] [stdout] | [INFO] [stdout] 57 | let node2 = Some(Box::new(ListNode { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_node2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/common.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | #[inline] [INFO] [stdout] 13 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/common.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | #[inline] [INFO] [stdout] 30 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_same_tree` is never used [INFO] [stdout] --> src/leetcode_100.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn is_same_tree(p: Option>>, q: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sort_list` is never used [INFO] [stdout] --> src/leetcode_148.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/leetcode_173.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/leetcode_173.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 15 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `remove_nth_from_end` is never used [INFO] [stdout] --> src/leetcode_19.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_two_lists` is never used [INFO] [stdout] --> src/leetcode_21.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots_1` is never used [INFO] [stdout] --> src/leetcode_452.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn find_min_arrow_shots_1(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `group_anagrams` is never used [INFO] [stdout] --> src/leetcode_49.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `merge_1` is never used [INFO] [stdout] --> src/leetcode_56.rs:64:8 [INFO] [stdout] | [INFO] [stdout] 64 | pub fn merge_1(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `lRUCache` should have a snake case name [INFO] [stdout] --> src/leetcode_146.rs:161:17 [INFO] [stdout] | [INFO] [stdout] 161 | let mut lRUCache = LRUCache::new(3); [INFO] [stdout] | ^^^^^^^^ help: convert the identifier to snake case: `l_rucache` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 54 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.98s [INFO] running `Command { std: "docker" "inspect" "ae8fc7bfbc26298c6df9174cf9ff566d06517439879c83226045337dde475605", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "ae8fc7bfbc26298c6df9174cf9ff566d06517439879c83226045337dde475605", kill_on_drop: false }` [INFO] [stdout] ae8fc7bfbc26298c6df9174cf9ff566d06517439879c83226045337dde475605