[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] 31ceeb32cdbc478d41bf58e0e40b2dd2ad343544 [INFO] checking jackfiled/leetcode-rust against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust" "/workspace/builds/worker-4-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/jackfiled/leetcode-rust on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-4-tc1/source/.cargo/config.toml [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-4-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" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded windows-targets v0.48.5 [INFO] [stderr] Downloaded wasm-bindgen-shared v0.2.92 [INFO] [stderr] Downloaded windows-targets v0.52.5 [INFO] [stderr] Downloaded futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded tower-service v0.3.2 [INFO] [stderr] Downloaded sluice v0.4.2 [INFO] [stderr] Downloaded sync_wrapper v0.1.2 [INFO] [stderr] Downloaded system-configuration-sys v0.5.0 [INFO] [stderr] Downloaded hermit-abi v0.3.9 [INFO] [stderr] Downloaded adler v1.0.2 [INFO] [stderr] Downloaded tokio-native-tls v0.3.1 [INFO] [stderr] Downloaded security-framework-sys v2.10.0 [INFO] [stderr] Downloaded equivalent v1.0.1 [INFO] [stderr] Downloaded hyper-tls v0.5.0 [INFO] [stderr] Downloaded rustls-pemfile v1.0.4 [INFO] [stderr] Downloaded futures-executor v0.3.30 [INFO] [stderr] Downloaded rand_core v0.6.4 [INFO] [stderr] Downloaded ppv-lite86 v0.2.17 [INFO] [stderr] Downloaded openssl-sys v0.9.102 [INFO] [stderr] Downloaded futures v0.3.30 [INFO] [stderr] Downloaded rand v0.8.5 [INFO] [stderr] Downloaded indexmap v2.2.6 [INFO] [stderr] Downloaded futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded tokio-util v0.7.10 [INFO] [stderr] Downloaded hashbrown v0.14.3 [INFO] [stderr] Downloaded aho-corasick v1.1.3 [INFO] [stderr] Downloaded h2 v0.3.26 [INFO] [stderr] Downloaded hyper v0.14.28 [INFO] [stderr] Downloaded isahc v0.7.6 [INFO] [stderr] Downloaded syn v2.0.58 [INFO] [stderr] Downloaded regex v1.10.4 [INFO] [stderr] Downloaded gimli v0.28.1 [INFO] [stderr] Downloaded object v0.32.2 [INFO] [stderr] Downloaded windows_x86_64_gnullvm v0.48.5 [INFO] [stderr] Downloaded wasm-bindgen v0.2.92 [INFO] [stderr] Downloaded regex-syntax v0.8.3 [INFO] [stderr] Downloaded rustix v0.38.32 [INFO] [stderr] Downloaded windows_aarch64_gnullvm v0.52.5 [INFO] [stderr] Downloaded windows_x86_64_gnullvm v0.52.5 [INFO] [stderr] Downloaded windows_aarch64_gnullvm v0.48.5 [INFO] [stderr] Downloaded windows_i686_gnullvm v0.52.5 [INFO] [stderr] Downloaded reqwest v0.11.27 [INFO] [stderr] Downloaded serde_json v1.0.115 [INFO] [stderr] Downloaded openssl v0.10.64 [INFO] [stderr] Downloaded futures v0.1.31 [INFO] [stderr] Downloaded base64 v0.21.7 [INFO] [stderr] Downloaded http v0.1.21 [INFO] [stderr] Downloaded memchr v2.7.2 [INFO] [stderr] Downloaded regex-automata v0.4.6 [INFO] [stderr] Downloaded backtrace v0.3.71 [INFO] [stderr] Downloaded curl v0.4.46 [INFO] [stderr] Downloaded mio v0.8.11 [INFO] [stderr] Downloaded libc v0.2.153 [INFO] [stderr] Downloaded web-sys v0.3.69 [INFO] [stderr] Downloaded security-framework v2.10.0 [INFO] [stderr] Downloaded windows_aarch64_msvc v0.48.5 [INFO] [stderr] Downloaded windows_x86_64_msvc v0.48.5 [INFO] [stderr] Downloaded windows_aarch64_msvc v0.52.5 [INFO] [stderr] Downloaded windows_i686_msvc v0.48.5 [INFO] [stderr] Downloaded windows_x86_64_gnu v0.52.5 [INFO] [stderr] Downloaded windows_i686_gnu v0.52.5 [INFO] [stderr] Downloaded windows_i686_msvc v0.52.5 [INFO] [stderr] Downloaded windows_i686_gnu v0.48.5 [INFO] [stderr] Downloaded windows_x86_64_gnu v0.48.5 [INFO] [stderr] Downloaded windows_x86_64_msvc v0.52.5 [INFO] [stderr] Downloaded tokio v1.37.0 [INFO] [stderr] Downloaded crossbeam-channel v0.3.9 [INFO] [stderr] Downloaded serde v1.0.197 [INFO] [stderr] Downloaded url v2.5.0 [INFO] [stderr] Downloaded js-sys v0.3.69 [INFO] [stderr] Downloaded bumpalo v3.16.0 [INFO] [stderr] Downloaded cc v1.0.94 [INFO] [stderr] Downloaded bytes v1.6.0 [INFO] [stderr] Downloaded serde_derive v1.0.197 [INFO] [stderr] Downloaded futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded rand_chacha v0.3.1 [INFO] [stderr] Downloaded getrandom v0.2.14 [INFO] [stderr] Downloaded http-body v0.4.6 [INFO] [stderr] Downloaded httparse v1.8.0 [INFO] [stderr] Downloaded httpdate v1.0.3 [INFO] [stderr] Downloaded core-foundation v0.9.4 [INFO] [stderr] Downloaded bitflags v2.5.0 [INFO] [stderr] Downloaded schannel v0.1.23 [INFO] [stderr] Downloaded tinyvec v1.6.0 [INFO] [stderr] Downloaded bytes v0.4.12 [INFO] [stderr] Downloaded socket2 v0.5.6 [INFO] [stderr] Downloaded futures-macro v0.3.30 [INFO] [stderr] Downloaded tempfile v3.10.1 [INFO] [stderr] Downloaded mime_guess v2.0.4 [INFO] [stderr] Downloaded linux-raw-sys v0.4.13 [INFO] [stderr] Downloaded ryu v1.0.17 [INFO] [stderr] Downloaded value-bag v1.8.1 [INFO] [stderr] Downloaded log v0.4.21 [INFO] [stderr] Downloaded wasm-bindgen-macro-support v0.2.92 [INFO] [stderr] Downloaded surf v1.0.3 [INFO] [stderr] Downloaded addr2line v0.21.0 [INFO] [stderr] Downloaded miniz_oxide v0.7.2 [INFO] [stderr] Downloaded proc-macro2 v1.0.79 [INFO] [stderr] Downloaded core-foundation-sys v0.8.6 [INFO] [stderr] Downloaded native-tls v0.2.11 [INFO] [stderr] Downloaded winreg v0.50.0 [INFO] [stderr] Downloaded futures-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded crossbeam-utils v0.6.6 [INFO] [stderr] Downloaded tokio-io v0.1.13 [INFO] [stderr] Downloaded wasm-bindgen-backend v0.2.92 [INFO] [stderr] Downloaded wasi v0.11.0+wasi-snapshot-preview1 [INFO] [stderr] Downloaded rustc-demangle v0.1.23 [INFO] [stderr] Downloaded system-configuration v0.5.1 [INFO] [stderr] Downloaded quote v1.0.36 [INFO] [stderr] Downloaded fastrand v2.0.2 [INFO] [stderr] Downloaded libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Downloaded errno v0.3.8 [INFO] [stderr] Downloaded wasm-bindgen-futures v0.4.42 [INFO] [stderr] Downloaded futures-core-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded dtoa v0.4.8 [INFO] [stderr] Downloaded serde_urlencoded v0.6.1 [INFO] [stderr] Downloaded futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Downloaded autocfg v1.2.0 [INFO] [stderr] Downloaded byteorder v1.5.0 [INFO] [stderr] Downloaded version_check v0.9.4 [INFO] [stderr] Downloaded lazy_static v1.4.0 [INFO] [stderr] Downloaded wasm-bindgen-futures v0.3.27 [INFO] [stderr] Downloaded wasm-bindgen-macro v0.2.92 [INFO] [stderr] Downloaded tokio-macros v2.2.0 [INFO] [stderr] Downloaded windows-sys v0.52.0 [INFO] [stderr] Downloaded windows-sys v0.48.0 [INFO] [stderr] Downloaded curl-sys v0.4.72+curl-8.6.0 [INFO] [stderr] Downloaded libz-sys v1.1.16 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 39d69260865e7029afa12eb03b90d042bc5cdbad7451e861a110c50815e29778 [INFO] running `Command { std: "docker" "start" "-a" "39d69260865e7029afa12eb03b90d042bc5cdbad7451e861a110c50815e29778", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "39d69260865e7029afa12eb03b90d042bc5cdbad7451e861a110c50815e29778", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "39d69260865e7029afa12eb03b90d042bc5cdbad7451e861a110c50815e29778", kill_on_drop: false }` [INFO] [stdout] 39d69260865e7029afa12eb03b90d042bc5cdbad7451e861a110c50815e29778 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 084abf1726b041ba2f74887db4439100e54558a2d6db98ae2d2c76fe233932b4 [INFO] running `Command { std: "docker" "start" "-a" "084abf1726b041ba2f74887db4439100e54558a2d6db98ae2d2c76fe233932b4", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.153 [INFO] [stderr] Compiling cc v1.0.94 [INFO] [stderr] Compiling pkg-config v0.3.30 [INFO] [stderr] Compiling proc-macro2 v1.0.79 [INFO] [stderr] Compiling vcpkg v0.2.15 [INFO] [stderr] Compiling unicode-ident v1.0.12 [INFO] [stderr] Compiling autocfg v1.2.0 [INFO] [stderr] Checking memchr v2.7.2 [INFO] [stderr] Checking pin-project-lite v0.2.14 [INFO] [stderr] Checking pin-utils v0.1.0 [INFO] [stderr] Checking value-bag v1.8.1 [INFO] [stderr] Checking cfg-if v1.0.0 [INFO] [stderr] Checking once_cell v1.19.0 [INFO] [stderr] Checking futures-core v0.3.30 [INFO] [stderr] Checking bytes v1.6.0 [INFO] [stderr] Checking itoa v1.0.11 [INFO] [stderr] Checking fnv v1.0.7 [INFO] [stderr] Checking futures-sink v0.3.30 [INFO] [stderr] Compiling version_check v0.9.4 [INFO] [stderr] Checking byteorder v1.5.0 [INFO] [stderr] Checking futures-task v0.3.30 [INFO] [stderr] Compiling serde v1.0.197 [INFO] [stderr] Checking futures-channel v0.3.30 [INFO] [stderr] Checking futures-sink-preview v0.3.0-alpha.19 [INFO] [stderr] Checking openssl-probe v0.1.5 [INFO] [stderr] Checking futures-core-preview v0.3.0-alpha.19 [INFO] [stderr] Checking tinyvec_macros v0.1.1 [INFO] [stderr] Checking futures-io v0.3.30 [INFO] [stderr] Checking log v0.4.21 [INFO] [stderr] Checking tinyvec v1.6.0 [INFO] [stderr] Checking tracing-core v0.1.32 [INFO] [stderr] Compiling openssl v0.10.64 [INFO] [stderr] Checking futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Checking percent-encoding v2.3.1 [INFO] [stderr] Checking foreign-types-shared v0.1.1 [INFO] [stderr] Compiling slab v0.4.9 [INFO] [stderr] Compiling unicase v2.7.0 [INFO] [stderr] Checking futures v0.1.31 [INFO] [stderr] Checking futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Checking http v0.2.12 [INFO] [stderr] Checking foreign-types v0.3.2 [INFO] [stderr] Checking form_urlencoded v1.2.1 [INFO] [stderr] Checking hashbrown v0.14.3 [INFO] [stderr] Compiling httparse v1.8.0 [INFO] [stderr] Checking unicode-bidi v0.3.15 [INFO] [stderr] Compiling native-tls v0.2.11 [INFO] [stderr] Checking equivalent v1.0.1 [INFO] [stderr] Checking bitflags v2.5.0 [INFO] [stderr] Checking tracing v0.1.40 [INFO] [stderr] Compiling quote v1.0.36 [INFO] [stderr] Compiling serde_json v1.0.115 [INFO] [stderr] Checking ryu v1.0.17 [INFO] [stderr] Checking itoa v0.4.8 [INFO] [stderr] Compiling curl v0.4.46 [INFO] [stderr] Checking try-lock v0.2.5 [INFO] [stderr] Checking cfg-if v0.1.10 [INFO] [stderr] Checking lazy_static v1.4.0 [INFO] [stderr] Checking want v0.3.1 [INFO] [stderr] Compiling mime_guess v2.0.4 [INFO] [stderr] Compiling syn v2.0.58 [INFO] [stderr] Checking httpdate v1.0.3 [INFO] [stderr] Checking crossbeam-utils v0.6.6 [INFO] [stderr] Checking tower-service v0.3.2 [INFO] [stderr] Checking mime v0.3.17 [INFO] [stderr] Compiling isahc v0.7.6 [INFO] [stderr] Checking aho-corasick v1.1.3 [INFO] [stderr] Checking sluice v0.4.2 [INFO] [stderr] Checking unicode-normalization v0.1.23 [INFO] [stderr] Checking http-body v0.4.6 [INFO] [stderr] Checking regex-syntax v0.8.3 [INFO] [stderr] Checking ppv-lite86 v0.2.17 [INFO] [stderr] Checking indexmap v2.2.6 [INFO] [stderr] Checking base64 v0.21.7 [INFO] [stderr] Checking dtoa v0.4.8 [INFO] [stderr] Checking crossbeam-channel v0.3.9 [INFO] [stderr] Checking encoding_rs v0.8.34 [INFO] [stderr] Checking ipnet v2.9.0 [INFO] [stderr] Checking sync_wrapper v0.1.2 [INFO] [stderr] Checking rustls-pemfile v1.0.4 [INFO] [stderr] Compiling openssl-sys v0.9.102 [INFO] [stderr] Compiling libz-sys v1.1.16 [INFO] [stderr] Compiling libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Compiling curl-sys v0.4.72+curl-8.6.0 [INFO] [stderr] Checking idna v0.5.0 [INFO] [stderr] Checking num_cpus v1.16.0 [INFO] [stderr] Checking socket2 v0.5.6 [INFO] [stderr] Checking iovec v0.1.4 [INFO] [stderr] Checking mio v0.8.11 [INFO] [stderr] Checking bytes v0.4.12 [INFO] [stderr] Checking getrandom v0.2.14 [INFO] [stderr] Checking rand_core v0.6.4 [INFO] [stderr] Checking rand_chacha v0.3.1 [INFO] [stderr] Checking tokio-io v0.1.13 [INFO] [stderr] Checking http v0.1.21 [INFO] [stderr] Checking url v2.5.0 [INFO] [stderr] Checking rand v0.8.5 [INFO] [stderr] Checking futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Checking regex-automata v0.4.6 [INFO] [stderr] Checking serde_urlencoded v0.6.1 [INFO] [stderr] Checking serde_urlencoded v0.7.1 [INFO] [stderr] Checking futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling tokio-macros v2.2.0 [INFO] [stderr] Compiling futures-macro v0.3.30 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling serde_derive v1.0.197 [INFO] [stderr] Checking tokio v1.37.0 [INFO] [stderr] Checking futures-util v0.3.30 [INFO] [stderr] Checking regex v1.10.4 [INFO] [stderr] Checking surf v1.0.3 [INFO] [stderr] Checking futures-executor v0.3.30 [INFO] [stderr] Checking futures v0.3.30 [INFO] [stderr] Checking tokio-util v0.7.10 [INFO] [stderr] Checking tokio-native-tls v0.3.1 [INFO] [stderr] Checking h2 v0.3.26 [INFO] [stderr] Checking hyper v0.14.28 [INFO] [stderr] Checking hyper-tls v0.5.0 [INFO] [stderr] Checking reqwest v0.11.27 [INFO] [stderr] Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p2_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: unused import: `to_tree` [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_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: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:19:16 [INFO] [stdout] | [INFO] [stdout] 19 | if (c == ',') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 19 - if (c == ',') { [INFO] [stdout] 19 + if c == ',' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:23:16 [INFO] [stdout] | [INFO] [stdout] 23 | if (c == '#') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - if (c == '#') { [INFO] [stdout] 23 + if c == '#' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p42_trapping_rain_water.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (1..length) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (1..length) { [INFO] [stdout] 14 + for i in 1..length { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p54_spiral_matrix.rs:40:24 [INFO] [stdout] | [INFO] [stdout] 40 | if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 40 - if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] 40 + if matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (0..n / 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (0..n / 2) { [INFO] [stdout] 14 + for i in 0..n / 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | for i in (0..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - for i in (0..n) { [INFO] [stdout] 23 + for i in 0..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:24:22 [INFO] [stdout] | [INFO] [stdout] 24 | for j in (0..i) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 24 - for j in (0..i) { [INFO] [stdout] 24 + for j in 0..i { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:37:18 [INFO] [stdout] | [INFO] [stdout] 37 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 37 - for i in (1..n) { [INFO] [stdout] 37 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problem/p219_contains_duplicate_ii.rs:16:36 [INFO] [stdout] | [INFO] [stdout] 16 | let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 16 - let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] 16 + let distance:i32 = *last_pos - i as i32; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:8:42 [INFO] [stdout] | [INFO] [stdout] 8 | 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/p104_maximum_depth_of_binary_tree.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/p100_same_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/p226_invert_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/p101_symmetric_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/p114_flatten_binary_tree_to_linked_list.rs:6:25 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 32 - if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] 32 + if root.borrow().left.is_none() && root.borrow().right.is_none() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p112_path_sum.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/p129_sum_root_to_leaf_numbers.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/p124_binary_tree_maximum_path_sum.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/p173_binary_search_tree_iterator.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/p173_binary_search_tree_iterator.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/p222_count_complete_tree_nodes.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/p199_binary_tree_right_side_view.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/p637_average_of_levels_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/p530_minimum_absolute_difference_in_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: `to_tree` [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_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: `to_tree` [INFO] [stdout] --> src/problem/p98_validate_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: `to_tree` [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_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 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/p447_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/problem/p2368_reachable_nodes_with_restrictions.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/p1976_number_of_ways_to_arrive_at_destination.rs:78:9 [INFO] [stdout] | [INFO] [stdout] 78 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_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/p1261_find_elements_in_a_contaminated_binary_tree.rs:84:9 [INFO] [stdout] | [INFO] [stdout] 84 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2312_selling_pieces_of_wood.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2549_count_distinct_numbers_on_board.rs:23:9 [INFO] [stdout] | [INFO] [stdout] 23 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.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/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:19:16 [INFO] [stdout] | [INFO] [stdout] 19 | if (c == ',') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 19 - if (c == ',') { [INFO] [stdout] 19 + if c == ',' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:23:16 [INFO] [stdout] | [INFO] [stdout] 23 | if (c == '#') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - if (c == '#') { [INFO] [stdout] 23 + if c == '#' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p26_remove_duplicates_from_sorted_array.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p42_trapping_rain_water.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (1..length) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (1..length) { [INFO] [stdout] 14 + for i in 1..length { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:22:9 [INFO] [stdout] | [INFO] [stdout] 22 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p209_minimum_size_subarray_sum.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p36_valid_sudoku.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p54_spiral_matrix.rs:40:24 [INFO] [stdout] | [INFO] [stdout] 40 | if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 40 - if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] 40 + if matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (0..n / 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (0..n / 2) { [INFO] [stdout] 14 + for i in 0..n / 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | for i in (0..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - for i in (0..n) { [INFO] [stdout] 23 + for i in 0..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:24:22 [INFO] [stdout] | [INFO] [stdout] 24 | for j in (0..i) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 24 - for j in (0..i) { [INFO] [stdout] 24 + for j in 0..i { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p48_rotate_image.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:37:18 [INFO] [stdout] | [INFO] [stdout] 37 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 37 - for i in (1..n) { [INFO] [stdout] 37 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:71:9 [INFO] [stdout] | [INFO] [stdout] 71 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p289_game_of_life.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p383_ransom_note.rs:43:9 [INFO] [stdout] | [INFO] [stdout] 43 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p205_isomorphic_strings.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problem/p219_contains_duplicate_ii.rs:16:36 [INFO] [stdout] | [INFO] [stdout] 16 | let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 16 - let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] 16 + let distance:i32 = *last_pos - i as i32; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p228_summary_ranges.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p57_insert_interval.rs:44:9 [INFO] [stdout] | [INFO] [stdout] 44 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p155_min_stack.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:8:42 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.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: `super::*` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p100_same_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/p100_same_tree.rs:90:9 [INFO] [stdout] | [INFO] [stdout] 90 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:6:25 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 32 - if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] 32 + if root.borrow().left.is_none() && root.borrow().right.is_none() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p112_path_sum.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/p112_path_sum.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p129_sum_root_to_leaf_numbers.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/p129_sum_root_to_leaf_numbers.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p124_binary_tree_maximum_path_sum.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/p124_binary_tree_maximum_path_sum.rs:70:9 [INFO] [stdout] | [INFO] [stdout] 70 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed` [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.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/p173_binary_search_tree_iterator.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/p173_binary_search_tree_iterator.rs:112:9 [INFO] [stdout] | [INFO] [stdout] 112 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p222_count_complete_tree_nodes.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/p222_count_complete_tree_nodes.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p199_binary_tree_right_side_view.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/p199_binary_tree_right_side_view.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p637_average_of_levels_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: `super::*` [INFO] [stdout] --> src/problem/p637_average_of_levels_in_binary_tree.rs:70:9 [INFO] [stdout] | [INFO] [stdout] 70 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_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: `super::*` [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_bst.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/p230_kth_smallest_element_in_a_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: `super::*` [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_bst.rs:67:9 [INFO] [stdout] | [INFO] [stdout] 67 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p98_validate_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/p98_validate_binary_search_tree.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p200_number_of_islands.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p130_surrounded_regions.rs:69:9 [INFO] [stdout] | [INFO] [stdout] 69 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p207_course_schedule.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p210_course_schedule_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/p17_letter_combinations_of_a_phone_number.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p77_combinations.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p46_permutations.rs:44:9 [INFO] [stdout] | [INFO] [stdout] 44 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p22_generate_parentheses.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p79_word_search.rs:74:9 [INFO] [stdout] | [INFO] [stdout] 74 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_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/p108_convert_sorted_array_to_binary_search_tree.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 65 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p53_maximum_subarray.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p918_maximum_sum_circular_subarray.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p35_search_insert_position.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p33_search_in_rotated_sorted_array.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:32:9 [INFO] [stdout] | [INFO] [stdout] 32 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p215_kth_largest_element_in_an_array.rs:33:9 [INFO] [stdout] | [INFO] [stdout] 33 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p502_ipo.rs:46:9 [INFO] [stdout] | [INFO] [stdout] 46 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p190_reverse_bits.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 19 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p172_factorial_trailing_zeroes.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p50_powx_n.rs:36:9 [INFO] [stdout] | [INFO] [stdout] 36 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p300_longest_increasing_subsequence.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p551_student_attendance_record_i.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | use super::*; [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: variable does not need to be mutable [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut entry = self.number_map.entry(number).or_insert(0); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let height = grid.len(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p68_text_justification.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | for i in 0..(max_width - lines[0].len()) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/problem/p68_text_justification.rs:49:29 [INFO] [stdout] | [INFO] [stdout] 49 | for j in 0..space_length { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/problem/p68_text_justification.rs:77:17 [INFO] [stdout] | [INFO] [stdout] 77 | for j in 0..(max_width - line.len()) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `last_begin` [INFO] [stdout] --> src/problem/p56_merge_intervals.rs:19:18 [INFO] [stdout] | [INFO] [stdout] 19 | let (last_begin, last_end) = result[last]; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_last_begin` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:45:17 [INFO] [stdout] | [INFO] [stdout] 45 | for i in 0..level { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p70_climbing_stairs.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | for i in 3..=n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p139_word_break.rs:26:13 [INFO] [stdout] | [INFO] [stdout] 26 | let mut root = Trie::new(false); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `signal_speed` [INFO] [stdout] --> src/double_week_125/problem3.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let signal_speed = signal_speed as i64; [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_signal_speed` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `connection` [INFO] [stdout] --> src/double_week_125/problem3.rs:20:17 [INFO] [stdout] | [INFO] [stdout] 20 | let mut connection = vec![(0,0);n]; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_connection` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `next` [INFO] [stdout] --> src/double_week_125/problem3.rs:21:13 [INFO] [stdout] | [INFO] [stdout] 21 | for next in &graph[0] { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_next` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/double_week_125/problem3.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | let mut connection = vec![(0,0);n]; [INFO] [stdout] | ----^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/double_week_125/problem3.rs:25:13 [INFO] [stdout] | [INFO] [stdout] 25 | let mut result = Vec::with_capacity(n); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1_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/p1_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/p9_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/p9_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/p20_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/p20_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/p2_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/p2_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/p3_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/p3_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/p162_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/p162_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/p52_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/p52_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/p912_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/p912_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/p6_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/p6_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/p7_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/p7_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/p4_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/p4_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/p743_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/p743_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/p447_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/p447_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: 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: 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/problem/p2368_reachable_nodes_with_restrictions.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reachable_nodes` is never used [INFO] [stdout] --> src/problem/p2368_reachable_nodes_with_restrictions.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn reachable_nodes(n: i32, edges: Vec>, restricted: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p225_implement_stack_using_queues.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/problem/p225_implement_stack_using_queues.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used [INFO] [stdout] --> src/problem/p225_implement_stack_using_queues.rs:21:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 20 | [INFO] [stdout] 21 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p232_implement_queue_using_stacks.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/problem/p232_implement_queue_using_stacks.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/problem/p232_implement_queue_using_stacks.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 20 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn peek(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1976_number_of_ways_to_arrive_at_destination.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/p1976_number_of_ways_to_arrive_at_destination.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_paths` is never used [INFO] [stdout] --> src/problem/p1976_number_of_ways_to_arrive_at_destination.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn count_paths(n: i32, roads: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2917_find_the_k_or_of_an_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_k_or` is never used [INFO] [stdout] --> src/problem/p2917_find_the_k_or_of_an_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_k_or(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2575_find_the_divisibility_array_of_a_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divisibility_array` is never used [INFO] [stdout] --> src/problem/p2575_find_the_divisibility_array_of_a_string.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn divisibility_array(word: String, m: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2834_find_the_minimum_possible_sum_of_a_beautiful_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_possible_sum` is never used [INFO] [stdout] --> src/problem/p2834_find_the_minimum_possible_sum_of_a_beautiful_array.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn minimum_possible_sum(n: i32, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2386_find_the_k_sum_of_an_array.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/p2386_find_the_k_sum_of_an_array.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_sum` is never used [INFO] [stdout] --> src/problem/p2386_find_the_k_sum_of_an_array.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn k_sum(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p299_bulls_and_cows.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_hint` is never used [INFO] [stdout] --> src/problem/p299_bulls_and_cows.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn get_hint(secret: String, guess: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2129_capitalize_the_title.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `capitalize_title` is never used [INFO] [stdout] --> src/problem/p2129_capitalize_the_title.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn capitalize_title(title: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FindElements` is never constructed [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct FindElements { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `find` are never used [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 38 | impl FindElements { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 39 | [INFO] [stdout] 40 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn find(&self, target: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2864_maximum_odd_binary_number.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_odd_binary_number` is never used [INFO] [stdout] --> src/problem/p2864_maximum_odd_binary_number.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_odd_binary_number(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2789_largest_element_in_an_array_after_merge_operations.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_array_value` is never used [INFO] [stdout] --> src/problem/p2789_largest_element_in_an_array_after_merge_operations.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn max_array_value(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2312_selling_pieces_of_wood.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `selling_wood`, `hash`, and `dfs` are never used [INFO] [stdout] --> src/problem/p2312_selling_pieces_of_wood.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn selling_wood(m: i32, n: i32, prices: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn hash(x: usize, y: usize)-> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn dfs(x: usize, y: usize, dp: &mut Vec>, prices_map: &HashMap) -> i64 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2684_maximum_number_of_moves_in_a_grid.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_moves` is never used [INFO] [stdout] --> src/problem/p2684_maximum_number_of_moves_in_a_grid.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn max_moves(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p310_minimum_height_trees.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_min_height_trees` and `find_longest_node` are never used [INFO] [stdout] --> src/problem/p310_minimum_height_trees.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn find_min_height_trees(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn find_longest_node(node: usize, parents: &mut Vec, graph: &Vec>) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_range` are never used [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 17 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1793_maximum_score_of_a_good_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_score` is never used [INFO] [stdout] --> src/problem/p1793_maximum_score_of_a_good_subarray.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximum_score(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1969_minimum_non_zero_product_of_the_array_elements.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_non_zero_product` and `fast_power` are never used [INFO] [stdout] --> src/problem/p1969_minimum_non_zero_product_of_the_array_elements.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 12 | pub fn min_non_zero_product(p: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn fast_power(x: i64, n: i64, m: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FrequencyTracker` is never constructed [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct FrequencyTracker { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, `delete_one`, and `has_frequency` are never used [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 20 | impl FrequencyTracker { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn add(&mut self, number: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn delete_one(&mut self, number: i32) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn has_frequency(&self, frequency: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_visited_cells` is never used [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn minimum_visited_cells(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2549_count_distinct_numbers_on_board.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_integers` is never used [INFO] [stdout] --> src/problem/p2549_count_distinct_numbers_on_board.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn distinct_integers(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p322_coin_change.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `coin_change` is never used [INFO] [stdout] --> src/problem/p322_coin_change.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn coin_change(coins: Vec, amount: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p518_coin_change_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `change` is never used [INFO] [stdout] --> src/problem/p518_coin_change_ii.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn change(amount: i32, coins: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_edge`, and `shortest_path` are never used [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 18 | fn new(n: i32, edges: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn add_edge(&mut self, edge: Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn shortest_path(&self, node1: i32, node2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2580_count_ways_to_group_overlapping_ranges.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Range` is never constructed [INFO] [stdout] --> src/problem/p2580_count_ways_to_group_overlapping_ranges.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Range { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_ways` is never used [INFO] [stdout] --> src/problem/p2580_count_ways_to_group_overlapping_ranges.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 13 | pub fn count_ways(ranges: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `first_day_been_in_all_rooms` is never used [INFO] [stdout] --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn first_day_been_in_all_rooms(next_visit: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2908_minimum_sum_of_mountain_triplets_i.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_sum` is never used [INFO] [stdout] --> src/problem/p2908_minimum_sum_of_mountain_triplets_i.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn minimum_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2952_minimum_number_of_coins_to_be_added.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_added_coins` is never used [INFO] [stdout] --> src/problem/p2952_minimum_number_of_coins_to_be_added.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn minimum_added_coins(coins: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_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 `is_valid_serialization` is never used [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_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 is_valid_serialization(preorder: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p88_merge_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/problem/p88_merge_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p26_remove_duplicates_from_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/problem/p26_remove_duplicates_from_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p27_remove_element.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_element` is never used [INFO] [stdout] --> src/problem/p27_remove_element.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p80_remove_duplicates_from_sorted_array_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/problem/p80_remove_duplicates_from_sorted_array_ii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p169_majority_element.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `majority_element` is never used [INFO] [stdout] --> src/problem/p169_majority_element.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p189_rotate_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/problem/p189_rotate_array.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p121_best_time_to_buy_and_sell_stock.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/problem/p121_best_time_to_buy_and_sell_stock.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p122_best_time_to_buy_and_sell_stock_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/problem/p122_best_time_to_buy_and_sell_stock_ii.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p55_jump_game.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_jump` is never used [INFO] [stdout] --> src/problem/p55_jump_game.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p45_jump_game_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `jump` is never used [INFO] [stdout] --> src/problem/p45_jump_game_ii.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p274_h_index.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `h_index` is never used [INFO] [stdout] --> src/problem/p274_h_index.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn h_index(citations: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p380_insert_delete_getrandom_o1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `RandomizedSet` is never constructed [INFO] [stdout] --> src/problem/p380_insert_delete_getrandom_o1.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct RandomizedSet { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used [INFO] [stdout] --> src/problem/p380_insert_delete_getrandom_o1.rs:25:8 [INFO] [stdout] | [INFO] [stdout] 23 | impl RandomizedSet { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 24 | [INFO] [stdout] 25 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn insert(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn remove(&mut self, val: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn get_random(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p238_product_of_array_except_self.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_except_self` is never used [INFO] [stdout] --> src/problem/p238_product_of_array_except_self.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p134_gas_station.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_complete_circuit` is never used [INFO] [stdout] --> src/problem/p134_gas_station.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p135_candy.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `candy` is never used [INFO] [stdout] --> src/problem/p135_candy.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn candy(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p42_trapping_rain_water.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap` is never used [INFO] [stdout] --> src/problem/p42_trapping_rain_water.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p58_length_of_last_word.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_last_word` is never used [INFO] [stdout] --> src/problem/p58_length_of_last_word.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn length_of_last_word(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p151_reverse_words_in_a_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_words` is never used [INFO] [stdout] --> src/problem/p151_reverse_words_in_a_string.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn reverse_words(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `str_str` is never used [INFO] [stdout] --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p68_text_justification.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `full_justify` is never used [INFO] [stdout] --> src/problem/p68_text_justification.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn full_justify(words: Vec, max_width: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p125_valid_palindrome.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/problem/p125_valid_palindrome.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p392_is_subsequence.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_subsequence` is never used [INFO] [stdout] --> src/problem/p392_is_subsequence.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn is_subsequence(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p167_two_sum_ii_input_array_is_sorted.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/problem/p167_two_sum_ii_input_array_is_sorted.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p209_minimum_size_subarray_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sub_array_len` is never used [INFO] [stdout] --> src/problem/p209_minimum_size_subarray_sum.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p30_substring_with_concatenation_of_all_words.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_substring` is never used [INFO] [stdout] --> src/problem/p30_substring_with_concatenation_of_all_words.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p76_minimum_window_substring.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_window` and `check_map` are never used [INFO] [stdout] --> src/problem/p76_minimum_window_substring.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn check_map(s : &HashMap, t : &HashMap) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p36_valid_sudoku.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_sudoku` is never used [INFO] [stdout] --> src/problem/p36_valid_sudoku.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p54_spiral_matrix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `spiral_order` is never used [INFO] [stdout] --> src/problem/p54_spiral_matrix.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn spiral_order(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p48_rotate_image.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/problem/p48_rotate_image.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `set_zeroes` is never used [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p289_game_of_life.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `game_of_life` is never used [INFO] [stdout] --> src/problem/p289_game_of_life.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn game_of_life(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p383_ransom_note.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_construct` is never used [INFO] [stdout] --> src/problem/p383_ransom_note.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn can_construct(ransom_note: String, magazine: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p290_word_pattern.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_pattern` is never used [INFO] [stdout] --> src/problem/p290_word_pattern.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn word_pattern(pattern: String, s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p205_isomorphic_strings.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/problem/p205_isomorphic_strings.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p242_valid_anagram.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_anagram` is never used [INFO] [stdout] --> src/problem/p242_valid_anagram.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn is_anagram(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p49_group_anagrams.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordState` is never constructed [INFO] [stdout] --> src/problem/p49_group_anagrams.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct WordState { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/problem/p49_group_anagrams.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p202_happy_number.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_happy` and `calculate_square` are never used [INFO] [stdout] --> src/problem/p202_happy_number.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn calculate_square(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p219_contains_duplicate_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/problem/p219_contains_duplicate_ii.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p128_longest_consecutive_sequence.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_consecutive` is never used [INFO] [stdout] --> src/problem/p128_longest_consecutive_sequence.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p228_summary_ranges.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `summary_ranges` is never used [INFO] [stdout] --> src/problem/p228_summary_ranges.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn summary_ranges(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p56_merge_intervals.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/problem/p56_merge_intervals.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p57_insert_interval.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insert` is never used [INFO] [stdout] --> src/problem/p57_insert_interval.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn insert(intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used [INFO] [stdout] --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_min_arrow_shots(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p71_simplify_path.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `simplify_path` is never used [INFO] [stdout] --> src/problem/p71_simplify_path.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn simplify_path(path: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p155_min_stack.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/problem/p155_min_stack.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used [INFO] [stdout] --> src/problem/p155_min_stack.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 20 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn get_min(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p150_evaluate_reverse_polish_notation.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `eval_rpn` is never used [INFO] [stdout] --> src/problem/p150_evaluate_reverse_polish_notation.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p224_basic_calculator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate` is never used [INFO] [stdout] --> src/problem/p224_basic_calculator.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p100_same_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_same_tree` is never used [INFO] [stdout] --> src/problem/p100_same_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn is_same_tree(p: Option>>, q: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p226_invert_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/problem/p226_invert_binary_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p101_symmetric_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_same` and `is_symmetric` are never used [INFO] [stdout] --> src/problem/p101_symmetric_tree.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn is_same(left: &Option>>, right: &Option>>) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `flatten_tree` and `flatten` are never used [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn flatten_tree(root: &Rc>) -> Rc> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p112_path_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs` and `has_path_sum` are never used [INFO] [stdout] --> src/problem/p112_path_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn dfs(node: &Rc>, current_sum: i32, target_sum: i32) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p129_sum_root_to_leaf_numbers.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs_sum` and `sum_numbers` are never used [INFO] [stdout] --> src/problem/p129_sum_root_to_leaf_numbers.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn dfs_sum(node: &Rc>, last_num: i32, result: &mut i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p124_binary_tree_maximum_path_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_sum` and `max_path_sum` are never used [INFO] [stdout] --> src/problem/p124_binary_tree_maximum_path_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn max_sum(node: &Rc>, result: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 42 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 43 | [INFO] [stdout] 44 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p222_count_complete_tree_nodes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_nodes` is never used [INFO] [stdout] --> src/problem/p222_count_complete_tree_nodes.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p199_binary_tree_right_side_view.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `right_side_view` is never used [INFO] [stdout] --> src/problem/p199_binary_tree_right_side_view.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p637_average_of_levels_in_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `average_of_levels` is never used [INFO] [stdout] --> src/problem/p637_average_of_levels_in_binary_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn average_of_levels(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_iterate` and `get_minimum_difference` are never used [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_bst.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn inorder_iterate(node: &Rc>, arrap: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn get_minimum_difference(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_iterate` and `kth_smallest` are never used [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_bst.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn inorder_iterate(node: &Rc>, count: &mut i32, target: i32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p98_validate_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_iterate` and `is_valid_bst` are never used [INFO] [stdout] --> src/problem/p98_validate_binary_search_tree.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn inorder_iterate(node: &Rc>, array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p200_number_of_islands.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_in_grid`, `dfs`, and `num_islands` are never used [INFO] [stdout] --> src/problem/p200_number_of_islands.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn is_in_grid(x: i32, y: i32, grid: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn dfs(grid: &mut Vec>, x: i32, y: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p130_surrounded_regions.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs` and `solve` are never used [INFO] [stdout] --> src/problem/p130_surrounded_regions.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn dfs(board: &mut Vec>, x: i32, y: i32, m: i32, n: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn solve(board: &mut Vec>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p399_evaluate_division.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/p399_evaluate_division.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, `merge`, and `is_connected` are never used [INFO] [stdout] --> src/problem/p399_evaluate_division.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] 31 | fn find(&mut self, x: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn merge(&mut self, x: usize, y: usize, value: f64) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn is_connected(&mut self, x: usize, y: usize) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calc_equation` is never used [INFO] [stdout] --> src/problem/p399_evaluate_division.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 65 | pub fn calc_equation(equations: Vec>, values: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p207_course_schedule.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_finish` is never used [INFO] [stdout] --> src/problem/p207_course_schedule.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p210_course_schedule_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_order` is never used [INFO] [stdout] --> src/problem/p210_course_schedule_ii.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p909_snakes_and_ladders.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `snakes_and_ladders` is never used [INFO] [stdout] --> src/problem/p909_snakes_and_ladders.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn snakes_and_ladders(board: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p433_minimum_genetic_mutation.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_mutation` is never used [INFO] [stdout] --> src/problem/p433_minimum_genetic_mutation.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_mutation(start_gene: String, end_gene: String, bank: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p127_word_ladder.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `ladder_length` and `is_one_char` are never used [INFO] [stdout] --> src/problem/p127_word_ladder.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 103 | fn is_one_char(a: &String, b: &String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | fn new(is_ended: bool) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 32 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 33 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TireNode` is never constructed [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct TireNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:15:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl TireNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | fn new(is_word: bool) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, and `search` are never used [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 31 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 32 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add_word(&self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p212_word_search_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/problem/p212_word_search_ii.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problem/p212_word_search_ii.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl TrieNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 18 | fn new(is_word: bool, index: usize) -> TrieNode { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_words` and `dfs` are never used [INFO] [stdout] --> src/problem/p212_word_search_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 28 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn dfs(board: &Vec>, node: &Rc>, words: &Vec, result: &mut HashSet, [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p17_letter_combinations_of_a_phone_number.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `letter_combinations` and `search` are never used [INFO] [stdout] --> src/problem/p17_letter_combinations_of_a_phone_number.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn search(digits: &Vec, str: &mut Vec, result: &mut Vec, pos: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p77_combinations.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combine` and `search` are never used [INFO] [stdout] --> src/problem/p77_combinations.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn search(n: i32, k: i32, x: i32, now: &mut Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p46_permutations.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `permute`, `search`, and `swap` are never used [INFO] [stdout] --> src/problem/p46_permutations.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn search(length: usize, output: &mut Vec, result: &mut Vec>, pos: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn swap(output: &mut Vec, a: usize, b: usize) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p39_combination_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used [INFO] [stdout] --> src/problem/p39_combination_sum.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn dfs(candidates: &Vec, target: i32, path: &mut Vec, sum: i32, result: &mut HashSet>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p22_generate_parentheses.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_parenthesis` and `backtrace` are never used [INFO] [stdout] --> src/problem/p22_generate_parentheses.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn backtrace(left: usize, right: usize, path: &mut Vec, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p79_word_search.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `exist` and `search` are never used [INFO] [stdout] --> src/problem/p79_word_search.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn search(board: &Vec>, word: &Vec, visited: &mut Vec>, x: i32, y: i32, pos: usize) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sorted_array_to_bst` and `array_to_bst` are never used [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn array_to_bst(array: &[i32]) -> Rc> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p53_maximum_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/problem/p53_maximum_subarray.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p918_maximum_sum_circular_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_subarray_sum_circular` is never used [INFO] [stdout] --> src/problem/p918_maximum_sum_circular_subarray.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn max_subarray_sum_circular(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p35_search_insert_position.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_insert` is never used [INFO] [stdout] --> src/problem/p35_search_insert_position.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p74_search_a_2d_matrix.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_matrix` is never used [INFO] [stdout] --> src/problem/p74_search_a_2d_matrix.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p33_search_in_rotated_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/problem/p33_search_in_rotated_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p34_find_first_and_last_position_of_element_in_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_range` is never used [INFO] [stdout] --> src/problem/p34_find_first_and_last_position_of_element_in_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p215_kth_largest_element_in_an_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_kth_largest` is never used [INFO] [stdout] --> src/problem/p215_kth_largest_element_in_an_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_kth_largest(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p502_ipo.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_maximized_capital` is never used [INFO] [stdout] --> src/problem/p502_ipo.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_maximized_capital(k: i32, w: i32, profits: Vec, capital: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p373_find_k_pairs_with_smallest_sums.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/p373_find_k_pairs_with_smallest_sums.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Pair<'a> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problem/p373_find_k_pairs_with_smallest_sums.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 18 | impl Pair<'_> { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 19 | fn new<'a>(nums1: &'a Vec, nums2: &'a Vec, x: usize, y: usize) -> Pair<'a> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_smallest_pairs` is never used [INFO] [stdout] --> src/problem/p373_find_k_pairs_with_smallest_sums.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn k_smallest_pairs(nums1: Vec, nums2: Vec, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p295_find_median_from_data_stream.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MedianFinder` is never constructed [INFO] [stdout] --> src/problem/p295_find_median_from_data_stream.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct MedianFinder { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_num`, and `find_median` are never used [INFO] [stdout] --> src/problem/p295_find_median_from_data_stream.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 20 | impl MedianFinder { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn add_num(&mut self, num: i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn find_median(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p67_add_binary.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_binary` is never used [INFO] [stdout] --> src/problem/p67_add_binary.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn add_binary(a: String, b: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p190_reverse_bits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_bits` is never used [INFO] [stdout] --> src/problem/p190_reverse_bits.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p191_number_of_1_bits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hamming_weight` is never used [INFO] [stdout] --> src/problem/p191_number_of_1_bits.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn hamming_weight(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p136_single_number.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/problem/p136_single_number.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p137_single_number_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/problem/p137_single_number_ii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p201_bitwise_and_of_numbers_range.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `range_bitwise_and` is never used [INFO] [stdout] --> src/problem/p201_bitwise_and_of_numbers_range.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p66_plus_one.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `plus_one` is never used [INFO] [stdout] --> src/problem/p66_plus_one.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p172_factorial_trailing_zeroes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trailing_zeroes` is never used [INFO] [stdout] --> src/problem/p172_factorial_trailing_zeroes.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p69_sqrtx.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `my_sqrt` is never used [INFO] [stdout] --> src/problem/p69_sqrtx.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p50_powx_n.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `my_pow` and `quick_pow` are never used [INFO] [stdout] --> src/problem/p50_powx_n.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn my_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn quick_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Slope` is never constructed [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Slope { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `gcd` are never used [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl Slope { [INFO] [stdout] | ---------- associated functions in this implementation [INFO] [stdout] 17 | fn new(point1: &Vec, point2: &Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_points` is never used [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn max_points(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p70_climbing_stairs.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `climb_stairs` is never used [INFO] [stdout] --> src/problem/p70_climbing_stairs.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p198_house_robber.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rob` is never used [INFO] [stdout] --> src/problem/p198_house_robber.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p139_word_break.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/problem/p139_word_break.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/problem/p139_word_break.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 15 | impl Trie { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 16 | fn new(is_word: bool) -> Rc> { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_break` is never used [INFO] [stdout] --> src/problem/p139_word_break.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 25 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p300_longest_increasing_subsequence.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_lis` is never used [INFO] [stdout] --> src/problem/p300_longest_increasing_subsequence.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p120_triangle.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/problem/p120_triangle.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p64_minimum_path_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_path_sum` is never used [INFO] [stdout] --> src/problem/p64_minimum_path_sum.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p63_unique_paths_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths_with_obstacles` is never used [INFO] [stdout] --> src/problem/p63_unique_paths_ii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p97_interleaving_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_interleave` is never used [INFO] [stdout] --> src/problem/p97_interleaving_string.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn is_interleave(s1: String, s2: String, s3: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p72_edit_distance.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_distance` is never used [INFO] [stdout] --> src/problem/p72_edit_distance.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p123_best_time_to_buy_and_sell_stock_iii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/problem/p123_best_time_to_buy_and_sell_stock_iii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p188_best_time_to_buy_and_sell_stock_iv.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/problem/p188_best_time_to_buy_and_sell_stock_iv.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn max_profit(k: i32, prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p221_maximal_square.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximal_square` is never used [INFO] [stdout] --> src/problem/p221_maximal_square.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn maximal_square(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3117_minimum_sum_of_values_by_dividing_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `INFINITE` is never used [INFO] [stdout] --> src/problem/p3117_minimum_sum_of_values_by_dividing_array.rs:10:7 [INFO] [stdout] | [INFO] [stdout] 10 | const INFINITE: i32 = (1 << 20) - 1; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `minimum_value_sum` and `dfs` are never used [INFO] [stdout] --> src/problem/p3117_minimum_sum_of_values_by_dividing_array.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 13 | pub fn minimum_value_sum(nums: Vec, and_values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn dfs(memory: &mut Vec>, i: usize, j: usize, current: i32, [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3137_minimum_number_of_operations_to_make_word_k_periodic.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_operations_to_make_k_periodic` is never used [INFO] [stdout] --> src/problem/p3137_minimum_number_of_operations_to_make_word_k_periodic.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn minimum_operations_to_make_k_periodic(word: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p551_student_attendance_record_i.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_record` is never used [INFO] [stdout] --> src/problem/p551_student_attendance_record_i.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn check_record(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p552_student_attendance_record_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_record` is never used [INFO] [stdout] --> src/problem/p552_student_attendance_record_ii.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn check_record(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3154_find_number_of_ways_to_reach_the_k_th_stair.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `ways_to_reach_stair` and `combine` are never used [INFO] [stdout] --> src/problem/p3154_find_number_of_ways_to_reach_the_k_th_stair.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn ways_to_reach_stair(k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | fn combine(n : i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_maximum_number`, `accumulate_price`, and `accumulate_bit_price` are never used [INFO] [stdout] --> src/problem/p3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn find_maximum_number(k: i64, x: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn accumulate_price(x: i32, num: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn accumulate_bit_price(x: i32, num: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3133_minimum_array_end.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_end` is never used [INFO] [stdout] --> src/problem/p3133_minimum_array_end.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_end(n: i32, x: i32) -> i64 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3145_find_products_of_elements_of_big_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_products_of_elements`, `middle_check`, `count_one`, `count_power`, and `power_mod` are never used [INFO] [stdout] --> src/problem/p3145_find_products_of_elements_of_big_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn find_products_of_elements(queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn middle_check(x: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn count_one(x: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn count_power(x: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn power_mod(x: i64, y: i64, mod_number: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3146_permutation_difference_between_two_strings.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_permutation_difference` is never used [INFO] [stdout] --> src/problem/p3146_permutation_difference_between_two_strings.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn find_permutation_difference(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p698_partition_to_k_equal_sum_subsets.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `can_partition_k_subsets` and `search` are never used [INFO] [stdout] --> src/problem/p698_partition_to_k_equal_sum_subsets.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn can_partition_k_subsets(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn search(state: usize, now: i32, dp: &mut Vec, target: i32, nums: &Vec) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3134_find_the_median_of_the_uniqueness_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `median_of_uniqueness_array` is never used [INFO] [stdout] --> src/problem/p3134_find_the_median_of_the_uniqueness_array.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn median_of_uniqueness_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3144_minimum_substring_partition_of_equal_character_frequency.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_substrings_in_partition` is never used [INFO] [stdout] --> src/problem/p3144_minimum_substring_partition_of_equal_character_frequency.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn minimum_substrings_in_partition(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p3142_check_if_grid_satisfies_conditions.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `satisfies_conditions` is never used [INFO] [stdout] --> src/problem/p3142_check_if_grid_satisfies_conditions.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn satisfies_conditions(grid: 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: struct `Solution` is never constructed [INFO] [stdout] --> src/double_week_125/problem1.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/double_week_125/problem1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/double_week_125/problem2.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/double_week_125/problem2.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/double_week_125/problem3.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_pairs_of_connectable_servers`, `dfs`, and `tree_dp` are never used [INFO] [stdout] --> src/double_week_125/problem3.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_pairs_of_connectable_servers(edges: Vec>, signal_speed: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn dfs(graph: &Vec>, conection: &mut Vec<(i64, usize)>, now: usize, pre: usize, distance: i64, start: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn tree_dp(graph: &Vec>, conection: &mut Vec<(i64, usize)>, result: &mut Vec, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut entry = self.number_map.entry(number).or_insert(0); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let height = grid.len(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 572 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p68_text_justification.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | for i in 0..(max_width - lines[0].len()) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/problem/p68_text_justification.rs:49:29 [INFO] [stdout] | [INFO] [stdout] 49 | for j in 0..space_length { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/problem/p68_text_justification.rs:77:17 [INFO] [stdout] | [INFO] [stdout] 77 | for j in 0..(max_width - line.len()) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `last_begin` [INFO] [stdout] --> src/problem/p56_merge_intervals.rs:19:18 [INFO] [stdout] | [INFO] [stdout] 19 | let (last_begin, last_end) = result[last]; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_last_begin` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:45:17 [INFO] [stdout] | [INFO] [stdout] 45 | for i in 0..level { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:120:13 [INFO] [stdout] | [INFO] [stdout] 120 | let mut dict = WordDictionary::new(); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p70_climbing_stairs.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | for i in 3..=n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p139_word_break.rs:26:13 [INFO] [stdout] | [INFO] [stdout] 26 | let mut root = Trie::new(false); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `signal_speed` [INFO] [stdout] --> src/double_week_125/problem3.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let signal_speed = signal_speed as i64; [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_signal_speed` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `connection` [INFO] [stdout] --> src/double_week_125/problem3.rs:20:17 [INFO] [stdout] | [INFO] [stdout] 20 | let mut connection = vec![(0,0);n]; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_connection` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `next` [INFO] [stdout] --> src/double_week_125/problem3.rs:21:13 [INFO] [stdout] | [INFO] [stdout] 21 | for next in &graph[0] { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_next` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/double_week_125/problem3.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | let mut connection = vec![(0,0);n]; [INFO] [stdout] | ----^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/double_week_125/problem3.rs:25:13 [INFO] [stdout] | [INFO] [stdout] 25 | let mut result = Vec::with_capacity(n); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p447_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/p447_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/problem/p2368_reachable_nodes_with_restrictions.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reachable_nodes` is never used [INFO] [stdout] --> src/problem/p2368_reachable_nodes_with_restrictions.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 12 | pub fn reachable_nodes(n: i32, edges: Vec>, restricted: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p225_implement_stack_using_queues.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p232_implement_queue_using_stacks.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1976_number_of_ways_to_arrive_at_destination.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/p1976_number_of_ways_to_arrive_at_destination.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_paths` is never used [INFO] [stdout] --> src/problem/p1976_number_of_ways_to_arrive_at_destination.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn count_paths(n: i32, roads: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FindElements` is never constructed [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct FindElements { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `find` are never used [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 38 | impl FindElements { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 39 | [INFO] [stdout] 40 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 69 | fn find(&self, target: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2312_selling_pieces_of_wood.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `selling_wood`, `hash`, and `dfs` are never used [INFO] [stdout] --> src/problem/p2312_selling_pieces_of_wood.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn selling_wood(m: i32, n: i32, prices: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn hash(x: usize, y: usize)-> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn dfs(x: usize, y: usize, dp: &mut Vec>, prices_map: &HashMap) -> i64 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumArray` is never constructed [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct NumArray { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `sum_range` are never used [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl NumArray { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 17 | fn new(nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn sum_range(&self, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_visited_cells` is never used [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn minimum_visited_cells(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2549_count_distinct_numbers_on_board.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distinct_integers` is never used [INFO] [stdout] --> src/problem/p2549_count_distinct_numbers_on_board.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn distinct_integers(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_edge`, and `shortest_path` are never used [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 17 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 18 | fn new(n: i32, edges: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn add_edge(&mut self, edge: Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn shortest_path(&self, node1: i32, node2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `first_day_been_in_all_rooms` is never used [INFO] [stdout] --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn first_day_been_in_all_rooms(next_visit: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p26_remove_duplicates_from_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/problem/p26_remove_duplicates_from_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p380_insert_delete_getrandom_o1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `str_str` is never used [INFO] [stdout] --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p209_minimum_size_subarray_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sub_array_len` is never used [INFO] [stdout] --> src/problem/p209_minimum_size_subarray_sum.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p36_valid_sudoku.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_sudoku` is never used [INFO] [stdout] --> src/problem/p36_valid_sudoku.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p48_rotate_image.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/problem/p48_rotate_image.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `set_zeroes` is never used [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p289_game_of_life.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `game_of_life` is never used [INFO] [stdout] --> src/problem/p289_game_of_life.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn game_of_life(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p383_ransom_note.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_construct` is never used [INFO] [stdout] --> src/problem/p383_ransom_note.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn can_construct(ransom_note: String, magazine: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p205_isomorphic_strings.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/problem/p205_isomorphic_strings.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn is_isomorphic(s: String, t: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p49_group_anagrams.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/problem/p49_group_anagrams.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p228_summary_ranges.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `summary_ranges` is never used [INFO] [stdout] --> src/problem/p228_summary_ranges.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn summary_ranges(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p57_insert_interval.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insert` is never used [INFO] [stdout] --> src/problem/p57_insert_interval.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn insert(intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used [INFO] [stdout] --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_min_arrow_shots(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p155_min_stack.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/problem/p155_min_stack.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used [INFO] [stdout] --> src/problem/p155_min_stack.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 20 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn get_min(&self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_two_lists` is never used [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn merge_two_lists(list1: Option>, list2: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p100_same_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_same_tree` is never used [INFO] [stdout] --> src/problem/p100_same_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn is_same_tree(p: Option>>, q: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `flatten_tree` and `flatten` are never used [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn flatten_tree(root: &Rc>) -> Rc> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p112_path_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs` and `has_path_sum` are never used [INFO] [stdout] --> src/problem/p112_path_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn dfs(node: &Rc>, current_sum: i32, target_sum: i32) -> bool { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p129_sum_root_to_leaf_numbers.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs_sum` and `sum_numbers` are never used [INFO] [stdout] --> src/problem/p129_sum_root_to_leaf_numbers.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn dfs_sum(node: &Rc>, last_num: i32, result: &mut i32) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p124_binary_tree_maximum_path_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_sum` and `max_path_sum` are never used [INFO] [stdout] --> src/problem/p124_binary_tree_maximum_path_sum.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn max_sum(node: &Rc>, result: &mut i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.rs:44:8 [INFO] [stdout] | [INFO] [stdout] 42 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 43 | [INFO] [stdout] 44 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 73 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p222_count_complete_tree_nodes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_nodes` is never used [INFO] [stdout] --> src/problem/p222_count_complete_tree_nodes.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p199_binary_tree_right_side_view.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `right_side_view` is never used [INFO] [stdout] --> src/problem/p199_binary_tree_right_side_view.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p637_average_of_levels_in_binary_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `average_of_levels` is never used [INFO] [stdout] --> src/problem/p637_average_of_levels_in_binary_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn average_of_levels(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_iterate` and `get_minimum_difference` are never used [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_bst.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn inorder_iterate(node: &Rc>, arrap: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn get_minimum_difference(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_bst.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_iterate` and `kth_smallest` are never used [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_bst.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn inorder_iterate(node: &Rc>, count: &mut i32, target: i32) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p98_validate_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_iterate` and `is_valid_bst` are never used [INFO] [stdout] --> src/problem/p98_validate_binary_search_tree.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | fn inorder_iterate(node: &Rc>, array: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p200_number_of_islands.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_in_grid`, `dfs`, and `num_islands` are never used [INFO] [stdout] --> src/problem/p200_number_of_islands.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn is_in_grid(x: i32, y: i32, grid: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn dfs(grid: &mut Vec>, x: i32, y: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p130_surrounded_regions.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs` and `solve` are never used [INFO] [stdout] --> src/problem/p130_surrounded_regions.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | fn dfs(board: &mut Vec>, x: i32, y: i32, m: i32, n: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn solve(board: &mut Vec>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p399_evaluate_division.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/p399_evaluate_division.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, `merge`, and `is_connected` are never used [INFO] [stdout] --> src/problem/p399_evaluate_division.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] 31 | fn find(&mut self, x: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn merge(&mut self, x: usize, y: usize, value: f64) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn is_connected(&mut self, x: usize, y: usize) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calc_equation` is never used [INFO] [stdout] --> src/problem/p399_evaluate_division.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 65 | pub fn calc_equation(equations: Vec>, values: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p207_course_schedule.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_finish` is never used [INFO] [stdout] --> src/problem/p207_course_schedule.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p210_course_schedule_ii.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_order` is never used [INFO] [stdout] --> src/problem/p210_course_schedule_ii.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `starts_with` is never used [INFO] [stdout] --> src/problem/p208_implement_trie_prefix_tree.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 32 | impl Trie { [INFO] [stdout] | --------- method in this implementation [INFO] [stdout] ... [INFO] [stdout] 85 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p211_design_add_and_search_words_data_structure.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p17_letter_combinations_of_a_phone_number.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `letter_combinations` and `search` are never used [INFO] [stdout] --> src/problem/p17_letter_combinations_of_a_phone_number.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn search(digits: &Vec, str: &mut Vec, result: &mut Vec, pos: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p77_combinations.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combine` and `search` are never used [INFO] [stdout] --> src/problem/p77_combinations.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn search(n: i32, k: i32, x: i32, now: &mut Vec, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p46_permutations.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `permute`, `search`, and `swap` are never used [INFO] [stdout] --> src/problem/p46_permutations.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn search(length: usize, output: &mut Vec, result: &mut Vec>, pos: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn swap(output: &mut Vec, a: usize, b: usize) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p39_combination_sum.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used [INFO] [stdout] --> src/problem/p39_combination_sum.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn dfs(candidates: &Vec, target: i32, path: &mut Vec, sum: i32, result: &mut HashSet>) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p22_generate_parentheses.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_parenthesis` and `backtrace` are never used [INFO] [stdout] --> src/problem/p22_generate_parentheses.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn backtrace(left: usize, right: usize, path: &mut Vec, result: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p79_word_search.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `exist` and `search` are never used [INFO] [stdout] --> src/problem/p79_word_search.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn search(board: &Vec>, word: &Vec, visited: &mut Vec>, x: i32, y: i32, pos: usize) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sorted_array_to_bst` and `array_to_bst` are never used [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | fn array_to_bst(array: &[i32]) -> Rc> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p53_maximum_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/problem/p53_maximum_subarray.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p918_maximum_sum_circular_subarray.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_subarray_sum_circular` is never used [INFO] [stdout] --> src/problem/p918_maximum_sum_circular_subarray.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 11 | pub fn max_subarray_sum_circular(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p35_search_insert_position.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_insert` is never used [INFO] [stdout] --> src/problem/p35_search_insert_position.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p33_search_in_rotated_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/problem/p33_search_in_rotated_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p215_kth_largest_element_in_an_array.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_kth_largest` is never used [INFO] [stdout] --> src/problem/p215_kth_largest_element_in_an_array.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_kth_largest(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p502_ipo.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_maximized_capital` is never used [INFO] [stdout] --> src/problem/p502_ipo.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn find_maximized_capital(k: i32, w: i32, profits: Vec, capital: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p295_find_median_from_data_stream.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p190_reverse_bits.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_bits` is never used [INFO] [stdout] --> src/problem/p190_reverse_bits.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p172_factorial_trailing_zeroes.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trailing_zeroes` is never used [INFO] [stdout] --> src/problem/p172_factorial_trailing_zeroes.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p50_powx_n.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `my_pow` and `quick_pow` are never used [INFO] [stdout] --> src/problem/p50_powx_n.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 10 | pub fn my_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | fn quick_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Slope` is never constructed [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | struct Slope { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `gcd` are never used [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 16 | impl Slope { [INFO] [stdout] | ---------- associated functions in this implementation [INFO] [stdout] 17 | fn new(point1: &Vec, point2: &Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_points` is never used [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn max_points(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p300_longest_increasing_subsequence.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_lis` is never used [INFO] [stdout] --> src/problem/p300_longest_increasing_subsequence.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn length_of_lis(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p551_student_attendance_record_i.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_record` is never used [INFO] [stdout] --> src/problem/p551_student_attendance_record_i.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn check_record(s: String) -> 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/double_week_125/problem1.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/double_week_125/problem1.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/double_week_125/problem2.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/double_week_125/problem2.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/double_week_125/problem3.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_pairs_of_connectable_servers`, `dfs`, and `tree_dp` are never used [INFO] [stdout] --> src/double_week_125/problem3.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_pairs_of_connectable_servers(edges: Vec>, signal_speed: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn dfs(graph: &Vec>, conection: &mut Vec<(i64, usize)>, now: usize, pre: usize, distance: i64, start: usize) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn tree_dp(graph: &Vec>, conection: &mut Vec<(i64, usize)>, result: &mut Vec, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 310 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 11.72s [INFO] running `Command { std: "docker" "inspect" "084abf1726b041ba2f74887db4439100e54558a2d6db98ae2d2c76fe233932b4", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "084abf1726b041ba2f74887db4439100e54558a2d6db98ae2d2c76fe233932b4", kill_on_drop: false }` [INFO] [stdout] 084abf1726b041ba2f74887db4439100e54558a2d6db98ae2d2c76fe233932b4 [INFO] checking jackfiled/leetcode-rust against try#f9935d29d867449445ee008640ccca1bf1ae0889+rustflags=-Dtail_expr_drop_order for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust" "/workspace/builds/worker-4-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/jackfiled/leetcode-rust on toolchain f9935d29d867449445ee008640ccca1bf1ae0889 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] removed /workspace/builds/worker-4-tc2/source/.cargo/config.toml [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-4-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" "+f9935d29d867449445ee008640ccca1bf1ae0889" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 2117cc851204a3b739747a643565ab86b8c9f916e9a3d3ecd2a2af352d187f30 [INFO] running `Command { std: "docker" "start" "-a" "2117cc851204a3b739747a643565ab86b8c9f916e9a3d3ecd2a2af352d187f30", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "2117cc851204a3b739747a643565ab86b8c9f916e9a3d3ecd2a2af352d187f30", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2117cc851204a3b739747a643565ab86b8c9f916e9a3d3ecd2a2af352d187f30", kill_on_drop: false }` [INFO] [stdout] 2117cc851204a3b739747a643565ab86b8c9f916e9a3d3ecd2a2af352d187f30 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-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 -Dtail_expr_drop_order" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 498842e5565f891a15d8ba02bfaebab6acae8e6ca4c1306f414931b67f76803f [INFO] running `Command { std: "docker" "start" "-a" "498842e5565f891a15d8ba02bfaebab6acae8e6ca4c1306f414931b67f76803f", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.153 [INFO] [stderr] Compiling cc v1.0.94 [INFO] [stderr] Compiling pkg-config v0.3.30 [INFO] [stderr] Compiling proc-macro2 v1.0.79 [INFO] [stderr] Compiling vcpkg v0.2.15 [INFO] [stderr] Compiling unicode-ident v1.0.12 [INFO] [stderr] Compiling autocfg v1.2.0 [INFO] [stderr] Checking memchr v2.7.2 [INFO] [stderr] Checking pin-utils v0.1.0 [INFO] [stderr] Checking pin-project-lite v0.2.14 [INFO] [stderr] Checking value-bag v1.8.1 [INFO] [stderr] Checking once_cell v1.19.0 [INFO] [stderr] Checking cfg-if v1.0.0 [INFO] [stderr] Checking bytes v1.6.0 [INFO] [stderr] Checking futures-sink v0.3.30 [INFO] [stderr] Checking itoa v1.0.11 [INFO] [stderr] Checking fnv v1.0.7 [INFO] [stderr] Checking futures-core v0.3.30 [INFO] [stderr] Checking byteorder v1.5.0 [INFO] [stderr] Compiling version_check v0.9.4 [INFO] [stderr] Checking futures-task v0.3.30 [INFO] [stderr] Checking futures-io v0.3.30 [INFO] [stderr] Checking tinyvec_macros v0.1.1 [INFO] [stderr] Checking futures-channel v0.3.30 [INFO] [stderr] Compiling serde v1.0.197 [INFO] [stderr] Checking log v0.4.21 [INFO] [stderr] Checking openssl-probe v0.1.5 [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 tinyvec v1.6.0 [INFO] [stderr] Compiling slab v0.4.9 [INFO] [stderr] Checking tracing-core v0.1.32 [INFO] [stderr] Checking futures-io-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures-channel-preview v0.3.0-alpha.19 [INFO] [stderr] Compiling openssl v0.10.64 [INFO] [stderr] Compiling unicase v2.7.0 [INFO] [stderr] Checking foreign-types-shared v0.1.1 [INFO] [stderr] Checking futures v0.1.31 [INFO] [stderr] Checking percent-encoding v2.3.1 [INFO] [stderr] Checking foreign-types v0.3.2 [INFO] [stderr] Compiling native-tls v0.2.11 [INFO] [stderr] Checking form_urlencoded v1.2.1 [INFO] [stderr] Checking bitflags v2.5.0 [INFO] [stderr] Checking hashbrown v0.14.3 [INFO] [stderr] Checking http v0.2.12 [INFO] [stderr] Checking equivalent v1.0.1 [INFO] [stderr] Checking unicode-bidi v0.3.15 [INFO] [stderr] Compiling httparse v1.8.0 [INFO] [stderr] Checking lazy_static v1.4.0 [INFO] [stderr] Compiling curl v0.4.46 [INFO] [stderr] Compiling serde_json v1.0.115 [INFO] [stderr] Checking ryu v1.0.17 [INFO] [stderr] Checking tracing v0.1.40 [INFO] [stderr] Checking cfg-if v0.1.10 [INFO] [stderr] Checking try-lock v0.2.5 [INFO] [stderr] Checking itoa v0.4.8 [INFO] [stderr] Compiling quote v1.0.36 [INFO] [stderr] Checking want v0.3.1 [INFO] [stderr] Checking crossbeam-utils v0.6.6 [INFO] [stderr] Compiling mime_guess v2.0.4 [INFO] [stderr] Checking tower-service v0.3.2 [INFO] [stderr] Checking httpdate v1.0.3 [INFO] [stderr] Checking mime v0.3.17 [INFO] [stderr] Compiling isahc v0.7.6 [INFO] [stderr] Compiling syn v2.0.58 [INFO] [stderr] Checking aho-corasick v1.1.3 [INFO] [stderr] Checking sluice v0.4.2 [INFO] [stderr] Checking regex-syntax v0.8.3 [INFO] [stderr] Checking crossbeam-channel v0.3.9 [INFO] [stderr] Checking ppv-lite86 v0.2.17 [INFO] [stderr] Checking base64 v0.21.7 [INFO] [stderr] Checking dtoa v0.4.8 [INFO] [stderr] Checking indexmap v2.2.6 [INFO] [stderr] Checking unicode-normalization v0.1.23 [INFO] [stderr] Checking encoding_rs v0.8.34 [INFO] [stderr] Checking ipnet v2.9.0 [INFO] [stderr] Checking http-body v0.4.6 [INFO] [stderr] Checking sync_wrapper v0.1.2 [INFO] [stderr] Compiling openssl-sys v0.9.102 [INFO] [stderr] Compiling libnghttp2-sys v0.1.10+1.61.0 [INFO] [stderr] Compiling libz-sys v1.1.16 [INFO] [stderr] Compiling curl-sys v0.4.72+curl-8.6.0 [INFO] [stderr] Checking rustls-pemfile v1.0.4 [INFO] [stderr] Checking num_cpus v1.16.0 [INFO] [stderr] Checking socket2 v0.5.6 [INFO] [stderr] Checking iovec v0.1.4 [INFO] [stderr] Checking mio v0.8.11 [INFO] [stderr] Checking idna v0.5.0 [INFO] [stderr] Checking bytes v0.4.12 [INFO] [stderr] Checking getrandom v0.2.14 [INFO] [stderr] Checking rand_core v0.6.4 [INFO] [stderr] Checking rand_chacha v0.3.1 [INFO] [stderr] Checking tokio-io v0.1.13 [INFO] [stderr] Checking http v0.1.21 [INFO] [stderr] Checking url v2.5.0 [INFO] [stderr] Checking rand v0.8.5 [INFO] [stderr] Checking futures-util-preview v0.3.0-alpha.19 [INFO] [stderr] Checking regex-automata v0.4.6 [INFO] [stderr] Checking serde_urlencoded v0.6.1 [INFO] [stderr] Checking serde_urlencoded v0.7.1 [INFO] [stderr] Checking futures-executor-preview v0.3.0-alpha.19 [INFO] [stderr] Checking futures-preview v0.3.0-alpha.19 [INFO] [stderr] Checking regex v1.10.4 [INFO] [stderr] Compiling tokio-macros v2.2.0 [INFO] [stderr] Compiling futures-macro v0.3.30 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling serde_derive v1.0.197 [INFO] [stderr] Checking surf v1.0.3 [INFO] [stderr] Checking tokio v1.37.0 [INFO] [stderr] Checking futures-util v0.3.30 [INFO] [stderr] Checking tokio-util v0.7.10 [INFO] [stderr] Checking tokio-native-tls v0.3.1 [INFO] [stderr] Checking futures-executor v0.3.30 [INFO] [stderr] Checking futures v0.3.30 [INFO] [stderr] Checking h2 v0.3.26 [INFO] [stderr] Checking hyper v0.14.28 [INFO] [stderr] Checking hyper-tls v0.5.0 [INFO] [stderr] Checking reqwest v0.11.27 [INFO] [stderr] Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p2_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: unused import: `to_tree` [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_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: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:19:16 [INFO] [stdout] | [INFO] [stdout] 19 | if (c == ',') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 19 - if (c == ',') { [INFO] [stdout] 19 + if c == ',' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:23:16 [INFO] [stdout] | [INFO] [stdout] 23 | if (c == '#') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - if (c == '#') { [INFO] [stdout] 23 + if c == '#' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p42_trapping_rain_water.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (1..length) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (1..length) { [INFO] [stdout] 14 + for i in 1..length { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p54_spiral_matrix.rs:40:24 [INFO] [stdout] | [INFO] [stdout] 40 | if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 40 - if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] 40 + if matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (0..n / 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (0..n / 2) { [INFO] [stdout] 14 + for i in 0..n / 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | for i in (0..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - for i in (0..n) { [INFO] [stdout] 23 + for i in 0..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:24:22 [INFO] [stdout] | [INFO] [stdout] 24 | for j in (0..i) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 24 - for j in (0..i) { [INFO] [stdout] 24 + for j in 0..i { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:37:18 [INFO] [stdout] | [INFO] [stdout] 37 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 37 - for i in (1..n) { [INFO] [stdout] 37 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problem/p219_contains_duplicate_ii.rs:16:36 [INFO] [stdout] | [INFO] [stdout] 16 | let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 16 - let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] 16 + let distance:i32 = *last_pos - i as i32; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:8:42 [INFO] [stdout] | [INFO] [stdout] 8 | 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/p104_maximum_depth_of_binary_tree.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/p100_same_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/p226_invert_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/p101_symmetric_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/p114_flatten_binary_tree_to_linked_list.rs:6:25 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 32 - if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] 32 + if root.borrow().left.is_none() && root.borrow().right.is_none() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p112_path_sum.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/p129_sum_root_to_leaf_numbers.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/p124_binary_tree_maximum_path_sum.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/p173_binary_search_tree_iterator.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/p173_binary_search_tree_iterator.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/p222_count_complete_tree_nodes.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/p199_binary_tree_right_side_view.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/p637_average_of_levels_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/p530_minimum_absolute_difference_in_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: `to_tree` [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_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: `to_tree` [INFO] [stdout] --> src/problem/p98_validate_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: `to_tree` [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_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 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/p447_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/problem/p2368_reachable_nodes_with_restrictions.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/p1976_number_of_ways_to_arrive_at_destination.rs:78:9 [INFO] [stdout] | [INFO] [stdout] 78 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p1261_find_elements_in_a_contaminated_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/p1261_find_elements_in_a_contaminated_binary_tree.rs:84:9 [INFO] [stdout] | [INFO] [stdout] 84 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2312_selling_pieces_of_wood.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p303_range_sum_query_immutable.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2549_count_distinct_numbers_on_board.rs:23:9 [INFO] [stdout] | [INFO] [stdout] 23 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p2642_design_graph_with_shortest_path_calculator.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/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:19:16 [INFO] [stdout] | [INFO] [stdout] 19 | if (c == ',') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 19 - if (c == ',') { [INFO] [stdout] 19 + if c == ',' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:23:16 [INFO] [stdout] | [INFO] [stdout] 23 | if (c == '#') { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - if (c == '#') { [INFO] [stdout] 23 + if c == '#' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p26_remove_duplicates_from_sorted_array.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p42_trapping_rain_water.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (1..length) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (1..length) { [INFO] [stdout] 14 + for i in 1..length { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:22:9 [INFO] [stdout] | [INFO] [stdout] 22 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p209_minimum_size_subarray_sum.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p36_valid_sudoku.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p54_spiral_matrix.rs:40:24 [INFO] [stdout] | [INFO] [stdout] 40 | if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 40 - if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) { [INFO] [stdout] 40 + if matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:14:18 [INFO] [stdout] | [INFO] [stdout] 14 | for i in (0..n / 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 14 - for i in (0..n / 2) { [INFO] [stdout] 14 + for i in 0..n / 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:23:18 [INFO] [stdout] | [INFO] [stdout] 23 | for i in (0..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 23 - for i in (0..n) { [INFO] [stdout] 23 + for i in 0..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p48_rotate_image.rs:24:22 [INFO] [stdout] | [INFO] [stdout] 24 | for j in (0..i) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 24 - for j in (0..i) { [INFO] [stdout] 24 + for j in 0..i { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p48_rotate_image.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:37:18 [INFO] [stdout] | [INFO] [stdout] 37 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 37 - for i in (1..n) { [INFO] [stdout] 37 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p73_set_matrix_zeroes.rs:71:9 [INFO] [stdout] | [INFO] [stdout] 71 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p289_game_of_life.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p383_ransom_note.rs:43:9 [INFO] [stdout] | [INFO] [stdout] 43 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p205_isomorphic_strings.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/problem/p219_contains_duplicate_ii.rs:16:36 [INFO] [stdout] | [INFO] [stdout] 16 | let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 16 - let distance:i32 = (*last_pos - i as i32); [INFO] [stdout] 16 + let distance:i32 = *last_pos - i as i32; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p228_summary_ranges.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p57_insert_interval.rs:44:9 [INFO] [stdout] | [INFO] [stdout] 44 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:39:9 [INFO] [stdout] | [INFO] [stdout] 39 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p155_min_stack.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:6:19 [INFO] [stdout] | [INFO] [stdout] 6 | use std::borrow::{Borrow, BorrowMut}; [INFO] [stdout] | ^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:8:42 [INFO] [stdout] | [INFO] [stdout] 8 | use crate::util::linked_list::{ListNode, to_list}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p21_merge_two_sorted_lists.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.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: `super::*` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p100_same_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/p100_same_tree.rs:90:9 [INFO] [stdout] | [INFO] [stdout] 90 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:6:25 [INFO] [stdout] | [INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 32 - if (root.borrow().left.is_none() && root.borrow().right.is_none()) { [INFO] [stdout] 32 + if root.borrow().left.is_none() && root.borrow().right.is_none() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:73:9 [INFO] [stdout] | [INFO] [stdout] 73 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p112_path_sum.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/p112_path_sum.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p129_sum_root_to_leaf_numbers.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/p129_sum_root_to_leaf_numbers.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p124_binary_tree_maximum_path_sum.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/p124_binary_tree_maximum_path_sum.rs:70:9 [INFO] [stdout] | [INFO] [stdout] 70 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed` [INFO] [stdout] --> src/problem/p173_binary_search_tree_iterator.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/p173_binary_search_tree_iterator.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/p173_binary_search_tree_iterator.rs:112:9 [INFO] [stdout] | [INFO] [stdout] 112 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p222_count_complete_tree_nodes.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/p222_count_complete_tree_nodes.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p199_binary_tree_right_side_view.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/p199_binary_tree_right_side_view.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p637_average_of_levels_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: `super::*` [INFO] [stdout] --> src/problem/p637_average_of_levels_in_binary_tree.rs:70:9 [INFO] [stdout] | [INFO] [stdout] 70 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_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: `super::*` [INFO] [stdout] --> src/problem/p530_minimum_absolute_difference_in_bst.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/p230_kth_smallest_element_in_a_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: `super::*` [INFO] [stdout] --> src/problem/p230_kth_smallest_element_in_a_bst.rs:67:9 [INFO] [stdout] | [INFO] [stdout] 67 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p98_validate_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/p98_validate_binary_search_tree.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p200_number_of_islands.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p130_surrounded_regions.rs:69:9 [INFO] [stdout] | [INFO] [stdout] 69 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p207_course_schedule.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p210_course_schedule_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/p17_letter_combinations_of_a_phone_number.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p77_combinations.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p46_permutations.rs:44:9 [INFO] [stdout] | [INFO] [stdout] 44 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p22_generate_parentheses.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p79_word_search.rs:74:9 [INFO] [stdout] | [INFO] [stdout] 74 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/problem/p108_convert_sorted_array_to_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/p108_convert_sorted_array_to_binary_search_tree.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 65 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p53_maximum_subarray.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p918_maximum_sum_circular_subarray.rs:41:9 [INFO] [stdout] | [INFO] [stdout] 41 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p35_search_insert_position.rs:37:9 [INFO] [stdout] | [INFO] [stdout] 37 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p33_search_in_rotated_sorted_array.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:32:9 [INFO] [stdout] | [INFO] [stdout] 32 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p215_kth_largest_element_in_an_array.rs:33:9 [INFO] [stdout] | [INFO] [stdout] 33 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p502_ipo.rs:46:9 [INFO] [stdout] | [INFO] [stdout] 46 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p190_reverse_bits.rs:19:9 [INFO] [stdout] | [INFO] [stdout] 19 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p172_factorial_trailing_zeroes.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p50_powx_n.rs:36:9 [INFO] [stdout] | [INFO] [stdout] 36 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p149_max_points_on_a_line.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p300_longest_increasing_subsequence.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/problem/p551_student_attendance_record_i.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | use super::*; [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: variable does not need to be mutable [INFO] [stdout] --> src/problem/p2671_frequency_tracker.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut entry = self.number_map.entry(number).or_insert(0); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:12:13 [INFO] [stdout] | [INFO] [stdout] 12 | let height = grid.len(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p68_text_justification.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | for i in 0..(max_width - lines[0].len()) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/problem/p68_text_justification.rs:49:29 [INFO] [stdout] | [INFO] [stdout] 49 | for j in 0..space_length { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `j` [INFO] [stdout] --> src/problem/p68_text_justification.rs:77:17 [INFO] [stdout] | [INFO] [stdout] 77 | for j in 0..(max_width - line.len()) { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_j` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `last_begin` [INFO] [stdout] --> src/problem/p56_merge_intervals.rs:19:18 [INFO] [stdout] | [INFO] [stdout] 19 | let (last_begin, last_end) = result[last]; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_last_begin` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p104_maximum_depth_of_binary_tree.rs:45:17 [INFO] [stdout] | [INFO] [stdout] 45 | for i in 0..level { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/problem/p70_climbing_stairs.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | for i in 3..=n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/problem/p139_word_break.rs:26:13 [INFO] [stdout] | [INFO] [stdout] 26 | let mut root = Trie::new(false); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `signal_speed` [INFO] [stdout] --> src/double_week_125/problem3.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | let signal_speed = signal_speed as i64; [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_signal_speed` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `connection` [INFO] [stdout] --> src/double_week_125/problem3.rs:20:17 [INFO] [stdout] | [INFO] [stdout] 20 | let mut connection = vec![(0,0);n]; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_connection` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `next` [INFO] [stdout] --> src/double_week_125/problem3.rs:21:13 [INFO] [stdout] | [INFO] [stdout] 21 | for next in &graph[0] { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_next` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/double_week_125/problem3.rs:20:13 [INFO] [stdout] | [INFO] [stdout] 20 | let mut connection = vec![(0,0);n]; [INFO] [stdout] | ----^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/double_week_125/problem3.rs:25:13 [INFO] [stdout] | [INFO] [stdout] 25 | let mut result = Vec::with_capacity(n); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/problem/p1_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/p1_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/p9_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/p9_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/p20_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/p20_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/p2_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/p2_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/p3_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/p3_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/p162_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/p162_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/p52_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/p52_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/p912_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/p912_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/p6_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/p6_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/p7_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/p7_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/p4_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/p4_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/p743_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/p743_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/p447_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/p447_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] | ^^^^^^^^^^^^^^^^^^^^^^ [WARN] too many lines in the log, truncating it