[INFO] cloning repository https://github.com/duyquang6/algo-rs [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/duyquang6/algo-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fduyquang6%2Falgo-rs", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fduyquang6%2Falgo-rs'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 67eac728fb758f9f249bc4ed3b93f0235331fef7 [INFO] checking duyquang6/algo-rs against try#dd2d87b6cc31907ae305875eb6be399783dc0256 for pr-143929 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fduyquang6%2Falgo-rs" "/workspace/builds/worker-5-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc2/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/duyquang6/algo-rs [INFO] finished tweaking git repo https://github.com/duyquang6/algo-rs [INFO] tweaked toml for git repo https://github.com/duyquang6/algo-rs written to /workspace/builds/worker-5-tc2/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/duyquang6/algo-rs on toolchain dd2d87b6cc31907ae305875eb6be399783dc0256 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+dd2d87b6cc31907ae305875eb6be399783dc0256" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/duyquang6/algo-rs 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" "+dd2d87b6cc31907ae305875eb6be399783dc0256" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e8955075918b6d00525c617f7c34ee2595c70db70b3cf844dc875e4d3604499b" "/opt/rustwide/cargo-home/bin/cargo" "+dd2d87b6cc31907ae305875eb6be399783dc0256" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 7059488f95405476dabd44a2f27a743ba457765bd023882e9e3bbbf595430235 [INFO] running `Command { std: "docker" "start" "-a" "7059488f95405476dabd44a2f27a743ba457765bd023882e9e3bbbf595430235", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "7059488f95405476dabd44a2f27a743ba457765bd023882e9e3bbbf595430235", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7059488f95405476dabd44a2f27a743ba457765bd023882e9e3bbbf595430235", kill_on_drop: false }` [INFO] [stdout] 7059488f95405476dabd44a2f27a743ba457765bd023882e9e3bbbf595430235 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e8955075918b6d00525c617f7c34ee2595c70db70b3cf844dc875e4d3604499b" "/opt/rustwide/cargo-home/bin/cargo" "+dd2d87b6cc31907ae305875eb6be399783dc0256" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 635f49a858ddda06ef9c75d43771b4a5201d67a9eae467b5d65f3bdb2aad7579 [INFO] running `Command { std: "docker" "start" "-a" "635f49a858ddda06ef9c75d43771b4a5201d67a9eae467b5d65f3bdb2aad7579", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.172 [INFO] [stderr] Compiling zerocopy v0.8.25 [INFO] [stderr] Checking cfg-if v1.0.0 [INFO] [stderr] Checking getrandom v0.2.16 [INFO] [stderr] Checking rand_core v0.6.4 [INFO] [stderr] Checking ppv-lite86 v0.2.21 [INFO] [stderr] Checking rand_chacha v0.3.1 [INFO] [stderr] Checking rand v0.8.5 [INFO] [stderr] Checking algo-rs v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque` [INFO] [stdout] --> src/daily/daily_20250413.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, VecDeque}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque` [INFO] [stdout] --> src/daily/daily_20250414.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, VecDeque}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/daily/daily_20250416.rs:36:9 [INFO] [stdout] | [INFO] [stdout] 36 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/daily/daily_20250417.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/daily/daily_20250418.rs:32:9 [INFO] [stdout] | [INFO] [stdout] 32 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::str::from_utf8` [INFO] [stdout] --> src/practice/p_297.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::str::from_utf8; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/practice/p_651.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `cmp::Reverse` [INFO] [stdout] --> src/practice/pq_378.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cmp::Reverse, collections::*}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `cmp::Reverse` [INFO] [stdout] --> src/practice/pq_506.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cmp::Reverse, collections::*}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/practice/practice_193.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque` [INFO] [stdout] --> src/daily/daily_20250413.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, VecDeque}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque` [INFO] [stdout] --> src/daily/daily_20250414.rs:1:24 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::{HashMap, VecDeque}; [INFO] [stdout] | ^^^^^^^ ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::str::from_utf8` [INFO] [stdout] --> src/practice/p_297.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | use std::str::from_utf8; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::HashMap` [INFO] [stdout] --> src/practice/p_651.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `cmp::Reverse` [INFO] [stdout] --> src/practice/pq_378.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cmp::Reverse, collections::*}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `cmp::Reverse` [INFO] [stdout] --> src/practice/pq_506.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cmp::Reverse, collections::*}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/practice/practice_193.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: duplicated attribute [INFO] [stdout] --> src/weekly/week_446.rs:59:5 [INFO] [stdout] | [INFO] [stdout] 59 | #[test] [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(duplicate_macro_attributes)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/daily/daily_20250420.rs:3:13 [INFO] [stdout] | [INFO] [stdout] 3 | let n = answers.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cnt_uniq` [INFO] [stdout] --> src/daily/daily_20250424.rs:8:17 [INFO] [stdout] | [INFO] [stdout] 8 | let (_, cnt_uniq) = sorted_nums.iter().fold((0, 0), |(last_value, cnt), &item| { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cnt_uniq` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `ans` is assigned to, but never used [INFO] [stdout] --> src/daily/daily_20250424.rs:19:17 [INFO] [stdout] | [INFO] [stdout] 19 | let mut ans = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_ans` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `ans` is assigned to, but never used [INFO] [stdout] --> src/daily/daily_20250426.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut ans = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_ans` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/practice/p_1615.rs:13:21 [INFO] [stdout] | [INFO] [stdout] 13 | let mut ans = direct_road_count[i] + direct_road_count[j]; [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/practice/p_297.rs:68:13 [INFO] [stdout] | [INFO] [stdout] 68 | let mut root_node = TreeNode::new(data_arr[0].unwrap()); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/practice/practice_132.rs:16:9 [INFO] [stdout] | [INFO] [stdout] 16 | let n = s.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/practice/practice_99.rs:37:22 [INFO] [stdout] | [INFO] [stdout] 37 | if let (Some(mut first), Some(mut second)) = (first_elem, second_elem) { [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/practice/practice_99.rs:37:39 [INFO] [stdout] | [INFO] [stdout] 37 | if let (Some(mut first), Some(mut second)) = (first_elem, second_elem) { [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/weekly/week_446.rs:42:25 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn result_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/weekly/week_446.rs:42:41 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn result_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/weekly/week_447.rs:4:36 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn count_covered_buildings(n: i32, buildings: Vec>) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_operations` and `unique_xor_triplets` are never used [INFO] [stdout] --> src/biweekly/biweekly_154.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 2 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 6 | pub fn unique_xor_triplets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/biweekly/biweekly_154.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MOD` is never used [INFO] [stdout] --> src/biweekly/biweekly_155.rs:2:7 [INFO] [stdout] | [INFO] [stdout] 2 | const MOD: i64 = 1e9 as i64 + 7; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_common_response`, `base_unit_conversions`, and `count_cells` are never used [INFO] [stdout] --> src/biweekly/biweekly_155.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 5 | pub fn find_common_response(responses: Vec>) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn base_unit_conversions(conversions: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn count_cells(grid: Vec>, pattern: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/biweekly/biweekly_155.rs:133:8 [INFO] [stdout] | [INFO] [stdout] 133 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250413.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MOD` is never used [INFO] [stdout] --> src/daily/daily_20250413.rs:5:7 [INFO] [stdout] | [INFO] [stdout] 5 | const MOD: i64 = 1e9 as i64 + 7; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good_numbers` is never used [INFO] [stdout] --> src/daily/daily_20250413.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn count_good_numbers(n: i64) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `fast_exponential` is never used [INFO] [stdout] --> src/daily/daily_20250413.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn fast_exponential(base: i32, mut exp: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good_triplets` is never used [INFO] [stdout] --> src/daily/daily_20250414.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_good_triplets(arr: Vec, a: i32, b: i32, c: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250414.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `update` is never used [INFO] [stdout] --> src/daily/daily_20250415.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn update(tree: &mut Vec, node: i32, ss: i32, se: i32, idx: i32, value: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `query` is never used [INFO] [stdout] --> src/daily/daily_20250415.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | pub fn query(tree: &Vec, node: i32, ss: i32, se: i32, qs: i32, qe: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `good_triplets` is never used [INFO] [stdout] --> src/daily/daily_20250415.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn good_triplets(nums1: Vec, nums2: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250415.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good` is never used [INFO] [stdout] --> src/daily/daily_20250416.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_good(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250416.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 33 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_pairs` is never used [INFO] [stdout] --> src/daily/daily_20250417.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn count_pairs(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gcd` is never used [INFO] [stdout] --> src/daily/daily_20250417.rs:17:4 [INFO] [stdout] | [INFO] [stdout] 17 | fn gcd(mut a: i32, mut b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `gcd_recur` is never used [INFO] [stdout] --> src/daily/daily_20250417.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn gcd_recur(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250417.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_and_say` is never used [INFO] [stdout] --> src/daily/daily_20250418.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250418.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_fair_pairs` is never used [INFO] [stdout] --> src/daily/daily_20250419.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn count_fair_pairs(mut nums: Vec, lower: i32, upper: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_fair_under` is never used [INFO] [stdout] --> src/daily/daily_20250419.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn count_fair_under(nums: &Vec, upper: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250419.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_rabbits` is never used [INFO] [stdout] --> src/daily/daily_20250420.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn num_rabbits(answers: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250420.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_arrays` is never used [INFO] [stdout] --> src/daily/daily_20250421.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250421.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `ideal_arrays` is never used [INFO] [stdout] --> src/daily/daily_20250422.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn ideal_arrays(n: i32, max_value: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250422.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_largest_group` is never used [INFO] [stdout] --> src/daily/daily_20250423.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn count_largest_group(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_decimal_sum` is never used [INFO] [stdout] --> src/daily/daily_20250423.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn get_decimal_sum(mut n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250423.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_complete_subarrays` is never used [INFO] [stdout] --> src/daily/daily_20250424.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_complete_subarrays(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250424.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_interesting_subarrays` is never used [INFO] [stdout] --> src/daily/daily_20250425.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_interesting_subarrays(nums: Vec, modulo: i32, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250425.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_subarrays` is never used [INFO] [stdout] --> src/daily/daily_20250426.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn count_subarrays(nums: Vec, min_k: i32, max_k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250426.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 79 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_subarrays` is never used [INFO] [stdout] --> src/daily/daily_20250429.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn count_subarrays(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/daily/daily_20250429.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_1246.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_palindrome_remove` is never used [INFO] [stdout] --> src/practice/p_1246.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | fn minimum_palindrome_remove(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/p_1246.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn recur(arr: &Vec, memo: &mut HashMap, start: usize, end: usize) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_key` is never used [INFO] [stdout] --> src/practice/p_1246.rs:33:4 [INFO] [stdout] | [INFO] [stdout] 33 | fn get_key(start: usize, end: usize) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximal_network_rank` is never used [INFO] [stdout] --> src/practice/p_1615.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn maximal_network_rank(n: i32, roads: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_1615.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/practice/p_236.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/p_236.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_236.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/practice/p_236.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 25 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/p_236.rs:59:4 [INFO] [stdout] | [INFO] [stdout] 59 | fn recur( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/practice/p_236.rs:102:4 [INFO] [stdout] | [INFO] [stdout] 102 | fn dfs(node: &Option>>, q_val: i32) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_286.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `wall_and_gates` is never used [INFO] [stdout] --> src/practice/p_286.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn wall_and_gates(rooms: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `DIRS` is never used [INFO] [stdout] --> src/practice/p_286.rs:25:7 [INFO] [stdout] | [INFO] [stdout] 25 | const DIRS: [[i32; 2]; 4] = [[0, 1], [0, -1], [1, 0], [-1, 0]]; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/p_286.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn recur( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/practice/p_297.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/p_297.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/practice/p_297.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, and `deserialize` are never used [INFO] [stdout] --> src/practice/p_297.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 29 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `write_node` is never used [INFO] [stdout] --> src/practice/p_297.rs:77:4 [INFO] [stdout] | [INFO] [stdout] 77 | fn write_node(data: &mut String, node: &Option>>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur_serialize` is never used [INFO] [stdout] --> src/practice/p_297.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn recur_serialize(idx: usize, data: &mut String, root: Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur_deserialize` is never used [INFO] [stdout] --> src/practice/p_297.rs:100:4 [INFO] [stdout] | [INFO] [stdout] 100 | fn recur_deserialize(data: &Vec>, idx: &mut usize, node: Rc>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_340.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longestKSubstr` is never used [INFO] [stdout] --> src/practice/p_340.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | fn longestKSubstr(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MovingAverage` is never constructed [INFO] [stdout] --> src/practice/p_346.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MovingAverage { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `next` are never used [INFO] [stdout] --> src/practice/p_346.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl MovingAverage { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 10 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn next(&mut self, val: i32) -> f64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TicTacToe` is never constructed [INFO] [stdout] --> src/practice/p_348.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct TicTacToe { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/p_348.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl TicTacToe { [INFO] [stdout] | -------------- associated function in this implementation [INFO] [stdout] 12 | fn new(n: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HitCounter` is never constructed [INFO] [stdout] --> src/practice/p_362.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct HitCounter { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `hit`, and `get_hits` are never used [INFO] [stdout] --> src/practice/p_362.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl HitCounter { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 9 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn hit(&mut self, timestamp: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn get_hits(&mut self, timestamp: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `PhoneDirectory` is never constructed [INFO] [stdout] --> src/practice/p_379.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct PhoneDirectory { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, `check`, and `release` are never used [INFO] [stdout] --> src/practice/p_379.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl PhoneDirectory { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 10 | fn new(max_numbers: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn get(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn check(&self, number: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn release(&mut self, number: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_384.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `reset`, and `shuffle` are never used [INFO] [stdout] --> src/practice/p_384.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 12 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn reset(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn shuffle(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `decode_string` is never used [INFO] [stdout] --> src/practice/p_394.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn decode_string(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/p_394.rs:12:4 [INFO] [stdout] | [INFO] [stdout] 12 | fn recur(s: &[u8], mut idx: usize, cur: &mut String) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_394.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 44 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `four_key_keyboard` is never used [INFO] [stdout] --> src/practice/p_651.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn four_key_keyboard(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/p_651.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn recur(n: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_651.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `letter_case_permutation` is never used [INFO] [stdout] --> src/practice/p_784.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn letter_case_permutation(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `backtrack` is never used [INFO] [stdout] --> src/practice/p_784.rs:9:4 [INFO] [stdout] | [INFO] [stdout] 9 | fn backtrack(letters: &[u8], cur: &mut String, ans: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_784.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest` is never used [INFO] [stdout] --> src/practice/pq_378.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn kth_smallest(matrix: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/pq_378.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_relative_ranks` is never used [INFO] [stdout] --> src/practice/pq_506.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn find_relative_ranks(score: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/pq_506.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_cut` is never used [INFO] [stdout] --> src/practice/practice_132.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 2 | pub fn min_cut(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/practice_132.rs:8:4 [INFO] [stdout] | [INFO] [stdout] 8 | fn recur(s: &str, memo: &mut Vec, idx: usize) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_palindrome` is never used [INFO] [stdout] --> src/practice/practice_132.rs:29:4 [INFO] [stdout] | [INFO] [stdout] 29 | fn is_palindrome(s: &str, mut ss: usize, mut se: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/practice_132.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `restore_ip_addresses` is never used [INFO] [stdout] --> src/practice/practice_193.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `check_group_valid` is never used [INFO] [stdout] --> src/practice/practice_193.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn check_group_valid(data: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/practice_193.rs:35:4 [INFO] [stdout] | [INFO] [stdout] 35 | fn recur(s: &str, idx: usize, cur: &mut String, dot_count: i32, ans: &mut Vec) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/practice_193.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/practice_212.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_words` is never used [INFO] [stdout] --> src/practice/practice_212.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_trie` is never used [INFO] [stdout] --> src/practice/practice_212.rs:21:4 [INFO] [stdout] | [INFO] [stdout] 21 | fn dfs_trie(root: &Trie, cur: &mut String, ans: &mut Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/practice/practice_212.rs:37:4 [INFO] [stdout] | [INFO] [stdout] 37 | fn insert(word: &str, root: &mut Trie, idx: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/practice/practice_212.rs:47:4 [INFO] [stdout] | [INFO] [stdout] 47 | fn search(word: &str, root: &Trie, idx: usize) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `DIRS` is never used [INFO] [stdout] --> src/practice/practice_212.rs:60:7 [INFO] [stdout] | [INFO] [stdout] 60 | const DIRS: [[i32; 2]; 4] = [[0, 1], [0, -1], [-1, 0], [1, 0]]; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/practice/practice_212.rs:62:4 [INFO] [stdout] | [INFO] [stdout] 62 | fn dfs(board: &Vec>, visited: &mut Vec>, node: &mut Trie, i: i32, j: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/practice/practice_212.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/practice_212.rs:116:8 [INFO] [stdout] | [INFO] [stdout] 115 | impl Trie { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 116 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Op` is never used [INFO] [stdout] --> src/practice/practice_224.rs:4:6 [INFO] [stdout] | [INFO] [stdout] 4 | enum Op { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate` is never used [INFO] [stdout] --> src/practice/practice_224.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/practice_224.rs:15:4 [INFO] [stdout] | [INFO] [stdout] 15 | fn recur(s: &[u8], mut idx: usize) -> (i32, usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `calc_stack` is never used [INFO] [stdout] --> src/practice/practice_224.rs:40:4 [INFO] [stdout] | [INFO] [stdout] 40 | fn calc_stack(stack: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parse_operand` is never used [INFO] [stdout] --> src/practice/practice_224.rs:71:4 [INFO] [stdout] | [INFO] [stdout] 71 | fn parse_operand(chars: &[u8], idx: usize) -> (i32, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/practice_224.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/practice/practice_99.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/practice_99.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] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/practice_99.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `recover_tree` and `optimize_recover_tree` are never used [INFO] [stdout] --> src/practice/practice_99.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 24 | // O(n) space [INFO] [stdout] 25 | pub fn recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn optimize_recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `optimize_dfs_inorder` is never used [INFO] [stdout] --> src/practice/practice_99.rs:45:4 [INFO] [stdout] | [INFO] [stdout] 45 | fn optimize_dfs_inorder( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_inorder` is never used [INFO] [stdout] --> src/practice/practice_99.rs:70:4 [INFO] [stdout] | [INFO] [stdout] 70 | fn dfs_inorder(root: &mut Option>>, nodes: &Vec, idx: &mut usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_get_nodes` is never used [INFO] [stdout] --> src/practice/practice_99.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn dfs_get_nodes(root: &Option>>, list_nodes: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/daily/daily_20250420.rs:3:13 [INFO] [stdout] | [INFO] [stdout] 3 | let n = answers.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `calculate_score`, `maximum_possible_size`, and `result_array` are never used [INFO] [stdout] --> src/weekly/week_446.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 2 | pub fn calculate_score(instructions: Vec, values: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn maximum_possible_size(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn result_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/weekly/week_446.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_covered_buildings`, `path_existence_queries_I`, and `concatenated_divisibility` are never used [INFO] [stdout] --> src/weekly/week_447.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_covered_buildings(n: i32, buildings: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn path_existence_queries_I( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | pub fn concatenated_divisibility(mut nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_num_pow` is never used [INFO] [stdout] --> src/weekly/week_447.rs:97:4 [INFO] [stdout] | [INFO] [stdout] 97 | fn get_num_pow(mut n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/weekly/week_447.rs:106:4 [INFO] [stdout] | [INFO] [stdout] 106 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/weekly/week_447.rs:148:8 [INFO] [stdout] | [INFO] [stdout] 148 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `longestKSubstr` should have a snake case name [INFO] [stdout] --> src/practice/p_340.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | fn longestKSubstr(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ help: convert the identifier to snake case: `longest_ksubstr` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `path_existence_queries_I` should have a snake case name [INFO] [stdout] --> src/weekly/week_447.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn path_existence_queries_I( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case (notice the capitalization): `path_existence_queries_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cnt_uniq` [INFO] [stdout] --> src/daily/daily_20250424.rs:8:17 [INFO] [stdout] | [INFO] [stdout] 8 | let (_, cnt_uniq) = sorted_nums.iter().fold((0, 0), |(last_value, cnt), &item| { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cnt_uniq` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `ans` is assigned to, but never used [INFO] [stdout] --> src/daily/daily_20250424.rs:19:17 [INFO] [stdout] | [INFO] [stdout] 19 | let mut ans = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_ans` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `ans` is assigned to, but never used [INFO] [stdout] --> src/daily/daily_20250426.rs:14:17 [INFO] [stdout] | [INFO] [stdout] 14 | let mut ans = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_ans` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/practice/p_1615.rs:13:21 [INFO] [stdout] | [INFO] [stdout] 13 | let mut ans = direct_road_count[i] + direct_road_count[j]; [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/practice/p_297.rs:68:13 [INFO] [stdout] | [INFO] [stdout] 68 | let mut root_node = TreeNode::new(data_arr[0].unwrap()); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/practice/practice_132.rs:16:9 [INFO] [stdout] | [INFO] [stdout] 16 | let n = s.len(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/practice/practice_99.rs:37:22 [INFO] [stdout] | [INFO] [stdout] 37 | if let (Some(mut first), Some(mut second)) = (first_elem, second_elem) { [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/practice/practice_99.rs:37:39 [INFO] [stdout] | [INFO] [stdout] 37 | if let (Some(mut first), Some(mut second)) = (first_elem, second_elem) { [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/weekly/week_446.rs:42:25 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn result_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/weekly/week_446.rs:42:41 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn result_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/weekly/week_447.rs:4:36 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn count_covered_buildings(n: i32, buildings: Vec>) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_xor_triplets` is never used [INFO] [stdout] --> src/biweekly/biweekly_154.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 6 | pub fn unique_xor_triplets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MOD` is never used [INFO] [stdout] --> src/biweekly/biweekly_155.rs:2:7 [INFO] [stdout] | [INFO] [stdout] 2 | const MOD: i64 = 1e9 as i64 + 7; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_common_response` and `base_unit_conversions` are never used [INFO] [stdout] --> src/biweekly/biweekly_155.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 5 | pub fn find_common_response(responses: Vec>) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn base_unit_conversions(conversions: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/practice/p_236.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/p_236.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_236.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/practice/p_236.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 25 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur` is never used [INFO] [stdout] --> src/practice/p_236.rs:59:4 [INFO] [stdout] | [INFO] [stdout] 59 | fn recur( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs` is never used [INFO] [stdout] --> src/practice/p_236.rs:102:4 [INFO] [stdout] | [INFO] [stdout] 102 | fn dfs(node: &Option>>, q_val: i32) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/practice/p_297.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/p_297.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | #[inline] [INFO] [stdout] 11 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Codec` is never constructed [INFO] [stdout] --> src/practice/p_297.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct Codec {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `serialize`, and `deserialize` are never used [INFO] [stdout] --> src/practice/p_297.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl Codec { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 29 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn serialize(&self, root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `write_node` is never used [INFO] [stdout] --> src/practice/p_297.rs:77:4 [INFO] [stdout] | [INFO] [stdout] 77 | fn write_node(data: &mut String, node: &Option>>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur_serialize` is never used [INFO] [stdout] --> src/practice/p_297.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn recur_serialize(idx: usize, data: &mut String, root: Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recur_deserialize` is never used [INFO] [stdout] --> src/practice/p_297.rs:100:4 [INFO] [stdout] | [INFO] [stdout] 100 | fn recur_deserialize(data: &Vec>, idx: &mut usize, node: Rc>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MovingAverage` is never constructed [INFO] [stdout] --> src/practice/p_346.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MovingAverage { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `next` are never used [INFO] [stdout] --> src/practice/p_346.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl MovingAverage { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 10 | fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn next(&mut self, val: i32) -> f64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TicTacToe` is never constructed [INFO] [stdout] --> src/practice/p_348.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct TicTacToe { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/p_348.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl TicTacToe { [INFO] [stdout] | -------------- associated function in this implementation [INFO] [stdout] 12 | fn new(n: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HitCounter` is never constructed [INFO] [stdout] --> src/practice/p_362.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct HitCounter { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `hit`, and `get_hits` are never used [INFO] [stdout] --> src/practice/p_362.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl HitCounter { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 9 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn hit(&mut self, timestamp: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn get_hits(&mut self, timestamp: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `PhoneDirectory` is never constructed [INFO] [stdout] --> src/practice/p_379.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct PhoneDirectory { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, `check`, and `release` are never used [INFO] [stdout] --> src/practice/p_379.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl PhoneDirectory { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 10 | fn new(max_numbers: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn get(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn check(&self, number: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn release(&mut self, number: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/p_384.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `reset`, and `shuffle` are never used [INFO] [stdout] --> src/practice/p_384.rs:12:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 12 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn reset(&self) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn shuffle(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `search` is never used [INFO] [stdout] --> src/practice/practice_212.rs:47:4 [INFO] [stdout] | [INFO] [stdout] 47 | fn search(word: &str, root: &Trie, idx: usize) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/practice/practice_99.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/practice/practice_99.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] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/practice/practice_99.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `recover_tree` and `optimize_recover_tree` are never used [INFO] [stdout] --> src/practice/practice_99.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 23 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 24 | // O(n) space [INFO] [stdout] 25 | pub fn recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn optimize_recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `optimize_dfs_inorder` is never used [INFO] [stdout] --> src/practice/practice_99.rs:45:4 [INFO] [stdout] | [INFO] [stdout] 45 | fn optimize_dfs_inorder( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_inorder` is never used [INFO] [stdout] --> src/practice/practice_99.rs:70:4 [INFO] [stdout] | [INFO] [stdout] 70 | fn dfs_inorder(root: &mut Option>>, nodes: &Vec, idx: &mut usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dfs_get_nodes` is never used [INFO] [stdout] --> src/practice/practice_99.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn dfs_get_nodes(root: &Option>>, list_nodes: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `result_array` is never used [INFO] [stdout] --> src/weekly/week_446.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 1 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn result_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_covered_buildings` and `path_existence_queries_I` are never used [INFO] [stdout] --> src/weekly/week_447.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_covered_buildings(n: i32, buildings: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn path_existence_queries_I( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `longestKSubstr` should have a snake case name [INFO] [stdout] --> src/practice/p_340.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | fn longestKSubstr(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ help: convert the identifier to snake case: `longest_ksubstr` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `test_longestKSubstr` should have a snake case name [INFO] [stdout] --> src/practice/p_340.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | fn test_longestKSubstr() { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `test_longest_ksubstr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `path_existence_queries_I` should have a snake case name [INFO] [stdout] --> src/weekly/week_447.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn path_existence_queries_I( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case (notice the capitalization): `path_existence_queries_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 3.14s [INFO] running `Command { std: "docker" "inspect" "635f49a858ddda06ef9c75d43771b4a5201d67a9eae467b5d65f3bdb2aad7579", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "635f49a858ddda06ef9c75d43771b4a5201d67a9eae467b5d65f3bdb2aad7579", kill_on_drop: false }` [INFO] [stdout] 635f49a858ddda06ef9c75d43771b4a5201d67a9eae467b5d65f3bdb2aad7579