[INFO] cloning repository https://github.com/xanahopper/leetcode [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/xanahopper/leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fxanahopper%2Fleetcode", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fxanahopper%2Fleetcode'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] a7a03187f6433f84fd410505a41aa28ad4f4190c [INFO] checking xanahopper/leetcode against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fxanahopper%2Fleetcode" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/xanahopper/leetcode on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/xanahopper/leetcode [INFO] finished tweaking git repo https://github.com/xanahopper/leetcode [INFO] tweaked toml for git repo https://github.com/xanahopper/leetcode written to /workspace/builds/worker-7-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/xanahopper/leetcode already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded leetcode_prelude v0.2.2 [INFO] [stderr] Downloaded leetcode_test v0.1.1 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 2df17529ba70cff4bc45e2bc59f2baaf1140fb286daeda8b22863d68e2b30c00 [INFO] running `Command { std: "docker" "start" "-a" "2df17529ba70cff4bc45e2bc59f2baaf1140fb286daeda8b22863d68e2b30c00", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "2df17529ba70cff4bc45e2bc59f2baaf1140fb286daeda8b22863d68e2b30c00", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2df17529ba70cff4bc45e2bc59f2baaf1140fb286daeda8b22863d68e2b30c00", kill_on_drop: false }` [INFO] [stdout] 2df17529ba70cff4bc45e2bc59f2baaf1140fb286daeda8b22863d68e2b30c00 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 87ec8dcb5be8f4baefbf67e3f5c0b5e9ebccde14b3111a21acae82588fa15e83 [INFO] running `Command { std: "docker" "start" "-a" "87ec8dcb5be8f4baefbf67e3f5c0b5e9ebccde14b3111a21acae82588fa15e83", kill_on_drop: false }` [INFO] [stderr] Compiling serde v1.0.104 [INFO] [stderr] Compiling ryu v1.0.2 [INFO] [stderr] Compiling itoa v0.4.4 [INFO] [stderr] Compiling serde_json v1.0.44 [INFO] [stderr] Compiling leetcode_test v0.1.1 [INFO] [stderr] Checking leetcode_prelude v0.2.2 [INFO] [stderr] Checking leetcode v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/editor/cn/solution_719.rs:66:26 [INFO] [stdout] | [INFO] [stdout] 66 | count += (j - i - 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 66 - count += (j - i - 1); [INFO] [stdout] 66 + count += j - i - 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `btree` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:36:24 [INFO] [stdout] | [INFO] [stdout] 36 | use leetcode_prelude::{btree, TreeNode}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashSet` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:59:33 [INFO] [stdout] | [INFO] [stdout] 59 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:90:5 [INFO] [stdout] | [INFO] [stdout] 90 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `btree` [INFO] [stdout] --> src/leetcode/editor/cn/solution_513.rs:36:24 [INFO] [stdout] | [INFO] [stdout] 36 | use leetcode_prelude::{btree, TreeNode}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `btree` [INFO] [stdout] --> src/leetcode/editor/cn/solution_515.rs:33:24 [INFO] [stdout] | [INFO] [stdout] 33 | use leetcode_prelude::{btree, TreeNode}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/leetcode/weekly/weekly_295_1.rs:24:16 [INFO] [stdout] | [INFO] [stdout] 24 | });; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fmt::format` [INFO] [stdout] --> src/leetcode/weekly/weekly_295_2.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fmt::format; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `max` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:1:16 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp::{max, min}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `LinkedList` and `VecDeque` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:2:24 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::{LinkedList, VecDeque}; [INFO] [stdout] | ^^^^^^^^^^ ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp::min` [INFO] [stdout] --> src/leetcode/weekly/weekly_297_2.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp::min; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::leetcode::Solution` [INFO] [stdout] --> src/leetcode/weekly/weekly_297_4.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::leetcode::Solution; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `linkedlist` [INFO] [stdout] --> src/leetcode/weekly/weekly_300_2.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use leetcode_prelude::{linkedlist, ListNode}; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::BTreeSet` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::BTreeSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_4.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_4.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BTreeMap` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:2:24 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::{BTreeMap, BTreeSet, HashMap}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::leetcode::Solution` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use crate::leetcode::Solution; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/biweekly/biweekly_81_2.rs:29:27 [INFO] [stdout] | [INFO] [stdout] 29 | result += (sum - group[&parent]); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 29 - result += (sum - group[&parent]); [INFO] [stdout] 29 + result += sum - group[&parent]; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `btree` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_1.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use leetcode_prelude::{btree, TreeNode}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Read` and `stdin` [INFO] [stdout] --> src/codeforces/scanner.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::{Read, stdin}; [INFO] [stdout] | ^^^^ ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/editor/cn/solution_719.rs:66:26 [INFO] [stdout] | [INFO] [stdout] 66 | count += (j - i - 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 66 - count += (j - i - 1); [INFO] [stdout] 66 + count += j - i - 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `btree` [INFO] [stdout] --> src/leetcode/editor/cn/solution_513.rs:36:24 [INFO] [stdout] | [INFO] [stdout] 36 | use leetcode_prelude::{btree, TreeNode}; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/leetcode/weekly/weekly_295_1.rs:24:16 [INFO] [stdout] | [INFO] [stdout] 24 | });; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fmt::format` [INFO] [stdout] --> src/leetcode/weekly/weekly_295_2.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::fmt::format; [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `max` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:1:16 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp::{max, min}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `LinkedList` and `VecDeque` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:2:24 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::{LinkedList, VecDeque}; [INFO] [stdout] | ^^^^^^^^^^ ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp::min` [INFO] [stdout] --> src/leetcode/weekly/weekly_297_2.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp::min; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::leetcode::Solution` [INFO] [stdout] --> src/leetcode/weekly/weekly_297_4.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use crate::leetcode::Solution; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::BTreeSet` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::BTreeSet; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `HashMap` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_4.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, HashSet}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::iter::FromIterator` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_4.rs:2:5 [INFO] [stdout] | [INFO] [stdout] 2 | use std::iter::FromIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BTreeMap` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:2:24 [INFO] [stdout] | [INFO] [stdout] 2 | use std::collections::{BTreeMap, BTreeSet, HashMap}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `crate::leetcode::Solution` [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | use crate::leetcode::Solution; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/leetcode/biweekly/biweekly_81_2.rs:29:27 [INFO] [stdout] | [INFO] [stdout] 29 | result += (sum - group[&parent]); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 29 - result += (sum - group[&parent]); [INFO] [stdout] 29 + result += sum - group[&parent]; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `Read` and `stdin` [INFO] [stdout] --> src/codeforces/scanner.rs:1:15 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::{Read, stdin}; [INFO] [stdout] | ^^^^ ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BorrowMut` [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:51:27 [INFO] [stdout] | [INFO] [stdout] 51 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:51:19 [INFO] [stdout] | [INFO] [stdout] 51 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/solution_513.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/leetcode/editor/cn/solution_5.rs:26:31 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/leetcode/editor/cn/solution_13.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/editor/cn/solution_765.rs:40:13 [INFO] [stdout] | [INFO] [stdout] 40 | let mut len: i32 = row.len() as i32; [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/editor/cn/solution_765.rs:72:13 [INFO] [stdout] | [INFO] [stdout] 72 | let mut fx = self.find(x) as usize; [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/editor/cn/solution_765.rs:73:13 [INFO] [stdout] | [INFO] [stdout] 73 | let mut fy = self.find(y) as usize; [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/editor/cn/solution_354.rs:42:26 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_envelopes(mut envelopes: Vec>) -> i32 { [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `big` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_big` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `medium` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:22 [INFO] [stdout] | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_medium` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `small` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:35 [INFO] [stdout] | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_small` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `car_type` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:61:23 [INFO] [stdout] | [INFO] [stdout] 61 | fn add_car(&self, car_type: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_car_type` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/leetcode/editor/cn/solution_224.rs:55:50 [INFO] [stdout] | [INFO] [stdout] 55 | .fold(Vec::::new(), |mut acc, x| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/editor/cn/solution_224.rs:55:41 [INFO] [stdout] | [INFO] [stdout] 55 | .fold(Vec::::new(), |mut acc, x| { [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/editor/cn/solution_224.rs:54:13 [INFO] [stdout] | [INFO] [stdout] 54 | let mut stack = s.as_bytes().iter() [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/editor/cn/solution_706.rs:96:26 [INFO] [stdout] | [INFO] [stdout] 96 | if let Some((k, v)) = bucket.iter_mut().find(|&&mut (k, v)| k == key) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/leetcode/editor/cn/solution_706.rs:96:69 [INFO] [stdout] | [INFO] [stdout] 96 | if let Some((k, v)) = bucket.iter_mut().find(|&&mut (k, v)| k == key) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:65:61 [INFO] [stdout] | [INFO] [stdout] 65 | if let Some((_, &count)) = sum.iter().max_by_key(|(&k, &v)| v) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:67:29 [INFO] [stdout] | [INFO] [stdout] 67 | .map(|(&k, &v)| k) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `sum` [INFO] [stdout] --> src/leetcode/weekly/weekly_294_4.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let sum = strength.iter().enumerate() [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_sum` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/leetcode/weekly/weekly_295_4.rs:4:30 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn minimum_obstacles(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:42:13 [INFO] [stdout] | [INFO] [stdout] 42 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:50:13 [INFO] [stdout] | [INFO] [stdout] 50 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:59:13 [INFO] [stdout] | [INFO] [stdout] 59 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `len` [INFO] [stdout] --> src/leetcode/weekly/weekly_300_3.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let len = forget - delay; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a1` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut a1 = amount[0]; [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_a1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a2` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | let mut a2 = amount[1]; [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_a2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a3` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:16:17 [INFO] [stdout] | [INFO] [stdout] 16 | let mut a3 = amount[2]; [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_a3` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:14:13 [INFO] [stdout] | [INFO] [stdout] 14 | let mut a1 = amount[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/weekly/weekly_301_1.rs:15:13 [INFO] [stdout] | [INFO] [stdout] 15 | let mut a2 = amount[1]; [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut a3 = amount[2]; [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:36:57 [INFO] [stdout] | [INFO] [stdout] 36 | let index = self.nums.iter().enumerate().find(|(i, &x)| x).unwrap().0; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_302_3.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | let mut trimmed = nums.iter().enumerate().map(|(index, s)| (index, &s[start..])) [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_302_4.rs:17:47 [INFO] [stdout] | [INFO] [stdout] 17 | match nums.iter().enumerate().find(|&(i, &x)| division % x == 0) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_303_4.rs:15:13 [INFO] [stdout] | [INFO] [stdout] 15 | let mut count = nums.iter().map(|&x| Solution::bit_count(x as u32)) [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `idx` [INFO] [stdout] --> src/leetcode/weekly/weekly_305_1.rs:14:73 [INFO] [stdout] | [INFO] [stdout] 14 | let pos = nums.iter().enumerate().fold(vec![0; 201], |mut res, (idx, &num)| { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_idx` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/leetcode/weekly/weekly_305_2.rs:12:28 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn reachable_nodes(n: i32, edges: Vec>, restricted: Vec) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:12:28 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn valid_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_306_3.rs:18:13 [INFO] [stdout] | [INFO] [stdout] 18 | let mut pattern: Vec<_> = pattern.as_bytes().iter() [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:18:21 [INFO] [stdout] | [INFO] [stdout] 18 | fn merge(&self, a: &Self, b: &Self) -> Self { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:110:27 [INFO] [stdout] | [INFO] [stdout] 110 | fn scatter(&mut self, k: i32, max_row: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_row` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:110:35 [INFO] [stdout] | [INFO] [stdout] 110 | fn scatter(&mut self, k: i32, max_row: i32) -> bool { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_row` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/biweekly/biweekly_80_2.rs:26:13 [INFO] [stdout] | [INFO] [stdout] 26 | let mut spells = spells; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `entry` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_81_2.rs:32:21 [INFO] [stdout] | [INFO] [stdout] 32 | let entry = group.entry(parent).or_insert(1i64); [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_entry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `last_bus` is assigned to, but never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:24:17 [INFO] [stdout] | [INFO] [stdout] 24 | let mut last_bus = 0; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_last_bus` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `last_count` is assigned to, but never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:25:17 [INFO] [stdout] | [INFO] [stdout] 25 | let mut last_count = 0; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_last_count` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `last_bus` is never read [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | last_bus = t; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `last_count` is never read [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:38:13 [INFO] [stdout] | [INFO] [stdout] 38 | last_count = count; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_3.rs:17:13 [INFO] [stdout] | [INFO] [stdout] 17 | let mut i = 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/biweekly/biweekly_83_1.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | let mut counter = ranks.iter().fold(vec![0; 13], |mut c, &x| { [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pattern` [INFO] [stdout] --> src/algorithm/kmp.rs:10:24 [INFO] [stdout] | [INFO] [stdout] 10 | fn index_of(&self, pattern: &String) -> Option { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_pattern` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/segment_tree.rs:62:13 [INFO] [stdout] | [INFO] [stdout] 62 | let mut tree: Vec> = vec![None; len * 4]; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_304.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct NumMatrix { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_304.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 43 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 44 | [INFO] [stdout] 45 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ParkingSystem` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct ParkingSystem { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `add_car` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl ParkingSystem { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 56 | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn add_car(&self, car_type: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Number`, `Add`, `Minus`, `Quote`, `End`, and `Ignore` are never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_224.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 46 | enum Token { [INFO] [stdout] | ----- variants in this enum [INFO] [stdout] 47 | Number(i32), [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 48 | Add, [INFO] [stdout] | ^^^ [INFO] [stdout] 49 | Minus, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 50 | Quote, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 51 | End, [INFO] [stdout] | ^^^ [INFO] [stdout] 52 | Ignore [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Token` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashSet` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_705.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct MyHashSet { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, `remove`, `contains`, and `hash` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_705.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl MyHashSet { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add(&mut self, key: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn contains(&self, key: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn hash(key: i32) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Result` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_838.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct Result { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_307.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_307.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 61 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 62 | [INFO] [stdout] 63 | pub fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `book_count` and `max_book_count` are never read [INFO] [stdout] --> src/leetcode/editor/cn/solution_732.rs:65:5 [INFO] [stdout] | [INFO] [stdout] 64 | struct BookNode { [INFO] [stdout] | -------- fields in this struct [INFO] [stdout] 65 | book_count: i32, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] 66 | max_book_count: i32 [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarThree` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_732.rs:78:8 [INFO] [stdout] | [INFO] [stdout] 78 | struct MyCalendarThree { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `book`, and `update` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_732.rs:88:8 [INFO] [stdout] | [INFO] [stdout] 86 | impl MyCalendarThree { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 87 | [INFO] [stdout] 88 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn book(&mut self, start: i32, end: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn update(&mut self, start: i32, end: i32, l: i32, r: i32, index: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Clamp` is never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_498.rs:37:7 [INFO] [stdout] | [INFO] [stdout] 37 | trait Clamp { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_pairs_worse` is never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_532.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 81 | fn find_pairs_worse(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RangeNode` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | struct RangeNode { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RangeModule` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 65 | struct RangeModule { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `split` is never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:80:8 [INFO] [stdout] | [INFO] [stdout] 79 | impl RangeNode { [INFO] [stdout] | -------------- method in this implementation [INFO] [stdout] 80 | fn split(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_range`, `query_range`, `remove_range`, `query_range_node`, and `range_update` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:118:8 [INFO] [stdout] | [INFO] [stdout] 116 | impl RangeModule { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 117 | [INFO] [stdout] 118 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 130 | fn add_range(&mut self, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 134 | fn query_range(&mut self, left: i32, right: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 138 | fn remove_range(&mut self, left: i32, right: i32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 142 | fn query_range_node(node: &Option>>, query_range: &Range) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | fn range_update(node: &Option>>, update_range: &Range, track: bool) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TextEditor` is never constructed [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct TextEditor { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_text`, `delete_text`, `cursor_left`, and `cursor_right` are never used [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl TextEditor { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 28 | [INFO] [stdout] 29 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn add_text(&mut self, text: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn delete_text(&mut self, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | fn cursor_left(&mut self, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn cursor_right(&mut self, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SmallestInfiniteSet` is never constructed [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct SmallestInfiniteSet { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `pop_smallest`, and `add_back` are never used [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl SmallestInfiniteSet { [INFO] [stdout] | ------------------------ associated items in this implementation [INFO] [stdout] 28 | [INFO] [stdout] 29 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn pop_smallest(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | fn add_back(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Food` is never constructed [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Food { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FoodRatings` is never constructed [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct FoodRatings { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `change_rating`, and `highest_rated` are never used [INFO] [stdout] --> src/leetcode/weekly/weekly_303_3.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl FoodRatings { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 56 | [INFO] [stdout] 57 | fn new(foods: Vec, cuisines: Vec, ratings: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn change_rating(&mut self, food: String, new_rating: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 91 | fn highest_rated(&self, cuisine: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Parent` is never constructed [INFO] [stdout] --> src/leetcode/weekly/weekly_304_3.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Parent { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SINGLE` is never used [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:7:7 [INFO] [stdout] | [INFO] [stdout] 7 | const SINGLE: i32 = 0; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `EQUAL` is never used [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:8:7 [INFO] [stdout] | [INFO] [stdout] 8 | const EQUAL: i32 = 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ASC` is never used [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:9:7 [INFO] [stdout] | [INFO] [stdout] 9 | const ASC: i32 = 2; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BookMyShow` is never constructed [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct BookMyShow { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `BookOperation` is never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:29:7 [INFO] [stdout] | [INFO] [stdout] 29 | trait BookOperation { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `gather`, and `scatter` are never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:91:8 [INFO] [stdout] | [INFO] [stdout] 89 | impl BookMyShow { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 90 | [INFO] [stdout] 91 | fn new(n: i32, m: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn gather(&mut self, k: i32, max_row: i32) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 110 | fn scatter(&mut self, k: i32, max_row: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumberContainers` is never constructed [INFO] [stdout] --> src/leetcode/biweekly/biweekly_83_3.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | struct NumberContainers { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `change`, and `find` are never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_83_3.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 22 | impl NumberContainers { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 23 | [INFO] [stdout] 24 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn change(&mut self, index: i32, number: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn find(&self, number: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `index_of` is never used [INFO] [stdout] --> src/algorithm/kmp.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub trait KmpSearch { [INFO] [stdout] | --------- method in this trait [INFO] [stdout] ... [INFO] [stdout] 4 | fn index_of(&self, pattern: &Self::T) -> Option; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gcd` is never used [INFO] [stdout] --> src/algorithm/mod.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Scanner` is never constructed [INFO] [stdout] --> src/codeforces/scanner.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct Scanner { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Scanner` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `solution_offer_II_91` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/mod.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | pub mod solution_offer_II_91; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case (notice the capitalization): `solution_offer_ii_91` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 114 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `BorrowMut` [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:51:27 [INFO] [stdout] | [INFO] [stdout] 51 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/solution_715.rs:51:19 [INFO] [stdout] | [INFO] [stdout] 51 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::Borrow` [INFO] [stdout] --> src/leetcode/editor/cn/solution_513.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | use std::borrow::Borrow; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/leetcode/editor/cn/solution_5.rs:26:31 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/leetcode/editor/cn/solution_13.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/editor/cn/solution_765.rs:40:13 [INFO] [stdout] | [INFO] [stdout] 40 | let mut len: i32 = row.len() as i32; [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/editor/cn/solution_765.rs:72:13 [INFO] [stdout] | [INFO] [stdout] 72 | let mut fx = self.find(x) as usize; [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/editor/cn/solution_765.rs:73:13 [INFO] [stdout] | [INFO] [stdout] 73 | let mut fy = self.find(y) as usize; [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/editor/cn/solution_354.rs:42:26 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_envelopes(mut envelopes: Vec>) -> i32 { [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `big` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_big` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `medium` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:22 [INFO] [stdout] | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_medium` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `small` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:35 [INFO] [stdout] | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_small` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `car_type` [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:61:23 [INFO] [stdout] | [INFO] [stdout] 61 | fn add_car(&self, car_type: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_car_type` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/leetcode/editor/cn/solution_224.rs:55:50 [INFO] [stdout] | [INFO] [stdout] 55 | .fold(Vec::::new(), |mut acc, x| { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_x` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/editor/cn/solution_224.rs:55:41 [INFO] [stdout] | [INFO] [stdout] 55 | .fold(Vec::::new(), |mut acc, x| { [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/editor/cn/solution_224.rs:54:13 [INFO] [stdout] | [INFO] [stdout] 54 | let mut stack = s.as_bytes().iter() [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/editor/cn/solution_706.rs:96:26 [INFO] [stdout] | [INFO] [stdout] 96 | if let Some((k, v)) = bucket.iter_mut().find(|&&mut (k, v)| k == key) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/leetcode/editor/cn/solution_706.rs:96:69 [INFO] [stdout] | [INFO] [stdout] 96 | if let Some((k, v)) = bucket.iter_mut().find(|&&mut (k, v)| k == key) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:65:61 [INFO] [stdout] | [INFO] [stdout] 65 | if let Some((_, &count)) = sum.iter().max_by_key(|(&k, &v)| v) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/leetcode/editor/cn/solution_508.rs:67:29 [INFO] [stdout] | [INFO] [stdout] 67 | .map(|(&k, &v)| k) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `sum` [INFO] [stdout] --> src/leetcode/weekly/weekly_294_4.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let sum = strength.iter().enumerate() [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_sum` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/leetcode/weekly/weekly_295_4.rs:4:30 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn minimum_obstacles(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:42:13 [INFO] [stdout] | [INFO] [stdout] 42 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:50:13 [INFO] [stdout] | [INFO] [stdout] 50 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_296_4.rs:59:13 [INFO] [stdout] | [INFO] [stdout] 59 | for i in 0..k { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `len` [INFO] [stdout] --> src/leetcode/weekly/weekly_300_3.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let len = forget - delay; [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_len` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a1` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut a1 = amount[0]; [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_a1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a2` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | let mut a2 = amount[1]; [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_a2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a3` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:16:17 [INFO] [stdout] | [INFO] [stdout] 16 | let mut a3 = amount[2]; [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_a3` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:14:13 [INFO] [stdout] | [INFO] [stdout] 14 | let mut a1 = amount[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/weekly/weekly_301_1.rs:15:13 [INFO] [stdout] | [INFO] [stdout] 15 | let mut a2 = amount[1]; [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_301_1.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut a3 = amount[2]; [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_301_2.rs:36:57 [INFO] [stdout] | [INFO] [stdout] 36 | let index = self.nums.iter().enumerate().find(|(i, &x)| x).unwrap().0; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_302_3.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | let mut trimmed = nums.iter().enumerate().map(|(index, s)| (index, &s[start..])) [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/leetcode/weekly/weekly_302_4.rs:17:47 [INFO] [stdout] | [INFO] [stdout] 17 | match nums.iter().enumerate().find(|&(i, &x)| division % x == 0) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_303_4.rs:15:13 [INFO] [stdout] | [INFO] [stdout] 15 | let mut count = nums.iter().map(|&x| Solution::bit_count(x as u32)) [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `idx` [INFO] [stdout] --> src/leetcode/weekly/weekly_305_1.rs:14:73 [INFO] [stdout] | [INFO] [stdout] 14 | let pos = nums.iter().enumerate().fold(vec![0; 201], |mut res, (idx, &num)| { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_idx` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/leetcode/weekly/weekly_305_2.rs:12:28 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn reachable_nodes(n: i32, edges: Vec>, restricted: Vec) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:12:28 [INFO] [stdout] | [INFO] [stdout] 12 | pub fn valid_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/weekly/weekly_306_3.rs:18:13 [INFO] [stdout] | [INFO] [stdout] 18 | let mut pattern: Vec<_> = pattern.as_bytes().iter() [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `a` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:18:21 [INFO] [stdout] | [INFO] [stdout] 18 | fn merge(&self, a: &Self, b: &Self) -> Self { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_a` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:110:27 [INFO] [stdout] | [INFO] [stdout] 110 | fn scatter(&mut self, k: i32, max_row: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_row` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:110:35 [INFO] [stdout] | [INFO] [stdout] 110 | fn scatter(&mut self, k: i32, max_row: i32) -> bool { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_max_row` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/biweekly/biweekly_80_2.rs:26:13 [INFO] [stdout] | [INFO] [stdout] 26 | let mut spells = spells; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `entry` [INFO] [stdout] --> src/leetcode/biweekly/biweekly_81_2.rs:32:21 [INFO] [stdout] | [INFO] [stdout] 32 | let entry = group.entry(parent).or_insert(1i64); [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_entry` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `last_bus` is assigned to, but never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:24:17 [INFO] [stdout] | [INFO] [stdout] 24 | let mut last_bus = 0; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_last_bus` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `last_count` is assigned to, but never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:25:17 [INFO] [stdout] | [INFO] [stdout] 25 | let mut last_count = 0; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_last_count` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `last_bus` is never read [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | last_bus = t; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `last_count` is never read [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_2.rs:38:13 [INFO] [stdout] | [INFO] [stdout] 38 | last_count = count; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/leetcode/biweekly/biweekly_82_3.rs:17:13 [INFO] [stdout] | [INFO] [stdout] 17 | let mut i = 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/biweekly/biweekly_83_1.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | let mut counter = ranks.iter().fold(vec![0; 13], |mut c, &x| { [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pattern` [INFO] [stdout] --> src/algorithm/kmp.rs:10:24 [INFO] [stdout] | [INFO] [stdout] 10 | fn index_of(&self, pattern: &String) -> Option { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_pattern` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithm/segment_tree.rs:62:13 [INFO] [stdout] | [INFO] [stdout] 62 | let mut tree: Vec> = vec![None; len * 4]; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_304.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | struct NumMatrix { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_304.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 43 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 44 | [INFO] [stdout] 45 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ParkingSystem` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct ParkingSystem { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `add_car` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_1603.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl ParkingSystem { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 56 | [INFO] [stdout] 57 | fn new(big: i32, medium: i32, small: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn add_car(&self, car_type: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `Number`, `Add`, `Minus`, `Quote`, `End`, and `Ignore` are never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_224.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 46 | enum Token { [INFO] [stdout] | ----- variants in this enum [INFO] [stdout] 47 | Number(i32), [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 48 | Add, [INFO] [stdout] | ^^^ [INFO] [stdout] 49 | Minus, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 50 | Quote, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 51 | End, [INFO] [stdout] | ^^^ [INFO] [stdout] 52 | Ignore [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Token` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyHashSet` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_705.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct MyHashSet { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, `remove`, `contains`, and `hash` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_705.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl MyHashSet { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn add(&mut self, key: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn remove(&mut self, key: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn contains(&self, key: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn hash(key: i32) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Result` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_838.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct Result { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/leetcode/editor/cn/solution_307.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_307.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 61 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 62 | [INFO] [stdout] 63 | pub fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Clamp` is never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_498.rs:37:7 [INFO] [stdout] | [INFO] [stdout] 37 | trait Clamp { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_pairs_worse` is never used [INFO] [stdout] --> src/leetcode/editor/cn/solution_532.rs:81:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 81 | fn find_pairs_worse(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Parent` is never constructed [INFO] [stdout] --> src/leetcode/weekly/weekly_304_3.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Parent { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SINGLE` is never used [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:7:7 [INFO] [stdout] | [INFO] [stdout] 7 | const SINGLE: i32 = 0; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `EQUAL` is never used [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:8:7 [INFO] [stdout] | [INFO] [stdout] 8 | const EQUAL: i32 = 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ASC` is never used [INFO] [stdout] --> src/leetcode/weekly/weekly_305_3.rs:9:7 [INFO] [stdout] | [INFO] [stdout] 9 | const ASC: i32 = 2; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BookMyShow` is never constructed [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct BookMyShow { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `BookOperation` is never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:29:7 [INFO] [stdout] | [INFO] [stdout] 29 | trait BookOperation { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `gather`, and `scatter` are never used [INFO] [stdout] --> src/leetcode/biweekly/biweekly_79_4.rs:91:8 [INFO] [stdout] | [INFO] [stdout] 89 | impl BookMyShow { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 90 | [INFO] [stdout] 91 | fn new(n: i32, m: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | fn gather(&mut self, k: i32, max_row: i32) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 110 | fn scatter(&mut self, k: i32, max_row: i32) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `index_of` is never used [INFO] [stdout] --> src/algorithm/kmp.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub trait KmpSearch { [INFO] [stdout] | --------- method in this trait [INFO] [stdout] ... [INFO] [stdout] 4 | fn index_of(&self, pattern: &Self::T) -> Option; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gcd` is never used [INFO] [stdout] --> src/algorithm/mod.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Scanner` is never constructed [INFO] [stdout] --> src/codeforces/scanner.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | struct Scanner { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Scanner` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `solution_offer_II_91` should have a snake case name [INFO] [stdout] --> src/leetcode/editor/cn/mod.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | pub mod solution_offer_II_91; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case (notice the capitalization): `solution_offer_ii_91` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 92 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 3.83s [INFO] running `Command { std: "docker" "inspect" "87ec8dcb5be8f4baefbf67e3f5c0b5e9ebccde14b3111a21acae82588fa15e83", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "87ec8dcb5be8f4baefbf67e3f5c0b5e9ebccde14b3111a21acae82588fa15e83", kill_on_drop: false }` [INFO] [stdout] 87ec8dcb5be8f4baefbf67e3f5c0b5e9ebccde14b3111a21acae82588fa15e83