[INFO] cloning repository https://github.com/pooyaht/practice_problems [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/pooyaht/practice_problems" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpooyaht%2Fpractice_problems", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpooyaht%2Fpractice_problems'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] da26bca5c6e65a61bc1890d499fea97d7af690e8 [INFO] checking pooyaht/practice_problems against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fpooyaht%2Fpractice_problems" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/pooyaht/practice_problems 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/pooyaht/practice_problems [INFO] finished tweaking git repo https://github.com/pooyaht/practice_problems [INFO] tweaked toml for git repo https://github.com/pooyaht/practice_problems written to /workspace/builds/worker-0-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/pooyaht/practice_problems 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] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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] 9d66e160e5a9371fe3a108e0e91337a3dbf3abbee9731b51222f8b9b4d4a88a3 [INFO] running `Command { std: "docker" "start" "-a" "9d66e160e5a9371fe3a108e0e91337a3dbf3abbee9731b51222f8b9b4d4a88a3", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "9d66e160e5a9371fe3a108e0e91337a3dbf3abbee9731b51222f8b9b4d4a88a3", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "9d66e160e5a9371fe3a108e0e91337a3dbf3abbee9731b51222f8b9b4d4a88a3", kill_on_drop: false }` [INFO] [stdout] 9d66e160e5a9371fe3a108e0e91337a3dbf3abbee9731b51222f8b9b4d4a88a3 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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] 3700856402ea85c3cadf2f868e336a2e35d2e242fe5c0cce3885f0c7c23ef834 [INFO] running `Command { std: "docker" "start" "-a" "3700856402ea85c3cadf2f868e336a2e35d2e242fe5c0cce3885f0c7c23ef834", kill_on_drop: false }` [INFO] [stderr] Checking practice_problems v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/easy/e26_remove_duplicates_from_sorted_array.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 19 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/easy/e303_range_sum_query_immutable.rs:30:9 [INFO] [stdout] | [INFO] [stdout] 30 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/easy/e876_middle_of_linked_list.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/hard/h297_serialize_binary_tree.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/medium/m167_two_sum_ii_input_array_is_sorted.rs:23:9 [INFO] [stdout] | [INFO] [stdout] 23 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/medium/m80_remove_duplicates_from_sorted_array_ii.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 19 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::borrow::BorrowMut` [INFO] [stdout] --> src/hard/h297_serialize_binary_tree.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | use std::borrow::BorrowMut; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:64:14 [INFO] [stdout] | [INFO] [stdout] 64 | for (i, num) in nums.iter().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `r` [INFO] [stdout] --> src/medium/m209_minimum_size_subarray_sum.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut r = 0; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_r` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/medium/m209_minimum_size_subarray_sum.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut r = 0; [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: unused variable: `i` [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:64:14 [INFO] [stdout] | [INFO] [stdout] 64 | for (i, num) in nums.iter().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `r` [INFO] [stdout] --> src/medium/m209_minimum_size_subarray_sum.rs:5:17 [INFO] [stdout] | [INFO] [stdout] 5 | let mut r = 0; [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_r` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/medium/m209_minimum_size_subarray_sum.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut r = 0; [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/medium/m918_maximum_sum_circular_subarray.rs:3:38 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn max_subarray_sum_circular(mut nums: Vec) -> i32 { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e104_max_depth_binary_tree.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] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e104_max_depth_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/easy/e104_max_depth_binary_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e121_best_time_to_buy_stuck.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/easy/e121_best_time_to_buy_stuck.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e125_valid_palindrome.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/easy/e125_valid_palindrome.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e1_two_sum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/easy/e1_two_sum.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e206_reverse_linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e206_reverse_linked_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_list` is never used [INFO] [stdout] --> src/easy/e206_reverse_linked_list.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e20_valid_parantheses.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/easy/e20_valid_parantheses.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e217_contains_duplicate.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_duplicate` is never used [INFO] [stdout] --> src/easy/e217_contains_duplicate.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e219_contains_duplicate_2.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/easy/e219_contains_duplicate_2.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e21_merge_two_sorted_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e21_merge_two_sorted_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/easy/e21_merge_two_sorted_list.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e226_invert_binary_tree.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/easy/e226_invert_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/easy/e226_invert_binary_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e242_is_anagram.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_anagram` is never used [INFO] [stdout] --> src/easy/e242_is_anagram.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e26_remove_duplicates_from_sorted_array.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/easy/e26_remove_duplicates_from_sorted_array.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/easy/e303_range_sum_query_immutable.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_range` are never used [INFO] [stdout] --> src/easy/e303_range_sum_query_immutable.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 10 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e572_subtree_of_another_tree.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e572_subtree_of_another_tree.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_subtree` and `is_identical` are never used [INFO] [stdout] --> src/easy/e572_subtree_of_another_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 21 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 22 | pub fn is_subtree( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn is_identical( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e704_binary_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/easy/e704_binary_search.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e724_find_pivot_index.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `pivot_index` is never used [INFO] [stdout] --> src/easy/e724_find_pivot_index.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn pivot_index(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e876_middle_of_linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e876_middle_of_linked_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `middle_node` is never used [INFO] [stdout] --> src/easy/e876_middle_of_linked_list.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn middle_node(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hard/h207_course_schedule.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_finish` is never used [INFO] [stdout] --> src/hard/h207_course_schedule.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 13 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 21 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn insert(&mut self, word: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn search(&self, word: &str) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn starts_with(&self, prefix: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_words` and `dfs` are never used [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 64 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/hard/h297_serialize_binary_tree.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/hard/h297_serialize_binary_tree.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/hard/h297_serialize_binary_tree.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] 46 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hard/h42_trapping_rain_water.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap` is never used [INFO] [stdout] --> src/hard/h42_trapping_rain_water.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `search` are never used [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl TrieNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 8 | fn new() -> TrieNode { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn insert(&mut self, word: &str, index: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn search(&self, word: &str) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordFilter` is never constructed [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct WordFilter { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `f` are never used [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl WordFilter { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 51 | fn new(words: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn f(&self, pref: String, suff: String) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m1049_last_stone_weight_2.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `last_stone_weight_ii` is never used [INFO] [stdout] --> src/medium/m1049_last_stone_weight_2.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn last_stone_weight_ii(stones: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m105_construct_binary_tree_from_preorder_inorder.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/medium/m105_construct_binary_tree_from_preorder_inorder.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/medium/m105_construct_binary_tree_from_preorder_inorder.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m11_container_with_most_water.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_area` is never used [INFO] [stdout] --> src/medium/m11_container_with_most_water.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `New`, `find`, and `union` are never used [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 10 | fn New() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn find(&mut self, mut node_id: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn union(&mut self, node1_id: i32, node2_id: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_consecutive` is never used [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m1343_subarrays_size_k_average_greater_than_threshold.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_of_subarrays` is never used [INFO] [stdout] --> src/medium/m1343_subarrays_size_k_average_greater_than_threshold.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_of_subarrays(arr: Vec, k: i32, threshold: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m152_maximum_product_subarray.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_product` is never used [INFO] [stdout] --> src/medium/m152_maximum_product_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m153_search_in_rotated_array.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/medium/m153_search_in_rotated_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m15_three_sum.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum` is never used [INFO] [stdout] --> src/medium/m15_three_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m167_two_sum_ii_input_array_is_sorted.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/medium/m167_two_sum_ii_input_array_is_sorted.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m19_nth_element_from_end.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m19_nth_element_from_end.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_nth_from_end` is never used [INFO] [stdout] --> src/medium/m19_nth_element_from_end.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m200_number_of_islands.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_islands` is never used [INFO] [stdout] --> src/medium/m200_number_of_islands.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/medium/m208_implement_trie.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/medium/m208_implement_trie.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m208_implement_trie.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/medium/m208_implement_trie.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 20 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m209_minimum_size_subarray_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sub_array_len` is never used [INFO] [stdout] --> src/medium/m209_minimum_size_subarray_sum.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, and `search` are never used [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 18 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 19 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn add_word(&mut self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m2130_maximum_twin_sum_of_Linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m2130_maximum_twin_sum_of_Linked_list.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `pair_sum` is never used [INFO] [stdout] --> src/medium/m2130_maximum_twin_sum_of_Linked_list.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn pair_sum(head: Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m238_product_of_array_except_self.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_except_self` is never used [INFO] [stdout] --> src/medium/m238_product_of_array_except_self.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m287_find_the_duplicate_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_duplicate` is never used [INFO] [stdout] --> src/medium/m287_find_the_duplicate_number.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn find_duplicate(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/medium/m304_range_sum_query_2d_immutable.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct NumMatrix { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/medium/m304_range_sum_query_2d_immutable.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 11 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SegmentTree` is never constructed [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct SegmentTree { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `SegmentTree` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `build`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl SegmentTree { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | fn build(nums: &[i32], lower_range: i32, upper_range: i32) -> SegmentTree { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn update(&mut self, index: i32, value: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:94:12 [INFO] [stdout] | [INFO] [stdout] 94 | pub struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:99:12 [INFO] [stdout] | [INFO] [stdout] 98 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 99 | pub fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | pub fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | pub fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m33_find_min_in_rotated_array.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/medium/m33_find_min_in_rotated_array.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m347_top_k_frequent_elements.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `top_k_frequent` is never used [INFO] [stdout] --> src/medium/m347_top_k_frequent_elements.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m3_longest_substring_without_repeating.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/medium/m3_longest_substring_without_repeating.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m416_partition_equal_subset_sum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_partition` is never used [INFO] [stdout] --> src/medium/m416_partition_equal_subset_sum.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m424_longest_repeating_character_replacement.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `character_replacement` is never used [INFO] [stdout] --> src/medium/m424_longest_repeating_character_replacement.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn character_replacement(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m435_non_overlapping_intervals.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used [INFO] [stdout] --> src/medium/m435_non_overlapping_intervals.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn erase_overlap_intervals(intervals: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m474_ones_and_zeros.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_form` is never used [INFO] [stdout] --> src/medium/m474_ones_and_zeros.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | fn find_max_form(strs: Vec, m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m494_target_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_target_sum_ways` is never used [INFO] [stdout] --> src/medium/m494_target_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_target_sum_ways(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m49_group_anagrams.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/medium/m49_group_anagrams.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m53_max_sub_array.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/medium/m53_max_sub_array.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m560_subarray_sum_equals_k.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `subarray_sum` is never used [INFO] [stdout] --> src/medium/m560_subarray_sum_equals_k.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn subarray_sum(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m56_merge_intervals.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/medium/m56_merge_intervals.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m647_palindromic_substring.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_substrings` is never used [INFO] [stdout] --> src/medium/m647_palindromic_substring.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn count_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `New`, `find`, and `union` are never used [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 7 | fn New() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn find(&mut self, mut node_id: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn union(&mut self, node1_id: i32, node2_id: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_redundant_connection` is never used [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn find_redundant_connection(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `New`, `find`, and `union` are never used [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 9 | fn New() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn find(&mut self, mut node_id: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn union(&mut self, node1_id: i32, node2_id: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `accounts_merge` is never used [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | pub fn accounts_merge(accounts: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m80_remove_duplicates_from_sorted_array_ii.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/medium/m80_remove_duplicates_from_sorted_array_ii.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m918_maximum_sum_circular_subarray.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_subarray_sum_circular` is never used [INFO] [stdout] --> src/medium/m918_maximum_sum_circular_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_subarray_sum_circular(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m978_longest_turbulent_subarray.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_turbulence_size` is never used [INFO] [stdout] --> src/medium/m978_longest_turbulent_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_turbulence_size(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m98_is_valid_binary_tree.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/medium/m98_is_valid_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_bst` is never used [INFO] [stdout] --> src/medium/m98_is_valid_binary_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `m2130_maximum_twin_sum_of_Linked_list` should have a snake case name [INFO] [stdout] --> src/medium/mod.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | pub mod m2130_maximum_twin_sum_of_Linked_list; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `m2130_maximum_twin_sum_of_linked_list` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `New` should have a snake case name [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn New() -> Self { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `new` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `New` should have a snake case name [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | fn New() -> Self { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `new` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `New` should have a snake case name [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn New() -> Self { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `new` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/medium/m918_maximum_sum_circular_subarray.rs:3:38 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn max_subarray_sum_circular(mut nums: Vec) -> i32 { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 163 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e104_max_depth_binary_tree.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] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e104_max_depth_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/easy/e104_max_depth_binary_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e121_best_time_to_buy_stuck.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/easy/e121_best_time_to_buy_stuck.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e125_valid_palindrome.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/easy/e125_valid_palindrome.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e1_two_sum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/easy/e1_two_sum.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e206_reverse_linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e206_reverse_linked_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_list` is never used [INFO] [stdout] --> src/easy/e206_reverse_linked_list.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e20_valid_parantheses.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/easy/e20_valid_parantheses.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e217_contains_duplicate.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_duplicate` is never used [INFO] [stdout] --> src/easy/e217_contains_duplicate.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e219_contains_duplicate_2.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/easy/e219_contains_duplicate_2.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e21_merge_two_sorted_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e21_merge_two_sorted_list.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/easy/e21_merge_two_sorted_list.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e226_invert_binary_tree.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/easy/e226_invert_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/easy/e226_invert_binary_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e242_is_anagram.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_anagram` is never used [INFO] [stdout] --> src/easy/e242_is_anagram.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/easy/e572_subtree_of_another_tree.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e572_subtree_of_another_tree.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_subtree` and `is_identical` are never used [INFO] [stdout] --> src/easy/e572_subtree_of_another_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 21 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 22 | pub fn is_subtree( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn is_identical( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e704_binary_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/easy/e704_binary_search.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/easy/e724_find_pivot_index.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `pivot_index` is never used [INFO] [stdout] --> src/easy/e724_find_pivot_index.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn pivot_index(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hard/h207_course_schedule.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_finish` is never used [INFO] [stdout] --> src/hard/h207_course_schedule.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 13 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 21 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn insert(&mut self, word: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn search(&self, word: &str) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn starts_with(&self, prefix: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 62 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_words` and `dfs` are never used [INFO] [stdout] --> src/hard/h212_word_search_ii.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 64 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/hard/h297_serialize_binary_tree.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/hard/h297_serialize_binary_tree.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/hard/h297_serialize_binary_tree.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] 46 | fn deserialize(&self, data: String) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/hard/h42_trapping_rain_water.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap` is never used [INFO] [stdout] --> src/hard/h42_trapping_rain_water.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `search` are never used [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl TrieNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 8 | fn new() -> TrieNode { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn insert(&mut self, word: &str, index: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn search(&self, word: &str) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordFilter` is never constructed [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct WordFilter { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `f` are never used [INFO] [stdout] --> src/hard/h745_prefix_and_suffix_search.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 50 | impl WordFilter { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 51 | fn new(words: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn f(&self, pref: String, suff: String) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m1049_last_stone_weight_2.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `last_stone_weight_ii` is never used [INFO] [stdout] --> src/medium/m1049_last_stone_weight_2.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn last_stone_weight_ii(stones: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m105_construct_binary_tree_from_preorder_inorder.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/medium/m105_construct_binary_tree_from_preorder_inorder.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/medium/m105_construct_binary_tree_from_preorder_inorder.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m11_container_with_most_water.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_area` is never used [INFO] [stdout] --> src/medium/m11_container_with_most_water.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `New`, `find`, and `union` are never used [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 10 | fn New() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn find(&mut self, mut node_id: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn union(&mut self, node1_id: i32, node2_id: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_consecutive` is never used [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m1343_subarrays_size_k_average_greater_than_threshold.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_of_subarrays` is never used [INFO] [stdout] --> src/medium/m1343_subarrays_size_k_average_greater_than_threshold.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_of_subarrays(arr: Vec, k: i32, threshold: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m152_maximum_product_subarray.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_product` is never used [INFO] [stdout] --> src/medium/m152_maximum_product_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m153_search_in_rotated_array.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/medium/m153_search_in_rotated_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m15_three_sum.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum` is never used [INFO] [stdout] --> src/medium/m15_three_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m19_nth_element_from_end.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m19_nth_element_from_end.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_nth_from_end` is never used [INFO] [stdout] --> src/medium/m19_nth_element_from_end.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m200_number_of_islands.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_islands` is never used [INFO] [stdout] --> src/medium/m200_number_of_islands.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/medium/m208_implement_trie.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/medium/m208_implement_trie.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m208_implement_trie.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/medium/m208_implement_trie.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 20 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, and `search` are never used [INFO] [stdout] --> src/medium/m211_design_add_and_search_ds.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 18 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 19 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn add_word(&mut self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m2130_maximum_twin_sum_of_Linked_list.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | #[inline] [INFO] [stdout] 10 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m2130_maximum_twin_sum_of_Linked_list.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 15 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `pair_sum` is never used [INFO] [stdout] --> src/medium/m2130_maximum_twin_sum_of_Linked_list.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn pair_sum(head: Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m238_product_of_array_except_self.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_except_self` is never used [INFO] [stdout] --> src/medium/m238_product_of_array_except_self.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m287_find_the_duplicate_number.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_duplicate` is never used [INFO] [stdout] --> src/medium/m287_find_the_duplicate_number.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn find_duplicate(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumMatrix` is never constructed [INFO] [stdout] --> src/medium/m304_range_sum_query_2d_immutable.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct NumMatrix { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_region` are never used [INFO] [stdout] --> src/medium/m304_range_sum_query_2d_immutable.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl NumMatrix { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 11 | fn new(matrix: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn sum_region(&self, row1: i32, col1: i32, row2: i32, col2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `SegmentTree` is never constructed [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct SegmentTree { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `SegmentTree` has a derived impl for the trait `Default`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `build`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl SegmentTree { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | fn build(nums: &[i32], lower_range: i32, upper_range: i32) -> SegmentTree { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn update(&mut self, index: i32, value: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:94:12 [INFO] [stdout] | [INFO] [stdout] 94 | pub struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `update`, and `sum_range` are never used [INFO] [stdout] --> src/medium/m307_range_query_some_mutable.rs:99:12 [INFO] [stdout] | [INFO] [stdout] 98 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 99 | pub fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | pub fn update(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | pub fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m33_find_min_in_rotated_array.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/medium/m33_find_min_in_rotated_array.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m347_top_k_frequent_elements.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `top_k_frequent` is never used [INFO] [stdout] --> src/medium/m347_top_k_frequent_elements.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn top_k_frequent(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m3_longest_substring_without_repeating.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/medium/m3_longest_substring_without_repeating.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m416_partition_equal_subset_sum.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_partition` is never used [INFO] [stdout] --> src/medium/m416_partition_equal_subset_sum.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m424_longest_repeating_character_replacement.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `character_replacement` is never used [INFO] [stdout] --> src/medium/m424_longest_repeating_character_replacement.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn character_replacement(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m435_non_overlapping_intervals.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `erase_overlap_intervals` is never used [INFO] [stdout] --> src/medium/m435_non_overlapping_intervals.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn erase_overlap_intervals(intervals: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m474_ones_and_zeros.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_form` is never used [INFO] [stdout] --> src/medium/m474_ones_and_zeros.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | fn find_max_form(strs: Vec, m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m494_target_sum.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_target_sum_ways` is never used [INFO] [stdout] --> src/medium/m494_target_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_target_sum_ways(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m49_group_anagrams.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/medium/m49_group_anagrams.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m53_max_sub_array.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/medium/m53_max_sub_array.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m560_subarray_sum_equals_k.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `subarray_sum` is never used [INFO] [stdout] --> src/medium/m560_subarray_sum_equals_k.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn subarray_sum(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m56_merge_intervals.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/medium/m56_merge_intervals.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m647_palindromic_substring.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_substrings` is never used [INFO] [stdout] --> src/medium/m647_palindromic_substring.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn count_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `New`, `find`, and `union` are never used [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 7 | fn New() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn find(&mut self, mut node_id: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn union(&mut self, node1_id: i32, node2_id: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 47 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_redundant_connection` is never used [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn find_redundant_connection(edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `New`, `find`, and `union` are never used [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 9 | fn New() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn find(&mut self, mut node_id: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn union(&mut self, node1_id: i32, node2_id: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `accounts_merge` is never used [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | pub fn accounts_merge(accounts: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m918_maximum_sum_circular_subarray.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_subarray_sum_circular` is never used [INFO] [stdout] --> src/medium/m918_maximum_sum_circular_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_subarray_sum_circular(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/medium/m978_longest_turbulent_subarray.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_turbulence_size` is never used [INFO] [stdout] --> src/medium/m978_longest_turbulent_subarray.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 2 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 3 | pub fn max_turbulence_size(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/medium/m98_is_valid_binary_tree.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/medium/m98_is_valid_binary_tree.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 21 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_bst` is never used [INFO] [stdout] --> src/medium/m98_is_valid_binary_tree.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 22 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 23 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: module `m2130_maximum_twin_sum_of_Linked_list` should have a snake case name [INFO] [stdout] --> src/medium/mod.rs:15:9 [INFO] [stdout] | [INFO] [stdout] 15 | pub mod m2130_maximum_twin_sum_of_Linked_list; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `m2130_maximum_twin_sum_of_linked_list` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `New` should have a snake case name [INFO] [stdout] --> src/medium/m128_longest_consecutive_sequence.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn New() -> Self { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `new` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `New` should have a snake case name [INFO] [stdout] --> src/medium/m684_redundant_connection.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | fn New() -> Self { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `new` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `New` should have a snake case name [INFO] [stdout] --> src/medium/m721_accounts_merge.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn New() -> Self { [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `new` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 145 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.21s [INFO] running `Command { std: "docker" "inspect" "3700856402ea85c3cadf2f868e336a2e35d2e242fe5c0cce3885f0c7c23ef834", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3700856402ea85c3cadf2f868e336a2e35d2e242fe5c0cce3885f0c7c23ef834", kill_on_drop: false }` [INFO] [stdout] 3700856402ea85c3cadf2f868e336a2e35d2e242fe5c0cce3885f0c7c23ef834