[INFO] cloning repository https://github.com/jackfiled/leetcode-rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/jackfiled/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 8bc2e0d3478637a90e685cc8c8b7a3656c3d02f3 [INFO] checking jackfiled/leetcode-rust against master#385fa9d845dd326c6bbfd58c22244215e431948a for absurd-question-mark-desugar [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust" "/workspace/builds/worker-5-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/jackfiled/leetcode-rust on toolchain 385fa9d845dd326c6bbfd58c22244215e431948a [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+385fa9d845dd326c6bbfd58c22244215e431948a" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-5-tc1/source/.cargo/config [INFO] started tweaking git repo https://github.com/jackfiled/leetcode-rust [INFO] finished tweaking git repo https://github.com/jackfiled/leetcode-rust [INFO] tweaked toml for git repo https://github.com/jackfiled/leetcode-rust written to /workspace/builds/worker-5-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/jackfiled/leetcode-rust already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+385fa9d845dd326c6bbfd58c22244215e431948a" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded openssl-sys v0.9.97 [INFO] [stderr] Downloaded openssl v0.10.61 [INFO] [stderr] Downloaded unicase v2.5.1 [INFO] [stderr] Downloaded futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded futures-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded pkg-config v0.3.16 [INFO] [stderr] Downloaded dtoa v0.4.4 [INFO] [stderr] Downloaded futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded futures-core-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded encoding_rs v0.8.20 [INFO] [stderr] Downloaded futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded iovec v0.1.3 [INFO] [stderr] Downloaded surf v1.0.3 [INFO] [stderr] Downloaded curl v0.4.25 [INFO] [stderr] Downloaded libnghttp2-sys v0.1.2 [INFO] [stderr] Downloaded sluice v0.4.2 [INFO] [stderr] Downloaded isahc v0.7.6 [INFO] [stderr] Downloaded curl-sys v0.4.25 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+385fa9d845dd326c6bbfd58c22244215e431948a" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] a7f98a28a762abdba59d3edbdaaf2f025ebb61af40f359d2fe9c47c0b6b75da8 [INFO] running `Command { std: "docker" "start" "-a" "a7f98a28a762abdba59d3edbdaaf2f025ebb61af40f359d2fe9c47c0b6b75da8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "a7f98a28a762abdba59d3edbdaaf2f025ebb61af40f359d2fe9c47c0b6b75da8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a7f98a28a762abdba59d3edbdaaf2f025ebb61af40f359d2fe9c47c0b6b75da8", kill_on_drop: false }` [INFO] [stdout] a7f98a28a762abdba59d3edbdaaf2f025ebb61af40f359d2fe9c47c0b6b75da8 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+385fa9d845dd326c6bbfd58c22244215e431948a" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 3f48f7cca77f7adae91af55cb2a01bcd3076b0df075b425d6653ca663fbcfe0b [INFO] running `Command { std: "docker" "start" "-a" "3f48f7cca77f7adae91af55cb2a01bcd3076b0df075b425d6653ca663fbcfe0b", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.151 [INFO] [stderr] Compiling pkg-config v0.3.16 [INFO] [stderr] Compiling unicode-ident v1.0.1 [INFO] [stderr] Compiling memchr v2.2.1 [INFO] [stderr] Checking pin-project-lite v0.2.9 [INFO] [stderr] Compiling log v0.4.8 [INFO] [stderr] Checking slab v0.4.2 [INFO] [stderr] Compiling tokio v1.29.1 [INFO] [stderr] Checking matches v0.1.8 [INFO] [stderr] Compiling futures-util v0.3.29 [INFO] [stderr] Compiling version_check v0.1.5 [INFO] [stderr] Checking openssl-probe v0.1.2 [INFO] [stderr] Compiling serde v1.0.101 [INFO] [stderr] Checking futures-core-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures v0.1.29 [INFO] [stderr] Checking itoa v0.4.4 [INFO] [stderr] Compiling ryu v1.0.0 [INFO] [stderr] Checking futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling openssl v0.10.61 [INFO] [stderr] Checking form_urlencoded v1.0.1 [INFO] [stderr] Compiling proc-macro2 v1.0.70 [INFO] [stderr] Checking tracing v0.1.40 [INFO] [stderr] Checking unicode-bidi v0.3.4 [INFO] [stderr] Checking unicode-normalization v0.1.8 [INFO] [stderr] Checking futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling unicase v2.5.1 [INFO] [stderr] Checking http v0.2.11 [INFO] [stderr] Compiling curl v0.4.25 [INFO] [stderr] Checking crossbeam-utils v0.6.6 [INFO] [stderr] Compiling syn v1.0.96 [INFO] [stderr] Compiling isahc v0.7.6 [INFO] [stderr] Compiling encoding_rs v0.8.20 [INFO] [stderr] Checking crossbeam-channel v0.3.9 [INFO] [stderr] Checking sluice v0.4.2 [INFO] [stderr] Checking dtoa v0.4.4 [INFO] [stderr] Checking thread_local v1.1.4 [INFO] [stderr] Checking base64 v0.21.5 [INFO] [stderr] Compiling quote v1.0.33 [INFO] [stderr] Checking regex-syntax v0.6.14 [INFO] [stderr] Compiling syn v2.0.40 [INFO] [stderr] Checking aho-corasick v0.7.6 [INFO] [stderr] Compiling mime_guess v2.0.1 [INFO] [stderr] Checking http-body v0.4.6 [INFO] [stderr] Checking idna v0.2.0 [INFO] [stderr] Checking num_cpus v1.10.1 [INFO] [stderr] Checking iovec v0.1.3 [INFO] [stderr] Checking socket2 v0.4.10 [INFO] [stderr] Checking mio v0.8.10 [INFO] [stderr] Checking socket2 v0.3.19 [INFO] [stderr] Checking rand_os v0.1.3 [INFO] [stderr] Checking bytes v0.4.12 [INFO] [stderr] Compiling cc v1.0.83 [INFO] [stderr] Checking rand v0.6.5 [INFO] [stderr] Checking tokio-io v0.1.12 [INFO] [stderr] Checking http v0.1.21 [INFO] [stderr] Checking url v2.3.0 [INFO] [stderr] Checking futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling openssl-sys v0.9.97 [INFO] [stderr] Compiling libz-sys v1.0.25 [INFO] [stderr] Compiling libnghttp2-sys v0.1.2 [INFO] [stderr] Compiling curl-sys v0.4.25 [INFO] [stderr] Checking regex v1.3.4 [INFO] [stderr] Compiling native-tls v0.2.11 [INFO] [stderr] Compiling serde_derive v1.0.101 [INFO] [stderr] Checking futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Checking serde_json v1.0.41 [INFO] [stderr] Checking serde_urlencoded v0.7.1 [INFO] [stderr] Checking serde_urlencoded v0.6.1 [INFO] [stderr] Checking futures-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling tokio-macros v2.1.0 [INFO] [stderr] Compiling futures-macro v0.3.29 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Checking surf v1.0.3 [INFO] [stderr] Checking tokio-util v0.7.8 [INFO] [stderr] Checking tokio-native-tls v0.3.1 [INFO] [stderr] Checking futures-executor v0.3.29 [INFO] [stderr] Checking futures v0.3.29 [INFO] [stderr] Checking h2 v0.3.22 [INFO] [stderr] Checking hyper v0.14.27 [INFO] [stderr] Checking hyper-tls v0.5.0 [INFO] [stderr] Checking reqwest v0.11.22 [INFO] [stderr] Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p0002_add_two_numbers.rs:32:42 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2641_cousins_in_binary_tree_ii.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p144_binary_tree_preorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p145_binary_tree_postorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p102_binary_tree_level_order_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::middleware::logger::new` [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::middleware::logger::new; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:8:35 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:25 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | 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/problem/p2085_count_common_words_with_one_occurrence.rs:81:9 [INFO] [stdout] | [INFO] [stdout] 81 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:31:9 [INFO] [stdout] | [INFO] [stdout] 31 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:33:9 [INFO] [stdout] | [INFO] [stdout] 33 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:57:9 [INFO] [stdout] | [INFO] [stdout] 57 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::middleware::logger::new` [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::middleware::logger::new; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:38:23 [INFO] [stdout] | [INFO] [stdout] 38 | } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] | ^ ^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] 38 + } else if p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:38:23 [INFO] [stdout] | [INFO] [stdout] 38 | } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] | ^ ^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] 38 + } else if p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:75:9 [INFO] [stdout] | [INFO] [stdout] 75 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::url::UrlQuery` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::url::UrlQuery; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:8:35 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:79:9 [INFO] [stdout] | [INFO] [stdout] 79 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use tokio::time::error::Elapsed; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:8:25 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:85:10 [INFO] [stdout] | [INFO] [stdout] 85 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:96:9 [INFO] [stdout] | [INFO] [stdout] 96 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:59:20 [INFO] [stdout] | [INFO] [stdout] 59 | if (primes[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 59 - if (primes[i]) { [INFO] [stdout] 59 + if primes[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/week_385/problem2.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:30:33 [INFO] [stdout] | [INFO] [stdout] 30 | let x = (i + d.0 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 30 - let x = (i + d.0 * step); [INFO] [stdout] 30 + let x = i + d.0 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:31:33 [INFO] [stdout] | [INFO] [stdout] 31 | let y = (j + d.1 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 31 - let y = (j + d.1 * step); [INFO] [stdout] 31 + let y = j + d.1 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::url::UrlQuery` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::url::UrlQuery; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:8:35 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p938_range_sum_of_bst.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use tokio::time::error::Elapsed; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:8:25 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:85:10 [INFO] [stdout] | [INFO] [stdout] 85 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:59:20 [INFO] [stdout] | [INFO] [stdout] 59 | if (primes[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 59 - if (primes[i]) { [INFO] [stdout] 59 + if primes[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:30:33 [INFO] [stdout] | [INFO] [stdout] 30 | let x = (i + d.0 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 30 - let x = (i + d.0 * step); [INFO] [stdout] 30 + let x = i + d.0 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:31:33 [INFO] [stdout] | [INFO] [stdout] 31 | let y = (j + d.1 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 31 - let y = (j + d.1 * step); [INFO] [stdout] 31 + let y = j + d.1 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/week_385/problem3.rs:78:9 [INFO] [stdout] | [INFO] [stdout] 78 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:93:25 [INFO] [stdout] | [INFO] [stdout] 93 | let mut array: &mut Vec = &mut result[pos]; [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: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0001_two_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/problem/p0001_two_sum.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0009_palindrome_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/problem/p0009_palindrome_number.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0020_valid_parentheses.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/problem/p0020_valid_parentheses.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2697_lexicographically_smallest_palindrome.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `make_smallest_palindrome` is never used [INFO] [stdout] --> src/problem/p2697_lexicographically_smallest_palindrome.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn make_smallest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0002_add_two_numbers.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_two_numbers` is never used [INFO] [stdout] --> src/problem/p0002_add_two_numbers.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn add_two_numbers(l1: Option>, l2: Option>) [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0003_longest_substring_without_repeating_characters.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/problem/p0003_longest_substring_without_repeating_characters.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | 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/problem/p0162_find_peak_element.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_peak_element` is never used [INFO] [stdout] --> src/problem/p0162_find_peak_element.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2828_check_if_a_string_is_an_acronym_of_words.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_acronym` is never used [INFO] [stdout] --> src/problem/p2828_check_if_a_string_is_an_acronym_of_words.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn is_acronym(words: Vec, s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0052_n_queens_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `total_n_queens` is never used [INFO] [stdout] --> src/problem/p0052_n_queens_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn total_n_queens(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0912_sort_an_array.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sort_array` and `merge_sort` are never used [INFO] [stdout] --> src/problem/p0912_sort_an_array.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 34 | pub fn sort_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn merge_sort(nums: &mut Vec, temp: &mut Vec, left: usize, right: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1276_number_of_burgers_with_no_waste_of_ingredients.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_of_burgers` is never used [INFO] [stdout] --> src/problem/p1276_number_of_burgers_with_no_waste_of_ingredients.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn num_of_burgers(tomato_slices: i32, cheese_slices: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0006_zigzag_conversion.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert` is never used [INFO] [stdout] --> src/problem/p0006_zigzag_conversion.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0007_reverse_integer.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse` is never used [INFO] [stdout] --> src/problem/p0007_reverse_integer.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0004_median_of_two_sorted_arrays.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_median_sorted_arrays` and `get_k_th` are never used [INFO] [stdout] --> src/problem/p0004_median_of_two_sorted_arrays.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 40 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn get_k_th(nums1: &Vec, start1: i32, end1: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0743_network_delay_time.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `network_delay_time` is never used [INFO] [stdout] --> src/problem/p0743_network_delay_time.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn network_delay_time(times: Vec>, n: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_boomerangs` is never used [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn number_of_boomerangs(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_words` is never used [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn count_words(words1: Vec, words2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2182_construct_string_with_repeat_limit.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `repeat_limited_string` is never used [INFO] [stdout] --> src/problem/p2182_construct_string_with_repeat_limit.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn repeat_limited_string(s: String, repeat_limit: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DigitDP` is never constructed [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct DigitDP { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `dp` are never used [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl DigitDP { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 19 | pub fn new(num1: Vec, num2: Vec, min_sum: u32, max_sum: u32) [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn dp(&mut self, sum: u32, l_limit: bool, r_limit: bool, index: usize) -> i32 { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count` and `str_to_vec` are never used [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 89 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 90 | pub fn count(num1: String, num2: String, min_sum: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn str_to_vec(num : String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_number_of_string_pairs` is never used [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_number_of_string_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2171_removing_minimum_number_of_magic_beans.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_removal` is never used [INFO] [stdout] --> src/problem/p2171_removing_minimum_number_of_magic_beans.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn minimum_removal(beans: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_time` is never used [INFO] [stdout] --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn minimum_time(nums1: Vec, nums2: Vec, x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `split_words_by_separator` is never used [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn split_words_by_separator(words: Vec, separator: char) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p410_split_array_largest_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check` and `split_array` are never used [INFO] [stdout] --> src/problem/p410_split_array_largest_sum.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn check(nums: &Vec, value: i64, m: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn split_array(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p670_maximum_swap.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_swap` is never used [INFO] [stdout] --> src/problem/p670_maximum_swap.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_swap(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2765_longest_alternating_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `alternating_subarray` is never used [INFO] [stdout] --> src/problem/p2765_longest_alternating_subarray.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn alternating_subarray(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2865_beautiful_towers_i.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_sum_of_heights` is never used [INFO] [stdout] --> src/problem/p2865_beautiful_towers_i.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_sum_of_heights(max_heights: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2859_sum_of_values_at_indices_with_k_set_bits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sum_indices_with_k_set_bits` and `num_to_binary` are never used [INFO] [stdout] --> src/problem/p2859_sum_of_values_at_indices_with_k_set_bits.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn sum_indices_with_k_set_bits(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | fn num_to_binary(num: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, and `merge` are never used [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 16 | fn new(n: usize) -> UnionFind { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn find(&mut self, x: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn merge(&mut self, parent: usize, child: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Tree` is never constructed [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `tarjan` are never used [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl Tree { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 56 | fn new(n: i32, edges: Vec>, queries: &Vec>) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn tarjan(&mut self, node : usize, parent : usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations_queries` is never used [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:128:12 [INFO] [stdout] | [INFO] [stdout] 127 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 128 | pub fn min_operations_queries(n: i32, edges: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2861_maximum_number_of_alloys.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check` and `max_number_of_alloys` are never used [INFO] [stdout] --> src/problem/p2861_maximum_number_of_alloys.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn check(n: usize, count: i32, budget: i32, composition: &Vec, stock: &Vec, cost: &Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn max_number_of_alloys(n: i32, k: i32, budget: i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p365_water_and_jug_problem.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `can_measure_water` and `gcd` are never used [INFO] [stdout] --> src/problem/p365_water_and_jug_problem.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn can_measure_water(jug1_capacity: i32, jug2_capacity: i32, target_capacity: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p514_freedom_trail.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_rotate_steps` is never used [INFO] [stdout] --> src/problem/p514_freedom_trail.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn find_rotate_steps(ring: String, key: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2808_minimum_seconds_to_equalize_a_circular_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_seconds` is never used [INFO] [stdout] --> src/problem/p2808_minimum_seconds_to_equalize_a_circular_array.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn minimum_seconds(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2670_find_the_distinct_difference_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_difference_array` is never used [INFO] [stdout] --> src/problem/p2670_find_the_distinct_difference_array.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn distinct_difference_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/lcp24_nums_game.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `nums_game` is never used [INFO] [stdout] --> src/problem/lcp24_nums_game.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn nums_game(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1686_stone_game_vi.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Stone` is never constructed [INFO] [stdout] --> src/problem/p1686_stone_game_vi.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Stone { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `stone_game_vi` is never used [INFO] [stdout] --> src/problem/p1686_stone_game_vi.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn stone_game_vi(alice_values: Vec, bob_values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1690_stone_game_vii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `stone_game_vii` is never used [INFO] [stdout] --> src/problem/p1690_stone_game_vii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn stone_game_vii(stones: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p292_nim_game.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_win_nim` is never used [INFO] [stdout] --> src/problem/p292_nim_game.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn can_win_nim(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1696_jump_game_vi.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_result` is never used [INFO] [stdout] --> src/problem/p1696_jump_game_vi.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn max_result(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/lcp30_magic_tower.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `magic_tower` is never used [INFO] [stdout] --> src/problem/lcp30_magic_tower.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn magic_tower(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2641_cousins_in_binary_tree_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `replace_value_in_tree` is never used [INFO] [stdout] --> src/problem/p2641_cousins_in_binary_tree_ii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn replace_value_in_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Tree` is never constructed [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `dfs` are never used [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 41 | impl Tree { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 42 | fn new(root: Rc>, x: i32, y: i32) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn dfs(&mut self, node: &Rc>, height: usize, parent: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_cousins` is never used [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:86:12 [INFO] [stdout] | [INFO] [stdout] 85 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 86 | pub fn is_cousins(root: Option>>, x: i32, y: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `inorder_traversal` is never used [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p144_binary_tree_preorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `preorder_traversal` is never used [INFO] [stdout] --> src/problem/p144_binary_tree_preorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p145_binary_tree_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `postorder_traversal` is never used [INFO] [stdout] --> src/problem/p145_binary_tree_postorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DFS` is never constructed [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct DFS { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `search` are never used [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 42 | impl DFS { [INFO] [stdout] | -------- associated items in this implementation [INFO] [stdout] 43 | fn new() -> DFS { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn search(&mut self, node: &Rc>, x: i32, y: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `vertical_traversal` is never used [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 66 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 67 | pub fn vertical_traversal(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p102_binary_tree_level_order_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/problem/p102_binary_tree_level_order_traversal.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order_bottom` is never used [INFO] [stdout] --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `zigzag_level_order` is never used [INFO] [stdout] --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | 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/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_largest_level_sum` is never used [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn kth_largest_level_sum(root: Option>>, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `closest_nodes` is never used [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn closest_nodes(root: Option>>, queries: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p938_range_sum_of_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `range_sum_bst` is never used [INFO] [stdout] --> src/problem/p938_range_sum_of_bst.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn range_sum_bst(root: Option>>, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `construct_from_pre_post` is never used [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn construct_from_pre_post( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs` and `count_paths` are never used [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn dfs(graph: &Vec>, primes: &Vec, seen: &mut Vec, [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn count_paths(n: i32, edges: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2673_make_costs_of_paths_equal_in_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_increments` is never used [INFO] [stdout] --> src/problem/p2673_make_costs_of_paths_equal_in_a_binary_tree.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_increments(n: i32, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2581_count_number_of_possible_root_nodes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `root_count`, `hash`, `dfs`, and `tree_dp` are never used [INFO] [stdout] --> src/problem/p2581_count_number_of_possible_root_nodes.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 14 | pub fn root_count(edges: Vec>, guesses: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn hash(x: usize, y: usize) -> i64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | fn dfs(graph: &Vec>, guess_set: &HashSet, now: usize, pre: usize, count: &mut i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn tree_dp(graph: &Vec>, guess_set: &HashSet, k: &i32, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2369_check_if_there_is_a_valid_partition_for_the_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `valid_partition` is never used [INFO] [stdout] --> src/problem/p2369_check_if_there_is_a_valid_partition_for_the_array.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn valid_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem1.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_prefix_suffix_pairs` and `is_prefix_and_suffix` are never used [INFO] [stdout] --> src/week_385/problem1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_prefix_suffix_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_prefix_and_suffix(str1: &Vec, str2: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem2.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_common_prefix` is never used [INFO] [stdout] --> src/week_385/problem2.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn longest_common_prefix(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem3.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `most_frequent_prime` and `is_prime` are never used [INFO] [stdout] --> src/week_385/problem3.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn most_frequent_prime(mat: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn is_prime(num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:93:25 [INFO] [stdout] | [INFO] [stdout] 93 | let mut array: &mut Vec = &mut result[pos]; [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: 175 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_boomerangs` is never used [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn number_of_boomerangs(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_words` is never used [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn count_words(words1: Vec, words2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_number_of_string_pairs` is never used [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_number_of_string_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `split_words_by_separator` is never used [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn split_words_by_separator(words: Vec, separator: char) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `length` is never read [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:46:5 [INFO] [stdout] | [INFO] [stdout] 42 | struct Tree { [INFO] [stdout] | ---- field in this struct [INFO] [stdout] ... [INFO] [stdout] 46 | length: usize, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `root` is never read [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:32:5 [INFO] [stdout] | [INFO] [stdout] 31 | struct Tree { [INFO] [stdout] | ---- field in this struct [INFO] [stdout] 32 | root: Rc>, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `inorder_traversal` is never used [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_largest_level_sum` is never used [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn kth_largest_level_sum(root: Option>>, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `closest_nodes` is never used [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn closest_nodes(root: Option>>, queries: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `construct_from_pre_post` is never used [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn construct_from_pre_post( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem1.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_prefix_suffix_pairs` and `is_prefix_and_suffix` are never used [INFO] [stdout] --> src/week_385/problem1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_prefix_suffix_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_prefix_and_suffix(str1: &Vec, str2: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem2.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_common_prefix` is never used [INFO] [stdout] --> src/week_385/problem2.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn longest_common_prefix(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 60 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `content` and `return_type` are never read [INFO] [stdout] --> src/fetch_problem.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Problem { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] ... [INFO] [stdout] 19 | pub content: String, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub return_type: String [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `content` and `return_type` are never read [INFO] [stdout] --> src/fetch_problem.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Problem { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] ... [INFO] [stdout] 19 | pub content: String, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub return_type: String [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 28.86s [INFO] running `Command { std: "docker" "inspect" "3f48f7cca77f7adae91af55cb2a01bcd3076b0df075b425d6653ca663fbcfe0b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3f48f7cca77f7adae91af55cb2a01bcd3076b0df075b425d6653ca663fbcfe0b", kill_on_drop: false }` [INFO] [stdout] 3f48f7cca77f7adae91af55cb2a01bcd3076b0df075b425d6653ca663fbcfe0b [INFO] checking jackfiled/leetcode-rust against try#645bb72776a6a56a1a8f52631a44bd082b2ba509 for absurd-question-mark-desugar [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust" "/workspace/builds/worker-5-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/jackfiled/leetcode-rust on toolchain 645bb72776a6a56a1a8f52631a44bd082b2ba509 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+645bb72776a6a56a1a8f52631a44bd082b2ba509" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-5-tc2/source/.cargo/config [INFO] started tweaking git repo https://github.com/jackfiled/leetcode-rust [INFO] finished tweaking git repo https://github.com/jackfiled/leetcode-rust [INFO] tweaked toml for git repo https://github.com/jackfiled/leetcode-rust written to /workspace/builds/worker-5-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/jackfiled/leetcode-rust already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+645bb72776a6a56a1a8f52631a44bd082b2ba509" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+645bb72776a6a56a1a8f52631a44bd082b2ba509" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] e86e8ef08abe6a3bcf3787638142b94316f4c1c749cbfbfca3baa85f88adaab1 [INFO] running `Command { std: "docker" "start" "-a" "e86e8ef08abe6a3bcf3787638142b94316f4c1c749cbfbfca3baa85f88adaab1", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "e86e8ef08abe6a3bcf3787638142b94316f4c1c749cbfbfca3baa85f88adaab1", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e86e8ef08abe6a3bcf3787638142b94316f4c1c749cbfbfca3baa85f88adaab1", kill_on_drop: false }` [INFO] [stdout] e86e8ef08abe6a3bcf3787638142b94316f4c1c749cbfbfca3baa85f88adaab1 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+645bb72776a6a56a1a8f52631a44bd082b2ba509" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] a32bf7d4c70bc0ade6dca63832e5159c38257248773e218856f7b15be82472e9 [INFO] running `Command { std: "docker" "start" "-a" "a32bf7d4c70bc0ade6dca63832e5159c38257248773e218856f7b15be82472e9", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.151 [INFO] [stderr] Compiling pkg-config v0.3.16 [INFO] [stderr] Compiling unicode-ident v1.0.1 [INFO] [stderr] Compiling memchr v2.2.1 [INFO] [stderr] Compiling log v0.4.8 [INFO] [stderr] Checking slab v0.4.2 [INFO] [stderr] Checking pin-project-lite v0.2.9 [INFO] [stderr] Compiling tokio v1.29.1 [INFO] [stderr] Checking matches v0.1.8 [INFO] [stderr] Compiling futures-util v0.3.29 [INFO] [stderr] Compiling version_check v0.1.5 [INFO] [stderr] Compiling serde v1.0.101 [INFO] [stderr] Checking futures-core-preview v0.3.0-alpha.19 [INFO] [stderr] Checking openssl-probe v0.1.2 [INFO] [stderr] Checking futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling openssl v0.10.61 [INFO] [stderr] Compiling proc-macro2 v1.0.70 [INFO] [stderr] Checking futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling ryu v1.0.0 [INFO] [stderr] Checking futures v0.1.29 [INFO] [stderr] Checking itoa v0.4.4 [INFO] [stderr] Checking form_urlencoded v1.0.1 [INFO] [stderr] Checking futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Checking unicode-bidi v0.3.4 [INFO] [stderr] Checking tracing v0.1.40 [INFO] [stderr] Checking unicode-normalization v0.1.8 [INFO] [stderr] Checking http v0.2.11 [INFO] [stderr] Compiling curl v0.4.25 [INFO] [stderr] Checking crossbeam-utils v0.6.6 [INFO] [stderr] Compiling unicase v2.5.1 [INFO] [stderr] Compiling syn v1.0.96 [INFO] [stderr] Compiling encoding_rs v0.8.20 [INFO] [stderr] Compiling isahc v0.7.6 [INFO] [stderr] Checking sluice v0.4.2 [INFO] [stderr] Compiling quote v1.0.33 [INFO] [stderr] Checking crossbeam-channel v0.3.9 [INFO] [stderr] Checking dtoa v0.4.4 [INFO] [stderr] Checking aho-corasick v0.7.6 [INFO] [stderr] Checking thread_local v1.1.4 [INFO] [stderr] Compiling syn v2.0.40 [INFO] [stderr] Checking regex-syntax v0.6.14 [INFO] [stderr] Checking http-body v0.4.6 [INFO] [stderr] Compiling mime_guess v2.0.1 [INFO] [stderr] Checking base64 v0.21.5 [INFO] [stderr] Checking num_cpus v1.10.1 [INFO] [stderr] Checking iovec v0.1.3 [INFO] [stderr] Checking socket2 v0.4.10 [INFO] [stderr] Checking mio v0.8.10 [INFO] [stderr] Checking socket2 v0.3.19 [INFO] [stderr] Checking rand_os v0.1.3 [INFO] [stderr] Checking idna v0.2.0 [INFO] [stderr] Checking bytes v0.4.12 [INFO] [stderr] Compiling cc v1.0.83 [INFO] [stderr] Checking rand v0.6.5 [INFO] [stderr] Checking url v2.3.0 [INFO] [stderr] Checking tokio-io v0.1.12 [INFO] [stderr] Checking http v0.1.21 [INFO] [stderr] Checking futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling openssl-sys v0.9.97 [INFO] [stderr] Compiling libz-sys v1.0.25 [INFO] [stderr] Compiling libnghttp2-sys v0.1.2 [INFO] [stderr] Compiling curl-sys v0.4.25 [INFO] [stderr] Checking regex v1.3.4 [INFO] [stderr] Checking serde_json v1.0.41 [INFO] [stderr] Checking serde_urlencoded v0.6.1 [INFO] [stderr] Checking serde_urlencoded v0.7.1 [INFO] [stderr] Compiling native-tls v0.2.11 [INFO] [stderr] Compiling serde_derive v1.0.101 [INFO] [stderr] Checking futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling futures-macro v0.3.29 [INFO] [stderr] Compiling tokio-macros v2.1.0 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Checking surf v1.0.3 [INFO] [stderr] Checking futures-executor v0.3.29 [INFO] [stderr] Checking tokio-util v0.7.8 [INFO] [stderr] Checking tokio-native-tls v0.3.1 [INFO] [stderr] Checking futures v0.3.29 [INFO] [stderr] Checking h2 v0.3.22 [INFO] [stderr] Checking hyper v0.14.27 [INFO] [stderr] Checking hyper-tls v0.5.0 [INFO] [stderr] Checking reqwest v0.11.22 [INFO] [stderr] Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p0002_add_two_numbers.rs:32:42 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2641_cousins_in_binary_tree_ii.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p144_binary_tree_preorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p145_binary_tree_postorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p102_binary_tree_level_order_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::middleware::logger::new` [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::middleware::logger::new; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:8:35 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:25 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:38:23 [INFO] [stdout] | [INFO] [stdout] 38 | } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] | ^ ^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] 38 + } else if p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::url::UrlQuery` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::url::UrlQuery; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:8:35 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p938_range_sum_of_bst.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use tokio::time::error::Elapsed; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:8:25 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:85:10 [INFO] [stdout] | [INFO] [stdout] 85 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:59:20 [INFO] [stdout] | [INFO] [stdout] 59 | if (primes[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 59 - if (primes[i]) { [INFO] [stdout] 59 + if primes[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:30:33 [INFO] [stdout] | [INFO] [stdout] 30 | let x = (i + d.0 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 30 - let x = (i + d.0 * step); [INFO] [stdout] 30 + let x = i + d.0 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:31:33 [INFO] [stdout] | [INFO] [stdout] 31 | let y = (j + d.1 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 31 - let y = (j + d.1 * step); [INFO] [stdout] 31 + let y = j + d.1 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/week_385/problem3.rs:78:9 [INFO] [stdout] | [INFO] [stdout] 78 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | 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/problem/p2085_count_common_words_with_one_occurrence.rs:81:9 [INFO] [stdout] | [INFO] [stdout] 81 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:6:42 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:31:9 [INFO] [stdout] | [INFO] [stdout] 31 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:33:9 [INFO] [stdout] | [INFO] [stdout] 33 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:57:9 [INFO] [stdout] | [INFO] [stdout] 57 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::middleware::logger::new` [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::middleware::logger::new; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:38:23 [INFO] [stdout] | [INFO] [stdout] 38 | } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] | ^ ^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - } else if (p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val ) { [INFO] [stdout] 38 + } else if p.borrow().val > ancestor.borrow().val && q.borrow().val > ancestor.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:6:35 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:75:9 [INFO] [stdout] | [INFO] [stdout] 75 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `surf::url::UrlQuery` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use surf::url::UrlQuery; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:8:35 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{TreeNode, to_tree}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:79:9 [INFO] [stdout] | [INFO] [stdout] 79 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | use tokio::time::error::Elapsed; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:8:25 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:85:10 [INFO] [stdout] | [INFO] [stdout] 85 | }; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:96:9 [INFO] [stdout] | [INFO] [stdout] 96 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:59:20 [INFO] [stdout] | [INFO] [stdout] 59 | if (primes[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 59 - if (primes[i]) { [INFO] [stdout] 59 + if primes[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/week_385/problem2.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:30:33 [INFO] [stdout] | [INFO] [stdout] 30 | let x = (i + d.0 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 30 - let x = (i + d.0 * step); [INFO] [stdout] 30 + let x = i + d.0 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/week_385/problem3.rs:31:33 [INFO] [stdout] | [INFO] [stdout] 31 | let y = (j + d.1 * step); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 31 - let y = (j + d.1 * step); [INFO] [stdout] 31 + let y = j + d.1 * step; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:93:25 [INFO] [stdout] | [INFO] [stdout] 93 | let mut array: &mut Vec = &mut result[pos]; [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: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0001_two_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/problem/p0001_two_sum.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0009_palindrome_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/problem/p0009_palindrome_number.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0020_valid_parentheses.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/problem/p0020_valid_parentheses.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2697_lexicographically_smallest_palindrome.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `make_smallest_palindrome` is never used [INFO] [stdout] --> src/problem/p2697_lexicographically_smallest_palindrome.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn make_smallest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0002_add_two_numbers.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_two_numbers` is never used [INFO] [stdout] --> src/problem/p0002_add_two_numbers.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn add_two_numbers(l1: Option>, l2: Option>) [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0003_longest_substring_without_repeating_characters.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/problem/p0003_longest_substring_without_repeating_characters.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | 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/problem/p0162_find_peak_element.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_peak_element` is never used [INFO] [stdout] --> src/problem/p0162_find_peak_element.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2828_check_if_a_string_is_an_acronym_of_words.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_acronym` is never used [INFO] [stdout] --> src/problem/p2828_check_if_a_string_is_an_acronym_of_words.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn is_acronym(words: Vec, s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0052_n_queens_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `total_n_queens` is never used [INFO] [stdout] --> src/problem/p0052_n_queens_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn total_n_queens(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0912_sort_an_array.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sort_array` and `merge_sort` are never used [INFO] [stdout] --> src/problem/p0912_sort_an_array.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 34 | pub fn sort_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn merge_sort(nums: &mut Vec, temp: &mut Vec, left: usize, right: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1276_number_of_burgers_with_no_waste_of_ingredients.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_of_burgers` is never used [INFO] [stdout] --> src/problem/p1276_number_of_burgers_with_no_waste_of_ingredients.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn num_of_burgers(tomato_slices: i32, cheese_slices: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0006_zigzag_conversion.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert` is never used [INFO] [stdout] --> src/problem/p0006_zigzag_conversion.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0007_reverse_integer.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse` is never used [INFO] [stdout] --> src/problem/p0007_reverse_integer.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0004_median_of_two_sorted_arrays.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_median_sorted_arrays` and `get_k_th` are never used [INFO] [stdout] --> src/problem/p0004_median_of_two_sorted_arrays.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 40 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn get_k_th(nums1: &Vec, start1: i32, end1: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0743_network_delay_time.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `network_delay_time` is never used [INFO] [stdout] --> src/problem/p0743_network_delay_time.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn network_delay_time(times: Vec>, n: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_boomerangs` is never used [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn number_of_boomerangs(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_words` is never used [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn count_words(words1: Vec, words2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2182_construct_string_with_repeat_limit.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `repeat_limited_string` is never used [INFO] [stdout] --> src/problem/p2182_construct_string_with_repeat_limit.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn repeat_limited_string(s: String, repeat_limit: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DigitDP` is never constructed [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct DigitDP { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `dp` are never used [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl DigitDP { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 19 | pub fn new(num1: Vec, num2: Vec, min_sum: u32, max_sum: u32) [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn dp(&mut self, sum: u32, l_limit: bool, r_limit: bool, index: usize) -> i32 { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count` and `str_to_vec` are never used [INFO] [stdout] --> src/problem/p2719_count_of_integers.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 89 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 90 | pub fn count(num1: String, num2: String, min_sum: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn str_to_vec(num : String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_number_of_string_pairs` is never used [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_number_of_string_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2171_removing_minimum_number_of_magic_beans.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_removal` is never used [INFO] [stdout] --> src/problem/p2171_removing_minimum_number_of_magic_beans.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn minimum_removal(beans: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Pair` is never constructed [INFO] [stdout] --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_time` is never used [INFO] [stdout] --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 16 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 17 | pub fn minimum_time(nums1: Vec, nums2: Vec, x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `split_words_by_separator` is never used [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn split_words_by_separator(words: Vec, separator: char) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p410_split_array_largest_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check` and `split_array` are never used [INFO] [stdout] --> src/problem/p410_split_array_largest_sum.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn check(nums: &Vec, value: i64, m: i32) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn split_array(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p670_maximum_swap.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_swap` is never used [INFO] [stdout] --> src/problem/p670_maximum_swap.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_swap(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2765_longest_alternating_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `alternating_subarray` is never used [INFO] [stdout] --> src/problem/p2765_longest_alternating_subarray.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn alternating_subarray(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2865_beautiful_towers_i.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_sum_of_heights` is never used [INFO] [stdout] --> src/problem/p2865_beautiful_towers_i.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_sum_of_heights(max_heights: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2859_sum_of_values_at_indices_with_k_set_bits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sum_indices_with_k_set_bits` and `num_to_binary` are never used [INFO] [stdout] --> src/problem/p2859_sum_of_values_at_indices_with_k_set_bits.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn sum_indices_with_k_set_bits(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | fn num_to_binary(num: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, and `merge` are never used [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 16 | fn new(n: usize) -> UnionFind { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn find(&mut self, x: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn merge(&mut self, parent: usize, child: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Tree` is never constructed [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `tarjan` are never used [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl Tree { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 56 | fn new(n: i32, edges: Vec>, queries: &Vec>) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn tarjan(&mut self, node : usize, parent : usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations_queries` is never used [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:128:12 [INFO] [stdout] | [INFO] [stdout] 127 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 128 | pub fn min_operations_queries(n: i32, edges: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2861_maximum_number_of_alloys.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check` and `max_number_of_alloys` are never used [INFO] [stdout] --> src/problem/p2861_maximum_number_of_alloys.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn check(n: usize, count: i32, budget: i32, composition: &Vec, stock: &Vec, cost: &Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn max_number_of_alloys(n: i32, k: i32, budget: i32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p365_water_and_jug_problem.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `can_measure_water` and `gcd` are never used [INFO] [stdout] --> src/problem/p365_water_and_jug_problem.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn can_measure_water(jug1_capacity: i32, jug2_capacity: i32, target_capacity: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p514_freedom_trail.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_rotate_steps` is never used [INFO] [stdout] --> src/problem/p514_freedom_trail.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn find_rotate_steps(ring: String, key: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2808_minimum_seconds_to_equalize_a_circular_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_seconds` is never used [INFO] [stdout] --> src/problem/p2808_minimum_seconds_to_equalize_a_circular_array.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn minimum_seconds(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2670_find_the_distinct_difference_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_difference_array` is never used [INFO] [stdout] --> src/problem/p2670_find_the_distinct_difference_array.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn distinct_difference_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/lcp24_nums_game.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `nums_game` is never used [INFO] [stdout] --> src/problem/lcp24_nums_game.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn nums_game(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1686_stone_game_vi.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Stone` is never constructed [INFO] [stdout] --> src/problem/p1686_stone_game_vi.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Stone { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `stone_game_vi` is never used [INFO] [stdout] --> src/problem/p1686_stone_game_vi.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | pub fn stone_game_vi(alice_values: Vec, bob_values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1690_stone_game_vii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `stone_game_vii` is never used [INFO] [stdout] --> src/problem/p1690_stone_game_vii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn stone_game_vii(stones: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p292_nim_game.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_win_nim` is never used [INFO] [stdout] --> src/problem/p292_nim_game.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn can_win_nim(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1696_jump_game_vi.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_result` is never used [INFO] [stdout] --> src/problem/p1696_jump_game_vi.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn max_result(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/lcp30_magic_tower.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `magic_tower` is never used [INFO] [stdout] --> src/problem/lcp30_magic_tower.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn magic_tower(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2641_cousins_in_binary_tree_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `replace_value_in_tree` is never used [INFO] [stdout] --> src/problem/p2641_cousins_in_binary_tree_ii.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn replace_value_in_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Tree` is never constructed [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `dfs` are never used [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 41 | impl Tree { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 42 | fn new(root: Rc>, x: i32, y: i32) -> Tree { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn dfs(&mut self, node: &Rc>, height: usize, parent: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_cousins` is never used [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:86:12 [INFO] [stdout] | [INFO] [stdout] 85 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 86 | pub fn is_cousins(root: Option>>, x: i32, y: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `inorder_traversal` is never used [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p144_binary_tree_preorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `preorder_traversal` is never used [INFO] [stdout] --> src/problem/p144_binary_tree_preorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p145_binary_tree_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `postorder_traversal` is never used [INFO] [stdout] --> src/problem/p145_binary_tree_postorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Node` is never constructed [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DFS` is never constructed [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct DFS { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `search` are never used [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 42 | impl DFS { [INFO] [stdout] | -------- associated items in this implementation [INFO] [stdout] 43 | fn new() -> DFS { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn search(&mut self, node: &Rc>, x: i32, y: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `vertical_traversal` is never used [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 66 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 67 | pub fn vertical_traversal(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p102_binary_tree_level_order_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/problem/p102_binary_tree_level_order_traversal.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order_bottom` is never used [INFO] [stdout] --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `zigzag_level_order` is never used [INFO] [stdout] --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | 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/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_largest_level_sum` is never used [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn kth_largest_level_sum(root: Option>>, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `closest_nodes` is never used [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn closest_nodes(root: Option>>, queries: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p938_range_sum_of_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `range_sum_bst` is never used [INFO] [stdout] --> src/problem/p938_range_sum_of_bst.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn range_sum_bst(root: Option>>, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `construct_from_pre_post` is never used [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn construct_from_pre_post( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs` and `count_paths` are never used [INFO] [stdout] --> src/problem/p2867_count_valid_paths_in_a_tree.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn dfs(graph: &Vec>, primes: &Vec, seen: &mut Vec, [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn count_paths(n: i32, edges: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2673_make_costs_of_paths_equal_in_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_increments` is never used [INFO] [stdout] --> src/problem/p2673_make_costs_of_paths_equal_in_a_binary_tree.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_increments(n: i32, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2581_count_number_of_possible_root_nodes.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `root_count`, `hash`, `dfs`, and `tree_dp` are never used [INFO] [stdout] --> src/problem/p2581_count_number_of_possible_root_nodes.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 14 | pub fn root_count(edges: Vec>, guesses: Vec>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn hash(x: usize, y: usize) -> i64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | fn dfs(graph: &Vec>, guess_set: &HashSet, now: usize, pre: usize, count: &mut i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn tree_dp(graph: &Vec>, guess_set: &HashSet, k: &i32, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2369_check_if_there_is_a_valid_partition_for_the_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `valid_partition` is never used [INFO] [stdout] --> src/problem/p2369_check_if_there_is_a_valid_partition_for_the_array.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn valid_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem1.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_prefix_suffix_pairs` and `is_prefix_and_suffix` are never used [INFO] [stdout] --> src/week_385/problem1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_prefix_suffix_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_prefix_and_suffix(str1: &Vec, str2: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem2.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_common_prefix` is never used [INFO] [stdout] --> src/week_385/problem2.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn longest_common_prefix(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem3.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `most_frequent_prime` and `is_prime` are never used [INFO] [stdout] --> src/week_385/problem3.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn most_frequent_prime(mat: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn is_prime(num: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 175 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:93:25 [INFO] [stdout] | [INFO] [stdout] 93 | let mut array: &mut Vec = &mut result[pos]; [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: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_boomerangs` is never used [INFO] [stdout] --> src/problem/p0447_number_of_boomerangs.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn number_of_boomerangs(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_words` is never used [INFO] [stdout] --> src/problem/p2085_count_common_words_with_one_occurrence.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn count_words(words1: Vec, words2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p83_remove_duplicates_from_sorted_list.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_number_of_string_pairs` is never used [INFO] [stdout] --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_number_of_string_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `split_words_by_separator` is never used [INFO] [stdout] --> src/problem/p2788_split_strings_by_separator.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn split_words_by_separator(words: Vec, separator: char) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `length` is never read [INFO] [stdout] --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:46:5 [INFO] [stdout] | [INFO] [stdout] 42 | struct Tree { [INFO] [stdout] | ---- field in this struct [INFO] [stdout] ... [INFO] [stdout] 46 | length: usize, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `root` is never read [INFO] [stdout] --> src/problem/p993_cousins_in_binary_tree.rs:32:5 [INFO] [stdout] | [INFO] [stdout] 31 | struct Tree { [INFO] [stdout] | ---- field in this struct [INFO] [stdout] 32 | root: Rc>, [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `inorder_traversal` is never used [INFO] [stdout] --> src/problem/p94_binary_tree_inorder_traversal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn lowest_common_ancestor(root: Option>>, p: Option>>, q: Option>>... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_largest_level_sum` is never used [INFO] [stdout] --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn kth_largest_level_sum(root: Option>>, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `closest_nodes` is never used [INFO] [stdout] --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn closest_nodes(root: Option>>, queries: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `construct_from_pre_post` is never used [INFO] [stdout] --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn construct_from_pre_post( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem1.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_prefix_suffix_pairs` and `is_prefix_and_suffix` are never used [INFO] [stdout] --> src/week_385/problem1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_prefix_suffix_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn is_prefix_and_suffix(str1: &Vec, str2: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/week_385/problem2.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_common_prefix` is never used [INFO] [stdout] --> src/week_385/problem2.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn longest_common_prefix(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 60 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `content` and `return_type` are never read [INFO] [stdout] --> src/fetch_problem.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Problem { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] ... [INFO] [stdout] 19 | pub content: String, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub return_type: String [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `content` and `return_type` are never read [INFO] [stdout] --> src/fetch_problem.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Problem { [INFO] [stdout] | ------- fields in this struct [INFO] [stdout] ... [INFO] [stdout] 19 | pub content: String, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub return_type: String [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 19.24s [INFO] running `Command { std: "docker" "inspect" "a32bf7d4c70bc0ade6dca63832e5159c38257248773e218856f7b15be82472e9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a32bf7d4c70bc0ade6dca63832e5159c38257248773e218856f7b15be82472e9", kill_on_drop: false }` [INFO] [stdout] a32bf7d4c70bc0ade6dca63832e5159c38257248773e218856f7b15be82472e9